xref: /petsc/src/dm/impls/plex/plexsubmesh.c (revision e6885bbbb49df9c88caeef9668a31ad997edaa3c)
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);
378cd0c2139SMatthew G Knepley   if (numRoots >= 0) {
379dcca6d9dSJed Brown     ierr = PetscMalloc2(numRoots,&newLocation,pEnd-pStart,&newRemoteLocation);CHKERRQ(ierr);
3802582d50cSToby Isaac     for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthShift);
381cd0c2139SMatthew G Knepley     ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr);
382cd0c2139SMatthew G Knepley     ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr);
383785e854fSJed Brown     ierr = PetscMalloc1(numLeaves,    &glocalPoints);CHKERRQ(ierr);
384785e854fSJed Brown     ierr = PetscMalloc1(numLeaves, &gremotePoints);CHKERRQ(ierr);
385cd0c2139SMatthew G Knepley     for (l = 0; l < numLeaves; ++l) {
3862582d50cSToby Isaac       glocalPoints[l]        = DMPlexShiftPoint_Internal(localPoints[l], depth, depthShift);
387cd0c2139SMatthew G Knepley       gremotePoints[l].rank  = remotePoints[l].rank;
388cd0c2139SMatthew G Knepley       gremotePoints[l].index = newRemoteLocation[localPoints[l]];
389cd0c2139SMatthew G Knepley     }
390cd0c2139SMatthew G Knepley     ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr);
391cd0c2139SMatthew G Knepley     ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
392cd0c2139SMatthew G Knepley   }
393cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
394cd0c2139SMatthew G Knepley }
395cd0c2139SMatthew G Knepley 
396cd0c2139SMatthew G Knepley #undef __FUNCT__
397cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal"
398cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew)
399cd0c2139SMatthew G Knepley {
400cd0c2139SMatthew G Knepley   PetscSF            sfPoint;
401cd0c2139SMatthew G Knepley   DMLabel            vtkLabel, ghostLabel;
402cd0c2139SMatthew G Knepley   const PetscSFNode *leafRemote;
403cd0c2139SMatthew G Knepley   const PetscInt    *leafLocal;
4042582d50cSToby Isaac   PetscInt           depth = 0, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f;
405cd0c2139SMatthew G Knepley   PetscMPIInt        rank;
406cd0c2139SMatthew G Knepley   PetscErrorCode     ierr;
407cd0c2139SMatthew G Knepley 
408cd0c2139SMatthew G Knepley   PetscFunctionBegin;
409cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
410cd0c2139SMatthew G Knepley   /* Step 10: Convert labels */
411cd0c2139SMatthew G Knepley   ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr);
412cd0c2139SMatthew G Knepley   for (l = 0; l < numLabels; ++l) {
413cd0c2139SMatthew G Knepley     DMLabel         label, newlabel;
414cd0c2139SMatthew G Knepley     const char     *lname;
415cd0c2139SMatthew G Knepley     PetscBool       isDepth;
416cd0c2139SMatthew G Knepley     IS              valueIS;
417cd0c2139SMatthew G Knepley     const PetscInt *values;
418cd0c2139SMatthew G Knepley     PetscInt        numValues, val;
419cd0c2139SMatthew G Knepley 
420cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr);
421cd0c2139SMatthew G Knepley     ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr);
422cd0c2139SMatthew G Knepley     if (isDepth) continue;
423cd0c2139SMatthew G Knepley     ierr = DMPlexCreateLabel(dmNew, lname);CHKERRQ(ierr);
424cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr);
425cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr);
426cd0c2139SMatthew G Knepley     ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
427cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr);
428cd0c2139SMatthew G Knepley     ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
429cd0c2139SMatthew G Knepley     for (val = 0; val < numValues; ++val) {
430cd0c2139SMatthew G Knepley       IS              pointIS;
431cd0c2139SMatthew G Knepley       const PetscInt *points;
432cd0c2139SMatthew G Knepley       PetscInt        numPoints, p;
433cd0c2139SMatthew G Knepley 
434cd0c2139SMatthew G Knepley       ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr);
435cd0c2139SMatthew G Knepley       ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);
436cd0c2139SMatthew G Knepley       ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
437cd0c2139SMatthew G Knepley       for (p = 0; p < numPoints; ++p) {
4382582d50cSToby Isaac         const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthShift);
439cd0c2139SMatthew G Knepley 
440cd0c2139SMatthew G Knepley         ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr);
441cd0c2139SMatthew G Knepley       }
442cd0c2139SMatthew G Knepley       ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);
443cd0c2139SMatthew G Knepley       ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
444cd0c2139SMatthew G Knepley     }
445cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
446cd0c2139SMatthew G Knepley     ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
447cd0c2139SMatthew G Knepley   }
448cd0c2139SMatthew G Knepley   /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */
449cd0c2139SMatthew G Knepley   ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr);
450cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
451cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
452cd0c2139SMatthew G Knepley   ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr);
453cd0c2139SMatthew G Knepley   ierr = DMPlexCreateLabel(dmNew, "vtk");CHKERRQ(ierr);
454cd0c2139SMatthew G Knepley   ierr = DMPlexCreateLabel(dmNew, "ghost");CHKERRQ(ierr);
455cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr);
456cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr);
457cd0c2139SMatthew G Knepley   for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) {
458cd0c2139SMatthew G Knepley     for (; c < leafLocal[l] && c < cEnd; ++c) {
459cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
460cd0c2139SMatthew G Knepley     }
461cd0c2139SMatthew G Knepley     if (leafLocal[l] >= cEnd) break;
462cd0c2139SMatthew G Knepley     if (leafRemote[l].rank == rank) {
463cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
464cd0c2139SMatthew G Knepley     } else {
465cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr);
466cd0c2139SMatthew G Knepley     }
467cd0c2139SMatthew G Knepley   }
468cd0c2139SMatthew G Knepley   for (; c < cEnd; ++c) {
469cd0c2139SMatthew G Knepley     ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
470cd0c2139SMatthew G Knepley   }
471cd0c2139SMatthew G Knepley   if (0) {
472cd0c2139SMatthew G Knepley     ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr);
473cd0c2139SMatthew G Knepley     ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
474cd0c2139SMatthew G Knepley     ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
475cd0c2139SMatthew G Knepley   }
476cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr);
477cd0c2139SMatthew G Knepley   for (f = fStart; f < fEnd; ++f) {
478cd0c2139SMatthew G Knepley     PetscInt numCells;
479cd0c2139SMatthew G Knepley 
480cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr);
481cd0c2139SMatthew G Knepley     if (numCells < 2) {
482cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);
483cd0c2139SMatthew G Knepley     } else {
484cd0c2139SMatthew G Knepley       const PetscInt *cells = NULL;
485cd0c2139SMatthew G Knepley       PetscInt        vA, vB;
486cd0c2139SMatthew G Knepley 
487cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr);
488cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr);
489cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr);
490cd0c2139SMatthew G Knepley       if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);}
491cd0c2139SMatthew G Knepley     }
492cd0c2139SMatthew G Knepley   }
493cd0c2139SMatthew G Knepley   if (0) {
494cd0c2139SMatthew G Knepley     ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr);
495cd0c2139SMatthew G Knepley     ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
496cd0c2139SMatthew G Knepley     ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
497cd0c2139SMatthew G Knepley   }
498cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
499cd0c2139SMatthew G Knepley }
500cd0c2139SMatthew G Knepley 
501cd0c2139SMatthew G Knepley #undef __FUNCT__
502ca04dac2SToby Isaac #define __FUNCT__ "DMPlexShiftTree_Internal"
503ca04dac2SToby Isaac static PetscErrorCode DMPlexShiftTree_Internal(DM dm, PetscInt depthShift[], DM dmNew)
504ca04dac2SToby Isaac {
505ca04dac2SToby Isaac   DM             refTree;
506ca04dac2SToby Isaac   PetscSection   pSec;
507ca04dac2SToby Isaac   PetscInt       *parents, *childIDs;
508ca04dac2SToby Isaac   PetscErrorCode ierr;
509ca04dac2SToby Isaac 
510ca04dac2SToby Isaac   PetscFunctionBegin;
511ca04dac2SToby Isaac   ierr = DMPlexGetReferenceTree(dm,&refTree);CHKERRQ(ierr);
512ca04dac2SToby Isaac   ierr = DMPlexSetReferenceTree(dmNew,refTree);CHKERRQ(ierr);
513ca04dac2SToby Isaac   ierr = DMPlexGetTree(dm,&pSec,&parents,&childIDs,NULL,NULL);CHKERRQ(ierr);
514ca04dac2SToby Isaac   if (pSec) {
5152582d50cSToby Isaac     PetscInt p, pStart, pEnd, *parentsShifted, pStartShifted, pEndShifted, depth;
516fb4630b5SToby Isaac     PetscInt *childIDsShifted;
517ca04dac2SToby Isaac     PetscSection pSecShifted;
518ca04dac2SToby Isaac 
519ca04dac2SToby Isaac     ierr = PetscSectionGetChart(pSec,&pStart,&pEnd);CHKERRQ(ierr);
520ca04dac2SToby Isaac     ierr = DMPlexGetDepth(dm,&depth);CHKERRQ(ierr);
5212582d50cSToby Isaac     pStartShifted = DMPlexShiftPoint_Internal(pStart,depth,depthShift);
5222582d50cSToby Isaac     pEndShifted   = DMPlexShiftPoint_Internal(pEnd,depth,depthShift);
523fb4630b5SToby Isaac     ierr = PetscMalloc2(pEndShifted - pStartShifted,&parentsShifted,pEndShifted-pStartShifted,&childIDsShifted);CHKERRQ(ierr);
524ca04dac2SToby Isaac     ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dmNew),&pSecShifted);CHKERRQ(ierr);
525ca04dac2SToby Isaac     ierr = PetscSectionSetChart(pSecShifted,pStartShifted,pEndShifted);CHKERRQ(ierr);
526ca04dac2SToby Isaac     for (p = pStartShifted; p < pEndShifted; p++) {
527fb4630b5SToby Isaac       /* start off assuming no children */
528fb4630b5SToby Isaac       ierr = PetscSectionSetDof(pSecShifted,p,0);CHKERRQ(ierr);
529fb4630b5SToby Isaac     }
530fb4630b5SToby Isaac     for (p = pStart; p < pEnd; p++) {
531fb4630b5SToby Isaac       PetscInt dof;
532fb4630b5SToby Isaac       PetscInt pNew = DMPlexShiftPoint_Internal(p,depth,depthShift);
533ca04dac2SToby Isaac 
534ca04dac2SToby Isaac       ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr);
535fb4630b5SToby Isaac       ierr = PetscSectionSetDof(pSecShifted,pNew,dof);CHKERRQ(ierr);
536ca04dac2SToby Isaac     }
537ca04dac2SToby Isaac     ierr = PetscSectionSetUp(pSecShifted);CHKERRQ(ierr);
538fb4630b5SToby Isaac     for (p = pStart; p < pEnd; p++) {
539fb4630b5SToby Isaac       PetscInt dof;
540fb4630b5SToby Isaac       PetscInt pNew = DMPlexShiftPoint_Internal(p,depth,depthShift);
541fb4630b5SToby Isaac 
542fb4630b5SToby Isaac       ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr);
543fb4630b5SToby Isaac       if (dof) {
544fb4630b5SToby Isaac         PetscInt off, offNew;
545fb4630b5SToby Isaac 
546fb4630b5SToby Isaac         ierr = PetscSectionGetOffset(pSec,p,&off);CHKERRQ(ierr);
547fb4630b5SToby Isaac         ierr = PetscSectionGetOffset(pSecShifted,pNew,&offNew);CHKERRQ(ierr);
548fb4630b5SToby Isaac         parentsShifted[offNew] = DMPlexShiftPoint_Internal(parents[off],depth,depthShift);
549fb4630b5SToby Isaac         childIDsShifted[offNew] = childIDs[off];
550fb4630b5SToby Isaac       }
551fb4630b5SToby Isaac     }
552fb4630b5SToby Isaac     ierr = DMPlexSetTree(dmNew,pSecShifted,parentsShifted,childIDsShifted);CHKERRQ(ierr);
553fb4630b5SToby Isaac     ierr = PetscFree2(parentsShifted,childIDsShifted);CHKERRQ(ierr);
554*e6885bbbSToby Isaac     ierr = PetscSectionDestroy(&pSecShifted);CHKERRQ(ierr);
555ca04dac2SToby Isaac   }
556ca04dac2SToby Isaac   PetscFunctionReturn(0);
557ca04dac2SToby Isaac }
558ca04dac2SToby Isaac 
559ca04dac2SToby Isaac #undef __FUNCT__
560cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal"
561cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm)
562cd0c2139SMatthew G Knepley {
563da97024aSMatthew G. Knepley   PetscSF         sf;
564cd0c2139SMatthew G Knepley   IS              valueIS;
565da97024aSMatthew G. Knepley   const PetscInt *values, *leaves;
566cd0c2139SMatthew G Knepley   PetscInt       *depthShift;
5672582d50cSToby Isaac   PetscInt        d, depth = 0, nleaves, loc, Ng, numFS, fs, fStart, fEnd, ghostCell, cEnd, c;
568cd0c2139SMatthew G Knepley   PetscErrorCode  ierr;
569cd0c2139SMatthew G Knepley 
570cd0c2139SMatthew G Knepley   PetscFunctionBegin;
571da97024aSMatthew G. Knepley   ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr);
572da97024aSMatthew G. Knepley   ierr = PetscSFGetGraph(sf, NULL, &nleaves, &leaves, NULL);CHKERRQ(ierr);
573da97024aSMatthew G. Knepley   nleaves = PetscMax(0, nleaves);
57446c796b9SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr);
575cd0c2139SMatthew G Knepley   /* Count ghost cells */
576cd0c2139SMatthew G Knepley   ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
577cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr);
578cd0c2139SMatthew G Knepley   ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
5794a6cfa73SMatthew G. Knepley   Ng   = 0;
580cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
58146c796b9SMatthew G. Knepley     IS              faceIS;
58246c796b9SMatthew G. Knepley     const PetscInt *faces;
58346c796b9SMatthew G. Knepley     PetscInt        numFaces, f, numBdFaces = 0;
584cd0c2139SMatthew G Knepley 
58546c796b9SMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
58646c796b9SMatthew G. Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
58746c796b9SMatthew G. Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
58846c796b9SMatthew G. Knepley     for (f = 0; f < numFaces; ++f) {
589ca04dac2SToby Isaac       PetscInt numChildren;
590ca04dac2SToby Isaac 
591da97024aSMatthew G. Knepley       ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr);
592ca04dac2SToby Isaac       ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr);
593ca04dac2SToby Isaac       /* non-local and ancestors points don't get to register ghosts */
594ca04dac2SToby Isaac       if (loc >= 0 || numChildren) continue;
59546c796b9SMatthew G. Knepley       if ((faces[f] >= fStart) && (faces[f] < fEnd)) ++numBdFaces;
59646c796b9SMatthew G. Knepley     }
5974a6cfa73SMatthew G. Knepley     Ng += numBdFaces;
59846c796b9SMatthew G. Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
599cd0c2139SMatthew G Knepley   }
600cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
6012582d50cSToby Isaac   ierr = PetscMalloc1(2*(depth+1), &depthShift);CHKERRQ(ierr);
6022582d50cSToby Isaac   for (d = 0; d <= depth; d++) {
60359eef20bSToby Isaac     PetscInt dEnd;
6042582d50cSToby Isaac 
6050974a383SToby Isaac     ierr = DMPlexGetDepthStratum(dm,d,NULL,&dEnd);CHKERRQ(ierr);
60659eef20bSToby Isaac     depthShift[2*d]   = dEnd;
6072582d50cSToby Isaac     depthShift[2*d+1] = 0;
6082582d50cSToby Isaac   }
6092582d50cSToby Isaac   if (depth >= 0) depthShift[2*depth+1] = Ng;
6102582d50cSToby Isaac   ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift);CHKERRQ(ierr);
611cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
612cd0c2139SMatthew G Knepley   /* Step 3: Set cone/support sizes for new points */
613cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
6145acea1aeSMatthew G. Knepley   ierr = DMPlexSetHybridBounds(gdm, cEnd, PETSC_DETERMINE, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr);
6154a6cfa73SMatthew G. Knepley   for (c = cEnd; c < cEnd + Ng; ++c) {
616cd0c2139SMatthew G Knepley     ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr);
617cd0c2139SMatthew G Knepley   }
618cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
619cd0c2139SMatthew G Knepley     IS              faceIS;
620cd0c2139SMatthew G Knepley     const PetscInt *faces;
621cd0c2139SMatthew G Knepley     PetscInt        numFaces, f;
622cd0c2139SMatthew G Knepley 
623cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
624cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
625cd0c2139SMatthew G Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
626cd0c2139SMatthew G Knepley     for (f = 0; f < numFaces; ++f) {
627ca04dac2SToby Isaac       PetscInt size, numChildren;
628cd0c2139SMatthew G Knepley 
629da97024aSMatthew G. Knepley       ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr);
630ca04dac2SToby Isaac       ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr);
631ca04dac2SToby Isaac       if (loc >= 0 || numChildren) continue;
63246c796b9SMatthew G. Knepley       if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue;
633cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr);
634cd0c2139SMatthew 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);
6354a6cfa73SMatthew G. Knepley       ierr = DMPlexSetSupportSize(gdm, faces[f] + Ng, 2);CHKERRQ(ierr);
636cd0c2139SMatthew G Knepley     }
637cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr);
638cd0c2139SMatthew G Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
639cd0c2139SMatthew G Knepley   }
640cd0c2139SMatthew G Knepley   /* Step 4: Setup ghosted DM */
641cd0c2139SMatthew G Knepley   ierr = DMSetUp(gdm);CHKERRQ(ierr);
642cd0c2139SMatthew G Knepley   ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
643cd0c2139SMatthew G Knepley   /* Step 6: Set cones and supports for new points */
644cd0c2139SMatthew G Knepley   ghostCell = cEnd;
645cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
646cd0c2139SMatthew G Knepley     IS              faceIS;
647cd0c2139SMatthew G Knepley     const PetscInt *faces;
648cd0c2139SMatthew G Knepley     PetscInt        numFaces, f;
649cd0c2139SMatthew G Knepley 
650cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
651cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
652cd0c2139SMatthew G Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
65346c796b9SMatthew G. Knepley     for (f = 0; f < numFaces; ++f) {
654ca04dac2SToby Isaac       PetscInt newFace = faces[f] + Ng, numChildren;
655cd0c2139SMatthew G Knepley 
656da97024aSMatthew G. Knepley       ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr);
657ca04dac2SToby Isaac       ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr);
658ca04dac2SToby Isaac       if (loc >= 0 || numChildren) continue;
65946c796b9SMatthew G. Knepley       if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue;
660cd0c2139SMatthew G Knepley       ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr);
661cd0c2139SMatthew G Knepley       ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr);
66246c796b9SMatthew G. Knepley       ++ghostCell;
663cd0c2139SMatthew G Knepley     }
664cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr);
665cd0c2139SMatthew G Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
666cd0c2139SMatthew G Knepley   }
667cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
668cd0c2139SMatthew G Knepley   ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
669cd0c2139SMatthew G Knepley   /* Step 7: Stratify */
670cd0c2139SMatthew G Knepley   ierr = DMPlexStratify(gdm);CHKERRQ(ierr);
671cd0c2139SMatthew G Knepley   ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
672cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
673cd0c2139SMatthew G Knepley   ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
674ca04dac2SToby Isaac   ierr = DMPlexShiftTree_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
675cd0c2139SMatthew G Knepley   ierr = PetscFree(depthShift);CHKERRQ(ierr);
676966c7b3fSMatthew G. Knepley   /* Step 7: Periodicity */
677966c7b3fSMatthew G. Knepley   if (dm->maxCell) {
678966c7b3fSMatthew G. Knepley     const PetscReal *maxCell, *L;
6795dc8c3f7SMatthew G. Knepley     const DMBoundaryType *bd;
6805dc8c3f7SMatthew G. Knepley     ierr = DMGetPeriodicity(dm,  &maxCell, &L, &bd);CHKERRQ(ierr);
6815dc8c3f7SMatthew G. Knepley     ierr = DMSetPeriodicity(gdm,  maxCell,  L,  bd);CHKERRQ(ierr);
682966c7b3fSMatthew G. Knepley   }
6834a6cfa73SMatthew G. Knepley   if (numGhostCells) *numGhostCells = Ng;
684cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
685cd0c2139SMatthew G Knepley }
686cd0c2139SMatthew G Knepley 
687cd0c2139SMatthew G Knepley #undef __FUNCT__
688cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells"
689cd0c2139SMatthew G Knepley /*@C
690cd0c2139SMatthew G Knepley   DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face
691cd0c2139SMatthew G Knepley 
692cd0c2139SMatthew G Knepley   Collective on dm
693cd0c2139SMatthew G Knepley 
694cd0c2139SMatthew G Knepley   Input Parameters:
695cd0c2139SMatthew G Knepley + dm - The original DM
696cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL
697cd0c2139SMatthew G Knepley 
698cd0c2139SMatthew G Knepley   Output Parameters:
699cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM
700cd0c2139SMatthew G Knepley - dmGhosted - The new DM
701cd0c2139SMatthew G Knepley 
702cd0c2139SMatthew G Knepley   Note: If no label exists of that name, one will be created marking all boundary faces
703cd0c2139SMatthew G Knepley 
704cd0c2139SMatthew G Knepley   Level: developer
705cd0c2139SMatthew G Knepley 
706cd0c2139SMatthew G Knepley .seealso: DMCreate()
70731266bc0SMatthew G. Knepley @*/
708cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted)
709cd0c2139SMatthew G Knepley {
710cd0c2139SMatthew G Knepley   DM             gdm;
711cd0c2139SMatthew G Knepley   DMLabel        label;
712cd0c2139SMatthew G Knepley   const char    *name = labelName ? labelName : "Face Sets";
713cd0c2139SMatthew G Knepley   PetscInt       dim;
714a42b08eeSMatthew G. Knepley   PetscBool      flag;
715cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
716cd0c2139SMatthew G Knepley 
717cd0c2139SMatthew G Knepley   PetscFunctionBegin;
718cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
7194a6cfa73SMatthew G. Knepley   if (numGhostCells) PetscValidPointer(numGhostCells, 3);
720cd0c2139SMatthew G Knepley   PetscValidPointer(dmGhosted, 4);
721cd0c2139SMatthew G Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr);
722cd0c2139SMatthew G Knepley   ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr);
723c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
724c73cfb54SMatthew G. Knepley   ierr = DMSetDimension(gdm, dim);CHKERRQ(ierr);
725a42b08eeSMatthew G. Knepley   ierr = DMPlexGetAdjacencyUseCone(dm, &flag);CHKERRQ(ierr);
726a42b08eeSMatthew G. Knepley   ierr = DMPlexSetAdjacencyUseCone(gdm, flag);CHKERRQ(ierr);
727a42b08eeSMatthew G. Knepley   ierr = DMPlexGetAdjacencyUseClosure(dm, &flag);CHKERRQ(ierr);
728a42b08eeSMatthew G. Knepley   ierr = DMPlexSetAdjacencyUseClosure(gdm, flag);CHKERRQ(ierr);
729cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr);
730cd0c2139SMatthew G Knepley   if (!label) {
731cd0c2139SMatthew G Knepley     /* Get label for boundary faces */
732cd0c2139SMatthew G Knepley     ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr);
733cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr);
734cd0c2139SMatthew G Knepley     ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr);
735cd0c2139SMatthew G Knepley   }
736cd0c2139SMatthew G Knepley   ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr);
7378e136ac0SMatthew G. Knepley   ierr = DMPlexCopyBoundary(dm, gdm);CHKERRQ(ierr);
738cd0c2139SMatthew G Knepley   *dmGhosted = gdm;
739cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
740cd0c2139SMatthew G Knepley }
741cd0c2139SMatthew G Knepley 
742cd0c2139SMatthew G Knepley #undef __FUNCT__
743cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal"
744607ab7a9SMatthew G. Knepley /*
745faedd622SMatthew G. Knepley   We are adding three kinds of points here:
746607ab7a9SMatthew G. Knepley     Replicated:     Copies of points which exist in the mesh, such as vertices identified across a fault
747faedd622SMatthew G. Knepley     Non-replicated: Points which exist on the fault, but are not replicated
748607ab7a9SMatthew G. Knepley     Hybrid:         Entirely new points, such as cohesive cells
749a6ae58d1SMatthew G. Knepley 
750a6ae58d1SMatthew G. Knepley   When creating subsequent cohesive cells, we shift the old hybrid cells to the end of the numbering at
751a6ae58d1SMatthew G. Knepley   each depth so that the new split/hybrid points can be inserted as a block.
752607ab7a9SMatthew G. Knepley */
753cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm)
754cd0c2139SMatthew G Knepley {
755cd0c2139SMatthew G Knepley   MPI_Comm         comm;
756607ab7a9SMatthew G. Knepley   IS               valueIS;
757607ab7a9SMatthew G. Knepley   PetscInt         numSP = 0;       /* The number of depths for which we have replicated points */
758607ab7a9SMatthew G. Knepley   const PetscInt  *values;          /* List of depths for which we have replicated points */
75918c5995bSMatthew G. Knepley   IS              *splitIS;
76018c5995bSMatthew G. Knepley   IS              *unsplitIS;
761607ab7a9SMatthew G. Knepley   PetscInt        *numSplitPoints;     /* The number of replicated points at each depth */
76218c5995bSMatthew G. Knepley   PetscInt        *numUnsplitPoints;   /* The number of non-replicated points at each depth which still give rise to hybrid points */
76336dbac82SMatthew G. Knepley   PetscInt        *numHybridPoints;    /* The number of new hybrid points at each depth */
76436dbac82SMatthew G. Knepley   PetscInt        *numHybridPointsOld; /* The number of existing hybrid points at each depth */
765607ab7a9SMatthew G. Knepley   const PetscInt **splitPoints;        /* Replicated points for each depth */
76618c5995bSMatthew G. Knepley   const PetscInt **unsplitPoints;      /* Non-replicated points for each depth */
767cd0c2139SMatthew G Knepley   PetscSection     coordSection;
768cd0c2139SMatthew G Knepley   Vec              coordinates;
769cd0c2139SMatthew G Knepley   PetscScalar     *coords;
770a6ae58d1SMatthew G. Knepley   PetscInt        *depthMax;           /* The first hybrid point at each depth in the original mesh */
771a6ae58d1SMatthew G. Knepley   PetscInt        *depthEnd;           /* The point limit at each depth in the original mesh */
772607ab7a9SMatthew G. Knepley   PetscInt        *depthShift;         /* Number of replicated+hybrid points at each depth */
773607ab7a9SMatthew G. Knepley   PetscInt        *pMaxNew;            /* The first replicated point at each depth in the new mesh, hybrids come after this */
774607ab7a9SMatthew G. Knepley   PetscInt        *coneNew, *coneONew, *supportNew;
77518c5995bSMatthew G. Knepley   PetscInt         shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v;
776cd0c2139SMatthew G Knepley   PetscErrorCode   ierr;
777cd0c2139SMatthew G Knepley 
778cd0c2139SMatthew G Knepley   PetscFunctionBegin;
779cd0c2139SMatthew G Knepley   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
780c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
781607ab7a9SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
782fd4b9f15SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
783cd0c2139SMatthew G Knepley   /* Count split points and add cohesive cells */
784607ab7a9SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
7852582d50cSToby Isaac   ierr = PetscMalloc5(depth+1,&depthMax,depth+1,&depthEnd,2*(depth+1),&depthShift,depth+1,&pMaxNew,depth+1,&numHybridPointsOld);CHKERRQ(ierr);
786dcca6d9dSJed 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);
787a6ae58d1SMatthew 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);
788607ab7a9SMatthew G. Knepley   for (d = 0; d <= depth; ++d) {
789607ab7a9SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr);
790a6ae58d1SMatthew G. Knepley     depthEnd[d]           = pMaxNew[d];
791a6ae58d1SMatthew G. Knepley     depthMax[d]           = depthMax[d] < 0 ? depthEnd[d] : depthMax[d];
792607ab7a9SMatthew G. Knepley     numSplitPoints[d]     = 0;
79318c5995bSMatthew G. Knepley     numUnsplitPoints[d]   = 0;
794607ab7a9SMatthew G. Knepley     numHybridPoints[d]    = 0;
795a6ae58d1SMatthew G. Knepley     numHybridPointsOld[d] = depthMax[d] < 0 ? 0 : depthEnd[d] - depthMax[d];
796607ab7a9SMatthew G. Knepley     splitPoints[d]        = NULL;
79718c5995bSMatthew G. Knepley     unsplitPoints[d]      = NULL;
79818c5995bSMatthew G. Knepley     splitIS[d]            = NULL;
79918c5995bSMatthew G. Knepley     unsplitIS[d]          = NULL;
80059eef20bSToby Isaac     /* we are shifting the existing hybrid points with the stratum behind them, so
80159eef20bSToby Isaac      * the split comes at the end of the normal points, i.e., at depthMax[d] */
80259eef20bSToby Isaac     depthShift[2*d]       = depthMax[d];
80359eef20bSToby Isaac     depthShift[2*d+1]     = 0;
804607ab7a9SMatthew G. Knepley   }
805cd0c2139SMatthew G Knepley   if (label) {
806cd0c2139SMatthew G Knepley     ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
807cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr);
808cd0c2139SMatthew G Knepley     ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
809cd0c2139SMatthew G Knepley   }
810cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
811cd0c2139SMatthew G Knepley     const PetscInt dep = values[sp];
812cd0c2139SMatthew G Knepley 
813cd0c2139SMatthew G Knepley     if ((dep < 0) || (dep > depth)) continue;
81418c5995bSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr);
81518c5995bSMatthew G. Knepley     if (splitIS[dep]) {
81618c5995bSMatthew G. Knepley       ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr);
81718c5995bSMatthew G. Knepley       ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);
81818c5995bSMatthew G. Knepley     }
81918c5995bSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr);
82018c5995bSMatthew G. Knepley     if (unsplitIS[dep]) {
82118c5995bSMatthew G. Knepley       ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr);
82218c5995bSMatthew G. Knepley       ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);
823cd0c2139SMatthew G Knepley     }
824cd0c2139SMatthew G Knepley   }
825607ab7a9SMatthew G. Knepley   /* Calculate number of hybrid points */
82618c5995bSMatthew 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   */
8272582d50cSToby Isaac   for (d = 0; d <= depth; ++d) depthShift[2*d+1]      = numSplitPoints[d] + numHybridPoints[d];
8282582d50cSToby Isaac   ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift);
82959eef20bSToby Isaac   /* the end of the points in this stratum that come before the new points:
83059eef20bSToby Isaac    * shifting pMaxNew[d] gets the new start of the next stratum, then count back the old hybrid points and the newly
83159eef20bSToby Isaac    * added points */
8322582d50cSToby Isaac   for (d = 0; d <= depth; ++d) pMaxNew[d]             = DMPlexShiftPoint_Internal(pMaxNew[d],depth,depthShift) - (numHybridPointsOld[d] + numSplitPoints[d] + numHybridPoints[d]);
833cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
834cd0c2139SMatthew G Knepley   /* Step 3: Set cone/support sizes for new points */
835cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
836cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
837cd0c2139SMatthew G Knepley       const PetscInt  oldp   = splitPoints[dep][p];
8382582d50cSToby Isaac       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/;
8394c367dbcSMatthew G. Knepley       const PetscInt  splitp = p    + pMaxNew[dep];
840cd0c2139SMatthew G Knepley       const PetscInt *support;
8414c367dbcSMatthew G. Knepley       PetscInt        coneSize, supportSize, qf, qn, qp, e;
842cd0c2139SMatthew G Knepley 
843cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
844cd0c2139SMatthew G Knepley       ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr);
845cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
846cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr);
847cd0c2139SMatthew G Knepley       if (dep == depth-1) {
8484c367dbcSMatthew G. Knepley         const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
8494c367dbcSMatthew G. Knepley 
850cd0c2139SMatthew G Knepley         /* Add cohesive cells, they are prisms */
8514c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr);
852cd0c2139SMatthew G Knepley       } else if (dep == 0) {
8534c367dbcSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
854cd0c2139SMatthew G Knepley 
855cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
8564c367dbcSMatthew G. Knepley         for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) {
857cd0c2139SMatthew G Knepley           PetscInt val;
858cd0c2139SMatthew G Knepley 
859cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
8604c367dbcSMatthew G. Knepley           if (val == 1) ++qf;
8614c367dbcSMatthew G. Knepley           if ((val == 1) || (val ==  (shift + 1))) ++qn;
8624c367dbcSMatthew G. Knepley           if ((val == 1) || (val == -(shift + 1))) ++qp;
863cd0c2139SMatthew G Knepley         }
8644c367dbcSMatthew G. Knepley         /* Split old vertex: Edges into original vertex and new cohesive edge */
8654c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr);
8664c367dbcSMatthew G. Knepley         /* Split new vertex: Edges into split vertex and new cohesive edge */
8674c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr);
8684c367dbcSMatthew G. Knepley         /* Add hybrid edge */
8694c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr);
8704c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr);
871cd0c2139SMatthew G Knepley       } else if (dep == dim-2) {
8724c367dbcSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
8734c367dbcSMatthew G. Knepley 
874cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
8754c367dbcSMatthew G. Knepley         for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) {
876cd0c2139SMatthew G Knepley           PetscInt val;
877cd0c2139SMatthew G Knepley 
878cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
8794c367dbcSMatthew G. Knepley           if (val == dim-1) ++qf;
8804c367dbcSMatthew G. Knepley           if ((val == dim-1) || (val ==  (shift + dim-1))) ++qn;
8814c367dbcSMatthew G. Knepley           if ((val == dim-1) || (val == -(shift + dim-1))) ++qp;
882cd0c2139SMatthew G Knepley         }
8834c367dbcSMatthew G. Knepley         /* Split old edge: Faces into original edge and cohesive face (positive side?) */
8844c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr);
8854c367dbcSMatthew G. Knepley         /* Split new edge: Faces into split edge and cohesive face (negative side?) */
8864c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr);
8874c367dbcSMatthew G. Knepley         /* Add hybrid face */
8884c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr);
8894c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr);
890cd0c2139SMatthew G Knepley       }
891cd0c2139SMatthew G Knepley     }
892cd0c2139SMatthew G Knepley   }
89318c5995bSMatthew G. Knepley   for (dep = 0; dep <= depth; ++dep) {
89418c5995bSMatthew G. Knepley     for (p = 0; p < numUnsplitPoints[dep]; ++p) {
89518c5995bSMatthew G. Knepley       const PetscInt  oldp   = unsplitPoints[dep][p];
8962582d50cSToby Isaac       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/;
89718c5995bSMatthew G. Knepley       const PetscInt *support;
898da1dd7e4SMatthew G. Knepley       PetscInt        coneSize, supportSize, qf, e, s;
89918c5995bSMatthew G. Knepley 
90018c5995bSMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
90118c5995bSMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
90239254ff6SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
90318c5995bSMatthew G. Knepley       if (dep == 0) {
90418c5995bSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
90518c5995bSMatthew G. Knepley 
90639254ff6SMatthew G. Knepley         /* Unsplit vertex: Edges into original vertex, split edges, and new cohesive edge twice */
90739254ff6SMatthew G. Knepley         for (s = 0, qf = 0; s < supportSize; ++s, ++qf) {
90839254ff6SMatthew G. Knepley           ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr);
90939254ff6SMatthew G. Knepley           if (e >= 0) ++qf;
91039254ff6SMatthew G. Knepley         }
91139254ff6SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr);
91218c5995bSMatthew G. Knepley         /* Add hybrid edge */
91318c5995bSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr);
914e1757548SMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
915e1757548SMatthew G. Knepley           PetscInt val;
916e1757548SMatthew G. Knepley 
917e1757548SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
918e1757548SMatthew G. Knepley           /* Split and unsplit edges produce hybrid faces */
919da1dd7e4SMatthew G. Knepley           if (val == 1) ++qf;
920da1dd7e4SMatthew G. Knepley           if (val == (shift2 + 1)) ++qf;
921e1757548SMatthew G. Knepley         }
922e1757548SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr);
92318c5995bSMatthew G. Knepley       } else if (dep == dim-2) {
92418c5995bSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
925cd0c2139SMatthew G Knepley         PetscInt       val;
926cd0c2139SMatthew G Knepley 
927da1dd7e4SMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
928cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
929da1dd7e4SMatthew G. Knepley           if (val == dim-1) qf += 2;
930da1dd7e4SMatthew G. Knepley           else              ++qf;
931cd0c2139SMatthew G Knepley         }
93218c5995bSMatthew G. Knepley         /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */
933da1dd7e4SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr);
93418c5995bSMatthew G. Knepley         /* Add hybrid face */
935da1dd7e4SMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
936da1dd7e4SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
937da1dd7e4SMatthew G. Knepley           if (val == dim-1) ++qf;
938da1dd7e4SMatthew G. Knepley         }
93918c5995bSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr);
940da1dd7e4SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr);
941cd0c2139SMatthew G Knepley       }
942cd0c2139SMatthew G Knepley     }
943cd0c2139SMatthew G Knepley   }
944cd0c2139SMatthew G Knepley   /* Step 4: Setup split DM */
945cd0c2139SMatthew G Knepley   ierr = DMSetUp(sdm);CHKERRQ(ierr);
946cd0c2139SMatthew G Knepley   ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
947dcbb62e8SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr);
948dcca6d9dSJed Brown   ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),&supportNew);CHKERRQ(ierr);
949cd0c2139SMatthew G Knepley   /* Step 6: Set cones and supports for new points */
950cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
951cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
952cd0c2139SMatthew G Knepley       const PetscInt  oldp   = splitPoints[dep][p];
9532582d50cSToby Isaac       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/;
9544c367dbcSMatthew G. Knepley       const PetscInt  splitp = p    + pMaxNew[dep];
955cd0c2139SMatthew G Knepley       const PetscInt *cone, *support, *ornt;
9564c367dbcSMatthew G. Knepley       PetscInt        coneSize, supportSize, q, qf, qn, qp, v, e, s;
957cd0c2139SMatthew G Knepley 
958cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
959cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr);
960cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr);
961cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
962cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
963cd0c2139SMatthew G Knepley       if (dep == depth-1) {
96496a07cd0SMatthew G. Knepley         PetscBool       hasUnsplit = PETSC_FALSE;
9654c367dbcSMatthew G. Knepley         const PetscInt  hybcell    = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
966cd0c2139SMatthew G Knepley         const PetscInt *supportF;
967cd0c2139SMatthew G Knepley 
968cd0c2139SMatthew G Knepley         /* Split face:       copy in old face to new face to start */
969cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(sdm, newp,  &supportF);CHKERRQ(ierr);
970cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr);
971cd0c2139SMatthew G Knepley         /* Split old face:   old vertices/edges in cone so no change */
972cd0c2139SMatthew G Knepley         /* Split new face:   new vertices/edges in cone */
973cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
9744c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
97518c5995bSMatthew G. Knepley           if (v < 0) {
97618c5995bSMatthew G. Knepley             ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
97718c5995bSMatthew 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);
9782582d50cSToby Isaac             coneNew[2+q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/;
97996a07cd0SMatthew G. Knepley             hasUnsplit   = PETSC_TRUE;
98018c5995bSMatthew G. Knepley           } else {
9814c367dbcSMatthew G. Knepley             coneNew[2+q] = v + pMaxNew[dep-1];
982163235baSMatthew G. Knepley             if (dep > 1) {
983163235baSMatthew G. Knepley               const PetscInt *econe;
984163235baSMatthew G. Knepley               PetscInt        econeSize, r, vs, vu;
985163235baSMatthew G. Knepley 
986163235baSMatthew G. Knepley               ierr = DMPlexGetConeSize(dm, cone[q], &econeSize);CHKERRQ(ierr);
987163235baSMatthew G. Knepley               ierr = DMPlexGetCone(dm, cone[q], &econe);CHKERRQ(ierr);
988163235baSMatthew G. Knepley               for (r = 0; r < econeSize; ++r) {
989163235baSMatthew G. Knepley                 ierr = PetscFindInt(econe[r], numSplitPoints[dep-2],   splitPoints[dep-2],   &vs);CHKERRQ(ierr);
990163235baSMatthew G. Knepley                 ierr = PetscFindInt(econe[r], numUnsplitPoints[dep-2], unsplitPoints[dep-2], &vu);CHKERRQ(ierr);
991163235baSMatthew G. Knepley                 if (vs >= 0) continue;
992163235baSMatthew 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);
993163235baSMatthew G. Knepley                 hasUnsplit   = PETSC_TRUE;
994163235baSMatthew G. Knepley               }
995163235baSMatthew G. Knepley             }
996cd0c2139SMatthew G Knepley           }
997cd0c2139SMatthew G Knepley         }
998cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr);
999cd0c2139SMatthew G Knepley         ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr);
1000e537020bSMatthew G. Knepley         /* Face support */
1001cd0c2139SMatthew G Knepley         for (s = 0; s < supportSize; ++s) {
1002cd0c2139SMatthew G Knepley           PetscInt val;
1003cd0c2139SMatthew G Knepley 
1004cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr);
1005cd0c2139SMatthew G Knepley           if (val < 0) {
1006cd0c2139SMatthew G Knepley             /* Split old face:   Replace negative side cell with cohesive cell */
10074c367dbcSMatthew G. Knepley              ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr);
1008cd0c2139SMatthew G Knepley           } else {
1009cd0c2139SMatthew G Knepley             /* Split new face:   Replace positive side cell with cohesive cell */
10104c367dbcSMatthew G. Knepley             ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr);
1011e537020bSMatthew G. Knepley             /* Get orientation for cohesive face */
1012e537020bSMatthew G. Knepley             {
1013e537020bSMatthew G. Knepley               const PetscInt *ncone, *nconeO;
1014e537020bSMatthew G. Knepley               PetscInt        nconeSize, nc;
1015e537020bSMatthew G. Knepley 
1016e537020bSMatthew G. Knepley               ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr);
1017e537020bSMatthew G. Knepley               ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr);
1018e537020bSMatthew G. Knepley               ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr);
1019e537020bSMatthew G. Knepley               for (nc = 0; nc < nconeSize; ++nc) {
1020e537020bSMatthew G. Knepley                 if (ncone[nc] == oldp) {
1021e537020bSMatthew G. Knepley                   coneONew[0] = nconeO[nc];
1022e537020bSMatthew G. Knepley                   break;
1023cd0c2139SMatthew G Knepley                 }
1024cd0c2139SMatthew G Knepley               }
1025e537020bSMatthew 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]);
1026e537020bSMatthew G. Knepley             }
1027e537020bSMatthew G. Knepley           }
1028e537020bSMatthew G. Knepley         }
10294c367dbcSMatthew G. Knepley         /* Cohesive cell:    Old and new split face, then new cohesive faces */
1030fd4b9f15SMatthew G. Knepley         coneNew[0]  = newp;   /* Extracted negative side orientation above */
10314c367dbcSMatthew G. Knepley         coneNew[1]  = splitp;
10324c367dbcSMatthew G. Knepley         coneONew[1] = coneONew[0];
1033e537020bSMatthew G. Knepley         for (q = 0; q < coneSize; ++q) {
103418c5995bSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
103518c5995bSMatthew G. Knepley           if (v < 0) {
103618c5995bSMatthew G. Knepley             ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
103718c5995bSMatthew G. Knepley             coneNew[2+q]  = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
103818c5995bSMatthew G. Knepley             coneONew[2+q] = 0;
103918c5995bSMatthew G. Knepley           } else {
104018c5995bSMatthew G. Knepley             coneNew[2+q]  = v + pMaxNew[dep] + numSplitPoints[dep];
104118c5995bSMatthew G. Knepley           }
1042e537020bSMatthew G. Knepley           coneONew[2+q] = 0;
1043e537020bSMatthew G. Knepley         }
10444c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr);
10454c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr);
104696a07cd0SMatthew G. Knepley         /* Label the hybrid cells on the boundary of the split */
104796a07cd0SMatthew G. Knepley         if (hasUnsplit) {ierr = DMLabelSetValue(label, -hybcell, dim);CHKERRQ(ierr);}
1048cd0c2139SMatthew G Knepley       } else if (dep == 0) {
10494c367dbcSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1050cd0c2139SMatthew G Knepley 
1051cd0c2139SMatthew G Knepley         /* Split old vertex: Edges in old split faces and new cohesive edge */
10524c367dbcSMatthew G. Knepley         for (e = 0, qn = 0; e < supportSize; ++e) {
1053cd0c2139SMatthew G Knepley           PetscInt val;
1054cd0c2139SMatthew G Knepley 
1055cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
1056cd0c2139SMatthew G Knepley           if ((val == 1) || (val == (shift + 1))) {
10572582d50cSToby Isaac             supportNew[qn++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/;
1058cd0c2139SMatthew G Knepley           }
1059cd0c2139SMatthew G Knepley         }
10604c367dbcSMatthew G. Knepley         supportNew[qn] = hybedge;
1061cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
1062cd0c2139SMatthew G Knepley         /* Split new vertex: Edges in new split faces and new cohesive edge */
10634c367dbcSMatthew G. Knepley         for (e = 0, qp = 0; e < supportSize; ++e) {
1064cd0c2139SMatthew G Knepley           PetscInt val, edge;
1065cd0c2139SMatthew G Knepley 
1066cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
1067cd0c2139SMatthew G Knepley           if (val == 1) {
10684c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
1069cd0c2139SMatthew G Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
10704c367dbcSMatthew G. Knepley             supportNew[qp++] = edge + pMaxNew[dep+1];
1071cd0c2139SMatthew G Knepley           } else if (val == -(shift + 1)) {
10722582d50cSToby Isaac             supportNew[qp++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/;
1073cd0c2139SMatthew G Knepley           }
1074cd0c2139SMatthew G Knepley         }
10754c367dbcSMatthew G. Knepley         supportNew[qp] = hybedge;
1076cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr);
10774c367dbcSMatthew G. Knepley         /* Hybrid edge:    Old and new split vertex */
1078cd0c2139SMatthew G Knepley         coneNew[0] = newp;
1079cd0c2139SMatthew G Knepley         coneNew[1] = splitp;
10804c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr);
10814c367dbcSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
10824c367dbcSMatthew G. Knepley           PetscInt val, edge;
10834c367dbcSMatthew G. Knepley 
10844c367dbcSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
10854c367dbcSMatthew G. Knepley           if (val == 1) {
10864c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
10874c367dbcSMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
10884c367dbcSMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2];
10894c367dbcSMatthew G. Knepley           }
10904c367dbcSMatthew G. Knepley         }
10914c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr);
1092cd0c2139SMatthew G Knepley       } else if (dep == dim-2) {
10934c367dbcSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
10944c367dbcSMatthew G. Knepley 
1095cd0c2139SMatthew G Knepley         /* Split old edge:   old vertices in cone so no change */
1096cd0c2139SMatthew G Knepley         /* Split new edge:   new vertices in cone */
1097cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
10984c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
1099e1757548SMatthew G. Knepley           if (v < 0) {
1100e1757548SMatthew G. Knepley             ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
1101e1757548SMatthew 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);
11022582d50cSToby Isaac             coneNew[q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/;
1103e1757548SMatthew G. Knepley           } else {
11044c367dbcSMatthew G. Knepley             coneNew[q] = v + pMaxNew[dep-1];
1105cd0c2139SMatthew G Knepley           }
1106e1757548SMatthew G. Knepley         }
1107cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr);
1108cd0c2139SMatthew G Knepley         /* Split old edge: Faces in positive side cells and old split faces */
1109cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
1110cd0c2139SMatthew G Knepley           PetscInt val;
1111cd0c2139SMatthew G Knepley 
1112cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
11134c367dbcSMatthew G. Knepley           if (val == dim-1) {
11142582d50cSToby Isaac             supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/;
11154c367dbcSMatthew G. Knepley           } else if (val == (shift + dim-1)) {
11162582d50cSToby Isaac             supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/;
1117cd0c2139SMatthew G Knepley           }
1118cd0c2139SMatthew G Knepley         }
1119b279cd2aSMatthew G. Knepley         supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1120cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
1121cd0c2139SMatthew G Knepley         /* Split new edge: Faces in negative side cells and new split faces */
1122cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
1123cd0c2139SMatthew G Knepley           PetscInt val, face;
1124cd0c2139SMatthew G Knepley 
1125cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
1126cd0c2139SMatthew G Knepley           if (val == dim-1) {
11274c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
1128cd0c2139SMatthew G Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]);
11294c367dbcSMatthew G. Knepley             supportNew[q++] = face + pMaxNew[dep+1];
1130cd0c2139SMatthew G Knepley           } else if (val == -(shift + dim-1)) {
11312582d50cSToby Isaac             supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/;
1132cd0c2139SMatthew G Knepley           }
1133cd0c2139SMatthew G Knepley         }
1134b279cd2aSMatthew G. Knepley         supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1135cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr);
11364c367dbcSMatthew G. Knepley         /* Hybrid face */
11374c367dbcSMatthew G. Knepley         coneNew[0] = newp;
11384c367dbcSMatthew G. Knepley         coneNew[1] = splitp;
11394c367dbcSMatthew G. Knepley         for (v = 0; v < coneSize; ++v) {
11404c367dbcSMatthew G. Knepley           PetscInt vertex;
11414c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr);
1142e1757548SMatthew G. Knepley           if (vertex < 0) {
1143e1757548SMatthew G. Knepley             ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr);
1144e1757548SMatthew 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);
1145e1757548SMatthew G. Knepley             coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
1146e1757548SMatthew G. Knepley           } else {
11474c367dbcSMatthew G. Knepley             coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep];
11484c367dbcSMatthew G. Knepley           }
1149e1757548SMatthew G. Knepley         }
11504c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr);
11514c367dbcSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
11524c367dbcSMatthew G. Knepley           PetscInt val, face;
11534c367dbcSMatthew G. Knepley 
11544c367dbcSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
11554c367dbcSMatthew G. Knepley           if (val == dim-1) {
11564c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
11574c367dbcSMatthew G. Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]);
11584c367dbcSMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2];
11594c367dbcSMatthew G. Knepley           }
11604c367dbcSMatthew G. Knepley         }
11614c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr);
1162cd0c2139SMatthew G Knepley       }
1163cd0c2139SMatthew G Knepley     }
1164cd0c2139SMatthew G Knepley   }
116518c5995bSMatthew G. Knepley   for (dep = 0; dep <= depth; ++dep) {
116618c5995bSMatthew G. Knepley     for (p = 0; p < numUnsplitPoints[dep]; ++p) {
116718c5995bSMatthew G. Knepley       const PetscInt  oldp   = unsplitPoints[dep][p];
11682582d50cSToby Isaac       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/;
116918c5995bSMatthew G. Knepley       const PetscInt *cone, *support, *ornt;
1170e1757548SMatthew G. Knepley       PetscInt        coneSize, supportSize, supportSizeNew, q, qf, e, f, s;
117118c5995bSMatthew G. Knepley 
117218c5995bSMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
117318c5995bSMatthew G. Knepley       ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr);
117418c5995bSMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr);
117518c5995bSMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
117618c5995bSMatthew G. Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
117718c5995bSMatthew G. Knepley       if (dep == 0) {
117818c5995bSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
117918c5995bSMatthew G. Knepley 
118018c5995bSMatthew G. Knepley         /* Unsplit vertex */
118118c5995bSMatthew G. Knepley         ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr);
118218c5995bSMatthew G. Knepley         for (s = 0, q = 0; s < supportSize; ++s) {
11832582d50cSToby Isaac           supportNew[q++] = DMPlexShiftPoint_Internal(support[s], depth, depthShift) /*support[s] + depthOffset[dep+1]*/;
118418c5995bSMatthew G. Knepley           ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr);
118518c5995bSMatthew G. Knepley           if (e >= 0) {
118618c5995bSMatthew G. Knepley             supportNew[q++] = e + pMaxNew[dep+1];
118718c5995bSMatthew G. Knepley           }
118818c5995bSMatthew G. Knepley         }
118918c5995bSMatthew G. Knepley         supportNew[q++] = hybedge;
119018c5995bSMatthew G. Knepley         supportNew[q++] = hybedge;
119118c5995bSMatthew G. Knepley         if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp);
119218c5995bSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
119318c5995bSMatthew G. Knepley         /* Hybrid edge */
119418c5995bSMatthew G. Knepley         coneNew[0] = newp;
119518c5995bSMatthew G. Knepley         coneNew[1] = newp;
119618c5995bSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr);
119718c5995bSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
119818c5995bSMatthew G. Knepley           PetscInt val, edge;
119918c5995bSMatthew G. Knepley 
120018c5995bSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
120118c5995bSMatthew G. Knepley           if (val == 1) {
120218c5995bSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
120318c5995bSMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
120418c5995bSMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2];
1205e1757548SMatthew G. Knepley           } else if  (val ==  (shift2 + 1)) {
1206e1757548SMatthew G. Knepley             ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr);
1207e1757548SMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]);
1208e1757548SMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1];
120918c5995bSMatthew G. Knepley           }
121018c5995bSMatthew G. Knepley         }
121118c5995bSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr);
1212e1757548SMatthew G. Knepley       } else if (dep == dim-2) {
1213e1757548SMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
1214e1757548SMatthew G. Knepley 
1215da1dd7e4SMatthew G. Knepley         /* Unsplit edge: Faces into original edge, split face, and hybrid face twice */
1216e1757548SMatthew G. Knepley         for (f = 0, qf = 0; f < supportSize; ++f) {
1217e1757548SMatthew G. Knepley           PetscInt val, face;
1218e1757548SMatthew G. Knepley 
1219e1757548SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr);
1220e1757548SMatthew G. Knepley           if (val == dim-1) {
1221e1757548SMatthew G. Knepley             ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
1222e1757548SMatthew G. Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]);
12232582d50cSToby Isaac             supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/;
1224e1757548SMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+1];
1225e1757548SMatthew G. Knepley           } else {
12262582d50cSToby Isaac             supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/;
1227e1757548SMatthew G. Knepley           }
1228e1757548SMatthew G. Knepley         }
1229e1757548SMatthew G. Knepley         supportNew[qf++] = hybface;
1230e1757548SMatthew G. Knepley         supportNew[qf++] = hybface;
1231da1dd7e4SMatthew G. Knepley         ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr);
1232da1dd7e4SMatthew 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);
1233e1757548SMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
1234e1757548SMatthew G. Knepley         /* Add hybrid face */
1235e1757548SMatthew G. Knepley         coneNew[0] = newp;
1236212cc919SMatthew G. Knepley         coneNew[1] = newp;
1237e1757548SMatthew G. Knepley         ierr = PetscFindInt(cone[0], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
1238e1757548SMatthew G. Knepley         if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[0]);
1239212cc919SMatthew G. Knepley         coneNew[2] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
1240e1757548SMatthew G. Knepley         ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
1241e1757548SMatthew G. Knepley         if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]);
1242e1757548SMatthew G. Knepley         coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
1243e1757548SMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr);
1244da1dd7e4SMatthew G. Knepley         for (f = 0, qf = 0; f < supportSize; ++f) {
1245da1dd7e4SMatthew G. Knepley           PetscInt val, face;
1246da1dd7e4SMatthew G. Knepley 
1247da1dd7e4SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr);
1248da1dd7e4SMatthew G. Knepley           if (val == dim-1) {
1249da1dd7e4SMatthew G. Knepley             ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
1250da1dd7e4SMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2];
1251da1dd7e4SMatthew G. Knepley           }
1252da1dd7e4SMatthew G. Knepley         }
1253da1dd7e4SMatthew G. Knepley         ierr = DMPlexGetSupportSize(sdm, hybface, &supportSizeNew);CHKERRQ(ierr);
1254da1dd7e4SMatthew 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);
1255e1757548SMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr);
1256cd0c2139SMatthew G Knepley       }
1257cd0c2139SMatthew G Knepley     }
1258cd0c2139SMatthew G Knepley   }
1259cd0c2139SMatthew G Knepley   /* Step 6b: Replace split points in negative side cones */
1260cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
1261cd0c2139SMatthew G Knepley     PetscInt        dep = values[sp];
1262cd0c2139SMatthew G Knepley     IS              pIS;
1263cd0c2139SMatthew G Knepley     PetscInt        numPoints;
1264cd0c2139SMatthew G Knepley     const PetscInt *points;
1265cd0c2139SMatthew G Knepley 
1266cd0c2139SMatthew G Knepley     if (dep >= 0) continue;
1267cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr);
1268cd0c2139SMatthew G Knepley     if (!pIS) continue;
1269cd0c2139SMatthew G Knepley     dep  = -dep - shift;
1270cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr);
1271cd0c2139SMatthew G Knepley     ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr);
1272cd0c2139SMatthew G Knepley     for (p = 0; p < numPoints; ++p) {
1273cd0c2139SMatthew G Knepley       const PetscInt  oldp = points[p];
12742582d50cSToby Isaac       const PetscInt  newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*depthOffset[dep] + oldp*/;
1275cd0c2139SMatthew G Knepley       const PetscInt *cone;
1276cd0c2139SMatthew G Knepley       PetscInt        coneSize, c;
127750cf782dSMatthew G. Knepley       /* PetscBool       replaced = PETSC_FALSE; */
1278cd0c2139SMatthew G Knepley 
1279cd0c2139SMatthew G Knepley       /* Negative edge: replace split vertex */
1280cd0c2139SMatthew G Knepley       /* Negative cell: replace split face */
1281cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr);
1282cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr);
1283cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
12842582d50cSToby Isaac         const PetscInt coldp = DMPlexShiftPointInverse_Internal(cone[2],depth,depthShift);
1285cd0c2139SMatthew G Knepley         PetscInt       csplitp, cp, val;
1286cd0c2139SMatthew G Knepley 
1287cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr);
1288cd0c2139SMatthew G Knepley         if (val == dep-1) {
1289cd0c2139SMatthew G Knepley           ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr);
1290cd0c2139SMatthew G Knepley           if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1);
1291cd0c2139SMatthew G Knepley           csplitp  = pMaxNew[dep-1] + cp;
1292cd0c2139SMatthew G Knepley           ierr     = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr);
129350cf782dSMatthew G. Knepley           /* replaced = PETSC_TRUE; */
1294cd0c2139SMatthew G Knepley         }
1295cd0c2139SMatthew G Knepley       }
12964a189a86SMatthew G. Knepley       /* Cells with only a vertex or edge on the submesh have no replacement */
12974a189a86SMatthew G. Knepley       /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */
1298cd0c2139SMatthew G Knepley     }
1299cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr);
1300cd0c2139SMatthew G Knepley     ierr = ISDestroy(&pIS);CHKERRQ(ierr);
1301cd0c2139SMatthew G Knepley   }
1302cd0c2139SMatthew G Knepley   /* Step 7: Stratify */
1303cd0c2139SMatthew G Knepley   ierr = DMPlexStratify(sdm);CHKERRQ(ierr);
1304cd0c2139SMatthew G Knepley   /* Step 8: Coordinates */
1305cd0c2139SMatthew G Knepley   ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
130669d8a9ceSMatthew G. Knepley   ierr = DMGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr);
1307cd0c2139SMatthew G Knepley   ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr);
1308cd0c2139SMatthew G Knepley   ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
1309cd0c2139SMatthew G Knepley   for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) {
13102582d50cSToby Isaac     const PetscInt newp   = DMPlexShiftPoint_Internal(splitPoints[0][v], depth, depthShift) /*depthOffset[0] + splitPoints[0][v]*/;
1311cd0c2139SMatthew G Knepley     const PetscInt splitp = pMaxNew[0] + v;
1312cd0c2139SMatthew G Knepley     PetscInt       dof, off, soff, d;
1313cd0c2139SMatthew G Knepley 
1314cd0c2139SMatthew G Knepley     ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr);
1315cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr);
1316cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr);
1317cd0c2139SMatthew G Knepley     for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d];
1318cd0c2139SMatthew G Knepley   }
1319cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
1320cd0c2139SMatthew G Knepley   /* Step 9: SF, if I can figure this out we can split the mesh in parallel */
1321cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
1322cd0c2139SMatthew G Knepley   /* Step 10: Labels */
1323cd0c2139SMatthew G Knepley   ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
1324cd0c2139SMatthew G Knepley   ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr);
1325cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
1326cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
13272582d50cSToby Isaac       const PetscInt newp   = DMPlexShiftPoint_Internal(splitPoints[dep][p], depth, depthShift) /*depthOffset[dep] + splitPoints[dep][p]*/;
1328cd0c2139SMatthew G Knepley       const PetscInt splitp = pMaxNew[dep] + p;
1329cd0c2139SMatthew G Knepley       PetscInt       l;
1330cd0c2139SMatthew G Knepley 
1331cd0c2139SMatthew G Knepley       for (l = 0; l < numLabels; ++l) {
1332cd0c2139SMatthew G Knepley         DMLabel     mlabel;
1333cd0c2139SMatthew G Knepley         const char *lname;
1334cd0c2139SMatthew G Knepley         PetscInt    val;
13359a356370SMatthew G. Knepley         PetscBool   isDepth;
1336cd0c2139SMatthew G Knepley 
1337cd0c2139SMatthew G Knepley         ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr);
13389a356370SMatthew G. Knepley         ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr);
13399a356370SMatthew G. Knepley         if (isDepth) continue;
1340cd0c2139SMatthew G Knepley         ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr);
1341cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr);
1342cd0c2139SMatthew G Knepley         if (val >= 0) {
1343cd0c2139SMatthew G Knepley           ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr);
13449a356370SMatthew G. Knepley #if 0
13459a356370SMatthew G. Knepley           /* Do not put cohesive edges into the label */
1346cd0c2139SMatthew G Knepley           if (dep == 0) {
13474c367dbcSMatthew G. Knepley             const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1348cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr);
13494c367dbcSMatthew G. Knepley           } else if (dep == dim-2) {
13504c367dbcSMatthew G. Knepley             const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
13514c367dbcSMatthew G. Knepley             ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr);
1352cd0c2139SMatthew G Knepley           }
13534c367dbcSMatthew G. Knepley           /* Do not put cohesive faces into the label */
13549a356370SMatthew G. Knepley #endif
1355cd0c2139SMatthew G Knepley         }
1356cd0c2139SMatthew G Knepley       }
1357cd0c2139SMatthew G Knepley     }
1358cd0c2139SMatthew G Knepley   }
1359cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
1360cd0c2139SMatthew G Knepley     const PetscInt dep = values[sp];
1361cd0c2139SMatthew G Knepley 
1362cd0c2139SMatthew G Knepley     if ((dep < 0) || (dep > depth)) continue;
136318c5995bSMatthew G. Knepley     if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);}
136418c5995bSMatthew G. Knepley     ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr);
136518c5995bSMatthew G. Knepley     if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);}
136618c5995bSMatthew G. Knepley     ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr);
1367cd0c2139SMatthew G Knepley   }
1368cd0c2139SMatthew G Knepley   if (label) {
1369cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
1370cd0c2139SMatthew G Knepley     ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
1371cd0c2139SMatthew G Knepley   }
13720d4d4d06SMatthew G. Knepley   for (d = 0; d <= depth; ++d) {
13730d4d4d06SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr);
137436dbac82SMatthew G. Knepley     pMaxNew[d] = pEnd - numHybridPoints[d] - numHybridPointsOld[d];
13750d4d4d06SMatthew G. Knepley   }
13760e49e2e2SMatthew 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);
1377dcbb62e8SMatthew G. Knepley   ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr);
13782582d50cSToby Isaac   ierr = PetscFree5(depthMax, depthEnd, depthShift, pMaxNew, numHybridPointsOld);CHKERRQ(ierr);
137918c5995bSMatthew G. Knepley   ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr);
1380cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1381cd0c2139SMatthew G Knepley }
1382cd0c2139SMatthew G Knepley 
1383cd0c2139SMatthew G Knepley #undef __FUNCT__
1384cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells"
1385cd0c2139SMatthew G Knepley /*@C
1386cd0c2139SMatthew G Knepley   DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface
1387cd0c2139SMatthew G Knepley 
1388cd0c2139SMatthew G Knepley   Collective on dm
1389cd0c2139SMatthew G Knepley 
1390cd0c2139SMatthew G Knepley   Input Parameters:
1391cd0c2139SMatthew G Knepley + dm - The original DM
139253156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated)
1393cd0c2139SMatthew G Knepley 
1394cd0c2139SMatthew G Knepley   Output Parameters:
1395cd0c2139SMatthew G Knepley - dmSplit - The new DM
1396cd0c2139SMatthew G Knepley 
1397cd0c2139SMatthew G Knepley   Level: developer
1398cd0c2139SMatthew G Knepley 
13992be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete()
1400cd0c2139SMatthew G Knepley @*/
1401cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit)
1402cd0c2139SMatthew G Knepley {
1403cd0c2139SMatthew G Knepley   DM             sdm;
1404cd0c2139SMatthew G Knepley   PetscInt       dim;
1405cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
1406cd0c2139SMatthew G Knepley 
1407cd0c2139SMatthew G Knepley   PetscFunctionBegin;
1408cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
140953156dfcSMatthew G. Knepley   PetscValidPointer(dmSplit, 3);
1410cd0c2139SMatthew G Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr);
1411cd0c2139SMatthew G Knepley   ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr);
1412c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
1413c73cfb54SMatthew G. Knepley   ierr = DMSetDimension(sdm, dim);CHKERRQ(ierr);
1414cd0c2139SMatthew G Knepley   switch (dim) {
1415cd0c2139SMatthew G Knepley   case 2:
1416cd0c2139SMatthew G Knepley   case 3:
1417cd0c2139SMatthew G Knepley     ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr);
1418cd0c2139SMatthew G Knepley     break;
1419cd0c2139SMatthew G Knepley   default:
1420cd0c2139SMatthew G Knepley     SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim);
1421cd0c2139SMatthew G Knepley   }
1422cd0c2139SMatthew G Knepley   *dmSplit = sdm;
1423cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1424cd0c2139SMatthew G Knepley }
1425cd0c2139SMatthew G Knepley 
1426cd0c2139SMatthew G Knepley #undef __FUNCT__
14270f66a230SMatthew G. Knepley #define __FUNCT__ "GetSurfaceSide_Static"
14280f66a230SMatthew G. Knepley /* Returns the side of the surface for a given cell with a face on the surface */
14290f66a230SMatthew G. Knepley static PetscErrorCode GetSurfaceSide_Static(DM dm, DM subdm, PetscInt numSubpoints, const PetscInt *subpoints, PetscInt cell, PetscInt face, PetscBool *pos)
14300f66a230SMatthew G. Knepley {
14310f66a230SMatthew G. Knepley   const PetscInt *cone, *ornt;
14320f66a230SMatthew G. Knepley   PetscInt        dim, coneSize, c;
14330f66a230SMatthew G. Knepley   PetscErrorCode  ierr;
14340f66a230SMatthew G. Knepley 
14350f66a230SMatthew G. Knepley   PetscFunctionBegin;
14360f66a230SMatthew G. Knepley   *pos = PETSC_TRUE;
1437c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
14380f66a230SMatthew G. Knepley   ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr);
14390f66a230SMatthew G. Knepley   ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
14400f66a230SMatthew G. Knepley   ierr = DMPlexGetConeOrientation(dm, cell, &ornt);CHKERRQ(ierr);
14410f66a230SMatthew G. Knepley   for (c = 0; c < coneSize; ++c) {
14420f66a230SMatthew G. Knepley     if (cone[c] == face) {
14430f66a230SMatthew G. Knepley       PetscInt o = ornt[c];
14440f66a230SMatthew G. Knepley 
14450f66a230SMatthew G. Knepley       if (subdm) {
14460f66a230SMatthew G. Knepley         const PetscInt *subcone, *subornt;
14470f66a230SMatthew G. Knepley         PetscInt        subpoint, subface, subconeSize, sc;
14480f66a230SMatthew G. Knepley 
14490f66a230SMatthew G. Knepley         ierr = PetscFindInt(cell, numSubpoints, subpoints, &subpoint);CHKERRQ(ierr);
14500f66a230SMatthew G. Knepley         ierr = PetscFindInt(face, numSubpoints, subpoints, &subface);CHKERRQ(ierr);
14510f66a230SMatthew G. Knepley         ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
14520f66a230SMatthew G. Knepley         ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr);
14530f66a230SMatthew G. Knepley         ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr);
14540f66a230SMatthew G. Knepley         for (sc = 0; sc < subconeSize; ++sc) {
14550f66a230SMatthew G. Knepley           if (subcone[sc] == subface) {
14560f66a230SMatthew G. Knepley             o = subornt[0];
14570f66a230SMatthew G. Knepley             break;
14580f66a230SMatthew G. Knepley           }
14590f66a230SMatthew G. Knepley         }
14600f66a230SMatthew 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);
14610f66a230SMatthew G. Knepley       }
14620f66a230SMatthew G. Knepley       if (o >= 0) *pos = PETSC_TRUE;
14630f66a230SMatthew G. Knepley       else        *pos = PETSC_FALSE;
14640f66a230SMatthew G. Knepley       break;
14650f66a230SMatthew G. Knepley     }
14660f66a230SMatthew G. Knepley   }
14670f66a230SMatthew 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);
14680f66a230SMatthew G. Knepley   PetscFunctionReturn(0);
14690f66a230SMatthew G. Knepley }
14700f66a230SMatthew G. Knepley 
14710f66a230SMatthew G. Knepley #undef __FUNCT__
14722be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete"
1473cd0c2139SMatthew G Knepley /*@
14740f66a230SMatthew G. Knepley   DMPlexLabelCohesiveComplete - Starting with a label marking points on an internal surface, we add all other mesh pieces
1475cd0c2139SMatthew G Knepley   to complete the surface
1476cd0c2139SMatthew G Knepley 
1477cd0c2139SMatthew G Knepley   Input Parameters:
1478cd0c2139SMatthew G Knepley + dm     - The DM
14790f66a230SMatthew G. Knepley . label  - A DMLabel marking the surface
14800f66a230SMatthew G. Knepley . blabel - A DMLabel marking the vertices on the boundary which will not be duplicated, or NULL to find them automatically
1481bb55d314SMatthew G. Knepley . flip   - Flag to flip the submesh normal and replace points on the other side
148247946fd8SMatthew G. Knepley - subdm  - The subDM associated with the label, or NULL
1483cd0c2139SMatthew G Knepley 
1484cd0c2139SMatthew G Knepley   Output Parameter:
1485cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points
1486cd0c2139SMatthew G Knepley 
14870f66a230SMatthew G. Knepley   Note: The vertices in blabel are called "unsplit" in the terminology from hybrid cell creation.
14880f66a230SMatthew G. Knepley 
1489cd0c2139SMatthew G Knepley   Level: developer
1490cd0c2139SMatthew G Knepley 
14912be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete()
1492cd0c2139SMatthew G Knepley @*/
14930f66a230SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, DMLabel blabel, PetscBool flip, DM subdm)
1494cd0c2139SMatthew G Knepley {
1495d90583fdSMatthew G. Knepley   DMLabel         depthLabel;
149686200784SMatthew G. Knepley   IS              dimIS, subpointIS, facePosIS, faceNegIS, crossEdgeIS = NULL;
149747946fd8SMatthew G. Knepley   const PetscInt *points, *subpoints;
1498bb55d314SMatthew G. Knepley   const PetscInt  rev   = flip ? -1 : 1;
1499370472baSMatthew G. Knepley   PetscInt       *pMax;
1500370472baSMatthew G. Knepley   PetscInt        shift = 100, shift2 = 200, dim, depth, pSize, dep, cStart, cEnd, cMax, fStart, fEnd, vStart, vEnd, numPoints, numSubpoints, p, val;
1501cd0c2139SMatthew G Knepley   PetscErrorCode  ierr;
1502cd0c2139SMatthew G Knepley 
1503cd0c2139SMatthew G Knepley   PetscFunctionBegin;
1504370472baSMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1505370472baSMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
1506370472baSMatthew G. Knepley   pSize = PetscMax(depth, dim) + 1;
1507370472baSMatthew G. Knepley   ierr = PetscMalloc1(pSize,&pMax);CHKERRQ(ierr);
1508370472baSMatthew 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);
1509d90583fdSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr);
1510c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
151147946fd8SMatthew G. Knepley   if (subdm) {
151247946fd8SMatthew G. Knepley     ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr);
151347946fd8SMatthew G. Knepley     if (subpointIS) {
151447946fd8SMatthew G. Knepley       ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr);
151547946fd8SMatthew G. Knepley       ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr);
151647946fd8SMatthew G. Knepley     }
151747946fd8SMatthew G. Knepley   }
1518d7c8f101SMatthew G. Knepley   /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */
1519cd0c2139SMatthew G Knepley   ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr);
1520dc86033cSMatthew G. Knepley   if (!dimIS) {
1521dc86033cSMatthew G. Knepley     ierr = PetscFree(pMax);CHKERRQ(ierr);
1522dc86033cSMatthew G. Knepley     PetscFunctionReturn(0);
1523dc86033cSMatthew G. Knepley   }
1524cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1525cd0c2139SMatthew G Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1526d7c8f101SMatthew G. Knepley   for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */
1527cd0c2139SMatthew G Knepley     const PetscInt *support;
1528cd0c2139SMatthew G Knepley     PetscInt        supportSize, s;
1529cd0c2139SMatthew G Knepley 
1530cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr);
1531cd0c2139SMatthew G Knepley     if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize);
1532cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr);
1533cd0c2139SMatthew G Knepley     for (s = 0; s < supportSize; ++s) {
15340f66a230SMatthew G. Knepley       const PetscInt *cone;
1535cd0c2139SMatthew G Knepley       PetscInt        coneSize, c;
15360f66a230SMatthew G. Knepley       PetscBool       pos;
1537cd0c2139SMatthew G Knepley 
15380f66a230SMatthew G. Knepley       ierr = GetSurfaceSide_Static(dm, subdm, numSubpoints, subpoints, support[s], points[p], &pos);CHKERRQ(ierr);
15390f66a230SMatthew G. Knepley       if (pos) {ierr = DMLabelSetValue(label, support[s],  rev*(shift+dim));CHKERRQ(ierr);}
15400f66a230SMatthew G. Knepley       else     {ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);}
15410f66a230SMatthew G. Knepley       if (rev < 0) pos = !pos ? PETSC_TRUE : PETSC_FALSE;
15420f66a230SMatthew G. Knepley       /* Put faces touching the fault in the label */
1543cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
1544cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
1545cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
1546cd0c2139SMatthew G Knepley         const PetscInt point = cone[c];
1547cd0c2139SMatthew G Knepley 
1548cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1549cd0c2139SMatthew G Knepley         if (val == -1) {
1550cd0c2139SMatthew G Knepley           PetscInt *closure = NULL;
1551cd0c2139SMatthew G Knepley           PetscInt  closureSize, cl;
1552cd0c2139SMatthew G Knepley 
1553cd0c2139SMatthew G Knepley           ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1554cd0c2139SMatthew G Knepley           for (cl = 0; cl < closureSize*2; cl += 2) {
1555cd0c2139SMatthew G Knepley             const PetscInt clp  = closure[cl];
1556a0541d8aSMatthew G. Knepley             PetscInt       bval = -1;
1557cd0c2139SMatthew G Knepley 
1558cd0c2139SMatthew G Knepley             ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr);
1559a0541d8aSMatthew G. Knepley             if (blabel) {ierr = DMLabelGetValue(blabel, clp, &bval);CHKERRQ(ierr);}
1560a0541d8aSMatthew G. Knepley             if ((val >= 0) && (val < dim-1) && (bval < 0)) {
1561cd0c2139SMatthew G Knepley               ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr);
1562cd0c2139SMatthew G Knepley               break;
1563cd0c2139SMatthew G Knepley             }
1564cd0c2139SMatthew G Knepley           }
1565cd0c2139SMatthew G Knepley           ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1566cd0c2139SMatthew G Knepley         }
1567cd0c2139SMatthew G Knepley       }
1568cd0c2139SMatthew G Knepley     }
1569cd0c2139SMatthew G Knepley   }
15700f66a230SMatthew G. Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
15710f66a230SMatthew G. Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
157247946fd8SMatthew G. Knepley   if (subdm) {
157347946fd8SMatthew G. Knepley     if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);}
157447946fd8SMatthew G. Knepley     ierr = ISDestroy(&subpointIS);CHKERRQ(ierr);
157547946fd8SMatthew G. Knepley   }
1576a0541d8aSMatthew G. Knepley   /* Mark boundary points as unsplit */
157786200784SMatthew G. Knepley   if (blabel) {
1578a0541d8aSMatthew G. Knepley     ierr = DMLabelGetStratumIS(blabel, 1, &dimIS);CHKERRQ(ierr);
1579a0541d8aSMatthew G. Knepley     ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1580a0541d8aSMatthew G. Knepley     ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1581a0541d8aSMatthew G. Knepley     for (p = 0; p < numPoints; ++p) {
1582a0541d8aSMatthew G. Knepley       const PetscInt point = points[p];
1583a0541d8aSMatthew G. Knepley       PetscInt       val, bval;
1584a0541d8aSMatthew G. Knepley 
1585a0541d8aSMatthew G. Knepley       ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr);
1586a0541d8aSMatthew G. Knepley       if (bval >= 0) {
1587f7019248SMatthew G. Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1588f7019248SMatthew G. Knepley         if ((val < 0) || (val > dim)) {
1589f7019248SMatthew G. Knepley           /* This could be a point added from splitting a vertex on an adjacent fault, otherwise its just wrong */
1590f7019248SMatthew G. Knepley           ierr = DMLabelClearValue(blabel, point, bval);CHKERRQ(ierr);
1591f7019248SMatthew G. Knepley         }
1592f7019248SMatthew G. Knepley       }
1593f7019248SMatthew G. Knepley     }
1594f7019248SMatthew G. Knepley     for (p = 0; p < numPoints; ++p) {
1595f7019248SMatthew G. Knepley       const PetscInt point = points[p];
1596f7019248SMatthew G. Knepley       PetscInt       val, bval;
1597f7019248SMatthew G. Knepley 
1598f7019248SMatthew G. Knepley       ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr);
1599f7019248SMatthew G. Knepley       if (bval >= 0) {
160086200784SMatthew G. Knepley         const PetscInt *cone,    *support;
160186200784SMatthew G. Knepley         PetscInt        coneSize, supportSize, s, valA, valB, valE;
160286200784SMatthew G. Knepley 
1603a0541d8aSMatthew G. Knepley         /* Mark as unsplit */
1604a0541d8aSMatthew G. Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1605a0541d8aSMatthew 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);
1606a0541d8aSMatthew G. Knepley         ierr = DMLabelClearValue(label, point, val);CHKERRQ(ierr);
1607a0541d8aSMatthew G. Knepley         ierr = DMLabelSetValue(label, point, shift2+val);CHKERRQ(ierr);
16082c06a818SMatthew G. Knepley         /* Check for cross-edge
16092c06a818SMatthew G. Knepley              A cross-edge has endpoints which are both on the boundary of the surface, but the edge itself is not. */
161086200784SMatthew G. Knepley         if (val != 0) continue;
161186200784SMatthew G. Knepley         ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr);
161286200784SMatthew G. Knepley         ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr);
161386200784SMatthew G. Knepley         for (s = 0; s < supportSize; ++s) {
161486200784SMatthew G. Knepley           ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
161586200784SMatthew G. Knepley           ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
161686200784SMatthew G. Knepley           if (coneSize != 2) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Edge %D has %D vertices != 2", support[s], coneSize);
161786200784SMatthew G. Knepley           ierr = DMLabelGetValue(blabel, cone[0], &valA);CHKERRQ(ierr);
161886200784SMatthew G. Knepley           ierr = DMLabelGetValue(blabel, cone[1], &valB);CHKERRQ(ierr);
161986200784SMatthew G. Knepley           ierr = DMLabelGetValue(blabel, support[s], &valE);CHKERRQ(ierr);
162009816f77SMatthew G. Knepley           if ((valE < 0) && (valA >= 0) && (valB >= 0) && (cone[0] != cone[1])) {ierr = DMLabelSetValue(blabel, support[s], 2);CHKERRQ(ierr);}
162186200784SMatthew G. Knepley         }
1622a0541d8aSMatthew G. Knepley       }
1623a0541d8aSMatthew G. Knepley     }
1624a0541d8aSMatthew G. Knepley     ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
1625a0541d8aSMatthew G. Knepley     ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
1626a0541d8aSMatthew G. Knepley   }
1627cd0c2139SMatthew G Knepley   /* Search for other cells/faces/edges connected to the fault by a vertex */
1628c4d480a2SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
1629cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
1630d24f5ce5SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
1631d24f5ce5SMatthew G. Knepley   cMax = cMax < 0 ? cEnd : cMax;
16320f66a230SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr);
1633cd0c2139SMatthew G Knepley   ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr);
163486200784SMatthew G. Knepley   if (blabel) {ierr = DMLabelGetStratumIS(blabel, 2, &crossEdgeIS);CHKERRQ(ierr);}
163586200784SMatthew G. Knepley   if (dimIS && crossEdgeIS) {
163686200784SMatthew G. Knepley     IS vertIS = dimIS;
163786200784SMatthew G. Knepley 
163886200784SMatthew G. Knepley     ierr = ISExpand(vertIS, crossEdgeIS, &dimIS);CHKERRQ(ierr);
163986200784SMatthew G. Knepley     ierr = ISDestroy(&crossEdgeIS);CHKERRQ(ierr);
164086200784SMatthew G. Knepley     ierr = ISDestroy(&vertIS);CHKERRQ(ierr);
164186200784SMatthew G. Knepley   }
1642dc86033cSMatthew G. Knepley   if (!dimIS) {
1643dc86033cSMatthew G. Knepley     ierr = PetscFree(pMax);CHKERRQ(ierr);
1644dc86033cSMatthew G. Knepley     PetscFunctionReturn(0);
1645dc86033cSMatthew G. Knepley   }
1646cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1647cd0c2139SMatthew G Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1648d7c8f101SMatthew G. Knepley   for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */
1649cd0c2139SMatthew G Knepley     PetscInt *star = NULL;
165086200784SMatthew G. Knepley     PetscInt  starSize, s;
1651cd0c2139SMatthew G Knepley     PetscInt  again = 1;  /* 0: Finished 1: Keep iterating after a change 2: No change */
1652cd0c2139SMatthew G Knepley 
1653d4622b2cSMatthew G. Knepley     /* All points connected to the fault are inside a cell, so at the top level we will only check cells */
1654cd0c2139SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1655cd0c2139SMatthew G Knepley     while (again) {
1656cd0c2139SMatthew G Knepley       if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault");
1657cd0c2139SMatthew G Knepley       again = 0;
1658cd0c2139SMatthew G Knepley       for (s = 0; s < starSize*2; s += 2) {
1659cd0c2139SMatthew G Knepley         const PetscInt  point = star[s];
1660cd0c2139SMatthew G Knepley         const PetscInt *cone;
1661cd0c2139SMatthew G Knepley         PetscInt        coneSize, c;
1662cd0c2139SMatthew G Knepley 
1663d24f5ce5SMatthew G. Knepley         if ((point < cStart) || (point >= cMax)) continue;
1664cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1665cd0c2139SMatthew G Knepley         if (val != -1) continue;
1666d4622b2cSMatthew G. Knepley         again = again == 1 ? 1 : 2;
1667cd0c2139SMatthew G Knepley         ierr  = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
1668cd0c2139SMatthew G Knepley         ierr  = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
1669cd0c2139SMatthew G Knepley         for (c = 0; c < coneSize; ++c) {
1670cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr);
1671cd0c2139SMatthew G Knepley           if (val != -1) {
1672d7c8f101SMatthew G. Knepley             const PetscInt *ccone;
1673166d9d0cSMatthew G. Knepley             PetscInt        cconeSize, cc, side;
1674d7c8f101SMatthew G. Knepley 
1675db8edaafSMatthew 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);
167637a6de01SMatthew G. Knepley             if (val > 0) side =  1;
167737a6de01SMatthew G. Knepley             else         side = -1;
167837a6de01SMatthew G. Knepley             ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr);
1679d7c8f101SMatthew G. Knepley             /* Mark cell faces which touch the fault */
1680d7c8f101SMatthew G. Knepley             ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr);
1681d7c8f101SMatthew G. Knepley             ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr);
1682d7c8f101SMatthew G. Knepley             for (cc = 0; cc < cconeSize; ++cc) {
1683d7c8f101SMatthew G. Knepley               PetscInt *closure = NULL;
1684d7c8f101SMatthew G. Knepley               PetscInt  closureSize, cl;
1685d7c8f101SMatthew G. Knepley 
1686166d9d0cSMatthew G. Knepley               ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr);
1687166d9d0cSMatthew G. Knepley               if (val != -1) continue;
1688d7c8f101SMatthew G. Knepley               ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1689d4622b2cSMatthew G. Knepley               for (cl = 0; cl < closureSize*2; cl += 2) {
1690d7c8f101SMatthew G. Knepley                 const PetscInt clp = closure[cl];
1691d7c8f101SMatthew G. Knepley 
1692d7c8f101SMatthew G. Knepley                 ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr);
1693d7c8f101SMatthew G. Knepley                 if (val == -1) continue;
1694d7c8f101SMatthew G. Knepley                 ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr);
169537a6de01SMatthew G. Knepley                 break;
169637a6de01SMatthew G. Knepley               }
1697d7c8f101SMatthew G. Knepley               ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1698cd0c2139SMatthew G Knepley             }
1699cd0c2139SMatthew G Knepley             again = 1;
1700cd0c2139SMatthew G Knepley             break;
1701cd0c2139SMatthew G Knepley           }
1702cd0c2139SMatthew G Knepley         }
1703cd0c2139SMatthew G Knepley       }
1704cd0c2139SMatthew G Knepley     }
1705cd0c2139SMatthew G Knepley     /* Classify the rest by cell membership */
1706cd0c2139SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1707cd0c2139SMatthew G Knepley       const PetscInt point = star[s];
1708cd0c2139SMatthew G Knepley 
1709cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1710cd0c2139SMatthew G Knepley       if (val == -1) {
1711cd0c2139SMatthew G Knepley         PetscInt  *sstar = NULL;
1712cd0c2139SMatthew G Knepley         PetscInt   sstarSize, ss;
1713cd0c2139SMatthew G Knepley         PetscBool  marked = PETSC_FALSE;
1714cd0c2139SMatthew G Knepley 
1715cd0c2139SMatthew G Knepley         ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr);
1716cd0c2139SMatthew G Knepley         for (ss = 0; ss < sstarSize*2; ss += 2) {
1717cd0c2139SMatthew G Knepley           const PetscInt spoint = sstar[ss];
1718cd0c2139SMatthew G Knepley 
1719d24f5ce5SMatthew G. Knepley           if ((spoint < cStart) || (spoint >= cMax)) continue;
1720cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr);
1721cd0c2139SMatthew 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);
1722d90583fdSMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr);
1723cd0c2139SMatthew G Knepley           if (val > 0) {
1724cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, point,   shift+dep);CHKERRQ(ierr);
1725cd0c2139SMatthew G Knepley           } else {
1726cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr);
1727cd0c2139SMatthew G Knepley           }
1728cd0c2139SMatthew G Knepley           marked = PETSC_TRUE;
1729cd0c2139SMatthew G Knepley           break;
1730cd0c2139SMatthew G Knepley         }
1731cd0c2139SMatthew G Knepley         ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr);
1732370472baSMatthew G. Knepley         ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr);
1733370472baSMatthew G. Knepley         if (point < pMax[dep] && !marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point);
1734cd0c2139SMatthew G Knepley       }
1735cd0c2139SMatthew G Knepley     }
1736cd0c2139SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1737cd0c2139SMatthew G Knepley   }
1738cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
1739cd0c2139SMatthew G Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
174018c5995bSMatthew G. Knepley   /* If any faces touching the fault divide cells on either side, split them */
174118c5995bSMatthew G. Knepley   ierr = DMLabelGetStratumIS(label,   shift+dim-1,  &facePosIS);CHKERRQ(ierr);
174218c5995bSMatthew G. Knepley   ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr);
174318c5995bSMatthew G. Knepley   ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr);
174418c5995bSMatthew G. Knepley   ierr = ISDestroy(&facePosIS);CHKERRQ(ierr);
174518c5995bSMatthew G. Knepley   ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr);
174618c5995bSMatthew G. Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
174718c5995bSMatthew G. Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
174818c5995bSMatthew G. Knepley   for (p = 0; p < numPoints; ++p) {
174918c5995bSMatthew G. Knepley     const PetscInt  point = points[p];
175018c5995bSMatthew G. Knepley     const PetscInt *support;
175118c5995bSMatthew G. Knepley     PetscInt        supportSize, valA, valB;
175218c5995bSMatthew G. Knepley 
175318c5995bSMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr);
175418c5995bSMatthew G. Knepley     if (supportSize != 2) continue;
175518c5995bSMatthew G. Knepley     ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr);
175618c5995bSMatthew G. Knepley     ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr);
175718c5995bSMatthew G. Knepley     ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr);
175818c5995bSMatthew G. Knepley     if ((valA == -1) || (valB == -1)) continue;
175918c5995bSMatthew G. Knepley     if (valA*valB > 0) continue;
176018c5995bSMatthew G. Knepley     /* Split the face */
176118c5995bSMatthew G. Knepley     ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr);
176218c5995bSMatthew G. Knepley     ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr);
176318c5995bSMatthew G. Knepley     ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr);
1764e1757548SMatthew G. Knepley     /* Label its closure:
1765e1757548SMatthew G. Knepley       unmarked: label as unsplit
1766e1757548SMatthew G. Knepley       incident: relabel as split
1767e1757548SMatthew G. Knepley       split:    do nothing
1768e1757548SMatthew G. Knepley     */
176918c5995bSMatthew G. Knepley     {
177018c5995bSMatthew G. Knepley       PetscInt *closure = NULL;
177118c5995bSMatthew G. Knepley       PetscInt  closureSize, cl;
177218c5995bSMatthew G. Knepley 
177318c5995bSMatthew G. Knepley       ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
177418c5995bSMatthew G. Knepley       for (cl = 0; cl < closureSize*2; cl += 2) {
177518c5995bSMatthew G. Knepley         ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr);
17768771c1d3SMatthew G. Knepley         if (valA == -1) { /* Mark as unsplit */
177718c5995bSMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr);
177818c5995bSMatthew G. Knepley           ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr);
17798771c1d3SMatthew G. Knepley         } else if (((valA >= shift) && (valA < shift2)) || ((valA <= -shift) && (valA > -shift2))) {
1780e1757548SMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr);
1781e1757548SMatthew G. Knepley           ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr);
1782e1757548SMatthew G. Knepley           ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr);
1783e1757548SMatthew G. Knepley         }
178418c5995bSMatthew G. Knepley       }
178518c5995bSMatthew G. Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
178618c5995bSMatthew G. Knepley     }
178718c5995bSMatthew G. Knepley   }
178818c5995bSMatthew G. Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
178918c5995bSMatthew G. Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
1790370472baSMatthew G. Knepley   ierr = PetscFree(pMax);CHKERRQ(ierr);
1791cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1792cd0c2139SMatthew G Knepley }
1793cd0c2139SMatthew G Knepley 
1794cd0c2139SMatthew G Knepley #undef __FUNCT__
17953cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh"
17963cf72582SMatthew G. Knepley /*@C
17973cf72582SMatthew G. Knepley   DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface
17983cf72582SMatthew G. Knepley 
17993cf72582SMatthew G. Knepley   Collective on dm
18003cf72582SMatthew G. Knepley 
18013cf72582SMatthew G. Knepley   Input Parameters:
18023cf72582SMatthew G. Knepley + dm - The original DM
18033cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices
18043cf72582SMatthew G. Knepley 
18053cf72582SMatthew G. Knepley   Output Parameters:
18063cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface
18073cf72582SMatthew G. Knepley - dmHybrid - The new DM
18083cf72582SMatthew G. Knepley 
18093cf72582SMatthew G. Knepley   Level: developer
18103cf72582SMatthew G. Knepley 
18113cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate()
18123cf72582SMatthew G. Knepley @*/
18133cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid)
18143cf72582SMatthew G. Knepley {
18153cf72582SMatthew G. Knepley   DM             idm;
18163cf72582SMatthew G. Knepley   DMLabel        subpointMap, hlabel;
18173cf72582SMatthew G. Knepley   PetscInt       dim;
18183cf72582SMatthew G. Knepley   PetscErrorCode ierr;
18193cf72582SMatthew G. Knepley 
18203cf72582SMatthew G. Knepley   PetscFunctionBegin;
18213cf72582SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
18223cf72582SMatthew G. Knepley   if (hybridLabel) PetscValidPointer(hybridLabel, 3);
18233cf72582SMatthew G. Knepley   PetscValidPointer(dmHybrid, 4);
1824c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
18253cf72582SMatthew G. Knepley   ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr);
18263cf72582SMatthew G. Knepley   ierr = DMPlexOrient(idm);CHKERRQ(ierr);
18273cf72582SMatthew G. Knepley   ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr);
18283cf72582SMatthew G. Knepley   ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr);
18293cf72582SMatthew G. Knepley   ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr);
18300f66a230SMatthew G. Knepley   ierr = DMPlexLabelCohesiveComplete(dm, hlabel, NULL, PETSC_FALSE, idm);CHKERRQ(ierr);
18313cf72582SMatthew G. Knepley   ierr = DMDestroy(&idm);CHKERRQ(ierr);
18323cf72582SMatthew G. Knepley   ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr);
18333cf72582SMatthew G. Knepley   if (hybridLabel) *hybridLabel = hlabel;
183453aa2e23SMatthew G. Knepley   else             {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);}
1835e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
1836e6ccafaeSMatthew G Knepley }
1837e6ccafaeSMatthew G Knepley 
1838e6ccafaeSMatthew G Knepley #undef __FUNCT__
1839efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated"
1840efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that:
1841efa14ee0SMatthew G Knepley 
1842efa14ee0SMatthew G Knepley      For any marked cell, the marked vertices constitute a single face
1843efa14ee0SMatthew G Knepley */
1844830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm)
1845efa14ee0SMatthew G Knepley {
1846fed694aaSMatthew G. Knepley   IS               subvertexIS = NULL;
1847efa14ee0SMatthew G Knepley   const PetscInt  *subvertices;
184877d178adSMatthew G. Knepley   PetscInt        *pStart, *pEnd, *pMax, pSize;
1849efa14ee0SMatthew G Knepley   PetscInt         depth, dim, d, numSubVerticesInitial = 0, v;
1850efa14ee0SMatthew G Knepley   PetscErrorCode   ierr;
1851efa14ee0SMatthew G Knepley 
1852efa14ee0SMatthew G Knepley   PetscFunctionBegin;
1853efa14ee0SMatthew G Knepley   *numFaces = 0;
1854efa14ee0SMatthew G Knepley   *nFV      = 0;
1855efa14ee0SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1856c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
185777d178adSMatthew G. Knepley   pSize = PetscMax(depth, dim) + 1;
1858dcca6d9dSJed Brown   ierr = PetscMalloc3(pSize,&pStart,pSize,&pEnd,pSize,&pMax);CHKERRQ(ierr);
1859d92e47f8SMatthew 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);
1860efa14ee0SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
1861efa14ee0SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1862efa14ee0SMatthew G Knepley     if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]);
1863efa14ee0SMatthew G Knepley   }
1864efa14ee0SMatthew G Knepley   /* Loop over initial vertices and mark all faces in the collective star() */
1865fed694aaSMatthew G. Knepley   if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);}
1866efa14ee0SMatthew G Knepley   if (subvertexIS) {
1867efa14ee0SMatthew G Knepley     ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr);
1868efa14ee0SMatthew G Knepley     ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1869efa14ee0SMatthew G Knepley   }
1870efa14ee0SMatthew G Knepley   for (v = 0; v < numSubVerticesInitial; ++v) {
1871efa14ee0SMatthew G Knepley     const PetscInt vertex = subvertices[v];
18720298fd71SBarry Smith     PetscInt      *star   = NULL;
1873efa14ee0SMatthew G Knepley     PetscInt       starSize, s, numCells = 0, c;
1874efa14ee0SMatthew G Knepley 
1875efa14ee0SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1876efa14ee0SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1877efa14ee0SMatthew G Knepley       const PetscInt point = star[s];
1878efa14ee0SMatthew G Knepley       if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point;
1879efa14ee0SMatthew G Knepley     }
1880efa14ee0SMatthew G Knepley     for (c = 0; c < numCells; ++c) {
1881efa14ee0SMatthew G Knepley       const PetscInt cell    = star[c];
18820298fd71SBarry Smith       PetscInt      *closure = NULL;
1883efa14ee0SMatthew G Knepley       PetscInt       closureSize, cl;
1884efa14ee0SMatthew G Knepley       PetscInt       cellLoc, numCorners = 0, faceSize = 0;
1885efa14ee0SMatthew G Knepley 
1886efa14ee0SMatthew G Knepley       ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr);
188765560c7fSMatthew G Knepley       if (cellLoc == 2) continue;
188882f516ccSBarry Smith       if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc);
1889efa14ee0SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1890efa14ee0SMatthew G Knepley       for (cl = 0; cl < closureSize*2; cl += 2) {
1891efa14ee0SMatthew G Knepley         const PetscInt point = closure[cl];
1892efa14ee0SMatthew G Knepley         PetscInt       vertexLoc;
1893efa14ee0SMatthew G Knepley 
1894efa14ee0SMatthew G Knepley         if ((point >= pStart[0]) && (point < pEnd[0])) {
1895efa14ee0SMatthew G Knepley           ++numCorners;
1896efa14ee0SMatthew G Knepley           ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr);
1897830e53efSMatthew G. Knepley           if (vertexLoc == value) closure[faceSize++] = point;
1898efa14ee0SMatthew G Knepley         }
1899efa14ee0SMatthew G Knepley       }
190018ad9376SMatthew G. Knepley       if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);}
190182f516ccSBarry 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);
1902efa14ee0SMatthew G Knepley       if (faceSize == *nFV) {
1903007baee2SMatthew G. Knepley         const PetscInt *cells = NULL;
1904007baee2SMatthew G. Knepley         PetscInt        numCells, nc;
1905007baee2SMatthew G. Knepley 
1906efa14ee0SMatthew G Knepley         ++(*numFaces);
1907efa14ee0SMatthew G Knepley         for (cl = 0; cl < faceSize; ++cl) {
1908efa14ee0SMatthew G Knepley           ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr);
1909efa14ee0SMatthew G Knepley         }
1910007baee2SMatthew G. Knepley         ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr);
1911007baee2SMatthew G. Knepley         for (nc = 0; nc < numCells; ++nc) {
1912007baee2SMatthew G. Knepley           ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr);
1913007baee2SMatthew G. Knepley         }
1914007baee2SMatthew G. Knepley         ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr);
1915efa14ee0SMatthew G Knepley       }
1916efa14ee0SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1917efa14ee0SMatthew G Knepley     }
1918efa14ee0SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1919efa14ee0SMatthew G Knepley   }
1920efa14ee0SMatthew G Knepley   if (subvertexIS) {
1921efa14ee0SMatthew G Knepley     ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1922efa14ee0SMatthew G Knepley   }
1923efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
1924efa14ee0SMatthew G Knepley   ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr);
1925efa14ee0SMatthew G Knepley   PetscFunctionReturn(0);
1926efa14ee0SMatthew G Knepley }
1927efa14ee0SMatthew G Knepley 
1928efa14ee0SMatthew G Knepley #undef __FUNCT__
1929efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated"
1930830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm)
1931efa14ee0SMatthew G Knepley {
193234b4c39eSMatthew G. Knepley   IS               subvertexIS = NULL;
1933efa14ee0SMatthew G Knepley   const PetscInt  *subvertices;
1934efa14ee0SMatthew G Knepley   PetscInt        *pStart, *pEnd, *pMax;
1935efa14ee0SMatthew G Knepley   PetscInt         dim, d, numSubVerticesInitial = 0, v;
1936efa14ee0SMatthew G Knepley   PetscErrorCode   ierr;
1937efa14ee0SMatthew G Knepley 
1938efa14ee0SMatthew G Knepley   PetscFunctionBegin;
1939c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
1940dcca6d9dSJed Brown   ierr = PetscMalloc3(dim+1,&pStart,dim+1,&pEnd,dim+1,&pMax);CHKERRQ(ierr);
19410298fd71SBarry Smith   ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr);
1942efa14ee0SMatthew G Knepley   for (d = 0; d <= dim; ++d) {
1943efa14ee0SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1944efa14ee0SMatthew G Knepley     if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]);
1945efa14ee0SMatthew G Knepley   }
1946efa14ee0SMatthew G Knepley   /* Loop over initial vertices and mark all faces in the collective star() */
194734b4c39eSMatthew G. Knepley   if (vertexLabel) {
1948830e53efSMatthew G. Knepley     ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);
1949efa14ee0SMatthew G Knepley     if (subvertexIS) {
1950efa14ee0SMatthew G Knepley       ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr);
1951efa14ee0SMatthew G Knepley       ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1952efa14ee0SMatthew G Knepley     }
195334b4c39eSMatthew G. Knepley   }
1954efa14ee0SMatthew G Knepley   for (v = 0; v < numSubVerticesInitial; ++v) {
1955efa14ee0SMatthew G Knepley     const PetscInt vertex = subvertices[v];
19560298fd71SBarry Smith     PetscInt      *star   = NULL;
1957efa14ee0SMatthew G Knepley     PetscInt       starSize, s, numFaces = 0, f;
1958efa14ee0SMatthew G Knepley 
1959efa14ee0SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1960efa14ee0SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1961efa14ee0SMatthew G Knepley       const PetscInt point = star[s];
1962efa14ee0SMatthew G Knepley       if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point;
1963efa14ee0SMatthew G Knepley     }
1964efa14ee0SMatthew G Knepley     for (f = 0; f < numFaces; ++f) {
1965efa14ee0SMatthew G Knepley       const PetscInt face    = star[f];
19660298fd71SBarry Smith       PetscInt      *closure = NULL;
1967efa14ee0SMatthew G Knepley       PetscInt       closureSize, c;
1968efa14ee0SMatthew G Knepley       PetscInt       faceLoc;
1969efa14ee0SMatthew G Knepley 
1970efa14ee0SMatthew G Knepley       ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr);
1971efa14ee0SMatthew G Knepley       if (faceLoc == dim-1) continue;
197282f516ccSBarry Smith       if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc);
1973efa14ee0SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1974efa14ee0SMatthew G Knepley       for (c = 0; c < closureSize*2; c += 2) {
1975efa14ee0SMatthew G Knepley         const PetscInt point = closure[c];
1976efa14ee0SMatthew G Knepley         PetscInt       vertexLoc;
1977efa14ee0SMatthew G Knepley 
1978efa14ee0SMatthew G Knepley         if ((point >= pStart[0]) && (point < pEnd[0])) {
1979efa14ee0SMatthew G Knepley           ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr);
1980830e53efSMatthew G. Knepley           if (vertexLoc != value) break;
1981efa14ee0SMatthew G Knepley         }
1982efa14ee0SMatthew G Knepley       }
1983efa14ee0SMatthew G Knepley       if (c == closureSize*2) {
1984efa14ee0SMatthew G Knepley         const PetscInt *support;
1985efa14ee0SMatthew G Knepley         PetscInt        supportSize, s;
1986efa14ee0SMatthew G Knepley 
1987efa14ee0SMatthew G Knepley         for (c = 0; c < closureSize*2; c += 2) {
1988efa14ee0SMatthew G Knepley           const PetscInt point = closure[c];
1989efa14ee0SMatthew G Knepley 
1990efa14ee0SMatthew G Knepley           for (d = 0; d < dim; ++d) {
1991efa14ee0SMatthew G Knepley             if ((point >= pStart[d]) && (point < pEnd[d])) {
1992efa14ee0SMatthew G Knepley               ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr);
1993efa14ee0SMatthew G Knepley               break;
1994efa14ee0SMatthew G Knepley             }
1995efa14ee0SMatthew G Knepley           }
1996efa14ee0SMatthew G Knepley         }
1997efa14ee0SMatthew G Knepley         ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr);
1998efa14ee0SMatthew G Knepley         ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr);
1999efa14ee0SMatthew G Knepley         for (s = 0; s < supportSize; ++s) {
2000efa14ee0SMatthew G Knepley           ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr);
2001efa14ee0SMatthew G Knepley         }
2002efa14ee0SMatthew G Knepley       }
2003efa14ee0SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2004efa14ee0SMatthew G Knepley     }
2005efa14ee0SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
2006efa14ee0SMatthew G Knepley   }
200734b4c39eSMatthew G. Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);}
2008efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
2009efa14ee0SMatthew G Knepley   ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr);
2010efa14ee0SMatthew G Knepley   PetscFunctionReturn(0);
2011efa14ee0SMatthew G Knepley }
2012efa14ee0SMatthew G Knepley 
2013efa14ee0SMatthew G Knepley #undef __FUNCT__
2014766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated"
201527c04023SMatthew 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)
2016766ab985SMatthew G. Knepley {
201727c04023SMatthew G. Knepley   DMLabel         label = NULL;
2018766ab985SMatthew G. Knepley   const PetscInt *cone;
201927234c99SMatthew G. Knepley   PetscInt        dim, cMax, cEnd, c, subc = 0, p, coneSize;
2020766ab985SMatthew G. Knepley   PetscErrorCode  ierr;
2021766ab985SMatthew G. Knepley 
2022812bfc34SJed Brown   PetscFunctionBegin;
2023c0ed958bSJed Brown   *numFaces = 0;
2024c0ed958bSJed Brown   *nFV = 0;
2025b6d5cb33SJed Brown   if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);}
2026fed694aaSMatthew G. Knepley   *subCells = NULL;
2027c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
2028766ab985SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
2029766ab985SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
2030766ab985SMatthew G. Knepley   if (cMax < 0) PetscFunctionReturn(0);
203127c04023SMatthew G. Knepley   if (label) {
203227c04023SMatthew G. Knepley     for (c = cMax; c < cEnd; ++c) {
203327c04023SMatthew G. Knepley       PetscInt val;
203427c04023SMatthew G. Knepley 
203527c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
203627c04023SMatthew G. Knepley       if (val == value) {
203727c04023SMatthew G. Knepley         ++(*numFaces);
203827c04023SMatthew G. Knepley         ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
203927c04023SMatthew G. Knepley       }
204027c04023SMatthew G. Knepley     }
204127c04023SMatthew G. Knepley   } else {
2042766ab985SMatthew G. Knepley     *numFaces = cEnd - cMax;
204327c04023SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr);
204427c04023SMatthew G. Knepley   }
2045766ab985SMatthew G. Knepley   *nFV = hasLagrange ? coneSize/3 : coneSize/2;
2046785e854fSJed Brown   ierr = PetscMalloc1(*numFaces *2, subCells);CHKERRQ(ierr);
2047766ab985SMatthew G. Knepley   for (c = cMax; c < cEnd; ++c) {
2048766ab985SMatthew G. Knepley     const PetscInt *cells;
2049766ab985SMatthew G. Knepley     PetscInt        numCells;
2050766ab985SMatthew G. Knepley 
205127c04023SMatthew G. Knepley     if (label) {
205227c04023SMatthew G. Knepley       PetscInt val;
205327c04023SMatthew G. Knepley 
205427c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
205527c04023SMatthew G. Knepley       if (val != value) continue;
205627c04023SMatthew G. Knepley     }
2057766ab985SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
2058766ab985SMatthew G. Knepley     for (p = 0; p < *nFV; ++p) {
2059766ab985SMatthew G. Knepley       ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr);
2060766ab985SMatthew G. Knepley     }
2061766ab985SMatthew G. Knepley     /* Negative face */
2062766ab985SMatthew G. Knepley     ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr);
206327234c99SMatthew G. Knepley     /* Not true in parallel
206427234c99SMatthew G. Knepley     if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */
2065766ab985SMatthew G. Knepley     for (p = 0; p < numCells; ++p) {
2066766ab985SMatthew G. Knepley       ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr);
206727234c99SMatthew G. Knepley       (*subCells)[subc++] = cells[p];
2068766ab985SMatthew G. Knepley     }
2069766ab985SMatthew G. Knepley     ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr);
2070766ab985SMatthew G. Knepley     /* Positive face is not included */
2071766ab985SMatthew G. Knepley   }
2072766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
2073766ab985SMatthew G. Knepley }
2074766ab985SMatthew G. Knepley 
2075766ab985SMatthew G. Knepley #undef __FUNCT__
2076766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated"
20773982b651SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, DMLabel label, PetscInt value, DMLabel subpointMap, DM subdm)
2078766ab985SMatthew G. Knepley {
2079766ab985SMatthew G. Knepley   PetscInt      *pStart, *pEnd;
2080766ab985SMatthew G. Knepley   PetscInt       dim, cMax, cEnd, c, d;
2081766ab985SMatthew G. Knepley   PetscErrorCode ierr;
2082766ab985SMatthew G. Knepley 
2083812bfc34SJed Brown   PetscFunctionBegin;
2084c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
2085766ab985SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
2086766ab985SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
2087766ab985SMatthew G. Knepley   if (cMax < 0) PetscFunctionReturn(0);
2088dcca6d9dSJed Brown   ierr = PetscMalloc2(dim+1,&pStart,dim+1,&pEnd);CHKERRQ(ierr);
2089b3154360SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);}
2090766ab985SMatthew G. Knepley   for (c = cMax; c < cEnd; ++c) {
2091766ab985SMatthew G. Knepley     const PetscInt *cone;
2092766ab985SMatthew G. Knepley     PetscInt       *closure = NULL;
2093b3154360SMatthew G. Knepley     PetscInt        fconeSize, coneSize, closureSize, cl, val;
2094766ab985SMatthew G. Knepley 
209527c04023SMatthew G. Knepley     if (label) {
209627c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
209727c04023SMatthew G. Knepley       if (val != value) continue;
209827c04023SMatthew G. Knepley     }
2099766ab985SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
2100766ab985SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
2101b3154360SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr);
2102b3154360SMatthew G. Knepley     if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells");
2103b3154360SMatthew G. Knepley     /* Negative face */
2104766ab985SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2105766ab985SMatthew G. Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
2106766ab985SMatthew G. Knepley       const PetscInt point = closure[cl];
2107766ab985SMatthew G. Knepley 
2108766ab985SMatthew G. Knepley       for (d = 0; d <= dim; ++d) {
2109766ab985SMatthew G. Knepley         if ((point >= pStart[d]) && (point < pEnd[d])) {
2110766ab985SMatthew G. Knepley           ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr);
2111766ab985SMatthew G. Knepley           break;
2112766ab985SMatthew G. Knepley         }
2113766ab985SMatthew G. Knepley       }
2114766ab985SMatthew G. Knepley     }
2115766ab985SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2116766ab985SMatthew G. Knepley     /* Cells -- positive face is not included */
2117766ab985SMatthew G. Knepley     for (cl = 0; cl < 1; ++cl) {
2118766ab985SMatthew G. Knepley       const PetscInt *support;
2119766ab985SMatthew G. Knepley       PetscInt        supportSize, s;
2120766ab985SMatthew G. Knepley 
2121766ab985SMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr);
2122711de394SMatthew G. Knepley       /* if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); */
2123766ab985SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr);
2124766ab985SMatthew G. Knepley       for (s = 0; s < supportSize; ++s) {
2125766ab985SMatthew G. Knepley         ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr);
2126766ab985SMatthew G. Knepley       }
2127766ab985SMatthew G. Knepley     }
2128766ab985SMatthew G. Knepley   }
2129766ab985SMatthew G. Knepley   ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr);
2130766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
2131766ab985SMatthew G. Knepley }
2132766ab985SMatthew G. Knepley 
2133766ab985SMatthew G. Knepley #undef __FUNCT__
2134e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation"
2135e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented)
2136e6ccafaeSMatthew G Knepley {
213782f516ccSBarry Smith   MPI_Comm       comm;
2138e6ccafaeSMatthew G Knepley   PetscBool      posOrient = PETSC_FALSE;
2139e6ccafaeSMatthew G Knepley   const PetscInt debug     = 0;
2140e6ccafaeSMatthew G Knepley   PetscInt       cellDim, faceSize, f;
2141e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
2142e6ccafaeSMatthew G Knepley 
214382f516ccSBarry Smith   PetscFunctionBegin;
214482f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2145c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &cellDim);CHKERRQ(ierr);
2146e6ccafaeSMatthew G Knepley   if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);}
2147e6ccafaeSMatthew G Knepley 
2148ddeab2a6SMatthew G. Knepley   if (cellDim == 1 && numCorners == 2) {
2149ddeab2a6SMatthew G. Knepley     /* Triangle */
2150e6ccafaeSMatthew G Knepley     faceSize  = numCorners-1;
2151e6ccafaeSMatthew G Knepley     posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
2152ddeab2a6SMatthew G. Knepley   } else if (cellDim == 2 && numCorners == 3) {
2153ddeab2a6SMatthew G. Knepley     /* Triangle */
2154ddeab2a6SMatthew G. Knepley     faceSize  = numCorners-1;
2155ddeab2a6SMatthew G. Knepley     posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
2156ddeab2a6SMatthew G. Knepley   } else if (cellDim == 3 && numCorners == 4) {
2157ddeab2a6SMatthew G. Knepley     /* Tetrahedron */
2158ddeab2a6SMatthew G. Knepley     faceSize  = numCorners-1;
2159ddeab2a6SMatthew G. Knepley     posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
2160e6ccafaeSMatthew G Knepley   } else if (cellDim == 1 && numCorners == 3) {
2161e6ccafaeSMatthew G Knepley     /* Quadratic line */
2162e6ccafaeSMatthew G Knepley     faceSize  = 1;
2163e6ccafaeSMatthew G Knepley     posOrient = PETSC_TRUE;
2164e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 4) {
2165e6ccafaeSMatthew G Knepley     /* Quads */
2166e6ccafaeSMatthew G Knepley     faceSize = 2;
2167e6ccafaeSMatthew G Knepley     if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) {
2168e6ccafaeSMatthew G Knepley       posOrient = PETSC_TRUE;
2169e6ccafaeSMatthew G Knepley     } else if ((indices[0] == 3) && (indices[1] == 0)) {
2170e6ccafaeSMatthew G Knepley       posOrient = PETSC_TRUE;
2171e6ccafaeSMatthew G Knepley     } else {
2172e6ccafaeSMatthew G Knepley       if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) {
2173e6ccafaeSMatthew G Knepley         posOrient = PETSC_FALSE;
2174e6ccafaeSMatthew G Knepley       } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge");
2175e6ccafaeSMatthew G Knepley     }
2176e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 6) {
2177e6ccafaeSMatthew G Knepley     /* Quadratic triangle (I hate this) */
2178e6ccafaeSMatthew G Knepley     /* Edges are determined by the first 2 vertices (corners of edges) */
2179e6ccafaeSMatthew G Knepley     const PetscInt faceSizeTri = 3;
2180e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[3], i, iFace;
2181e6ccafaeSMatthew G Knepley     PetscBool      found                    = PETSC_FALSE;
2182e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTriSorted[9] = {
2183e6ccafaeSMatthew G Knepley       0, 3,  4, /* bottom */
2184e6ccafaeSMatthew G Knepley       1, 4,  5, /* right */
2185e6ccafaeSMatthew G Knepley       2, 3,  5, /* left */
2186e6ccafaeSMatthew G Knepley     };
2187e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTri[9] = {
2188e6ccafaeSMatthew G Knepley       0, 3,  4, /* bottom */
2189e6ccafaeSMatthew G Knepley       1, 4,  5, /* right */
2190e6ccafaeSMatthew G Knepley       2, 5,  3, /* left */
2191e6ccafaeSMatthew G Knepley     };
2192e6ccafaeSMatthew G Knepley 
2193e6ccafaeSMatthew G Knepley     faceSize = faceSizeTri;
2194e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i];
2195e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr);
2196e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 3; ++iFace) {
2197e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeTri;
2198e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2199e6ccafaeSMatthew G Knepley 
2200e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) &&
2201e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesTriSorted[ii+1])) {
2202e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) {
2203e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) {
2204e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesTri[ii+fVertex]) {
2205e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2206e6ccafaeSMatthew G Knepley               break;
2207e6ccafaeSMatthew G Knepley             }
2208e6ccafaeSMatthew G Knepley           }
2209e6ccafaeSMatthew G Knepley         }
2210e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2211e6ccafaeSMatthew G Knepley         break;
2212e6ccafaeSMatthew G Knepley       }
2213e6ccafaeSMatthew G Knepley     }
2214e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface");
2215e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2216e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2217e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 9) {
2218e6ccafaeSMatthew G Knepley     /* Quadratic quad (I hate this) */
2219e6ccafaeSMatthew G Knepley     /* Edges are determined by the first 2 vertices (corners of edges) */
2220e6ccafaeSMatthew G Knepley     const PetscInt faceSizeQuad = 3;
2221e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[3], i, iFace;
2222e6ccafaeSMatthew G Knepley     PetscBool      found                      = PETSC_FALSE;
2223e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadSorted[12] = {
2224e6ccafaeSMatthew G Knepley       0, 1,  4, /* bottom */
2225e6ccafaeSMatthew G Knepley       1, 2,  5, /* right */
2226e6ccafaeSMatthew G Knepley       2, 3,  6, /* top */
2227e6ccafaeSMatthew G Knepley       0, 3,  7, /* left */
2228e6ccafaeSMatthew G Knepley     };
2229e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuad[12] = {
2230e6ccafaeSMatthew G Knepley       0, 1,  4, /* bottom */
2231e6ccafaeSMatthew G Knepley       1, 2,  5, /* right */
2232e6ccafaeSMatthew G Knepley       2, 3,  6, /* top */
2233e6ccafaeSMatthew G Knepley       3, 0,  7, /* left */
2234e6ccafaeSMatthew G Knepley     };
2235e6ccafaeSMatthew G Knepley 
2236e6ccafaeSMatthew G Knepley     faceSize = faceSizeQuad;
2237e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i];
2238e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr);
2239e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 4; ++iFace) {
2240e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeQuad;
2241e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2242e6ccafaeSMatthew G Knepley 
2243e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) &&
2244e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) {
2245e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) {
2246e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) {
2247e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) {
2248e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2249e6ccafaeSMatthew G Knepley               break;
2250e6ccafaeSMatthew G Knepley             }
2251e6ccafaeSMatthew G Knepley           }
2252e6ccafaeSMatthew G Knepley         }
2253e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2254e6ccafaeSMatthew G Knepley         break;
2255e6ccafaeSMatthew G Knepley       }
2256e6ccafaeSMatthew G Knepley     }
2257e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface");
2258e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2259e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2260e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 8) {
2261e6ccafaeSMatthew G Knepley     /* Hexes
2262e6ccafaeSMatthew G Knepley        A hex is two oriented quads with the normal of the first
2263e6ccafaeSMatthew G Knepley        pointing up at the second.
2264e6ccafaeSMatthew G Knepley 
2265e6ccafaeSMatthew G Knepley           7---6
2266e6ccafaeSMatthew G Knepley          /|  /|
2267e6ccafaeSMatthew G Knepley         4---5 |
2268ddeab2a6SMatthew G. Knepley         | 1-|-2
2269e6ccafaeSMatthew G Knepley         |/  |/
2270ddeab2a6SMatthew G. Knepley         0---3
2271e6ccafaeSMatthew G Knepley 
2272e6ccafaeSMatthew G Knepley         Faces are determined by the first 4 vertices (corners of faces) */
2273e6ccafaeSMatthew G Knepley     const PetscInt faceSizeHex = 4;
2274e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[4], i, iFace;
2275e6ccafaeSMatthew G Knepley     PetscBool      found                     = PETSC_FALSE;
2276e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesHexSorted[24] = {
2277e6ccafaeSMatthew G Knepley       0, 1, 2, 3,  /* bottom */
2278e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  /* top */
2279ddeab2a6SMatthew G. Knepley       0, 3, 4, 5,  /* front */
2280ddeab2a6SMatthew G. Knepley       2, 3, 5, 6,  /* right */
2281ddeab2a6SMatthew G. Knepley       1, 2, 6, 7,  /* back */
2282ddeab2a6SMatthew G. Knepley       0, 1, 4, 7,  /* left */
2283e6ccafaeSMatthew G Knepley     };
2284e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesHex[24] = {
2285ddeab2a6SMatthew G. Knepley       1, 2, 3, 0,  /* bottom */
2286e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  /* top */
2287ddeab2a6SMatthew G. Knepley       0, 3, 5, 4,  /* front */
2288ddeab2a6SMatthew G. Knepley       3, 2, 6, 5,  /* right */
2289ddeab2a6SMatthew G. Knepley       2, 1, 7, 6,  /* back */
2290ddeab2a6SMatthew G. Knepley       1, 0, 4, 7,  /* left */
2291e6ccafaeSMatthew G Knepley     };
2292e6ccafaeSMatthew G Knepley 
2293e6ccafaeSMatthew G Knepley     faceSize = faceSizeHex;
2294e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i];
2295e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr);
2296e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 6; ++iFace) {
2297e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeHex;
2298e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2299e6ccafaeSMatthew G Knepley 
2300e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) &&
2301e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesHexSorted[ii+1]) &&
2302e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesHexSorted[ii+2]) &&
2303e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesHexSorted[ii+3])) {
2304e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) {
2305e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) {
2306e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesHex[ii+fVertex]) {
2307e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2308e6ccafaeSMatthew G Knepley               break;
2309e6ccafaeSMatthew G Knepley             }
2310e6ccafaeSMatthew G Knepley           }
2311e6ccafaeSMatthew G Knepley         }
2312e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2313e6ccafaeSMatthew G Knepley         break;
2314e6ccafaeSMatthew G Knepley       }
2315e6ccafaeSMatthew G Knepley     }
2316e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface");
2317e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2318e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2319e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 10) {
2320e6ccafaeSMatthew G Knepley     /* Quadratic tet */
2321e6ccafaeSMatthew G Knepley     /* Faces are determined by the first 3 vertices (corners of faces) */
2322e6ccafaeSMatthew G Knepley     const PetscInt faceSizeTet = 6;
2323e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[6], i, iFace;
2324e6ccafaeSMatthew G Knepley     PetscBool      found                     = PETSC_FALSE;
2325e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTetSorted[24] = {
2326e6ccafaeSMatthew G Knepley       0, 1, 2,  6, 7, 8, /* bottom */
2327e6ccafaeSMatthew G Knepley       0, 3, 4,  6, 7, 9,  /* front */
2328e6ccafaeSMatthew G Knepley       1, 4, 5,  7, 8, 9,  /* right */
2329e6ccafaeSMatthew G Knepley       2, 3, 5,  6, 8, 9,  /* left */
2330e6ccafaeSMatthew G Knepley     };
2331e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTet[24] = {
2332e6ccafaeSMatthew G Knepley       0, 1, 2,  6, 7, 8, /* bottom */
2333e6ccafaeSMatthew G Knepley       0, 4, 3,  6, 7, 9,  /* front */
2334e6ccafaeSMatthew G Knepley       1, 5, 4,  7, 8, 9,  /* right */
2335e6ccafaeSMatthew G Knepley       2, 3, 5,  8, 6, 9,  /* left */
2336e6ccafaeSMatthew G Knepley     };
2337e6ccafaeSMatthew G Knepley 
2338e6ccafaeSMatthew G Knepley     faceSize = faceSizeTet;
2339e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i];
2340e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr);
2341e6ccafaeSMatthew G Knepley     for (iFace=0; iFace < 4; ++iFace) {
2342e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeTet;
2343e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2344e6ccafaeSMatthew G Knepley 
2345e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) &&
2346e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesTetSorted[ii+1]) &&
2347e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesTetSorted[ii+2]) &&
2348e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesTetSorted[ii+3])) {
2349e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) {
2350e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) {
2351e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesTet[ii+fVertex]) {
2352e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2353e6ccafaeSMatthew G Knepley               break;
2354e6ccafaeSMatthew G Knepley             }
2355e6ccafaeSMatthew G Knepley           }
2356e6ccafaeSMatthew G Knepley         }
2357e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2358e6ccafaeSMatthew G Knepley         break;
2359e6ccafaeSMatthew G Knepley       }
2360e6ccafaeSMatthew G Knepley     }
2361e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface");
2362e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2363e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2364e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 27) {
2365e6ccafaeSMatthew G Knepley     /* Quadratic hexes (I hate this)
2366e6ccafaeSMatthew G Knepley        A hex is two oriented quads with the normal of the first
2367e6ccafaeSMatthew G Knepley        pointing up at the second.
2368e6ccafaeSMatthew G Knepley 
2369e6ccafaeSMatthew G Knepley          7---6
2370e6ccafaeSMatthew G Knepley         /|  /|
2371e6ccafaeSMatthew G Knepley        4---5 |
2372e6ccafaeSMatthew G Knepley        | 3-|-2
2373e6ccafaeSMatthew G Knepley        |/  |/
2374e6ccafaeSMatthew G Knepley        0---1
2375e6ccafaeSMatthew G Knepley 
2376e6ccafaeSMatthew G Knepley        Faces are determined by the first 4 vertices (corners of faces) */
2377e6ccafaeSMatthew G Knepley     const PetscInt faceSizeQuadHex = 9;
2378e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[9], i, iFace;
2379e6ccafaeSMatthew G Knepley     PetscBool      found                         = PETSC_FALSE;
2380e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadHexSorted[54] = {
2381e6ccafaeSMatthew G Knepley       0, 1, 2, 3,  8, 9, 10, 11,  24, /* bottom */
2382e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  12, 13, 14, 15,  25, /* top */
2383e6ccafaeSMatthew G Knepley       0, 1, 4, 5,  8, 12, 16, 17,  22, /* front */
2384e6ccafaeSMatthew G Knepley       1, 2, 5, 6,  9, 13, 17, 18,  21, /* right */
2385e6ccafaeSMatthew G Knepley       2, 3, 6, 7,  10, 14, 18, 19,  23, /* back */
2386e6ccafaeSMatthew G Knepley       0, 3, 4, 7,  11, 15, 16, 19,  20, /* left */
2387e6ccafaeSMatthew G Knepley     };
2388e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadHex[54] = {
2389e6ccafaeSMatthew G Knepley       3, 2, 1, 0,  10, 9, 8, 11,  24, /* bottom */
2390e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  12, 13, 14, 15,  25, /* top */
2391e6ccafaeSMatthew G Knepley       0, 1, 5, 4,  8, 17, 12, 16,  22, /* front */
2392e6ccafaeSMatthew G Knepley       1, 2, 6, 5,  9, 18, 13, 17,  21, /* right */
2393e6ccafaeSMatthew G Knepley       2, 3, 7, 6,  10, 19, 14, 18,  23, /* back */
2394e6ccafaeSMatthew G Knepley       3, 0, 4, 7,  11, 16, 15, 19,  20 /* left */
2395e6ccafaeSMatthew G Knepley     };
2396e6ccafaeSMatthew G Knepley 
2397e6ccafaeSMatthew G Knepley     faceSize = faceSizeQuadHex;
2398e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i];
2399e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr);
2400e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 6; ++iFace) {
2401e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeQuadHex;
2402e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2403e6ccafaeSMatthew G Knepley 
2404e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) &&
2405e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) &&
2406e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) &&
2407e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) {
2408e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) {
2409e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) {
2410e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) {
2411e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2412e6ccafaeSMatthew G Knepley               break;
2413e6ccafaeSMatthew G Knepley             }
2414e6ccafaeSMatthew G Knepley           }
2415e6ccafaeSMatthew G Knepley         }
2416e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2417e6ccafaeSMatthew G Knepley         break;
2418e6ccafaeSMatthew G Knepley       }
2419e6ccafaeSMatthew G Knepley     }
2420e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface");
2421e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2422e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2423e6ccafaeSMatthew G Knepley   } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation().");
2424e6ccafaeSMatthew G Knepley   if (!posOrient) {
2425e6ccafaeSMatthew G Knepley     if (debug) {ierr = PetscPrintf(comm, "  Reversing initial face orientation\n");CHKERRQ(ierr);}
2426e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f];
2427e6ccafaeSMatthew G Knepley   } else {
2428e6ccafaeSMatthew G Knepley     if (debug) {ierr = PetscPrintf(comm, "  Keeping initial face orientation\n");CHKERRQ(ierr);}
2429e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f];
2430e6ccafaeSMatthew G Knepley   }
2431e6ccafaeSMatthew G Knepley   if (posOriented) *posOriented = posOrient;
2432e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2433e6ccafaeSMatthew G Knepley }
2434e6ccafaeSMatthew G Knepley 
2435e6ccafaeSMatthew G Knepley #undef __FUNCT__
2436e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace"
2437e6ccafaeSMatthew G Knepley /*
2438e6ccafaeSMatthew G Knepley     Given a cell and a face, as a set of vertices,
2439e6ccafaeSMatthew G Knepley       return the oriented face, as a set of vertices, in faceVertices
2440e6ccafaeSMatthew G Knepley     The orientation is such that the face normal points out of the cell
2441e6ccafaeSMatthew G Knepley */
2442e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented)
2443e6ccafaeSMatthew G Knepley {
24440298fd71SBarry Smith   const PetscInt *cone = NULL;
2445e6ccafaeSMatthew G Knepley   PetscInt        coneSize, v, f, v2;
2446e6ccafaeSMatthew G Knepley   PetscInt        oppositeVertex = -1;
2447e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2448e6ccafaeSMatthew G Knepley 
2449e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
2450e6ccafaeSMatthew G Knepley   ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr);
2451e6ccafaeSMatthew G Knepley   ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
2452e6ccafaeSMatthew G Knepley   for (v = 0, v2 = 0; v < coneSize; ++v) {
2453e6ccafaeSMatthew G Knepley     PetscBool found = PETSC_FALSE;
2454e6ccafaeSMatthew G Knepley 
2455e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) {
2456e6ccafaeSMatthew G Knepley       if (face[f] == cone[v]) {
2457e6ccafaeSMatthew G Knepley         found = PETSC_TRUE; break;
2458e6ccafaeSMatthew G Knepley       }
2459e6ccafaeSMatthew G Knepley     }
2460e6ccafaeSMatthew G Knepley     if (found) {
2461e6ccafaeSMatthew G Knepley       indices[v2]      = v;
2462e6ccafaeSMatthew G Knepley       origVertices[v2] = cone[v];
2463e6ccafaeSMatthew G Knepley       ++v2;
2464e6ccafaeSMatthew G Knepley     } else {
2465e6ccafaeSMatthew G Knepley       oppositeVertex = v;
2466e6ccafaeSMatthew G Knepley     }
2467e6ccafaeSMatthew G Knepley   }
2468e6ccafaeSMatthew G Knepley   ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr);
2469e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2470e6ccafaeSMatthew G Knepley }
2471e6ccafaeSMatthew G Knepley 
2472e6ccafaeSMatthew G Knepley #undef __FUNCT__
2473cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal"
2474e6ccafaeSMatthew G Knepley /*
2475cd0c2139SMatthew G Knepley   DMPlexInsertFace_Internal - Puts a face into the mesh
2476e6ccafaeSMatthew G Knepley 
2477e6ccafaeSMatthew G Knepley   Not collective
2478e6ccafaeSMatthew G Knepley 
2479e6ccafaeSMatthew G Knepley   Input Parameters:
2480e6ccafaeSMatthew G Knepley   + dm              - The DMPlex
2481e6ccafaeSMatthew G Knepley   . numFaceVertex   - The number of vertices in the face
2482e6ccafaeSMatthew G Knepley   . faceVertices    - The vertices in the face for dm
2483e6ccafaeSMatthew G Knepley   . subfaceVertices - The vertices in the face for subdm
2484e6ccafaeSMatthew G Knepley   . numCorners      - The number of vertices in the cell
2485e6ccafaeSMatthew G Knepley   . cell            - A cell in dm containing the face
2486e6ccafaeSMatthew G Knepley   . subcell         - A cell in subdm containing the face
2487e6ccafaeSMatthew G Knepley   . firstFace       - First face in the mesh
2488e6ccafaeSMatthew G Knepley   - newFacePoint    - Next face in the mesh
2489e6ccafaeSMatthew G Knepley 
2490e6ccafaeSMatthew G Knepley   Output Parameters:
2491e6ccafaeSMatthew G Knepley   . newFacePoint - Contains next face point number on input, updated on output
2492e6ccafaeSMatthew G Knepley 
2493e6ccafaeSMatthew G Knepley   Level: developer
2494e6ccafaeSMatthew G Knepley */
2495cd0c2139SMatthew 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)
2496e6ccafaeSMatthew G Knepley {
249782f516ccSBarry Smith   MPI_Comm        comm;
2498e6ccafaeSMatthew G Knepley   DM_Plex        *submesh = (DM_Plex*) subdm->data;
2499e6ccafaeSMatthew G Knepley   const PetscInt *faces;
2500e6ccafaeSMatthew G Knepley   PetscInt        numFaces, coneSize;
2501e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2502e6ccafaeSMatthew G Knepley 
2503e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
250482f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2505e6ccafaeSMatthew G Knepley   ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr);
2506e6ccafaeSMatthew G Knepley   if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize);
2507e6ccafaeSMatthew G Knepley #if 0
2508e6ccafaeSMatthew G Knepley   /* Cannot use this because support() has not been constructed yet */
2509e6ccafaeSMatthew G Knepley   ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr);
2510e6ccafaeSMatthew G Knepley #else
2511e6ccafaeSMatthew G Knepley   {
2512e6ccafaeSMatthew G Knepley     PetscInt f;
2513e6ccafaeSMatthew G Knepley 
2514e6ccafaeSMatthew G Knepley     numFaces = 0;
2515e6ccafaeSMatthew G Knepley     ierr     = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr);
2516e6ccafaeSMatthew G Knepley     for (f = firstFace; f < *newFacePoint; ++f) {
2517e6ccafaeSMatthew G Knepley       PetscInt dof, off, d;
2518e6ccafaeSMatthew G Knepley 
2519e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr);
2520e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr);
2521e6ccafaeSMatthew G Knepley       /* Yes, I know this is quadratic, but I expect the sizes to be <5 */
2522e6ccafaeSMatthew G Knepley       for (d = 0; d < dof; ++d) {
2523e6ccafaeSMatthew G Knepley         const PetscInt p = submesh->cones[off+d];
2524e6ccafaeSMatthew G Knepley         PetscInt       v;
2525e6ccafaeSMatthew G Knepley 
2526e6ccafaeSMatthew G Knepley         for (v = 0; v < numFaceVertices; ++v) {
2527e6ccafaeSMatthew G Knepley           if (subfaceVertices[v] == p) break;
2528e6ccafaeSMatthew G Knepley         }
2529e6ccafaeSMatthew G Knepley         if (v == numFaceVertices) break;
2530e6ccafaeSMatthew G Knepley       }
2531e6ccafaeSMatthew G Knepley       if (d == dof) {
2532e6ccafaeSMatthew G Knepley         numFaces               = 1;
2533e6ccafaeSMatthew G Knepley         ((PetscInt*) faces)[0] = f;
2534e6ccafaeSMatthew G Knepley       }
2535e6ccafaeSMatthew G Knepley     }
2536e6ccafaeSMatthew G Knepley   }
2537e6ccafaeSMatthew G Knepley #endif
2538e6ccafaeSMatthew G Knepley   if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces);
2539e6ccafaeSMatthew G Knepley   else if (numFaces == 1) {
2540e6ccafaeSMatthew G Knepley     /* Add the other cell neighbor for this face */
2541766ab985SMatthew G. Knepley     ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr);
2542e6ccafaeSMatthew G Knepley   } else {
2543e6ccafaeSMatthew G Knepley     PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov;
2544e6ccafaeSMatthew G Knepley     PetscBool posOriented;
2545e6ccafaeSMatthew G Knepley 
2546e6ccafaeSMatthew G Knepley     ierr                = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr);
2547e6ccafaeSMatthew G Knepley     origVertices        = &orientedVertices[numFaceVertices];
2548e6ccafaeSMatthew G Knepley     indices             = &orientedVertices[numFaceVertices*2];
2549e6ccafaeSMatthew G Knepley     orientedSubVertices = &orientedVertices[numFaceVertices*3];
2550e6ccafaeSMatthew G Knepley     ierr                = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr);
2551e6ccafaeSMatthew G Knepley     /* TODO: I know that routine should return a permutation, not the indices */
2552e6ccafaeSMatthew G Knepley     for (v = 0; v < numFaceVertices; ++v) {
2553e6ccafaeSMatthew G Knepley       const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v];
2554e6ccafaeSMatthew G Knepley       for (ov = 0; ov < numFaceVertices; ++ov) {
2555e6ccafaeSMatthew G Knepley         if (orientedVertices[ov] == vertex) {
2556e6ccafaeSMatthew G Knepley           orientedSubVertices[ov] = subvertex;
2557e6ccafaeSMatthew G Knepley           break;
2558e6ccafaeSMatthew G Knepley         }
2559e6ccafaeSMatthew G Knepley       }
2560e6ccafaeSMatthew G Knepley       if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex);
2561e6ccafaeSMatthew G Knepley     }
2562e6ccafaeSMatthew G Knepley     ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr);
2563e6ccafaeSMatthew G Knepley     ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr);
2564e6ccafaeSMatthew G Knepley     ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr);
2565e6ccafaeSMatthew G Knepley     ++(*newFacePoint);
2566e6ccafaeSMatthew G Knepley   }
2567ef07cca7SMatthew G. Knepley #if 0
2568e6ccafaeSMatthew G Knepley   ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr);
2569ef07cca7SMatthew G. Knepley #else
2570ef07cca7SMatthew G. Knepley   ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr);
2571ef07cca7SMatthew G. Knepley #endif
2572e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2573e6ccafaeSMatthew G Knepley }
2574e6ccafaeSMatthew G Knepley 
2575e6ccafaeSMatthew G Knepley #undef __FUNCT__
2576e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated"
257753156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm)
2578e6ccafaeSMatthew G Knepley {
257982f516ccSBarry Smith   MPI_Comm        comm;
258053156dfcSMatthew G. Knepley   DMLabel         subpointMap;
2581efa14ee0SMatthew G Knepley   IS              subvertexIS,  subcellIS;
2582efa14ee0SMatthew G Knepley   const PetscInt *subVertices, *subCells;
2583efa14ee0SMatthew G Knepley   PetscInt        numSubVertices, firstSubVertex, numSubCells;
2584fed694aaSMatthew G. Knepley   PetscInt       *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0;
2585efa14ee0SMatthew G Knepley   PetscInt        vStart, vEnd, c, f;
2586e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2587e6ccafaeSMatthew G Knepley 
2588e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
258982f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2590efa14ee0SMatthew G Knepley   /* Create subpointMap which marks the submesh */
2591efa14ee0SMatthew G Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2592efa14ee0SMatthew G Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2593efa14ee0SMatthew G Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
259453156dfcSMatthew G. Knepley   if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);}
2595efa14ee0SMatthew G Knepley   /* Setup chart */
2596efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr);
2597efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr);
2598efa14ee0SMatthew G Knepley   ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr);
2599efa14ee0SMatthew G Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2600e6ccafaeSMatthew G Knepley   /* Set cone sizes */
2601e6ccafaeSMatthew G Knepley   firstSubVertex = numSubCells;
2602efa14ee0SMatthew G Knepley   firstSubFace   = numSubCells+numSubVertices;
2603e6ccafaeSMatthew G Knepley   newFacePoint   = firstSubFace;
2604efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr);
2605efa14ee0SMatthew G Knepley   if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2606efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr);
2607efa14ee0SMatthew G Knepley   if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);}
2608e6ccafaeSMatthew G Knepley   for (c = 0; c < numSubCells; ++c) {
2609e6ccafaeSMatthew G Knepley     ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr);
2610e6ccafaeSMatthew G Knepley   }
2611e6ccafaeSMatthew G Knepley   for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) {
2612e6ccafaeSMatthew G Knepley     ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr);
2613e6ccafaeSMatthew G Knepley   }
2614e6ccafaeSMatthew G Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2615e6ccafaeSMatthew G Knepley   /* Create face cones */
2616efa14ee0SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
26170298fd71SBarry Smith   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
2618efa14ee0SMatthew G Knepley   ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2619e6ccafaeSMatthew G Knepley   for (c = 0; c < numSubCells; ++c) {
2620e6ccafaeSMatthew G Knepley     const PetscInt cell    = subCells[c];
2621efa14ee0SMatthew G Knepley     const PetscInt subcell = c;
26220298fd71SBarry Smith     PetscInt      *closure = NULL;
2623efa14ee0SMatthew G Knepley     PetscInt       closureSize, cl, numCorners = 0, faceSize = 0;
2624e6ccafaeSMatthew G Knepley 
2625e6ccafaeSMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2626efa14ee0SMatthew G Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
2627efa14ee0SMatthew G Knepley       const PetscInt point = closure[cl];
2628e6ccafaeSMatthew G Knepley       PetscInt       subVertex;
2629e6ccafaeSMatthew G Knepley 
2630efa14ee0SMatthew G Knepley       if ((point >= vStart) && (point < vEnd)) {
2631efa14ee0SMatthew G Knepley         ++numCorners;
2632efa14ee0SMatthew G Knepley         ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr);
2633efa14ee0SMatthew G Knepley         if (subVertex >= 0) {
2634efa14ee0SMatthew G Knepley           closure[faceSize] = point;
263565560c7fSMatthew G Knepley           subface[faceSize] = firstSubVertex+subVertex;
2636e6ccafaeSMatthew G Knepley           ++faceSize;
2637e6ccafaeSMatthew G Knepley         }
2638e6ccafaeSMatthew G Knepley       }
2639e6ccafaeSMatthew G Knepley     }
2640efa14ee0SMatthew G Knepley     if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize);
2641efa14ee0SMatthew G Knepley     if (faceSize == nFV) {
2642cd0c2139SMatthew G Knepley       ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr);
2643e6ccafaeSMatthew G Knepley     }
264465560c7fSMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2645e6ccafaeSMatthew G Knepley   }
2646efa14ee0SMatthew G Knepley   ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2647e6ccafaeSMatthew G Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2648e6ccafaeSMatthew G Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2649e6ccafaeSMatthew G Knepley   /* Build coordinates */
2650efa14ee0SMatthew G Knepley   {
2651efa14ee0SMatthew G Knepley     PetscSection coordSection, subCoordSection;
2652efa14ee0SMatthew G Knepley     Vec          coordinates, subCoordinates;
2653efa14ee0SMatthew G Knepley     PetscScalar *coords, *subCoords;
2654285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize, v;
2655efa14ee0SMatthew G Knepley 
265669d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2657e6ccafaeSMatthew G Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
265869d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2659285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2660285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2661285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2662efa14ee0SMatthew G Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr);
2663efa14ee0SMatthew G Knepley     for (v = 0; v < numSubVertices; ++v) {
2664efa14ee0SMatthew G Knepley       const PetscInt vertex    = subVertices[v];
2665efa14ee0SMatthew G Knepley       const PetscInt subvertex = firstSubVertex+v;
2666efa14ee0SMatthew G Knepley       PetscInt       dof;
2667efa14ee0SMatthew G Knepley 
2668efa14ee0SMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2669efa14ee0SMatthew G Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2670285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2671e6ccafaeSMatthew G Knepley     }
2672e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2673e6ccafaeSMatthew G Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2674e6ccafaeSMatthew G Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2675e6ccafaeSMatthew G Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
26762eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2677830e53efSMatthew G. Knepley     if (coordSize) {
2678e6ccafaeSMatthew G Knepley       ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2679e6ccafaeSMatthew G Knepley       ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2680efa14ee0SMatthew G Knepley       for (v = 0; v < numSubVertices; ++v) {
2681efa14ee0SMatthew G Knepley         const PetscInt vertex    = subVertices[v];
2682efa14ee0SMatthew G Knepley         const PetscInt subvertex = firstSubVertex+v;
2683efa14ee0SMatthew G Knepley         PetscInt       dof, off, sdof, soff, d;
2684e6ccafaeSMatthew G Knepley 
2685e6ccafaeSMatthew G Knepley         ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2686e6ccafaeSMatthew G Knepley         ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2687efa14ee0SMatthew G Knepley         ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2688efa14ee0SMatthew G Knepley         ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2689efa14ee0SMatthew 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);
2690e6ccafaeSMatthew G Knepley         for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2691e6ccafaeSMatthew G Knepley       }
2692e6ccafaeSMatthew G Knepley       ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2693e6ccafaeSMatthew G Knepley       ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
26943b399e24SMatthew G. Knepley     }
2695e6ccafaeSMatthew G Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2696e6ccafaeSMatthew G Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2697e6ccafaeSMatthew G Knepley   }
2698efa14ee0SMatthew G Knepley   /* Cleanup */
2699efa14ee0SMatthew G Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2700efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
2701efa14ee0SMatthew G Knepley   if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);}
2702efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subcellIS);CHKERRQ(ierr);
2703e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2704e6ccafaeSMatthew G Knepley }
2705e6ccafaeSMatthew G Knepley 
2706e6ccafaeSMatthew G Knepley #undef __FUNCT__
27073982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal"
27083982b651SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[])
27093982b651SMatthew G. Knepley {
27103982b651SMatthew G. Knepley   PetscInt       subPoint;
27113982b651SMatthew G. Knepley   PetscErrorCode ierr;
27123982b651SMatthew G. Knepley 
27133982b651SMatthew G. Knepley   ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr;
27143982b651SMatthew G. Knepley   return subPoint < 0 ? subPoint : firstSubPoint+subPoint;
27153982b651SMatthew G. Knepley }
27163982b651SMatthew G. Knepley 
27173982b651SMatthew G. Knepley #undef __FUNCT__
27183982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateSubmeshGeneric_Interpolated"
27193982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmeshGeneric_Interpolated(DM dm, DMLabel label, PetscInt value, PetscBool isCohesive, DM subdm)
2720e6ccafaeSMatthew G Knepley {
272182f516ccSBarry Smith   MPI_Comm         comm;
272253156dfcSMatthew G. Knepley   DMLabel          subpointMap;
2723efa14ee0SMatthew G Knepley   IS              *subpointIS;
2724efa14ee0SMatthew G Knepley   const PetscInt **subpoints;
27253982b651SMatthew G. Knepley   PetscInt        *numSubPoints, *firstSubPoint, *coneNew, *orntNew;
2726efa14ee0SMatthew G Knepley   PetscInt         totSubPoints = 0, maxConeSize, dim, p, d, v;
2727e6ccafaeSMatthew G Knepley   PetscErrorCode   ierr;
2728e6ccafaeSMatthew G Knepley 
2729e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
273082f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2731efa14ee0SMatthew G Knepley   /* Create subpointMap which marks the submesh */
2732e6ccafaeSMatthew G Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2733efa14ee0SMatthew G Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2734efa14ee0SMatthew G Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
27353982b651SMatthew G. Knepley   if (isCohesive) {ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);}
27363982b651SMatthew G. Knepley   else            {ierr = DMPlexMarkSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);}
2737efa14ee0SMatthew G Knepley   /* Setup chart */
2738c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
2739dcca6d9dSJed Brown   ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr);
2740e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2741e6ccafaeSMatthew G Knepley     ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr);
2742e6ccafaeSMatthew G Knepley     totSubPoints += numSubPoints[d];
2743e6ccafaeSMatthew G Knepley   }
2744e6ccafaeSMatthew G Knepley   ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr);
2745e6ccafaeSMatthew G Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2746e6ccafaeSMatthew G Knepley   /* Set cone sizes */
2747e6ccafaeSMatthew G Knepley   firstSubPoint[dim] = 0;
2748e6ccafaeSMatthew G Knepley   firstSubPoint[0]   = firstSubPoint[dim] + numSubPoints[dim];
2749e6ccafaeSMatthew G Knepley   if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0]     + numSubPoints[0];}
2750e6ccafaeSMatthew G Knepley   if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];}
2751e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2752e6ccafaeSMatthew G Knepley     ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr);
27530ae02aa4SMatthew G. Knepley     if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);}
2754e6ccafaeSMatthew G Knepley   }
2755e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2756e6ccafaeSMatthew G Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2757e6ccafaeSMatthew G Knepley       const PetscInt  point    = subpoints[d][p];
2758e6ccafaeSMatthew G Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
2759e6ccafaeSMatthew G Knepley       const PetscInt *cone;
2760e6ccafaeSMatthew G Knepley       PetscInt        coneSize, coneSizeNew, c, val;
2761e6ccafaeSMatthew G Knepley 
2762e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2763e6ccafaeSMatthew G Knepley       ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr);
2764e6ccafaeSMatthew G Knepley       if (d == dim) {
2765e6ccafaeSMatthew G Knepley         ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
2766e6ccafaeSMatthew G Knepley         for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2767e6ccafaeSMatthew G Knepley           ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr);
2768e6ccafaeSMatthew G Knepley           if (val >= 0) coneSizeNew++;
2769e6ccafaeSMatthew G Knepley         }
2770e6ccafaeSMatthew G Knepley         ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr);
2771e6ccafaeSMatthew G Knepley       }
2772e6ccafaeSMatthew G Knepley     }
2773e6ccafaeSMatthew G Knepley   }
2774e6ccafaeSMatthew G Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2775e6ccafaeSMatthew G Knepley   /* Set cones */
27760298fd71SBarry Smith   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
27773982b651SMatthew G. Knepley   ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&orntNew);CHKERRQ(ierr);
2778e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2779e6ccafaeSMatthew G Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2780e6ccafaeSMatthew G Knepley       const PetscInt  point    = subpoints[d][p];
2781e6ccafaeSMatthew G Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
27820e49e2e2SMatthew G. Knepley       const PetscInt *cone, *ornt;
2783e6ccafaeSMatthew G Knepley       PetscInt        coneSize, subconeSize, coneSizeNew, c, subc;
2784e6ccafaeSMatthew G Knepley 
2785e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2786e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
2787e6ccafaeSMatthew G Knepley       ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
27880e49e2e2SMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr);
2789e6ccafaeSMatthew G Knepley       for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2790e6ccafaeSMatthew G Knepley         ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr);
279101a2673eSMatthew G. Knepley         if (subc >= 0) {
279201a2673eSMatthew G. Knepley           coneNew[coneSizeNew] = firstSubPoint[d-1] + subc;
27933982b651SMatthew G. Knepley           orntNew[coneSizeNew] = ornt[c];
279401a2673eSMatthew G. Knepley           ++coneSizeNew;
279501a2673eSMatthew G. Knepley         }
2796e6ccafaeSMatthew G Knepley       }
2797e6ccafaeSMatthew G Knepley       if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize);
2798e6ccafaeSMatthew G Knepley       ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr);
27993982b651SMatthew G. Knepley       ierr = DMPlexSetConeOrientation(subdm, subpoint, orntNew);CHKERRQ(ierr);
2800e6ccafaeSMatthew G Knepley     }
2801e6ccafaeSMatthew G Knepley   }
28023982b651SMatthew G. Knepley   ierr = PetscFree2(coneNew,orntNew);CHKERRQ(ierr);
2803e6ccafaeSMatthew G Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2804e6ccafaeSMatthew G Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2805e6ccafaeSMatthew G Knepley   /* Build coordinates */
2806e6ccafaeSMatthew G Knepley   {
2807e6ccafaeSMatthew G Knepley     PetscSection coordSection, subCoordSection;
2808e6ccafaeSMatthew G Knepley     Vec          coordinates, subCoordinates;
2809e6ccafaeSMatthew G Knepley     PetscScalar *coords, *subCoords;
2810285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize;
2811e6ccafaeSMatthew G Knepley 
281269d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2813e6ccafaeSMatthew G Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
281469d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2815285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2816285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2817285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2818e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr);
2819e6ccafaeSMatthew G Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2820e6ccafaeSMatthew G Knepley       const PetscInt vertex    = subpoints[0][v];
2821e6ccafaeSMatthew G Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2822e6ccafaeSMatthew G Knepley       PetscInt       dof;
2823e6ccafaeSMatthew G Knepley 
2824e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2825e6ccafaeSMatthew G Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2826285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2827e6ccafaeSMatthew G Knepley     }
2828e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2829e6ccafaeSMatthew G Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2830e6ccafaeSMatthew G Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2831e6ccafaeSMatthew G Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
28322eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2833e6ccafaeSMatthew G Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2834e6ccafaeSMatthew G Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2835e6ccafaeSMatthew G Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2836e6ccafaeSMatthew G Knepley       const PetscInt vertex    = subpoints[0][v];
2837e6ccafaeSMatthew G Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2838e6ccafaeSMatthew G Knepley       PetscInt dof, off, sdof, soff, d;
2839e6ccafaeSMatthew G Knepley 
2840e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2841e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2842e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2843e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2844e6ccafaeSMatthew 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);
2845efa14ee0SMatthew G Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2846e6ccafaeSMatthew G Knepley     }
2847e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2848e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2849e6ccafaeSMatthew G Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2850e6ccafaeSMatthew G Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2851e6ccafaeSMatthew G Knepley   }
28523982b651SMatthew G. Knepley   /* Build SF: We need this complexity because subpoints might not be selected on the owning process */
28533982b651SMatthew G. Knepley   {
28543982b651SMatthew G. Knepley     PetscSF            sfPoint, sfPointSub;
28553982b651SMatthew G. Knepley     IS                 subpIS;
28563982b651SMatthew G. Knepley     const PetscSFNode *remotePoints;
28573982b651SMatthew G. Knepley     PetscSFNode       *sremotePoints, *newLocalPoints, *newOwners;
28583982b651SMatthew G. Knepley     const PetscInt    *localPoints, *subpoints;
28593982b651SMatthew G. Knepley     PetscInt          *slocalPoints;
28603982b651SMatthew G. Knepley     PetscInt           numRoots, numLeaves, numSubpoints = 0, numSubroots, numSubleaves = 0, l, sl, ll, pStart, pEnd, p;
28613982b651SMatthew G. Knepley     PetscMPIInt        rank;
28623982b651SMatthew G. Knepley 
28633982b651SMatthew G. Knepley     ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr);
28643982b651SMatthew G. Knepley     ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
28653982b651SMatthew G. Knepley     ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr);
28663982b651SMatthew G. Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
28673982b651SMatthew G. Knepley     ierr = DMPlexGetChart(subdm, NULL, &numSubroots);CHKERRQ(ierr);
28683982b651SMatthew G. Knepley     ierr = DMPlexCreateSubpointIS(subdm, &subpIS);CHKERRQ(ierr);
28693982b651SMatthew G. Knepley     if (subpIS) {
28703982b651SMatthew G. Knepley       ierr = ISGetIndices(subpIS, &subpoints);CHKERRQ(ierr);
28713982b651SMatthew G. Knepley       ierr = ISGetLocalSize(subpIS, &numSubpoints);CHKERRQ(ierr);
28723982b651SMatthew G. Knepley     }
28733982b651SMatthew G. Knepley     ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
28743982b651SMatthew G. Knepley     if (numRoots >= 0) {
28753982b651SMatthew G. Knepley       ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr);
28763982b651SMatthew G. Knepley       for (p = 0; p < pEnd-pStart; ++p) {
28773982b651SMatthew G. Knepley         newLocalPoints[p].rank  = -2;
28783982b651SMatthew G. Knepley         newLocalPoints[p].index = -2;
28793982b651SMatthew G. Knepley       }
28803982b651SMatthew G. Knepley       /* Set subleaves */
28813982b651SMatthew G. Knepley       for (l = 0; l < numLeaves; ++l) {
28823982b651SMatthew G. Knepley         const PetscInt point    = localPoints[l];
28833982b651SMatthew G. Knepley         const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints);
28843982b651SMatthew G. Knepley 
28853982b651SMatthew G. Knepley         if (subpoint < 0) continue;
28863982b651SMatthew G. Knepley         newLocalPoints[point-pStart].rank  = rank;
28873982b651SMatthew G. Knepley         newLocalPoints[point-pStart].index = subpoint;
28883982b651SMatthew G. Knepley         ++numSubleaves;
28893982b651SMatthew G. Knepley       }
28903982b651SMatthew G. Knepley       /* Must put in owned subpoints */
28913982b651SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {
28923982b651SMatthew G. Knepley         const PetscInt subpoint = DMPlexFilterPoint_Internal(p, 0, numSubpoints, subpoints);
28933982b651SMatthew G. Knepley 
28943982b651SMatthew G. Knepley         if (subpoint < 0) {
28953982b651SMatthew G. Knepley           newOwners[p-pStart].rank  = -3;
28963982b651SMatthew G. Knepley           newOwners[p-pStart].index = -3;
28973982b651SMatthew G. Knepley         } else {
28983982b651SMatthew G. Knepley           newOwners[p-pStart].rank  = rank;
28993982b651SMatthew G. Knepley           newOwners[p-pStart].index = subpoint;
29003982b651SMatthew G. Knepley         }
29013982b651SMatthew G. Knepley       }
29023982b651SMatthew G. Knepley       ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
29033982b651SMatthew G. Knepley       ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
29043982b651SMatthew G. Knepley       ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
29053982b651SMatthew G. Knepley       ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
29063982b651SMatthew G. Knepley       ierr = PetscMalloc1(numSubleaves, &slocalPoints);CHKERRQ(ierr);
29073982b651SMatthew G. Knepley       ierr = PetscMalloc1(numSubleaves, &sremotePoints);CHKERRQ(ierr);
29083982b651SMatthew G. Knepley       for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) {
29093982b651SMatthew G. Knepley         const PetscInt point    = localPoints[l];
29103982b651SMatthew G. Knepley         const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints);
29113982b651SMatthew G. Knepley 
29123982b651SMatthew G. Knepley         if (subpoint < 0) continue;
29133982b651SMatthew G. Knepley         if (newLocalPoints[point].rank == rank) {++ll; continue;}
29143982b651SMatthew G. Knepley         slocalPoints[sl]        = subpoint;
29153982b651SMatthew G. Knepley         sremotePoints[sl].rank  = newLocalPoints[point].rank;
29163982b651SMatthew G. Knepley         sremotePoints[sl].index = newLocalPoints[point].index;
29173982b651SMatthew G. Knepley         if (sremotePoints[sl].rank  < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point);
29183982b651SMatthew G. Knepley         if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point);
29193982b651SMatthew G. Knepley         ++sl;
29203982b651SMatthew G. Knepley       }
29213982b651SMatthew G. Knepley       if (sl + ll != numSubleaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubleaves);
29223982b651SMatthew G. Knepley       ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr);
29233982b651SMatthew G. Knepley       ierr = PetscSFSetGraph(sfPointSub, numSubroots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
29243982b651SMatthew G. Knepley     }
29253982b651SMatthew G. Knepley     if (subpIS) {
29263982b651SMatthew G. Knepley       ierr = ISRestoreIndices(subpIS, &subpoints);CHKERRQ(ierr);
29273982b651SMatthew G. Knepley       ierr = ISDestroy(&subpIS);CHKERRQ(ierr);
29283982b651SMatthew G. Knepley     }
29293982b651SMatthew G. Knepley   }
2930efa14ee0SMatthew G Knepley   /* Cleanup */
2931e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
29320ae02aa4SMatthew G. Knepley     if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);}
2933e6ccafaeSMatthew G Knepley     ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr);
2934e6ccafaeSMatthew G Knepley   }
2935efa14ee0SMatthew G Knepley   ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr);
2936e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2937e6ccafaeSMatthew G Knepley }
2938e6ccafaeSMatthew G Knepley 
2939e6ccafaeSMatthew G Knepley #undef __FUNCT__
29403982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated"
29413982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm)
29423982b651SMatthew G. Knepley {
29433982b651SMatthew G. Knepley   PetscErrorCode ierr;
29443982b651SMatthew G. Knepley 
29453982b651SMatthew G. Knepley   PetscFunctionBegin;
29463982b651SMatthew G. Knepley   ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, vertexLabel, value, PETSC_FALSE, subdm);CHKERRQ(ierr);
29473982b651SMatthew G. Knepley   PetscFunctionReturn(0);
29483982b651SMatthew G. Knepley }
29493982b651SMatthew G. Knepley 
29503982b651SMatthew G. Knepley #undef __FUNCT__
2951e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh"
2952d0fa310fSMatthew G. Knepley /*@
2953e6ccafaeSMatthew G Knepley   DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label
2954e6ccafaeSMatthew G Knepley 
2955e6ccafaeSMatthew G Knepley   Input Parameters:
2956e6ccafaeSMatthew G Knepley + dm           - The original mesh
2957830e53efSMatthew G. Knepley . vertexLabel  - The DMLabel marking vertices contained in the surface
2958830e53efSMatthew G. Knepley - value        - The label value to use
2959e6ccafaeSMatthew G Knepley 
2960e6ccafaeSMatthew G Knepley   Output Parameter:
2961e6ccafaeSMatthew G Knepley . subdm - The surface mesh
2962e6ccafaeSMatthew G Knepley 
2963e6ccafaeSMatthew G Knepley   Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap().
2964e6ccafaeSMatthew G Knepley 
2965e6ccafaeSMatthew G Knepley   Level: developer
2966e6ccafaeSMatthew G Knepley 
2967e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue()
2968830e53efSMatthew G. Knepley @*/
296953156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm)
2970e6ccafaeSMatthew G Knepley {
2971e6ccafaeSMatthew G Knepley   PetscInt       dim, depth;
2972e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
2973e6ccafaeSMatthew G Knepley 
2974e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
2975e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2976766ab985SMatthew G. Knepley   PetscValidPointer(subdm, 3);
2977c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
2978e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
297982f516ccSBarry Smith   ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr);
2980e6ccafaeSMatthew G Knepley   ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr);
2981c73cfb54SMatthew G. Knepley   ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr);
2982e6ccafaeSMatthew G Knepley   if (depth == dim) {
2983830e53efSMatthew G. Knepley     ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr);
2984e6ccafaeSMatthew G Knepley   } else {
2985830e53efSMatthew G. Knepley     ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr);
2986e6ccafaeSMatthew G Knepley   }
2987e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2988e6ccafaeSMatthew G Knepley }
2989e6ccafaeSMatthew G Knepley 
2990e6ccafaeSMatthew G Knepley #undef __FUNCT__
2991766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated"
299227c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm)
2993766ab985SMatthew G. Knepley {
2994766ab985SMatthew G. Knepley   MPI_Comm        comm;
2995766ab985SMatthew G. Knepley   DMLabel         subpointMap;
2996766ab985SMatthew G. Knepley   IS              subvertexIS;
2997766ab985SMatthew G. Knepley   const PetscInt *subVertices;
2998fed694aaSMatthew G. Knepley   PetscInt        numSubVertices, firstSubVertex, numSubCells, *subCells = NULL;
2999766ab985SMatthew G. Knepley   PetscInt       *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV;
300087feddfdSMatthew G. Knepley   PetscInt        cMax, c, f;
3001766ab985SMatthew G. Knepley   PetscErrorCode  ierr;
3002766ab985SMatthew G. Knepley 
3003766ab985SMatthew G. Knepley   PetscFunctionBegin;
3004766ab985SMatthew G. Knepley   ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr);
3005766ab985SMatthew G. Knepley   /* Create subpointMap which marks the submesh */
3006766ab985SMatthew G. Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
3007766ab985SMatthew G. Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
3008766ab985SMatthew G. Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
300927c04023SMatthew G. Knepley   ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr);
3010766ab985SMatthew G. Knepley   /* Setup chart */
3011766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr);
3012766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr);
3013766ab985SMatthew G. Knepley   ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr);
3014766ab985SMatthew G. Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
3015766ab985SMatthew G. Knepley   /* Set cone sizes */
3016766ab985SMatthew G. Knepley   firstSubVertex = numSubCells;
3017766ab985SMatthew G. Knepley   firstSubFace   = numSubCells+numSubVertices;
3018766ab985SMatthew G. Knepley   newFacePoint   = firstSubFace;
3019766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr);
3020766ab985SMatthew G. Knepley   if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
3021766ab985SMatthew G. Knepley   for (c = 0; c < numSubCells; ++c) {
3022766ab985SMatthew G. Knepley     ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr);
3023766ab985SMatthew G. Knepley   }
3024766ab985SMatthew G. Knepley   for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) {
3025766ab985SMatthew G. Knepley     ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr);
3026766ab985SMatthew G. Knepley   }
3027766ab985SMatthew G. Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
3028766ab985SMatthew G. Knepley   /* Create face cones */
3029766ab985SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
303087feddfdSMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
3031766ab985SMatthew G. Knepley   ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
3032766ab985SMatthew G. Knepley   for (c = 0; c < numSubCells; ++c) {
3033766ab985SMatthew G. Knepley     const PetscInt  cell    = subCells[c];
3034766ab985SMatthew G. Knepley     const PetscInt  subcell = c;
303587feddfdSMatthew G. Knepley     const PetscInt *cone, *cells;
303687feddfdSMatthew G. Knepley     PetscInt        numCells, subVertex, p, v;
3037766ab985SMatthew G. Knepley 
303887feddfdSMatthew G. Knepley     if (cell < cMax) continue;
303987feddfdSMatthew G. Knepley     ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
304087feddfdSMatthew G. Knepley     for (v = 0; v < nFV; ++v) {
304187feddfdSMatthew G. Knepley       ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr);
304287feddfdSMatthew G. Knepley       subface[v] = firstSubVertex+subVertex;
304387feddfdSMatthew G. Knepley     }
304487feddfdSMatthew G. Knepley     ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr);
304587feddfdSMatthew G. Knepley     ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr);
304687feddfdSMatthew G. Knepley     ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr);
304727234c99SMatthew G. Knepley     /* Not true in parallel
304827234c99SMatthew G. Knepley     if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */
304987feddfdSMatthew G. Knepley     for (p = 0; p < numCells; ++p) {
305087feddfdSMatthew G. Knepley       PetscInt negsubcell;
3051766ab985SMatthew G. Knepley 
305287feddfdSMatthew G. Knepley       if (cells[p] >= cMax) continue;
305387feddfdSMatthew G. Knepley       /* I know this is a crap search */
305487feddfdSMatthew G. Knepley       for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) {
305587feddfdSMatthew G. Knepley         if (subCells[negsubcell] == cells[p]) break;
3056766ab985SMatthew G. Knepley       }
305787feddfdSMatthew G. Knepley       if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell);
305887feddfdSMatthew G. Knepley       ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr);
3059766ab985SMatthew G. Knepley     }
306087feddfdSMatthew G. Knepley     ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr);
306187feddfdSMatthew G. Knepley     ++newFacePoint;
3062766ab985SMatthew G. Knepley   }
3063766ab985SMatthew G. Knepley   ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
3064766ab985SMatthew G. Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
3065766ab985SMatthew G. Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
3066766ab985SMatthew G. Knepley   /* Build coordinates */
3067766ab985SMatthew G. Knepley   {
3068766ab985SMatthew G. Knepley     PetscSection coordSection, subCoordSection;
3069766ab985SMatthew G. Knepley     Vec          coordinates, subCoordinates;
3070766ab985SMatthew G. Knepley     PetscScalar *coords, *subCoords;
3071285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize, v;
3072766ab985SMatthew G. Knepley 
307369d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
3074766ab985SMatthew G. Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
307569d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
3076285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
3077285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
3078285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
3079766ab985SMatthew G. Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr);
3080766ab985SMatthew G. Knepley     for (v = 0; v < numSubVertices; ++v) {
3081766ab985SMatthew G. Knepley       const PetscInt vertex    = subVertices[v];
3082766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubVertex+v;
3083766ab985SMatthew G. Knepley       PetscInt       dof;
3084766ab985SMatthew G. Knepley 
3085766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
3086766ab985SMatthew G. Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
3087285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
3088766ab985SMatthew G. Knepley     }
3089766ab985SMatthew G. Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
3090766ab985SMatthew G. Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
3091766ab985SMatthew G. Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
3092766ab985SMatthew G. Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
30932eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
3094766ab985SMatthew G. Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
3095766ab985SMatthew G. Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
3096766ab985SMatthew G. Knepley     for (v = 0; v < numSubVertices; ++v) {
3097766ab985SMatthew G. Knepley       const PetscInt vertex    = subVertices[v];
3098766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubVertex+v;
3099766ab985SMatthew G. Knepley       PetscInt       dof, off, sdof, soff, d;
3100766ab985SMatthew G. Knepley 
3101766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
3102766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
3103766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
3104766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
3105766ab985SMatthew 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);
3106766ab985SMatthew G. Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
3107766ab985SMatthew G. Knepley     }
3108766ab985SMatthew G. Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
3109766ab985SMatthew G. Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
3110766ab985SMatthew G. Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
3111766ab985SMatthew G. Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
3112766ab985SMatthew G. Knepley   }
3113aca35d17SMatthew G. Knepley   /* Build SF */
3114aca35d17SMatthew G. Knepley   CHKMEMQ;
3115aca35d17SMatthew G. Knepley   {
3116aca35d17SMatthew G. Knepley     PetscSF            sfPoint, sfPointSub;
3117aca35d17SMatthew G. Knepley     const PetscSFNode *remotePoints;
3118bdcf2095SMatthew G. Knepley     PetscSFNode       *sremotePoints, *newLocalPoints, *newOwners;
3119aca35d17SMatthew G. Knepley     const PetscInt    *localPoints;
3120bdcf2095SMatthew G. Knepley     PetscInt          *slocalPoints;
312149c26ae4SMatthew G. Knepley     PetscInt           numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd;
3122bdcf2095SMatthew G. Knepley     PetscMPIInt        rank;
3123aca35d17SMatthew G. Knepley 
3124bdcf2095SMatthew G. Knepley     ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr);
3125aca35d17SMatthew G. Knepley     ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
3126aca35d17SMatthew G. Knepley     ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr);
3127aca35d17SMatthew G. Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
3128aca35d17SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
3129aca35d17SMatthew G. Knepley     ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
3130aca35d17SMatthew G. Knepley     if (numRoots >= 0) {
3131aca35d17SMatthew G. Knepley       /* Only vertices should be shared */
3132dcca6d9dSJed Brown       ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr);
3133bdcf2095SMatthew G. Knepley       for (p = 0; p < pEnd-pStart; ++p) {
3134bdcf2095SMatthew G. Knepley         newLocalPoints[p].rank  = -2;
3135bdcf2095SMatthew G. Knepley         newLocalPoints[p].index = -2;
3136bdcf2095SMatthew G. Knepley       }
31379e0823b2SMatthew G. Knepley       /* Set subleaves */
3138aca35d17SMatthew G. Knepley       for (l = 0; l < numLeaves; ++l) {
3139aca35d17SMatthew G. Knepley         const PetscInt point    = localPoints[l];
3140bdcf2095SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices);
3141aca35d17SMatthew G. Knepley 
3142aca35d17SMatthew G. Knepley         if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point);
3143bdcf2095SMatthew G. Knepley         if (subPoint < 0) continue;
3144bdcf2095SMatthew G. Knepley         newLocalPoints[point-pStart].rank  = rank;
3145bdcf2095SMatthew G. Knepley         newLocalPoints[point-pStart].index = subPoint;
3146bdcf2095SMatthew G. Knepley         ++numSubLeaves;
3147aca35d17SMatthew G. Knepley       }
31489e0823b2SMatthew G. Knepley       /* Must put in owned subpoints */
31499e0823b2SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {
31509e0823b2SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices);
31519e0823b2SMatthew G. Knepley 
31529e0823b2SMatthew G. Knepley         if (subPoint < 0) {
31539e0823b2SMatthew G. Knepley           newOwners[p-pStart].rank  = -3;
31549e0823b2SMatthew G. Knepley           newOwners[p-pStart].index = -3;
31559e0823b2SMatthew G. Knepley         } else {
31569e0823b2SMatthew G. Knepley           newOwners[p-pStart].rank  = rank;
31579e0823b2SMatthew G. Knepley           newOwners[p-pStart].index = subPoint;
31589e0823b2SMatthew G. Knepley         }
3159bdcf2095SMatthew G. Knepley       }
3160bdcf2095SMatthew G. Knepley       ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
3161bdcf2095SMatthew G. Knepley       ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
3162bdcf2095SMatthew G. Knepley       ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
3163bdcf2095SMatthew G. Knepley       ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
3164785e854fSJed Brown       ierr = PetscMalloc1(numSubLeaves,    &slocalPoints);CHKERRQ(ierr);
3165785e854fSJed Brown       ierr = PetscMalloc1(numSubLeaves, &sremotePoints);CHKERRQ(ierr);
316649c26ae4SMatthew G. Knepley       for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) {
3167bdcf2095SMatthew G. Knepley         const PetscInt point    = localPoints[l];
3168bdcf2095SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices);
3169aca35d17SMatthew G. Knepley 
3170aca35d17SMatthew G. Knepley         if (subPoint < 0) continue;
317149c26ae4SMatthew G. Knepley         if (newLocalPoints[point].rank == rank) {++ll; continue;}
3172aca35d17SMatthew G. Knepley         slocalPoints[sl]        = subPoint;
3173bdcf2095SMatthew G. Knepley         sremotePoints[sl].rank  = newLocalPoints[point].rank;
3174bdcf2095SMatthew G. Knepley         sremotePoints[sl].index = newLocalPoints[point].index;
3175bdcf2095SMatthew G. Knepley         if (sremotePoints[sl].rank  < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point);
3176bdcf2095SMatthew G. Knepley         if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point);
3177aca35d17SMatthew G. Knepley         ++sl;
3178aca35d17SMatthew G. Knepley       }
3179bdcf2095SMatthew G. Knepley       ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr);
318049c26ae4SMatthew G. Knepley       if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves);
318149c26ae4SMatthew G. Knepley       ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
3182aca35d17SMatthew G. Knepley     }
3183aca35d17SMatthew G. Knepley   }
3184aca35d17SMatthew G. Knepley   CHKMEMQ;
3185766ab985SMatthew G. Knepley   /* Cleanup */
3186766ab985SMatthew G. Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
3187766ab985SMatthew G. Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
3188766ab985SMatthew G. Knepley   ierr = PetscFree(subCells);CHKERRQ(ierr);
3189766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
3190766ab985SMatthew G. Knepley }
3191766ab985SMatthew G. Knepley 
3192766ab985SMatthew G. Knepley #undef __FUNCT__
3193766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated"
31943982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DM subdm)
3195766ab985SMatthew G. Knepley {
31963982b651SMatthew G. Knepley   DMLabel        label = NULL;
3197766ab985SMatthew G. Knepley   PetscErrorCode ierr;
3198766ab985SMatthew G. Knepley 
3199766ab985SMatthew G. Knepley   PetscFunctionBegin;
32003982b651SMatthew G. Knepley   if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);}
32013982b651SMatthew G. Knepley   ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, label, value, PETSC_TRUE, subdm);CHKERRQ(ierr);
3202766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
3203766ab985SMatthew G. Knepley }
3204766ab985SMatthew G. Knepley 
3205766ab985SMatthew G. Knepley #undef __FUNCT__
3206766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh"
3207766ab985SMatthew G. Knepley /*
320827c04023SMatthew 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.
3209766ab985SMatthew G. Knepley 
3210766ab985SMatthew G. Knepley   Input Parameters:
3211766ab985SMatthew G. Knepley + dm          - The original mesh
321227c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells
32137afc1a8bSJed Brown . label       - A label name, or NULL
321427c04023SMatthew G. Knepley - value  - A label value
3215766ab985SMatthew G. Knepley 
3216766ab985SMatthew G. Knepley   Output Parameter:
3217766ab985SMatthew G. Knepley . subdm - The surface mesh
3218766ab985SMatthew G. Knepley 
3219766ab985SMatthew G. Knepley   Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap().
3220766ab985SMatthew G. Knepley 
3221766ab985SMatthew G. Knepley   Level: developer
3222766ab985SMatthew G. Knepley 
3223766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh()
3224766ab985SMatthew G. Knepley */
322527c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm)
3226766ab985SMatthew G. Knepley {
3227766ab985SMatthew G. Knepley   PetscInt       dim, depth;
3228766ab985SMatthew G. Knepley   PetscErrorCode ierr;
3229766ab985SMatthew G. Knepley 
3230766ab985SMatthew G. Knepley   PetscFunctionBegin;
3231766ab985SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
323227c04023SMatthew G. Knepley   PetscValidPointer(subdm, 5);
3233c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
3234766ab985SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3235766ab985SMatthew G. Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr);
3236766ab985SMatthew G. Knepley   ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr);
3237c73cfb54SMatthew G. Knepley   ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr);
3238766ab985SMatthew G. Knepley   if (depth == dim) {
3239b3154360SMatthew G. Knepley     ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr);
3240766ab985SMatthew G. Knepley   } else {
324127c04023SMatthew G. Knepley     ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr);
3242e6ccafaeSMatthew G Knepley   }
3243e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3244e6ccafaeSMatthew G Knepley }
3245e6ccafaeSMatthew G Knepley 
3246e6ccafaeSMatthew G Knepley #undef __FUNCT__
3247e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap"
324864beef6dSMatthew G. Knepley /*@
324964beef6dSMatthew G. Knepley   DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values
325064beef6dSMatthew G. Knepley 
325164beef6dSMatthew G. Knepley   Input Parameter:
325264beef6dSMatthew G. Knepley . dm - The submesh DM
325364beef6dSMatthew G. Knepley 
325464beef6dSMatthew G. Knepley   Output Parameter:
325564beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh
325664beef6dSMatthew G. Knepley 
325764beef6dSMatthew G. Knepley   Level: developer
325864beef6dSMatthew G. Knepley 
325964beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS()
326064beef6dSMatthew G. Knepley @*/
3261e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap)
3262e6ccafaeSMatthew G Knepley {
3263e6ccafaeSMatthew G Knepley   DM_Plex *mesh = (DM_Plex*) dm->data;
3264e6ccafaeSMatthew G Knepley 
3265e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3266e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3267e6ccafaeSMatthew G Knepley   PetscValidPointer(subpointMap, 2);
3268e6ccafaeSMatthew G Knepley   *subpointMap = mesh->subpointMap;
3269e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3270e6ccafaeSMatthew G Knepley }
3271e6ccafaeSMatthew G Knepley 
3272e6ccafaeSMatthew G Knepley #undef __FUNCT__
3273e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap"
3274e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */
3275e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap)
3276e6ccafaeSMatthew G Knepley {
3277e6ccafaeSMatthew G Knepley   DM_Plex       *mesh = (DM_Plex *) dm->data;
3278285d324eSMatthew G. Knepley   DMLabel        tmp;
3279e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
3280e6ccafaeSMatthew G Knepley 
3281e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3282e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3283285d324eSMatthew G. Knepley   tmp  = mesh->subpointMap;
3284e6ccafaeSMatthew G Knepley   mesh->subpointMap = subpointMap;
3285285d324eSMatthew G. Knepley   ++mesh->subpointMap->refct;
3286285d324eSMatthew G. Knepley   ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr);
3287e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3288e6ccafaeSMatthew G Knepley }
3289e6ccafaeSMatthew G Knepley 
3290e6ccafaeSMatthew G Knepley #undef __FUNCT__
3291e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS"
329264beef6dSMatthew G. Knepley /*@
3293e6ccafaeSMatthew G Knepley   DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data
3294e6ccafaeSMatthew G Knepley 
3295e6ccafaeSMatthew G Knepley   Input Parameter:
3296e6ccafaeSMatthew G Knepley . dm - The submesh DM
3297e6ccafaeSMatthew G Knepley 
3298e6ccafaeSMatthew G Knepley   Output Parameter:
32990298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh
3300e6ccafaeSMatthew G Knepley 
33013982b651SMatthew G. Knepley   Note: This IS is guaranteed to be sorted by the construction of the submesh
330264beef6dSMatthew G. Knepley 
330364beef6dSMatthew G. Knepley   Level: developer
330464beef6dSMatthew G. Knepley 
330564beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap()
330664beef6dSMatthew G. Knepley @*/
3307e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS)
3308e6ccafaeSMatthew G Knepley {
330982f516ccSBarry Smith   MPI_Comm        comm;
3310e6ccafaeSMatthew G Knepley   DMLabel         subpointMap;
3311e6ccafaeSMatthew G Knepley   IS              is;
3312e6ccafaeSMatthew G Knepley   const PetscInt *opoints;
3313e6ccafaeSMatthew G Knepley   PetscInt       *points, *depths;
3314e6ccafaeSMatthew G Knepley   PetscInt        depth, depStart, depEnd, d, pStart, pEnd, p, n, off;
3315e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
3316e6ccafaeSMatthew G Knepley 
3317e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3318e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3319e6ccafaeSMatthew G Knepley   PetscValidPointer(subpointIS, 2);
332082f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
33210298fd71SBarry Smith   *subpointIS = NULL;
3322e6ccafaeSMatthew G Knepley   ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr);
3323e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3324fed694aaSMatthew G. Knepley   if (subpointMap && depth >= 0) {
3325e6ccafaeSMatthew G Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
3326e6ccafaeSMatthew G Knepley     if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart);
3327e6ccafaeSMatthew G Knepley     ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr);
3328e6ccafaeSMatthew G Knepley     depths[0] = depth;
3329e6ccafaeSMatthew G Knepley     depths[1] = 0;
3330e6ccafaeSMatthew G Knepley     for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;}
3331785e854fSJed Brown     ierr = PetscMalloc1(pEnd, &points);CHKERRQ(ierr);
3332e6ccafaeSMatthew G Knepley     for(d = 0, off = 0; d <= depth; ++d) {
3333e6ccafaeSMatthew G Knepley       const PetscInt dep = depths[d];
3334e6ccafaeSMatthew G Knepley 
3335e6ccafaeSMatthew G Knepley       ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr);
3336e6ccafaeSMatthew G Knepley       ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr);
33371e21b6fdSMatthew G Knepley       if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */
3338e6ccafaeSMatthew 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);
3339e6ccafaeSMatthew G Knepley       } else {
33401e21b6fdSMatthew G Knepley         if (!n) {
33411e21b6fdSMatthew G Knepley           if (d == 0) {
33421e21b6fdSMatthew G Knepley             /* Missing cells */
33431e21b6fdSMatthew G Knepley             for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1;
33441e21b6fdSMatthew G Knepley           } else {
33451e21b6fdSMatthew G Knepley             /* Missing faces */
33461e21b6fdSMatthew G Knepley             for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT;
33471e21b6fdSMatthew G Knepley           }
33481e21b6fdSMatthew G Knepley         }
3349e6ccafaeSMatthew G Knepley       }
3350e6ccafaeSMatthew G Knepley       if (n) {
3351e6ccafaeSMatthew G Knepley         ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr);
3352e6ccafaeSMatthew G Knepley         ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr);
3353e6ccafaeSMatthew G Knepley         for(p = 0; p < n; ++p, ++off) points[off] = opoints[p];
3354e6ccafaeSMatthew G Knepley         ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr);
3355e6ccafaeSMatthew G Knepley         ierr = ISDestroy(&is);CHKERRQ(ierr);
3356e6ccafaeSMatthew G Knepley       }
3357e6ccafaeSMatthew G Knepley     }
3358e6ccafaeSMatthew G Knepley     ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr);
3359e6ccafaeSMatthew G Knepley     if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd);
3360fed694aaSMatthew G. Knepley     ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr);
3361e6ccafaeSMatthew G Knepley   }
3362e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3363e6ccafaeSMatthew G Knepley }
3364