xref: /petsc/src/dm/impls/plex/plexsubmesh.c (revision e38fbfedf91ebfe7d6b0adedd45146e1b061a142)
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"
16359eef20bSToby Isaac /* take (oldEnd, added) pairs, ordered by height and convert them to (oldstart, newstart) pairs, ordered by ascending
16459eef20bSToby 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;
17059eef20bSToby Isaac   /* sort by (oldend): yes this is an O(n^2) sort, we expect depth <= 3 */
1710974a383SToby Isaac   for (d = 0; d < depth; d++) {
1722582d50cSToby Isaac     PetscInt firstd = d;
1730974a383SToby Isaac     PetscInt firstStart = depthShift[2*d];
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) */
1950974a383SToby Isaac   for (d = 0; d <= depth; d++) {
1962582d50cSToby Isaac     off += depthShift[2*d+1];
19759eef20bSToby Isaac     depthShift[2*d+1] = depthShift[2*d] + off;
1982582d50cSToby Isaac   }
1992582d50cSToby Isaac   PetscFunctionReturn(0);
2002582d50cSToby Isaac }
2012582d50cSToby Isaac 
2022582d50cSToby Isaac #undef __FUNCT__
2032582d50cSToby Isaac #define __FUNCT__ "DMPlexShiftPoint_Internal"
2042582d50cSToby Isaac /* depthShift is a list of (old, new) pairs */
2052582d50cSToby Isaac PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthShift[])
2062582d50cSToby Isaac {
2072582d50cSToby Isaac   PetscInt d;
2082582d50cSToby Isaac   PetscInt newOff = 0;
2092582d50cSToby Isaac 
2102582d50cSToby Isaac   for (d = 0; d <= depth; d++) {
2112582d50cSToby Isaac     if (p < depthShift[2*d]) return p + newOff;
2122582d50cSToby Isaac     else newOff = depthShift[2*d+1] - depthShift[2*d];
2132582d50cSToby Isaac   }
2140974a383SToby Isaac   return p + newOff;
2152582d50cSToby Isaac }
2162582d50cSToby Isaac 
2172582d50cSToby Isaac #undef __FUNCT__
2182582d50cSToby Isaac #define __FUNCT__ "DMPlexShiftPointInverse_Internal"
2192582d50cSToby Isaac /* depthShift is a list of (old, new) pairs */
2202582d50cSToby Isaac PETSC_STATIC_INLINE PetscInt DMPlexShiftPointInverse_Internal(PetscInt p, PetscInt depth, PetscInt depthShift[])
2212582d50cSToby Isaac {
2222582d50cSToby Isaac   PetscInt d;
2232582d50cSToby Isaac   PetscInt newOff = 0;
2242582d50cSToby Isaac 
2252582d50cSToby Isaac   for (d = 0; d <= depth; d++) {
2262582d50cSToby Isaac     if (p < depthShift[2*d+1]) return p + newOff;
2272582d50cSToby Isaac     else newOff = depthShift[2*d] - depthShift[2*d+1];
2282582d50cSToby Isaac   }
2290974a383SToby Isaac   return p + newOff;
230cd0c2139SMatthew G Knepley }
231cd0c2139SMatthew G Knepley 
232cd0c2139SMatthew G Knepley #undef __FUNCT__
233cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSizes_Internal"
234cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew)
235cd0c2139SMatthew G Knepley {
236cd0c2139SMatthew G Knepley   PetscInt       depth = 0, d, pStart, pEnd, p;
237cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
238cd0c2139SMatthew G Knepley 
239cd0c2139SMatthew G Knepley   PetscFunctionBegin;
240cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
241cd0c2139SMatthew G Knepley   if (depth < 0) PetscFunctionReturn(0);
242cd0c2139SMatthew G Knepley   /* Step 1: Expand chart */
243cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
2440974a383SToby Isaac   pEnd = DMPlexShiftPoint_Internal(pEnd,depth,depthShift);
245cd0c2139SMatthew G Knepley   ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr);
246cd0c2139SMatthew G Knepley   /* Step 2: Set cone and support sizes */
247cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
248cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr);
249cd0c2139SMatthew G Knepley     for (p = pStart; p < pEnd; ++p) {
2502582d50cSToby Isaac       PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthShift);
251cd0c2139SMatthew G Knepley       PetscInt size;
252cd0c2139SMatthew G Knepley 
253cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr);
254cd0c2139SMatthew G Knepley       ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr);
255cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr);
256cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr);
257cd0c2139SMatthew G Knepley     }
258cd0c2139SMatthew G Knepley   }
259cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
260cd0c2139SMatthew G Knepley }
261cd0c2139SMatthew G Knepley 
262cd0c2139SMatthew G Knepley #undef __FUNCT__
263cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoints_Internal"
264cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew)
265cd0c2139SMatthew G Knepley {
2662582d50cSToby Isaac   PetscInt      *newpoints;
2672582d50cSToby Isaac   PetscInt       depth = 0, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, pStart, pEnd, p;
268cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
269cd0c2139SMatthew G Knepley 
270cd0c2139SMatthew G Knepley   PetscFunctionBegin;
271cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
272cd0c2139SMatthew G Knepley   if (depth < 0) PetscFunctionReturn(0);
273cd0c2139SMatthew G Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
274dcbb62e8SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dmNew, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr);
2752582d50cSToby Isaac   ierr = PetscMalloc1(PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),&newpoints);CHKERRQ(ierr);
276cd0c2139SMatthew G Knepley   /* Step 5: Set cones and supports */
277cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
278cd0c2139SMatthew G Knepley   for (p = pStart; p < pEnd; ++p) {
279cd0c2139SMatthew G Knepley     const PetscInt *points = NULL, *orientations = NULL;
2802582d50cSToby Isaac     PetscInt        size,sizeNew, i, newp = DMPlexShiftPoint_Internal(p, depth, depthShift);
281cd0c2139SMatthew G Knepley 
282cd0c2139SMatthew G Knepley     ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr);
283cd0c2139SMatthew G Knepley     ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr);
284cd0c2139SMatthew G Knepley     ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr);
285cd0c2139SMatthew G Knepley     for (i = 0; i < size; ++i) {
2862582d50cSToby Isaac       newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthShift);
287cd0c2139SMatthew G Knepley     }
288cd0c2139SMatthew G Knepley     ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr);
289cd0c2139SMatthew G Knepley     ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr);
290cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr);
291dcbb62e8SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dmNew, newp, &sizeNew);CHKERRQ(ierr);
292cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr);
293cd0c2139SMatthew G Knepley     for (i = 0; i < size; ++i) {
2942582d50cSToby Isaac       newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthShift);
295cd0c2139SMatthew G Knepley     }
296dcbb62e8SMatthew G. Knepley     for (i = size; i < sizeNew; ++i) newpoints[i] = 0;
297cd0c2139SMatthew G Knepley     ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr);
298cd0c2139SMatthew G Knepley   }
2992582d50cSToby Isaac   ierr = PetscFree(newpoints);CHKERRQ(ierr);
300cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
301cd0c2139SMatthew G Knepley }
302cd0c2139SMatthew G Knepley 
303cd0c2139SMatthew G Knepley #undef __FUNCT__
304cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftCoordinates_Internal"
305cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew)
306cd0c2139SMatthew G Knepley {
307cd0c2139SMatthew G Knepley   PetscSection   coordSection, newCoordSection;
308cd0c2139SMatthew G Knepley   Vec            coordinates, newCoordinates;
309cd0c2139SMatthew G Knepley   PetscScalar   *coords, *newCoords;
3102582d50cSToby Isaac   PetscInt       coordSize;
3112582d50cSToby Isaac   PetscInt       dim, depth = 0, vStart, vEnd, vStartNew, vEndNew, v;
312cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
313cd0c2139SMatthew G Knepley 
314cd0c2139SMatthew G Knepley   PetscFunctionBegin;
315c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
316cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
317cd0c2139SMatthew G Knepley   /* Step 8: Convert coordinates */
318cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
319cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr);
32069d8a9ceSMatthew G. Knepley   ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
321cd0c2139SMatthew G Knepley   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr);
322cd0c2139SMatthew G Knepley   ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr);
323cd0c2139SMatthew G Knepley   ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr);
324cd0c2139SMatthew G Knepley   ierr = PetscSectionSetChart(newCoordSection, vStartNew, vEndNew);CHKERRQ(ierr);
325cd0c2139SMatthew G Knepley   for (v = vStartNew; v < vEndNew; ++v) {
326cd0c2139SMatthew G Knepley     ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr);
327cd0c2139SMatthew G Knepley     ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr);
328cd0c2139SMatthew G Knepley   }
329cd0c2139SMatthew G Knepley   ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr);
33046e270d4SMatthew G. Knepley   ierr = DMSetCoordinateSection(dmNew, PETSC_DETERMINE, newCoordSection);CHKERRQ(ierr);
331cd0c2139SMatthew G Knepley   ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr);
332cd0c2139SMatthew G Knepley   ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr);
333cd0c2139SMatthew G Knepley   ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr);
334cd0c2139SMatthew G Knepley   ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
3354e90ef8eSMatthew G. Knepley   ierr = VecSetBlockSize(newCoordinates, dim);CHKERRQ(ierr);
3362eb5907fSJed Brown   ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr);
337cd0c2139SMatthew G Knepley   ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr);
338cd0c2139SMatthew G Knepley   ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
339cd0c2139SMatthew G Knepley   ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
340cd0c2139SMatthew G Knepley   ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr);
341cd0c2139SMatthew G Knepley   for (v = vStart; v < vEnd; ++v) {
342cd0c2139SMatthew G Knepley     PetscInt dof, off, noff, d;
343cd0c2139SMatthew G Knepley 
344cd0c2139SMatthew G Knepley     ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr);
345cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
3462582d50cSToby Isaac     ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthShift), &noff);CHKERRQ(ierr);
347cd0c2139SMatthew G Knepley     for (d = 0; d < dof; ++d) {
348cd0c2139SMatthew G Knepley       newCoords[noff+d] = coords[off+d];
349cd0c2139SMatthew G Knepley     }
350cd0c2139SMatthew G Knepley   }
351cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
352cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr);
353cd0c2139SMatthew G Knepley   ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr);
354cd0c2139SMatthew G Knepley   ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr);
355cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
356cd0c2139SMatthew G Knepley }
357cd0c2139SMatthew G Knepley 
358cd0c2139SMatthew G Knepley #undef __FUNCT__
359cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal"
360cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew)
361cd0c2139SMatthew G Knepley {
3622582d50cSToby Isaac   PetscInt           depth = 0;
363cd0c2139SMatthew G Knepley   PetscSF            sfPoint, sfPointNew;
364cd0c2139SMatthew G Knepley   const PetscSFNode *remotePoints;
365cd0c2139SMatthew G Knepley   PetscSFNode       *gremotePoints;
366cd0c2139SMatthew G Knepley   const PetscInt    *localPoints;
367cd0c2139SMatthew G Knepley   PetscInt          *glocalPoints, *newLocation, *newRemoteLocation;
368cd0c2139SMatthew G Knepley   PetscInt           numRoots, numLeaves, l, pStart, pEnd, totShift = 0;
369cd0c2139SMatthew G Knepley   PetscErrorCode     ierr;
370cd0c2139SMatthew G Knepley 
371cd0c2139SMatthew G Knepley   PetscFunctionBegin;
372cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
373cd0c2139SMatthew G Knepley   /* Step 9: Convert pointSF */
374cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
375cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr);
376cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
377cd0c2139SMatthew G Knepley   ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
3786e21efdcSToby Isaac   totShift = DMPlexShiftPoint_Internal(pEnd,depth,depthShift) - pEnd;
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;
517fb4630b5SToby Isaac     PetscInt *childIDsShifted;
518ca04dac2SToby Isaac     PetscSection pSecShifted;
519ca04dac2SToby Isaac 
520ca04dac2SToby Isaac     ierr = PetscSectionGetChart(pSec,&pStart,&pEnd);CHKERRQ(ierr);
521ca04dac2SToby Isaac     ierr = DMPlexGetDepth(dm,&depth);CHKERRQ(ierr);
5222582d50cSToby Isaac     pStartShifted = DMPlexShiftPoint_Internal(pStart,depth,depthShift);
5232582d50cSToby Isaac     pEndShifted   = DMPlexShiftPoint_Internal(pEnd,depth,depthShift);
524fb4630b5SToby Isaac     ierr = PetscMalloc2(pEndShifted - pStartShifted,&parentsShifted,pEndShifted-pStartShifted,&childIDsShifted);CHKERRQ(ierr);
525ca04dac2SToby Isaac     ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dmNew),&pSecShifted);CHKERRQ(ierr);
526ca04dac2SToby Isaac     ierr = PetscSectionSetChart(pSecShifted,pStartShifted,pEndShifted);CHKERRQ(ierr);
527ca04dac2SToby Isaac     for (p = pStartShifted; p < pEndShifted; p++) {
528fb4630b5SToby Isaac       /* start off assuming no children */
529fb4630b5SToby Isaac       ierr = PetscSectionSetDof(pSecShifted,p,0);CHKERRQ(ierr);
530fb4630b5SToby Isaac     }
531fb4630b5SToby Isaac     for (p = pStart; p < pEnd; p++) {
532fb4630b5SToby Isaac       PetscInt dof;
533fb4630b5SToby Isaac       PetscInt pNew = DMPlexShiftPoint_Internal(p,depth,depthShift);
534ca04dac2SToby Isaac 
535ca04dac2SToby Isaac       ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr);
536fb4630b5SToby Isaac       ierr = PetscSectionSetDof(pSecShifted,pNew,dof);CHKERRQ(ierr);
537ca04dac2SToby Isaac     }
538ca04dac2SToby Isaac     ierr = PetscSectionSetUp(pSecShifted);CHKERRQ(ierr);
539fb4630b5SToby Isaac     for (p = pStart; p < pEnd; p++) {
540fb4630b5SToby Isaac       PetscInt dof;
541fb4630b5SToby Isaac       PetscInt pNew = DMPlexShiftPoint_Internal(p,depth,depthShift);
542fb4630b5SToby Isaac 
543fb4630b5SToby Isaac       ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr);
544fb4630b5SToby Isaac       if (dof) {
545fb4630b5SToby Isaac         PetscInt off, offNew;
546fb4630b5SToby Isaac 
547fb4630b5SToby Isaac         ierr = PetscSectionGetOffset(pSec,p,&off);CHKERRQ(ierr);
548fb4630b5SToby Isaac         ierr = PetscSectionGetOffset(pSecShifted,pNew,&offNew);CHKERRQ(ierr);
549fb4630b5SToby Isaac         parentsShifted[offNew] = DMPlexShiftPoint_Internal(parents[off],depth,depthShift);
550fb4630b5SToby Isaac         childIDsShifted[offNew] = childIDs[off];
551fb4630b5SToby Isaac       }
552fb4630b5SToby Isaac     }
553fb4630b5SToby Isaac     ierr = DMPlexSetTree(dmNew,pSecShifted,parentsShifted,childIDsShifted);CHKERRQ(ierr);
554fb4630b5SToby Isaac     ierr = PetscFree2(parentsShifted,childIDsShifted);CHKERRQ(ierr);
555e6885bbbSToby Isaac     ierr = PetscSectionDestroy(&pSecShifted);CHKERRQ(ierr);
556ca04dac2SToby Isaac   }
557ca04dac2SToby Isaac   PetscFunctionReturn(0);
558ca04dac2SToby Isaac }
559ca04dac2SToby Isaac 
560ca04dac2SToby Isaac #undef __FUNCT__
561cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal"
562cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm)
563cd0c2139SMatthew G Knepley {
564da97024aSMatthew G. Knepley   PetscSF         sf;
565cd0c2139SMatthew G Knepley   IS              valueIS;
566da97024aSMatthew G. Knepley   const PetscInt *values, *leaves;
567cd0c2139SMatthew G Knepley   PetscInt       *depthShift;
5682582d50cSToby Isaac   PetscInt        d, depth = 0, nleaves, loc, Ng, numFS, fs, fStart, fEnd, ghostCell, cEnd, c;
569cd0c2139SMatthew G Knepley   PetscErrorCode  ierr;
570cd0c2139SMatthew G Knepley 
571cd0c2139SMatthew G Knepley   PetscFunctionBegin;
572da97024aSMatthew G. Knepley   ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr);
573da97024aSMatthew G. Knepley   ierr = PetscSFGetGraph(sf, NULL, &nleaves, &leaves, NULL);CHKERRQ(ierr);
574da97024aSMatthew G. Knepley   nleaves = PetscMax(0, nleaves);
57546c796b9SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr);
576cd0c2139SMatthew G Knepley   /* Count ghost cells */
577cd0c2139SMatthew G Knepley   ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
578cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr);
579cd0c2139SMatthew G Knepley   ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
5804a6cfa73SMatthew G. Knepley   Ng   = 0;
581cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
58246c796b9SMatthew G. Knepley     IS              faceIS;
58346c796b9SMatthew G. Knepley     const PetscInt *faces;
58446c796b9SMatthew G. Knepley     PetscInt        numFaces, f, numBdFaces = 0;
585cd0c2139SMatthew G Knepley 
58646c796b9SMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
58746c796b9SMatthew G. Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
58846c796b9SMatthew G. Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
58946c796b9SMatthew G. Knepley     for (f = 0; f < numFaces; ++f) {
590ca04dac2SToby Isaac       PetscInt numChildren;
591ca04dac2SToby Isaac 
592da97024aSMatthew G. Knepley       ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr);
593ca04dac2SToby Isaac       ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr);
594ca04dac2SToby Isaac       /* non-local and ancestors points don't get to register ghosts */
595ca04dac2SToby Isaac       if (loc >= 0 || numChildren) continue;
59646c796b9SMatthew G. Knepley       if ((faces[f] >= fStart) && (faces[f] < fEnd)) ++numBdFaces;
59746c796b9SMatthew G. Knepley     }
5984a6cfa73SMatthew G. Knepley     Ng += numBdFaces;
59946c796b9SMatthew G. Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
600cd0c2139SMatthew G Knepley   }
601cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
6022582d50cSToby Isaac   ierr = PetscMalloc1(2*(depth+1), &depthShift);CHKERRQ(ierr);
6032582d50cSToby Isaac   for (d = 0; d <= depth; d++) {
60459eef20bSToby Isaac     PetscInt dEnd;
6052582d50cSToby Isaac 
6060974a383SToby Isaac     ierr = DMPlexGetDepthStratum(dm,d,NULL,&dEnd);CHKERRQ(ierr);
60759eef20bSToby Isaac     depthShift[2*d]   = dEnd;
6082582d50cSToby Isaac     depthShift[2*d+1] = 0;
6092582d50cSToby Isaac   }
6102582d50cSToby Isaac   if (depth >= 0) depthShift[2*depth+1] = Ng;
6112582d50cSToby Isaac   ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift);CHKERRQ(ierr);
612cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
613cd0c2139SMatthew G Knepley   /* Step 3: Set cone/support sizes for new points */
614cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
6155acea1aeSMatthew G. Knepley   ierr = DMPlexSetHybridBounds(gdm, cEnd, PETSC_DETERMINE, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr);
6164a6cfa73SMatthew G. Knepley   for (c = cEnd; c < cEnd + Ng; ++c) {
617cd0c2139SMatthew G Knepley     ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr);
618cd0c2139SMatthew G Knepley   }
619cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
620cd0c2139SMatthew G Knepley     IS              faceIS;
621cd0c2139SMatthew G Knepley     const PetscInt *faces;
622cd0c2139SMatthew G Knepley     PetscInt        numFaces, f;
623cd0c2139SMatthew G Knepley 
624cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
625cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
626cd0c2139SMatthew G Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
627cd0c2139SMatthew G Knepley     for (f = 0; f < numFaces; ++f) {
628ca04dac2SToby Isaac       PetscInt size, numChildren;
629cd0c2139SMatthew G Knepley 
630da97024aSMatthew G. Knepley       ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr);
631ca04dac2SToby Isaac       ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr);
632ca04dac2SToby Isaac       if (loc >= 0 || numChildren) continue;
63346c796b9SMatthew G. Knepley       if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue;
634cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr);
635cd0c2139SMatthew 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);
6364a6cfa73SMatthew G. Knepley       ierr = DMPlexSetSupportSize(gdm, faces[f] + Ng, 2);CHKERRQ(ierr);
637cd0c2139SMatthew G Knepley     }
638cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr);
639cd0c2139SMatthew G Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
640cd0c2139SMatthew G Knepley   }
641cd0c2139SMatthew G Knepley   /* Step 4: Setup ghosted DM */
642cd0c2139SMatthew G Knepley   ierr = DMSetUp(gdm);CHKERRQ(ierr);
643cd0c2139SMatthew G Knepley   ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
644cd0c2139SMatthew G Knepley   /* Step 6: Set cones and supports for new points */
645cd0c2139SMatthew G Knepley   ghostCell = cEnd;
646cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
647cd0c2139SMatthew G Knepley     IS              faceIS;
648cd0c2139SMatthew G Knepley     const PetscInt *faces;
649cd0c2139SMatthew G Knepley     PetscInt        numFaces, f;
650cd0c2139SMatthew G Knepley 
651cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
652cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
653cd0c2139SMatthew G Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
65446c796b9SMatthew G. Knepley     for (f = 0; f < numFaces; ++f) {
655ca04dac2SToby Isaac       PetscInt newFace = faces[f] + Ng, numChildren;
656cd0c2139SMatthew G Knepley 
657da97024aSMatthew G. Knepley       ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr);
658ca04dac2SToby Isaac       ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr);
659ca04dac2SToby Isaac       if (loc >= 0 || numChildren) continue;
66046c796b9SMatthew G. Knepley       if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue;
661cd0c2139SMatthew G Knepley       ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr);
662cd0c2139SMatthew G Knepley       ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr);
66346c796b9SMatthew G. Knepley       ++ghostCell;
664cd0c2139SMatthew G Knepley     }
665cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr);
666cd0c2139SMatthew G Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
667cd0c2139SMatthew G Knepley   }
668cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
669cd0c2139SMatthew G Knepley   ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
670cd0c2139SMatthew G Knepley   /* Step 7: Stratify */
671cd0c2139SMatthew G Knepley   ierr = DMPlexStratify(gdm);CHKERRQ(ierr);
672cd0c2139SMatthew G Knepley   ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
673cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
674cd0c2139SMatthew G Knepley   ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
675ca04dac2SToby Isaac   ierr = DMPlexShiftTree_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
676cd0c2139SMatthew G Knepley   ierr = PetscFree(depthShift);CHKERRQ(ierr);
677966c7b3fSMatthew G. Knepley   /* Step 7: Periodicity */
678966c7b3fSMatthew G. Knepley   if (dm->maxCell) {
679966c7b3fSMatthew G. Knepley     const PetscReal *maxCell, *L;
6805dc8c3f7SMatthew G. Knepley     const DMBoundaryType *bd;
6815dc8c3f7SMatthew G. Knepley     ierr = DMGetPeriodicity(dm,  &maxCell, &L, &bd);CHKERRQ(ierr);
6825dc8c3f7SMatthew G. Knepley     ierr = DMSetPeriodicity(gdm,  maxCell,  L,  bd);CHKERRQ(ierr);
683966c7b3fSMatthew G. Knepley   }
6844a6cfa73SMatthew G. Knepley   if (numGhostCells) *numGhostCells = Ng;
685cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
686cd0c2139SMatthew G Knepley }
687cd0c2139SMatthew G Knepley 
688cd0c2139SMatthew G Knepley #undef __FUNCT__
689cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells"
690cd0c2139SMatthew G Knepley /*@C
691cd0c2139SMatthew G Knepley   DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face
692cd0c2139SMatthew G Knepley 
693cd0c2139SMatthew G Knepley   Collective on dm
694cd0c2139SMatthew G Knepley 
695cd0c2139SMatthew G Knepley   Input Parameters:
696cd0c2139SMatthew G Knepley + dm - The original DM
697cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL
698cd0c2139SMatthew G Knepley 
699cd0c2139SMatthew G Knepley   Output Parameters:
700cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM
701cd0c2139SMatthew G Knepley - dmGhosted - The new DM
702cd0c2139SMatthew G Knepley 
703cd0c2139SMatthew G Knepley   Note: If no label exists of that name, one will be created marking all boundary faces
704cd0c2139SMatthew G Knepley 
705cd0c2139SMatthew G Knepley   Level: developer
706cd0c2139SMatthew G Knepley 
707cd0c2139SMatthew G Knepley .seealso: DMCreate()
70831266bc0SMatthew G. Knepley @*/
709cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted)
710cd0c2139SMatthew G Knepley {
711cd0c2139SMatthew G Knepley   DM             gdm;
712cd0c2139SMatthew G Knepley   DMLabel        label;
713cd0c2139SMatthew G Knepley   const char    *name = labelName ? labelName : "Face Sets";
714cd0c2139SMatthew G Knepley   PetscInt       dim;
715a42b08eeSMatthew G. Knepley   PetscBool      flag;
716cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
717cd0c2139SMatthew G Knepley 
718cd0c2139SMatthew G Knepley   PetscFunctionBegin;
719cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
7204a6cfa73SMatthew G. Knepley   if (numGhostCells) PetscValidPointer(numGhostCells, 3);
721cd0c2139SMatthew G Knepley   PetscValidPointer(dmGhosted, 4);
722cd0c2139SMatthew G Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr);
723cd0c2139SMatthew G Knepley   ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr);
724c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
725c73cfb54SMatthew G. Knepley   ierr = DMSetDimension(gdm, dim);CHKERRQ(ierr);
726a42b08eeSMatthew G. Knepley   ierr = DMPlexGetAdjacencyUseCone(dm, &flag);CHKERRQ(ierr);
727a42b08eeSMatthew G. Knepley   ierr = DMPlexSetAdjacencyUseCone(gdm, flag);CHKERRQ(ierr);
728a42b08eeSMatthew G. Knepley   ierr = DMPlexGetAdjacencyUseClosure(dm, &flag);CHKERRQ(ierr);
729a42b08eeSMatthew G. Knepley   ierr = DMPlexSetAdjacencyUseClosure(gdm, flag);CHKERRQ(ierr);
730cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr);
731cd0c2139SMatthew G Knepley   if (!label) {
732cd0c2139SMatthew G Knepley     /* Get label for boundary faces */
733cd0c2139SMatthew G Knepley     ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr);
734cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr);
735cd0c2139SMatthew G Knepley     ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr);
736cd0c2139SMatthew G Knepley   }
737cd0c2139SMatthew G Knepley   ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr);
7388e136ac0SMatthew G. Knepley   ierr = DMPlexCopyBoundary(dm, gdm);CHKERRQ(ierr);
739cd0c2139SMatthew G Knepley   *dmGhosted = gdm;
740cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
741cd0c2139SMatthew G Knepley }
742cd0c2139SMatthew G Knepley 
743cd0c2139SMatthew G Knepley #undef __FUNCT__
744cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal"
745607ab7a9SMatthew G. Knepley /*
746faedd622SMatthew G. Knepley   We are adding three kinds of points here:
747607ab7a9SMatthew G. Knepley     Replicated:     Copies of points which exist in the mesh, such as vertices identified across a fault
748faedd622SMatthew G. Knepley     Non-replicated: Points which exist on the fault, but are not replicated
749607ab7a9SMatthew G. Knepley     Hybrid:         Entirely new points, such as cohesive cells
750a6ae58d1SMatthew G. Knepley 
751a6ae58d1SMatthew G. Knepley   When creating subsequent cohesive cells, we shift the old hybrid cells to the end of the numbering at
752a6ae58d1SMatthew G. Knepley   each depth so that the new split/hybrid points can be inserted as a block.
753607ab7a9SMatthew G. Knepley */
754cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm)
755cd0c2139SMatthew G Knepley {
756cd0c2139SMatthew G Knepley   MPI_Comm         comm;
757607ab7a9SMatthew G. Knepley   IS               valueIS;
758607ab7a9SMatthew G. Knepley   PetscInt         numSP = 0;       /* The number of depths for which we have replicated points */
759607ab7a9SMatthew G. Knepley   const PetscInt  *values;          /* List of depths for which we have replicated points */
76018c5995bSMatthew G. Knepley   IS              *splitIS;
76118c5995bSMatthew G. Knepley   IS              *unsplitIS;
762607ab7a9SMatthew G. Knepley   PetscInt        *numSplitPoints;     /* The number of replicated points at each depth */
76318c5995bSMatthew G. Knepley   PetscInt        *numUnsplitPoints;   /* The number of non-replicated points at each depth which still give rise to hybrid points */
76436dbac82SMatthew G. Knepley   PetscInt        *numHybridPoints;    /* The number of new hybrid points at each depth */
76536dbac82SMatthew G. Knepley   PetscInt        *numHybridPointsOld; /* The number of existing hybrid points at each depth */
766607ab7a9SMatthew G. Knepley   const PetscInt **splitPoints;        /* Replicated points for each depth */
76718c5995bSMatthew G. Knepley   const PetscInt **unsplitPoints;      /* Non-replicated points for each depth */
768cd0c2139SMatthew G Knepley   PetscSection     coordSection;
769cd0c2139SMatthew G Knepley   Vec              coordinates;
770cd0c2139SMatthew G Knepley   PetscScalar     *coords;
771a6ae58d1SMatthew G. Knepley   PetscInt        *depthMax;           /* The first hybrid point at each depth in the original mesh */
772a6ae58d1SMatthew G. Knepley   PetscInt        *depthEnd;           /* The point limit at each depth in the original mesh */
773607ab7a9SMatthew G. Knepley   PetscInt        *depthShift;         /* Number of replicated+hybrid points at each depth */
774607ab7a9SMatthew G. Knepley   PetscInt        *pMaxNew;            /* The first replicated point at each depth in the new mesh, hybrids come after this */
775607ab7a9SMatthew G. Knepley   PetscInt        *coneNew, *coneONew, *supportNew;
77618c5995bSMatthew G. Knepley   PetscInt         shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v;
777cd0c2139SMatthew G Knepley   PetscErrorCode   ierr;
778cd0c2139SMatthew G Knepley 
779cd0c2139SMatthew G Knepley   PetscFunctionBegin;
780cd0c2139SMatthew G Knepley   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
781c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
782607ab7a9SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
783fd4b9f15SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
784cd0c2139SMatthew G Knepley   /* Count split points and add cohesive cells */
785607ab7a9SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
7862582d50cSToby Isaac   ierr = PetscMalloc5(depth+1,&depthMax,depth+1,&depthEnd,2*(depth+1),&depthShift,depth+1,&pMaxNew,depth+1,&numHybridPointsOld);CHKERRQ(ierr);
787dcca6d9dSJed 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);
788a6ae58d1SMatthew 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);
789607ab7a9SMatthew G. Knepley   for (d = 0; d <= depth; ++d) {
790607ab7a9SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr);
791a6ae58d1SMatthew G. Knepley     depthEnd[d]           = pMaxNew[d];
792a6ae58d1SMatthew G. Knepley     depthMax[d]           = depthMax[d] < 0 ? depthEnd[d] : depthMax[d];
793607ab7a9SMatthew G. Knepley     numSplitPoints[d]     = 0;
79418c5995bSMatthew G. Knepley     numUnsplitPoints[d]   = 0;
795607ab7a9SMatthew G. Knepley     numHybridPoints[d]    = 0;
796a6ae58d1SMatthew G. Knepley     numHybridPointsOld[d] = depthMax[d] < 0 ? 0 : depthEnd[d] - depthMax[d];
797607ab7a9SMatthew G. Knepley     splitPoints[d]        = NULL;
79818c5995bSMatthew G. Knepley     unsplitPoints[d]      = NULL;
79918c5995bSMatthew G. Knepley     splitIS[d]            = NULL;
80018c5995bSMatthew G. Knepley     unsplitIS[d]          = NULL;
80159eef20bSToby Isaac     /* we are shifting the existing hybrid points with the stratum behind them, so
80259eef20bSToby Isaac      * the split comes at the end of the normal points, i.e., at depthMax[d] */
80359eef20bSToby Isaac     depthShift[2*d]       = depthMax[d];
80459eef20bSToby Isaac     depthShift[2*d+1]     = 0;
805607ab7a9SMatthew G. Knepley   }
806cd0c2139SMatthew G Knepley   if (label) {
807cd0c2139SMatthew G Knepley     ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
808cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr);
809cd0c2139SMatthew G Knepley     ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
810cd0c2139SMatthew G Knepley   }
811cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
812cd0c2139SMatthew G Knepley     const PetscInt dep = values[sp];
813cd0c2139SMatthew G Knepley 
814cd0c2139SMatthew G Knepley     if ((dep < 0) || (dep > depth)) continue;
81518c5995bSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr);
81618c5995bSMatthew G. Knepley     if (splitIS[dep]) {
81718c5995bSMatthew G. Knepley       ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr);
81818c5995bSMatthew G. Knepley       ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);
81918c5995bSMatthew G. Knepley     }
82018c5995bSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr);
82118c5995bSMatthew G. Knepley     if (unsplitIS[dep]) {
82218c5995bSMatthew G. Knepley       ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr);
82318c5995bSMatthew G. Knepley       ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);
824cd0c2139SMatthew G Knepley     }
825cd0c2139SMatthew G Knepley   }
826607ab7a9SMatthew G. Knepley   /* Calculate number of hybrid points */
82718c5995bSMatthew 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   */
8282582d50cSToby Isaac   for (d = 0; d <= depth; ++d) depthShift[2*d+1]      = numSplitPoints[d] + numHybridPoints[d];
8292582d50cSToby Isaac   ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift);
83059eef20bSToby Isaac   /* the end of the points in this stratum that come before the new points:
83159eef20bSToby Isaac    * shifting pMaxNew[d] gets the new start of the next stratum, then count back the old hybrid points and the newly
83259eef20bSToby Isaac    * added points */
8332582d50cSToby Isaac   for (d = 0; d <= depth; ++d) pMaxNew[d]             = DMPlexShiftPoint_Internal(pMaxNew[d],depth,depthShift) - (numHybridPointsOld[d] + numSplitPoints[d] + numHybridPoints[d]);
834cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
835cd0c2139SMatthew G Knepley   /* Step 3: Set cone/support sizes for new points */
836cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
837cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
838cd0c2139SMatthew G Knepley       const PetscInt  oldp   = splitPoints[dep][p];
8392582d50cSToby Isaac       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/;
8404c367dbcSMatthew G. Knepley       const PetscInt  splitp = p    + pMaxNew[dep];
841cd0c2139SMatthew G Knepley       const PetscInt *support;
8424c367dbcSMatthew G. Knepley       PetscInt        coneSize, supportSize, qf, qn, qp, e;
843cd0c2139SMatthew G Knepley 
844cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
845cd0c2139SMatthew G Knepley       ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr);
846cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
847cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr);
848cd0c2139SMatthew G Knepley       if (dep == depth-1) {
8494c367dbcSMatthew G. Knepley         const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
8504c367dbcSMatthew G. Knepley 
851cd0c2139SMatthew G Knepley         /* Add cohesive cells, they are prisms */
8524c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr);
853cd0c2139SMatthew G Knepley       } else if (dep == 0) {
8544c367dbcSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
855cd0c2139SMatthew G Knepley 
856cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
8574c367dbcSMatthew G. Knepley         for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) {
858cd0c2139SMatthew G Knepley           PetscInt val;
859cd0c2139SMatthew G Knepley 
860cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
8614c367dbcSMatthew G. Knepley           if (val == 1) ++qf;
8624c367dbcSMatthew G. Knepley           if ((val == 1) || (val ==  (shift + 1))) ++qn;
8634c367dbcSMatthew G. Knepley           if ((val == 1) || (val == -(shift + 1))) ++qp;
864cd0c2139SMatthew G Knepley         }
8654c367dbcSMatthew G. Knepley         /* Split old vertex: Edges into original vertex and new cohesive edge */
8664c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr);
8674c367dbcSMatthew G. Knepley         /* Split new vertex: Edges into split vertex and new cohesive edge */
8684c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr);
8694c367dbcSMatthew G. Knepley         /* Add hybrid edge */
8704c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr);
8714c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr);
872cd0c2139SMatthew G Knepley       } else if (dep == dim-2) {
8734c367dbcSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
8744c367dbcSMatthew G. Knepley 
875cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
8764c367dbcSMatthew G. Knepley         for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) {
877cd0c2139SMatthew G Knepley           PetscInt val;
878cd0c2139SMatthew G Knepley 
879cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
8804c367dbcSMatthew G. Knepley           if (val == dim-1) ++qf;
8814c367dbcSMatthew G. Knepley           if ((val == dim-1) || (val ==  (shift + dim-1))) ++qn;
8824c367dbcSMatthew G. Knepley           if ((val == dim-1) || (val == -(shift + dim-1))) ++qp;
883cd0c2139SMatthew G Knepley         }
8844c367dbcSMatthew G. Knepley         /* Split old edge: Faces into original edge and cohesive face (positive side?) */
8854c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr);
8864c367dbcSMatthew G. Knepley         /* Split new edge: Faces into split edge and cohesive face (negative side?) */
8874c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr);
8884c367dbcSMatthew G. Knepley         /* Add hybrid face */
8894c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr);
8904c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr);
891cd0c2139SMatthew G Knepley       }
892cd0c2139SMatthew G Knepley     }
893cd0c2139SMatthew G Knepley   }
89418c5995bSMatthew G. Knepley   for (dep = 0; dep <= depth; ++dep) {
89518c5995bSMatthew G. Knepley     for (p = 0; p < numUnsplitPoints[dep]; ++p) {
89618c5995bSMatthew G. Knepley       const PetscInt  oldp   = unsplitPoints[dep][p];
8972582d50cSToby Isaac       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/;
89818c5995bSMatthew G. Knepley       const PetscInt *support;
899da1dd7e4SMatthew G. Knepley       PetscInt        coneSize, supportSize, qf, e, s;
90018c5995bSMatthew G. Knepley 
90118c5995bSMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
90218c5995bSMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
90339254ff6SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
90418c5995bSMatthew G. Knepley       if (dep == 0) {
90518c5995bSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
90618c5995bSMatthew G. Knepley 
90739254ff6SMatthew G. Knepley         /* Unsplit vertex: Edges into original vertex, split edges, and new cohesive edge twice */
90839254ff6SMatthew G. Knepley         for (s = 0, qf = 0; s < supportSize; ++s, ++qf) {
90939254ff6SMatthew G. Knepley           ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr);
91039254ff6SMatthew G. Knepley           if (e >= 0) ++qf;
91139254ff6SMatthew G. Knepley         }
91239254ff6SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr);
91318c5995bSMatthew G. Knepley         /* Add hybrid edge */
91418c5995bSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr);
915e1757548SMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
916e1757548SMatthew G. Knepley           PetscInt val;
917e1757548SMatthew G. Knepley 
918e1757548SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
919e1757548SMatthew G. Knepley           /* Split and unsplit edges produce hybrid faces */
920da1dd7e4SMatthew G. Knepley           if (val == 1) ++qf;
921da1dd7e4SMatthew G. Knepley           if (val == (shift2 + 1)) ++qf;
922e1757548SMatthew G. Knepley         }
923e1757548SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr);
92418c5995bSMatthew G. Knepley       } else if (dep == dim-2) {
92518c5995bSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
926cd0c2139SMatthew G Knepley         PetscInt       val;
927cd0c2139SMatthew G Knepley 
928da1dd7e4SMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
929cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
930da1dd7e4SMatthew G. Knepley           if (val == dim-1) qf += 2;
931da1dd7e4SMatthew G. Knepley           else              ++qf;
932cd0c2139SMatthew G Knepley         }
93318c5995bSMatthew G. Knepley         /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */
934da1dd7e4SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr);
93518c5995bSMatthew G. Knepley         /* Add hybrid face */
936da1dd7e4SMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
937da1dd7e4SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
938da1dd7e4SMatthew G. Knepley           if (val == dim-1) ++qf;
939da1dd7e4SMatthew G. Knepley         }
94018c5995bSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr);
941da1dd7e4SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr);
942cd0c2139SMatthew G Knepley       }
943cd0c2139SMatthew G Knepley     }
944cd0c2139SMatthew G Knepley   }
945cd0c2139SMatthew G Knepley   /* Step 4: Setup split DM */
946cd0c2139SMatthew G Knepley   ierr = DMSetUp(sdm);CHKERRQ(ierr);
947cd0c2139SMatthew G Knepley   ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
948dcbb62e8SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr);
949dcca6d9dSJed Brown   ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),&supportNew);CHKERRQ(ierr);
950cd0c2139SMatthew G Knepley   /* Step 6: Set cones and supports for new points */
951cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
952cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
953cd0c2139SMatthew G Knepley       const PetscInt  oldp   = splitPoints[dep][p];
9542582d50cSToby Isaac       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/;
9554c367dbcSMatthew G. Knepley       const PetscInt  splitp = p    + pMaxNew[dep];
956cd0c2139SMatthew G Knepley       const PetscInt *cone, *support, *ornt;
9574c367dbcSMatthew G. Knepley       PetscInt        coneSize, supportSize, q, qf, qn, qp, v, e, s;
958cd0c2139SMatthew G Knepley 
959cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
960cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr);
961cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr);
962cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
963cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
964cd0c2139SMatthew G Knepley       if (dep == depth-1) {
96596a07cd0SMatthew G. Knepley         PetscBool       hasUnsplit = PETSC_FALSE;
9664c367dbcSMatthew G. Knepley         const PetscInt  hybcell    = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
967cd0c2139SMatthew G Knepley         const PetscInt *supportF;
968cd0c2139SMatthew G Knepley 
969cd0c2139SMatthew G Knepley         /* Split face:       copy in old face to new face to start */
970cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(sdm, newp,  &supportF);CHKERRQ(ierr);
971cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr);
972cd0c2139SMatthew G Knepley         /* Split old face:   old vertices/edges in cone so no change */
973cd0c2139SMatthew G Knepley         /* Split new face:   new vertices/edges in cone */
974cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
9754c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
97618c5995bSMatthew G. Knepley           if (v < 0) {
97718c5995bSMatthew G. Knepley             ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
97818c5995bSMatthew 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);
9792582d50cSToby Isaac             coneNew[2+q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/;
98096a07cd0SMatthew G. Knepley             hasUnsplit   = PETSC_TRUE;
98118c5995bSMatthew G. Knepley           } else {
9824c367dbcSMatthew G. Knepley             coneNew[2+q] = v + pMaxNew[dep-1];
983163235baSMatthew G. Knepley             if (dep > 1) {
984163235baSMatthew G. Knepley               const PetscInt *econe;
985163235baSMatthew G. Knepley               PetscInt        econeSize, r, vs, vu;
986163235baSMatthew G. Knepley 
987163235baSMatthew G. Knepley               ierr = DMPlexGetConeSize(dm, cone[q], &econeSize);CHKERRQ(ierr);
988163235baSMatthew G. Knepley               ierr = DMPlexGetCone(dm, cone[q], &econe);CHKERRQ(ierr);
989163235baSMatthew G. Knepley               for (r = 0; r < econeSize; ++r) {
990163235baSMatthew G. Knepley                 ierr = PetscFindInt(econe[r], numSplitPoints[dep-2],   splitPoints[dep-2],   &vs);CHKERRQ(ierr);
991163235baSMatthew G. Knepley                 ierr = PetscFindInt(econe[r], numUnsplitPoints[dep-2], unsplitPoints[dep-2], &vu);CHKERRQ(ierr);
992163235baSMatthew G. Knepley                 if (vs >= 0) continue;
993163235baSMatthew 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);
994163235baSMatthew G. Knepley                 hasUnsplit   = PETSC_TRUE;
995163235baSMatthew G. Knepley               }
996163235baSMatthew G. Knepley             }
997cd0c2139SMatthew G Knepley           }
998cd0c2139SMatthew G Knepley         }
999cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr);
1000cd0c2139SMatthew G Knepley         ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr);
1001e537020bSMatthew G. Knepley         /* Face support */
1002cd0c2139SMatthew G Knepley         for (s = 0; s < supportSize; ++s) {
1003cd0c2139SMatthew G Knepley           PetscInt val;
1004cd0c2139SMatthew G Knepley 
1005cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr);
1006cd0c2139SMatthew G Knepley           if (val < 0) {
1007cd0c2139SMatthew G Knepley             /* Split old face:   Replace negative side cell with cohesive cell */
10084c367dbcSMatthew G. Knepley              ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr);
1009cd0c2139SMatthew G Knepley           } else {
1010cd0c2139SMatthew G Knepley             /* Split new face:   Replace positive side cell with cohesive cell */
10114c367dbcSMatthew G. Knepley             ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr);
1012e537020bSMatthew G. Knepley             /* Get orientation for cohesive face */
1013e537020bSMatthew G. Knepley             {
1014e537020bSMatthew G. Knepley               const PetscInt *ncone, *nconeO;
1015e537020bSMatthew G. Knepley               PetscInt        nconeSize, nc;
1016e537020bSMatthew G. Knepley 
1017e537020bSMatthew G. Knepley               ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr);
1018e537020bSMatthew G. Knepley               ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr);
1019e537020bSMatthew G. Knepley               ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr);
1020e537020bSMatthew G. Knepley               for (nc = 0; nc < nconeSize; ++nc) {
1021e537020bSMatthew G. Knepley                 if (ncone[nc] == oldp) {
1022e537020bSMatthew G. Knepley                   coneONew[0] = nconeO[nc];
1023e537020bSMatthew G. Knepley                   break;
1024cd0c2139SMatthew G Knepley                 }
1025cd0c2139SMatthew G Knepley               }
1026e537020bSMatthew 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]);
1027e537020bSMatthew G. Knepley             }
1028e537020bSMatthew G. Knepley           }
1029e537020bSMatthew G. Knepley         }
10304c367dbcSMatthew G. Knepley         /* Cohesive cell:    Old and new split face, then new cohesive faces */
1031fd4b9f15SMatthew G. Knepley         coneNew[0]  = newp;   /* Extracted negative side orientation above */
10324c367dbcSMatthew G. Knepley         coneNew[1]  = splitp;
10334c367dbcSMatthew G. Knepley         coneONew[1] = coneONew[0];
1034e537020bSMatthew G. Knepley         for (q = 0; q < coneSize; ++q) {
103518c5995bSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
103618c5995bSMatthew G. Knepley           if (v < 0) {
103718c5995bSMatthew G. Knepley             ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
103818c5995bSMatthew G. Knepley             coneNew[2+q]  = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
103918c5995bSMatthew G. Knepley             coneONew[2+q] = 0;
104018c5995bSMatthew G. Knepley           } else {
104118c5995bSMatthew G. Knepley             coneNew[2+q]  = v + pMaxNew[dep] + numSplitPoints[dep];
104218c5995bSMatthew G. Knepley           }
1043e537020bSMatthew G. Knepley           coneONew[2+q] = 0;
1044e537020bSMatthew G. Knepley         }
10454c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr);
10464c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr);
104796a07cd0SMatthew G. Knepley         /* Label the hybrid cells on the boundary of the split */
104896a07cd0SMatthew G. Knepley         if (hasUnsplit) {ierr = DMLabelSetValue(label, -hybcell, dim);CHKERRQ(ierr);}
1049cd0c2139SMatthew G Knepley       } else if (dep == 0) {
10504c367dbcSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1051cd0c2139SMatthew G Knepley 
1052cd0c2139SMatthew G Knepley         /* Split old vertex: Edges in old split faces and new cohesive edge */
10534c367dbcSMatthew G. Knepley         for (e = 0, qn = 0; e < supportSize; ++e) {
1054cd0c2139SMatthew G Knepley           PetscInt val;
1055cd0c2139SMatthew G Knepley 
1056cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
1057cd0c2139SMatthew G Knepley           if ((val == 1) || (val == (shift + 1))) {
10582582d50cSToby Isaac             supportNew[qn++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/;
1059cd0c2139SMatthew G Knepley           }
1060cd0c2139SMatthew G Knepley         }
10614c367dbcSMatthew G. Knepley         supportNew[qn] = hybedge;
1062cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
1063cd0c2139SMatthew G Knepley         /* Split new vertex: Edges in new split faces and new cohesive edge */
10644c367dbcSMatthew G. Knepley         for (e = 0, qp = 0; e < supportSize; ++e) {
1065cd0c2139SMatthew G Knepley           PetscInt val, edge;
1066cd0c2139SMatthew G Knepley 
1067cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
1068cd0c2139SMatthew G Knepley           if (val == 1) {
10694c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
1070cd0c2139SMatthew G Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
10714c367dbcSMatthew G. Knepley             supportNew[qp++] = edge + pMaxNew[dep+1];
1072cd0c2139SMatthew G Knepley           } else if (val == -(shift + 1)) {
10732582d50cSToby Isaac             supportNew[qp++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/;
1074cd0c2139SMatthew G Knepley           }
1075cd0c2139SMatthew G Knepley         }
10764c367dbcSMatthew G. Knepley         supportNew[qp] = hybedge;
1077cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr);
10784c367dbcSMatthew G. Knepley         /* Hybrid edge:    Old and new split vertex */
1079cd0c2139SMatthew G Knepley         coneNew[0] = newp;
1080cd0c2139SMatthew G Knepley         coneNew[1] = splitp;
10814c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr);
10824c367dbcSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
10834c367dbcSMatthew G. Knepley           PetscInt val, edge;
10844c367dbcSMatthew G. Knepley 
10854c367dbcSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
10864c367dbcSMatthew G. Knepley           if (val == 1) {
10874c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
10884c367dbcSMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
10894c367dbcSMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2];
10904c367dbcSMatthew G. Knepley           }
10914c367dbcSMatthew G. Knepley         }
10924c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr);
1093cd0c2139SMatthew G Knepley       } else if (dep == dim-2) {
10944c367dbcSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
10954c367dbcSMatthew G. Knepley 
1096cd0c2139SMatthew G Knepley         /* Split old edge:   old vertices in cone so no change */
1097cd0c2139SMatthew G Knepley         /* Split new edge:   new vertices in cone */
1098cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
10994c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
1100e1757548SMatthew G. Knepley           if (v < 0) {
1101e1757548SMatthew G. Knepley             ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
1102e1757548SMatthew 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);
11032582d50cSToby Isaac             coneNew[q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/;
1104e1757548SMatthew G. Knepley           } else {
11054c367dbcSMatthew G. Knepley             coneNew[q] = v + pMaxNew[dep-1];
1106cd0c2139SMatthew G Knepley           }
1107e1757548SMatthew G. Knepley         }
1108cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr);
1109cd0c2139SMatthew G Knepley         /* Split old edge: Faces in positive side cells and old split faces */
1110cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
1111cd0c2139SMatthew G Knepley           PetscInt val;
1112cd0c2139SMatthew G Knepley 
1113cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
11144c367dbcSMatthew G. Knepley           if (val == dim-1) {
11152582d50cSToby Isaac             supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/;
11164c367dbcSMatthew G. Knepley           } else if (val == (shift + dim-1)) {
11172582d50cSToby Isaac             supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/;
1118cd0c2139SMatthew G Knepley           }
1119cd0c2139SMatthew G Knepley         }
1120b279cd2aSMatthew G. Knepley         supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1121cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
1122cd0c2139SMatthew G Knepley         /* Split new edge: Faces in negative side cells and new split faces */
1123cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
1124cd0c2139SMatthew G Knepley           PetscInt val, face;
1125cd0c2139SMatthew G Knepley 
1126cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
1127cd0c2139SMatthew G Knepley           if (val == dim-1) {
11284c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
1129cd0c2139SMatthew G Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]);
11304c367dbcSMatthew G. Knepley             supportNew[q++] = face + pMaxNew[dep+1];
1131cd0c2139SMatthew G Knepley           } else if (val == -(shift + dim-1)) {
11322582d50cSToby Isaac             supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/;
1133cd0c2139SMatthew G Knepley           }
1134cd0c2139SMatthew G Knepley         }
1135b279cd2aSMatthew G. Knepley         supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1136cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr);
11374c367dbcSMatthew G. Knepley         /* Hybrid face */
11384c367dbcSMatthew G. Knepley         coneNew[0] = newp;
11394c367dbcSMatthew G. Knepley         coneNew[1] = splitp;
11404c367dbcSMatthew G. Knepley         for (v = 0; v < coneSize; ++v) {
11414c367dbcSMatthew G. Knepley           PetscInt vertex;
11424c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr);
1143e1757548SMatthew G. Knepley           if (vertex < 0) {
1144e1757548SMatthew G. Knepley             ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr);
1145e1757548SMatthew 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);
1146e1757548SMatthew G. Knepley             coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
1147e1757548SMatthew G. Knepley           } else {
11484c367dbcSMatthew G. Knepley             coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep];
11494c367dbcSMatthew G. Knepley           }
1150e1757548SMatthew G. Knepley         }
11514c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr);
11524c367dbcSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
11534c367dbcSMatthew G. Knepley           PetscInt val, face;
11544c367dbcSMatthew G. Knepley 
11554c367dbcSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
11564c367dbcSMatthew G. Knepley           if (val == dim-1) {
11574c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
11584c367dbcSMatthew G. Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]);
11594c367dbcSMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2];
11604c367dbcSMatthew G. Knepley           }
11614c367dbcSMatthew G. Knepley         }
11624c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr);
1163cd0c2139SMatthew G Knepley       }
1164cd0c2139SMatthew G Knepley     }
1165cd0c2139SMatthew G Knepley   }
116618c5995bSMatthew G. Knepley   for (dep = 0; dep <= depth; ++dep) {
116718c5995bSMatthew G. Knepley     for (p = 0; p < numUnsplitPoints[dep]; ++p) {
116818c5995bSMatthew G. Knepley       const PetscInt  oldp   = unsplitPoints[dep][p];
11692582d50cSToby Isaac       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/;
117018c5995bSMatthew G. Knepley       const PetscInt *cone, *support, *ornt;
1171e1757548SMatthew G. Knepley       PetscInt        coneSize, supportSize, supportSizeNew, q, qf, e, f, s;
117218c5995bSMatthew G. Knepley 
117318c5995bSMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
117418c5995bSMatthew G. Knepley       ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr);
117518c5995bSMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr);
117618c5995bSMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
117718c5995bSMatthew G. Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
117818c5995bSMatthew G. Knepley       if (dep == 0) {
117918c5995bSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
118018c5995bSMatthew G. Knepley 
118118c5995bSMatthew G. Knepley         /* Unsplit vertex */
118218c5995bSMatthew G. Knepley         ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr);
118318c5995bSMatthew G. Knepley         for (s = 0, q = 0; s < supportSize; ++s) {
11842582d50cSToby Isaac           supportNew[q++] = DMPlexShiftPoint_Internal(support[s], depth, depthShift) /*support[s] + depthOffset[dep+1]*/;
118518c5995bSMatthew G. Knepley           ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr);
118618c5995bSMatthew G. Knepley           if (e >= 0) {
118718c5995bSMatthew G. Knepley             supportNew[q++] = e + pMaxNew[dep+1];
118818c5995bSMatthew G. Knepley           }
118918c5995bSMatthew G. Knepley         }
119018c5995bSMatthew G. Knepley         supportNew[q++] = hybedge;
119118c5995bSMatthew G. Knepley         supportNew[q++] = hybedge;
119218c5995bSMatthew G. Knepley         if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp);
119318c5995bSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
119418c5995bSMatthew G. Knepley         /* Hybrid edge */
119518c5995bSMatthew G. Knepley         coneNew[0] = newp;
119618c5995bSMatthew G. Knepley         coneNew[1] = newp;
119718c5995bSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr);
119818c5995bSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
119918c5995bSMatthew G. Knepley           PetscInt val, edge;
120018c5995bSMatthew G. Knepley 
120118c5995bSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
120218c5995bSMatthew G. Knepley           if (val == 1) {
120318c5995bSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
120418c5995bSMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
120518c5995bSMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2];
1206e1757548SMatthew G. Knepley           } else if  (val ==  (shift2 + 1)) {
1207e1757548SMatthew G. Knepley             ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr);
1208e1757548SMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]);
1209e1757548SMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1];
121018c5995bSMatthew G. Knepley           }
121118c5995bSMatthew G. Knepley         }
121218c5995bSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr);
1213e1757548SMatthew G. Knepley       } else if (dep == dim-2) {
1214e1757548SMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
1215e1757548SMatthew G. Knepley 
1216da1dd7e4SMatthew G. Knepley         /* Unsplit edge: Faces into original edge, split face, and hybrid face twice */
1217e1757548SMatthew G. Knepley         for (f = 0, qf = 0; f < supportSize; ++f) {
1218e1757548SMatthew G. Knepley           PetscInt val, face;
1219e1757548SMatthew G. Knepley 
1220e1757548SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr);
1221e1757548SMatthew G. Knepley           if (val == dim-1) {
1222e1757548SMatthew G. Knepley             ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
1223e1757548SMatthew G. Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]);
12242582d50cSToby Isaac             supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/;
1225e1757548SMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+1];
1226e1757548SMatthew G. Knepley           } else {
12272582d50cSToby Isaac             supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/;
1228e1757548SMatthew G. Knepley           }
1229e1757548SMatthew G. Knepley         }
1230e1757548SMatthew G. Knepley         supportNew[qf++] = hybface;
1231e1757548SMatthew G. Knepley         supportNew[qf++] = hybface;
1232da1dd7e4SMatthew G. Knepley         ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr);
1233da1dd7e4SMatthew 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);
1234e1757548SMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
1235e1757548SMatthew G. Knepley         /* Add hybrid face */
1236e1757548SMatthew G. Knepley         coneNew[0] = newp;
1237212cc919SMatthew G. Knepley         coneNew[1] = newp;
1238e1757548SMatthew G. Knepley         ierr = PetscFindInt(cone[0], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
1239e1757548SMatthew G. Knepley         if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[0]);
1240212cc919SMatthew G. Knepley         coneNew[2] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
1241e1757548SMatthew G. Knepley         ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
1242e1757548SMatthew G. Knepley         if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]);
1243e1757548SMatthew G. Knepley         coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
1244e1757548SMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr);
1245da1dd7e4SMatthew G. Knepley         for (f = 0, qf = 0; f < supportSize; ++f) {
1246da1dd7e4SMatthew G. Knepley           PetscInt val, face;
1247da1dd7e4SMatthew G. Knepley 
1248da1dd7e4SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr);
1249da1dd7e4SMatthew G. Knepley           if (val == dim-1) {
1250da1dd7e4SMatthew G. Knepley             ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
1251da1dd7e4SMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2];
1252da1dd7e4SMatthew G. Knepley           }
1253da1dd7e4SMatthew G. Knepley         }
1254da1dd7e4SMatthew G. Knepley         ierr = DMPlexGetSupportSize(sdm, hybface, &supportSizeNew);CHKERRQ(ierr);
1255da1dd7e4SMatthew 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);
1256e1757548SMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr);
1257cd0c2139SMatthew G Knepley       }
1258cd0c2139SMatthew G Knepley     }
1259cd0c2139SMatthew G Knepley   }
1260cd0c2139SMatthew G Knepley   /* Step 6b: Replace split points in negative side cones */
1261cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
1262cd0c2139SMatthew G Knepley     PetscInt        dep = values[sp];
1263cd0c2139SMatthew G Knepley     IS              pIS;
1264cd0c2139SMatthew G Knepley     PetscInt        numPoints;
1265cd0c2139SMatthew G Knepley     const PetscInt *points;
1266cd0c2139SMatthew G Knepley 
1267cd0c2139SMatthew G Knepley     if (dep >= 0) continue;
1268cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr);
1269cd0c2139SMatthew G Knepley     if (!pIS) continue;
1270cd0c2139SMatthew G Knepley     dep  = -dep - shift;
1271cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr);
1272cd0c2139SMatthew G Knepley     ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr);
1273cd0c2139SMatthew G Knepley     for (p = 0; p < numPoints; ++p) {
1274cd0c2139SMatthew G Knepley       const PetscInt  oldp = points[p];
12752582d50cSToby Isaac       const PetscInt  newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*depthOffset[dep] + oldp*/;
1276cd0c2139SMatthew G Knepley       const PetscInt *cone;
1277cd0c2139SMatthew G Knepley       PetscInt        coneSize, c;
127850cf782dSMatthew G. Knepley       /* PetscBool       replaced = PETSC_FALSE; */
1279cd0c2139SMatthew G Knepley 
1280cd0c2139SMatthew G Knepley       /* Negative edge: replace split vertex */
1281cd0c2139SMatthew G Knepley       /* Negative cell: replace split face */
1282cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr);
1283cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr);
1284cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
1285*e38fbfedSToby Isaac         const PetscInt coldp = DMPlexShiftPointInverse_Internal(cone[c],depth,depthShift);
1286cd0c2139SMatthew G Knepley         PetscInt       csplitp, cp, val;
1287cd0c2139SMatthew G Knepley 
1288cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr);
1289cd0c2139SMatthew G Knepley         if (val == dep-1) {
1290cd0c2139SMatthew G Knepley           ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr);
1291cd0c2139SMatthew G Knepley           if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1);
1292cd0c2139SMatthew G Knepley           csplitp  = pMaxNew[dep-1] + cp;
1293cd0c2139SMatthew G Knepley           ierr     = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr);
129450cf782dSMatthew G. Knepley           /* replaced = PETSC_TRUE; */
1295cd0c2139SMatthew G Knepley         }
1296cd0c2139SMatthew G Knepley       }
12974a189a86SMatthew G. Knepley       /* Cells with only a vertex or edge on the submesh have no replacement */
12984a189a86SMatthew G. Knepley       /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */
1299cd0c2139SMatthew G Knepley     }
1300cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr);
1301cd0c2139SMatthew G Knepley     ierr = ISDestroy(&pIS);CHKERRQ(ierr);
1302cd0c2139SMatthew G Knepley   }
1303cd0c2139SMatthew G Knepley   /* Step 7: Stratify */
1304cd0c2139SMatthew G Knepley   ierr = DMPlexStratify(sdm);CHKERRQ(ierr);
1305cd0c2139SMatthew G Knepley   /* Step 8: Coordinates */
1306cd0c2139SMatthew G Knepley   ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
130769d8a9ceSMatthew G. Knepley   ierr = DMGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr);
1308cd0c2139SMatthew G Knepley   ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr);
1309cd0c2139SMatthew G Knepley   ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
1310cd0c2139SMatthew G Knepley   for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) {
13112582d50cSToby Isaac     const PetscInt newp   = DMPlexShiftPoint_Internal(splitPoints[0][v], depth, depthShift) /*depthOffset[0] + splitPoints[0][v]*/;
1312cd0c2139SMatthew G Knepley     const PetscInt splitp = pMaxNew[0] + v;
1313cd0c2139SMatthew G Knepley     PetscInt       dof, off, soff, d;
1314cd0c2139SMatthew G Knepley 
1315cd0c2139SMatthew G Knepley     ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr);
1316cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr);
1317cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr);
1318cd0c2139SMatthew G Knepley     for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d];
1319cd0c2139SMatthew G Knepley   }
1320cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
1321cd0c2139SMatthew G Knepley   /* Step 9: SF, if I can figure this out we can split the mesh in parallel */
1322cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
1323cd0c2139SMatthew G Knepley   /* Step 10: Labels */
1324cd0c2139SMatthew G Knepley   ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
1325cd0c2139SMatthew G Knepley   ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr);
1326cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
1327cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
13282582d50cSToby Isaac       const PetscInt newp   = DMPlexShiftPoint_Internal(splitPoints[dep][p], depth, depthShift) /*depthOffset[dep] + splitPoints[dep][p]*/;
1329cd0c2139SMatthew G Knepley       const PetscInt splitp = pMaxNew[dep] + p;
1330cd0c2139SMatthew G Knepley       PetscInt       l;
1331cd0c2139SMatthew G Knepley 
1332cd0c2139SMatthew G Knepley       for (l = 0; l < numLabels; ++l) {
1333cd0c2139SMatthew G Knepley         DMLabel     mlabel;
1334cd0c2139SMatthew G Knepley         const char *lname;
1335cd0c2139SMatthew G Knepley         PetscInt    val;
13369a356370SMatthew G. Knepley         PetscBool   isDepth;
1337cd0c2139SMatthew G Knepley 
1338cd0c2139SMatthew G Knepley         ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr);
13399a356370SMatthew G. Knepley         ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr);
13409a356370SMatthew G. Knepley         if (isDepth) continue;
1341cd0c2139SMatthew G Knepley         ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr);
1342cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr);
1343cd0c2139SMatthew G Knepley         if (val >= 0) {
1344cd0c2139SMatthew G Knepley           ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr);
13459a356370SMatthew G. Knepley #if 0
13469a356370SMatthew G. Knepley           /* Do not put cohesive edges into the label */
1347cd0c2139SMatthew G Knepley           if (dep == 0) {
13484c367dbcSMatthew G. Knepley             const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1349cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr);
13504c367dbcSMatthew G. Knepley           } else if (dep == dim-2) {
13514c367dbcSMatthew G. Knepley             const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
13524c367dbcSMatthew G. Knepley             ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr);
1353cd0c2139SMatthew G Knepley           }
13544c367dbcSMatthew G. Knepley           /* Do not put cohesive faces into the label */
13559a356370SMatthew G. Knepley #endif
1356cd0c2139SMatthew G Knepley         }
1357cd0c2139SMatthew G Knepley       }
1358cd0c2139SMatthew G Knepley     }
1359cd0c2139SMatthew G Knepley   }
1360cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
1361cd0c2139SMatthew G Knepley     const PetscInt dep = values[sp];
1362cd0c2139SMatthew G Knepley 
1363cd0c2139SMatthew G Knepley     if ((dep < 0) || (dep > depth)) continue;
136418c5995bSMatthew G. Knepley     if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);}
136518c5995bSMatthew G. Knepley     ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr);
136618c5995bSMatthew G. Knepley     if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);}
136718c5995bSMatthew G. Knepley     ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr);
1368cd0c2139SMatthew G Knepley   }
1369cd0c2139SMatthew G Knepley   if (label) {
1370cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
1371cd0c2139SMatthew G Knepley     ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
1372cd0c2139SMatthew G Knepley   }
13730d4d4d06SMatthew G. Knepley   for (d = 0; d <= depth; ++d) {
13740d4d4d06SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr);
137536dbac82SMatthew G. Knepley     pMaxNew[d] = pEnd - numHybridPoints[d] - numHybridPointsOld[d];
13760d4d4d06SMatthew G. Knepley   }
13770e49e2e2SMatthew 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);
1378dcbb62e8SMatthew G. Knepley   ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr);
13792582d50cSToby Isaac   ierr = PetscFree5(depthMax, depthEnd, depthShift, pMaxNew, numHybridPointsOld);CHKERRQ(ierr);
138018c5995bSMatthew G. Knepley   ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr);
1381cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1382cd0c2139SMatthew G Knepley }
1383cd0c2139SMatthew G Knepley 
1384cd0c2139SMatthew G Knepley #undef __FUNCT__
1385cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells"
1386cd0c2139SMatthew G Knepley /*@C
1387cd0c2139SMatthew G Knepley   DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface
1388cd0c2139SMatthew G Knepley 
1389cd0c2139SMatthew G Knepley   Collective on dm
1390cd0c2139SMatthew G Knepley 
1391cd0c2139SMatthew G Knepley   Input Parameters:
1392cd0c2139SMatthew G Knepley + dm - The original DM
139353156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated)
1394cd0c2139SMatthew G Knepley 
1395cd0c2139SMatthew G Knepley   Output Parameters:
1396cd0c2139SMatthew G Knepley - dmSplit - The new DM
1397cd0c2139SMatthew G Knepley 
1398cd0c2139SMatthew G Knepley   Level: developer
1399cd0c2139SMatthew G Knepley 
14002be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete()
1401cd0c2139SMatthew G Knepley @*/
1402cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit)
1403cd0c2139SMatthew G Knepley {
1404cd0c2139SMatthew G Knepley   DM             sdm;
1405cd0c2139SMatthew G Knepley   PetscInt       dim;
1406cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
1407cd0c2139SMatthew G Knepley 
1408cd0c2139SMatthew G Knepley   PetscFunctionBegin;
1409cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
141053156dfcSMatthew G. Knepley   PetscValidPointer(dmSplit, 3);
1411cd0c2139SMatthew G Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr);
1412cd0c2139SMatthew G Knepley   ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr);
1413c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
1414c73cfb54SMatthew G. Knepley   ierr = DMSetDimension(sdm, dim);CHKERRQ(ierr);
1415cd0c2139SMatthew G Knepley   switch (dim) {
1416cd0c2139SMatthew G Knepley   case 2:
1417cd0c2139SMatthew G Knepley   case 3:
1418cd0c2139SMatthew G Knepley     ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr);
1419cd0c2139SMatthew G Knepley     break;
1420cd0c2139SMatthew G Knepley   default:
1421cd0c2139SMatthew G Knepley     SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim);
1422cd0c2139SMatthew G Knepley   }
1423cd0c2139SMatthew G Knepley   *dmSplit = sdm;
1424cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1425cd0c2139SMatthew G Knepley }
1426cd0c2139SMatthew G Knepley 
1427cd0c2139SMatthew G Knepley #undef __FUNCT__
14280f66a230SMatthew G. Knepley #define __FUNCT__ "GetSurfaceSide_Static"
14290f66a230SMatthew G. Knepley /* Returns the side of the surface for a given cell with a face on the surface */
14300f66a230SMatthew G. Knepley static PetscErrorCode GetSurfaceSide_Static(DM dm, DM subdm, PetscInt numSubpoints, const PetscInt *subpoints, PetscInt cell, PetscInt face, PetscBool *pos)
14310f66a230SMatthew G. Knepley {
14320f66a230SMatthew G. Knepley   const PetscInt *cone, *ornt;
14330f66a230SMatthew G. Knepley   PetscInt        dim, coneSize, c;
14340f66a230SMatthew G. Knepley   PetscErrorCode  ierr;
14350f66a230SMatthew G. Knepley 
14360f66a230SMatthew G. Knepley   PetscFunctionBegin;
14370f66a230SMatthew G. Knepley   *pos = PETSC_TRUE;
1438c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
14390f66a230SMatthew G. Knepley   ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr);
14400f66a230SMatthew G. Knepley   ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
14410f66a230SMatthew G. Knepley   ierr = DMPlexGetConeOrientation(dm, cell, &ornt);CHKERRQ(ierr);
14420f66a230SMatthew G. Knepley   for (c = 0; c < coneSize; ++c) {
14430f66a230SMatthew G. Knepley     if (cone[c] == face) {
14440f66a230SMatthew G. Knepley       PetscInt o = ornt[c];
14450f66a230SMatthew G. Knepley 
14460f66a230SMatthew G. Knepley       if (subdm) {
14470f66a230SMatthew G. Knepley         const PetscInt *subcone, *subornt;
14480f66a230SMatthew G. Knepley         PetscInt        subpoint, subface, subconeSize, sc;
14490f66a230SMatthew G. Knepley 
14500f66a230SMatthew G. Knepley         ierr = PetscFindInt(cell, numSubpoints, subpoints, &subpoint);CHKERRQ(ierr);
14510f66a230SMatthew G. Knepley         ierr = PetscFindInt(face, numSubpoints, subpoints, &subface);CHKERRQ(ierr);
14520f66a230SMatthew G. Knepley         ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
14530f66a230SMatthew G. Knepley         ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr);
14540f66a230SMatthew G. Knepley         ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr);
14550f66a230SMatthew G. Knepley         for (sc = 0; sc < subconeSize; ++sc) {
14560f66a230SMatthew G. Knepley           if (subcone[sc] == subface) {
14570f66a230SMatthew G. Knepley             o = subornt[0];
14580f66a230SMatthew G. Knepley             break;
14590f66a230SMatthew G. Knepley           }
14600f66a230SMatthew G. Knepley         }
14610f66a230SMatthew 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);
14620f66a230SMatthew G. Knepley       }
14630f66a230SMatthew G. Knepley       if (o >= 0) *pos = PETSC_TRUE;
14640f66a230SMatthew G. Knepley       else        *pos = PETSC_FALSE;
14650f66a230SMatthew G. Knepley       break;
14660f66a230SMatthew G. Knepley     }
14670f66a230SMatthew G. Knepley   }
14680f66a230SMatthew 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);
14690f66a230SMatthew G. Knepley   PetscFunctionReturn(0);
14700f66a230SMatthew G. Knepley }
14710f66a230SMatthew G. Knepley 
14720f66a230SMatthew G. Knepley #undef __FUNCT__
14732be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete"
1474cd0c2139SMatthew G Knepley /*@
14750f66a230SMatthew G. Knepley   DMPlexLabelCohesiveComplete - Starting with a label marking points on an internal surface, we add all other mesh pieces
1476cd0c2139SMatthew G Knepley   to complete the surface
1477cd0c2139SMatthew G Knepley 
1478cd0c2139SMatthew G Knepley   Input Parameters:
1479cd0c2139SMatthew G Knepley + dm     - The DM
14800f66a230SMatthew G. Knepley . label  - A DMLabel marking the surface
14810f66a230SMatthew G. Knepley . blabel - A DMLabel marking the vertices on the boundary which will not be duplicated, or NULL to find them automatically
1482bb55d314SMatthew G. Knepley . flip   - Flag to flip the submesh normal and replace points on the other side
148347946fd8SMatthew G. Knepley - subdm  - The subDM associated with the label, or NULL
1484cd0c2139SMatthew G Knepley 
1485cd0c2139SMatthew G Knepley   Output Parameter:
1486cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points
1487cd0c2139SMatthew G Knepley 
14880f66a230SMatthew G. Knepley   Note: The vertices in blabel are called "unsplit" in the terminology from hybrid cell creation.
14890f66a230SMatthew G. Knepley 
1490cd0c2139SMatthew G Knepley   Level: developer
1491cd0c2139SMatthew G Knepley 
14922be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete()
1493cd0c2139SMatthew G Knepley @*/
14940f66a230SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, DMLabel blabel, PetscBool flip, DM subdm)
1495cd0c2139SMatthew G Knepley {
1496d90583fdSMatthew G. Knepley   DMLabel         depthLabel;
149786200784SMatthew G. Knepley   IS              dimIS, subpointIS, facePosIS, faceNegIS, crossEdgeIS = NULL;
149847946fd8SMatthew G. Knepley   const PetscInt *points, *subpoints;
1499bb55d314SMatthew G. Knepley   const PetscInt  rev   = flip ? -1 : 1;
1500370472baSMatthew G. Knepley   PetscInt       *pMax;
1501370472baSMatthew G. Knepley   PetscInt        shift = 100, shift2 = 200, dim, depth, pSize, dep, cStart, cEnd, cMax, fStart, fEnd, vStart, vEnd, numPoints, numSubpoints, p, val;
1502cd0c2139SMatthew G Knepley   PetscErrorCode  ierr;
1503cd0c2139SMatthew G Knepley 
1504cd0c2139SMatthew G Knepley   PetscFunctionBegin;
1505370472baSMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1506370472baSMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
1507370472baSMatthew G. Knepley   pSize = PetscMax(depth, dim) + 1;
1508370472baSMatthew G. Knepley   ierr = PetscMalloc1(pSize,&pMax);CHKERRQ(ierr);
1509370472baSMatthew 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);
1510d90583fdSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr);
1511c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
151247946fd8SMatthew G. Knepley   if (subdm) {
151347946fd8SMatthew G. Knepley     ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr);
151447946fd8SMatthew G. Knepley     if (subpointIS) {
151547946fd8SMatthew G. Knepley       ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr);
151647946fd8SMatthew G. Knepley       ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr);
151747946fd8SMatthew G. Knepley     }
151847946fd8SMatthew G. Knepley   }
1519d7c8f101SMatthew G. Knepley   /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */
1520cd0c2139SMatthew G Knepley   ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr);
1521dc86033cSMatthew G. Knepley   if (!dimIS) {
1522dc86033cSMatthew G. Knepley     ierr = PetscFree(pMax);CHKERRQ(ierr);
1523dc86033cSMatthew G. Knepley     PetscFunctionReturn(0);
1524dc86033cSMatthew G. Knepley   }
1525cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1526cd0c2139SMatthew G Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1527d7c8f101SMatthew G. Knepley   for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */
1528cd0c2139SMatthew G Knepley     const PetscInt *support;
1529cd0c2139SMatthew G Knepley     PetscInt        supportSize, s;
1530cd0c2139SMatthew G Knepley 
1531cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr);
1532cd0c2139SMatthew G Knepley     if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize);
1533cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr);
1534cd0c2139SMatthew G Knepley     for (s = 0; s < supportSize; ++s) {
15350f66a230SMatthew G. Knepley       const PetscInt *cone;
1536cd0c2139SMatthew G Knepley       PetscInt        coneSize, c;
15370f66a230SMatthew G. Knepley       PetscBool       pos;
1538cd0c2139SMatthew G Knepley 
15390f66a230SMatthew G. Knepley       ierr = GetSurfaceSide_Static(dm, subdm, numSubpoints, subpoints, support[s], points[p], &pos);CHKERRQ(ierr);
15400f66a230SMatthew G. Knepley       if (pos) {ierr = DMLabelSetValue(label, support[s],  rev*(shift+dim));CHKERRQ(ierr);}
15410f66a230SMatthew G. Knepley       else     {ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);}
15420f66a230SMatthew G. Knepley       if (rev < 0) pos = !pos ? PETSC_TRUE : PETSC_FALSE;
15430f66a230SMatthew G. Knepley       /* Put faces touching the fault in the label */
1544cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
1545cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
1546cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
1547cd0c2139SMatthew G Knepley         const PetscInt point = cone[c];
1548cd0c2139SMatthew G Knepley 
1549cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1550cd0c2139SMatthew G Knepley         if (val == -1) {
1551cd0c2139SMatthew G Knepley           PetscInt *closure = NULL;
1552cd0c2139SMatthew G Knepley           PetscInt  closureSize, cl;
1553cd0c2139SMatthew G Knepley 
1554cd0c2139SMatthew G Knepley           ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1555cd0c2139SMatthew G Knepley           for (cl = 0; cl < closureSize*2; cl += 2) {
1556cd0c2139SMatthew G Knepley             const PetscInt clp  = closure[cl];
1557a0541d8aSMatthew G. Knepley             PetscInt       bval = -1;
1558cd0c2139SMatthew G Knepley 
1559cd0c2139SMatthew G Knepley             ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr);
1560a0541d8aSMatthew G. Knepley             if (blabel) {ierr = DMLabelGetValue(blabel, clp, &bval);CHKERRQ(ierr);}
1561a0541d8aSMatthew G. Knepley             if ((val >= 0) && (val < dim-1) && (bval < 0)) {
1562cd0c2139SMatthew G Knepley               ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr);
1563cd0c2139SMatthew G Knepley               break;
1564cd0c2139SMatthew G Knepley             }
1565cd0c2139SMatthew G Knepley           }
1566cd0c2139SMatthew G Knepley           ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1567cd0c2139SMatthew G Knepley         }
1568cd0c2139SMatthew G Knepley       }
1569cd0c2139SMatthew G Knepley     }
1570cd0c2139SMatthew G Knepley   }
15710f66a230SMatthew G. Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
15720f66a230SMatthew G. Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
157347946fd8SMatthew G. Knepley   if (subdm) {
157447946fd8SMatthew G. Knepley     if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);}
157547946fd8SMatthew G. Knepley     ierr = ISDestroy(&subpointIS);CHKERRQ(ierr);
157647946fd8SMatthew G. Knepley   }
1577a0541d8aSMatthew G. Knepley   /* Mark boundary points as unsplit */
157886200784SMatthew G. Knepley   if (blabel) {
1579a0541d8aSMatthew G. Knepley     ierr = DMLabelGetStratumIS(blabel, 1, &dimIS);CHKERRQ(ierr);
1580a0541d8aSMatthew G. Knepley     ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1581a0541d8aSMatthew G. Knepley     ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1582a0541d8aSMatthew G. Knepley     for (p = 0; p < numPoints; ++p) {
1583a0541d8aSMatthew G. Knepley       const PetscInt point = points[p];
1584a0541d8aSMatthew G. Knepley       PetscInt       val, bval;
1585a0541d8aSMatthew G. Knepley 
1586a0541d8aSMatthew G. Knepley       ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr);
1587a0541d8aSMatthew G. Knepley       if (bval >= 0) {
1588f7019248SMatthew G. Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1589f7019248SMatthew G. Knepley         if ((val < 0) || (val > dim)) {
1590f7019248SMatthew G. Knepley           /* This could be a point added from splitting a vertex on an adjacent fault, otherwise its just wrong */
1591f7019248SMatthew G. Knepley           ierr = DMLabelClearValue(blabel, point, bval);CHKERRQ(ierr);
1592f7019248SMatthew G. Knepley         }
1593f7019248SMatthew G. Knepley       }
1594f7019248SMatthew G. Knepley     }
1595f7019248SMatthew G. Knepley     for (p = 0; p < numPoints; ++p) {
1596f7019248SMatthew G. Knepley       const PetscInt point = points[p];
1597f7019248SMatthew G. Knepley       PetscInt       val, bval;
1598f7019248SMatthew G. Knepley 
1599f7019248SMatthew G. Knepley       ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr);
1600f7019248SMatthew G. Knepley       if (bval >= 0) {
160186200784SMatthew G. Knepley         const PetscInt *cone,    *support;
160286200784SMatthew G. Knepley         PetscInt        coneSize, supportSize, s, valA, valB, valE;
160386200784SMatthew G. Knepley 
1604a0541d8aSMatthew G. Knepley         /* Mark as unsplit */
1605a0541d8aSMatthew G. Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1606a0541d8aSMatthew 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);
1607a0541d8aSMatthew G. Knepley         ierr = DMLabelClearValue(label, point, val);CHKERRQ(ierr);
1608a0541d8aSMatthew G. Knepley         ierr = DMLabelSetValue(label, point, shift2+val);CHKERRQ(ierr);
16092c06a818SMatthew G. Knepley         /* Check for cross-edge
16102c06a818SMatthew G. Knepley              A cross-edge has endpoints which are both on the boundary of the surface, but the edge itself is not. */
161186200784SMatthew G. Knepley         if (val != 0) continue;
161286200784SMatthew G. Knepley         ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr);
161386200784SMatthew G. Knepley         ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr);
161486200784SMatthew G. Knepley         for (s = 0; s < supportSize; ++s) {
161586200784SMatthew G. Knepley           ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
161686200784SMatthew G. Knepley           ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
161786200784SMatthew G. Knepley           if (coneSize != 2) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Edge %D has %D vertices != 2", support[s], coneSize);
161886200784SMatthew G. Knepley           ierr = DMLabelGetValue(blabel, cone[0], &valA);CHKERRQ(ierr);
161986200784SMatthew G. Knepley           ierr = DMLabelGetValue(blabel, cone[1], &valB);CHKERRQ(ierr);
162086200784SMatthew G. Knepley           ierr = DMLabelGetValue(blabel, support[s], &valE);CHKERRQ(ierr);
162109816f77SMatthew G. Knepley           if ((valE < 0) && (valA >= 0) && (valB >= 0) && (cone[0] != cone[1])) {ierr = DMLabelSetValue(blabel, support[s], 2);CHKERRQ(ierr);}
162286200784SMatthew G. Knepley         }
1623a0541d8aSMatthew G. Knepley       }
1624a0541d8aSMatthew G. Knepley     }
1625a0541d8aSMatthew G. Knepley     ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
1626a0541d8aSMatthew G. Knepley     ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
1627a0541d8aSMatthew G. Knepley   }
1628cd0c2139SMatthew G Knepley   /* Search for other cells/faces/edges connected to the fault by a vertex */
1629c4d480a2SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
1630cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
1631d24f5ce5SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
1632d24f5ce5SMatthew G. Knepley   cMax = cMax < 0 ? cEnd : cMax;
16330f66a230SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr);
1634cd0c2139SMatthew G Knepley   ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr);
163586200784SMatthew G. Knepley   if (blabel) {ierr = DMLabelGetStratumIS(blabel, 2, &crossEdgeIS);CHKERRQ(ierr);}
163686200784SMatthew G. Knepley   if (dimIS && crossEdgeIS) {
163786200784SMatthew G. Knepley     IS vertIS = dimIS;
163886200784SMatthew G. Knepley 
163986200784SMatthew G. Knepley     ierr = ISExpand(vertIS, crossEdgeIS, &dimIS);CHKERRQ(ierr);
164086200784SMatthew G. Knepley     ierr = ISDestroy(&crossEdgeIS);CHKERRQ(ierr);
164186200784SMatthew G. Knepley     ierr = ISDestroy(&vertIS);CHKERRQ(ierr);
164286200784SMatthew G. Knepley   }
1643dc86033cSMatthew G. Knepley   if (!dimIS) {
1644dc86033cSMatthew G. Knepley     ierr = PetscFree(pMax);CHKERRQ(ierr);
1645dc86033cSMatthew G. Knepley     PetscFunctionReturn(0);
1646dc86033cSMatthew G. Knepley   }
1647cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1648cd0c2139SMatthew G Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1649d7c8f101SMatthew G. Knepley   for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */
1650cd0c2139SMatthew G Knepley     PetscInt *star = NULL;
165186200784SMatthew G. Knepley     PetscInt  starSize, s;
1652cd0c2139SMatthew G Knepley     PetscInt  again = 1;  /* 0: Finished 1: Keep iterating after a change 2: No change */
1653cd0c2139SMatthew G Knepley 
1654d4622b2cSMatthew G. Knepley     /* All points connected to the fault are inside a cell, so at the top level we will only check cells */
1655cd0c2139SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1656cd0c2139SMatthew G Knepley     while (again) {
1657cd0c2139SMatthew G Knepley       if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault");
1658cd0c2139SMatthew G Knepley       again = 0;
1659cd0c2139SMatthew G Knepley       for (s = 0; s < starSize*2; s += 2) {
1660cd0c2139SMatthew G Knepley         const PetscInt  point = star[s];
1661cd0c2139SMatthew G Knepley         const PetscInt *cone;
1662cd0c2139SMatthew G Knepley         PetscInt        coneSize, c;
1663cd0c2139SMatthew G Knepley 
1664d24f5ce5SMatthew G. Knepley         if ((point < cStart) || (point >= cMax)) continue;
1665cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1666cd0c2139SMatthew G Knepley         if (val != -1) continue;
1667d4622b2cSMatthew G. Knepley         again = again == 1 ? 1 : 2;
1668cd0c2139SMatthew G Knepley         ierr  = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
1669cd0c2139SMatthew G Knepley         ierr  = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
1670cd0c2139SMatthew G Knepley         for (c = 0; c < coneSize; ++c) {
1671cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr);
1672cd0c2139SMatthew G Knepley           if (val != -1) {
1673d7c8f101SMatthew G. Knepley             const PetscInt *ccone;
1674166d9d0cSMatthew G. Knepley             PetscInt        cconeSize, cc, side;
1675d7c8f101SMatthew G. Knepley 
1676db8edaafSMatthew 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);
167737a6de01SMatthew G. Knepley             if (val > 0) side =  1;
167837a6de01SMatthew G. Knepley             else         side = -1;
167937a6de01SMatthew G. Knepley             ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr);
1680d7c8f101SMatthew G. Knepley             /* Mark cell faces which touch the fault */
1681d7c8f101SMatthew G. Knepley             ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr);
1682d7c8f101SMatthew G. Knepley             ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr);
1683d7c8f101SMatthew G. Knepley             for (cc = 0; cc < cconeSize; ++cc) {
1684d7c8f101SMatthew G. Knepley               PetscInt *closure = NULL;
1685d7c8f101SMatthew G. Knepley               PetscInt  closureSize, cl;
1686d7c8f101SMatthew G. Knepley 
1687166d9d0cSMatthew G. Knepley               ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr);
1688166d9d0cSMatthew G. Knepley               if (val != -1) continue;
1689d7c8f101SMatthew G. Knepley               ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1690d4622b2cSMatthew G. Knepley               for (cl = 0; cl < closureSize*2; cl += 2) {
1691d7c8f101SMatthew G. Knepley                 const PetscInt clp = closure[cl];
1692d7c8f101SMatthew G. Knepley 
1693d7c8f101SMatthew G. Knepley                 ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr);
1694d7c8f101SMatthew G. Knepley                 if (val == -1) continue;
1695d7c8f101SMatthew G. Knepley                 ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr);
169637a6de01SMatthew G. Knepley                 break;
169737a6de01SMatthew G. Knepley               }
1698d7c8f101SMatthew G. Knepley               ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1699cd0c2139SMatthew G Knepley             }
1700cd0c2139SMatthew G Knepley             again = 1;
1701cd0c2139SMatthew G Knepley             break;
1702cd0c2139SMatthew G Knepley           }
1703cd0c2139SMatthew G Knepley         }
1704cd0c2139SMatthew G Knepley       }
1705cd0c2139SMatthew G Knepley     }
1706cd0c2139SMatthew G Knepley     /* Classify the rest by cell membership */
1707cd0c2139SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1708cd0c2139SMatthew G Knepley       const PetscInt point = star[s];
1709cd0c2139SMatthew G Knepley 
1710cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1711cd0c2139SMatthew G Knepley       if (val == -1) {
1712cd0c2139SMatthew G Knepley         PetscInt  *sstar = NULL;
1713cd0c2139SMatthew G Knepley         PetscInt   sstarSize, ss;
1714cd0c2139SMatthew G Knepley         PetscBool  marked = PETSC_FALSE;
1715cd0c2139SMatthew G Knepley 
1716cd0c2139SMatthew G Knepley         ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr);
1717cd0c2139SMatthew G Knepley         for (ss = 0; ss < sstarSize*2; ss += 2) {
1718cd0c2139SMatthew G Knepley           const PetscInt spoint = sstar[ss];
1719cd0c2139SMatthew G Knepley 
1720d24f5ce5SMatthew G. Knepley           if ((spoint < cStart) || (spoint >= cMax)) continue;
1721cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr);
1722cd0c2139SMatthew 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);
1723d90583fdSMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr);
1724cd0c2139SMatthew G Knepley           if (val > 0) {
1725cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, point,   shift+dep);CHKERRQ(ierr);
1726cd0c2139SMatthew G Knepley           } else {
1727cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr);
1728cd0c2139SMatthew G Knepley           }
1729cd0c2139SMatthew G Knepley           marked = PETSC_TRUE;
1730cd0c2139SMatthew G Knepley           break;
1731cd0c2139SMatthew G Knepley         }
1732cd0c2139SMatthew G Knepley         ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr);
1733370472baSMatthew G. Knepley         ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr);
1734370472baSMatthew G. Knepley         if (point < pMax[dep] && !marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point);
1735cd0c2139SMatthew G Knepley       }
1736cd0c2139SMatthew G Knepley     }
1737cd0c2139SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1738cd0c2139SMatthew G Knepley   }
1739cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
1740cd0c2139SMatthew G Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
174118c5995bSMatthew G. Knepley   /* If any faces touching the fault divide cells on either side, split them */
174218c5995bSMatthew G. Knepley   ierr = DMLabelGetStratumIS(label,   shift+dim-1,  &facePosIS);CHKERRQ(ierr);
174318c5995bSMatthew G. Knepley   ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr);
174418c5995bSMatthew G. Knepley   ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr);
174518c5995bSMatthew G. Knepley   ierr = ISDestroy(&facePosIS);CHKERRQ(ierr);
174618c5995bSMatthew G. Knepley   ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr);
174718c5995bSMatthew G. Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
174818c5995bSMatthew G. Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
174918c5995bSMatthew G. Knepley   for (p = 0; p < numPoints; ++p) {
175018c5995bSMatthew G. Knepley     const PetscInt  point = points[p];
175118c5995bSMatthew G. Knepley     const PetscInt *support;
175218c5995bSMatthew G. Knepley     PetscInt        supportSize, valA, valB;
175318c5995bSMatthew G. Knepley 
175418c5995bSMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr);
175518c5995bSMatthew G. Knepley     if (supportSize != 2) continue;
175618c5995bSMatthew G. Knepley     ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr);
175718c5995bSMatthew G. Knepley     ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr);
175818c5995bSMatthew G. Knepley     ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr);
175918c5995bSMatthew G. Knepley     if ((valA == -1) || (valB == -1)) continue;
176018c5995bSMatthew G. Knepley     if (valA*valB > 0) continue;
176118c5995bSMatthew G. Knepley     /* Split the face */
176218c5995bSMatthew G. Knepley     ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr);
176318c5995bSMatthew G. Knepley     ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr);
176418c5995bSMatthew G. Knepley     ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr);
1765e1757548SMatthew G. Knepley     /* Label its closure:
1766e1757548SMatthew G. Knepley       unmarked: label as unsplit
1767e1757548SMatthew G. Knepley       incident: relabel as split
1768e1757548SMatthew G. Knepley       split:    do nothing
1769e1757548SMatthew G. Knepley     */
177018c5995bSMatthew G. Knepley     {
177118c5995bSMatthew G. Knepley       PetscInt *closure = NULL;
177218c5995bSMatthew G. Knepley       PetscInt  closureSize, cl;
177318c5995bSMatthew G. Knepley 
177418c5995bSMatthew G. Knepley       ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
177518c5995bSMatthew G. Knepley       for (cl = 0; cl < closureSize*2; cl += 2) {
177618c5995bSMatthew G. Knepley         ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr);
17778771c1d3SMatthew G. Knepley         if (valA == -1) { /* Mark as unsplit */
177818c5995bSMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr);
177918c5995bSMatthew G. Knepley           ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr);
17808771c1d3SMatthew G. Knepley         } else if (((valA >= shift) && (valA < shift2)) || ((valA <= -shift) && (valA > -shift2))) {
1781e1757548SMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr);
1782e1757548SMatthew G. Knepley           ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr);
1783e1757548SMatthew G. Knepley           ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr);
1784e1757548SMatthew G. Knepley         }
178518c5995bSMatthew G. Knepley       }
178618c5995bSMatthew G. Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
178718c5995bSMatthew G. Knepley     }
178818c5995bSMatthew G. Knepley   }
178918c5995bSMatthew G. Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
179018c5995bSMatthew G. Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
1791370472baSMatthew G. Knepley   ierr = PetscFree(pMax);CHKERRQ(ierr);
1792cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1793cd0c2139SMatthew G Knepley }
1794cd0c2139SMatthew G Knepley 
1795cd0c2139SMatthew G Knepley #undef __FUNCT__
17963cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh"
17973cf72582SMatthew G. Knepley /*@C
17983cf72582SMatthew G. Knepley   DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface
17993cf72582SMatthew G. Knepley 
18003cf72582SMatthew G. Knepley   Collective on dm
18013cf72582SMatthew G. Knepley 
18023cf72582SMatthew G. Knepley   Input Parameters:
18033cf72582SMatthew G. Knepley + dm - The original DM
18043cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices
18053cf72582SMatthew G. Knepley 
18063cf72582SMatthew G. Knepley   Output Parameters:
18073cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface
18083cf72582SMatthew G. Knepley - dmHybrid - The new DM
18093cf72582SMatthew G. Knepley 
18103cf72582SMatthew G. Knepley   Level: developer
18113cf72582SMatthew G. Knepley 
18123cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate()
18133cf72582SMatthew G. Knepley @*/
18143cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid)
18153cf72582SMatthew G. Knepley {
18163cf72582SMatthew G. Knepley   DM             idm;
18173cf72582SMatthew G. Knepley   DMLabel        subpointMap, hlabel;
18183cf72582SMatthew G. Knepley   PetscInt       dim;
18193cf72582SMatthew G. Knepley   PetscErrorCode ierr;
18203cf72582SMatthew G. Knepley 
18213cf72582SMatthew G. Knepley   PetscFunctionBegin;
18223cf72582SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
18233cf72582SMatthew G. Knepley   if (hybridLabel) PetscValidPointer(hybridLabel, 3);
18243cf72582SMatthew G. Knepley   PetscValidPointer(dmHybrid, 4);
1825c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
18263cf72582SMatthew G. Knepley   ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr);
18273cf72582SMatthew G. Knepley   ierr = DMPlexOrient(idm);CHKERRQ(ierr);
18283cf72582SMatthew G. Knepley   ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr);
18293cf72582SMatthew G. Knepley   ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr);
18303cf72582SMatthew G. Knepley   ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr);
18310f66a230SMatthew G. Knepley   ierr = DMPlexLabelCohesiveComplete(dm, hlabel, NULL, PETSC_FALSE, idm);CHKERRQ(ierr);
18323cf72582SMatthew G. Knepley   ierr = DMDestroy(&idm);CHKERRQ(ierr);
18333cf72582SMatthew G. Knepley   ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr);
18343cf72582SMatthew G. Knepley   if (hybridLabel) *hybridLabel = hlabel;
183553aa2e23SMatthew G. Knepley   else             {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);}
1836e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
1837e6ccafaeSMatthew G Knepley }
1838e6ccafaeSMatthew G Knepley 
1839e6ccafaeSMatthew G Knepley #undef __FUNCT__
1840efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated"
1841efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that:
1842efa14ee0SMatthew G Knepley 
1843efa14ee0SMatthew G Knepley      For any marked cell, the marked vertices constitute a single face
1844efa14ee0SMatthew G Knepley */
1845830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm)
1846efa14ee0SMatthew G Knepley {
1847fed694aaSMatthew G. Knepley   IS               subvertexIS = NULL;
1848efa14ee0SMatthew G Knepley   const PetscInt  *subvertices;
184977d178adSMatthew G. Knepley   PetscInt        *pStart, *pEnd, *pMax, pSize;
1850efa14ee0SMatthew G Knepley   PetscInt         depth, dim, d, numSubVerticesInitial = 0, v;
1851efa14ee0SMatthew G Knepley   PetscErrorCode   ierr;
1852efa14ee0SMatthew G Knepley 
1853efa14ee0SMatthew G Knepley   PetscFunctionBegin;
1854efa14ee0SMatthew G Knepley   *numFaces = 0;
1855efa14ee0SMatthew G Knepley   *nFV      = 0;
1856efa14ee0SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1857c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
185877d178adSMatthew G. Knepley   pSize = PetscMax(depth, dim) + 1;
1859dcca6d9dSJed Brown   ierr = PetscMalloc3(pSize,&pStart,pSize,&pEnd,pSize,&pMax);CHKERRQ(ierr);
1860d92e47f8SMatthew 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);
1861efa14ee0SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
1862efa14ee0SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1863efa14ee0SMatthew G Knepley     if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]);
1864efa14ee0SMatthew G Knepley   }
1865efa14ee0SMatthew G Knepley   /* Loop over initial vertices and mark all faces in the collective star() */
1866fed694aaSMatthew G. Knepley   if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);}
1867efa14ee0SMatthew G Knepley   if (subvertexIS) {
1868efa14ee0SMatthew G Knepley     ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr);
1869efa14ee0SMatthew G Knepley     ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1870efa14ee0SMatthew G Knepley   }
1871efa14ee0SMatthew G Knepley   for (v = 0; v < numSubVerticesInitial; ++v) {
1872efa14ee0SMatthew G Knepley     const PetscInt vertex = subvertices[v];
18730298fd71SBarry Smith     PetscInt      *star   = NULL;
1874efa14ee0SMatthew G Knepley     PetscInt       starSize, s, numCells = 0, c;
1875efa14ee0SMatthew G Knepley 
1876efa14ee0SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1877efa14ee0SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1878efa14ee0SMatthew G Knepley       const PetscInt point = star[s];
1879efa14ee0SMatthew G Knepley       if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point;
1880efa14ee0SMatthew G Knepley     }
1881efa14ee0SMatthew G Knepley     for (c = 0; c < numCells; ++c) {
1882efa14ee0SMatthew G Knepley       const PetscInt cell    = star[c];
18830298fd71SBarry Smith       PetscInt      *closure = NULL;
1884efa14ee0SMatthew G Knepley       PetscInt       closureSize, cl;
1885efa14ee0SMatthew G Knepley       PetscInt       cellLoc, numCorners = 0, faceSize = 0;
1886efa14ee0SMatthew G Knepley 
1887efa14ee0SMatthew G Knepley       ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr);
188865560c7fSMatthew G Knepley       if (cellLoc == 2) continue;
188982f516ccSBarry Smith       if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc);
1890efa14ee0SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1891efa14ee0SMatthew G Knepley       for (cl = 0; cl < closureSize*2; cl += 2) {
1892efa14ee0SMatthew G Knepley         const PetscInt point = closure[cl];
1893efa14ee0SMatthew G Knepley         PetscInt       vertexLoc;
1894efa14ee0SMatthew G Knepley 
1895efa14ee0SMatthew G Knepley         if ((point >= pStart[0]) && (point < pEnd[0])) {
1896efa14ee0SMatthew G Knepley           ++numCorners;
1897efa14ee0SMatthew G Knepley           ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr);
1898830e53efSMatthew G. Knepley           if (vertexLoc == value) closure[faceSize++] = point;
1899efa14ee0SMatthew G Knepley         }
1900efa14ee0SMatthew G Knepley       }
190118ad9376SMatthew G. Knepley       if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);}
190282f516ccSBarry 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);
1903efa14ee0SMatthew G Knepley       if (faceSize == *nFV) {
1904007baee2SMatthew G. Knepley         const PetscInt *cells = NULL;
1905007baee2SMatthew G. Knepley         PetscInt        numCells, nc;
1906007baee2SMatthew G. Knepley 
1907efa14ee0SMatthew G Knepley         ++(*numFaces);
1908efa14ee0SMatthew G Knepley         for (cl = 0; cl < faceSize; ++cl) {
1909efa14ee0SMatthew G Knepley           ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr);
1910efa14ee0SMatthew G Knepley         }
1911007baee2SMatthew G. Knepley         ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr);
1912007baee2SMatthew G. Knepley         for (nc = 0; nc < numCells; ++nc) {
1913007baee2SMatthew G. Knepley           ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr);
1914007baee2SMatthew G. Knepley         }
1915007baee2SMatthew G. Knepley         ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr);
1916efa14ee0SMatthew G Knepley       }
1917efa14ee0SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1918efa14ee0SMatthew G Knepley     }
1919efa14ee0SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1920efa14ee0SMatthew G Knepley   }
1921efa14ee0SMatthew G Knepley   if (subvertexIS) {
1922efa14ee0SMatthew G Knepley     ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1923efa14ee0SMatthew G Knepley   }
1924efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
1925efa14ee0SMatthew G Knepley   ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr);
1926efa14ee0SMatthew G Knepley   PetscFunctionReturn(0);
1927efa14ee0SMatthew G Knepley }
1928efa14ee0SMatthew G Knepley 
1929efa14ee0SMatthew G Knepley #undef __FUNCT__
1930efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated"
1931830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm)
1932efa14ee0SMatthew G Knepley {
193334b4c39eSMatthew G. Knepley   IS               subvertexIS = NULL;
1934efa14ee0SMatthew G Knepley   const PetscInt  *subvertices;
1935efa14ee0SMatthew G Knepley   PetscInt        *pStart, *pEnd, *pMax;
1936efa14ee0SMatthew G Knepley   PetscInt         dim, d, numSubVerticesInitial = 0, v;
1937efa14ee0SMatthew G Knepley   PetscErrorCode   ierr;
1938efa14ee0SMatthew G Knepley 
1939efa14ee0SMatthew G Knepley   PetscFunctionBegin;
1940c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
1941dcca6d9dSJed Brown   ierr = PetscMalloc3(dim+1,&pStart,dim+1,&pEnd,dim+1,&pMax);CHKERRQ(ierr);
19420298fd71SBarry Smith   ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr);
1943efa14ee0SMatthew G Knepley   for (d = 0; d <= dim; ++d) {
1944efa14ee0SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1945efa14ee0SMatthew G Knepley     if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]);
1946efa14ee0SMatthew G Knepley   }
1947efa14ee0SMatthew G Knepley   /* Loop over initial vertices and mark all faces in the collective star() */
194834b4c39eSMatthew G. Knepley   if (vertexLabel) {
1949830e53efSMatthew G. Knepley     ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);
1950efa14ee0SMatthew G Knepley     if (subvertexIS) {
1951efa14ee0SMatthew G Knepley       ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr);
1952efa14ee0SMatthew G Knepley       ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1953efa14ee0SMatthew G Knepley     }
195434b4c39eSMatthew G. Knepley   }
1955efa14ee0SMatthew G Knepley   for (v = 0; v < numSubVerticesInitial; ++v) {
1956efa14ee0SMatthew G Knepley     const PetscInt vertex = subvertices[v];
19570298fd71SBarry Smith     PetscInt      *star   = NULL;
1958efa14ee0SMatthew G Knepley     PetscInt       starSize, s, numFaces = 0, f;
1959efa14ee0SMatthew G Knepley 
1960efa14ee0SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1961efa14ee0SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1962efa14ee0SMatthew G Knepley       const PetscInt point = star[s];
1963efa14ee0SMatthew G Knepley       if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point;
1964efa14ee0SMatthew G Knepley     }
1965efa14ee0SMatthew G Knepley     for (f = 0; f < numFaces; ++f) {
1966efa14ee0SMatthew G Knepley       const PetscInt face    = star[f];
19670298fd71SBarry Smith       PetscInt      *closure = NULL;
1968efa14ee0SMatthew G Knepley       PetscInt       closureSize, c;
1969efa14ee0SMatthew G Knepley       PetscInt       faceLoc;
1970efa14ee0SMatthew G Knepley 
1971efa14ee0SMatthew G Knepley       ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr);
1972efa14ee0SMatthew G Knepley       if (faceLoc == dim-1) continue;
197382f516ccSBarry Smith       if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc);
1974efa14ee0SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1975efa14ee0SMatthew G Knepley       for (c = 0; c < closureSize*2; c += 2) {
1976efa14ee0SMatthew G Knepley         const PetscInt point = closure[c];
1977efa14ee0SMatthew G Knepley         PetscInt       vertexLoc;
1978efa14ee0SMatthew G Knepley 
1979efa14ee0SMatthew G Knepley         if ((point >= pStart[0]) && (point < pEnd[0])) {
1980efa14ee0SMatthew G Knepley           ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr);
1981830e53efSMatthew G. Knepley           if (vertexLoc != value) break;
1982efa14ee0SMatthew G Knepley         }
1983efa14ee0SMatthew G Knepley       }
1984efa14ee0SMatthew G Knepley       if (c == closureSize*2) {
1985efa14ee0SMatthew G Knepley         const PetscInt *support;
1986efa14ee0SMatthew G Knepley         PetscInt        supportSize, s;
1987efa14ee0SMatthew G Knepley 
1988efa14ee0SMatthew G Knepley         for (c = 0; c < closureSize*2; c += 2) {
1989efa14ee0SMatthew G Knepley           const PetscInt point = closure[c];
1990efa14ee0SMatthew G Knepley 
1991efa14ee0SMatthew G Knepley           for (d = 0; d < dim; ++d) {
1992efa14ee0SMatthew G Knepley             if ((point >= pStart[d]) && (point < pEnd[d])) {
1993efa14ee0SMatthew G Knepley               ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr);
1994efa14ee0SMatthew G Knepley               break;
1995efa14ee0SMatthew G Knepley             }
1996efa14ee0SMatthew G Knepley           }
1997efa14ee0SMatthew G Knepley         }
1998efa14ee0SMatthew G Knepley         ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr);
1999efa14ee0SMatthew G Knepley         ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr);
2000efa14ee0SMatthew G Knepley         for (s = 0; s < supportSize; ++s) {
2001efa14ee0SMatthew G Knepley           ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr);
2002efa14ee0SMatthew G Knepley         }
2003efa14ee0SMatthew G Knepley       }
2004efa14ee0SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2005efa14ee0SMatthew G Knepley     }
2006efa14ee0SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
2007efa14ee0SMatthew G Knepley   }
200834b4c39eSMatthew G. Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);}
2009efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
2010efa14ee0SMatthew G Knepley   ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr);
2011efa14ee0SMatthew G Knepley   PetscFunctionReturn(0);
2012efa14ee0SMatthew G Knepley }
2013efa14ee0SMatthew G Knepley 
2014efa14ee0SMatthew G Knepley #undef __FUNCT__
2015766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated"
201627c04023SMatthew 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)
2017766ab985SMatthew G. Knepley {
201827c04023SMatthew G. Knepley   DMLabel         label = NULL;
2019766ab985SMatthew G. Knepley   const PetscInt *cone;
202027234c99SMatthew G. Knepley   PetscInt        dim, cMax, cEnd, c, subc = 0, p, coneSize;
2021766ab985SMatthew G. Knepley   PetscErrorCode  ierr;
2022766ab985SMatthew G. Knepley 
2023812bfc34SJed Brown   PetscFunctionBegin;
2024c0ed958bSJed Brown   *numFaces = 0;
2025c0ed958bSJed Brown   *nFV = 0;
2026b6d5cb33SJed Brown   if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);}
2027fed694aaSMatthew G. Knepley   *subCells = NULL;
2028c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
2029766ab985SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
2030766ab985SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
2031766ab985SMatthew G. Knepley   if (cMax < 0) PetscFunctionReturn(0);
203227c04023SMatthew G. Knepley   if (label) {
203327c04023SMatthew G. Knepley     for (c = cMax; c < cEnd; ++c) {
203427c04023SMatthew G. Knepley       PetscInt val;
203527c04023SMatthew G. Knepley 
203627c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
203727c04023SMatthew G. Knepley       if (val == value) {
203827c04023SMatthew G. Knepley         ++(*numFaces);
203927c04023SMatthew G. Knepley         ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
204027c04023SMatthew G. Knepley       }
204127c04023SMatthew G. Knepley     }
204227c04023SMatthew G. Knepley   } else {
2043766ab985SMatthew G. Knepley     *numFaces = cEnd - cMax;
204427c04023SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr);
204527c04023SMatthew G. Knepley   }
2046766ab985SMatthew G. Knepley   *nFV = hasLagrange ? coneSize/3 : coneSize/2;
2047785e854fSJed Brown   ierr = PetscMalloc1(*numFaces *2, subCells);CHKERRQ(ierr);
2048766ab985SMatthew G. Knepley   for (c = cMax; c < cEnd; ++c) {
2049766ab985SMatthew G. Knepley     const PetscInt *cells;
2050766ab985SMatthew G. Knepley     PetscInt        numCells;
2051766ab985SMatthew G. Knepley 
205227c04023SMatthew G. Knepley     if (label) {
205327c04023SMatthew G. Knepley       PetscInt val;
205427c04023SMatthew G. Knepley 
205527c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
205627c04023SMatthew G. Knepley       if (val != value) continue;
205727c04023SMatthew G. Knepley     }
2058766ab985SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
2059766ab985SMatthew G. Knepley     for (p = 0; p < *nFV; ++p) {
2060766ab985SMatthew G. Knepley       ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr);
2061766ab985SMatthew G. Knepley     }
2062766ab985SMatthew G. Knepley     /* Negative face */
2063766ab985SMatthew G. Knepley     ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr);
206427234c99SMatthew G. Knepley     /* Not true in parallel
206527234c99SMatthew G. Knepley     if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */
2066766ab985SMatthew G. Knepley     for (p = 0; p < numCells; ++p) {
2067766ab985SMatthew G. Knepley       ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr);
206827234c99SMatthew G. Knepley       (*subCells)[subc++] = cells[p];
2069766ab985SMatthew G. Knepley     }
2070766ab985SMatthew G. Knepley     ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr);
2071766ab985SMatthew G. Knepley     /* Positive face is not included */
2072766ab985SMatthew G. Knepley   }
2073766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
2074766ab985SMatthew G. Knepley }
2075766ab985SMatthew G. Knepley 
2076766ab985SMatthew G. Knepley #undef __FUNCT__
2077766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated"
20783982b651SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, DMLabel label, PetscInt value, DMLabel subpointMap, DM subdm)
2079766ab985SMatthew G. Knepley {
2080766ab985SMatthew G. Knepley   PetscInt      *pStart, *pEnd;
2081766ab985SMatthew G. Knepley   PetscInt       dim, cMax, cEnd, c, d;
2082766ab985SMatthew G. Knepley   PetscErrorCode ierr;
2083766ab985SMatthew G. Knepley 
2084812bfc34SJed Brown   PetscFunctionBegin;
2085c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
2086766ab985SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
2087766ab985SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
2088766ab985SMatthew G. Knepley   if (cMax < 0) PetscFunctionReturn(0);
2089dcca6d9dSJed Brown   ierr = PetscMalloc2(dim+1,&pStart,dim+1,&pEnd);CHKERRQ(ierr);
2090b3154360SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);}
2091766ab985SMatthew G. Knepley   for (c = cMax; c < cEnd; ++c) {
2092766ab985SMatthew G. Knepley     const PetscInt *cone;
2093766ab985SMatthew G. Knepley     PetscInt       *closure = NULL;
2094b3154360SMatthew G. Knepley     PetscInt        fconeSize, coneSize, closureSize, cl, val;
2095766ab985SMatthew G. Knepley 
209627c04023SMatthew G. Knepley     if (label) {
209727c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
209827c04023SMatthew G. Knepley       if (val != value) continue;
209927c04023SMatthew G. Knepley     }
2100766ab985SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
2101766ab985SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
2102b3154360SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr);
2103b3154360SMatthew G. Knepley     if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells");
2104b3154360SMatthew G. Knepley     /* Negative face */
2105766ab985SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2106766ab985SMatthew G. Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
2107766ab985SMatthew G. Knepley       const PetscInt point = closure[cl];
2108766ab985SMatthew G. Knepley 
2109766ab985SMatthew G. Knepley       for (d = 0; d <= dim; ++d) {
2110766ab985SMatthew G. Knepley         if ((point >= pStart[d]) && (point < pEnd[d])) {
2111766ab985SMatthew G. Knepley           ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr);
2112766ab985SMatthew G. Knepley           break;
2113766ab985SMatthew G. Knepley         }
2114766ab985SMatthew G. Knepley       }
2115766ab985SMatthew G. Knepley     }
2116766ab985SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2117766ab985SMatthew G. Knepley     /* Cells -- positive face is not included */
2118766ab985SMatthew G. Knepley     for (cl = 0; cl < 1; ++cl) {
2119766ab985SMatthew G. Knepley       const PetscInt *support;
2120766ab985SMatthew G. Knepley       PetscInt        supportSize, s;
2121766ab985SMatthew G. Knepley 
2122766ab985SMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr);
2123711de394SMatthew G. Knepley       /* if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); */
2124766ab985SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr);
2125766ab985SMatthew G. Knepley       for (s = 0; s < supportSize; ++s) {
2126766ab985SMatthew G. Knepley         ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr);
2127766ab985SMatthew G. Knepley       }
2128766ab985SMatthew G. Knepley     }
2129766ab985SMatthew G. Knepley   }
2130766ab985SMatthew G. Knepley   ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr);
2131766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
2132766ab985SMatthew G. Knepley }
2133766ab985SMatthew G. Knepley 
2134766ab985SMatthew G. Knepley #undef __FUNCT__
2135e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation"
2136e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented)
2137e6ccafaeSMatthew G Knepley {
213882f516ccSBarry Smith   MPI_Comm       comm;
2139e6ccafaeSMatthew G Knepley   PetscBool      posOrient = PETSC_FALSE;
2140e6ccafaeSMatthew G Knepley   const PetscInt debug     = 0;
2141e6ccafaeSMatthew G Knepley   PetscInt       cellDim, faceSize, f;
2142e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
2143e6ccafaeSMatthew G Knepley 
214482f516ccSBarry Smith   PetscFunctionBegin;
214582f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2146c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &cellDim);CHKERRQ(ierr);
2147e6ccafaeSMatthew G Knepley   if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);}
2148e6ccafaeSMatthew G Knepley 
2149ddeab2a6SMatthew G. Knepley   if (cellDim == 1 && numCorners == 2) {
2150ddeab2a6SMatthew G. Knepley     /* Triangle */
2151e6ccafaeSMatthew G Knepley     faceSize  = numCorners-1;
2152e6ccafaeSMatthew G Knepley     posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
2153ddeab2a6SMatthew G. Knepley   } else if (cellDim == 2 && numCorners == 3) {
2154ddeab2a6SMatthew G. Knepley     /* Triangle */
2155ddeab2a6SMatthew G. Knepley     faceSize  = numCorners-1;
2156ddeab2a6SMatthew G. Knepley     posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
2157ddeab2a6SMatthew G. Knepley   } else if (cellDim == 3 && numCorners == 4) {
2158ddeab2a6SMatthew G. Knepley     /* Tetrahedron */
2159ddeab2a6SMatthew G. Knepley     faceSize  = numCorners-1;
2160ddeab2a6SMatthew G. Knepley     posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
2161e6ccafaeSMatthew G Knepley   } else if (cellDim == 1 && numCorners == 3) {
2162e6ccafaeSMatthew G Knepley     /* Quadratic line */
2163e6ccafaeSMatthew G Knepley     faceSize  = 1;
2164e6ccafaeSMatthew G Knepley     posOrient = PETSC_TRUE;
2165e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 4) {
2166e6ccafaeSMatthew G Knepley     /* Quads */
2167e6ccafaeSMatthew G Knepley     faceSize = 2;
2168e6ccafaeSMatthew G Knepley     if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) {
2169e6ccafaeSMatthew G Knepley       posOrient = PETSC_TRUE;
2170e6ccafaeSMatthew G Knepley     } else if ((indices[0] == 3) && (indices[1] == 0)) {
2171e6ccafaeSMatthew G Knepley       posOrient = PETSC_TRUE;
2172e6ccafaeSMatthew G Knepley     } else {
2173e6ccafaeSMatthew G Knepley       if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) {
2174e6ccafaeSMatthew G Knepley         posOrient = PETSC_FALSE;
2175e6ccafaeSMatthew G Knepley       } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge");
2176e6ccafaeSMatthew G Knepley     }
2177e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 6) {
2178e6ccafaeSMatthew G Knepley     /* Quadratic triangle (I hate this) */
2179e6ccafaeSMatthew G Knepley     /* Edges are determined by the first 2 vertices (corners of edges) */
2180e6ccafaeSMatthew G Knepley     const PetscInt faceSizeTri = 3;
2181e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[3], i, iFace;
2182e6ccafaeSMatthew G Knepley     PetscBool      found                    = PETSC_FALSE;
2183e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTriSorted[9] = {
2184e6ccafaeSMatthew G Knepley       0, 3,  4, /* bottom */
2185e6ccafaeSMatthew G Knepley       1, 4,  5, /* right */
2186e6ccafaeSMatthew G Knepley       2, 3,  5, /* left */
2187e6ccafaeSMatthew G Knepley     };
2188e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTri[9] = {
2189e6ccafaeSMatthew G Knepley       0, 3,  4, /* bottom */
2190e6ccafaeSMatthew G Knepley       1, 4,  5, /* right */
2191e6ccafaeSMatthew G Knepley       2, 5,  3, /* left */
2192e6ccafaeSMatthew G Knepley     };
2193e6ccafaeSMatthew G Knepley 
2194e6ccafaeSMatthew G Knepley     faceSize = faceSizeTri;
2195e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i];
2196e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr);
2197e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 3; ++iFace) {
2198e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeTri;
2199e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2200e6ccafaeSMatthew G Knepley 
2201e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) &&
2202e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesTriSorted[ii+1])) {
2203e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) {
2204e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) {
2205e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesTri[ii+fVertex]) {
2206e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2207e6ccafaeSMatthew G Knepley               break;
2208e6ccafaeSMatthew G Knepley             }
2209e6ccafaeSMatthew G Knepley           }
2210e6ccafaeSMatthew G Knepley         }
2211e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2212e6ccafaeSMatthew G Knepley         break;
2213e6ccafaeSMatthew G Knepley       }
2214e6ccafaeSMatthew G Knepley     }
2215e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface");
2216e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2217e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2218e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 9) {
2219e6ccafaeSMatthew G Knepley     /* Quadratic quad (I hate this) */
2220e6ccafaeSMatthew G Knepley     /* Edges are determined by the first 2 vertices (corners of edges) */
2221e6ccafaeSMatthew G Knepley     const PetscInt faceSizeQuad = 3;
2222e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[3], i, iFace;
2223e6ccafaeSMatthew G Knepley     PetscBool      found                      = PETSC_FALSE;
2224e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadSorted[12] = {
2225e6ccafaeSMatthew G Knepley       0, 1,  4, /* bottom */
2226e6ccafaeSMatthew G Knepley       1, 2,  5, /* right */
2227e6ccafaeSMatthew G Knepley       2, 3,  6, /* top */
2228e6ccafaeSMatthew G Knepley       0, 3,  7, /* left */
2229e6ccafaeSMatthew G Knepley     };
2230e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuad[12] = {
2231e6ccafaeSMatthew G Knepley       0, 1,  4, /* bottom */
2232e6ccafaeSMatthew G Knepley       1, 2,  5, /* right */
2233e6ccafaeSMatthew G Knepley       2, 3,  6, /* top */
2234e6ccafaeSMatthew G Knepley       3, 0,  7, /* left */
2235e6ccafaeSMatthew G Knepley     };
2236e6ccafaeSMatthew G Knepley 
2237e6ccafaeSMatthew G Knepley     faceSize = faceSizeQuad;
2238e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i];
2239e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr);
2240e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 4; ++iFace) {
2241e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeQuad;
2242e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2243e6ccafaeSMatthew G Knepley 
2244e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) &&
2245e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) {
2246e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) {
2247e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) {
2248e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) {
2249e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2250e6ccafaeSMatthew G Knepley               break;
2251e6ccafaeSMatthew G Knepley             }
2252e6ccafaeSMatthew G Knepley           }
2253e6ccafaeSMatthew G Knepley         }
2254e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2255e6ccafaeSMatthew G Knepley         break;
2256e6ccafaeSMatthew G Knepley       }
2257e6ccafaeSMatthew G Knepley     }
2258e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface");
2259e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2260e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2261e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 8) {
2262e6ccafaeSMatthew G Knepley     /* Hexes
2263e6ccafaeSMatthew G Knepley        A hex is two oriented quads with the normal of the first
2264e6ccafaeSMatthew G Knepley        pointing up at the second.
2265e6ccafaeSMatthew G Knepley 
2266e6ccafaeSMatthew G Knepley           7---6
2267e6ccafaeSMatthew G Knepley          /|  /|
2268e6ccafaeSMatthew G Knepley         4---5 |
2269ddeab2a6SMatthew G. Knepley         | 1-|-2
2270e6ccafaeSMatthew G Knepley         |/  |/
2271ddeab2a6SMatthew G. Knepley         0---3
2272e6ccafaeSMatthew G Knepley 
2273e6ccafaeSMatthew G Knepley         Faces are determined by the first 4 vertices (corners of faces) */
2274e6ccafaeSMatthew G Knepley     const PetscInt faceSizeHex = 4;
2275e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[4], i, iFace;
2276e6ccafaeSMatthew G Knepley     PetscBool      found                     = PETSC_FALSE;
2277e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesHexSorted[24] = {
2278e6ccafaeSMatthew G Knepley       0, 1, 2, 3,  /* bottom */
2279e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  /* top */
2280ddeab2a6SMatthew G. Knepley       0, 3, 4, 5,  /* front */
2281ddeab2a6SMatthew G. Knepley       2, 3, 5, 6,  /* right */
2282ddeab2a6SMatthew G. Knepley       1, 2, 6, 7,  /* back */
2283ddeab2a6SMatthew G. Knepley       0, 1, 4, 7,  /* left */
2284e6ccafaeSMatthew G Knepley     };
2285e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesHex[24] = {
2286ddeab2a6SMatthew G. Knepley       1, 2, 3, 0,  /* bottom */
2287e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  /* top */
2288ddeab2a6SMatthew G. Knepley       0, 3, 5, 4,  /* front */
2289ddeab2a6SMatthew G. Knepley       3, 2, 6, 5,  /* right */
2290ddeab2a6SMatthew G. Knepley       2, 1, 7, 6,  /* back */
2291ddeab2a6SMatthew G. Knepley       1, 0, 4, 7,  /* left */
2292e6ccafaeSMatthew G Knepley     };
2293e6ccafaeSMatthew G Knepley 
2294e6ccafaeSMatthew G Knepley     faceSize = faceSizeHex;
2295e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i];
2296e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr);
2297e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 6; ++iFace) {
2298e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeHex;
2299e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2300e6ccafaeSMatthew G Knepley 
2301e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) &&
2302e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesHexSorted[ii+1]) &&
2303e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesHexSorted[ii+2]) &&
2304e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesHexSorted[ii+3])) {
2305e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) {
2306e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) {
2307e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesHex[ii+fVertex]) {
2308e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2309e6ccafaeSMatthew G Knepley               break;
2310e6ccafaeSMatthew G Knepley             }
2311e6ccafaeSMatthew G Knepley           }
2312e6ccafaeSMatthew G Knepley         }
2313e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2314e6ccafaeSMatthew G Knepley         break;
2315e6ccafaeSMatthew G Knepley       }
2316e6ccafaeSMatthew G Knepley     }
2317e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface");
2318e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2319e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2320e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 10) {
2321e6ccafaeSMatthew G Knepley     /* Quadratic tet */
2322e6ccafaeSMatthew G Knepley     /* Faces are determined by the first 3 vertices (corners of faces) */
2323e6ccafaeSMatthew G Knepley     const PetscInt faceSizeTet = 6;
2324e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[6], i, iFace;
2325e6ccafaeSMatthew G Knepley     PetscBool      found                     = PETSC_FALSE;
2326e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTetSorted[24] = {
2327e6ccafaeSMatthew G Knepley       0, 1, 2,  6, 7, 8, /* bottom */
2328e6ccafaeSMatthew G Knepley       0, 3, 4,  6, 7, 9,  /* front */
2329e6ccafaeSMatthew G Knepley       1, 4, 5,  7, 8, 9,  /* right */
2330e6ccafaeSMatthew G Knepley       2, 3, 5,  6, 8, 9,  /* left */
2331e6ccafaeSMatthew G Knepley     };
2332e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTet[24] = {
2333e6ccafaeSMatthew G Knepley       0, 1, 2,  6, 7, 8, /* bottom */
2334e6ccafaeSMatthew G Knepley       0, 4, 3,  6, 7, 9,  /* front */
2335e6ccafaeSMatthew G Knepley       1, 5, 4,  7, 8, 9,  /* right */
2336e6ccafaeSMatthew G Knepley       2, 3, 5,  8, 6, 9,  /* left */
2337e6ccafaeSMatthew G Knepley     };
2338e6ccafaeSMatthew G Knepley 
2339e6ccafaeSMatthew G Knepley     faceSize = faceSizeTet;
2340e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i];
2341e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr);
2342e6ccafaeSMatthew G Knepley     for (iFace=0; iFace < 4; ++iFace) {
2343e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeTet;
2344e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2345e6ccafaeSMatthew G Knepley 
2346e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) &&
2347e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesTetSorted[ii+1]) &&
2348e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesTetSorted[ii+2]) &&
2349e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesTetSorted[ii+3])) {
2350e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) {
2351e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) {
2352e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesTet[ii+fVertex]) {
2353e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2354e6ccafaeSMatthew G Knepley               break;
2355e6ccafaeSMatthew G Knepley             }
2356e6ccafaeSMatthew G Knepley           }
2357e6ccafaeSMatthew G Knepley         }
2358e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2359e6ccafaeSMatthew G Knepley         break;
2360e6ccafaeSMatthew G Knepley       }
2361e6ccafaeSMatthew G Knepley     }
2362e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface");
2363e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2364e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2365e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 27) {
2366e6ccafaeSMatthew G Knepley     /* Quadratic hexes (I hate this)
2367e6ccafaeSMatthew G Knepley        A hex is two oriented quads with the normal of the first
2368e6ccafaeSMatthew G Knepley        pointing up at the second.
2369e6ccafaeSMatthew G Knepley 
2370e6ccafaeSMatthew G Knepley          7---6
2371e6ccafaeSMatthew G Knepley         /|  /|
2372e6ccafaeSMatthew G Knepley        4---5 |
2373e6ccafaeSMatthew G Knepley        | 3-|-2
2374e6ccafaeSMatthew G Knepley        |/  |/
2375e6ccafaeSMatthew G Knepley        0---1
2376e6ccafaeSMatthew G Knepley 
2377e6ccafaeSMatthew G Knepley        Faces are determined by the first 4 vertices (corners of faces) */
2378e6ccafaeSMatthew G Knepley     const PetscInt faceSizeQuadHex = 9;
2379e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[9], i, iFace;
2380e6ccafaeSMatthew G Knepley     PetscBool      found                         = PETSC_FALSE;
2381e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadHexSorted[54] = {
2382e6ccafaeSMatthew G Knepley       0, 1, 2, 3,  8, 9, 10, 11,  24, /* bottom */
2383e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  12, 13, 14, 15,  25, /* top */
2384e6ccafaeSMatthew G Knepley       0, 1, 4, 5,  8, 12, 16, 17,  22, /* front */
2385e6ccafaeSMatthew G Knepley       1, 2, 5, 6,  9, 13, 17, 18,  21, /* right */
2386e6ccafaeSMatthew G Knepley       2, 3, 6, 7,  10, 14, 18, 19,  23, /* back */
2387e6ccafaeSMatthew G Knepley       0, 3, 4, 7,  11, 15, 16, 19,  20, /* left */
2388e6ccafaeSMatthew G Knepley     };
2389e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadHex[54] = {
2390e6ccafaeSMatthew G Knepley       3, 2, 1, 0,  10, 9, 8, 11,  24, /* bottom */
2391e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  12, 13, 14, 15,  25, /* top */
2392e6ccafaeSMatthew G Knepley       0, 1, 5, 4,  8, 17, 12, 16,  22, /* front */
2393e6ccafaeSMatthew G Knepley       1, 2, 6, 5,  9, 18, 13, 17,  21, /* right */
2394e6ccafaeSMatthew G Knepley       2, 3, 7, 6,  10, 19, 14, 18,  23, /* back */
2395e6ccafaeSMatthew G Knepley       3, 0, 4, 7,  11, 16, 15, 19,  20 /* left */
2396e6ccafaeSMatthew G Knepley     };
2397e6ccafaeSMatthew G Knepley 
2398e6ccafaeSMatthew G Knepley     faceSize = faceSizeQuadHex;
2399e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i];
2400e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr);
2401e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 6; ++iFace) {
2402e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeQuadHex;
2403e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2404e6ccafaeSMatthew G Knepley 
2405e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) &&
2406e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) &&
2407e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) &&
2408e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) {
2409e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) {
2410e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) {
2411e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) {
2412e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2413e6ccafaeSMatthew G Knepley               break;
2414e6ccafaeSMatthew G Knepley             }
2415e6ccafaeSMatthew G Knepley           }
2416e6ccafaeSMatthew G Knepley         }
2417e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2418e6ccafaeSMatthew G Knepley         break;
2419e6ccafaeSMatthew G Knepley       }
2420e6ccafaeSMatthew G Knepley     }
2421e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface");
2422e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2423e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2424e6ccafaeSMatthew G Knepley   } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation().");
2425e6ccafaeSMatthew G Knepley   if (!posOrient) {
2426e6ccafaeSMatthew G Knepley     if (debug) {ierr = PetscPrintf(comm, "  Reversing initial face orientation\n");CHKERRQ(ierr);}
2427e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f];
2428e6ccafaeSMatthew G Knepley   } else {
2429e6ccafaeSMatthew G Knepley     if (debug) {ierr = PetscPrintf(comm, "  Keeping initial face orientation\n");CHKERRQ(ierr);}
2430e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f];
2431e6ccafaeSMatthew G Knepley   }
2432e6ccafaeSMatthew G Knepley   if (posOriented) *posOriented = posOrient;
2433e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2434e6ccafaeSMatthew G Knepley }
2435e6ccafaeSMatthew G Knepley 
2436e6ccafaeSMatthew G Knepley #undef __FUNCT__
2437e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace"
2438e6ccafaeSMatthew G Knepley /*
2439e6ccafaeSMatthew G Knepley     Given a cell and a face, as a set of vertices,
2440e6ccafaeSMatthew G Knepley       return the oriented face, as a set of vertices, in faceVertices
2441e6ccafaeSMatthew G Knepley     The orientation is such that the face normal points out of the cell
2442e6ccafaeSMatthew G Knepley */
2443e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented)
2444e6ccafaeSMatthew G Knepley {
24450298fd71SBarry Smith   const PetscInt *cone = NULL;
2446e6ccafaeSMatthew G Knepley   PetscInt        coneSize, v, f, v2;
2447e6ccafaeSMatthew G Knepley   PetscInt        oppositeVertex = -1;
2448e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2449e6ccafaeSMatthew G Knepley 
2450e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
2451e6ccafaeSMatthew G Knepley   ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr);
2452e6ccafaeSMatthew G Knepley   ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
2453e6ccafaeSMatthew G Knepley   for (v = 0, v2 = 0; v < coneSize; ++v) {
2454e6ccafaeSMatthew G Knepley     PetscBool found = PETSC_FALSE;
2455e6ccafaeSMatthew G Knepley 
2456e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) {
2457e6ccafaeSMatthew G Knepley       if (face[f] == cone[v]) {
2458e6ccafaeSMatthew G Knepley         found = PETSC_TRUE; break;
2459e6ccafaeSMatthew G Knepley       }
2460e6ccafaeSMatthew G Knepley     }
2461e6ccafaeSMatthew G Knepley     if (found) {
2462e6ccafaeSMatthew G Knepley       indices[v2]      = v;
2463e6ccafaeSMatthew G Knepley       origVertices[v2] = cone[v];
2464e6ccafaeSMatthew G Knepley       ++v2;
2465e6ccafaeSMatthew G Knepley     } else {
2466e6ccafaeSMatthew G Knepley       oppositeVertex = v;
2467e6ccafaeSMatthew G Knepley     }
2468e6ccafaeSMatthew G Knepley   }
2469e6ccafaeSMatthew G Knepley   ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr);
2470e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2471e6ccafaeSMatthew G Knepley }
2472e6ccafaeSMatthew G Knepley 
2473e6ccafaeSMatthew G Knepley #undef __FUNCT__
2474cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal"
2475e6ccafaeSMatthew G Knepley /*
2476cd0c2139SMatthew G Knepley   DMPlexInsertFace_Internal - Puts a face into the mesh
2477e6ccafaeSMatthew G Knepley 
2478e6ccafaeSMatthew G Knepley   Not collective
2479e6ccafaeSMatthew G Knepley 
2480e6ccafaeSMatthew G Knepley   Input Parameters:
2481e6ccafaeSMatthew G Knepley   + dm              - The DMPlex
2482e6ccafaeSMatthew G Knepley   . numFaceVertex   - The number of vertices in the face
2483e6ccafaeSMatthew G Knepley   . faceVertices    - The vertices in the face for dm
2484e6ccafaeSMatthew G Knepley   . subfaceVertices - The vertices in the face for subdm
2485e6ccafaeSMatthew G Knepley   . numCorners      - The number of vertices in the cell
2486e6ccafaeSMatthew G Knepley   . cell            - A cell in dm containing the face
2487e6ccafaeSMatthew G Knepley   . subcell         - A cell in subdm containing the face
2488e6ccafaeSMatthew G Knepley   . firstFace       - First face in the mesh
2489e6ccafaeSMatthew G Knepley   - newFacePoint    - Next face in the mesh
2490e6ccafaeSMatthew G Knepley 
2491e6ccafaeSMatthew G Knepley   Output Parameters:
2492e6ccafaeSMatthew G Knepley   . newFacePoint - Contains next face point number on input, updated on output
2493e6ccafaeSMatthew G Knepley 
2494e6ccafaeSMatthew G Knepley   Level: developer
2495e6ccafaeSMatthew G Knepley */
2496cd0c2139SMatthew 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)
2497e6ccafaeSMatthew G Knepley {
249882f516ccSBarry Smith   MPI_Comm        comm;
2499e6ccafaeSMatthew G Knepley   DM_Plex        *submesh = (DM_Plex*) subdm->data;
2500e6ccafaeSMatthew G Knepley   const PetscInt *faces;
2501e6ccafaeSMatthew G Knepley   PetscInt        numFaces, coneSize;
2502e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2503e6ccafaeSMatthew G Knepley 
2504e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
250582f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2506e6ccafaeSMatthew G Knepley   ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr);
2507e6ccafaeSMatthew G Knepley   if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize);
2508e6ccafaeSMatthew G Knepley #if 0
2509e6ccafaeSMatthew G Knepley   /* Cannot use this because support() has not been constructed yet */
2510e6ccafaeSMatthew G Knepley   ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr);
2511e6ccafaeSMatthew G Knepley #else
2512e6ccafaeSMatthew G Knepley   {
2513e6ccafaeSMatthew G Knepley     PetscInt f;
2514e6ccafaeSMatthew G Knepley 
2515e6ccafaeSMatthew G Knepley     numFaces = 0;
2516e6ccafaeSMatthew G Knepley     ierr     = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr);
2517e6ccafaeSMatthew G Knepley     for (f = firstFace; f < *newFacePoint; ++f) {
2518e6ccafaeSMatthew G Knepley       PetscInt dof, off, d;
2519e6ccafaeSMatthew G Knepley 
2520e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr);
2521e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr);
2522e6ccafaeSMatthew G Knepley       /* Yes, I know this is quadratic, but I expect the sizes to be <5 */
2523e6ccafaeSMatthew G Knepley       for (d = 0; d < dof; ++d) {
2524e6ccafaeSMatthew G Knepley         const PetscInt p = submesh->cones[off+d];
2525e6ccafaeSMatthew G Knepley         PetscInt       v;
2526e6ccafaeSMatthew G Knepley 
2527e6ccafaeSMatthew G Knepley         for (v = 0; v < numFaceVertices; ++v) {
2528e6ccafaeSMatthew G Knepley           if (subfaceVertices[v] == p) break;
2529e6ccafaeSMatthew G Knepley         }
2530e6ccafaeSMatthew G Knepley         if (v == numFaceVertices) break;
2531e6ccafaeSMatthew G Knepley       }
2532e6ccafaeSMatthew G Knepley       if (d == dof) {
2533e6ccafaeSMatthew G Knepley         numFaces               = 1;
2534e6ccafaeSMatthew G Knepley         ((PetscInt*) faces)[0] = f;
2535e6ccafaeSMatthew G Knepley       }
2536e6ccafaeSMatthew G Knepley     }
2537e6ccafaeSMatthew G Knepley   }
2538e6ccafaeSMatthew G Knepley #endif
2539e6ccafaeSMatthew G Knepley   if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces);
2540e6ccafaeSMatthew G Knepley   else if (numFaces == 1) {
2541e6ccafaeSMatthew G Knepley     /* Add the other cell neighbor for this face */
2542766ab985SMatthew G. Knepley     ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr);
2543e6ccafaeSMatthew G Knepley   } else {
2544e6ccafaeSMatthew G Knepley     PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov;
2545e6ccafaeSMatthew G Knepley     PetscBool posOriented;
2546e6ccafaeSMatthew G Knepley 
2547e6ccafaeSMatthew G Knepley     ierr                = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr);
2548e6ccafaeSMatthew G Knepley     origVertices        = &orientedVertices[numFaceVertices];
2549e6ccafaeSMatthew G Knepley     indices             = &orientedVertices[numFaceVertices*2];
2550e6ccafaeSMatthew G Knepley     orientedSubVertices = &orientedVertices[numFaceVertices*3];
2551e6ccafaeSMatthew G Knepley     ierr                = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr);
2552e6ccafaeSMatthew G Knepley     /* TODO: I know that routine should return a permutation, not the indices */
2553e6ccafaeSMatthew G Knepley     for (v = 0; v < numFaceVertices; ++v) {
2554e6ccafaeSMatthew G Knepley       const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v];
2555e6ccafaeSMatthew G Knepley       for (ov = 0; ov < numFaceVertices; ++ov) {
2556e6ccafaeSMatthew G Knepley         if (orientedVertices[ov] == vertex) {
2557e6ccafaeSMatthew G Knepley           orientedSubVertices[ov] = subvertex;
2558e6ccafaeSMatthew G Knepley           break;
2559e6ccafaeSMatthew G Knepley         }
2560e6ccafaeSMatthew G Knepley       }
2561e6ccafaeSMatthew G Knepley       if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex);
2562e6ccafaeSMatthew G Knepley     }
2563e6ccafaeSMatthew G Knepley     ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr);
2564e6ccafaeSMatthew G Knepley     ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr);
2565e6ccafaeSMatthew G Knepley     ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr);
2566e6ccafaeSMatthew G Knepley     ++(*newFacePoint);
2567e6ccafaeSMatthew G Knepley   }
2568ef07cca7SMatthew G. Knepley #if 0
2569e6ccafaeSMatthew G Knepley   ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr);
2570ef07cca7SMatthew G. Knepley #else
2571ef07cca7SMatthew G. Knepley   ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr);
2572ef07cca7SMatthew G. Knepley #endif
2573e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2574e6ccafaeSMatthew G Knepley }
2575e6ccafaeSMatthew G Knepley 
2576e6ccafaeSMatthew G Knepley #undef __FUNCT__
2577e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated"
257853156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm)
2579e6ccafaeSMatthew G Knepley {
258082f516ccSBarry Smith   MPI_Comm        comm;
258153156dfcSMatthew G. Knepley   DMLabel         subpointMap;
2582efa14ee0SMatthew G Knepley   IS              subvertexIS,  subcellIS;
2583efa14ee0SMatthew G Knepley   const PetscInt *subVertices, *subCells;
2584efa14ee0SMatthew G Knepley   PetscInt        numSubVertices, firstSubVertex, numSubCells;
2585fed694aaSMatthew G. Knepley   PetscInt       *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0;
2586efa14ee0SMatthew G Knepley   PetscInt        vStart, vEnd, c, f;
2587e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2588e6ccafaeSMatthew G Knepley 
2589e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
259082f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2591efa14ee0SMatthew G Knepley   /* Create subpointMap which marks the submesh */
2592efa14ee0SMatthew G Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2593efa14ee0SMatthew G Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2594efa14ee0SMatthew G Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
259553156dfcSMatthew G. Knepley   if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);}
2596efa14ee0SMatthew G Knepley   /* Setup chart */
2597efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr);
2598efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr);
2599efa14ee0SMatthew G Knepley   ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr);
2600efa14ee0SMatthew G Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2601e6ccafaeSMatthew G Knepley   /* Set cone sizes */
2602e6ccafaeSMatthew G Knepley   firstSubVertex = numSubCells;
2603efa14ee0SMatthew G Knepley   firstSubFace   = numSubCells+numSubVertices;
2604e6ccafaeSMatthew G Knepley   newFacePoint   = firstSubFace;
2605efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr);
2606efa14ee0SMatthew G Knepley   if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2607efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr);
2608efa14ee0SMatthew G Knepley   if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);}
2609e6ccafaeSMatthew G Knepley   for (c = 0; c < numSubCells; ++c) {
2610e6ccafaeSMatthew G Knepley     ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr);
2611e6ccafaeSMatthew G Knepley   }
2612e6ccafaeSMatthew G Knepley   for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) {
2613e6ccafaeSMatthew G Knepley     ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr);
2614e6ccafaeSMatthew G Knepley   }
2615e6ccafaeSMatthew G Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2616e6ccafaeSMatthew G Knepley   /* Create face cones */
2617efa14ee0SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
26180298fd71SBarry Smith   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
2619efa14ee0SMatthew G Knepley   ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2620e6ccafaeSMatthew G Knepley   for (c = 0; c < numSubCells; ++c) {
2621e6ccafaeSMatthew G Knepley     const PetscInt cell    = subCells[c];
2622efa14ee0SMatthew G Knepley     const PetscInt subcell = c;
26230298fd71SBarry Smith     PetscInt      *closure = NULL;
2624efa14ee0SMatthew G Knepley     PetscInt       closureSize, cl, numCorners = 0, faceSize = 0;
2625e6ccafaeSMatthew G Knepley 
2626e6ccafaeSMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2627efa14ee0SMatthew G Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
2628efa14ee0SMatthew G Knepley       const PetscInt point = closure[cl];
2629e6ccafaeSMatthew G Knepley       PetscInt       subVertex;
2630e6ccafaeSMatthew G Knepley 
2631efa14ee0SMatthew G Knepley       if ((point >= vStart) && (point < vEnd)) {
2632efa14ee0SMatthew G Knepley         ++numCorners;
2633efa14ee0SMatthew G Knepley         ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr);
2634efa14ee0SMatthew G Knepley         if (subVertex >= 0) {
2635efa14ee0SMatthew G Knepley           closure[faceSize] = point;
263665560c7fSMatthew G Knepley           subface[faceSize] = firstSubVertex+subVertex;
2637e6ccafaeSMatthew G Knepley           ++faceSize;
2638e6ccafaeSMatthew G Knepley         }
2639e6ccafaeSMatthew G Knepley       }
2640e6ccafaeSMatthew G Knepley     }
2641efa14ee0SMatthew G Knepley     if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize);
2642efa14ee0SMatthew G Knepley     if (faceSize == nFV) {
2643cd0c2139SMatthew G Knepley       ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr);
2644e6ccafaeSMatthew G Knepley     }
264565560c7fSMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2646e6ccafaeSMatthew G Knepley   }
2647efa14ee0SMatthew G Knepley   ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2648e6ccafaeSMatthew G Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2649e6ccafaeSMatthew G Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2650e6ccafaeSMatthew G Knepley   /* Build coordinates */
2651efa14ee0SMatthew G Knepley   {
2652efa14ee0SMatthew G Knepley     PetscSection coordSection, subCoordSection;
2653efa14ee0SMatthew G Knepley     Vec          coordinates, subCoordinates;
2654efa14ee0SMatthew G Knepley     PetscScalar *coords, *subCoords;
2655285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize, v;
2656efa14ee0SMatthew G Knepley 
265769d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2658e6ccafaeSMatthew G Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
265969d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2660285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2661285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2662285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2663efa14ee0SMatthew G Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr);
2664efa14ee0SMatthew G Knepley     for (v = 0; v < numSubVertices; ++v) {
2665efa14ee0SMatthew G Knepley       const PetscInt vertex    = subVertices[v];
2666efa14ee0SMatthew G Knepley       const PetscInt subvertex = firstSubVertex+v;
2667efa14ee0SMatthew G Knepley       PetscInt       dof;
2668efa14ee0SMatthew G Knepley 
2669efa14ee0SMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2670efa14ee0SMatthew G Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2671285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2672e6ccafaeSMatthew G Knepley     }
2673e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2674e6ccafaeSMatthew G Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2675e6ccafaeSMatthew G Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2676e6ccafaeSMatthew G Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
26772eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2678830e53efSMatthew G. Knepley     if (coordSize) {
2679e6ccafaeSMatthew G Knepley       ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2680e6ccafaeSMatthew G Knepley       ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2681efa14ee0SMatthew G Knepley       for (v = 0; v < numSubVertices; ++v) {
2682efa14ee0SMatthew G Knepley         const PetscInt vertex    = subVertices[v];
2683efa14ee0SMatthew G Knepley         const PetscInt subvertex = firstSubVertex+v;
2684efa14ee0SMatthew G Knepley         PetscInt       dof, off, sdof, soff, d;
2685e6ccafaeSMatthew G Knepley 
2686e6ccafaeSMatthew G Knepley         ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2687e6ccafaeSMatthew G Knepley         ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2688efa14ee0SMatthew G Knepley         ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2689efa14ee0SMatthew G Knepley         ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2690efa14ee0SMatthew 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);
2691e6ccafaeSMatthew G Knepley         for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2692e6ccafaeSMatthew G Knepley       }
2693e6ccafaeSMatthew G Knepley       ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2694e6ccafaeSMatthew G Knepley       ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
26953b399e24SMatthew G. Knepley     }
2696e6ccafaeSMatthew G Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2697e6ccafaeSMatthew G Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2698e6ccafaeSMatthew G Knepley   }
2699efa14ee0SMatthew G Knepley   /* Cleanup */
2700efa14ee0SMatthew G Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2701efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
2702efa14ee0SMatthew G Knepley   if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);}
2703efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subcellIS);CHKERRQ(ierr);
2704e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2705e6ccafaeSMatthew G Knepley }
2706e6ccafaeSMatthew G Knepley 
2707e6ccafaeSMatthew G Knepley #undef __FUNCT__
27083982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal"
27093982b651SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[])
27103982b651SMatthew G. Knepley {
27113982b651SMatthew G. Knepley   PetscInt       subPoint;
27123982b651SMatthew G. Knepley   PetscErrorCode ierr;
27133982b651SMatthew G. Knepley 
27143982b651SMatthew G. Knepley   ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr;
27153982b651SMatthew G. Knepley   return subPoint < 0 ? subPoint : firstSubPoint+subPoint;
27163982b651SMatthew G. Knepley }
27173982b651SMatthew G. Knepley 
27183982b651SMatthew G. Knepley #undef __FUNCT__
27193982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateSubmeshGeneric_Interpolated"
27203982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmeshGeneric_Interpolated(DM dm, DMLabel label, PetscInt value, PetscBool isCohesive, DM subdm)
2721e6ccafaeSMatthew G Knepley {
272282f516ccSBarry Smith   MPI_Comm         comm;
272353156dfcSMatthew G. Knepley   DMLabel          subpointMap;
2724efa14ee0SMatthew G Knepley   IS              *subpointIS;
2725efa14ee0SMatthew G Knepley   const PetscInt **subpoints;
27263982b651SMatthew G. Knepley   PetscInt        *numSubPoints, *firstSubPoint, *coneNew, *orntNew;
2727efa14ee0SMatthew G Knepley   PetscInt         totSubPoints = 0, maxConeSize, dim, p, d, v;
2728e6ccafaeSMatthew G Knepley   PetscErrorCode   ierr;
2729e6ccafaeSMatthew G Knepley 
2730e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
273182f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2732efa14ee0SMatthew G Knepley   /* Create subpointMap which marks the submesh */
2733e6ccafaeSMatthew G Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2734efa14ee0SMatthew G Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2735efa14ee0SMatthew G Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
27363982b651SMatthew G. Knepley   if (isCohesive) {ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);}
27373982b651SMatthew G. Knepley   else            {ierr = DMPlexMarkSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);}
2738efa14ee0SMatthew G Knepley   /* Setup chart */
2739c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
2740dcca6d9dSJed Brown   ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr);
2741e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2742e6ccafaeSMatthew G Knepley     ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr);
2743e6ccafaeSMatthew G Knepley     totSubPoints += numSubPoints[d];
2744e6ccafaeSMatthew G Knepley   }
2745e6ccafaeSMatthew G Knepley   ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr);
2746e6ccafaeSMatthew G Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2747e6ccafaeSMatthew G Knepley   /* Set cone sizes */
2748e6ccafaeSMatthew G Knepley   firstSubPoint[dim] = 0;
2749e6ccafaeSMatthew G Knepley   firstSubPoint[0]   = firstSubPoint[dim] + numSubPoints[dim];
2750e6ccafaeSMatthew G Knepley   if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0]     + numSubPoints[0];}
2751e6ccafaeSMatthew G Knepley   if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];}
2752e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2753e6ccafaeSMatthew G Knepley     ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr);
27540ae02aa4SMatthew G. Knepley     if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);}
2755e6ccafaeSMatthew G Knepley   }
2756e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2757e6ccafaeSMatthew G Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2758e6ccafaeSMatthew G Knepley       const PetscInt  point    = subpoints[d][p];
2759e6ccafaeSMatthew G Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
2760e6ccafaeSMatthew G Knepley       const PetscInt *cone;
2761e6ccafaeSMatthew G Knepley       PetscInt        coneSize, coneSizeNew, c, val;
2762e6ccafaeSMatthew G Knepley 
2763e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2764e6ccafaeSMatthew G Knepley       ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr);
2765e6ccafaeSMatthew G Knepley       if (d == dim) {
2766e6ccafaeSMatthew G Knepley         ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
2767e6ccafaeSMatthew G Knepley         for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2768e6ccafaeSMatthew G Knepley           ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr);
2769e6ccafaeSMatthew G Knepley           if (val >= 0) coneSizeNew++;
2770e6ccafaeSMatthew G Knepley         }
2771e6ccafaeSMatthew G Knepley         ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr);
2772e6ccafaeSMatthew G Knepley       }
2773e6ccafaeSMatthew G Knepley     }
2774e6ccafaeSMatthew G Knepley   }
2775e6ccafaeSMatthew G Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2776e6ccafaeSMatthew G Knepley   /* Set cones */
27770298fd71SBarry Smith   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
27783982b651SMatthew G. Knepley   ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&orntNew);CHKERRQ(ierr);
2779e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2780e6ccafaeSMatthew G Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2781e6ccafaeSMatthew G Knepley       const PetscInt  point    = subpoints[d][p];
2782e6ccafaeSMatthew G Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
27830e49e2e2SMatthew G. Knepley       const PetscInt *cone, *ornt;
2784e6ccafaeSMatthew G Knepley       PetscInt        coneSize, subconeSize, coneSizeNew, c, subc;
2785e6ccafaeSMatthew G Knepley 
2786e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2787e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
2788e6ccafaeSMatthew G Knepley       ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
27890e49e2e2SMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr);
2790e6ccafaeSMatthew G Knepley       for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2791e6ccafaeSMatthew G Knepley         ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr);
279201a2673eSMatthew G. Knepley         if (subc >= 0) {
279301a2673eSMatthew G. Knepley           coneNew[coneSizeNew] = firstSubPoint[d-1] + subc;
27943982b651SMatthew G. Knepley           orntNew[coneSizeNew] = ornt[c];
279501a2673eSMatthew G. Knepley           ++coneSizeNew;
279601a2673eSMatthew G. Knepley         }
2797e6ccafaeSMatthew G Knepley       }
2798e6ccafaeSMatthew G Knepley       if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize);
2799e6ccafaeSMatthew G Knepley       ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr);
28003982b651SMatthew G. Knepley       ierr = DMPlexSetConeOrientation(subdm, subpoint, orntNew);CHKERRQ(ierr);
2801e6ccafaeSMatthew G Knepley     }
2802e6ccafaeSMatthew G Knepley   }
28033982b651SMatthew G. Knepley   ierr = PetscFree2(coneNew,orntNew);CHKERRQ(ierr);
2804e6ccafaeSMatthew G Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2805e6ccafaeSMatthew G Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2806e6ccafaeSMatthew G Knepley   /* Build coordinates */
2807e6ccafaeSMatthew G Knepley   {
2808e6ccafaeSMatthew G Knepley     PetscSection coordSection, subCoordSection;
2809e6ccafaeSMatthew G Knepley     Vec          coordinates, subCoordinates;
2810e6ccafaeSMatthew G Knepley     PetscScalar *coords, *subCoords;
2811285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize;
2812e6ccafaeSMatthew G Knepley 
281369d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2814e6ccafaeSMatthew G Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
281569d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2816285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2817285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2818285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2819e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr);
2820e6ccafaeSMatthew G Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2821e6ccafaeSMatthew G Knepley       const PetscInt vertex    = subpoints[0][v];
2822e6ccafaeSMatthew G Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2823e6ccafaeSMatthew G Knepley       PetscInt       dof;
2824e6ccafaeSMatthew G Knepley 
2825e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2826e6ccafaeSMatthew G Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2827285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2828e6ccafaeSMatthew G Knepley     }
2829e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2830e6ccafaeSMatthew G Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2831e6ccafaeSMatthew G Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2832e6ccafaeSMatthew G Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
28332eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2834e6ccafaeSMatthew G Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2835e6ccafaeSMatthew G Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2836e6ccafaeSMatthew G Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2837e6ccafaeSMatthew G Knepley       const PetscInt vertex    = subpoints[0][v];
2838e6ccafaeSMatthew G Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2839e6ccafaeSMatthew G Knepley       PetscInt dof, off, sdof, soff, d;
2840e6ccafaeSMatthew G Knepley 
2841e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2842e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2843e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2844e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2845e6ccafaeSMatthew 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);
2846efa14ee0SMatthew G Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2847e6ccafaeSMatthew G Knepley     }
2848e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2849e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2850e6ccafaeSMatthew G Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2851e6ccafaeSMatthew G Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2852e6ccafaeSMatthew G Knepley   }
28533982b651SMatthew G. Knepley   /* Build SF: We need this complexity because subpoints might not be selected on the owning process */
28543982b651SMatthew G. Knepley   {
28553982b651SMatthew G. Knepley     PetscSF            sfPoint, sfPointSub;
28563982b651SMatthew G. Knepley     IS                 subpIS;
28573982b651SMatthew G. Knepley     const PetscSFNode *remotePoints;
28583982b651SMatthew G. Knepley     PetscSFNode       *sremotePoints, *newLocalPoints, *newOwners;
28593982b651SMatthew G. Knepley     const PetscInt    *localPoints, *subpoints;
28603982b651SMatthew G. Knepley     PetscInt          *slocalPoints;
28613982b651SMatthew G. Knepley     PetscInt           numRoots, numLeaves, numSubpoints = 0, numSubroots, numSubleaves = 0, l, sl, ll, pStart, pEnd, p;
28623982b651SMatthew G. Knepley     PetscMPIInt        rank;
28633982b651SMatthew G. Knepley 
28643982b651SMatthew G. Knepley     ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr);
28653982b651SMatthew G. Knepley     ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
28663982b651SMatthew G. Knepley     ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr);
28673982b651SMatthew G. Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
28683982b651SMatthew G. Knepley     ierr = DMPlexGetChart(subdm, NULL, &numSubroots);CHKERRQ(ierr);
28693982b651SMatthew G. Knepley     ierr = DMPlexCreateSubpointIS(subdm, &subpIS);CHKERRQ(ierr);
28703982b651SMatthew G. Knepley     if (subpIS) {
28713982b651SMatthew G. Knepley       ierr = ISGetIndices(subpIS, &subpoints);CHKERRQ(ierr);
28723982b651SMatthew G. Knepley       ierr = ISGetLocalSize(subpIS, &numSubpoints);CHKERRQ(ierr);
28733982b651SMatthew G. Knepley     }
28743982b651SMatthew G. Knepley     ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
28753982b651SMatthew G. Knepley     if (numRoots >= 0) {
28763982b651SMatthew G. Knepley       ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr);
28773982b651SMatthew G. Knepley       for (p = 0; p < pEnd-pStart; ++p) {
28783982b651SMatthew G. Knepley         newLocalPoints[p].rank  = -2;
28793982b651SMatthew G. Knepley         newLocalPoints[p].index = -2;
28803982b651SMatthew G. Knepley       }
28813982b651SMatthew G. Knepley       /* Set subleaves */
28823982b651SMatthew G. Knepley       for (l = 0; l < numLeaves; ++l) {
28833982b651SMatthew G. Knepley         const PetscInt point    = localPoints[l];
28843982b651SMatthew G. Knepley         const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints);
28853982b651SMatthew G. Knepley 
28863982b651SMatthew G. Knepley         if (subpoint < 0) continue;
28873982b651SMatthew G. Knepley         newLocalPoints[point-pStart].rank  = rank;
28883982b651SMatthew G. Knepley         newLocalPoints[point-pStart].index = subpoint;
28893982b651SMatthew G. Knepley         ++numSubleaves;
28903982b651SMatthew G. Knepley       }
28913982b651SMatthew G. Knepley       /* Must put in owned subpoints */
28923982b651SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {
28933982b651SMatthew G. Knepley         const PetscInt subpoint = DMPlexFilterPoint_Internal(p, 0, numSubpoints, subpoints);
28943982b651SMatthew G. Knepley 
28953982b651SMatthew G. Knepley         if (subpoint < 0) {
28963982b651SMatthew G. Knepley           newOwners[p-pStart].rank  = -3;
28973982b651SMatthew G. Knepley           newOwners[p-pStart].index = -3;
28983982b651SMatthew G. Knepley         } else {
28993982b651SMatthew G. Knepley           newOwners[p-pStart].rank  = rank;
29003982b651SMatthew G. Knepley           newOwners[p-pStart].index = subpoint;
29013982b651SMatthew G. Knepley         }
29023982b651SMatthew G. Knepley       }
29033982b651SMatthew G. Knepley       ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
29043982b651SMatthew G. Knepley       ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
29053982b651SMatthew G. Knepley       ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
29063982b651SMatthew G. Knepley       ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
29073982b651SMatthew G. Knepley       ierr = PetscMalloc1(numSubleaves, &slocalPoints);CHKERRQ(ierr);
29083982b651SMatthew G. Knepley       ierr = PetscMalloc1(numSubleaves, &sremotePoints);CHKERRQ(ierr);
29093982b651SMatthew G. Knepley       for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) {
29103982b651SMatthew G. Knepley         const PetscInt point    = localPoints[l];
29113982b651SMatthew G. Knepley         const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints);
29123982b651SMatthew G. Knepley 
29133982b651SMatthew G. Knepley         if (subpoint < 0) continue;
29143982b651SMatthew G. Knepley         if (newLocalPoints[point].rank == rank) {++ll; continue;}
29153982b651SMatthew G. Knepley         slocalPoints[sl]        = subpoint;
29163982b651SMatthew G. Knepley         sremotePoints[sl].rank  = newLocalPoints[point].rank;
29173982b651SMatthew G. Knepley         sremotePoints[sl].index = newLocalPoints[point].index;
29183982b651SMatthew G. Knepley         if (sremotePoints[sl].rank  < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point);
29193982b651SMatthew G. Knepley         if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point);
29203982b651SMatthew G. Knepley         ++sl;
29213982b651SMatthew G. Knepley       }
29223982b651SMatthew G. Knepley       if (sl + ll != numSubleaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubleaves);
29233982b651SMatthew G. Knepley       ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr);
29243982b651SMatthew G. Knepley       ierr = PetscSFSetGraph(sfPointSub, numSubroots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
29253982b651SMatthew G. Knepley     }
29263982b651SMatthew G. Knepley     if (subpIS) {
29273982b651SMatthew G. Knepley       ierr = ISRestoreIndices(subpIS, &subpoints);CHKERRQ(ierr);
29283982b651SMatthew G. Knepley       ierr = ISDestroy(&subpIS);CHKERRQ(ierr);
29293982b651SMatthew G. Knepley     }
29303982b651SMatthew G. Knepley   }
2931efa14ee0SMatthew G Knepley   /* Cleanup */
2932e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
29330ae02aa4SMatthew G. Knepley     if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);}
2934e6ccafaeSMatthew G Knepley     ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr);
2935e6ccafaeSMatthew G Knepley   }
2936efa14ee0SMatthew G Knepley   ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr);
2937e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2938e6ccafaeSMatthew G Knepley }
2939e6ccafaeSMatthew G Knepley 
2940e6ccafaeSMatthew G Knepley #undef __FUNCT__
29413982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated"
29423982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm)
29433982b651SMatthew G. Knepley {
29443982b651SMatthew G. Knepley   PetscErrorCode ierr;
29453982b651SMatthew G. Knepley 
29463982b651SMatthew G. Knepley   PetscFunctionBegin;
29473982b651SMatthew G. Knepley   ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, vertexLabel, value, PETSC_FALSE, subdm);CHKERRQ(ierr);
29483982b651SMatthew G. Knepley   PetscFunctionReturn(0);
29493982b651SMatthew G. Knepley }
29503982b651SMatthew G. Knepley 
29513982b651SMatthew G. Knepley #undef __FUNCT__
2952e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh"
2953d0fa310fSMatthew G. Knepley /*@
2954e6ccafaeSMatthew G Knepley   DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label
2955e6ccafaeSMatthew G Knepley 
2956e6ccafaeSMatthew G Knepley   Input Parameters:
2957e6ccafaeSMatthew G Knepley + dm           - The original mesh
2958830e53efSMatthew G. Knepley . vertexLabel  - The DMLabel marking vertices contained in the surface
2959830e53efSMatthew G. Knepley - value        - The label value to use
2960e6ccafaeSMatthew G Knepley 
2961e6ccafaeSMatthew G Knepley   Output Parameter:
2962e6ccafaeSMatthew G Knepley . subdm - The surface mesh
2963e6ccafaeSMatthew G Knepley 
2964e6ccafaeSMatthew G Knepley   Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap().
2965e6ccafaeSMatthew G Knepley 
2966e6ccafaeSMatthew G Knepley   Level: developer
2967e6ccafaeSMatthew G Knepley 
2968e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue()
2969830e53efSMatthew G. Knepley @*/
297053156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm)
2971e6ccafaeSMatthew G Knepley {
2972e6ccafaeSMatthew G Knepley   PetscInt       dim, depth;
2973e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
2974e6ccafaeSMatthew G Knepley 
2975e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
2976e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2977766ab985SMatthew G. Knepley   PetscValidPointer(subdm, 3);
2978c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
2979e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
298082f516ccSBarry Smith   ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr);
2981e6ccafaeSMatthew G Knepley   ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr);
2982c73cfb54SMatthew G. Knepley   ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr);
2983e6ccafaeSMatthew G Knepley   if (depth == dim) {
2984830e53efSMatthew G. Knepley     ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr);
2985e6ccafaeSMatthew G Knepley   } else {
2986830e53efSMatthew G. Knepley     ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr);
2987e6ccafaeSMatthew G Knepley   }
2988e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2989e6ccafaeSMatthew G Knepley }
2990e6ccafaeSMatthew G Knepley 
2991e6ccafaeSMatthew G Knepley #undef __FUNCT__
2992766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated"
299327c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm)
2994766ab985SMatthew G. Knepley {
2995766ab985SMatthew G. Knepley   MPI_Comm        comm;
2996766ab985SMatthew G. Knepley   DMLabel         subpointMap;
2997766ab985SMatthew G. Knepley   IS              subvertexIS;
2998766ab985SMatthew G. Knepley   const PetscInt *subVertices;
2999fed694aaSMatthew G. Knepley   PetscInt        numSubVertices, firstSubVertex, numSubCells, *subCells = NULL;
3000766ab985SMatthew G. Knepley   PetscInt       *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV;
300187feddfdSMatthew G. Knepley   PetscInt        cMax, c, f;
3002766ab985SMatthew G. Knepley   PetscErrorCode  ierr;
3003766ab985SMatthew G. Knepley 
3004766ab985SMatthew G. Knepley   PetscFunctionBegin;
3005766ab985SMatthew G. Knepley   ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr);
3006766ab985SMatthew G. Knepley   /* Create subpointMap which marks the submesh */
3007766ab985SMatthew G. Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
3008766ab985SMatthew G. Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
3009766ab985SMatthew G. Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
301027c04023SMatthew G. Knepley   ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr);
3011766ab985SMatthew G. Knepley   /* Setup chart */
3012766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr);
3013766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr);
3014766ab985SMatthew G. Knepley   ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr);
3015766ab985SMatthew G. Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
3016766ab985SMatthew G. Knepley   /* Set cone sizes */
3017766ab985SMatthew G. Knepley   firstSubVertex = numSubCells;
3018766ab985SMatthew G. Knepley   firstSubFace   = numSubCells+numSubVertices;
3019766ab985SMatthew G. Knepley   newFacePoint   = firstSubFace;
3020766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr);
3021766ab985SMatthew G. Knepley   if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
3022766ab985SMatthew G. Knepley   for (c = 0; c < numSubCells; ++c) {
3023766ab985SMatthew G. Knepley     ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr);
3024766ab985SMatthew G. Knepley   }
3025766ab985SMatthew G. Knepley   for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) {
3026766ab985SMatthew G. Knepley     ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr);
3027766ab985SMatthew G. Knepley   }
3028766ab985SMatthew G. Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
3029766ab985SMatthew G. Knepley   /* Create face cones */
3030766ab985SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
303187feddfdSMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
3032766ab985SMatthew G. Knepley   ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
3033766ab985SMatthew G. Knepley   for (c = 0; c < numSubCells; ++c) {
3034766ab985SMatthew G. Knepley     const PetscInt  cell    = subCells[c];
3035766ab985SMatthew G. Knepley     const PetscInt  subcell = c;
303687feddfdSMatthew G. Knepley     const PetscInt *cone, *cells;
303787feddfdSMatthew G. Knepley     PetscInt        numCells, subVertex, p, v;
3038766ab985SMatthew G. Knepley 
303987feddfdSMatthew G. Knepley     if (cell < cMax) continue;
304087feddfdSMatthew G. Knepley     ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
304187feddfdSMatthew G. Knepley     for (v = 0; v < nFV; ++v) {
304287feddfdSMatthew G. Knepley       ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr);
304387feddfdSMatthew G. Knepley       subface[v] = firstSubVertex+subVertex;
304487feddfdSMatthew G. Knepley     }
304587feddfdSMatthew G. Knepley     ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr);
304687feddfdSMatthew G. Knepley     ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr);
304787feddfdSMatthew G. Knepley     ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr);
304827234c99SMatthew G. Knepley     /* Not true in parallel
304927234c99SMatthew G. Knepley     if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */
305087feddfdSMatthew G. Knepley     for (p = 0; p < numCells; ++p) {
305187feddfdSMatthew G. Knepley       PetscInt negsubcell;
3052766ab985SMatthew G. Knepley 
305387feddfdSMatthew G. Knepley       if (cells[p] >= cMax) continue;
305487feddfdSMatthew G. Knepley       /* I know this is a crap search */
305587feddfdSMatthew G. Knepley       for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) {
305687feddfdSMatthew G. Knepley         if (subCells[negsubcell] == cells[p]) break;
3057766ab985SMatthew G. Knepley       }
305887feddfdSMatthew G. Knepley       if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell);
305987feddfdSMatthew G. Knepley       ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr);
3060766ab985SMatthew G. Knepley     }
306187feddfdSMatthew G. Knepley     ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr);
306287feddfdSMatthew G. Knepley     ++newFacePoint;
3063766ab985SMatthew G. Knepley   }
3064766ab985SMatthew G. Knepley   ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
3065766ab985SMatthew G. Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
3066766ab985SMatthew G. Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
3067766ab985SMatthew G. Knepley   /* Build coordinates */
3068766ab985SMatthew G. Knepley   {
3069766ab985SMatthew G. Knepley     PetscSection coordSection, subCoordSection;
3070766ab985SMatthew G. Knepley     Vec          coordinates, subCoordinates;
3071766ab985SMatthew G. Knepley     PetscScalar *coords, *subCoords;
3072285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize, v;
3073766ab985SMatthew G. Knepley 
307469d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
3075766ab985SMatthew G. Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
307669d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
3077285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
3078285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
3079285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
3080766ab985SMatthew G. Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr);
3081766ab985SMatthew G. Knepley     for (v = 0; v < numSubVertices; ++v) {
3082766ab985SMatthew G. Knepley       const PetscInt vertex    = subVertices[v];
3083766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubVertex+v;
3084766ab985SMatthew G. Knepley       PetscInt       dof;
3085766ab985SMatthew G. Knepley 
3086766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
3087766ab985SMatthew G. Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
3088285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
3089766ab985SMatthew G. Knepley     }
3090766ab985SMatthew G. Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
3091766ab985SMatthew G. Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
3092766ab985SMatthew G. Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
3093766ab985SMatthew G. Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
30942eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
3095766ab985SMatthew G. Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
3096766ab985SMatthew G. Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
3097766ab985SMatthew G. Knepley     for (v = 0; v < numSubVertices; ++v) {
3098766ab985SMatthew G. Knepley       const PetscInt vertex    = subVertices[v];
3099766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubVertex+v;
3100766ab985SMatthew G. Knepley       PetscInt       dof, off, sdof, soff, d;
3101766ab985SMatthew G. Knepley 
3102766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
3103766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
3104766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
3105766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
3106766ab985SMatthew 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);
3107766ab985SMatthew G. Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
3108766ab985SMatthew G. Knepley     }
3109766ab985SMatthew G. Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
3110766ab985SMatthew G. Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
3111766ab985SMatthew G. Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
3112766ab985SMatthew G. Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
3113766ab985SMatthew G. Knepley   }
3114aca35d17SMatthew G. Knepley   /* Build SF */
3115aca35d17SMatthew G. Knepley   CHKMEMQ;
3116aca35d17SMatthew G. Knepley   {
3117aca35d17SMatthew G. Knepley     PetscSF            sfPoint, sfPointSub;
3118aca35d17SMatthew G. Knepley     const PetscSFNode *remotePoints;
3119bdcf2095SMatthew G. Knepley     PetscSFNode       *sremotePoints, *newLocalPoints, *newOwners;
3120aca35d17SMatthew G. Knepley     const PetscInt    *localPoints;
3121bdcf2095SMatthew G. Knepley     PetscInt          *slocalPoints;
312249c26ae4SMatthew G. Knepley     PetscInt           numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd;
3123bdcf2095SMatthew G. Knepley     PetscMPIInt        rank;
3124aca35d17SMatthew G. Knepley 
3125bdcf2095SMatthew G. Knepley     ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr);
3126aca35d17SMatthew G. Knepley     ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
3127aca35d17SMatthew G. Knepley     ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr);
3128aca35d17SMatthew G. Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
3129aca35d17SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
3130aca35d17SMatthew G. Knepley     ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
3131aca35d17SMatthew G. Knepley     if (numRoots >= 0) {
3132aca35d17SMatthew G. Knepley       /* Only vertices should be shared */
3133dcca6d9dSJed Brown       ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr);
3134bdcf2095SMatthew G. Knepley       for (p = 0; p < pEnd-pStart; ++p) {
3135bdcf2095SMatthew G. Knepley         newLocalPoints[p].rank  = -2;
3136bdcf2095SMatthew G. Knepley         newLocalPoints[p].index = -2;
3137bdcf2095SMatthew G. Knepley       }
31389e0823b2SMatthew G. Knepley       /* Set subleaves */
3139aca35d17SMatthew G. Knepley       for (l = 0; l < numLeaves; ++l) {
3140aca35d17SMatthew G. Knepley         const PetscInt point    = localPoints[l];
3141bdcf2095SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices);
3142aca35d17SMatthew G. Knepley 
3143aca35d17SMatthew G. Knepley         if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point);
3144bdcf2095SMatthew G. Knepley         if (subPoint < 0) continue;
3145bdcf2095SMatthew G. Knepley         newLocalPoints[point-pStart].rank  = rank;
3146bdcf2095SMatthew G. Knepley         newLocalPoints[point-pStart].index = subPoint;
3147bdcf2095SMatthew G. Knepley         ++numSubLeaves;
3148aca35d17SMatthew G. Knepley       }
31499e0823b2SMatthew G. Knepley       /* Must put in owned subpoints */
31509e0823b2SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {
31519e0823b2SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices);
31529e0823b2SMatthew G. Knepley 
31539e0823b2SMatthew G. Knepley         if (subPoint < 0) {
31549e0823b2SMatthew G. Knepley           newOwners[p-pStart].rank  = -3;
31559e0823b2SMatthew G. Knepley           newOwners[p-pStart].index = -3;
31569e0823b2SMatthew G. Knepley         } else {
31579e0823b2SMatthew G. Knepley           newOwners[p-pStart].rank  = rank;
31589e0823b2SMatthew G. Knepley           newOwners[p-pStart].index = subPoint;
31599e0823b2SMatthew G. Knepley         }
3160bdcf2095SMatthew G. Knepley       }
3161bdcf2095SMatthew G. Knepley       ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
3162bdcf2095SMatthew G. Knepley       ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
3163bdcf2095SMatthew G. Knepley       ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
3164bdcf2095SMatthew G. Knepley       ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
3165785e854fSJed Brown       ierr = PetscMalloc1(numSubLeaves,    &slocalPoints);CHKERRQ(ierr);
3166785e854fSJed Brown       ierr = PetscMalloc1(numSubLeaves, &sremotePoints);CHKERRQ(ierr);
316749c26ae4SMatthew G. Knepley       for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) {
3168bdcf2095SMatthew G. Knepley         const PetscInt point    = localPoints[l];
3169bdcf2095SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices);
3170aca35d17SMatthew G. Knepley 
3171aca35d17SMatthew G. Knepley         if (subPoint < 0) continue;
317249c26ae4SMatthew G. Knepley         if (newLocalPoints[point].rank == rank) {++ll; continue;}
3173aca35d17SMatthew G. Knepley         slocalPoints[sl]        = subPoint;
3174bdcf2095SMatthew G. Knepley         sremotePoints[sl].rank  = newLocalPoints[point].rank;
3175bdcf2095SMatthew G. Knepley         sremotePoints[sl].index = newLocalPoints[point].index;
3176bdcf2095SMatthew G. Knepley         if (sremotePoints[sl].rank  < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point);
3177bdcf2095SMatthew G. Knepley         if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point);
3178aca35d17SMatthew G. Knepley         ++sl;
3179aca35d17SMatthew G. Knepley       }
3180bdcf2095SMatthew G. Knepley       ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr);
318149c26ae4SMatthew G. Knepley       if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves);
318249c26ae4SMatthew G. Knepley       ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
3183aca35d17SMatthew G. Knepley     }
3184aca35d17SMatthew G. Knepley   }
3185aca35d17SMatthew G. Knepley   CHKMEMQ;
3186766ab985SMatthew G. Knepley   /* Cleanup */
3187766ab985SMatthew G. Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
3188766ab985SMatthew G. Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
3189766ab985SMatthew G. Knepley   ierr = PetscFree(subCells);CHKERRQ(ierr);
3190766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
3191766ab985SMatthew G. Knepley }
3192766ab985SMatthew G. Knepley 
3193766ab985SMatthew G. Knepley #undef __FUNCT__
3194766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated"
31953982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DM subdm)
3196766ab985SMatthew G. Knepley {
31973982b651SMatthew G. Knepley   DMLabel        label = NULL;
3198766ab985SMatthew G. Knepley   PetscErrorCode ierr;
3199766ab985SMatthew G. Knepley 
3200766ab985SMatthew G. Knepley   PetscFunctionBegin;
32013982b651SMatthew G. Knepley   if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);}
32023982b651SMatthew G. Knepley   ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, label, value, PETSC_TRUE, subdm);CHKERRQ(ierr);
3203766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
3204766ab985SMatthew G. Knepley }
3205766ab985SMatthew G. Knepley 
3206766ab985SMatthew G. Knepley #undef __FUNCT__
3207766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh"
3208766ab985SMatthew G. Knepley /*
320927c04023SMatthew 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.
3210766ab985SMatthew G. Knepley 
3211766ab985SMatthew G. Knepley   Input Parameters:
3212766ab985SMatthew G. Knepley + dm          - The original mesh
321327c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells
32147afc1a8bSJed Brown . label       - A label name, or NULL
321527c04023SMatthew G. Knepley - value  - A label value
3216766ab985SMatthew G. Knepley 
3217766ab985SMatthew G. Knepley   Output Parameter:
3218766ab985SMatthew G. Knepley . subdm - The surface mesh
3219766ab985SMatthew G. Knepley 
3220766ab985SMatthew G. Knepley   Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap().
3221766ab985SMatthew G. Knepley 
3222766ab985SMatthew G. Knepley   Level: developer
3223766ab985SMatthew G. Knepley 
3224766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh()
3225766ab985SMatthew G. Knepley */
322627c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm)
3227766ab985SMatthew G. Knepley {
3228766ab985SMatthew G. Knepley   PetscInt       dim, depth;
3229766ab985SMatthew G. Knepley   PetscErrorCode ierr;
3230766ab985SMatthew G. Knepley 
3231766ab985SMatthew G. Knepley   PetscFunctionBegin;
3232766ab985SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
323327c04023SMatthew G. Knepley   PetscValidPointer(subdm, 5);
3234c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
3235766ab985SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3236766ab985SMatthew G. Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr);
3237766ab985SMatthew G. Knepley   ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr);
3238c73cfb54SMatthew G. Knepley   ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr);
3239766ab985SMatthew G. Knepley   if (depth == dim) {
3240b3154360SMatthew G. Knepley     ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr);
3241766ab985SMatthew G. Knepley   } else {
324227c04023SMatthew G. Knepley     ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr);
3243e6ccafaeSMatthew G Knepley   }
3244e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3245e6ccafaeSMatthew G Knepley }
3246e6ccafaeSMatthew G Knepley 
3247e6ccafaeSMatthew G Knepley #undef __FUNCT__
3248e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap"
324964beef6dSMatthew G. Knepley /*@
325064beef6dSMatthew G. Knepley   DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values
325164beef6dSMatthew G. Knepley 
325264beef6dSMatthew G. Knepley   Input Parameter:
325364beef6dSMatthew G. Knepley . dm - The submesh DM
325464beef6dSMatthew G. Knepley 
325564beef6dSMatthew G. Knepley   Output Parameter:
325664beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh
325764beef6dSMatthew G. Knepley 
325864beef6dSMatthew G. Knepley   Level: developer
325964beef6dSMatthew G. Knepley 
326064beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS()
326164beef6dSMatthew G. Knepley @*/
3262e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap)
3263e6ccafaeSMatthew G Knepley {
3264e6ccafaeSMatthew G Knepley   DM_Plex *mesh = (DM_Plex*) dm->data;
3265e6ccafaeSMatthew G Knepley 
3266e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3267e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3268e6ccafaeSMatthew G Knepley   PetscValidPointer(subpointMap, 2);
3269e6ccafaeSMatthew G Knepley   *subpointMap = mesh->subpointMap;
3270e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3271e6ccafaeSMatthew G Knepley }
3272e6ccafaeSMatthew G Knepley 
3273e6ccafaeSMatthew G Knepley #undef __FUNCT__
3274e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap"
3275e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */
3276e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap)
3277e6ccafaeSMatthew G Knepley {
3278e6ccafaeSMatthew G Knepley   DM_Plex       *mesh = (DM_Plex *) dm->data;
3279285d324eSMatthew G. Knepley   DMLabel        tmp;
3280e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
3281e6ccafaeSMatthew G Knepley 
3282e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3283e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3284285d324eSMatthew G. Knepley   tmp  = mesh->subpointMap;
3285e6ccafaeSMatthew G Knepley   mesh->subpointMap = subpointMap;
3286285d324eSMatthew G. Knepley   ++mesh->subpointMap->refct;
3287285d324eSMatthew G. Knepley   ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr);
3288e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3289e6ccafaeSMatthew G Knepley }
3290e6ccafaeSMatthew G Knepley 
3291e6ccafaeSMatthew G Knepley #undef __FUNCT__
3292e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS"
329364beef6dSMatthew G. Knepley /*@
3294e6ccafaeSMatthew G Knepley   DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data
3295e6ccafaeSMatthew G Knepley 
3296e6ccafaeSMatthew G Knepley   Input Parameter:
3297e6ccafaeSMatthew G Knepley . dm - The submesh DM
3298e6ccafaeSMatthew G Knepley 
3299e6ccafaeSMatthew G Knepley   Output Parameter:
33000298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh
3301e6ccafaeSMatthew G Knepley 
33023982b651SMatthew G. Knepley   Note: This IS is guaranteed to be sorted by the construction of the submesh
330364beef6dSMatthew G. Knepley 
330464beef6dSMatthew G. Knepley   Level: developer
330564beef6dSMatthew G. Knepley 
330664beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap()
330764beef6dSMatthew G. Knepley @*/
3308e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS)
3309e6ccafaeSMatthew G Knepley {
331082f516ccSBarry Smith   MPI_Comm        comm;
3311e6ccafaeSMatthew G Knepley   DMLabel         subpointMap;
3312e6ccafaeSMatthew G Knepley   IS              is;
3313e6ccafaeSMatthew G Knepley   const PetscInt *opoints;
3314e6ccafaeSMatthew G Knepley   PetscInt       *points, *depths;
3315e6ccafaeSMatthew G Knepley   PetscInt        depth, depStart, depEnd, d, pStart, pEnd, p, n, off;
3316e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
3317e6ccafaeSMatthew G Knepley 
3318e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3319e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3320e6ccafaeSMatthew G Knepley   PetscValidPointer(subpointIS, 2);
332182f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
33220298fd71SBarry Smith   *subpointIS = NULL;
3323e6ccafaeSMatthew G Knepley   ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr);
3324e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3325fed694aaSMatthew G. Knepley   if (subpointMap && depth >= 0) {
3326e6ccafaeSMatthew G Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
3327e6ccafaeSMatthew G Knepley     if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart);
3328e6ccafaeSMatthew G Knepley     ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr);
3329e6ccafaeSMatthew G Knepley     depths[0] = depth;
3330e6ccafaeSMatthew G Knepley     depths[1] = 0;
3331e6ccafaeSMatthew G Knepley     for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;}
3332785e854fSJed Brown     ierr = PetscMalloc1(pEnd, &points);CHKERRQ(ierr);
3333e6ccafaeSMatthew G Knepley     for(d = 0, off = 0; d <= depth; ++d) {
3334e6ccafaeSMatthew G Knepley       const PetscInt dep = depths[d];
3335e6ccafaeSMatthew G Knepley 
3336e6ccafaeSMatthew G Knepley       ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr);
3337e6ccafaeSMatthew G Knepley       ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr);
33381e21b6fdSMatthew G Knepley       if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */
3339e6ccafaeSMatthew 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);
3340e6ccafaeSMatthew G Knepley       } else {
33411e21b6fdSMatthew G Knepley         if (!n) {
33421e21b6fdSMatthew G Knepley           if (d == 0) {
33431e21b6fdSMatthew G Knepley             /* Missing cells */
33441e21b6fdSMatthew G Knepley             for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1;
33451e21b6fdSMatthew G Knepley           } else {
33461e21b6fdSMatthew G Knepley             /* Missing faces */
33471e21b6fdSMatthew G Knepley             for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT;
33481e21b6fdSMatthew G Knepley           }
33491e21b6fdSMatthew G Knepley         }
3350e6ccafaeSMatthew G Knepley       }
3351e6ccafaeSMatthew G Knepley       if (n) {
3352e6ccafaeSMatthew G Knepley         ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr);
3353e6ccafaeSMatthew G Knepley         ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr);
3354e6ccafaeSMatthew G Knepley         for(p = 0; p < n; ++p, ++off) points[off] = opoints[p];
3355e6ccafaeSMatthew G Knepley         ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr);
3356e6ccafaeSMatthew G Knepley         ierr = ISDestroy(&is);CHKERRQ(ierr);
3357e6ccafaeSMatthew G Knepley       }
3358e6ccafaeSMatthew G Knepley     }
3359e6ccafaeSMatthew G Knepley     ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr);
3360e6ccafaeSMatthew G Knepley     if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd);
3361fed694aaSMatthew G. Knepley     ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr);
3362e6ccafaeSMatthew G Knepley   }
3363e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3364e6ccafaeSMatthew G Knepley }
3365