xref: /petsc/src/dm/impls/plex/plexsubmesh.c (revision c0e8cf5feba7613dc70bf590bbd12888d6786eea)
1af0996ceSBarry Smith #include <petsc/private/dmpleximpl.h>    /*I      "petscdmplex.h"    I*/
2c58f1c22SToby Isaac #include <petsc/private/dmlabelimpl.h>   /*I      "petscdmlabel.h"   I*/
30c312b8eSJed Brown #include <petscsf.h>
4e6ccafaeSMatthew G Knepley 
5c08575a3SMatthew G. Knepley static PetscErrorCode DMPlexMarkBoundaryFaces_Internal(DM dm, PetscInt cellHeight, DMLabel label)
630560a7bSMatthew G. Knepley {
730560a7bSMatthew G. Knepley   PetscInt       fStart, fEnd, f;
830560a7bSMatthew G. Knepley   PetscErrorCode ierr;
930560a7bSMatthew G. Knepley 
1030560a7bSMatthew G. Knepley   PetscFunctionBegin;
1130560a7bSMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1230560a7bSMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, cellHeight+1, &fStart, &fEnd);CHKERRQ(ierr);
1330560a7bSMatthew G. Knepley   for (f = fStart; f < fEnd; ++f) {
1430560a7bSMatthew G. Knepley     PetscInt supportSize;
1530560a7bSMatthew G. Knepley 
1630560a7bSMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr);
1730560a7bSMatthew G. Knepley     if (supportSize == 1) {ierr = DMLabelSetValue(label, f, 1);CHKERRQ(ierr);}
1830560a7bSMatthew G. Knepley   }
1930560a7bSMatthew G. Knepley   PetscFunctionReturn(0);
2030560a7bSMatthew G. Knepley }
2130560a7bSMatthew G. Knepley 
22cd0c2139SMatthew G Knepley /*@
23cd0c2139SMatthew G Knepley   DMPlexMarkBoundaryFaces - Mark all faces on the boundary
24cd0c2139SMatthew G Knepley 
25cd0c2139SMatthew G Knepley   Not Collective
26cd0c2139SMatthew G Knepley 
27cd0c2139SMatthew G Knepley   Input Parameter:
28cd0c2139SMatthew G Knepley . dm - The original DM
29cd0c2139SMatthew G Knepley 
30cd0c2139SMatthew G Knepley   Output Parameter:
31cd0c2139SMatthew G Knepley . label - The DMLabel marking boundary faces with value 1
32cd0c2139SMatthew G Knepley 
33cd0c2139SMatthew G Knepley   Level: developer
34cd0c2139SMatthew G Knepley 
35c58f1c22SToby Isaac .seealso: DMLabelCreate(), DMCreateLabel()
3609f723d9SJed Brown @*/
37cd0c2139SMatthew G Knepley PetscErrorCode DMPlexMarkBoundaryFaces(DM dm, DMLabel label)
38cd0c2139SMatthew G Knepley {
39cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
40cd0c2139SMatthew G Knepley 
41cd0c2139SMatthew G Knepley   PetscFunctionBegin;
4274e03af4SMatthew G. Knepley   ierr = DMPlexMarkBoundaryFaces_Internal(dm, 0, label);CHKERRQ(ierr);
43cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
44cd0c2139SMatthew G Knepley }
45cd0c2139SMatthew G Knepley 
46c08575a3SMatthew G. Knepley static PetscErrorCode DMPlexLabelComplete_Internal(DM dm, DMLabel label, PetscBool completeCells)
47b0bf5782SToby Isaac {
48b0bf5782SToby Isaac   IS              valueIS;
49b0bf5782SToby Isaac   const PetscInt *values;
50b0bf5782SToby Isaac   PetscInt        numValues, v, cStart, cEnd;
51b0bf5782SToby Isaac   PetscErrorCode  ierr;
52b0bf5782SToby Isaac 
53b0bf5782SToby Isaac   PetscFunctionBegin;
54b0bf5782SToby Isaac   ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr);
55b0bf5782SToby Isaac   ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
56b0bf5782SToby Isaac   ierr = DMPlexGetHeightStratum(dm,0,&cStart,&cEnd);CHKERRQ(ierr);
57b0bf5782SToby Isaac   ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
58b0bf5782SToby Isaac   for (v = 0; v < numValues; ++v) {
59b0bf5782SToby Isaac     IS              pointIS;
60b0bf5782SToby Isaac     const PetscInt *points;
61b0bf5782SToby Isaac     PetscInt        numPoints, p;
62b0bf5782SToby Isaac 
63b0bf5782SToby Isaac     ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr);
64b0bf5782SToby Isaac     ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr);
65b0bf5782SToby Isaac     ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
66b0bf5782SToby Isaac     for (p = 0; p < numPoints; ++p) {
67b0bf5782SToby Isaac       PetscInt  q = points[p];
68b0bf5782SToby Isaac       PetscInt *closure = NULL;
69b0bf5782SToby Isaac       PetscInt  closureSize, c;
70b0bf5782SToby Isaac 
71b0bf5782SToby Isaac       if (cStart <= q && q < cEnd && !completeCells) { /* skip cells */
72b0bf5782SToby Isaac         continue;
73b0bf5782SToby Isaac       }
74b0bf5782SToby Isaac       ierr = DMPlexGetTransitiveClosure(dm, q, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
75b0bf5782SToby Isaac       for (c = 0; c < closureSize*2; c += 2) {
76b0bf5782SToby Isaac         ierr = DMLabelSetValue(label, closure[c], values[v]);CHKERRQ(ierr);
77b0bf5782SToby Isaac       }
78b0bf5782SToby Isaac       ierr = DMPlexRestoreTransitiveClosure(dm, q, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
79b0bf5782SToby Isaac     }
80b0bf5782SToby Isaac     ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);
81b0bf5782SToby Isaac     ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
82b0bf5782SToby Isaac   }
83b0bf5782SToby Isaac   ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
84b0bf5782SToby Isaac   ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
85b0bf5782SToby Isaac   PetscFunctionReturn(0);
86b0bf5782SToby Isaac }
87b0bf5782SToby Isaac 
882be2b188SMatthew G Knepley /*@
892be2b188SMatthew G Knepley   DMPlexLabelComplete - Starting with a label marking points on a surface, we add the transitive closure to the surface
902be2b188SMatthew G Knepley 
912be2b188SMatthew G Knepley   Input Parameters:
922be2b188SMatthew G Knepley + dm - The DM
932be2b188SMatthew G Knepley - label - A DMLabel marking the surface points
942be2b188SMatthew G Knepley 
952be2b188SMatthew G Knepley   Output Parameter:
962be2b188SMatthew G Knepley . label - A DMLabel marking all surface points in the transitive closure
972be2b188SMatthew G Knepley 
982be2b188SMatthew G Knepley   Level: developer
992be2b188SMatthew G Knepley 
1002be2b188SMatthew G Knepley .seealso: DMPlexLabelCohesiveComplete()
1012be2b188SMatthew G Knepley @*/
1022be2b188SMatthew G Knepley PetscErrorCode DMPlexLabelComplete(DM dm, DMLabel label)
1032be2b188SMatthew G Knepley {
1042be2b188SMatthew G Knepley   PetscErrorCode ierr;
1052be2b188SMatthew G Knepley 
1062be2b188SMatthew G Knepley   PetscFunctionBegin;
107b0bf5782SToby Isaac   ierr = DMPlexLabelComplete_Internal(dm, label, PETSC_TRUE);CHKERRQ(ierr);
1082be2b188SMatthew G Knepley   PetscFunctionReturn(0);
1092be2b188SMatthew G Knepley }
1102be2b188SMatthew G Knepley 
1116cf0e42fSMatthew G. Knepley /*@
1126cf0e42fSMatthew G. Knepley   DMPlexLabelAddCells - Starting with a label marking faces on a surface, we add a cell for each face
1136cf0e42fSMatthew G. Knepley 
1146cf0e42fSMatthew G. Knepley   Input Parameters:
1156cf0e42fSMatthew G. Knepley + dm - The DM
1166cf0e42fSMatthew G. Knepley - label - A DMLabel marking the surface points
1176cf0e42fSMatthew G. Knepley 
1186cf0e42fSMatthew G. Knepley   Output Parameter:
1196cf0e42fSMatthew G. Knepley . label - A DMLabel incorporating cells
1206cf0e42fSMatthew G. Knepley 
1216cf0e42fSMatthew G. Knepley   Level: developer
1226cf0e42fSMatthew G. Knepley 
1236cf0e42fSMatthew G. Knepley   Note: The cells allow FEM boundary conditions to be applied using the cell geometry
1246cf0e42fSMatthew G. Knepley 
1256cf0e42fSMatthew G. Knepley .seealso: DMPlexLabelComplete(), DMPlexLabelCohesiveComplete()
1266cf0e42fSMatthew G. Knepley @*/
1276cf0e42fSMatthew G. Knepley PetscErrorCode DMPlexLabelAddCells(DM dm, DMLabel label)
1286cf0e42fSMatthew G. Knepley {
1296cf0e42fSMatthew G. Knepley   IS              valueIS;
1306cf0e42fSMatthew G. Knepley   const PetscInt *values;
13122eabd52SMatthew G. Knepley   PetscInt        numValues, v, cStart, cEnd, cEndInterior;
1326cf0e42fSMatthew G. Knepley   PetscErrorCode  ierr;
1336cf0e42fSMatthew G. Knepley 
1346cf0e42fSMatthew G. Knepley   PetscFunctionBegin;
1356cf0e42fSMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
13622eabd52SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cEndInterior, NULL, NULL, NULL);CHKERRQ(ierr);
13722eabd52SMatthew G. Knepley   cEnd = cEndInterior < 0 ? cEnd : cEndInterior;
1386cf0e42fSMatthew G. Knepley   ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr);
1396cf0e42fSMatthew G. Knepley   ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
1406cf0e42fSMatthew G. Knepley   ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
1416cf0e42fSMatthew G. Knepley   for (v = 0; v < numValues; ++v) {
1426cf0e42fSMatthew G. Knepley     IS              pointIS;
1436cf0e42fSMatthew G. Knepley     const PetscInt *points;
1446cf0e42fSMatthew G. Knepley     PetscInt        numPoints, p;
1456cf0e42fSMatthew G. Knepley 
1466cf0e42fSMatthew G. Knepley     ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr);
1476cf0e42fSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr);
1486cf0e42fSMatthew G. Knepley     ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
1496cf0e42fSMatthew G. Knepley     for (p = 0; p < numPoints; ++p) {
1506cf0e42fSMatthew G. Knepley       PetscInt *closure = NULL;
15122eabd52SMatthew G. Knepley       PetscInt  closureSize, point, cl;
1526cf0e42fSMatthew G. Knepley 
1536cf0e42fSMatthew G. Knepley       ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr);
15422eabd52SMatthew G. Knepley       for (cl = closureSize-1; cl > 0; --cl) {
15522eabd52SMatthew G. Knepley         point = closure[cl*2];
15622eabd52SMatthew G. Knepley         if ((point >= cStart) && (point < cEnd)) {ierr = DMLabelSetValue(label, point, values[v]);CHKERRQ(ierr); break;}
15722eabd52SMatthew G. Knepley       }
1586cf0e42fSMatthew G. Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr);
1596cf0e42fSMatthew G. Knepley     }
1606cf0e42fSMatthew G. Knepley     ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);
1616cf0e42fSMatthew G. Knepley     ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
1626cf0e42fSMatthew G. Knepley   }
1636cf0e42fSMatthew G. Knepley   ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
1646cf0e42fSMatthew G. Knepley   ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
1656cf0e42fSMatthew G. Knepley   PetscFunctionReturn(0);
1666cf0e42fSMatthew G. Knepley }
1676cf0e42fSMatthew G. Knepley 
168f402d5e4SToby Isaac /*@
169f402d5e4SToby Isaac   DMPlexLabelClearCells - Remove cells from a label
170f402d5e4SToby Isaac 
171f402d5e4SToby Isaac   Input Parameters:
172f402d5e4SToby Isaac + dm - The DM
173f402d5e4SToby Isaac - label - A DMLabel marking surface points and their adjacent cells
174f402d5e4SToby Isaac 
175f402d5e4SToby Isaac   Output Parameter:
176f402d5e4SToby Isaac . label - A DMLabel without cells
177f402d5e4SToby Isaac 
178f402d5e4SToby Isaac   Level: developer
179f402d5e4SToby Isaac 
180f402d5e4SToby Isaac   Note: This undoes DMPlexLabelAddCells()
181f402d5e4SToby Isaac 
182f402d5e4SToby Isaac .seealso: DMPlexLabelComplete(), DMPlexLabelCohesiveComplete(), DMPlexLabelAddCells()
183f402d5e4SToby Isaac @*/
184f402d5e4SToby Isaac PetscErrorCode DMPlexLabelClearCells(DM dm, DMLabel label)
185f402d5e4SToby Isaac {
186f402d5e4SToby Isaac   IS              valueIS;
187f402d5e4SToby Isaac   const PetscInt *values;
188f402d5e4SToby Isaac   PetscInt        numValues, v, cStart, cEnd, cEndInterior;
189f402d5e4SToby Isaac   PetscErrorCode  ierr;
190f402d5e4SToby Isaac 
191f402d5e4SToby Isaac   PetscFunctionBegin;
192f402d5e4SToby Isaac   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
193f402d5e4SToby Isaac   ierr = DMPlexGetHybridBounds(dm, &cEndInterior, NULL, NULL, NULL);CHKERRQ(ierr);
194f402d5e4SToby Isaac   cEnd = cEndInterior < 0 ? cEnd : cEndInterior;
195f402d5e4SToby Isaac   ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr);
196f402d5e4SToby Isaac   ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
197f402d5e4SToby Isaac   ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
198f402d5e4SToby Isaac   for (v = 0; v < numValues; ++v) {
199f402d5e4SToby Isaac     IS              pointIS;
200f402d5e4SToby Isaac     const PetscInt *points;
201f402d5e4SToby Isaac     PetscInt        numPoints, p;
202f402d5e4SToby Isaac 
203f402d5e4SToby Isaac     ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr);
204f402d5e4SToby Isaac     ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr);
205f402d5e4SToby Isaac     ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
206f402d5e4SToby Isaac     for (p = 0; p < numPoints; ++p) {
207f402d5e4SToby Isaac       PetscInt point = points[p];
208f402d5e4SToby Isaac 
209f402d5e4SToby Isaac       if (point >= cStart && point < cEnd) {
210f402d5e4SToby Isaac         ierr = DMLabelClearValue(label,point,values[v]);CHKERRQ(ierr);
211f402d5e4SToby Isaac       }
212f402d5e4SToby Isaac     }
213f402d5e4SToby Isaac     ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);
214f402d5e4SToby Isaac     ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
215f402d5e4SToby Isaac   }
216f402d5e4SToby Isaac   ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
217f402d5e4SToby Isaac   ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
218f402d5e4SToby Isaac   PetscFunctionReturn(0);
219f402d5e4SToby Isaac }
220f402d5e4SToby Isaac 
22159eef20bSToby Isaac /* take (oldEnd, added) pairs, ordered by height and convert them to (oldstart, newstart) pairs, ordered by ascending
22259eef20bSToby Isaac  * index (skipping first, which is (0,0)) */
2232582d50cSToby Isaac PETSC_STATIC_INLINE PetscErrorCode DMPlexShiftPointSetUp_Internal(PetscInt depth, PetscInt depthShift[])
224cd0c2139SMatthew G Knepley {
2252582d50cSToby Isaac   PetscInt d, off = 0;
2262582d50cSToby Isaac 
2272582d50cSToby Isaac   PetscFunctionBegin;
22859eef20bSToby Isaac   /* sort by (oldend): yes this is an O(n^2) sort, we expect depth <= 3 */
2290974a383SToby Isaac   for (d = 0; d < depth; d++) {
2302582d50cSToby Isaac     PetscInt firstd = d;
2310974a383SToby Isaac     PetscInt firstStart = depthShift[2*d];
2322582d50cSToby Isaac     PetscInt e;
2332582d50cSToby Isaac 
2342582d50cSToby Isaac     for (e = d+1; e <= depth; e++) {
2352582d50cSToby Isaac       if (depthShift[2*e] < firstStart) {
2362582d50cSToby Isaac         firstd = e;
2372582d50cSToby Isaac         firstStart = depthShift[2*d];
2382582d50cSToby Isaac       }
2392582d50cSToby Isaac     }
2402582d50cSToby Isaac     if (firstd != d) {
2412582d50cSToby Isaac       PetscInt swap[2];
2422582d50cSToby Isaac 
2432582d50cSToby Isaac       e = firstd;
2442582d50cSToby Isaac       swap[0] = depthShift[2*d];
2452582d50cSToby Isaac       swap[1] = depthShift[2*d+1];
2462582d50cSToby Isaac       depthShift[2*d]   = depthShift[2*e];
2472582d50cSToby Isaac       depthShift[2*d+1] = depthShift[2*e+1];
2482582d50cSToby Isaac       depthShift[2*e]   = swap[0];
2492582d50cSToby Isaac       depthShift[2*e+1] = swap[1];
2502582d50cSToby Isaac     }
2512582d50cSToby Isaac   }
2522582d50cSToby Isaac   /* convert (oldstart, added) to (oldstart, newstart) */
2530974a383SToby Isaac   for (d = 0; d <= depth; d++) {
2542582d50cSToby Isaac     off += depthShift[2*d+1];
25559eef20bSToby Isaac     depthShift[2*d+1] = depthShift[2*d] + off;
2562582d50cSToby Isaac   }
2572582d50cSToby Isaac   PetscFunctionReturn(0);
2582582d50cSToby Isaac }
2592582d50cSToby Isaac 
2602582d50cSToby Isaac /* depthShift is a list of (old, new) pairs */
2612582d50cSToby Isaac PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthShift[])
2622582d50cSToby Isaac {
2632582d50cSToby Isaac   PetscInt d;
2642582d50cSToby Isaac   PetscInt newOff = 0;
2652582d50cSToby Isaac 
2662582d50cSToby Isaac   for (d = 0; d <= depth; d++) {
2672582d50cSToby Isaac     if (p < depthShift[2*d]) return p + newOff;
2682582d50cSToby Isaac     else newOff = depthShift[2*d+1] - depthShift[2*d];
2692582d50cSToby Isaac   }
2700974a383SToby Isaac   return p + newOff;
2712582d50cSToby Isaac }
2722582d50cSToby Isaac 
2732582d50cSToby Isaac /* depthShift is a list of (old, new) pairs */
2742582d50cSToby Isaac PETSC_STATIC_INLINE PetscInt DMPlexShiftPointInverse_Internal(PetscInt p, PetscInt depth, PetscInt depthShift[])
2752582d50cSToby Isaac {
2762582d50cSToby Isaac   PetscInt d;
2772582d50cSToby Isaac   PetscInt newOff = 0;
2782582d50cSToby Isaac 
2792582d50cSToby Isaac   for (d = 0; d <= depth; d++) {
2802582d50cSToby Isaac     if (p < depthShift[2*d+1]) return p + newOff;
2812582d50cSToby Isaac     else newOff = depthShift[2*d] - depthShift[2*d+1];
2822582d50cSToby Isaac   }
2830974a383SToby Isaac   return p + newOff;
284cd0c2139SMatthew G Knepley }
285cd0c2139SMatthew G Knepley 
286cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew)
287cd0c2139SMatthew G Knepley {
288cd0c2139SMatthew G Knepley   PetscInt       depth = 0, d, pStart, pEnd, p;
289cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
290cd0c2139SMatthew G Knepley 
291cd0c2139SMatthew G Knepley   PetscFunctionBegin;
292cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
293cd0c2139SMatthew G Knepley   if (depth < 0) PetscFunctionReturn(0);
294cd0c2139SMatthew G Knepley   /* Step 1: Expand chart */
295cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
2960974a383SToby Isaac   pEnd = DMPlexShiftPoint_Internal(pEnd,depth,depthShift);
297cd0c2139SMatthew G Knepley   ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr);
298cd0c2139SMatthew G Knepley   /* Step 2: Set cone and support sizes */
299cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
300cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr);
301cd0c2139SMatthew G Knepley     for (p = pStart; p < pEnd; ++p) {
3022582d50cSToby Isaac       PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthShift);
303cd0c2139SMatthew G Knepley       PetscInt size;
304cd0c2139SMatthew G Knepley 
305cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr);
306cd0c2139SMatthew G Knepley       ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr);
307cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr);
308cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr);
309cd0c2139SMatthew G Knepley     }
310cd0c2139SMatthew G Knepley   }
311cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
312cd0c2139SMatthew G Knepley }
313cd0c2139SMatthew G Knepley 
314cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew)
315cd0c2139SMatthew G Knepley {
3162582d50cSToby Isaac   PetscInt      *newpoints;
3172582d50cSToby Isaac   PetscInt       depth = 0, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, pStart, pEnd, p;
318cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
319cd0c2139SMatthew G Knepley 
320cd0c2139SMatthew G Knepley   PetscFunctionBegin;
321cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
322cd0c2139SMatthew G Knepley   if (depth < 0) PetscFunctionReturn(0);
323cd0c2139SMatthew G Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
324dcbb62e8SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dmNew, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr);
3252582d50cSToby Isaac   ierr = PetscMalloc1(PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),&newpoints);CHKERRQ(ierr);
326cd0c2139SMatthew G Knepley   /* Step 5: Set cones and supports */
327cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
328cd0c2139SMatthew G Knepley   for (p = pStart; p < pEnd; ++p) {
329cd0c2139SMatthew G Knepley     const PetscInt *points = NULL, *orientations = NULL;
3302582d50cSToby Isaac     PetscInt        size,sizeNew, i, newp = DMPlexShiftPoint_Internal(p, depth, depthShift);
331cd0c2139SMatthew G Knepley 
332cd0c2139SMatthew G Knepley     ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr);
333cd0c2139SMatthew G Knepley     ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr);
334cd0c2139SMatthew G Knepley     ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr);
335cd0c2139SMatthew G Knepley     for (i = 0; i < size; ++i) {
3362582d50cSToby Isaac       newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthShift);
337cd0c2139SMatthew G Knepley     }
338cd0c2139SMatthew G Knepley     ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr);
339cd0c2139SMatthew G Knepley     ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr);
340cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr);
341dcbb62e8SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dmNew, newp, &sizeNew);CHKERRQ(ierr);
342cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr);
343cd0c2139SMatthew G Knepley     for (i = 0; i < size; ++i) {
3442582d50cSToby Isaac       newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthShift);
345cd0c2139SMatthew G Knepley     }
346dcbb62e8SMatthew G. Knepley     for (i = size; i < sizeNew; ++i) newpoints[i] = 0;
347cd0c2139SMatthew G Knepley     ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr);
348cd0c2139SMatthew G Knepley   }
3492582d50cSToby Isaac   ierr = PetscFree(newpoints);CHKERRQ(ierr);
350cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
351cd0c2139SMatthew G Knepley }
352cd0c2139SMatthew G Knepley 
353cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew)
354cd0c2139SMatthew G Knepley {
355cd0c2139SMatthew G Knepley   PetscSection   coordSection, newCoordSection;
356cd0c2139SMatthew G Knepley   Vec            coordinates, newCoordinates;
357cd0c2139SMatthew G Knepley   PetscScalar   *coords, *newCoords;
358f2b8cce1SMatthew G. Knepley   PetscInt       coordSize, sStart, sEnd;
359f2b8cce1SMatthew G. Knepley   PetscInt       dim, depth = 0, cStart, cEnd, cStartNew, cEndNew, c, vStart, vEnd, vStartNew, vEndNew, v;
360f2b8cce1SMatthew G. Knepley   PetscBool      hasCells;
361cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
362cd0c2139SMatthew G Knepley 
363cd0c2139SMatthew G Knepley   PetscFunctionBegin;
364f2b8cce1SMatthew G. Knepley   ierr = DMGetCoordinateDim(dm, &dim);CHKERRQ(ierr);
365*c0e8cf5fSMatthew G. Knepley   ierr = DMSetCoordinateDim(dmNew, dim);CHKERRQ(ierr);
366cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
367cd0c2139SMatthew G Knepley   /* Step 8: Convert coordinates */
368cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
369f2b8cce1SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
370cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr);
371f2b8cce1SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dmNew, 0, &cStartNew, &cEndNew);CHKERRQ(ierr);
37269d8a9ceSMatthew G. Knepley   ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
373cd0c2139SMatthew G Knepley   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr);
374cd0c2139SMatthew G Knepley   ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr);
375cd0c2139SMatthew G Knepley   ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr);
376f2b8cce1SMatthew G. Knepley   ierr = PetscSectionGetChart(coordSection, &sStart, &sEnd);CHKERRQ(ierr);
377f2b8cce1SMatthew G. Knepley   hasCells = sStart == cStart ? PETSC_TRUE : PETSC_FALSE;
378f2b8cce1SMatthew G. Knepley   ierr = PetscSectionSetChart(newCoordSection, hasCells ? cStartNew : vStartNew, vEndNew);CHKERRQ(ierr);
379f2b8cce1SMatthew G. Knepley   if (hasCells) {
380f2b8cce1SMatthew G. Knepley     for (c = cStart; c < cEnd; ++c) {
381f2b8cce1SMatthew G. Knepley       PetscInt cNew = DMPlexShiftPoint_Internal(c, depth, depthShift), dof;
382f2b8cce1SMatthew G. Knepley 
383f2b8cce1SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, c, &dof);CHKERRQ(ierr);
384f2b8cce1SMatthew G. Knepley       ierr = PetscSectionSetDof(newCoordSection, cNew, dof);CHKERRQ(ierr);
385f2b8cce1SMatthew G. Knepley       ierr = PetscSectionSetFieldDof(newCoordSection, cNew, 0, dof);CHKERRQ(ierr);
386f2b8cce1SMatthew G. Knepley     }
387f2b8cce1SMatthew G. Knepley   }
388cd0c2139SMatthew G Knepley   for (v = vStartNew; v < vEndNew; ++v) {
389cd0c2139SMatthew G Knepley     ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr);
390cd0c2139SMatthew G Knepley     ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr);
391cd0c2139SMatthew G Knepley   }
392cd0c2139SMatthew G Knepley   ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr);
39346e270d4SMatthew G. Knepley   ierr = DMSetCoordinateSection(dmNew, PETSC_DETERMINE, newCoordSection);CHKERRQ(ierr);
394cd0c2139SMatthew G Knepley   ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr);
3958b9ced59SLisandro Dalcin   ierr = VecCreate(PETSC_COMM_SELF, &newCoordinates);CHKERRQ(ierr);
396cd0c2139SMatthew G Knepley   ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr);
397cd0c2139SMatthew G Knepley   ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
3984e90ef8eSMatthew G. Knepley   ierr = VecSetBlockSize(newCoordinates, dim);CHKERRQ(ierr);
3992eb5907fSJed Brown   ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr);
400cd0c2139SMatthew G Knepley   ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr);
401cd0c2139SMatthew G Knepley   ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
402cd0c2139SMatthew G Knepley   ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
403cd0c2139SMatthew G Knepley   ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr);
404f2b8cce1SMatthew G. Knepley   if (hasCells) {
405f2b8cce1SMatthew G. Knepley     for (c = cStart; c < cEnd; ++c) {
406f2b8cce1SMatthew G. Knepley       PetscInt cNew = DMPlexShiftPoint_Internal(c, depth, depthShift), dof, off, noff, d;
407f2b8cce1SMatthew G. Knepley 
408f2b8cce1SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, c, &dof);CHKERRQ(ierr);
409f2b8cce1SMatthew G. Knepley       ierr = PetscSectionGetOffset(coordSection, c, &off);CHKERRQ(ierr);
410f2b8cce1SMatthew G. Knepley       ierr = PetscSectionGetOffset(newCoordSection, cNew, &noff);CHKERRQ(ierr);
411f2b8cce1SMatthew G. Knepley       for (d = 0; d < dof; ++d) newCoords[noff+d] = coords[off+d];
412f2b8cce1SMatthew G. Knepley     }
413f2b8cce1SMatthew G. Knepley   }
414cd0c2139SMatthew G Knepley   for (v = vStart; v < vEnd; ++v) {
415cd0c2139SMatthew G Knepley     PetscInt dof, off, noff, d;
416cd0c2139SMatthew G Knepley 
417cd0c2139SMatthew G Knepley     ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr);
418cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
4192582d50cSToby Isaac     ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthShift), &noff);CHKERRQ(ierr);
420f2b8cce1SMatthew G. Knepley     for (d = 0; d < dof; ++d) newCoords[noff+d] = coords[off+d];
421cd0c2139SMatthew G Knepley   }
422cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
423cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr);
424cd0c2139SMatthew G Knepley   ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr);
425cd0c2139SMatthew G Knepley   ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr);
426cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
427cd0c2139SMatthew G Knepley }
428cd0c2139SMatthew G Knepley 
429cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew)
430cd0c2139SMatthew G Knepley {
4312582d50cSToby Isaac   PetscInt           depth = 0;
432cd0c2139SMatthew G Knepley   PetscSF            sfPoint, sfPointNew;
433cd0c2139SMatthew G Knepley   const PetscSFNode *remotePoints;
434cd0c2139SMatthew G Knepley   PetscSFNode       *gremotePoints;
435cd0c2139SMatthew G Knepley   const PetscInt    *localPoints;
436cd0c2139SMatthew G Knepley   PetscInt          *glocalPoints, *newLocation, *newRemoteLocation;
437cd0c2139SMatthew G Knepley   PetscInt           numRoots, numLeaves, l, pStart, pEnd, totShift = 0;
438cd0c2139SMatthew G Knepley   PetscErrorCode     ierr;
439cd0c2139SMatthew G Knepley 
440cd0c2139SMatthew G Knepley   PetscFunctionBegin;
441cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
442cd0c2139SMatthew G Knepley   /* Step 9: Convert pointSF */
443cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
444cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr);
445cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
446cd0c2139SMatthew G Knepley   ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
4476e21efdcSToby Isaac   totShift = DMPlexShiftPoint_Internal(pEnd,depth,depthShift) - pEnd;
448cd0c2139SMatthew G Knepley   if (numRoots >= 0) {
449dcca6d9dSJed Brown     ierr = PetscMalloc2(numRoots,&newLocation,pEnd-pStart,&newRemoteLocation);CHKERRQ(ierr);
4502582d50cSToby Isaac     for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthShift);
451cd0c2139SMatthew G Knepley     ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr);
452cd0c2139SMatthew G Knepley     ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr);
453785e854fSJed Brown     ierr = PetscMalloc1(numLeaves,    &glocalPoints);CHKERRQ(ierr);
454785e854fSJed Brown     ierr = PetscMalloc1(numLeaves, &gremotePoints);CHKERRQ(ierr);
455cd0c2139SMatthew G Knepley     for (l = 0; l < numLeaves; ++l) {
4562582d50cSToby Isaac       glocalPoints[l]        = DMPlexShiftPoint_Internal(localPoints[l], depth, depthShift);
457cd0c2139SMatthew G Knepley       gremotePoints[l].rank  = remotePoints[l].rank;
458cd0c2139SMatthew G Knepley       gremotePoints[l].index = newRemoteLocation[localPoints[l]];
459cd0c2139SMatthew G Knepley     }
460cd0c2139SMatthew G Knepley     ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr);
461cd0c2139SMatthew G Knepley     ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
462cd0c2139SMatthew G Knepley   }
463cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
464cd0c2139SMatthew G Knepley }
465cd0c2139SMatthew G Knepley 
466cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew)
467cd0c2139SMatthew G Knepley {
468cd0c2139SMatthew G Knepley   PetscSF            sfPoint;
469cd0c2139SMatthew G Knepley   DMLabel            vtkLabel, ghostLabel;
470cd0c2139SMatthew G Knepley   const PetscSFNode *leafRemote;
471cd0c2139SMatthew G Knepley   const PetscInt    *leafLocal;
4722582d50cSToby Isaac   PetscInt           depth = 0, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f;
473cd0c2139SMatthew G Knepley   PetscMPIInt        rank;
474cd0c2139SMatthew G Knepley   PetscErrorCode     ierr;
475cd0c2139SMatthew G Knepley 
476cd0c2139SMatthew G Knepley   PetscFunctionBegin;
477cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
478cd0c2139SMatthew G Knepley   /* Step 10: Convert labels */
479c58f1c22SToby Isaac   ierr = DMGetNumLabels(dm, &numLabels);CHKERRQ(ierr);
480cd0c2139SMatthew G Knepley   for (l = 0; l < numLabels; ++l) {
481cd0c2139SMatthew G Knepley     DMLabel         label, newlabel;
482cd0c2139SMatthew G Knepley     const char     *lname;
483cd0c2139SMatthew G Knepley     PetscBool       isDepth;
484cd0c2139SMatthew G Knepley     IS              valueIS;
485cd0c2139SMatthew G Knepley     const PetscInt *values;
486cd0c2139SMatthew G Knepley     PetscInt        numValues, val;
487cd0c2139SMatthew G Knepley 
488c58f1c22SToby Isaac     ierr = DMGetLabelName(dm, l, &lname);CHKERRQ(ierr);
489cd0c2139SMatthew G Knepley     ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr);
490cd0c2139SMatthew G Knepley     if (isDepth) continue;
491c58f1c22SToby Isaac     ierr = DMCreateLabel(dmNew, lname);CHKERRQ(ierr);
492c58f1c22SToby Isaac     ierr = DMGetLabel(dm, lname, &label);CHKERRQ(ierr);
493c58f1c22SToby Isaac     ierr = DMGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr);
49464a6a1a4SToby Isaac     ierr = DMLabelGetDefaultValue(label,&val);CHKERRQ(ierr);
49564a6a1a4SToby Isaac     ierr = DMLabelSetDefaultValue(newlabel,val);CHKERRQ(ierr);
496cd0c2139SMatthew G Knepley     ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
497cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr);
498cd0c2139SMatthew G Knepley     ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
499cd0c2139SMatthew G Knepley     for (val = 0; val < numValues; ++val) {
500cd0c2139SMatthew G Knepley       IS              pointIS;
501cd0c2139SMatthew G Knepley       const PetscInt *points;
502cd0c2139SMatthew G Knepley       PetscInt        numPoints, p;
503cd0c2139SMatthew G Knepley 
504cd0c2139SMatthew G Knepley       ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr);
505cd0c2139SMatthew G Knepley       ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);
506cd0c2139SMatthew G Knepley       ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
507cd0c2139SMatthew G Knepley       for (p = 0; p < numPoints; ++p) {
5082582d50cSToby Isaac         const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthShift);
509cd0c2139SMatthew G Knepley 
510cd0c2139SMatthew G Knepley         ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr);
511cd0c2139SMatthew G Knepley       }
512cd0c2139SMatthew G Knepley       ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);
513cd0c2139SMatthew G Knepley       ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
514cd0c2139SMatthew G Knepley     }
515cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
516cd0c2139SMatthew G Knepley     ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
517cd0c2139SMatthew G Knepley   }
518cd0c2139SMatthew G Knepley   /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */
519cd0c2139SMatthew G Knepley   ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr);
520cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
521cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
522cd0c2139SMatthew G Knepley   ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr);
523c58f1c22SToby Isaac   ierr = DMCreateLabel(dmNew, "vtk");CHKERRQ(ierr);
524c58f1c22SToby Isaac   ierr = DMCreateLabel(dmNew, "ghost");CHKERRQ(ierr);
525c58f1c22SToby Isaac   ierr = DMGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr);
526c58f1c22SToby Isaac   ierr = DMGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr);
527cd0c2139SMatthew G Knepley   for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) {
528cd0c2139SMatthew G Knepley     for (; c < leafLocal[l] && c < cEnd; ++c) {
529cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
530cd0c2139SMatthew G Knepley     }
531cd0c2139SMatthew G Knepley     if (leafLocal[l] >= cEnd) break;
532cd0c2139SMatthew G Knepley     if (leafRemote[l].rank == rank) {
533cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
534cd0c2139SMatthew G Knepley     } else {
535cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr);
536cd0c2139SMatthew G Knepley     }
537cd0c2139SMatthew G Knepley   }
538cd0c2139SMatthew G Knepley   for (; c < cEnd; ++c) {
539cd0c2139SMatthew G Knepley     ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
540cd0c2139SMatthew G Knepley   }
541cd0c2139SMatthew G Knepley   if (0) {
542cd0c2139SMatthew G Knepley     ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
543cd0c2139SMatthew G Knepley   }
544cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr);
545cd0c2139SMatthew G Knepley   for (f = fStart; f < fEnd; ++f) {
546cd0c2139SMatthew G Knepley     PetscInt numCells;
547cd0c2139SMatthew G Knepley 
548cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr);
549cd0c2139SMatthew G Knepley     if (numCells < 2) {
550cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);
551cd0c2139SMatthew G Knepley     } else {
552cd0c2139SMatthew G Knepley       const PetscInt *cells = NULL;
553cd0c2139SMatthew G Knepley       PetscInt        vA, vB;
554cd0c2139SMatthew G Knepley 
555cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr);
556cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr);
557cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr);
55890664b96SToby Isaac       if (vA != 1 && vB != 1) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);}
559cd0c2139SMatthew G Knepley     }
560cd0c2139SMatthew G Knepley   }
561cd0c2139SMatthew G Knepley   if (0) {
562cd0c2139SMatthew G Knepley     ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
563cd0c2139SMatthew G Knepley   }
564cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
565cd0c2139SMatthew G Knepley }
566cd0c2139SMatthew G Knepley 
567ca04dac2SToby Isaac static PetscErrorCode DMPlexShiftTree_Internal(DM dm, PetscInt depthShift[], DM dmNew)
568ca04dac2SToby Isaac {
569ca04dac2SToby Isaac   DM             refTree;
570ca04dac2SToby Isaac   PetscSection   pSec;
571ca04dac2SToby Isaac   PetscInt       *parents, *childIDs;
572ca04dac2SToby Isaac   PetscErrorCode ierr;
573ca04dac2SToby Isaac 
574ca04dac2SToby Isaac   PetscFunctionBegin;
575ca04dac2SToby Isaac   ierr = DMPlexGetReferenceTree(dm,&refTree);CHKERRQ(ierr);
576ca04dac2SToby Isaac   ierr = DMPlexSetReferenceTree(dmNew,refTree);CHKERRQ(ierr);
577ca04dac2SToby Isaac   ierr = DMPlexGetTree(dm,&pSec,&parents,&childIDs,NULL,NULL);CHKERRQ(ierr);
578ca04dac2SToby Isaac   if (pSec) {
5792582d50cSToby Isaac     PetscInt p, pStart, pEnd, *parentsShifted, pStartShifted, pEndShifted, depth;
580fb4630b5SToby Isaac     PetscInt *childIDsShifted;
581ca04dac2SToby Isaac     PetscSection pSecShifted;
582ca04dac2SToby Isaac 
583ca04dac2SToby Isaac     ierr = PetscSectionGetChart(pSec,&pStart,&pEnd);CHKERRQ(ierr);
584ca04dac2SToby Isaac     ierr = DMPlexGetDepth(dm,&depth);CHKERRQ(ierr);
5852582d50cSToby Isaac     pStartShifted = DMPlexShiftPoint_Internal(pStart,depth,depthShift);
5862582d50cSToby Isaac     pEndShifted   = DMPlexShiftPoint_Internal(pEnd,depth,depthShift);
587fb4630b5SToby Isaac     ierr = PetscMalloc2(pEndShifted - pStartShifted,&parentsShifted,pEndShifted-pStartShifted,&childIDsShifted);CHKERRQ(ierr);
588ca04dac2SToby Isaac     ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dmNew),&pSecShifted);CHKERRQ(ierr);
589ca04dac2SToby Isaac     ierr = PetscSectionSetChart(pSecShifted,pStartShifted,pEndShifted);CHKERRQ(ierr);
590ca04dac2SToby Isaac     for (p = pStartShifted; p < pEndShifted; p++) {
591fb4630b5SToby Isaac       /* start off assuming no children */
592fb4630b5SToby Isaac       ierr = PetscSectionSetDof(pSecShifted,p,0);CHKERRQ(ierr);
593fb4630b5SToby Isaac     }
594fb4630b5SToby Isaac     for (p = pStart; p < pEnd; p++) {
595fb4630b5SToby Isaac       PetscInt dof;
596fb4630b5SToby Isaac       PetscInt pNew = DMPlexShiftPoint_Internal(p,depth,depthShift);
597ca04dac2SToby Isaac 
598ca04dac2SToby Isaac       ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr);
599fb4630b5SToby Isaac       ierr = PetscSectionSetDof(pSecShifted,pNew,dof);CHKERRQ(ierr);
600ca04dac2SToby Isaac     }
601ca04dac2SToby Isaac     ierr = PetscSectionSetUp(pSecShifted);CHKERRQ(ierr);
602fb4630b5SToby Isaac     for (p = pStart; p < pEnd; p++) {
603fb4630b5SToby Isaac       PetscInt dof;
604fb4630b5SToby Isaac       PetscInt pNew = DMPlexShiftPoint_Internal(p,depth,depthShift);
605fb4630b5SToby Isaac 
606fb4630b5SToby Isaac       ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr);
607fb4630b5SToby Isaac       if (dof) {
608fb4630b5SToby Isaac         PetscInt off, offNew;
609fb4630b5SToby Isaac 
610fb4630b5SToby Isaac         ierr = PetscSectionGetOffset(pSec,p,&off);CHKERRQ(ierr);
611fb4630b5SToby Isaac         ierr = PetscSectionGetOffset(pSecShifted,pNew,&offNew);CHKERRQ(ierr);
612fb4630b5SToby Isaac         parentsShifted[offNew] = DMPlexShiftPoint_Internal(parents[off],depth,depthShift);
613fb4630b5SToby Isaac         childIDsShifted[offNew] = childIDs[off];
614fb4630b5SToby Isaac       }
615fb4630b5SToby Isaac     }
616fb4630b5SToby Isaac     ierr = DMPlexSetTree(dmNew,pSecShifted,parentsShifted,childIDsShifted);CHKERRQ(ierr);
617fb4630b5SToby Isaac     ierr = PetscFree2(parentsShifted,childIDsShifted);CHKERRQ(ierr);
618e6885bbbSToby Isaac     ierr = PetscSectionDestroy(&pSecShifted);CHKERRQ(ierr);
619ca04dac2SToby Isaac   }
620ca04dac2SToby Isaac   PetscFunctionReturn(0);
621ca04dac2SToby Isaac }
622ca04dac2SToby Isaac 
623cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm)
624cd0c2139SMatthew G Knepley {
625da97024aSMatthew G. Knepley   PetscSF         sf;
626cd0c2139SMatthew G Knepley   IS              valueIS;
627da97024aSMatthew G. Knepley   const PetscInt *values, *leaves;
628cd0c2139SMatthew G Knepley   PetscInt       *depthShift;
6292582d50cSToby Isaac   PetscInt        d, depth = 0, nleaves, loc, Ng, numFS, fs, fStart, fEnd, ghostCell, cEnd, c;
630cd0c2139SMatthew G Knepley   PetscErrorCode  ierr;
631cd0c2139SMatthew G Knepley 
632cd0c2139SMatthew G Knepley   PetscFunctionBegin;
633da97024aSMatthew G. Knepley   ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr);
634da97024aSMatthew G. Knepley   ierr = PetscSFGetGraph(sf, NULL, &nleaves, &leaves, NULL);CHKERRQ(ierr);
635da97024aSMatthew G. Knepley   nleaves = PetscMax(0, nleaves);
63646c796b9SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr);
637cd0c2139SMatthew G Knepley   /* Count ghost cells */
638cd0c2139SMatthew G Knepley   ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
639cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr);
640cd0c2139SMatthew G Knepley   ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
6414a6cfa73SMatthew G. Knepley   Ng   = 0;
642cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
64346c796b9SMatthew G. Knepley     IS              faceIS;
64446c796b9SMatthew G. Knepley     const PetscInt *faces;
64546c796b9SMatthew G. Knepley     PetscInt        numFaces, f, numBdFaces = 0;
646cd0c2139SMatthew G Knepley 
64746c796b9SMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
64846c796b9SMatthew G. Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
64946c796b9SMatthew G. Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
65046c796b9SMatthew G. Knepley     for (f = 0; f < numFaces; ++f) {
651ca04dac2SToby Isaac       PetscInt numChildren;
652ca04dac2SToby Isaac 
653da97024aSMatthew G. Knepley       ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr);
654ca04dac2SToby Isaac       ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr);
655ca04dac2SToby Isaac       /* non-local and ancestors points don't get to register ghosts */
656ca04dac2SToby Isaac       if (loc >= 0 || numChildren) continue;
65746c796b9SMatthew G. Knepley       if ((faces[f] >= fStart) && (faces[f] < fEnd)) ++numBdFaces;
65846c796b9SMatthew G. Knepley     }
6594a6cfa73SMatthew G. Knepley     Ng += numBdFaces;
66046c796b9SMatthew G. Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
661cd0c2139SMatthew G Knepley   }
662cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
6632582d50cSToby Isaac   ierr = PetscMalloc1(2*(depth+1), &depthShift);CHKERRQ(ierr);
6642582d50cSToby Isaac   for (d = 0; d <= depth; d++) {
66559eef20bSToby Isaac     PetscInt dEnd;
6662582d50cSToby Isaac 
6670974a383SToby Isaac     ierr = DMPlexGetDepthStratum(dm,d,NULL,&dEnd);CHKERRQ(ierr);
66859eef20bSToby Isaac     depthShift[2*d]   = dEnd;
6692582d50cSToby Isaac     depthShift[2*d+1] = 0;
6702582d50cSToby Isaac   }
6712582d50cSToby Isaac   if (depth >= 0) depthShift[2*depth+1] = Ng;
6722582d50cSToby Isaac   ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift);CHKERRQ(ierr);
673cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
674cd0c2139SMatthew G Knepley   /* Step 3: Set cone/support sizes for new points */
675cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
6765acea1aeSMatthew G. Knepley   ierr = DMPlexSetHybridBounds(gdm, cEnd, PETSC_DETERMINE, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr);
6774a6cfa73SMatthew G. Knepley   for (c = cEnd; c < cEnd + Ng; ++c) {
678cd0c2139SMatthew G Knepley     ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr);
679cd0c2139SMatthew G Knepley   }
680cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
681cd0c2139SMatthew G Knepley     IS              faceIS;
682cd0c2139SMatthew G Knepley     const PetscInt *faces;
683cd0c2139SMatthew G Knepley     PetscInt        numFaces, f;
684cd0c2139SMatthew G Knepley 
685cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
686cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
687cd0c2139SMatthew G Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
688cd0c2139SMatthew G Knepley     for (f = 0; f < numFaces; ++f) {
689ca04dac2SToby Isaac       PetscInt size, numChildren;
690cd0c2139SMatthew G Knepley 
691da97024aSMatthew G. Knepley       ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr);
692ca04dac2SToby Isaac       ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr);
693ca04dac2SToby Isaac       if (loc >= 0 || numChildren) continue;
69446c796b9SMatthew G. Knepley       if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue;
695cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr);
6964553fd90SToby Isaac       if (size != 1) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "DM has boundary face %d with %d support cells", faces[f], size);
6974a6cfa73SMatthew G. Knepley       ierr = DMPlexSetSupportSize(gdm, faces[f] + Ng, 2);CHKERRQ(ierr);
698cd0c2139SMatthew G Knepley     }
699cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr);
700cd0c2139SMatthew G Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
701cd0c2139SMatthew G Knepley   }
702cd0c2139SMatthew G Knepley   /* Step 4: Setup ghosted DM */
703cd0c2139SMatthew G Knepley   ierr = DMSetUp(gdm);CHKERRQ(ierr);
704cd0c2139SMatthew G Knepley   ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
705cd0c2139SMatthew G Knepley   /* Step 6: Set cones and supports for new points */
706cd0c2139SMatthew G Knepley   ghostCell = cEnd;
707cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
708cd0c2139SMatthew G Knepley     IS              faceIS;
709cd0c2139SMatthew G Knepley     const PetscInt *faces;
710cd0c2139SMatthew G Knepley     PetscInt        numFaces, f;
711cd0c2139SMatthew G Knepley 
712cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
713cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
714cd0c2139SMatthew G Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
71546c796b9SMatthew G. Knepley     for (f = 0; f < numFaces; ++f) {
716ca04dac2SToby Isaac       PetscInt newFace = faces[f] + Ng, numChildren;
717cd0c2139SMatthew G Knepley 
718da97024aSMatthew G. Knepley       ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr);
719ca04dac2SToby Isaac       ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr);
720ca04dac2SToby Isaac       if (loc >= 0 || numChildren) continue;
72146c796b9SMatthew G. Knepley       if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue;
722cd0c2139SMatthew G Knepley       ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr);
723cd0c2139SMatthew G Knepley       ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr);
72446c796b9SMatthew G. Knepley       ++ghostCell;
725cd0c2139SMatthew G Knepley     }
726cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr);
727cd0c2139SMatthew G Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
728cd0c2139SMatthew G Knepley   }
729cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
730cd0c2139SMatthew G Knepley   ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
731cd0c2139SMatthew G Knepley   /* Step 7: Stratify */
732cd0c2139SMatthew G Knepley   ierr = DMPlexStratify(gdm);CHKERRQ(ierr);
733cd0c2139SMatthew G Knepley   ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
734cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
735cd0c2139SMatthew G Knepley   ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
736ca04dac2SToby Isaac   ierr = DMPlexShiftTree_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
737cd0c2139SMatthew G Knepley   ierr = PetscFree(depthShift);CHKERRQ(ierr);
738966c7b3fSMatthew G. Knepley   /* Step 7: Periodicity */
739966c7b3fSMatthew G. Knepley   if (dm->maxCell) {
740966c7b3fSMatthew G. Knepley     const PetscReal *maxCell, *L;
7415dc8c3f7SMatthew G. Knepley     const DMBoundaryType *bd;
7425dc8c3f7SMatthew G. Knepley     ierr = DMGetPeriodicity(dm,  &maxCell, &L, &bd);CHKERRQ(ierr);
7435dc8c3f7SMatthew G. Knepley     ierr = DMSetPeriodicity(gdm,  maxCell,  L,  bd);CHKERRQ(ierr);
744966c7b3fSMatthew G. Knepley   }
7454a6cfa73SMatthew G. Knepley   if (numGhostCells) *numGhostCells = Ng;
746cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
747cd0c2139SMatthew G Knepley }
748cd0c2139SMatthew G Knepley 
749cd0c2139SMatthew G Knepley /*@C
750cd0c2139SMatthew G Knepley   DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face
751cd0c2139SMatthew G Knepley 
752cd0c2139SMatthew G Knepley   Collective on dm
753cd0c2139SMatthew G Knepley 
754cd0c2139SMatthew G Knepley   Input Parameters:
755cd0c2139SMatthew G Knepley + dm - The original DM
756cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL
757cd0c2139SMatthew G Knepley 
758cd0c2139SMatthew G Knepley   Output Parameters:
759cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM
760cd0c2139SMatthew G Knepley - dmGhosted - The new DM
761cd0c2139SMatthew G Knepley 
762cd0c2139SMatthew G Knepley   Note: If no label exists of that name, one will be created marking all boundary faces
763cd0c2139SMatthew G Knepley 
764cd0c2139SMatthew G Knepley   Level: developer
765cd0c2139SMatthew G Knepley 
766cd0c2139SMatthew G Knepley .seealso: DMCreate()
76731266bc0SMatthew G. Knepley @*/
768cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted)
769cd0c2139SMatthew G Knepley {
770cd0c2139SMatthew G Knepley   DM             gdm;
771cd0c2139SMatthew G Knepley   DMLabel        label;
772cd0c2139SMatthew G Knepley   const char    *name = labelName ? labelName : "Face Sets";
773cd0c2139SMatthew G Knepley   PetscInt       dim;
774a42b08eeSMatthew G. Knepley   PetscBool      flag;
775cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
776cd0c2139SMatthew G Knepley 
777cd0c2139SMatthew G Knepley   PetscFunctionBegin;
778cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
7794a6cfa73SMatthew G. Knepley   if (numGhostCells) PetscValidPointer(numGhostCells, 3);
780cd0c2139SMatthew G Knepley   PetscValidPointer(dmGhosted, 4);
781cd0c2139SMatthew G Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr);
782cd0c2139SMatthew G Knepley   ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr);
783c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
784c73cfb54SMatthew G. Knepley   ierr = DMSetDimension(gdm, dim);CHKERRQ(ierr);
785a42b08eeSMatthew G. Knepley   ierr = DMPlexGetAdjacencyUseCone(dm, &flag);CHKERRQ(ierr);
786a42b08eeSMatthew G. Knepley   ierr = DMPlexSetAdjacencyUseCone(gdm, flag);CHKERRQ(ierr);
787a42b08eeSMatthew G. Knepley   ierr = DMPlexGetAdjacencyUseClosure(dm, &flag);CHKERRQ(ierr);
788a42b08eeSMatthew G. Knepley   ierr = DMPlexSetAdjacencyUseClosure(gdm, flag);CHKERRQ(ierr);
789c58f1c22SToby Isaac   ierr = DMGetLabel(dm, name, &label);CHKERRQ(ierr);
790cd0c2139SMatthew G Knepley   if (!label) {
791cd0c2139SMatthew G Knepley     /* Get label for boundary faces */
792c58f1c22SToby Isaac     ierr = DMCreateLabel(dm, name);CHKERRQ(ierr);
793c58f1c22SToby Isaac     ierr = DMGetLabel(dm, name, &label);CHKERRQ(ierr);
794cd0c2139SMatthew G Knepley     ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr);
795cd0c2139SMatthew G Knepley   }
796cd0c2139SMatthew G Knepley   ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr);
797a6ba4734SToby Isaac   ierr = DMCopyBoundary(dm, gdm);CHKERRQ(ierr);
798cd0c2139SMatthew G Knepley   *dmGhosted = gdm;
799cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
800cd0c2139SMatthew G Knepley }
801cd0c2139SMatthew G Knepley 
802607ab7a9SMatthew G. Knepley /*
803faedd622SMatthew G. Knepley   We are adding three kinds of points here:
804607ab7a9SMatthew G. Knepley     Replicated:     Copies of points which exist in the mesh, such as vertices identified across a fault
805faedd622SMatthew G. Knepley     Non-replicated: Points which exist on the fault, but are not replicated
806607ab7a9SMatthew G. Knepley     Hybrid:         Entirely new points, such as cohesive cells
807a6ae58d1SMatthew G. Knepley 
808a6ae58d1SMatthew G. Knepley   When creating subsequent cohesive cells, we shift the old hybrid cells to the end of the numbering at
809a6ae58d1SMatthew G. Knepley   each depth so that the new split/hybrid points can be inserted as a block.
810607ab7a9SMatthew G. Knepley */
811cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm)
812cd0c2139SMatthew G Knepley {
813cd0c2139SMatthew G Knepley   MPI_Comm         comm;
814607ab7a9SMatthew G. Knepley   IS               valueIS;
815607ab7a9SMatthew G. Knepley   PetscInt         numSP = 0;       /* The number of depths for which we have replicated points */
816607ab7a9SMatthew G. Knepley   const PetscInt  *values;          /* List of depths for which we have replicated points */
81718c5995bSMatthew G. Knepley   IS              *splitIS;
81818c5995bSMatthew G. Knepley   IS              *unsplitIS;
819607ab7a9SMatthew G. Knepley   PetscInt        *numSplitPoints;     /* The number of replicated points at each depth */
82018c5995bSMatthew G. Knepley   PetscInt        *numUnsplitPoints;   /* The number of non-replicated points at each depth which still give rise to hybrid points */
82136dbac82SMatthew G. Knepley   PetscInt        *numHybridPoints;    /* The number of new hybrid points at each depth */
82236dbac82SMatthew G. Knepley   PetscInt        *numHybridPointsOld; /* The number of existing hybrid points at each depth */
823607ab7a9SMatthew G. Knepley   const PetscInt **splitPoints;        /* Replicated points for each depth */
82418c5995bSMatthew G. Knepley   const PetscInt **unsplitPoints;      /* Non-replicated points for each depth */
825cd0c2139SMatthew G Knepley   PetscSection     coordSection;
826cd0c2139SMatthew G Knepley   Vec              coordinates;
827cd0c2139SMatthew G Knepley   PetscScalar     *coords;
828a6ae58d1SMatthew G. Knepley   PetscInt        *depthMax;           /* The first hybrid point at each depth in the original mesh */
829a6ae58d1SMatthew G. Knepley   PetscInt        *depthEnd;           /* The point limit at each depth in the original mesh */
830607ab7a9SMatthew G. Knepley   PetscInt        *depthShift;         /* Number of replicated+hybrid points at each depth */
831607ab7a9SMatthew G. Knepley   PetscInt        *pMaxNew;            /* The first replicated point at each depth in the new mesh, hybrids come after this */
832607ab7a9SMatthew G. Knepley   PetscInt        *coneNew, *coneONew, *supportNew;
83318c5995bSMatthew G. Knepley   PetscInt         shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v;
834cd0c2139SMatthew G Knepley   PetscErrorCode   ierr;
835cd0c2139SMatthew G Knepley 
836cd0c2139SMatthew G Knepley   PetscFunctionBegin;
837cd0c2139SMatthew G Knepley   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
838c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
839607ab7a9SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
840fd4b9f15SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
841cd0c2139SMatthew G Knepley   /* Count split points and add cohesive cells */
842607ab7a9SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
8432582d50cSToby Isaac   ierr = PetscMalloc5(depth+1,&depthMax,depth+1,&depthEnd,2*(depth+1),&depthShift,depth+1,&pMaxNew,depth+1,&numHybridPointsOld);CHKERRQ(ierr);
844dcca6d9dSJed 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);
845a6ae58d1SMatthew 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);
846607ab7a9SMatthew G. Knepley   for (d = 0; d <= depth; ++d) {
847607ab7a9SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr);
848a6ae58d1SMatthew G. Knepley     depthEnd[d]           = pMaxNew[d];
849a6ae58d1SMatthew G. Knepley     depthMax[d]           = depthMax[d] < 0 ? depthEnd[d] : depthMax[d];
850607ab7a9SMatthew G. Knepley     numSplitPoints[d]     = 0;
85118c5995bSMatthew G. Knepley     numUnsplitPoints[d]   = 0;
852607ab7a9SMatthew G. Knepley     numHybridPoints[d]    = 0;
853a6ae58d1SMatthew G. Knepley     numHybridPointsOld[d] = depthMax[d] < 0 ? 0 : depthEnd[d] - depthMax[d];
854607ab7a9SMatthew G. Knepley     splitPoints[d]        = NULL;
85518c5995bSMatthew G. Knepley     unsplitPoints[d]      = NULL;
85618c5995bSMatthew G. Knepley     splitIS[d]            = NULL;
85718c5995bSMatthew G. Knepley     unsplitIS[d]          = NULL;
85859eef20bSToby Isaac     /* we are shifting the existing hybrid points with the stratum behind them, so
85959eef20bSToby Isaac      * the split comes at the end of the normal points, i.e., at depthMax[d] */
86059eef20bSToby Isaac     depthShift[2*d]       = depthMax[d];
86159eef20bSToby Isaac     depthShift[2*d+1]     = 0;
862607ab7a9SMatthew G. Knepley   }
863cd0c2139SMatthew G Knepley   if (label) {
864cd0c2139SMatthew G Knepley     ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
865cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr);
866cd0c2139SMatthew G Knepley     ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
867cd0c2139SMatthew G Knepley   }
868cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
869cd0c2139SMatthew G Knepley     const PetscInt dep = values[sp];
870cd0c2139SMatthew G Knepley 
871cd0c2139SMatthew G Knepley     if ((dep < 0) || (dep > depth)) continue;
87218c5995bSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr);
87318c5995bSMatthew G. Knepley     if (splitIS[dep]) {
87418c5995bSMatthew G. Knepley       ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr);
87518c5995bSMatthew G. Knepley       ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);
87618c5995bSMatthew G. Knepley     }
87718c5995bSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr);
87818c5995bSMatthew G. Knepley     if (unsplitIS[dep]) {
87918c5995bSMatthew G. Knepley       ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr);
88018c5995bSMatthew G. Knepley       ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);
881cd0c2139SMatthew G Knepley     }
882cd0c2139SMatthew G Knepley   }
883607ab7a9SMatthew G. Knepley   /* Calculate number of hybrid points */
88418c5995bSMatthew 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   */
8852582d50cSToby Isaac   for (d = 0; d <= depth; ++d) depthShift[2*d+1]      = numSplitPoints[d] + numHybridPoints[d];
8863d3eaba7SBarry Smith   ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift);CHKERRQ(ierr);
88759eef20bSToby Isaac   /* the end of the points in this stratum that come before the new points:
88859eef20bSToby Isaac    * shifting pMaxNew[d] gets the new start of the next stratum, then count back the old hybrid points and the newly
88959eef20bSToby Isaac    * added points */
8902582d50cSToby Isaac   for (d = 0; d <= depth; ++d) pMaxNew[d]             = DMPlexShiftPoint_Internal(pMaxNew[d],depth,depthShift) - (numHybridPointsOld[d] + numSplitPoints[d] + numHybridPoints[d]);
891cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
892cd0c2139SMatthew G Knepley   /* Step 3: Set cone/support sizes for new points */
893cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
894cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
895cd0c2139SMatthew G Knepley       const PetscInt  oldp   = splitPoints[dep][p];
8962582d50cSToby Isaac       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/;
8974c367dbcSMatthew G. Knepley       const PetscInt  splitp = p    + pMaxNew[dep];
898cd0c2139SMatthew G Knepley       const PetscInt *support;
8994c367dbcSMatthew G. Knepley       PetscInt        coneSize, supportSize, qf, qn, qp, e;
900cd0c2139SMatthew G Knepley 
901cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
902cd0c2139SMatthew G Knepley       ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr);
903cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
904cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr);
905cd0c2139SMatthew G Knepley       if (dep == depth-1) {
9064c367dbcSMatthew G. Knepley         const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
9074c367dbcSMatthew G. Knepley 
908cd0c2139SMatthew G Knepley         /* Add cohesive cells, they are prisms */
9094c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr);
910cd0c2139SMatthew G Knepley       } else if (dep == 0) {
9114c367dbcSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
912cd0c2139SMatthew G Knepley 
913cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
9144c367dbcSMatthew G. Knepley         for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) {
915cd0c2139SMatthew G Knepley           PetscInt val;
916cd0c2139SMatthew G Knepley 
917cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
9184c367dbcSMatthew G. Knepley           if (val == 1) ++qf;
9194c367dbcSMatthew G. Knepley           if ((val == 1) || (val ==  (shift + 1))) ++qn;
9204c367dbcSMatthew G. Knepley           if ((val == 1) || (val == -(shift + 1))) ++qp;
921cd0c2139SMatthew G Knepley         }
9224c367dbcSMatthew G. Knepley         /* Split old vertex: Edges into original vertex and new cohesive edge */
9234c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr);
9244c367dbcSMatthew G. Knepley         /* Split new vertex: Edges into split vertex and new cohesive edge */
9254c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr);
9264c367dbcSMatthew G. Knepley         /* Add hybrid edge */
9274c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr);
9284c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr);
929cd0c2139SMatthew G Knepley       } else if (dep == dim-2) {
9304c367dbcSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
9314c367dbcSMatthew G. Knepley 
932cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
9334c367dbcSMatthew G. Knepley         for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) {
934cd0c2139SMatthew G Knepley           PetscInt val;
935cd0c2139SMatthew G Knepley 
936cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
9374c367dbcSMatthew G. Knepley           if (val == dim-1) ++qf;
9384c367dbcSMatthew G. Knepley           if ((val == dim-1) || (val ==  (shift + dim-1))) ++qn;
9394c367dbcSMatthew G. Knepley           if ((val == dim-1) || (val == -(shift + dim-1))) ++qp;
940cd0c2139SMatthew G Knepley         }
9414c367dbcSMatthew G. Knepley         /* Split old edge: Faces into original edge and cohesive face (positive side?) */
9424c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr);
9434c367dbcSMatthew G. Knepley         /* Split new edge: Faces into split edge and cohesive face (negative side?) */
9444c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr);
9454c367dbcSMatthew G. Knepley         /* Add hybrid face */
9464c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr);
9474c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr);
948cd0c2139SMatthew G Knepley       }
949cd0c2139SMatthew G Knepley     }
950cd0c2139SMatthew G Knepley   }
95118c5995bSMatthew G. Knepley   for (dep = 0; dep <= depth; ++dep) {
95218c5995bSMatthew G. Knepley     for (p = 0; p < numUnsplitPoints[dep]; ++p) {
95318c5995bSMatthew G. Knepley       const PetscInt  oldp   = unsplitPoints[dep][p];
9542582d50cSToby Isaac       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/;
95518c5995bSMatthew G. Knepley       const PetscInt *support;
956da1dd7e4SMatthew G. Knepley       PetscInt        coneSize, supportSize, qf, e, s;
95718c5995bSMatthew G. Knepley 
95818c5995bSMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
95918c5995bSMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
96039254ff6SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
96118c5995bSMatthew G. Knepley       if (dep == 0) {
96218c5995bSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
96318c5995bSMatthew G. Knepley 
96439254ff6SMatthew G. Knepley         /* Unsplit vertex: Edges into original vertex, split edges, and new cohesive edge twice */
96539254ff6SMatthew G. Knepley         for (s = 0, qf = 0; s < supportSize; ++s, ++qf) {
96639254ff6SMatthew G. Knepley           ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr);
96739254ff6SMatthew G. Knepley           if (e >= 0) ++qf;
96839254ff6SMatthew G. Knepley         }
96939254ff6SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr);
97018c5995bSMatthew G. Knepley         /* Add hybrid edge */
97118c5995bSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr);
972e1757548SMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
973e1757548SMatthew G. Knepley           PetscInt val;
974e1757548SMatthew G. Knepley 
975e1757548SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
976e1757548SMatthew G. Knepley           /* Split and unsplit edges produce hybrid faces */
977da1dd7e4SMatthew G. Knepley           if (val == 1) ++qf;
978da1dd7e4SMatthew G. Knepley           if (val == (shift2 + 1)) ++qf;
979e1757548SMatthew G. Knepley         }
980e1757548SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr);
98118c5995bSMatthew G. Knepley       } else if (dep == dim-2) {
98218c5995bSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
983cd0c2139SMatthew G Knepley         PetscInt       val;
984cd0c2139SMatthew G Knepley 
985da1dd7e4SMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
986cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
987da1dd7e4SMatthew G. Knepley           if (val == dim-1) qf += 2;
988da1dd7e4SMatthew G. Knepley           else              ++qf;
989cd0c2139SMatthew G Knepley         }
99018c5995bSMatthew G. Knepley         /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */
991da1dd7e4SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr);
99218c5995bSMatthew G. Knepley         /* Add hybrid face */
993da1dd7e4SMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
994da1dd7e4SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
995da1dd7e4SMatthew G. Knepley           if (val == dim-1) ++qf;
996da1dd7e4SMatthew G. Knepley         }
99718c5995bSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr);
998da1dd7e4SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr);
999cd0c2139SMatthew G Knepley       }
1000cd0c2139SMatthew G Knepley     }
1001cd0c2139SMatthew G Knepley   }
1002cd0c2139SMatthew G Knepley   /* Step 4: Setup split DM */
1003cd0c2139SMatthew G Knepley   ierr = DMSetUp(sdm);CHKERRQ(ierr);
1004cd0c2139SMatthew G Knepley   ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
1005dcbb62e8SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr);
1006dcca6d9dSJed Brown   ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),&supportNew);CHKERRQ(ierr);
1007cd0c2139SMatthew G Knepley   /* Step 6: Set cones and supports for new points */
1008cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
1009cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
1010cd0c2139SMatthew G Knepley       const PetscInt  oldp   = splitPoints[dep][p];
10112582d50cSToby Isaac       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/;
10124c367dbcSMatthew G. Knepley       const PetscInt  splitp = p    + pMaxNew[dep];
1013cd0c2139SMatthew G Knepley       const PetscInt *cone, *support, *ornt;
10144c367dbcSMatthew G. Knepley       PetscInt        coneSize, supportSize, q, qf, qn, qp, v, e, s;
1015cd0c2139SMatthew G Knepley 
1016cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
1017cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr);
1018cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr);
1019cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
1020cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
1021cd0c2139SMatthew G Knepley       if (dep == depth-1) {
102296a07cd0SMatthew G. Knepley         PetscBool       hasUnsplit = PETSC_FALSE;
10234c367dbcSMatthew G. Knepley         const PetscInt  hybcell    = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1024cd0c2139SMatthew G Knepley         const PetscInt *supportF;
1025cd0c2139SMatthew G Knepley 
1026cd0c2139SMatthew G Knepley         /* Split face:       copy in old face to new face to start */
1027cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(sdm, newp,  &supportF);CHKERRQ(ierr);
1028cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr);
1029cd0c2139SMatthew G Knepley         /* Split old face:   old vertices/edges in cone so no change */
1030cd0c2139SMatthew G Knepley         /* Split new face:   new vertices/edges in cone */
1031cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
10324c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
103318c5995bSMatthew G. Knepley           if (v < 0) {
103418c5995bSMatthew G. Knepley             ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
103518c5995bSMatthew 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);
10362582d50cSToby Isaac             coneNew[2+q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/;
103796a07cd0SMatthew G. Knepley             hasUnsplit   = PETSC_TRUE;
103818c5995bSMatthew G. Knepley           } else {
10394c367dbcSMatthew G. Knepley             coneNew[2+q] = v + pMaxNew[dep-1];
1040163235baSMatthew G. Knepley             if (dep > 1) {
1041163235baSMatthew G. Knepley               const PetscInt *econe;
1042163235baSMatthew G. Knepley               PetscInt        econeSize, r, vs, vu;
1043163235baSMatthew G. Knepley 
1044163235baSMatthew G. Knepley               ierr = DMPlexGetConeSize(dm, cone[q], &econeSize);CHKERRQ(ierr);
1045163235baSMatthew G. Knepley               ierr = DMPlexGetCone(dm, cone[q], &econe);CHKERRQ(ierr);
1046163235baSMatthew G. Knepley               for (r = 0; r < econeSize; ++r) {
1047163235baSMatthew G. Knepley                 ierr = PetscFindInt(econe[r], numSplitPoints[dep-2],   splitPoints[dep-2],   &vs);CHKERRQ(ierr);
1048163235baSMatthew G. Knepley                 ierr = PetscFindInt(econe[r], numUnsplitPoints[dep-2], unsplitPoints[dep-2], &vu);CHKERRQ(ierr);
1049163235baSMatthew G. Knepley                 if (vs >= 0) continue;
1050163235baSMatthew 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);
1051163235baSMatthew G. Knepley                 hasUnsplit   = PETSC_TRUE;
1052163235baSMatthew G. Knepley               }
1053163235baSMatthew G. Knepley             }
1054cd0c2139SMatthew G Knepley           }
1055cd0c2139SMatthew G Knepley         }
1056cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr);
1057cd0c2139SMatthew G Knepley         ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr);
1058e537020bSMatthew G. Knepley         /* Face support */
1059cd0c2139SMatthew G Knepley         for (s = 0; s < supportSize; ++s) {
1060cd0c2139SMatthew G Knepley           PetscInt val;
1061cd0c2139SMatthew G Knepley 
1062cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr);
1063cd0c2139SMatthew G Knepley           if (val < 0) {
1064cd0c2139SMatthew G Knepley             /* Split old face:   Replace negative side cell with cohesive cell */
10654c367dbcSMatthew G. Knepley              ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr);
1066cd0c2139SMatthew G Knepley           } else {
1067cd0c2139SMatthew G Knepley             /* Split new face:   Replace positive side cell with cohesive cell */
10684c367dbcSMatthew G. Knepley             ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr);
1069e537020bSMatthew G. Knepley             /* Get orientation for cohesive face */
1070e537020bSMatthew G. Knepley             {
1071e537020bSMatthew G. Knepley               const PetscInt *ncone, *nconeO;
1072e537020bSMatthew G. Knepley               PetscInt        nconeSize, nc;
1073e537020bSMatthew G. Knepley 
1074e537020bSMatthew G. Knepley               ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr);
1075e537020bSMatthew G. Knepley               ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr);
1076e537020bSMatthew G. Knepley               ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr);
1077e537020bSMatthew G. Knepley               for (nc = 0; nc < nconeSize; ++nc) {
1078e537020bSMatthew G. Knepley                 if (ncone[nc] == oldp) {
1079e537020bSMatthew G. Knepley                   coneONew[0] = nconeO[nc];
1080e537020bSMatthew G. Knepley                   break;
1081cd0c2139SMatthew G Knepley                 }
1082cd0c2139SMatthew G Knepley               }
1083e537020bSMatthew 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]);
1084e537020bSMatthew G. Knepley             }
1085e537020bSMatthew G. Knepley           }
1086e537020bSMatthew G. Knepley         }
10874c367dbcSMatthew G. Knepley         /* Cohesive cell:    Old and new split face, then new cohesive faces */
1088fd4b9f15SMatthew G. Knepley         coneNew[0]  = newp;   /* Extracted negative side orientation above */
10894c367dbcSMatthew G. Knepley         coneNew[1]  = splitp;
10904c367dbcSMatthew G. Knepley         coneONew[1] = coneONew[0];
1091e537020bSMatthew G. Knepley         for (q = 0; q < coneSize; ++q) {
109218c5995bSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
109318c5995bSMatthew G. Knepley           if (v < 0) {
109418c5995bSMatthew G. Knepley             ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
109518c5995bSMatthew G. Knepley             coneNew[2+q]  = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
109618c5995bSMatthew G. Knepley             coneONew[2+q] = 0;
109718c5995bSMatthew G. Knepley           } else {
109818c5995bSMatthew G. Knepley             coneNew[2+q]  = v + pMaxNew[dep] + numSplitPoints[dep];
109918c5995bSMatthew G. Knepley           }
1100e537020bSMatthew G. Knepley           coneONew[2+q] = 0;
1101e537020bSMatthew G. Knepley         }
11024c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr);
11034c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr);
110496a07cd0SMatthew G. Knepley         /* Label the hybrid cells on the boundary of the split */
110596a07cd0SMatthew G. Knepley         if (hasUnsplit) {ierr = DMLabelSetValue(label, -hybcell, dim);CHKERRQ(ierr);}
1106cd0c2139SMatthew G Knepley       } else if (dep == 0) {
11074c367dbcSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1108cd0c2139SMatthew G Knepley 
1109cd0c2139SMatthew G Knepley         /* Split old vertex: Edges in old split faces and new cohesive edge */
11104c367dbcSMatthew G. Knepley         for (e = 0, qn = 0; e < supportSize; ++e) {
1111cd0c2139SMatthew G Knepley           PetscInt val;
1112cd0c2139SMatthew G Knepley 
1113cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
1114cd0c2139SMatthew G Knepley           if ((val == 1) || (val == (shift + 1))) {
11152582d50cSToby Isaac             supportNew[qn++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/;
1116cd0c2139SMatthew G Knepley           }
1117cd0c2139SMatthew G Knepley         }
11184c367dbcSMatthew G. Knepley         supportNew[qn] = hybedge;
1119cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
1120cd0c2139SMatthew G Knepley         /* Split new vertex: Edges in new split faces and new cohesive edge */
11214c367dbcSMatthew G. Knepley         for (e = 0, qp = 0; e < supportSize; ++e) {
1122cd0c2139SMatthew G Knepley           PetscInt val, edge;
1123cd0c2139SMatthew G Knepley 
1124cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
1125cd0c2139SMatthew G Knepley           if (val == 1) {
11264c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
1127cd0c2139SMatthew G Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
11284c367dbcSMatthew G. Knepley             supportNew[qp++] = edge + pMaxNew[dep+1];
1129cd0c2139SMatthew G Knepley           } else if (val == -(shift + 1)) {
11302582d50cSToby Isaac             supportNew[qp++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/;
1131cd0c2139SMatthew G Knepley           }
1132cd0c2139SMatthew G Knepley         }
11334c367dbcSMatthew G. Knepley         supportNew[qp] = hybedge;
1134cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr);
11354c367dbcSMatthew G. Knepley         /* Hybrid edge:    Old and new split vertex */
1136cd0c2139SMatthew G Knepley         coneNew[0] = newp;
1137cd0c2139SMatthew G Knepley         coneNew[1] = splitp;
11384c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr);
11394c367dbcSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
11404c367dbcSMatthew G. Knepley           PetscInt val, edge;
11414c367dbcSMatthew G. Knepley 
11424c367dbcSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
11434c367dbcSMatthew G. Knepley           if (val == 1) {
11444c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
11454c367dbcSMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
11464c367dbcSMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2];
11474c367dbcSMatthew G. Knepley           }
11484c367dbcSMatthew G. Knepley         }
11494c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr);
1150cd0c2139SMatthew G Knepley       } else if (dep == dim-2) {
11514c367dbcSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
11524c367dbcSMatthew G. Knepley 
1153cd0c2139SMatthew G Knepley         /* Split old edge:   old vertices in cone so no change */
1154cd0c2139SMatthew G Knepley         /* Split new edge:   new vertices in cone */
1155cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
11564c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
1157e1757548SMatthew G. Knepley           if (v < 0) {
1158e1757548SMatthew G. Knepley             ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
1159e1757548SMatthew 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);
11602582d50cSToby Isaac             coneNew[q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/;
1161e1757548SMatthew G. Knepley           } else {
11624c367dbcSMatthew G. Knepley             coneNew[q] = v + pMaxNew[dep-1];
1163cd0c2139SMatthew G Knepley           }
1164e1757548SMatthew G. Knepley         }
1165cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr);
1166cd0c2139SMatthew G Knepley         /* Split old edge: Faces in positive side cells and old split faces */
1167cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
1168cd0c2139SMatthew G Knepley           PetscInt val;
1169cd0c2139SMatthew G Knepley 
1170cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
11714c367dbcSMatthew G. Knepley           if (val == dim-1) {
11722582d50cSToby Isaac             supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/;
11734c367dbcSMatthew G. Knepley           } else if (val == (shift + dim-1)) {
11742582d50cSToby Isaac             supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/;
1175cd0c2139SMatthew G Knepley           }
1176cd0c2139SMatthew G Knepley         }
1177b279cd2aSMatthew G. Knepley         supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1178cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
1179cd0c2139SMatthew G Knepley         /* Split new edge: Faces in negative side cells and new split faces */
1180cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
1181cd0c2139SMatthew G Knepley           PetscInt val, face;
1182cd0c2139SMatthew G Knepley 
1183cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
1184cd0c2139SMatthew G Knepley           if (val == dim-1) {
11854c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
1186cd0c2139SMatthew G Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]);
11874c367dbcSMatthew G. Knepley             supportNew[q++] = face + pMaxNew[dep+1];
1188cd0c2139SMatthew G Knepley           } else if (val == -(shift + dim-1)) {
11892582d50cSToby Isaac             supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/;
1190cd0c2139SMatthew G Knepley           }
1191cd0c2139SMatthew G Knepley         }
1192b279cd2aSMatthew G. Knepley         supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1193cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr);
11944c367dbcSMatthew G. Knepley         /* Hybrid face */
11954c367dbcSMatthew G. Knepley         coneNew[0] = newp;
11964c367dbcSMatthew G. Knepley         coneNew[1] = splitp;
11974c367dbcSMatthew G. Knepley         for (v = 0; v < coneSize; ++v) {
11984c367dbcSMatthew G. Knepley           PetscInt vertex;
11994c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr);
1200e1757548SMatthew G. Knepley           if (vertex < 0) {
1201e1757548SMatthew G. Knepley             ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr);
1202e1757548SMatthew 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);
1203e1757548SMatthew G. Knepley             coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
1204e1757548SMatthew G. Knepley           } else {
12054c367dbcSMatthew G. Knepley             coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep];
12064c367dbcSMatthew G. Knepley           }
1207e1757548SMatthew G. Knepley         }
12084c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr);
12094c367dbcSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
12104c367dbcSMatthew G. Knepley           PetscInt val, face;
12114c367dbcSMatthew G. Knepley 
12124c367dbcSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
12134c367dbcSMatthew G. Knepley           if (val == dim-1) {
12144c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
12154c367dbcSMatthew G. Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]);
12164c367dbcSMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2];
12174c367dbcSMatthew G. Knepley           }
12184c367dbcSMatthew G. Knepley         }
12194c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr);
1220cd0c2139SMatthew G Knepley       }
1221cd0c2139SMatthew G Knepley     }
1222cd0c2139SMatthew G Knepley   }
122318c5995bSMatthew G. Knepley   for (dep = 0; dep <= depth; ++dep) {
122418c5995bSMatthew G. Knepley     for (p = 0; p < numUnsplitPoints[dep]; ++p) {
122518c5995bSMatthew G. Knepley       const PetscInt  oldp   = unsplitPoints[dep][p];
12262582d50cSToby Isaac       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/;
122718c5995bSMatthew G. Knepley       const PetscInt *cone, *support, *ornt;
1228e1757548SMatthew G. Knepley       PetscInt        coneSize, supportSize, supportSizeNew, q, qf, e, f, s;
122918c5995bSMatthew G. Knepley 
123018c5995bSMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
123118c5995bSMatthew G. Knepley       ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr);
123218c5995bSMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr);
123318c5995bSMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
123418c5995bSMatthew G. Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
123518c5995bSMatthew G. Knepley       if (dep == 0) {
123618c5995bSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
123718c5995bSMatthew G. Knepley 
123818c5995bSMatthew G. Knepley         /* Unsplit vertex */
123918c5995bSMatthew G. Knepley         ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr);
124018c5995bSMatthew G. Knepley         for (s = 0, q = 0; s < supportSize; ++s) {
12412582d50cSToby Isaac           supportNew[q++] = DMPlexShiftPoint_Internal(support[s], depth, depthShift) /*support[s] + depthOffset[dep+1]*/;
124218c5995bSMatthew G. Knepley           ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr);
124318c5995bSMatthew G. Knepley           if (e >= 0) {
124418c5995bSMatthew G. Knepley             supportNew[q++] = e + pMaxNew[dep+1];
124518c5995bSMatthew G. Knepley           }
124618c5995bSMatthew G. Knepley         }
124718c5995bSMatthew G. Knepley         supportNew[q++] = hybedge;
124818c5995bSMatthew G. Knepley         supportNew[q++] = hybedge;
124918c5995bSMatthew G. Knepley         if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp);
125018c5995bSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
125118c5995bSMatthew G. Knepley         /* Hybrid edge */
125218c5995bSMatthew G. Knepley         coneNew[0] = newp;
125318c5995bSMatthew G. Knepley         coneNew[1] = newp;
125418c5995bSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr);
125518c5995bSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
125618c5995bSMatthew G. Knepley           PetscInt val, edge;
125718c5995bSMatthew G. Knepley 
125818c5995bSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
125918c5995bSMatthew G. Knepley           if (val == 1) {
126018c5995bSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
126118c5995bSMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
126218c5995bSMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2];
1263e1757548SMatthew G. Knepley           } else if  (val ==  (shift2 + 1)) {
1264e1757548SMatthew G. Knepley             ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr);
1265e1757548SMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]);
1266e1757548SMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1];
126718c5995bSMatthew G. Knepley           }
126818c5995bSMatthew G. Knepley         }
126918c5995bSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr);
1270e1757548SMatthew G. Knepley       } else if (dep == dim-2) {
1271e1757548SMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
1272e1757548SMatthew G. Knepley 
1273da1dd7e4SMatthew G. Knepley         /* Unsplit edge: Faces into original edge, split face, and hybrid face twice */
1274e1757548SMatthew G. Knepley         for (f = 0, qf = 0; f < supportSize; ++f) {
1275e1757548SMatthew G. Knepley           PetscInt val, face;
1276e1757548SMatthew G. Knepley 
1277e1757548SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr);
1278e1757548SMatthew G. Knepley           if (val == dim-1) {
1279e1757548SMatthew G. Knepley             ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
1280e1757548SMatthew G. Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]);
12812582d50cSToby Isaac             supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/;
1282e1757548SMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+1];
1283e1757548SMatthew G. Knepley           } else {
12842582d50cSToby Isaac             supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/;
1285e1757548SMatthew G. Knepley           }
1286e1757548SMatthew G. Knepley         }
1287e1757548SMatthew G. Knepley         supportNew[qf++] = hybface;
1288e1757548SMatthew G. Knepley         supportNew[qf++] = hybface;
1289da1dd7e4SMatthew G. Knepley         ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr);
1290da1dd7e4SMatthew 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);
1291e1757548SMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
1292e1757548SMatthew G. Knepley         /* Add hybrid face */
1293e1757548SMatthew G. Knepley         coneNew[0] = newp;
1294212cc919SMatthew G. Knepley         coneNew[1] = newp;
1295e1757548SMatthew G. Knepley         ierr = PetscFindInt(cone[0], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
1296e1757548SMatthew G. Knepley         if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[0]);
1297212cc919SMatthew G. Knepley         coneNew[2] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
1298e1757548SMatthew G. Knepley         ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
1299e1757548SMatthew G. Knepley         if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]);
1300e1757548SMatthew G. Knepley         coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
1301e1757548SMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr);
1302da1dd7e4SMatthew G. Knepley         for (f = 0, qf = 0; f < supportSize; ++f) {
1303da1dd7e4SMatthew G. Knepley           PetscInt val, face;
1304da1dd7e4SMatthew G. Knepley 
1305da1dd7e4SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr);
1306da1dd7e4SMatthew G. Knepley           if (val == dim-1) {
1307da1dd7e4SMatthew G. Knepley             ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
1308da1dd7e4SMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2];
1309da1dd7e4SMatthew G. Knepley           }
1310da1dd7e4SMatthew G. Knepley         }
1311da1dd7e4SMatthew G. Knepley         ierr = DMPlexGetSupportSize(sdm, hybface, &supportSizeNew);CHKERRQ(ierr);
1312da1dd7e4SMatthew 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);
1313e1757548SMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr);
1314cd0c2139SMatthew G Knepley       }
1315cd0c2139SMatthew G Knepley     }
1316cd0c2139SMatthew G Knepley   }
1317cd0c2139SMatthew G Knepley   /* Step 6b: Replace split points in negative side cones */
1318cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
1319cd0c2139SMatthew G Knepley     PetscInt        dep = values[sp];
1320cd0c2139SMatthew G Knepley     IS              pIS;
1321cd0c2139SMatthew G Knepley     PetscInt        numPoints;
1322cd0c2139SMatthew G Knepley     const PetscInt *points;
1323cd0c2139SMatthew G Knepley 
1324cd0c2139SMatthew G Knepley     if (dep >= 0) continue;
1325cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr);
1326cd0c2139SMatthew G Knepley     if (!pIS) continue;
1327cd0c2139SMatthew G Knepley     dep  = -dep - shift;
1328cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr);
1329cd0c2139SMatthew G Knepley     ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr);
1330cd0c2139SMatthew G Knepley     for (p = 0; p < numPoints; ++p) {
1331cd0c2139SMatthew G Knepley       const PetscInt  oldp = points[p];
13322582d50cSToby Isaac       const PetscInt  newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*depthOffset[dep] + oldp*/;
1333cd0c2139SMatthew G Knepley       const PetscInt *cone;
1334cd0c2139SMatthew G Knepley       PetscInt        coneSize, c;
133550cf782dSMatthew G. Knepley       /* PetscBool       replaced = PETSC_FALSE; */
1336cd0c2139SMatthew G Knepley 
1337cd0c2139SMatthew G Knepley       /* Negative edge: replace split vertex */
1338cd0c2139SMatthew G Knepley       /* Negative cell: replace split face */
1339cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr);
1340cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr);
1341cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
1342e38fbfedSToby Isaac         const PetscInt coldp = DMPlexShiftPointInverse_Internal(cone[c],depth,depthShift);
1343cd0c2139SMatthew G Knepley         PetscInt       csplitp, cp, val;
1344cd0c2139SMatthew G Knepley 
1345cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr);
1346cd0c2139SMatthew G Knepley         if (val == dep-1) {
1347cd0c2139SMatthew G Knepley           ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr);
1348cd0c2139SMatthew G Knepley           if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1);
1349cd0c2139SMatthew G Knepley           csplitp  = pMaxNew[dep-1] + cp;
1350cd0c2139SMatthew G Knepley           ierr     = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr);
135150cf782dSMatthew G. Knepley           /* replaced = PETSC_TRUE; */
1352cd0c2139SMatthew G Knepley         }
1353cd0c2139SMatthew G Knepley       }
13544a189a86SMatthew G. Knepley       /* Cells with only a vertex or edge on the submesh have no replacement */
13554a189a86SMatthew G. Knepley       /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */
1356cd0c2139SMatthew G Knepley     }
1357cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr);
1358cd0c2139SMatthew G Knepley     ierr = ISDestroy(&pIS);CHKERRQ(ierr);
1359cd0c2139SMatthew G Knepley   }
1360cd0c2139SMatthew G Knepley   /* Step 7: Stratify */
1361cd0c2139SMatthew G Knepley   ierr = DMPlexStratify(sdm);CHKERRQ(ierr);
1362cd0c2139SMatthew G Knepley   /* Step 8: Coordinates */
1363cd0c2139SMatthew G Knepley   ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
136469d8a9ceSMatthew G. Knepley   ierr = DMGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr);
1365cd0c2139SMatthew G Knepley   ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr);
1366cd0c2139SMatthew G Knepley   ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
1367cd0c2139SMatthew G Knepley   for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) {
13682582d50cSToby Isaac     const PetscInt newp   = DMPlexShiftPoint_Internal(splitPoints[0][v], depth, depthShift) /*depthOffset[0] + splitPoints[0][v]*/;
1369cd0c2139SMatthew G Knepley     const PetscInt splitp = pMaxNew[0] + v;
1370cd0c2139SMatthew G Knepley     PetscInt       dof, off, soff, d;
1371cd0c2139SMatthew G Knepley 
1372cd0c2139SMatthew G Knepley     ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr);
1373cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr);
1374cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr);
1375cd0c2139SMatthew G Knepley     for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d];
1376cd0c2139SMatthew G Knepley   }
1377cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
1378cd0c2139SMatthew G Knepley   /* Step 9: SF, if I can figure this out we can split the mesh in parallel */
1379cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
1380cd0c2139SMatthew G Knepley   /* Step 10: Labels */
1381cd0c2139SMatthew G Knepley   ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
1382c58f1c22SToby Isaac   ierr = DMGetNumLabels(sdm, &numLabels);CHKERRQ(ierr);
1383cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
1384cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
13852582d50cSToby Isaac       const PetscInt newp   = DMPlexShiftPoint_Internal(splitPoints[dep][p], depth, depthShift) /*depthOffset[dep] + splitPoints[dep][p]*/;
1386cd0c2139SMatthew G Knepley       const PetscInt splitp = pMaxNew[dep] + p;
1387cd0c2139SMatthew G Knepley       PetscInt       l;
1388cd0c2139SMatthew G Knepley 
1389cd0c2139SMatthew G Knepley       for (l = 0; l < numLabels; ++l) {
1390cd0c2139SMatthew G Knepley         DMLabel     mlabel;
1391cd0c2139SMatthew G Knepley         const char *lname;
1392cd0c2139SMatthew G Knepley         PetscInt    val;
13939a356370SMatthew G. Knepley         PetscBool   isDepth;
1394cd0c2139SMatthew G Knepley 
1395c58f1c22SToby Isaac         ierr = DMGetLabelName(sdm, l, &lname);CHKERRQ(ierr);
13969a356370SMatthew G. Knepley         ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr);
13979a356370SMatthew G. Knepley         if (isDepth) continue;
1398c58f1c22SToby Isaac         ierr = DMGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr);
1399cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr);
1400cd0c2139SMatthew G Knepley         if (val >= 0) {
1401cd0c2139SMatthew G Knepley           ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr);
1402cd0c2139SMatthew G Knepley         }
1403cd0c2139SMatthew G Knepley       }
1404cd0c2139SMatthew G Knepley     }
1405cd0c2139SMatthew G Knepley   }
1406cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
1407cd0c2139SMatthew G Knepley     const PetscInt dep = values[sp];
1408cd0c2139SMatthew G Knepley 
1409cd0c2139SMatthew G Knepley     if ((dep < 0) || (dep > depth)) continue;
141018c5995bSMatthew G. Knepley     if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);}
141118c5995bSMatthew G. Knepley     ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr);
141218c5995bSMatthew G. Knepley     if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);}
141318c5995bSMatthew G. Knepley     ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr);
1414cd0c2139SMatthew G Knepley   }
1415cd0c2139SMatthew G Knepley   if (label) {
1416cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
1417cd0c2139SMatthew G Knepley     ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
1418cd0c2139SMatthew G Knepley   }
14190d4d4d06SMatthew G. Knepley   for (d = 0; d <= depth; ++d) {
14200d4d4d06SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr);
142136dbac82SMatthew G. Knepley     pMaxNew[d] = pEnd - numHybridPoints[d] - numHybridPointsOld[d];
14220d4d4d06SMatthew G. Knepley   }
14230e49e2e2SMatthew 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);
1424dcbb62e8SMatthew G. Knepley   ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr);
14252582d50cSToby Isaac   ierr = PetscFree5(depthMax, depthEnd, depthShift, pMaxNew, numHybridPointsOld);CHKERRQ(ierr);
142618c5995bSMatthew G. Knepley   ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr);
1427cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1428cd0c2139SMatthew G Knepley }
1429cd0c2139SMatthew G Knepley 
1430cd0c2139SMatthew G Knepley /*@C
1431cd0c2139SMatthew G Knepley   DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface
1432cd0c2139SMatthew G Knepley 
1433cd0c2139SMatthew G Knepley   Collective on dm
1434cd0c2139SMatthew G Knepley 
1435cd0c2139SMatthew G Knepley   Input Parameters:
1436cd0c2139SMatthew G Knepley + dm - The original DM
143753156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated)
1438cd0c2139SMatthew G Knepley 
1439cd0c2139SMatthew G Knepley   Output Parameters:
1440cd0c2139SMatthew G Knepley - dmSplit - The new DM
1441cd0c2139SMatthew G Knepley 
1442cd0c2139SMatthew G Knepley   Level: developer
1443cd0c2139SMatthew G Knepley 
14442be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete()
1445cd0c2139SMatthew G Knepley @*/
1446cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit)
1447cd0c2139SMatthew G Knepley {
1448cd0c2139SMatthew G Knepley   DM             sdm;
1449cd0c2139SMatthew G Knepley   PetscInt       dim;
1450cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
1451cd0c2139SMatthew G Knepley 
1452cd0c2139SMatthew G Knepley   PetscFunctionBegin;
1453cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
145453156dfcSMatthew G. Knepley   PetscValidPointer(dmSplit, 3);
1455cd0c2139SMatthew G Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr);
1456cd0c2139SMatthew G Knepley   ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr);
1457c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
1458c73cfb54SMatthew G. Knepley   ierr = DMSetDimension(sdm, dim);CHKERRQ(ierr);
1459cd0c2139SMatthew G Knepley   switch (dim) {
1460cd0c2139SMatthew G Knepley   case 2:
1461cd0c2139SMatthew G Knepley   case 3:
1462cd0c2139SMatthew G Knepley     ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr);
1463cd0c2139SMatthew G Knepley     break;
1464cd0c2139SMatthew G Knepley   default:
1465cd0c2139SMatthew G Knepley     SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim);
1466cd0c2139SMatthew G Knepley   }
1467cd0c2139SMatthew G Knepley   *dmSplit = sdm;
1468cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1469cd0c2139SMatthew G Knepley }
1470cd0c2139SMatthew G Knepley 
14710f66a230SMatthew G. Knepley /* Returns the side of the surface for a given cell with a face on the surface */
14720f66a230SMatthew G. Knepley static PetscErrorCode GetSurfaceSide_Static(DM dm, DM subdm, PetscInt numSubpoints, const PetscInt *subpoints, PetscInt cell, PetscInt face, PetscBool *pos)
14730f66a230SMatthew G. Knepley {
14740f66a230SMatthew G. Knepley   const PetscInt *cone, *ornt;
14750f66a230SMatthew G. Knepley   PetscInt        dim, coneSize, c;
14760f66a230SMatthew G. Knepley   PetscErrorCode  ierr;
14770f66a230SMatthew G. Knepley 
14780f66a230SMatthew G. Knepley   PetscFunctionBegin;
14790f66a230SMatthew G. Knepley   *pos = PETSC_TRUE;
1480c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
14810f66a230SMatthew G. Knepley   ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr);
14820f66a230SMatthew G. Knepley   ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
14830f66a230SMatthew G. Knepley   ierr = DMPlexGetConeOrientation(dm, cell, &ornt);CHKERRQ(ierr);
14840f66a230SMatthew G. Knepley   for (c = 0; c < coneSize; ++c) {
14850f66a230SMatthew G. Knepley     if (cone[c] == face) {
14860f66a230SMatthew G. Knepley       PetscInt o = ornt[c];
14870f66a230SMatthew G. Knepley 
14880f66a230SMatthew G. Knepley       if (subdm) {
14890f66a230SMatthew G. Knepley         const PetscInt *subcone, *subornt;
14900f66a230SMatthew G. Knepley         PetscInt        subpoint, subface, subconeSize, sc;
14910f66a230SMatthew G. Knepley 
14920f66a230SMatthew G. Knepley         ierr = PetscFindInt(cell, numSubpoints, subpoints, &subpoint);CHKERRQ(ierr);
14930f66a230SMatthew G. Knepley         ierr = PetscFindInt(face, numSubpoints, subpoints, &subface);CHKERRQ(ierr);
14940f66a230SMatthew G. Knepley         ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
14950f66a230SMatthew G. Knepley         ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr);
14960f66a230SMatthew G. Knepley         ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr);
14970f66a230SMatthew G. Knepley         for (sc = 0; sc < subconeSize; ++sc) {
14980f66a230SMatthew G. Knepley           if (subcone[sc] == subface) {
14990f66a230SMatthew G. Knepley             o = subornt[0];
15000f66a230SMatthew G. Knepley             break;
15010f66a230SMatthew G. Knepley           }
15020f66a230SMatthew G. Knepley         }
15030f66a230SMatthew 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);
15040f66a230SMatthew G. Knepley       }
15050f66a230SMatthew G. Knepley       if (o >= 0) *pos = PETSC_TRUE;
15060f66a230SMatthew G. Knepley       else        *pos = PETSC_FALSE;
15070f66a230SMatthew G. Knepley       break;
15080f66a230SMatthew G. Knepley     }
15090f66a230SMatthew G. Knepley   }
15100f66a230SMatthew 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);
15110f66a230SMatthew G. Knepley   PetscFunctionReturn(0);
15120f66a230SMatthew G. Knepley }
15130f66a230SMatthew G. Knepley 
1514cd0c2139SMatthew G Knepley /*@
15150f66a230SMatthew G. Knepley   DMPlexLabelCohesiveComplete - Starting with a label marking points on an internal surface, we add all other mesh pieces
1516cd0c2139SMatthew G Knepley   to complete the surface
1517cd0c2139SMatthew G Knepley 
1518cd0c2139SMatthew G Knepley   Input Parameters:
1519cd0c2139SMatthew G Knepley + dm     - The DM
15200f66a230SMatthew G. Knepley . label  - A DMLabel marking the surface
15210f66a230SMatthew G. Knepley . blabel - A DMLabel marking the vertices on the boundary which will not be duplicated, or NULL to find them automatically
1522bb55d314SMatthew G. Knepley . flip   - Flag to flip the submesh normal and replace points on the other side
152347946fd8SMatthew G. Knepley - subdm  - The subDM associated with the label, or NULL
1524cd0c2139SMatthew G Knepley 
1525cd0c2139SMatthew G Knepley   Output Parameter:
1526cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points
1527cd0c2139SMatthew G Knepley 
15280f66a230SMatthew G. Knepley   Note: The vertices in blabel are called "unsplit" in the terminology from hybrid cell creation.
15290f66a230SMatthew G. Knepley 
1530cd0c2139SMatthew G Knepley   Level: developer
1531cd0c2139SMatthew G Knepley 
15322be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete()
1533cd0c2139SMatthew G Knepley @*/
15340f66a230SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, DMLabel blabel, PetscBool flip, DM subdm)
1535cd0c2139SMatthew G Knepley {
1536d90583fdSMatthew G. Knepley   DMLabel         depthLabel;
15378630cb1aSMatthew G. Knepley   IS              dimIS, subpointIS = NULL, facePosIS, faceNegIS, crossEdgeIS = NULL;
153847946fd8SMatthew G. Knepley   const PetscInt *points, *subpoints;
1539bb55d314SMatthew G. Knepley   const PetscInt  rev   = flip ? -1 : 1;
1540370472baSMatthew G. Knepley   PetscInt       *pMax;
1541370472baSMatthew G. Knepley   PetscInt        shift = 100, shift2 = 200, dim, depth, pSize, dep, cStart, cEnd, cMax, fStart, fEnd, vStart, vEnd, numPoints, numSubpoints, p, val;
1542cd0c2139SMatthew G Knepley   PetscErrorCode  ierr;
1543cd0c2139SMatthew G Knepley 
1544cd0c2139SMatthew G Knepley   PetscFunctionBegin;
1545370472baSMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1546370472baSMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
1547370472baSMatthew G. Knepley   pSize = PetscMax(depth, dim) + 1;
1548370472baSMatthew G. Knepley   ierr = PetscMalloc1(pSize,&pMax);CHKERRQ(ierr);
1549370472baSMatthew 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);
1550d90583fdSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr);
1551c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
155247946fd8SMatthew G. Knepley   if (subdm) {
155347946fd8SMatthew G. Knepley     ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr);
155447946fd8SMatthew G. Knepley     if (subpointIS) {
155547946fd8SMatthew G. Knepley       ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr);
155647946fd8SMatthew G. Knepley       ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr);
155747946fd8SMatthew G. Knepley     }
155847946fd8SMatthew G. Knepley   }
1559d7c8f101SMatthew G. Knepley   /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */
1560cd0c2139SMatthew G Knepley   ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr);
1561dc86033cSMatthew G. Knepley   if (!dimIS) {
1562dc86033cSMatthew G. Knepley     ierr = PetscFree(pMax);CHKERRQ(ierr);
15638630cb1aSMatthew G. Knepley     ierr = ISDestroy(&subpointIS);CHKERRQ(ierr);
1564dc86033cSMatthew G. Knepley     PetscFunctionReturn(0);
1565dc86033cSMatthew G. Knepley   }
1566cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1567cd0c2139SMatthew G Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1568d7c8f101SMatthew G. Knepley   for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */
1569cd0c2139SMatthew G Knepley     const PetscInt *support;
1570cd0c2139SMatthew G Knepley     PetscInt        supportSize, s;
1571cd0c2139SMatthew G Knepley 
1572cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr);
1573cd0c2139SMatthew G Knepley     if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize);
1574cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr);
1575cd0c2139SMatthew G Knepley     for (s = 0; s < supportSize; ++s) {
15760f66a230SMatthew G. Knepley       const PetscInt *cone;
1577cd0c2139SMatthew G Knepley       PetscInt        coneSize, c;
15780f66a230SMatthew G. Knepley       PetscBool       pos;
1579cd0c2139SMatthew G Knepley 
15800f66a230SMatthew G. Knepley       ierr = GetSurfaceSide_Static(dm, subdm, numSubpoints, subpoints, support[s], points[p], &pos);CHKERRQ(ierr);
15810f66a230SMatthew G. Knepley       if (pos) {ierr = DMLabelSetValue(label, support[s],  rev*(shift+dim));CHKERRQ(ierr);}
15820f66a230SMatthew G. Knepley       else     {ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);}
15830f66a230SMatthew G. Knepley       if (rev < 0) pos = !pos ? PETSC_TRUE : PETSC_FALSE;
15840f66a230SMatthew G. Knepley       /* Put faces touching the fault in the label */
1585cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
1586cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
1587cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
1588cd0c2139SMatthew G Knepley         const PetscInt point = cone[c];
1589cd0c2139SMatthew G Knepley 
1590cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1591cd0c2139SMatthew G Knepley         if (val == -1) {
1592cd0c2139SMatthew G Knepley           PetscInt *closure = NULL;
1593cd0c2139SMatthew G Knepley           PetscInt  closureSize, cl;
1594cd0c2139SMatthew G Knepley 
1595cd0c2139SMatthew G Knepley           ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1596cd0c2139SMatthew G Knepley           for (cl = 0; cl < closureSize*2; cl += 2) {
1597cd0c2139SMatthew G Knepley             const PetscInt clp  = closure[cl];
1598a0541d8aSMatthew G. Knepley             PetscInt       bval = -1;
1599cd0c2139SMatthew G Knepley 
1600cd0c2139SMatthew G Knepley             ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr);
1601a0541d8aSMatthew G. Knepley             if (blabel) {ierr = DMLabelGetValue(blabel, clp, &bval);CHKERRQ(ierr);}
1602a0541d8aSMatthew G. Knepley             if ((val >= 0) && (val < dim-1) && (bval < 0)) {
1603cd0c2139SMatthew G Knepley               ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr);
1604cd0c2139SMatthew G Knepley               break;
1605cd0c2139SMatthew G Knepley             }
1606cd0c2139SMatthew G Knepley           }
1607cd0c2139SMatthew G Knepley           ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1608cd0c2139SMatthew G Knepley         }
1609cd0c2139SMatthew G Knepley       }
1610cd0c2139SMatthew G Knepley     }
1611cd0c2139SMatthew G Knepley   }
16120f66a230SMatthew G. Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
16130f66a230SMatthew G. Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
161447946fd8SMatthew G. Knepley   if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);}
161547946fd8SMatthew G. Knepley   ierr = ISDestroy(&subpointIS);CHKERRQ(ierr);
1616a0541d8aSMatthew G. Knepley   /* Mark boundary points as unsplit */
161786200784SMatthew G. Knepley   if (blabel) {
1618a0541d8aSMatthew G. Knepley     ierr = DMLabelGetStratumIS(blabel, 1, &dimIS);CHKERRQ(ierr);
1619a0541d8aSMatthew G. Knepley     ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1620a0541d8aSMatthew G. Knepley     ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1621a0541d8aSMatthew G. Knepley     for (p = 0; p < numPoints; ++p) {
1622a0541d8aSMatthew G. Knepley       const PetscInt point = points[p];
1623a0541d8aSMatthew G. Knepley       PetscInt       val, bval;
1624a0541d8aSMatthew G. Knepley 
1625a0541d8aSMatthew G. Knepley       ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr);
1626a0541d8aSMatthew G. Knepley       if (bval >= 0) {
1627f7019248SMatthew G. Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1628f7019248SMatthew G. Knepley         if ((val < 0) || (val > dim)) {
1629f7019248SMatthew G. Knepley           /* This could be a point added from splitting a vertex on an adjacent fault, otherwise its just wrong */
1630f7019248SMatthew G. Knepley           ierr = DMLabelClearValue(blabel, point, bval);CHKERRQ(ierr);
1631f7019248SMatthew G. Knepley         }
1632f7019248SMatthew G. Knepley       }
1633f7019248SMatthew G. Knepley     }
1634f7019248SMatthew G. Knepley     for (p = 0; p < numPoints; ++p) {
1635f7019248SMatthew G. Knepley       const PetscInt point = points[p];
1636f7019248SMatthew G. Knepley       PetscInt       val, bval;
1637f7019248SMatthew G. Knepley 
1638f7019248SMatthew G. Knepley       ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr);
1639f7019248SMatthew G. Knepley       if (bval >= 0) {
164086200784SMatthew G. Knepley         const PetscInt *cone,    *support;
164186200784SMatthew G. Knepley         PetscInt        coneSize, supportSize, s, valA, valB, valE;
164286200784SMatthew G. Knepley 
1643a0541d8aSMatthew G. Knepley         /* Mark as unsplit */
1644a0541d8aSMatthew G. Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1645a0541d8aSMatthew 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);
1646a0541d8aSMatthew G. Knepley         ierr = DMLabelClearValue(label, point, val);CHKERRQ(ierr);
1647a0541d8aSMatthew G. Knepley         ierr = DMLabelSetValue(label, point, shift2+val);CHKERRQ(ierr);
16482c06a818SMatthew G. Knepley         /* Check for cross-edge
16492c06a818SMatthew G. Knepley              A cross-edge has endpoints which are both on the boundary of the surface, but the edge itself is not. */
165086200784SMatthew G. Knepley         if (val != 0) continue;
165186200784SMatthew G. Knepley         ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr);
165286200784SMatthew G. Knepley         ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr);
165386200784SMatthew G. Knepley         for (s = 0; s < supportSize; ++s) {
165486200784SMatthew G. Knepley           ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
165586200784SMatthew G. Knepley           ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
165686200784SMatthew G. Knepley           if (coneSize != 2) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Edge %D has %D vertices != 2", support[s], coneSize);
165786200784SMatthew G. Knepley           ierr = DMLabelGetValue(blabel, cone[0], &valA);CHKERRQ(ierr);
165886200784SMatthew G. Knepley           ierr = DMLabelGetValue(blabel, cone[1], &valB);CHKERRQ(ierr);
165986200784SMatthew G. Knepley           ierr = DMLabelGetValue(blabel, support[s], &valE);CHKERRQ(ierr);
166009816f77SMatthew G. Knepley           if ((valE < 0) && (valA >= 0) && (valB >= 0) && (cone[0] != cone[1])) {ierr = DMLabelSetValue(blabel, support[s], 2);CHKERRQ(ierr);}
166186200784SMatthew G. Knepley         }
1662a0541d8aSMatthew G. Knepley       }
1663a0541d8aSMatthew G. Knepley     }
1664a0541d8aSMatthew G. Knepley     ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
1665a0541d8aSMatthew G. Knepley     ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
1666a0541d8aSMatthew G. Knepley   }
1667cd0c2139SMatthew G Knepley   /* Search for other cells/faces/edges connected to the fault by a vertex */
1668c4d480a2SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
1669cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
1670d24f5ce5SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
1671d24f5ce5SMatthew G. Knepley   cMax = cMax < 0 ? cEnd : cMax;
16720f66a230SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr);
1673cd0c2139SMatthew G Knepley   ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr);
167486200784SMatthew G. Knepley   if (blabel) {ierr = DMLabelGetStratumIS(blabel, 2, &crossEdgeIS);CHKERRQ(ierr);}
167586200784SMatthew G. Knepley   if (dimIS && crossEdgeIS) {
167686200784SMatthew G. Knepley     IS vertIS = dimIS;
167786200784SMatthew G. Knepley 
167886200784SMatthew G. Knepley     ierr = ISExpand(vertIS, crossEdgeIS, &dimIS);CHKERRQ(ierr);
167986200784SMatthew G. Knepley     ierr = ISDestroy(&crossEdgeIS);CHKERRQ(ierr);
168086200784SMatthew G. Knepley     ierr = ISDestroy(&vertIS);CHKERRQ(ierr);
168186200784SMatthew G. Knepley   }
1682dc86033cSMatthew G. Knepley   if (!dimIS) {
1683dc86033cSMatthew G. Knepley     ierr = PetscFree(pMax);CHKERRQ(ierr);
1684dc86033cSMatthew G. Knepley     PetscFunctionReturn(0);
1685dc86033cSMatthew G. Knepley   }
1686cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1687cd0c2139SMatthew G Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1688d7c8f101SMatthew G. Knepley   for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */
1689cd0c2139SMatthew G Knepley     PetscInt *star = NULL;
169086200784SMatthew G. Knepley     PetscInt  starSize, s;
1691cd0c2139SMatthew G Knepley     PetscInt  again = 1;  /* 0: Finished 1: Keep iterating after a change 2: No change */
1692cd0c2139SMatthew G Knepley 
1693d4622b2cSMatthew G. Knepley     /* All points connected to the fault are inside a cell, so at the top level we will only check cells */
1694cd0c2139SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1695cd0c2139SMatthew G Knepley     while (again) {
1696cd0c2139SMatthew G Knepley       if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault");
1697cd0c2139SMatthew G Knepley       again = 0;
1698cd0c2139SMatthew G Knepley       for (s = 0; s < starSize*2; s += 2) {
1699cd0c2139SMatthew G Knepley         const PetscInt  point = star[s];
1700cd0c2139SMatthew G Knepley         const PetscInt *cone;
1701cd0c2139SMatthew G Knepley         PetscInt        coneSize, c;
1702cd0c2139SMatthew G Knepley 
1703d24f5ce5SMatthew G. Knepley         if ((point < cStart) || (point >= cMax)) continue;
1704cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1705cd0c2139SMatthew G Knepley         if (val != -1) continue;
1706d4622b2cSMatthew G. Knepley         again = again == 1 ? 1 : 2;
1707cd0c2139SMatthew G Knepley         ierr  = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
1708cd0c2139SMatthew G Knepley         ierr  = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
1709cd0c2139SMatthew G Knepley         for (c = 0; c < coneSize; ++c) {
1710cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr);
1711cd0c2139SMatthew G Knepley           if (val != -1) {
1712d7c8f101SMatthew G. Knepley             const PetscInt *ccone;
1713166d9d0cSMatthew G. Knepley             PetscInt        cconeSize, cc, side;
1714d7c8f101SMatthew G. Knepley 
1715db8edaafSMatthew 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);
171637a6de01SMatthew G. Knepley             if (val > 0) side =  1;
171737a6de01SMatthew G. Knepley             else         side = -1;
171837a6de01SMatthew G. Knepley             ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr);
1719d7c8f101SMatthew G. Knepley             /* Mark cell faces which touch the fault */
1720d7c8f101SMatthew G. Knepley             ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr);
1721d7c8f101SMatthew G. Knepley             ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr);
1722d7c8f101SMatthew G. Knepley             for (cc = 0; cc < cconeSize; ++cc) {
1723d7c8f101SMatthew G. Knepley               PetscInt *closure = NULL;
1724d7c8f101SMatthew G. Knepley               PetscInt  closureSize, cl;
1725d7c8f101SMatthew G. Knepley 
1726166d9d0cSMatthew G. Knepley               ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr);
1727166d9d0cSMatthew G. Knepley               if (val != -1) continue;
1728d7c8f101SMatthew G. Knepley               ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1729d4622b2cSMatthew G. Knepley               for (cl = 0; cl < closureSize*2; cl += 2) {
1730d7c8f101SMatthew G. Knepley                 const PetscInt clp = closure[cl];
1731d7c8f101SMatthew G. Knepley 
1732d7c8f101SMatthew G. Knepley                 ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr);
1733d7c8f101SMatthew G. Knepley                 if (val == -1) continue;
1734d7c8f101SMatthew G. Knepley                 ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr);
173537a6de01SMatthew G. Knepley                 break;
173637a6de01SMatthew G. Knepley               }
1737d7c8f101SMatthew G. Knepley               ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1738cd0c2139SMatthew G Knepley             }
1739cd0c2139SMatthew G Knepley             again = 1;
1740cd0c2139SMatthew G Knepley             break;
1741cd0c2139SMatthew G Knepley           }
1742cd0c2139SMatthew G Knepley         }
1743cd0c2139SMatthew G Knepley       }
1744cd0c2139SMatthew G Knepley     }
1745cd0c2139SMatthew G Knepley     /* Classify the rest by cell membership */
1746cd0c2139SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1747cd0c2139SMatthew G Knepley       const PetscInt point = star[s];
1748cd0c2139SMatthew G Knepley 
1749cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1750cd0c2139SMatthew G Knepley       if (val == -1) {
1751cd0c2139SMatthew G Knepley         PetscInt  *sstar = NULL;
1752cd0c2139SMatthew G Knepley         PetscInt   sstarSize, ss;
1753cd0c2139SMatthew G Knepley         PetscBool  marked = PETSC_FALSE;
1754cd0c2139SMatthew G Knepley 
1755cd0c2139SMatthew G Knepley         ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr);
1756cd0c2139SMatthew G Knepley         for (ss = 0; ss < sstarSize*2; ss += 2) {
1757cd0c2139SMatthew G Knepley           const PetscInt spoint = sstar[ss];
1758cd0c2139SMatthew G Knepley 
1759d24f5ce5SMatthew G. Knepley           if ((spoint < cStart) || (spoint >= cMax)) continue;
1760cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr);
1761cd0c2139SMatthew 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);
1762d90583fdSMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr);
1763cd0c2139SMatthew G Knepley           if (val > 0) {
1764cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, point,   shift+dep);CHKERRQ(ierr);
1765cd0c2139SMatthew G Knepley           } else {
1766cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr);
1767cd0c2139SMatthew G Knepley           }
1768cd0c2139SMatthew G Knepley           marked = PETSC_TRUE;
1769cd0c2139SMatthew G Knepley           break;
1770cd0c2139SMatthew G Knepley         }
1771cd0c2139SMatthew G Knepley         ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr);
1772370472baSMatthew G. Knepley         ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr);
1773370472baSMatthew G. Knepley         if (point < pMax[dep] && !marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point);
1774cd0c2139SMatthew G Knepley       }
1775cd0c2139SMatthew G Knepley     }
1776cd0c2139SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1777cd0c2139SMatthew G Knepley   }
1778cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
1779cd0c2139SMatthew G Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
178018c5995bSMatthew G. Knepley   /* If any faces touching the fault divide cells on either side, split them */
178118c5995bSMatthew G. Knepley   ierr = DMLabelGetStratumIS(label,   shift+dim-1,  &facePosIS);CHKERRQ(ierr);
178218c5995bSMatthew G. Knepley   ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr);
178318c5995bSMatthew G. Knepley   ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr);
178418c5995bSMatthew G. Knepley   ierr = ISDestroy(&facePosIS);CHKERRQ(ierr);
178518c5995bSMatthew G. Knepley   ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr);
178618c5995bSMatthew G. Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
178718c5995bSMatthew G. Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
178818c5995bSMatthew G. Knepley   for (p = 0; p < numPoints; ++p) {
178918c5995bSMatthew G. Knepley     const PetscInt  point = points[p];
179018c5995bSMatthew G. Knepley     const PetscInt *support;
179118c5995bSMatthew G. Knepley     PetscInt        supportSize, valA, valB;
179218c5995bSMatthew G. Knepley 
179318c5995bSMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr);
179418c5995bSMatthew G. Knepley     if (supportSize != 2) continue;
179518c5995bSMatthew G. Knepley     ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr);
179618c5995bSMatthew G. Knepley     ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr);
179718c5995bSMatthew G. Knepley     ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr);
179818c5995bSMatthew G. Knepley     if ((valA == -1) || (valB == -1)) continue;
179918c5995bSMatthew G. Knepley     if (valA*valB > 0) continue;
180018c5995bSMatthew G. Knepley     /* Split the face */
180118c5995bSMatthew G. Knepley     ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr);
180218c5995bSMatthew G. Knepley     ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr);
180318c5995bSMatthew G. Knepley     ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr);
1804e1757548SMatthew G. Knepley     /* Label its closure:
1805e1757548SMatthew G. Knepley       unmarked: label as unsplit
1806e1757548SMatthew G. Knepley       incident: relabel as split
1807e1757548SMatthew G. Knepley       split:    do nothing
1808e1757548SMatthew G. Knepley     */
180918c5995bSMatthew G. Knepley     {
181018c5995bSMatthew G. Knepley       PetscInt *closure = NULL;
181118c5995bSMatthew G. Knepley       PetscInt  closureSize, cl;
181218c5995bSMatthew G. Knepley 
181318c5995bSMatthew G. Knepley       ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
181418c5995bSMatthew G. Knepley       for (cl = 0; cl < closureSize*2; cl += 2) {
181518c5995bSMatthew G. Knepley         ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr);
18168771c1d3SMatthew G. Knepley         if (valA == -1) { /* Mark as unsplit */
181718c5995bSMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr);
181818c5995bSMatthew G. Knepley           ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr);
18198771c1d3SMatthew G. Knepley         } else if (((valA >= shift) && (valA < shift2)) || ((valA <= -shift) && (valA > -shift2))) {
1820e1757548SMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr);
1821e1757548SMatthew G. Knepley           ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr);
1822e1757548SMatthew G. Knepley           ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr);
1823e1757548SMatthew G. Knepley         }
182418c5995bSMatthew G. Knepley       }
182518c5995bSMatthew G. Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
182618c5995bSMatthew G. Knepley     }
182718c5995bSMatthew G. Knepley   }
182818c5995bSMatthew G. Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
182918c5995bSMatthew G. Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
1830370472baSMatthew G. Knepley   ierr = PetscFree(pMax);CHKERRQ(ierr);
1831cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1832cd0c2139SMatthew G Knepley }
1833cd0c2139SMatthew G Knepley 
1834c08575a3SMatthew G. Knepley /*@
18353cf72582SMatthew G. Knepley   DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface
18363cf72582SMatthew G. Knepley 
18373cf72582SMatthew G. Knepley   Collective on dm
18383cf72582SMatthew G. Knepley 
18393cf72582SMatthew G. Knepley   Input Parameters:
18403cf72582SMatthew G. Knepley + dm - The original DM
18413cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices
18423cf72582SMatthew G. Knepley 
18433cf72582SMatthew G. Knepley   Output Parameters:
18443cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface
18453cf72582SMatthew G. Knepley - dmHybrid - The new DM
18463cf72582SMatthew G. Knepley 
18473cf72582SMatthew G. Knepley   Level: developer
18483cf72582SMatthew G. Knepley 
18493cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate()
18503cf72582SMatthew G. Knepley @*/
18513cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid)
18523cf72582SMatthew G. Knepley {
18533cf72582SMatthew G. Knepley   DM             idm;
18543cf72582SMatthew G. Knepley   DMLabel        subpointMap, hlabel;
18553cf72582SMatthew G. Knepley   PetscInt       dim;
18563cf72582SMatthew G. Knepley   PetscErrorCode ierr;
18573cf72582SMatthew G. Knepley 
18583cf72582SMatthew G. Knepley   PetscFunctionBegin;
18593cf72582SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
18603cf72582SMatthew G. Knepley   if (hybridLabel) PetscValidPointer(hybridLabel, 3);
18613cf72582SMatthew G. Knepley   PetscValidPointer(dmHybrid, 4);
1862c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
18633cf72582SMatthew G. Knepley   ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr);
18643cf72582SMatthew G. Knepley   ierr = DMPlexOrient(idm);CHKERRQ(ierr);
18653cf72582SMatthew G. Knepley   ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr);
18663cf72582SMatthew G. Knepley   ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr);
18673cf72582SMatthew G. Knepley   ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr);
18680f66a230SMatthew G. Knepley   ierr = DMPlexLabelCohesiveComplete(dm, hlabel, NULL, PETSC_FALSE, idm);CHKERRQ(ierr);
18693cf72582SMatthew G. Knepley   ierr = DMDestroy(&idm);CHKERRQ(ierr);
18703cf72582SMatthew G. Knepley   ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr);
18713cf72582SMatthew G. Knepley   if (hybridLabel) *hybridLabel = hlabel;
187253aa2e23SMatthew G. Knepley   else             {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);}
1873cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1874cd0c2139SMatthew G Knepley }
1875cd0c2139SMatthew G Knepley 
1876efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that:
1877efa14ee0SMatthew G Knepley 
1878efa14ee0SMatthew G Knepley      For any marked cell, the marked vertices constitute a single face
1879efa14ee0SMatthew G Knepley */
1880830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm)
1881efa14ee0SMatthew G Knepley {
1882fed694aaSMatthew G. Knepley   IS               subvertexIS = NULL;
1883efa14ee0SMatthew G Knepley   const PetscInt  *subvertices;
188477d178adSMatthew G. Knepley   PetscInt        *pStart, *pEnd, *pMax, pSize;
1885efa14ee0SMatthew G Knepley   PetscInt         depth, dim, d, numSubVerticesInitial = 0, v;
1886efa14ee0SMatthew G Knepley   PetscErrorCode   ierr;
1887efa14ee0SMatthew G Knepley 
1888efa14ee0SMatthew G Knepley   PetscFunctionBegin;
1889efa14ee0SMatthew G Knepley   *numFaces = 0;
1890efa14ee0SMatthew G Knepley   *nFV      = 0;
1891efa14ee0SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1892c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
189377d178adSMatthew G. Knepley   pSize = PetscMax(depth, dim) + 1;
1894dcca6d9dSJed Brown   ierr = PetscMalloc3(pSize,&pStart,pSize,&pEnd,pSize,&pMax);CHKERRQ(ierr);
1895d92e47f8SMatthew 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);
1896efa14ee0SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
1897efa14ee0SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1898efa14ee0SMatthew G Knepley     if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]);
1899efa14ee0SMatthew G Knepley   }
1900efa14ee0SMatthew G Knepley   /* Loop over initial vertices and mark all faces in the collective star() */
1901fed694aaSMatthew G. Knepley   if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);}
1902efa14ee0SMatthew G Knepley   if (subvertexIS) {
1903efa14ee0SMatthew G Knepley     ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr);
1904efa14ee0SMatthew G Knepley     ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1905efa14ee0SMatthew G Knepley   }
1906efa14ee0SMatthew G Knepley   for (v = 0; v < numSubVerticesInitial; ++v) {
1907efa14ee0SMatthew G Knepley     const PetscInt vertex = subvertices[v];
19080298fd71SBarry Smith     PetscInt      *star   = NULL;
1909efa14ee0SMatthew G Knepley     PetscInt       starSize, s, numCells = 0, c;
1910efa14ee0SMatthew G Knepley 
1911efa14ee0SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1912efa14ee0SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1913efa14ee0SMatthew G Knepley       const PetscInt point = star[s];
1914efa14ee0SMatthew G Knepley       if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point;
1915efa14ee0SMatthew G Knepley     }
1916efa14ee0SMatthew G Knepley     for (c = 0; c < numCells; ++c) {
1917efa14ee0SMatthew G Knepley       const PetscInt cell    = star[c];
19180298fd71SBarry Smith       PetscInt      *closure = NULL;
1919efa14ee0SMatthew G Knepley       PetscInt       closureSize, cl;
1920efa14ee0SMatthew G Knepley       PetscInt       cellLoc, numCorners = 0, faceSize = 0;
1921efa14ee0SMatthew G Knepley 
1922efa14ee0SMatthew G Knepley       ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr);
192365560c7fSMatthew G Knepley       if (cellLoc == 2) continue;
192482f516ccSBarry Smith       if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc);
1925efa14ee0SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1926efa14ee0SMatthew G Knepley       for (cl = 0; cl < closureSize*2; cl += 2) {
1927efa14ee0SMatthew G Knepley         const PetscInt point = closure[cl];
1928efa14ee0SMatthew G Knepley         PetscInt       vertexLoc;
1929efa14ee0SMatthew G Knepley 
1930efa14ee0SMatthew G Knepley         if ((point >= pStart[0]) && (point < pEnd[0])) {
1931efa14ee0SMatthew G Knepley           ++numCorners;
1932efa14ee0SMatthew G Knepley           ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr);
1933830e53efSMatthew G. Knepley           if (vertexLoc == value) closure[faceSize++] = point;
1934efa14ee0SMatthew G Knepley         }
1935efa14ee0SMatthew G Knepley       }
193618ad9376SMatthew G. Knepley       if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);}
193782f516ccSBarry 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);
1938efa14ee0SMatthew G Knepley       if (faceSize == *nFV) {
1939007baee2SMatthew G. Knepley         const PetscInt *cells = NULL;
1940007baee2SMatthew G. Knepley         PetscInt        numCells, nc;
1941007baee2SMatthew G. Knepley 
1942efa14ee0SMatthew G Knepley         ++(*numFaces);
1943efa14ee0SMatthew G Knepley         for (cl = 0; cl < faceSize; ++cl) {
1944efa14ee0SMatthew G Knepley           ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr);
1945efa14ee0SMatthew G Knepley         }
1946007baee2SMatthew G. Knepley         ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr);
1947007baee2SMatthew G. Knepley         for (nc = 0; nc < numCells; ++nc) {
1948007baee2SMatthew G. Knepley           ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr);
1949007baee2SMatthew G. Knepley         }
1950007baee2SMatthew G. Knepley         ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr);
1951efa14ee0SMatthew G Knepley       }
1952efa14ee0SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1953efa14ee0SMatthew G Knepley     }
1954efa14ee0SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1955efa14ee0SMatthew G Knepley   }
1956efa14ee0SMatthew G Knepley   if (subvertexIS) {
1957efa14ee0SMatthew G Knepley     ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1958efa14ee0SMatthew G Knepley   }
1959efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
1960efa14ee0SMatthew G Knepley   ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr);
1961efa14ee0SMatthew G Knepley   PetscFunctionReturn(0);
1962efa14ee0SMatthew G Knepley }
1963efa14ee0SMatthew G Knepley 
1964830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm)
1965efa14ee0SMatthew G Knepley {
196634b4c39eSMatthew G. Knepley   IS               subvertexIS = NULL;
1967efa14ee0SMatthew G Knepley   const PetscInt  *subvertices;
1968efa14ee0SMatthew G Knepley   PetscInt        *pStart, *pEnd, *pMax;
1969efa14ee0SMatthew G Knepley   PetscInt         dim, d, numSubVerticesInitial = 0, v;
1970efa14ee0SMatthew G Knepley   PetscErrorCode   ierr;
1971efa14ee0SMatthew G Knepley 
1972efa14ee0SMatthew G Knepley   PetscFunctionBegin;
1973c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
1974dcca6d9dSJed Brown   ierr = PetscMalloc3(dim+1,&pStart,dim+1,&pEnd,dim+1,&pMax);CHKERRQ(ierr);
19750298fd71SBarry Smith   ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr);
1976efa14ee0SMatthew G Knepley   for (d = 0; d <= dim; ++d) {
1977efa14ee0SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1978efa14ee0SMatthew G Knepley     if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]);
1979efa14ee0SMatthew G Knepley   }
1980efa14ee0SMatthew G Knepley   /* Loop over initial vertices and mark all faces in the collective star() */
198134b4c39eSMatthew G. Knepley   if (vertexLabel) {
1982830e53efSMatthew G. Knepley     ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);
1983efa14ee0SMatthew G Knepley     if (subvertexIS) {
1984efa14ee0SMatthew G Knepley       ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr);
1985efa14ee0SMatthew G Knepley       ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1986efa14ee0SMatthew G Knepley     }
198734b4c39eSMatthew G. Knepley   }
1988efa14ee0SMatthew G Knepley   for (v = 0; v < numSubVerticesInitial; ++v) {
1989efa14ee0SMatthew G Knepley     const PetscInt vertex = subvertices[v];
19900298fd71SBarry Smith     PetscInt      *star   = NULL;
1991efa14ee0SMatthew G Knepley     PetscInt       starSize, s, numFaces = 0, f;
1992efa14ee0SMatthew G Knepley 
1993efa14ee0SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1994efa14ee0SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1995efa14ee0SMatthew G Knepley       const PetscInt point = star[s];
1996efa14ee0SMatthew G Knepley       if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point;
1997efa14ee0SMatthew G Knepley     }
1998efa14ee0SMatthew G Knepley     for (f = 0; f < numFaces; ++f) {
1999efa14ee0SMatthew G Knepley       const PetscInt face    = star[f];
20000298fd71SBarry Smith       PetscInt      *closure = NULL;
2001efa14ee0SMatthew G Knepley       PetscInt       closureSize, c;
2002efa14ee0SMatthew G Knepley       PetscInt       faceLoc;
2003efa14ee0SMatthew G Knepley 
2004efa14ee0SMatthew G Knepley       ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr);
2005efa14ee0SMatthew G Knepley       if (faceLoc == dim-1) continue;
200682f516ccSBarry Smith       if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc);
2007efa14ee0SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2008efa14ee0SMatthew G Knepley       for (c = 0; c < closureSize*2; c += 2) {
2009efa14ee0SMatthew G Knepley         const PetscInt point = closure[c];
2010efa14ee0SMatthew G Knepley         PetscInt       vertexLoc;
2011efa14ee0SMatthew G Knepley 
2012efa14ee0SMatthew G Knepley         if ((point >= pStart[0]) && (point < pEnd[0])) {
2013efa14ee0SMatthew G Knepley           ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr);
2014830e53efSMatthew G. Knepley           if (vertexLoc != value) break;
2015efa14ee0SMatthew G Knepley         }
2016efa14ee0SMatthew G Knepley       }
2017efa14ee0SMatthew G Knepley       if (c == closureSize*2) {
2018efa14ee0SMatthew G Knepley         const PetscInt *support;
2019efa14ee0SMatthew G Knepley         PetscInt        supportSize, s;
2020efa14ee0SMatthew G Knepley 
2021efa14ee0SMatthew G Knepley         for (c = 0; c < closureSize*2; c += 2) {
2022efa14ee0SMatthew G Knepley           const PetscInt point = closure[c];
2023efa14ee0SMatthew G Knepley 
2024efa14ee0SMatthew G Knepley           for (d = 0; d < dim; ++d) {
2025efa14ee0SMatthew G Knepley             if ((point >= pStart[d]) && (point < pEnd[d])) {
2026efa14ee0SMatthew G Knepley               ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr);
2027efa14ee0SMatthew G Knepley               break;
2028efa14ee0SMatthew G Knepley             }
2029efa14ee0SMatthew G Knepley           }
2030efa14ee0SMatthew G Knepley         }
2031efa14ee0SMatthew G Knepley         ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr);
2032efa14ee0SMatthew G Knepley         ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr);
2033efa14ee0SMatthew G Knepley         for (s = 0; s < supportSize; ++s) {
2034efa14ee0SMatthew G Knepley           ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr);
2035efa14ee0SMatthew G Knepley         }
2036efa14ee0SMatthew G Knepley       }
2037efa14ee0SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2038efa14ee0SMatthew G Knepley     }
2039efa14ee0SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
2040efa14ee0SMatthew G Knepley   }
204134b4c39eSMatthew G. Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);}
2042efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
2043efa14ee0SMatthew G Knepley   ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr);
2044efa14ee0SMatthew G Knepley   PetscFunctionReturn(0);
2045efa14ee0SMatthew G Knepley }
2046efa14ee0SMatthew G Knepley 
204727c04023SMatthew 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)
2048766ab985SMatthew G. Knepley {
204927c04023SMatthew G. Knepley   DMLabel         label = NULL;
2050766ab985SMatthew G. Knepley   const PetscInt *cone;
20519fc93327SToby Isaac   PetscInt        dim, cMax, cEnd, c, subc = 0, p, coneSize = -1;
2052766ab985SMatthew G. Knepley   PetscErrorCode  ierr;
2053766ab985SMatthew G. Knepley 
2054812bfc34SJed Brown   PetscFunctionBegin;
2055c0ed958bSJed Brown   *numFaces = 0;
2056c0ed958bSJed Brown   *nFV = 0;
2057c58f1c22SToby Isaac   if (labelname) {ierr = DMGetLabel(dm, labelname, &label);CHKERRQ(ierr);}
2058fed694aaSMatthew G. Knepley   *subCells = NULL;
2059c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
2060766ab985SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
2061766ab985SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
2062766ab985SMatthew G. Knepley   if (cMax < 0) PetscFunctionReturn(0);
206327c04023SMatthew G. Knepley   if (label) {
206427c04023SMatthew G. Knepley     for (c = cMax; c < cEnd; ++c) {
206527c04023SMatthew G. Knepley       PetscInt val;
206627c04023SMatthew G. Knepley 
206727c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
206827c04023SMatthew G. Knepley       if (val == value) {
206927c04023SMatthew G. Knepley         ++(*numFaces);
207027c04023SMatthew G. Knepley         ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
207127c04023SMatthew G. Knepley       }
207227c04023SMatthew G. Knepley     }
207327c04023SMatthew G. Knepley   } else {
2074766ab985SMatthew G. Knepley     *numFaces = cEnd - cMax;
207527c04023SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr);
207627c04023SMatthew G. Knepley   }
2077785e854fSJed Brown   ierr = PetscMalloc1(*numFaces *2, subCells);CHKERRQ(ierr);
20789fc93327SToby Isaac   if (!(*numFaces)) PetscFunctionReturn(0);
20799fc93327SToby Isaac   *nFV = hasLagrange ? coneSize/3 : coneSize/2;
2080766ab985SMatthew G. Knepley   for (c = cMax; c < cEnd; ++c) {
2081766ab985SMatthew G. Knepley     const PetscInt *cells;
2082766ab985SMatthew G. Knepley     PetscInt        numCells;
2083766ab985SMatthew G. Knepley 
208427c04023SMatthew G. Knepley     if (label) {
208527c04023SMatthew G. Knepley       PetscInt val;
208627c04023SMatthew G. Knepley 
208727c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
208827c04023SMatthew G. Knepley       if (val != value) continue;
208927c04023SMatthew G. Knepley     }
2090766ab985SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
2091766ab985SMatthew G. Knepley     for (p = 0; p < *nFV; ++p) {
2092766ab985SMatthew G. Knepley       ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr);
2093766ab985SMatthew G. Knepley     }
2094766ab985SMatthew G. Knepley     /* Negative face */
2095766ab985SMatthew G. Knepley     ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr);
209627234c99SMatthew G. Knepley     /* Not true in parallel
209727234c99SMatthew G. Knepley     if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */
2098766ab985SMatthew G. Knepley     for (p = 0; p < numCells; ++p) {
2099766ab985SMatthew G. Knepley       ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr);
210027234c99SMatthew G. Knepley       (*subCells)[subc++] = cells[p];
2101766ab985SMatthew G. Knepley     }
2102766ab985SMatthew G. Knepley     ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr);
2103766ab985SMatthew G. Knepley     /* Positive face is not included */
2104766ab985SMatthew G. Knepley   }
2105766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
2106766ab985SMatthew G. Knepley }
2107766ab985SMatthew G. Knepley 
21083982b651SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, DMLabel label, PetscInt value, DMLabel subpointMap, DM subdm)
2109766ab985SMatthew G. Knepley {
2110766ab985SMatthew G. Knepley   PetscInt      *pStart, *pEnd;
2111766ab985SMatthew G. Knepley   PetscInt       dim, cMax, cEnd, c, d;
2112766ab985SMatthew G. Knepley   PetscErrorCode ierr;
2113766ab985SMatthew G. Knepley 
2114812bfc34SJed Brown   PetscFunctionBegin;
2115c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
2116766ab985SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
2117766ab985SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
2118766ab985SMatthew G. Knepley   if (cMax < 0) PetscFunctionReturn(0);
2119dcca6d9dSJed Brown   ierr = PetscMalloc2(dim+1,&pStart,dim+1,&pEnd);CHKERRQ(ierr);
2120b3154360SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);}
2121766ab985SMatthew G. Knepley   for (c = cMax; c < cEnd; ++c) {
2122766ab985SMatthew G. Knepley     const PetscInt *cone;
2123766ab985SMatthew G. Knepley     PetscInt       *closure = NULL;
2124b3154360SMatthew G. Knepley     PetscInt        fconeSize, coneSize, closureSize, cl, val;
2125766ab985SMatthew G. Knepley 
212627c04023SMatthew G. Knepley     if (label) {
212727c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
212827c04023SMatthew G. Knepley       if (val != value) continue;
212927c04023SMatthew G. Knepley     }
2130766ab985SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
2131766ab985SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
2132b3154360SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr);
2133b3154360SMatthew G. Knepley     if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells");
2134b3154360SMatthew G. Knepley     /* Negative face */
2135766ab985SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2136766ab985SMatthew G. Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
2137766ab985SMatthew G. Knepley       const PetscInt point = closure[cl];
2138766ab985SMatthew G. Knepley 
2139766ab985SMatthew G. Knepley       for (d = 0; d <= dim; ++d) {
2140766ab985SMatthew G. Knepley         if ((point >= pStart[d]) && (point < pEnd[d])) {
2141766ab985SMatthew G. Knepley           ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr);
2142766ab985SMatthew G. Knepley           break;
2143766ab985SMatthew G. Knepley         }
2144766ab985SMatthew G. Knepley       }
2145766ab985SMatthew G. Knepley     }
2146766ab985SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2147766ab985SMatthew G. Knepley     /* Cells -- positive face is not included */
2148766ab985SMatthew G. Knepley     for (cl = 0; cl < 1; ++cl) {
2149766ab985SMatthew G. Knepley       const PetscInt *support;
2150766ab985SMatthew G. Knepley       PetscInt        supportSize, s;
2151766ab985SMatthew G. Knepley 
2152766ab985SMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr);
2153711de394SMatthew G. Knepley       /* if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); */
2154766ab985SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr);
2155766ab985SMatthew G. Knepley       for (s = 0; s < supportSize; ++s) {
2156766ab985SMatthew G. Knepley         ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr);
2157766ab985SMatthew G. Knepley       }
2158766ab985SMatthew G. Knepley     }
2159766ab985SMatthew G. Knepley   }
2160766ab985SMatthew G. Knepley   ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr);
2161766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
2162766ab985SMatthew G. Knepley }
2163766ab985SMatthew G. Knepley 
2164c08575a3SMatthew G. Knepley static PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented)
2165e6ccafaeSMatthew G Knepley {
216682f516ccSBarry Smith   MPI_Comm       comm;
2167e6ccafaeSMatthew G Knepley   PetscBool      posOrient = PETSC_FALSE;
2168e6ccafaeSMatthew G Knepley   const PetscInt debug     = 0;
2169e6ccafaeSMatthew G Knepley   PetscInt       cellDim, faceSize, f;
2170e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
2171e6ccafaeSMatthew G Knepley 
217282f516ccSBarry Smith   PetscFunctionBegin;
217382f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2174c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &cellDim);CHKERRQ(ierr);
2175e6ccafaeSMatthew G Knepley   if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);}
2176e6ccafaeSMatthew G Knepley 
2177ddeab2a6SMatthew G. Knepley   if (cellDim == 1 && numCorners == 2) {
2178ddeab2a6SMatthew G. Knepley     /* Triangle */
2179e6ccafaeSMatthew G Knepley     faceSize  = numCorners-1;
2180e6ccafaeSMatthew G Knepley     posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
2181ddeab2a6SMatthew G. Knepley   } else if (cellDim == 2 && numCorners == 3) {
2182ddeab2a6SMatthew G. Knepley     /* Triangle */
2183ddeab2a6SMatthew G. Knepley     faceSize  = numCorners-1;
2184ddeab2a6SMatthew G. Knepley     posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
2185ddeab2a6SMatthew G. Knepley   } else if (cellDim == 3 && numCorners == 4) {
2186ddeab2a6SMatthew G. Knepley     /* Tetrahedron */
2187ddeab2a6SMatthew G. Knepley     faceSize  = numCorners-1;
2188ddeab2a6SMatthew G. Knepley     posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
2189e6ccafaeSMatthew G Knepley   } else if (cellDim == 1 && numCorners == 3) {
2190e6ccafaeSMatthew G Knepley     /* Quadratic line */
2191e6ccafaeSMatthew G Knepley     faceSize  = 1;
2192e6ccafaeSMatthew G Knepley     posOrient = PETSC_TRUE;
2193e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 4) {
2194e6ccafaeSMatthew G Knepley     /* Quads */
2195e6ccafaeSMatthew G Knepley     faceSize = 2;
2196e6ccafaeSMatthew G Knepley     if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) {
2197e6ccafaeSMatthew G Knepley       posOrient = PETSC_TRUE;
2198e6ccafaeSMatthew G Knepley     } else if ((indices[0] == 3) && (indices[1] == 0)) {
2199e6ccafaeSMatthew G Knepley       posOrient = PETSC_TRUE;
2200e6ccafaeSMatthew G Knepley     } else {
2201e6ccafaeSMatthew G Knepley       if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) {
2202e6ccafaeSMatthew G Knepley         posOrient = PETSC_FALSE;
2203e6ccafaeSMatthew G Knepley       } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge");
2204e6ccafaeSMatthew G Knepley     }
2205e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 6) {
2206e6ccafaeSMatthew G Knepley     /* Quadratic triangle (I hate this) */
2207e6ccafaeSMatthew G Knepley     /* Edges are determined by the first 2 vertices (corners of edges) */
2208e6ccafaeSMatthew G Knepley     const PetscInt faceSizeTri = 3;
2209e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[3], i, iFace;
2210e6ccafaeSMatthew G Knepley     PetscBool      found                    = PETSC_FALSE;
2211e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTriSorted[9] = {
2212e6ccafaeSMatthew G Knepley       0, 3,  4, /* bottom */
2213e6ccafaeSMatthew G Knepley       1, 4,  5, /* right */
2214e6ccafaeSMatthew G Knepley       2, 3,  5, /* left */
2215e6ccafaeSMatthew G Knepley     };
2216e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTri[9] = {
2217e6ccafaeSMatthew G Knepley       0, 3,  4, /* bottom */
2218e6ccafaeSMatthew G Knepley       1, 4,  5, /* right */
2219e6ccafaeSMatthew G Knepley       2, 5,  3, /* left */
2220e6ccafaeSMatthew G Knepley     };
2221e6ccafaeSMatthew G Knepley 
2222e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i];
2223e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr);
2224e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 3; ++iFace) {
2225e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeTri;
2226e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2227e6ccafaeSMatthew G Knepley 
2228e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) &&
2229e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesTriSorted[ii+1])) {
2230e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) {
2231e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) {
2232e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesTri[ii+fVertex]) {
2233e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2234e6ccafaeSMatthew G Knepley               break;
2235e6ccafaeSMatthew G Knepley             }
2236e6ccafaeSMatthew G Knepley           }
2237e6ccafaeSMatthew G Knepley         }
2238e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2239e6ccafaeSMatthew G Knepley         break;
2240e6ccafaeSMatthew G Knepley       }
2241e6ccafaeSMatthew G Knepley     }
2242e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface");
2243e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2244e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2245e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 9) {
2246e6ccafaeSMatthew G Knepley     /* Quadratic quad (I hate this) */
2247e6ccafaeSMatthew G Knepley     /* Edges are determined by the first 2 vertices (corners of edges) */
2248e6ccafaeSMatthew G Knepley     const PetscInt faceSizeQuad = 3;
2249e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[3], i, iFace;
2250e6ccafaeSMatthew G Knepley     PetscBool      found                      = PETSC_FALSE;
2251e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadSorted[12] = {
2252e6ccafaeSMatthew G Knepley       0, 1,  4, /* bottom */
2253e6ccafaeSMatthew G Knepley       1, 2,  5, /* right */
2254e6ccafaeSMatthew G Knepley       2, 3,  6, /* top */
2255e6ccafaeSMatthew G Knepley       0, 3,  7, /* left */
2256e6ccafaeSMatthew G Knepley     };
2257e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuad[12] = {
2258e6ccafaeSMatthew G Knepley       0, 1,  4, /* bottom */
2259e6ccafaeSMatthew G Knepley       1, 2,  5, /* right */
2260e6ccafaeSMatthew G Knepley       2, 3,  6, /* top */
2261e6ccafaeSMatthew G Knepley       3, 0,  7, /* left */
2262e6ccafaeSMatthew G Knepley     };
2263e6ccafaeSMatthew G Knepley 
2264e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i];
2265e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr);
2266e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 4; ++iFace) {
2267e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeQuad;
2268e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2269e6ccafaeSMatthew G Knepley 
2270e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) &&
2271e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) {
2272e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) {
2273e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) {
2274e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) {
2275e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2276e6ccafaeSMatthew G Knepley               break;
2277e6ccafaeSMatthew G Knepley             }
2278e6ccafaeSMatthew G Knepley           }
2279e6ccafaeSMatthew G Knepley         }
2280e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2281e6ccafaeSMatthew G Knepley         break;
2282e6ccafaeSMatthew G Knepley       }
2283e6ccafaeSMatthew G Knepley     }
2284e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface");
2285e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2286e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2287e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 8) {
2288e6ccafaeSMatthew G Knepley     /* Hexes
2289e6ccafaeSMatthew G Knepley        A hex is two oriented quads with the normal of the first
2290e6ccafaeSMatthew G Knepley        pointing up at the second.
2291e6ccafaeSMatthew G Knepley 
2292e6ccafaeSMatthew G Knepley           7---6
2293e6ccafaeSMatthew G Knepley          /|  /|
2294e6ccafaeSMatthew G Knepley         4---5 |
2295ddeab2a6SMatthew G. Knepley         | 1-|-2
2296e6ccafaeSMatthew G Knepley         |/  |/
2297ddeab2a6SMatthew G. Knepley         0---3
2298e6ccafaeSMatthew G Knepley 
2299e6ccafaeSMatthew G Knepley         Faces are determined by the first 4 vertices (corners of faces) */
2300e6ccafaeSMatthew G Knepley     const PetscInt faceSizeHex = 4;
2301e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[4], i, iFace;
2302e6ccafaeSMatthew G Knepley     PetscBool      found                     = PETSC_FALSE;
2303e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesHexSorted[24] = {
2304e6ccafaeSMatthew G Knepley       0, 1, 2, 3,  /* bottom */
2305e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  /* top */
2306ddeab2a6SMatthew G. Knepley       0, 3, 4, 5,  /* front */
2307ddeab2a6SMatthew G. Knepley       2, 3, 5, 6,  /* right */
2308ddeab2a6SMatthew G. Knepley       1, 2, 6, 7,  /* back */
2309ddeab2a6SMatthew G. Knepley       0, 1, 4, 7,  /* left */
2310e6ccafaeSMatthew G Knepley     };
2311e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesHex[24] = {
2312ddeab2a6SMatthew G. Knepley       1, 2, 3, 0,  /* bottom */
2313e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  /* top */
2314ddeab2a6SMatthew G. Knepley       0, 3, 5, 4,  /* front */
2315ddeab2a6SMatthew G. Knepley       3, 2, 6, 5,  /* right */
2316ddeab2a6SMatthew G. Knepley       2, 1, 7, 6,  /* back */
2317ddeab2a6SMatthew G. Knepley       1, 0, 4, 7,  /* left */
2318e6ccafaeSMatthew G Knepley     };
2319e6ccafaeSMatthew G Knepley 
2320e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i];
2321e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr);
2322e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 6; ++iFace) {
2323e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeHex;
2324e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2325e6ccafaeSMatthew G Knepley 
2326e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) &&
2327e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesHexSorted[ii+1]) &&
2328e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesHexSorted[ii+2]) &&
2329e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesHexSorted[ii+3])) {
2330e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) {
2331e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) {
2332e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesHex[ii+fVertex]) {
2333e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2334e6ccafaeSMatthew G Knepley               break;
2335e6ccafaeSMatthew G Knepley             }
2336e6ccafaeSMatthew G Knepley           }
2337e6ccafaeSMatthew G Knepley         }
2338e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2339e6ccafaeSMatthew G Knepley         break;
2340e6ccafaeSMatthew G Knepley       }
2341e6ccafaeSMatthew G Knepley     }
2342e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface");
2343e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2344e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2345e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 10) {
2346e6ccafaeSMatthew G Knepley     /* Quadratic tet */
2347e6ccafaeSMatthew G Knepley     /* Faces are determined by the first 3 vertices (corners of faces) */
2348e6ccafaeSMatthew G Knepley     const PetscInt faceSizeTet = 6;
2349e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[6], i, iFace;
2350e6ccafaeSMatthew G Knepley     PetscBool      found                     = PETSC_FALSE;
2351e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTetSorted[24] = {
2352e6ccafaeSMatthew G Knepley       0, 1, 2,  6, 7, 8, /* bottom */
2353e6ccafaeSMatthew G Knepley       0, 3, 4,  6, 7, 9,  /* front */
2354e6ccafaeSMatthew G Knepley       1, 4, 5,  7, 8, 9,  /* right */
2355e6ccafaeSMatthew G Knepley       2, 3, 5,  6, 8, 9,  /* left */
2356e6ccafaeSMatthew G Knepley     };
2357e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTet[24] = {
2358e6ccafaeSMatthew G Knepley       0, 1, 2,  6, 7, 8, /* bottom */
2359e6ccafaeSMatthew G Knepley       0, 4, 3,  6, 7, 9,  /* front */
2360e6ccafaeSMatthew G Knepley       1, 5, 4,  7, 8, 9,  /* right */
2361e6ccafaeSMatthew G Knepley       2, 3, 5,  8, 6, 9,  /* left */
2362e6ccafaeSMatthew G Knepley     };
2363e6ccafaeSMatthew G Knepley 
2364e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i];
2365e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr);
2366e6ccafaeSMatthew G Knepley     for (iFace=0; iFace < 4; ++iFace) {
2367e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeTet;
2368e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2369e6ccafaeSMatthew G Knepley 
2370e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) &&
2371e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesTetSorted[ii+1]) &&
2372e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesTetSorted[ii+2]) &&
2373e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesTetSorted[ii+3])) {
2374e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) {
2375e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) {
2376e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesTet[ii+fVertex]) {
2377e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2378e6ccafaeSMatthew G Knepley               break;
2379e6ccafaeSMatthew G Knepley             }
2380e6ccafaeSMatthew G Knepley           }
2381e6ccafaeSMatthew G Knepley         }
2382e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2383e6ccafaeSMatthew G Knepley         break;
2384e6ccafaeSMatthew G Knepley       }
2385e6ccafaeSMatthew G Knepley     }
2386e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface");
2387e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2388e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2389e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 27) {
2390e6ccafaeSMatthew G Knepley     /* Quadratic hexes (I hate this)
2391e6ccafaeSMatthew G Knepley        A hex is two oriented quads with the normal of the first
2392e6ccafaeSMatthew G Knepley        pointing up at the second.
2393e6ccafaeSMatthew G Knepley 
2394e6ccafaeSMatthew G Knepley          7---6
2395e6ccafaeSMatthew G Knepley         /|  /|
2396e6ccafaeSMatthew G Knepley        4---5 |
2397e6ccafaeSMatthew G Knepley        | 3-|-2
2398e6ccafaeSMatthew G Knepley        |/  |/
2399e6ccafaeSMatthew G Knepley        0---1
2400e6ccafaeSMatthew G Knepley 
2401e6ccafaeSMatthew G Knepley        Faces are determined by the first 4 vertices (corners of faces) */
2402e6ccafaeSMatthew G Knepley     const PetscInt faceSizeQuadHex = 9;
2403e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[9], i, iFace;
2404e6ccafaeSMatthew G Knepley     PetscBool      found                         = PETSC_FALSE;
2405e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadHexSorted[54] = {
2406e6ccafaeSMatthew G Knepley       0, 1, 2, 3,  8, 9, 10, 11,  24, /* bottom */
2407e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  12, 13, 14, 15,  25, /* top */
2408e6ccafaeSMatthew G Knepley       0, 1, 4, 5,  8, 12, 16, 17,  22, /* front */
2409e6ccafaeSMatthew G Knepley       1, 2, 5, 6,  9, 13, 17, 18,  21, /* right */
2410e6ccafaeSMatthew G Knepley       2, 3, 6, 7,  10, 14, 18, 19,  23, /* back */
2411e6ccafaeSMatthew G Knepley       0, 3, 4, 7,  11, 15, 16, 19,  20, /* left */
2412e6ccafaeSMatthew G Knepley     };
2413e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadHex[54] = {
2414e6ccafaeSMatthew G Knepley       3, 2, 1, 0,  10, 9, 8, 11,  24, /* bottom */
2415e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  12, 13, 14, 15,  25, /* top */
2416e6ccafaeSMatthew G Knepley       0, 1, 5, 4,  8, 17, 12, 16,  22, /* front */
2417e6ccafaeSMatthew G Knepley       1, 2, 6, 5,  9, 18, 13, 17,  21, /* right */
2418e6ccafaeSMatthew G Knepley       2, 3, 7, 6,  10, 19, 14, 18,  23, /* back */
2419e6ccafaeSMatthew G Knepley       3, 0, 4, 7,  11, 16, 15, 19,  20 /* left */
2420e6ccafaeSMatthew G Knepley     };
2421e6ccafaeSMatthew G Knepley 
2422e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i];
2423e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr);
2424e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 6; ++iFace) {
2425e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeQuadHex;
2426e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2427e6ccafaeSMatthew G Knepley 
2428e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) &&
2429e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) &&
2430e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) &&
2431e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) {
2432e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) {
2433e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) {
2434e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) {
2435e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2436e6ccafaeSMatthew G Knepley               break;
2437e6ccafaeSMatthew G Knepley             }
2438e6ccafaeSMatthew G Knepley           }
2439e6ccafaeSMatthew G Knepley         }
2440e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2441e6ccafaeSMatthew G Knepley         break;
2442e6ccafaeSMatthew G Knepley       }
2443e6ccafaeSMatthew G Knepley     }
2444e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface");
2445e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2446e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2447e6ccafaeSMatthew G Knepley   } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation().");
2448e6ccafaeSMatthew G Knepley   if (!posOrient) {
2449e6ccafaeSMatthew G Knepley     if (debug) {ierr = PetscPrintf(comm, "  Reversing initial face orientation\n");CHKERRQ(ierr);}
2450e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f];
2451e6ccafaeSMatthew G Knepley   } else {
2452e6ccafaeSMatthew G Knepley     if (debug) {ierr = PetscPrintf(comm, "  Keeping initial face orientation\n");CHKERRQ(ierr);}
2453e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f];
2454e6ccafaeSMatthew G Knepley   }
2455e6ccafaeSMatthew G Knepley   if (posOriented) *posOriented = posOrient;
2456e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2457e6ccafaeSMatthew G Knepley }
2458e6ccafaeSMatthew G Knepley 
2459c08575a3SMatthew G. Knepley /*@
2460c08575a3SMatthew G. Knepley   DMPlexGetOrientedFace - Given a cell and a face, as a set of vertices, return the oriented face, as a set of vertices,
2461c08575a3SMatthew G. Knepley   in faceVertices. The orientation is such that the face normal points out of the cell
2462c08575a3SMatthew G. Knepley 
2463c08575a3SMatthew G. Knepley   Not collective
2464c08575a3SMatthew G. Knepley 
2465c08575a3SMatthew G. Knepley   Input Parameters:
2466c08575a3SMatthew G. Knepley + dm           - The original mesh
2467c08575a3SMatthew G. Knepley . cell         - The cell mesh point
2468c08575a3SMatthew G. Knepley . faceSize     - The number of vertices on the face
2469c08575a3SMatthew G. Knepley . face         - The face vertices
2470c08575a3SMatthew G. Knepley . numCorners   - The number of vertices on the cell
2471c08575a3SMatthew G. Knepley . indices      - Local numbering of face vertices in cell cone
2472c08575a3SMatthew G. Knepley - origVertices - Original face vertices
2473c08575a3SMatthew G. Knepley 
2474c08575a3SMatthew G. Knepley   Output Parameter:
2475c08575a3SMatthew G. Knepley + faceVertices - The face vertices properly oriented
2476c08575a3SMatthew G. Knepley - posOriented  - PETSC_TRUE if the face was oriented with outward normal
2477c08575a3SMatthew G. Knepley 
2478c08575a3SMatthew G. Knepley   Level: developer
2479c08575a3SMatthew G. Knepley 
2480c08575a3SMatthew G. Knepley .seealso: DMPlexGetCone()
2481c08575a3SMatthew G. Knepley @*/
2482e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented)
2483e6ccafaeSMatthew G Knepley {
24840298fd71SBarry Smith   const PetscInt *cone = NULL;
2485e6ccafaeSMatthew G Knepley   PetscInt        coneSize, v, f, v2;
2486e6ccafaeSMatthew G Knepley   PetscInt        oppositeVertex = -1;
2487e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2488e6ccafaeSMatthew G Knepley 
2489e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
2490e6ccafaeSMatthew G Knepley   ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr);
2491e6ccafaeSMatthew G Knepley   ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
2492e6ccafaeSMatthew G Knepley   for (v = 0, v2 = 0; v < coneSize; ++v) {
2493e6ccafaeSMatthew G Knepley     PetscBool found = PETSC_FALSE;
2494e6ccafaeSMatthew G Knepley 
2495e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) {
2496e6ccafaeSMatthew G Knepley       if (face[f] == cone[v]) {
2497e6ccafaeSMatthew G Knepley         found = PETSC_TRUE; break;
2498e6ccafaeSMatthew G Knepley       }
2499e6ccafaeSMatthew G Knepley     }
2500e6ccafaeSMatthew G Knepley     if (found) {
2501e6ccafaeSMatthew G Knepley       indices[v2]      = v;
2502e6ccafaeSMatthew G Knepley       origVertices[v2] = cone[v];
2503e6ccafaeSMatthew G Knepley       ++v2;
2504e6ccafaeSMatthew G Knepley     } else {
2505e6ccafaeSMatthew G Knepley       oppositeVertex = v;
2506e6ccafaeSMatthew G Knepley     }
2507e6ccafaeSMatthew G Knepley   }
2508e6ccafaeSMatthew G Knepley   ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr);
2509e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2510e6ccafaeSMatthew G Knepley }
2511e6ccafaeSMatthew G Knepley 
2512e6ccafaeSMatthew G Knepley /*
2513cd0c2139SMatthew G Knepley   DMPlexInsertFace_Internal - Puts a face into the mesh
2514e6ccafaeSMatthew G Knepley 
2515e6ccafaeSMatthew G Knepley   Not collective
2516e6ccafaeSMatthew G Knepley 
2517e6ccafaeSMatthew G Knepley   Input Parameters:
2518e6ccafaeSMatthew G Knepley   + dm              - The DMPlex
2519e6ccafaeSMatthew G Knepley   . numFaceVertex   - The number of vertices in the face
2520e6ccafaeSMatthew G Knepley   . faceVertices    - The vertices in the face for dm
2521e6ccafaeSMatthew G Knepley   . subfaceVertices - The vertices in the face for subdm
2522e6ccafaeSMatthew G Knepley   . numCorners      - The number of vertices in the cell
2523e6ccafaeSMatthew G Knepley   . cell            - A cell in dm containing the face
2524e6ccafaeSMatthew G Knepley   . subcell         - A cell in subdm containing the face
2525e6ccafaeSMatthew G Knepley   . firstFace       - First face in the mesh
2526e6ccafaeSMatthew G Knepley   - newFacePoint    - Next face in the mesh
2527e6ccafaeSMatthew G Knepley 
2528e6ccafaeSMatthew G Knepley   Output Parameters:
2529e6ccafaeSMatthew G Knepley   . newFacePoint - Contains next face point number on input, updated on output
2530e6ccafaeSMatthew G Knepley 
2531e6ccafaeSMatthew G Knepley   Level: developer
2532e6ccafaeSMatthew G Knepley */
2533cd0c2139SMatthew 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)
2534e6ccafaeSMatthew G Knepley {
253582f516ccSBarry Smith   MPI_Comm        comm;
2536e6ccafaeSMatthew G Knepley   DM_Plex        *submesh = (DM_Plex*) subdm->data;
2537e6ccafaeSMatthew G Knepley   const PetscInt *faces;
2538e6ccafaeSMatthew G Knepley   PetscInt        numFaces, coneSize;
2539e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2540e6ccafaeSMatthew G Knepley 
2541e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
254282f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2543e6ccafaeSMatthew G Knepley   ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr);
2544e6ccafaeSMatthew G Knepley   if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize);
2545e6ccafaeSMatthew G Knepley #if 0
2546e6ccafaeSMatthew G Knepley   /* Cannot use this because support() has not been constructed yet */
2547e6ccafaeSMatthew G Knepley   ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr);
2548e6ccafaeSMatthew G Knepley #else
2549e6ccafaeSMatthew G Knepley   {
2550e6ccafaeSMatthew G Knepley     PetscInt f;
2551e6ccafaeSMatthew G Knepley 
2552e6ccafaeSMatthew G Knepley     numFaces = 0;
2553e6ccafaeSMatthew G Knepley     ierr     = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr);
2554e6ccafaeSMatthew G Knepley     for (f = firstFace; f < *newFacePoint; ++f) {
2555e6ccafaeSMatthew G Knepley       PetscInt dof, off, d;
2556e6ccafaeSMatthew G Knepley 
2557e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr);
2558e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr);
2559e6ccafaeSMatthew G Knepley       /* Yes, I know this is quadratic, but I expect the sizes to be <5 */
2560e6ccafaeSMatthew G Knepley       for (d = 0; d < dof; ++d) {
2561e6ccafaeSMatthew G Knepley         const PetscInt p = submesh->cones[off+d];
2562e6ccafaeSMatthew G Knepley         PetscInt       v;
2563e6ccafaeSMatthew G Knepley 
2564e6ccafaeSMatthew G Knepley         for (v = 0; v < numFaceVertices; ++v) {
2565e6ccafaeSMatthew G Knepley           if (subfaceVertices[v] == p) break;
2566e6ccafaeSMatthew G Knepley         }
2567e6ccafaeSMatthew G Knepley         if (v == numFaceVertices) break;
2568e6ccafaeSMatthew G Knepley       }
2569e6ccafaeSMatthew G Knepley       if (d == dof) {
2570e6ccafaeSMatthew G Knepley         numFaces               = 1;
2571e6ccafaeSMatthew G Knepley         ((PetscInt*) faces)[0] = f;
2572e6ccafaeSMatthew G Knepley       }
2573e6ccafaeSMatthew G Knepley     }
2574e6ccafaeSMatthew G Knepley   }
2575e6ccafaeSMatthew G Knepley #endif
2576e6ccafaeSMatthew G Knepley   if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces);
2577e6ccafaeSMatthew G Knepley   else if (numFaces == 1) {
2578e6ccafaeSMatthew G Knepley     /* Add the other cell neighbor for this face */
2579766ab985SMatthew G. Knepley     ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr);
2580e6ccafaeSMatthew G Knepley   } else {
2581e6ccafaeSMatthew G Knepley     PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov;
2582e6ccafaeSMatthew G Knepley     PetscBool posOriented;
2583e6ccafaeSMatthew G Knepley 
2584e6ccafaeSMatthew G Knepley     ierr                = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr);
2585e6ccafaeSMatthew G Knepley     origVertices        = &orientedVertices[numFaceVertices];
2586e6ccafaeSMatthew G Knepley     indices             = &orientedVertices[numFaceVertices*2];
2587e6ccafaeSMatthew G Knepley     orientedSubVertices = &orientedVertices[numFaceVertices*3];
2588e6ccafaeSMatthew G Knepley     ierr                = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr);
2589e6ccafaeSMatthew G Knepley     /* TODO: I know that routine should return a permutation, not the indices */
2590e6ccafaeSMatthew G Knepley     for (v = 0; v < numFaceVertices; ++v) {
2591e6ccafaeSMatthew G Knepley       const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v];
2592e6ccafaeSMatthew G Knepley       for (ov = 0; ov < numFaceVertices; ++ov) {
2593e6ccafaeSMatthew G Knepley         if (orientedVertices[ov] == vertex) {
2594e6ccafaeSMatthew G Knepley           orientedSubVertices[ov] = subvertex;
2595e6ccafaeSMatthew G Knepley           break;
2596e6ccafaeSMatthew G Knepley         }
2597e6ccafaeSMatthew G Knepley       }
2598e6ccafaeSMatthew G Knepley       if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex);
2599e6ccafaeSMatthew G Knepley     }
2600e6ccafaeSMatthew G Knepley     ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr);
2601e6ccafaeSMatthew G Knepley     ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr);
2602e6ccafaeSMatthew G Knepley     ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr);
2603e6ccafaeSMatthew G Knepley     ++(*newFacePoint);
2604e6ccafaeSMatthew G Knepley   }
2605ef07cca7SMatthew G. Knepley #if 0
2606e6ccafaeSMatthew G Knepley   ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr);
2607ef07cca7SMatthew G. Knepley #else
2608ef07cca7SMatthew G. Knepley   ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr);
2609ef07cca7SMatthew G. Knepley #endif
2610e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2611e6ccafaeSMatthew G Knepley }
2612e6ccafaeSMatthew G Knepley 
261353156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm)
2614e6ccafaeSMatthew G Knepley {
261582f516ccSBarry Smith   MPI_Comm        comm;
261653156dfcSMatthew G. Knepley   DMLabel         subpointMap;
2617efa14ee0SMatthew G Knepley   IS              subvertexIS,  subcellIS;
2618efa14ee0SMatthew G Knepley   const PetscInt *subVertices, *subCells;
2619efa14ee0SMatthew G Knepley   PetscInt        numSubVertices, firstSubVertex, numSubCells;
2620fed694aaSMatthew G. Knepley   PetscInt       *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0;
2621efa14ee0SMatthew G Knepley   PetscInt        vStart, vEnd, c, f;
2622e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2623e6ccafaeSMatthew G Knepley 
2624e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
262582f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2626efa14ee0SMatthew G Knepley   /* Create subpointMap which marks the submesh */
2627efa14ee0SMatthew G Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2628efa14ee0SMatthew G Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2629efa14ee0SMatthew G Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
263053156dfcSMatthew G. Knepley   if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);}
2631efa14ee0SMatthew G Knepley   /* Setup chart */
2632efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr);
2633efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr);
2634efa14ee0SMatthew G Knepley   ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr);
2635efa14ee0SMatthew G Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2636e6ccafaeSMatthew G Knepley   /* Set cone sizes */
2637e6ccafaeSMatthew G Knepley   firstSubVertex = numSubCells;
2638efa14ee0SMatthew G Knepley   firstSubFace   = numSubCells+numSubVertices;
2639e6ccafaeSMatthew G Knepley   newFacePoint   = firstSubFace;
2640efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr);
2641efa14ee0SMatthew G Knepley   if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2642efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr);
2643efa14ee0SMatthew G Knepley   if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);}
2644e6ccafaeSMatthew G Knepley   for (c = 0; c < numSubCells; ++c) {
2645e6ccafaeSMatthew G Knepley     ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr);
2646e6ccafaeSMatthew G Knepley   }
2647e6ccafaeSMatthew G Knepley   for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) {
2648e6ccafaeSMatthew G Knepley     ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr);
2649e6ccafaeSMatthew G Knepley   }
2650e6ccafaeSMatthew G Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2651e6ccafaeSMatthew G Knepley   /* Create face cones */
2652efa14ee0SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
26530298fd71SBarry Smith   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
2654efa14ee0SMatthew G Knepley   ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2655e6ccafaeSMatthew G Knepley   for (c = 0; c < numSubCells; ++c) {
2656e6ccafaeSMatthew G Knepley     const PetscInt cell    = subCells[c];
2657efa14ee0SMatthew G Knepley     const PetscInt subcell = c;
26580298fd71SBarry Smith     PetscInt      *closure = NULL;
2659efa14ee0SMatthew G Knepley     PetscInt       closureSize, cl, numCorners = 0, faceSize = 0;
2660e6ccafaeSMatthew G Knepley 
2661e6ccafaeSMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2662efa14ee0SMatthew G Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
2663efa14ee0SMatthew G Knepley       const PetscInt point = closure[cl];
2664e6ccafaeSMatthew G Knepley       PetscInt       subVertex;
2665e6ccafaeSMatthew G Knepley 
2666efa14ee0SMatthew G Knepley       if ((point >= vStart) && (point < vEnd)) {
2667efa14ee0SMatthew G Knepley         ++numCorners;
2668efa14ee0SMatthew G Knepley         ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr);
2669efa14ee0SMatthew G Knepley         if (subVertex >= 0) {
2670efa14ee0SMatthew G Knepley           closure[faceSize] = point;
267165560c7fSMatthew G Knepley           subface[faceSize] = firstSubVertex+subVertex;
2672e6ccafaeSMatthew G Knepley           ++faceSize;
2673e6ccafaeSMatthew G Knepley         }
2674e6ccafaeSMatthew G Knepley       }
2675e6ccafaeSMatthew G Knepley     }
2676efa14ee0SMatthew G Knepley     if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize);
2677efa14ee0SMatthew G Knepley     if (faceSize == nFV) {
2678cd0c2139SMatthew G Knepley       ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr);
2679e6ccafaeSMatthew G Knepley     }
268065560c7fSMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2681e6ccafaeSMatthew G Knepley   }
2682efa14ee0SMatthew G Knepley   ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2683e6ccafaeSMatthew G Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2684e6ccafaeSMatthew G Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2685e6ccafaeSMatthew G Knepley   /* Build coordinates */
2686efa14ee0SMatthew G Knepley   {
2687efa14ee0SMatthew G Knepley     PetscSection coordSection, subCoordSection;
2688efa14ee0SMatthew G Knepley     Vec          coordinates, subCoordinates;
2689efa14ee0SMatthew G Knepley     PetscScalar *coords, *subCoords;
2690285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize, v;
269124640c55SToby Isaac     const char  *name;
2692efa14ee0SMatthew G Knepley 
269369d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2694e6ccafaeSMatthew G Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
269569d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2696285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2697285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2698285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2699efa14ee0SMatthew G Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr);
2700efa14ee0SMatthew G Knepley     for (v = 0; v < numSubVertices; ++v) {
2701efa14ee0SMatthew G Knepley       const PetscInt vertex    = subVertices[v];
2702efa14ee0SMatthew G Knepley       const PetscInt subvertex = firstSubVertex+v;
2703efa14ee0SMatthew G Knepley       PetscInt       dof;
2704efa14ee0SMatthew G Knepley 
2705efa14ee0SMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2706efa14ee0SMatthew G Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2707285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2708e6ccafaeSMatthew G Knepley     }
2709e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2710e6ccafaeSMatthew G Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
27118b9ced59SLisandro Dalcin     ierr = VecCreate(PETSC_COMM_SELF, &subCoordinates);CHKERRQ(ierr);
271224640c55SToby Isaac     ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr);
271324640c55SToby Isaac     ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr);
2714e6ccafaeSMatthew G Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
27152eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2716830e53efSMatthew G. Knepley     if (coordSize) {
2717e6ccafaeSMatthew G Knepley       ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2718e6ccafaeSMatthew G Knepley       ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2719efa14ee0SMatthew G Knepley       for (v = 0; v < numSubVertices; ++v) {
2720efa14ee0SMatthew G Knepley         const PetscInt vertex    = subVertices[v];
2721efa14ee0SMatthew G Knepley         const PetscInt subvertex = firstSubVertex+v;
2722efa14ee0SMatthew G Knepley         PetscInt       dof, off, sdof, soff, d;
2723e6ccafaeSMatthew G Knepley 
2724e6ccafaeSMatthew G Knepley         ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2725e6ccafaeSMatthew G Knepley         ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2726efa14ee0SMatthew G Knepley         ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2727efa14ee0SMatthew G Knepley         ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2728efa14ee0SMatthew 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);
2729e6ccafaeSMatthew G Knepley         for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2730e6ccafaeSMatthew G Knepley       }
2731e6ccafaeSMatthew G Knepley       ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2732e6ccafaeSMatthew G Knepley       ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
27333b399e24SMatthew G. Knepley     }
2734e6ccafaeSMatthew G Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2735e6ccafaeSMatthew G Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2736e6ccafaeSMatthew G Knepley   }
2737efa14ee0SMatthew G Knepley   /* Cleanup */
2738efa14ee0SMatthew G Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2739efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
2740efa14ee0SMatthew G Knepley   if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);}
2741efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subcellIS);CHKERRQ(ierr);
2742e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2743e6ccafaeSMatthew G Knepley }
2744e6ccafaeSMatthew G Knepley 
27453982b651SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[])
27463982b651SMatthew G. Knepley {
27473982b651SMatthew G. Knepley   PetscInt       subPoint;
27483982b651SMatthew G. Knepley   PetscErrorCode ierr;
27493982b651SMatthew G. Knepley 
27503982b651SMatthew G. Knepley   ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr;
27513982b651SMatthew G. Knepley   return subPoint < 0 ? subPoint : firstSubPoint+subPoint;
27523982b651SMatthew G. Knepley }
27533982b651SMatthew G. Knepley 
2754bec263e5SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmeshGeneric_Interpolated(DM dm, DMLabel label, PetscInt value, PetscBool isCohesive, PetscInt cellHeight, DM subdm)
2755e6ccafaeSMatthew G Knepley {
275682f516ccSBarry Smith   MPI_Comm         comm;
275753156dfcSMatthew G. Knepley   DMLabel          subpointMap;
2758efa14ee0SMatthew G Knepley   IS              *subpointIS;
2759efa14ee0SMatthew G Knepley   const PetscInt **subpoints;
27603982b651SMatthew G. Knepley   PetscInt        *numSubPoints, *firstSubPoint, *coneNew, *orntNew;
27610d366550SMatthew G. Knepley   PetscInt         totSubPoints = 0, maxConeSize, cMax, cEnd, dim, p, d, v;
27620d366550SMatthew G. Knepley   PetscMPIInt      rank;
2763e6ccafaeSMatthew G Knepley   PetscErrorCode   ierr;
2764e6ccafaeSMatthew G Knepley 
2765e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
276682f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
27670d366550SMatthew G. Knepley   ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
2768efa14ee0SMatthew G Knepley   /* Create subpointMap which marks the submesh */
2769e6ccafaeSMatthew G Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2770efa14ee0SMatthew G Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2771bec263e5SMatthew G. Knepley   if (cellHeight) {
27723982b651SMatthew G. Knepley     if (isCohesive) {ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);}
27733982b651SMatthew G. Knepley     else            {ierr = DMPlexMarkSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);}
2774bec263e5SMatthew G. Knepley   } else {
2775bec263e5SMatthew G. Knepley     DMLabel         depth;
2776bec263e5SMatthew G. Knepley     IS              pointIS;
2777bec263e5SMatthew G. Knepley     const PetscInt *points;
2778bec263e5SMatthew G. Knepley     PetscInt        numPoints;
2779bec263e5SMatthew G. Knepley 
2780bec263e5SMatthew G. Knepley     ierr = DMPlexGetDepthLabel(dm, &depth);CHKERRQ(ierr);
2781bec263e5SMatthew G. Knepley     ierr = DMLabelGetStratumSize(label, value, &numPoints);CHKERRQ(ierr);
2782bec263e5SMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, value, &pointIS);CHKERRQ(ierr);
2783bec263e5SMatthew G. Knepley     ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
2784bec263e5SMatthew G. Knepley     for (p = 0; p < numPoints; ++p) {
2785bec263e5SMatthew G. Knepley       PetscInt *closure = NULL;
2786bec263e5SMatthew G. Knepley       PetscInt  closureSize, c, pdim;
2787bec263e5SMatthew G. Knepley 
2788bec263e5SMatthew G. Knepley       ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2789bec263e5SMatthew G. Knepley       for (c = 0; c < closureSize*2; c += 2) {
2790bec263e5SMatthew G. Knepley         ierr = DMLabelGetValue(depth, closure[c], &pdim);CHKERRQ(ierr);
2791bec263e5SMatthew G. Knepley         ierr = DMLabelSetValue(subpointMap, closure[c], pdim);CHKERRQ(ierr);
2792bec263e5SMatthew G. Knepley       }
2793bec263e5SMatthew G. Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2794bec263e5SMatthew G. Knepley     }
2795bec263e5SMatthew G. Knepley     ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);
2796bec263e5SMatthew G. Knepley     ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
2797bec263e5SMatthew G. Knepley   }
2798bec263e5SMatthew G. Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
27990d366550SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
28000d366550SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
28010d366550SMatthew G. Knepley   cMax = (cMax < 0) ? cEnd : cMax;
2802efa14ee0SMatthew G Knepley   /* Setup chart */
2803c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
2804dcca6d9dSJed Brown   ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr);
2805e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2806e6ccafaeSMatthew G Knepley     ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr);
2807e6ccafaeSMatthew G Knepley     totSubPoints += numSubPoints[d];
2808e6ccafaeSMatthew G Knepley   }
2809e6ccafaeSMatthew G Knepley   ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr);
2810bec263e5SMatthew G. Knepley   ierr = DMPlexSetVTKCellHeight(subdm, cellHeight);CHKERRQ(ierr);
2811e6ccafaeSMatthew G Knepley   /* Set cone sizes */
2812e6ccafaeSMatthew G Knepley   firstSubPoint[dim] = 0;
2813e6ccafaeSMatthew G Knepley   firstSubPoint[0]   = firstSubPoint[dim] + numSubPoints[dim];
2814e6ccafaeSMatthew G Knepley   if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0]     + numSubPoints[0];}
2815e6ccafaeSMatthew G Knepley   if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];}
2816e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2817e6ccafaeSMatthew G Knepley     ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr);
28180ae02aa4SMatthew G. Knepley     if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);}
2819e6ccafaeSMatthew G Knepley   }
2820e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2821e6ccafaeSMatthew G Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2822e6ccafaeSMatthew G Knepley       const PetscInt  point    = subpoints[d][p];
2823e6ccafaeSMatthew G Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
2824e6ccafaeSMatthew G Knepley       const PetscInt *cone;
2825e6ccafaeSMatthew G Knepley       PetscInt        coneSize, coneSizeNew, c, val;
2826e6ccafaeSMatthew G Knepley 
2827e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2828e6ccafaeSMatthew G Knepley       ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr);
2829bec263e5SMatthew G. Knepley       if (cellHeight && (d == dim)) {
2830e6ccafaeSMatthew G Knepley         ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
2831e6ccafaeSMatthew G Knepley         for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2832e6ccafaeSMatthew G Knepley           ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr);
2833e6ccafaeSMatthew G Knepley           if (val >= 0) coneSizeNew++;
2834e6ccafaeSMatthew G Knepley         }
2835e6ccafaeSMatthew G Knepley         ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr);
2836e6ccafaeSMatthew G Knepley       }
2837e6ccafaeSMatthew G Knepley     }
2838e6ccafaeSMatthew G Knepley   }
2839e6ccafaeSMatthew G Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2840e6ccafaeSMatthew G Knepley   /* Set cones */
28410298fd71SBarry Smith   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
28423982b651SMatthew G. Knepley   ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&orntNew);CHKERRQ(ierr);
2843e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2844e6ccafaeSMatthew G Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2845e6ccafaeSMatthew G Knepley       const PetscInt  point    = subpoints[d][p];
2846e6ccafaeSMatthew G Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
28470e49e2e2SMatthew G. Knepley       const PetscInt *cone, *ornt;
28480d366550SMatthew G. Knepley       PetscInt        coneSize, subconeSize, coneSizeNew, c, subc, fornt = 0;
2849e6ccafaeSMatthew G Knepley 
28500d366550SMatthew G. Knepley       if (d == dim-1) {
28510d366550SMatthew G. Knepley         const PetscInt *support, *cone, *ornt;
28520d366550SMatthew G. Knepley         PetscInt        supportSize, coneSize, s, subc;
28530d366550SMatthew G. Knepley 
28540d366550SMatthew G. Knepley         ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr);
28550d366550SMatthew G. Knepley         ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr);
28560d366550SMatthew G. Knepley         for (s = 0; s < supportSize; ++s) {
28570d366550SMatthew G. Knepley           if ((support[s] < cMax) || (support[s] >= cEnd)) continue;
28580d366550SMatthew G. Knepley           ierr = PetscFindInt(support[s], numSubPoints[d+1], subpoints[d+1], &subc);CHKERRQ(ierr);
28590d366550SMatthew G. Knepley           if (subc >= 0) {
28600d366550SMatthew G. Knepley             const PetscInt ccell = subpoints[d+1][subc];
28610d366550SMatthew G. Knepley 
28620d366550SMatthew G. Knepley             ierr = DMPlexGetCone(dm, ccell, &cone);
28630d366550SMatthew G. Knepley             ierr = DMPlexGetConeSize(dm, ccell, &coneSize);
28640d366550SMatthew G. Knepley             ierr = DMPlexGetConeOrientation(dm, ccell, &ornt);
28650d366550SMatthew G. Knepley             for (c = 0; c < coneSize; ++c) {
28660d366550SMatthew G. Knepley               if (cone[c] == point) {
28670d366550SMatthew G. Knepley                 fornt = ornt[c];
28680d366550SMatthew G. Knepley                 break;
28690d366550SMatthew G. Knepley               }
28700d366550SMatthew G. Knepley             }
28710d366550SMatthew G. Knepley             break;
28720d366550SMatthew G. Knepley           }
28730d366550SMatthew G. Knepley         }
28740d366550SMatthew G. Knepley       }
2875e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2876e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
2877e6ccafaeSMatthew G Knepley       ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
28780e49e2e2SMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr);
2879e6ccafaeSMatthew G Knepley       for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2880e6ccafaeSMatthew G Knepley         ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr);
288101a2673eSMatthew G. Knepley         if (subc >= 0) {
288201a2673eSMatthew G. Knepley           coneNew[coneSizeNew] = firstSubPoint[d-1] + subc;
28833982b651SMatthew G. Knepley           orntNew[coneSizeNew] = ornt[c];
288401a2673eSMatthew G. Knepley           ++coneSizeNew;
288501a2673eSMatthew G. Knepley         }
2886e6ccafaeSMatthew G Knepley       }
2887e6ccafaeSMatthew G Knepley       if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize);
28880d366550SMatthew G. Knepley       if (fornt < 0) {
28890d366550SMatthew G. Knepley         /* This should be replaced by a call to DMPlexReverseCell() */
28900d366550SMatthew G. Knepley #if 0
2891a129c400SMatthew G. Knepley         ierr = DMPlexReverseCell(subdm, subpoint);CHKERRQ(ierr);
2892a129c400SMatthew G. Knepley #else
2893c0b40891SMatthew G. Knepley         for (c = 0; c < coneSizeNew/2 + coneSizeNew%2; ++c) {
2894a129c400SMatthew G. Knepley           PetscInt faceSize, tmp;
28950d366550SMatthew G. Knepley 
28960d366550SMatthew G. Knepley           tmp        = coneNew[c];
28970d366550SMatthew G. Knepley           coneNew[c] = coneNew[coneSizeNew-1-c];
28980d366550SMatthew G. Knepley           coneNew[coneSizeNew-1-c] = tmp;
2899a129c400SMatthew G. Knepley           ierr = DMPlexGetConeSize(dm, cone[c], &faceSize);CHKERRQ(ierr);
2900a129c400SMatthew G. Knepley           tmp        = orntNew[c] >= 0 ? -(faceSize-orntNew[c]) : faceSize+orntNew[c];
2901a129c400SMatthew G. Knepley           orntNew[c] = orntNew[coneSizeNew-1-c] >= 0 ? -(faceSize-orntNew[coneSizeNew-1-c]) : faceSize+orntNew[coneSizeNew-1-c];
29020d366550SMatthew G. Knepley           orntNew[coneSizeNew-1-c] = tmp;
29030d366550SMatthew G. Knepley         }
29040d366550SMatthew G. Knepley       }
2905e6ccafaeSMatthew G Knepley       ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr);
29063982b651SMatthew G. Knepley       ierr = DMPlexSetConeOrientation(subdm, subpoint, orntNew);CHKERRQ(ierr);
2907a129c400SMatthew G. Knepley #endif
2908e6ccafaeSMatthew G Knepley     }
2909e6ccafaeSMatthew G Knepley   }
29103982b651SMatthew G. Knepley   ierr = PetscFree2(coneNew,orntNew);CHKERRQ(ierr);
2911e6ccafaeSMatthew G Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2912e6ccafaeSMatthew G Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2913e6ccafaeSMatthew G Knepley   /* Build coordinates */
2914e6ccafaeSMatthew G Knepley   {
2915e6ccafaeSMatthew G Knepley     PetscSection coordSection, subCoordSection;
2916e6ccafaeSMatthew G Knepley     Vec          coordinates, subCoordinates;
2917e6ccafaeSMatthew G Knepley     PetscScalar *coords, *subCoords;
2918*c0e8cf5fSMatthew G. Knepley     PetscInt     cdim, numComp, coordSize;
291924640c55SToby Isaac     const char  *name;
2920e6ccafaeSMatthew G Knepley 
2921*c0e8cf5fSMatthew G. Knepley     ierr = DMGetCoordinateDim(dm, &cdim);CHKERRQ(ierr);
292269d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2923e6ccafaeSMatthew G Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
292469d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2925285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2926285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2927285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2928e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr);
2929e6ccafaeSMatthew G Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2930e6ccafaeSMatthew G Knepley       const PetscInt vertex    = subpoints[0][v];
2931e6ccafaeSMatthew G Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2932e6ccafaeSMatthew G Knepley       PetscInt       dof;
2933e6ccafaeSMatthew G Knepley 
2934e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2935e6ccafaeSMatthew G Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2936285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2937e6ccafaeSMatthew G Knepley     }
2938e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2939e6ccafaeSMatthew G Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
29408b9ced59SLisandro Dalcin     ierr = VecCreate(PETSC_COMM_SELF, &subCoordinates);CHKERRQ(ierr);
294124640c55SToby Isaac     ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr);
294224640c55SToby Isaac     ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr);
2943e6ccafaeSMatthew G Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
2944*c0e8cf5fSMatthew G. Knepley     ierr = VecSetBlockSize(subCoordinates, cdim);CHKERRQ(ierr);
29452eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2946e6ccafaeSMatthew G Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2947e6ccafaeSMatthew G Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2948e6ccafaeSMatthew G Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2949e6ccafaeSMatthew G Knepley       const PetscInt vertex    = subpoints[0][v];
2950e6ccafaeSMatthew G Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2951e6ccafaeSMatthew G Knepley       PetscInt dof, off, sdof, soff, d;
2952e6ccafaeSMatthew G Knepley 
2953e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2954e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2955e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2956e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2957e6ccafaeSMatthew 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);
2958efa14ee0SMatthew G Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2959e6ccafaeSMatthew G Knepley     }
2960e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2961e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2962e6ccafaeSMatthew G Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2963e6ccafaeSMatthew G Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2964e6ccafaeSMatthew G Knepley   }
29653982b651SMatthew G. Knepley   /* Build SF: We need this complexity because subpoints might not be selected on the owning process */
29663982b651SMatthew G. Knepley   {
29673982b651SMatthew G. Knepley     PetscSF            sfPoint, sfPointSub;
29683982b651SMatthew G. Knepley     IS                 subpIS;
29693982b651SMatthew G. Knepley     const PetscSFNode *remotePoints;
29703982b651SMatthew G. Knepley     PetscSFNode       *sremotePoints, *newLocalPoints, *newOwners;
29713982b651SMatthew G. Knepley     const PetscInt    *localPoints, *subpoints;
29723982b651SMatthew G. Knepley     PetscInt          *slocalPoints;
29733982b651SMatthew G. Knepley     PetscInt           numRoots, numLeaves, numSubpoints = 0, numSubroots, numSubleaves = 0, l, sl, ll, pStart, pEnd, p;
29743982b651SMatthew G. Knepley     PetscMPIInt        rank;
29753982b651SMatthew G. Knepley 
29763982b651SMatthew G. Knepley     ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr);
29773982b651SMatthew G. Knepley     ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
29783982b651SMatthew G. Knepley     ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr);
29793982b651SMatthew G. Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
29803982b651SMatthew G. Knepley     ierr = DMPlexGetChart(subdm, NULL, &numSubroots);CHKERRQ(ierr);
29813982b651SMatthew G. Knepley     ierr = DMPlexCreateSubpointIS(subdm, &subpIS);CHKERRQ(ierr);
29823982b651SMatthew G. Knepley     if (subpIS) {
29833982b651SMatthew G. Knepley       ierr = ISGetIndices(subpIS, &subpoints);CHKERRQ(ierr);
29843982b651SMatthew G. Knepley       ierr = ISGetLocalSize(subpIS, &numSubpoints);CHKERRQ(ierr);
29853982b651SMatthew G. Knepley     }
29863982b651SMatthew G. Knepley     ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
29873982b651SMatthew G. Knepley     if (numRoots >= 0) {
29883982b651SMatthew G. Knepley       ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr);
29893982b651SMatthew G. Knepley       for (p = 0; p < pEnd-pStart; ++p) {
29903982b651SMatthew G. Knepley         newLocalPoints[p].rank  = -2;
29913982b651SMatthew G. Knepley         newLocalPoints[p].index = -2;
29923982b651SMatthew G. Knepley       }
29933982b651SMatthew G. Knepley       /* Set subleaves */
29943982b651SMatthew G. Knepley       for (l = 0; l < numLeaves; ++l) {
29953982b651SMatthew G. Knepley         const PetscInt point    = localPoints[l];
29963982b651SMatthew G. Knepley         const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints);
29973982b651SMatthew G. Knepley 
29983982b651SMatthew G. Knepley         if (subpoint < 0) continue;
29993982b651SMatthew G. Knepley         newLocalPoints[point-pStart].rank  = rank;
30003982b651SMatthew G. Knepley         newLocalPoints[point-pStart].index = subpoint;
30013982b651SMatthew G. Knepley         ++numSubleaves;
30023982b651SMatthew G. Knepley       }
30033982b651SMatthew G. Knepley       /* Must put in owned subpoints */
30043982b651SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {
30053982b651SMatthew G. Knepley         const PetscInt subpoint = DMPlexFilterPoint_Internal(p, 0, numSubpoints, subpoints);
30063982b651SMatthew G. Knepley 
30073982b651SMatthew G. Knepley         if (subpoint < 0) {
30083982b651SMatthew G. Knepley           newOwners[p-pStart].rank  = -3;
30093982b651SMatthew G. Knepley           newOwners[p-pStart].index = -3;
30103982b651SMatthew G. Knepley         } else {
30113982b651SMatthew G. Knepley           newOwners[p-pStart].rank  = rank;
30123982b651SMatthew G. Knepley           newOwners[p-pStart].index = subpoint;
30133982b651SMatthew G. Knepley         }
30143982b651SMatthew G. Knepley       }
30153982b651SMatthew G. Knepley       ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
30163982b651SMatthew G. Knepley       ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
30173982b651SMatthew G. Knepley       ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
30183982b651SMatthew G. Knepley       ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
30193982b651SMatthew G. Knepley       ierr = PetscMalloc1(numSubleaves, &slocalPoints);CHKERRQ(ierr);
30203982b651SMatthew G. Knepley       ierr = PetscMalloc1(numSubleaves, &sremotePoints);CHKERRQ(ierr);
30213982b651SMatthew G. Knepley       for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) {
30223982b651SMatthew G. Knepley         const PetscInt point    = localPoints[l];
30233982b651SMatthew G. Knepley         const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints);
30243982b651SMatthew G. Knepley 
30253982b651SMatthew G. Knepley         if (subpoint < 0) continue;
30263982b651SMatthew G. Knepley         if (newLocalPoints[point].rank == rank) {++ll; continue;}
30273982b651SMatthew G. Knepley         slocalPoints[sl]        = subpoint;
30283982b651SMatthew G. Knepley         sremotePoints[sl].rank  = newLocalPoints[point].rank;
30293982b651SMatthew G. Knepley         sremotePoints[sl].index = newLocalPoints[point].index;
30303982b651SMatthew G. Knepley         if (sremotePoints[sl].rank  < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point);
30313982b651SMatthew G. Knepley         if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point);
30323982b651SMatthew G. Knepley         ++sl;
30333982b651SMatthew G. Knepley       }
30343982b651SMatthew G. Knepley       if (sl + ll != numSubleaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubleaves);
30353982b651SMatthew G. Knepley       ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr);
30363982b651SMatthew G. Knepley       ierr = PetscSFSetGraph(sfPointSub, numSubroots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
30373982b651SMatthew G. Knepley     }
30383982b651SMatthew G. Knepley     if (subpIS) {
30393982b651SMatthew G. Knepley       ierr = ISRestoreIndices(subpIS, &subpoints);CHKERRQ(ierr);
30403982b651SMatthew G. Knepley       ierr = ISDestroy(&subpIS);CHKERRQ(ierr);
30413982b651SMatthew G. Knepley     }
30423982b651SMatthew G. Knepley   }
3043efa14ee0SMatthew G Knepley   /* Cleanup */
3044e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
30450ae02aa4SMatthew G. Knepley     if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);}
3046e6ccafaeSMatthew G Knepley     ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr);
3047e6ccafaeSMatthew G Knepley   }
3048efa14ee0SMatthew G Knepley   ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr);
3049e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3050e6ccafaeSMatthew G Knepley }
3051e6ccafaeSMatthew G Knepley 
30523982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm)
30533982b651SMatthew G. Knepley {
30543982b651SMatthew G. Knepley   PetscErrorCode ierr;
30553982b651SMatthew G. Knepley 
30563982b651SMatthew G. Knepley   PetscFunctionBegin;
3057bec263e5SMatthew G. Knepley   ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, vertexLabel, value, PETSC_FALSE, 1, subdm);CHKERRQ(ierr);
30583982b651SMatthew G. Knepley   PetscFunctionReturn(0);
30593982b651SMatthew G. Knepley }
30603982b651SMatthew G. Knepley 
3061d0fa310fSMatthew G. Knepley /*@
3062e6ccafaeSMatthew G Knepley   DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label
3063e6ccafaeSMatthew G Knepley 
3064e6ccafaeSMatthew G Knepley   Input Parameters:
3065e6ccafaeSMatthew G Knepley + dm           - The original mesh
3066830e53efSMatthew G. Knepley . vertexLabel  - The DMLabel marking vertices contained in the surface
3067830e53efSMatthew G. Knepley - value        - The label value to use
3068e6ccafaeSMatthew G Knepley 
3069e6ccafaeSMatthew G Knepley   Output Parameter:
3070e6ccafaeSMatthew G Knepley . subdm - The surface mesh
3071e6ccafaeSMatthew G Knepley 
3072e6ccafaeSMatthew G Knepley   Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap().
3073e6ccafaeSMatthew G Knepley 
3074e6ccafaeSMatthew G Knepley   Level: developer
3075e6ccafaeSMatthew G Knepley 
3076c58f1c22SToby Isaac .seealso: DMPlexGetSubpointMap(), DMGetLabel(), DMLabelSetValue()
3077830e53efSMatthew G. Knepley @*/
307853156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm)
3079e6ccafaeSMatthew G Knepley {
3080dd2763adSMatthew G. Knepley   PetscInt       dim, cdim, depth;
3081e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
3082e6ccafaeSMatthew G Knepley 
3083e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3084e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3085766ab985SMatthew G. Knepley   PetscValidPointer(subdm, 3);
3086c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
3087e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
308882f516ccSBarry Smith   ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr);
3089e6ccafaeSMatthew G Knepley   ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr);
3090c73cfb54SMatthew G. Knepley   ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr);
3091dd2763adSMatthew G. Knepley   ierr = DMGetCoordinateDim(dm, &cdim);CHKERRQ(ierr);
3092dd2763adSMatthew G. Knepley   ierr = DMSetCoordinateDim(*subdm, cdim);CHKERRQ(ierr);
3093e6ccafaeSMatthew G Knepley   if (depth == dim) {
3094830e53efSMatthew G. Knepley     ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr);
3095e6ccafaeSMatthew G Knepley   } else {
3096830e53efSMatthew G. Knepley     ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr);
3097e6ccafaeSMatthew G Knepley   }
3098e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3099e6ccafaeSMatthew G Knepley }
3100e6ccafaeSMatthew G Knepley 
310127c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm)
3102766ab985SMatthew G. Knepley {
3103766ab985SMatthew G. Knepley   MPI_Comm        comm;
3104766ab985SMatthew G. Knepley   DMLabel         subpointMap;
3105766ab985SMatthew G. Knepley   IS              subvertexIS;
3106766ab985SMatthew G. Knepley   const PetscInt *subVertices;
3107fed694aaSMatthew G. Knepley   PetscInt        numSubVertices, firstSubVertex, numSubCells, *subCells = NULL;
3108766ab985SMatthew G. Knepley   PetscInt       *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV;
310987feddfdSMatthew G. Knepley   PetscInt        cMax, c, f;
3110766ab985SMatthew G. Knepley   PetscErrorCode  ierr;
3111766ab985SMatthew G. Knepley 
3112766ab985SMatthew G. Knepley   PetscFunctionBegin;
3113766ab985SMatthew G. Knepley   ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr);
3114766ab985SMatthew G. Knepley   /* Create subpointMap which marks the submesh */
3115766ab985SMatthew G. Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
3116766ab985SMatthew G. Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
3117766ab985SMatthew G. Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
311827c04023SMatthew G. Knepley   ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr);
3119766ab985SMatthew G. Knepley   /* Setup chart */
3120766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr);
3121766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr);
3122766ab985SMatthew G. Knepley   ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr);
3123766ab985SMatthew G. Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
3124766ab985SMatthew G. Knepley   /* Set cone sizes */
3125766ab985SMatthew G. Knepley   firstSubVertex = numSubCells;
3126766ab985SMatthew G. Knepley   firstSubFace   = numSubCells+numSubVertices;
3127766ab985SMatthew G. Knepley   newFacePoint   = firstSubFace;
3128766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr);
3129766ab985SMatthew G. Knepley   if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
3130766ab985SMatthew G. Knepley   for (c = 0; c < numSubCells; ++c) {
3131766ab985SMatthew G. Knepley     ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr);
3132766ab985SMatthew G. Knepley   }
3133766ab985SMatthew G. Knepley   for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) {
3134766ab985SMatthew G. Knepley     ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr);
3135766ab985SMatthew G. Knepley   }
3136766ab985SMatthew G. Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
3137766ab985SMatthew G. Knepley   /* Create face cones */
3138766ab985SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
313987feddfdSMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
3140766ab985SMatthew G. Knepley   ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
3141766ab985SMatthew G. Knepley   for (c = 0; c < numSubCells; ++c) {
3142766ab985SMatthew G. Knepley     const PetscInt  cell    = subCells[c];
3143766ab985SMatthew G. Knepley     const PetscInt  subcell = c;
314487feddfdSMatthew G. Knepley     const PetscInt *cone, *cells;
314587feddfdSMatthew G. Knepley     PetscInt        numCells, subVertex, p, v;
3146766ab985SMatthew G. Knepley 
314787feddfdSMatthew G. Knepley     if (cell < cMax) continue;
314887feddfdSMatthew G. Knepley     ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
314987feddfdSMatthew G. Knepley     for (v = 0; v < nFV; ++v) {
315087feddfdSMatthew G. Knepley       ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr);
315187feddfdSMatthew G. Knepley       subface[v] = firstSubVertex+subVertex;
315287feddfdSMatthew G. Knepley     }
315387feddfdSMatthew G. Knepley     ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr);
315487feddfdSMatthew G. Knepley     ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr);
315587feddfdSMatthew G. Knepley     ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr);
315627234c99SMatthew G. Knepley     /* Not true in parallel
315727234c99SMatthew G. Knepley     if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */
315887feddfdSMatthew G. Knepley     for (p = 0; p < numCells; ++p) {
315987feddfdSMatthew G. Knepley       PetscInt negsubcell;
3160766ab985SMatthew G. Knepley 
316187feddfdSMatthew G. Knepley       if (cells[p] >= cMax) continue;
316287feddfdSMatthew G. Knepley       /* I know this is a crap search */
316387feddfdSMatthew G. Knepley       for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) {
316487feddfdSMatthew G. Knepley         if (subCells[negsubcell] == cells[p]) break;
3165766ab985SMatthew G. Knepley       }
316687feddfdSMatthew G. Knepley       if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell);
316787feddfdSMatthew G. Knepley       ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr);
3168766ab985SMatthew G. Knepley     }
316987feddfdSMatthew G. Knepley     ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr);
317087feddfdSMatthew G. Knepley     ++newFacePoint;
3171766ab985SMatthew G. Knepley   }
3172766ab985SMatthew G. Knepley   ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
3173766ab985SMatthew G. Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
3174766ab985SMatthew G. Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
3175766ab985SMatthew G. Knepley   /* Build coordinates */
3176766ab985SMatthew G. Knepley   {
3177766ab985SMatthew G. Knepley     PetscSection coordSection, subCoordSection;
3178766ab985SMatthew G. Knepley     Vec          coordinates, subCoordinates;
3179766ab985SMatthew G. Knepley     PetscScalar *coords, *subCoords;
3180*c0e8cf5fSMatthew G. Knepley     PetscInt     cdim, numComp, coordSize, v;
318124640c55SToby Isaac     const char  *name;
3182766ab985SMatthew G. Knepley 
3183*c0e8cf5fSMatthew G. Knepley     ierr = DMGetCoordinateDim(dm, &cdim);CHKERRQ(ierr);
318469d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
3185766ab985SMatthew G. Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
318669d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
3187285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
3188285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
3189285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
3190766ab985SMatthew G. Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr);
3191766ab985SMatthew G. Knepley     for (v = 0; v < numSubVertices; ++v) {
3192766ab985SMatthew G. Knepley       const PetscInt vertex    = subVertices[v];
3193766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubVertex+v;
3194766ab985SMatthew G. Knepley       PetscInt       dof;
3195766ab985SMatthew G. Knepley 
3196766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
3197766ab985SMatthew G. Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
3198285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
3199766ab985SMatthew G. Knepley     }
3200766ab985SMatthew G. Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
3201766ab985SMatthew G. Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
32028b9ced59SLisandro Dalcin     ierr = VecCreate(PETSC_COMM_SELF, &subCoordinates);CHKERRQ(ierr);
320324640c55SToby Isaac     ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr);
320424640c55SToby Isaac     ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr);
3205766ab985SMatthew G. Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
3206*c0e8cf5fSMatthew G. Knepley     ierr = VecSetBlockSize(subCoordinates, cdim);CHKERRQ(ierr);
32072eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
3208766ab985SMatthew G. Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
3209766ab985SMatthew G. Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
3210766ab985SMatthew G. Knepley     for (v = 0; v < numSubVertices; ++v) {
3211766ab985SMatthew G. Knepley       const PetscInt vertex    = subVertices[v];
3212766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubVertex+v;
3213766ab985SMatthew G. Knepley       PetscInt       dof, off, sdof, soff, d;
3214766ab985SMatthew G. Knepley 
3215766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
3216766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
3217766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
3218766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
3219766ab985SMatthew 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);
3220766ab985SMatthew G. Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
3221766ab985SMatthew G. Knepley     }
3222766ab985SMatthew G. Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
3223766ab985SMatthew G. Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
3224766ab985SMatthew G. Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
3225766ab985SMatthew G. Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
3226766ab985SMatthew G. Knepley   }
3227aca35d17SMatthew G. Knepley   /* Build SF */
3228aca35d17SMatthew G. Knepley   CHKMEMQ;
3229aca35d17SMatthew G. Knepley   {
3230aca35d17SMatthew G. Knepley     PetscSF            sfPoint, sfPointSub;
3231aca35d17SMatthew G. Knepley     const PetscSFNode *remotePoints;
3232bdcf2095SMatthew G. Knepley     PetscSFNode       *sremotePoints, *newLocalPoints, *newOwners;
3233aca35d17SMatthew G. Knepley     const PetscInt    *localPoints;
3234bdcf2095SMatthew G. Knepley     PetscInt          *slocalPoints;
323549c26ae4SMatthew G. Knepley     PetscInt           numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd;
3236bdcf2095SMatthew G. Knepley     PetscMPIInt        rank;
3237aca35d17SMatthew G. Knepley 
3238bdcf2095SMatthew G. Knepley     ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr);
3239aca35d17SMatthew G. Knepley     ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
3240aca35d17SMatthew G. Knepley     ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr);
3241aca35d17SMatthew G. Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
3242aca35d17SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
3243aca35d17SMatthew G. Knepley     ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
3244aca35d17SMatthew G. Knepley     if (numRoots >= 0) {
3245aca35d17SMatthew G. Knepley       /* Only vertices should be shared */
3246dcca6d9dSJed Brown       ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr);
3247bdcf2095SMatthew G. Knepley       for (p = 0; p < pEnd-pStart; ++p) {
3248bdcf2095SMatthew G. Knepley         newLocalPoints[p].rank  = -2;
3249bdcf2095SMatthew G. Knepley         newLocalPoints[p].index = -2;
3250bdcf2095SMatthew G. Knepley       }
32519e0823b2SMatthew G. Knepley       /* Set subleaves */
3252aca35d17SMatthew G. Knepley       for (l = 0; l < numLeaves; ++l) {
3253aca35d17SMatthew G. Knepley         const PetscInt point    = localPoints[l];
3254bdcf2095SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices);
3255aca35d17SMatthew G. Knepley 
3256aca35d17SMatthew G. Knepley         if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point);
3257bdcf2095SMatthew G. Knepley         if (subPoint < 0) continue;
3258bdcf2095SMatthew G. Knepley         newLocalPoints[point-pStart].rank  = rank;
3259bdcf2095SMatthew G. Knepley         newLocalPoints[point-pStart].index = subPoint;
3260bdcf2095SMatthew G. Knepley         ++numSubLeaves;
3261aca35d17SMatthew G. Knepley       }
32629e0823b2SMatthew G. Knepley       /* Must put in owned subpoints */
32639e0823b2SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {
32649e0823b2SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices);
32659e0823b2SMatthew G. Knepley 
32669e0823b2SMatthew G. Knepley         if (subPoint < 0) {
32679e0823b2SMatthew G. Knepley           newOwners[p-pStart].rank  = -3;
32689e0823b2SMatthew G. Knepley           newOwners[p-pStart].index = -3;
32699e0823b2SMatthew G. Knepley         } else {
32709e0823b2SMatthew G. Knepley           newOwners[p-pStart].rank  = rank;
32719e0823b2SMatthew G. Knepley           newOwners[p-pStart].index = subPoint;
32729e0823b2SMatthew G. Knepley         }
3273bdcf2095SMatthew G. Knepley       }
3274bdcf2095SMatthew G. Knepley       ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
3275bdcf2095SMatthew G. Knepley       ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
3276bdcf2095SMatthew G. Knepley       ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
3277bdcf2095SMatthew G. Knepley       ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
3278785e854fSJed Brown       ierr = PetscMalloc1(numSubLeaves,    &slocalPoints);CHKERRQ(ierr);
3279785e854fSJed Brown       ierr = PetscMalloc1(numSubLeaves, &sremotePoints);CHKERRQ(ierr);
328049c26ae4SMatthew G. Knepley       for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) {
3281bdcf2095SMatthew G. Knepley         const PetscInt point    = localPoints[l];
3282bdcf2095SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices);
3283aca35d17SMatthew G. Knepley 
3284aca35d17SMatthew G. Knepley         if (subPoint < 0) continue;
328549c26ae4SMatthew G. Knepley         if (newLocalPoints[point].rank == rank) {++ll; continue;}
3286aca35d17SMatthew G. Knepley         slocalPoints[sl]        = subPoint;
3287bdcf2095SMatthew G. Knepley         sremotePoints[sl].rank  = newLocalPoints[point].rank;
3288bdcf2095SMatthew G. Knepley         sremotePoints[sl].index = newLocalPoints[point].index;
3289bdcf2095SMatthew G. Knepley         if (sremotePoints[sl].rank  < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point);
3290bdcf2095SMatthew G. Knepley         if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point);
3291aca35d17SMatthew G. Knepley         ++sl;
3292aca35d17SMatthew G. Knepley       }
3293bdcf2095SMatthew G. Knepley       ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr);
329449c26ae4SMatthew G. Knepley       if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves);
329549c26ae4SMatthew G. Knepley       ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
3296aca35d17SMatthew G. Knepley     }
3297aca35d17SMatthew G. Knepley   }
3298aca35d17SMatthew G. Knepley   CHKMEMQ;
3299766ab985SMatthew G. Knepley   /* Cleanup */
3300766ab985SMatthew G. Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
3301766ab985SMatthew G. Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
3302766ab985SMatthew G. Knepley   ierr = PetscFree(subCells);CHKERRQ(ierr);
3303766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
3304766ab985SMatthew G. Knepley }
3305766ab985SMatthew G. Knepley 
33063982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DM subdm)
3307766ab985SMatthew G. Knepley {
33083982b651SMatthew G. Knepley   DMLabel        label = NULL;
3309766ab985SMatthew G. Knepley   PetscErrorCode ierr;
3310766ab985SMatthew G. Knepley 
3311766ab985SMatthew G. Knepley   PetscFunctionBegin;
3312c58f1c22SToby Isaac   if (labelname) {ierr = DMGetLabel(dm, labelname, &label);CHKERRQ(ierr);}
3313bec263e5SMatthew G. Knepley   ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, label, value, PETSC_TRUE, 1, subdm);CHKERRQ(ierr);
3314766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
3315766ab985SMatthew G. Knepley }
3316766ab985SMatthew G. Knepley 
3317c08575a3SMatthew G. Knepley /*@C
331827c04023SMatthew 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.
3319766ab985SMatthew G. Knepley 
3320766ab985SMatthew G. Knepley   Input Parameters:
3321766ab985SMatthew G. Knepley + dm          - The original mesh
332227c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells
33237afc1a8bSJed Brown . label       - A label name, or NULL
332427c04023SMatthew G. Knepley - value  - A label value
3325766ab985SMatthew G. Knepley 
3326766ab985SMatthew G. Knepley   Output Parameter:
3327766ab985SMatthew G. Knepley . subdm - The surface mesh
3328766ab985SMatthew G. Knepley 
3329766ab985SMatthew G. Knepley   Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap().
3330766ab985SMatthew G. Knepley 
3331766ab985SMatthew G. Knepley   Level: developer
3332766ab985SMatthew G. Knepley 
3333766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh()
3334c08575a3SMatthew G. Knepley @*/
333527c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm)
3336766ab985SMatthew G. Knepley {
3337*c0e8cf5fSMatthew G. Knepley   PetscInt       dim, cdim, depth;
3338766ab985SMatthew G. Knepley   PetscErrorCode ierr;
3339766ab985SMatthew G. Knepley 
3340766ab985SMatthew G. Knepley   PetscFunctionBegin;
3341766ab985SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
334227c04023SMatthew G. Knepley   PetscValidPointer(subdm, 5);
3343c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
3344766ab985SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3345766ab985SMatthew G. Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr);
3346766ab985SMatthew G. Knepley   ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr);
3347c73cfb54SMatthew G. Knepley   ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr);
3348*c0e8cf5fSMatthew G. Knepley   ierr = DMGetCoordinateDim(dm, &cdim);CHKERRQ(ierr);
3349*c0e8cf5fSMatthew G. Knepley   ierr = DMSetCoordinateDim(*subdm, cdim);CHKERRQ(ierr);
3350766ab985SMatthew G. Knepley   if (depth == dim) {
3351b3154360SMatthew G. Knepley     ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr);
3352766ab985SMatthew G. Knepley   } else {
335327c04023SMatthew G. Knepley     ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr);
3354e6ccafaeSMatthew G Knepley   }
3355e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3356e6ccafaeSMatthew G Knepley }
3357e6ccafaeSMatthew G Knepley 
3358bec263e5SMatthew G. Knepley /*@
3359bec263e5SMatthew G. Knepley   DMPlexFilter - Extract a subset of mesh cells defined by a label as a separate mesh
3360bec263e5SMatthew G. Knepley 
3361bec263e5SMatthew G. Knepley   Input Parameters:
3362bec263e5SMatthew G. Knepley + dm        - The original mesh
3363bec263e5SMatthew G. Knepley . cellLabel - The DMLabel marking cells contained in the new mesh
3364bec263e5SMatthew G. Knepley - value     - The label value to use
3365bec263e5SMatthew G. Knepley 
3366bec263e5SMatthew G. Knepley   Output Parameter:
3367bec263e5SMatthew G. Knepley . subdm - The new mesh
3368bec263e5SMatthew G. Knepley 
3369bec263e5SMatthew G. Knepley   Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap().
3370bec263e5SMatthew G. Knepley 
3371bec263e5SMatthew G. Knepley   Level: developer
3372bec263e5SMatthew G. Knepley 
3373c58f1c22SToby Isaac .seealso: DMPlexGetSubpointMap(), DMGetLabel(), DMLabelSetValue()
3374bec263e5SMatthew G. Knepley @*/
3375bec263e5SMatthew G. Knepley PetscErrorCode DMPlexFilter(DM dm, DMLabel cellLabel, PetscInt value, DM *subdm)
3376bec263e5SMatthew G. Knepley {
3377bec263e5SMatthew G. Knepley   PetscInt       dim;
3378bec263e5SMatthew G. Knepley   PetscErrorCode ierr;
3379bec263e5SMatthew G. Knepley 
3380bec263e5SMatthew G. Knepley   PetscFunctionBegin;
3381bec263e5SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3382bec263e5SMatthew G. Knepley   PetscValidPointer(subdm, 3);
3383bec263e5SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
3384bec263e5SMatthew G. Knepley   ierr = DMCreate(PetscObjectComm((PetscObject) dm), subdm);CHKERRQ(ierr);
3385bec263e5SMatthew G. Knepley   ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr);
3386bec263e5SMatthew G. Knepley   ierr = DMSetDimension(*subdm, dim);CHKERRQ(ierr);
3387bec263e5SMatthew G. Knepley   /* Extract submesh in place, could be empty on some procs, could have inconsistency if procs do not both extract a shared cell */
3388bec263e5SMatthew G. Knepley   ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, cellLabel, value, PETSC_FALSE, 0, *subdm);CHKERRQ(ierr);
3389bec263e5SMatthew G. Knepley   PetscFunctionReturn(0);
3390bec263e5SMatthew G. Knepley }
3391bec263e5SMatthew G. Knepley 
339264beef6dSMatthew G. Knepley /*@
339364beef6dSMatthew G. Knepley   DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values
339464beef6dSMatthew G. Knepley 
339564beef6dSMatthew G. Knepley   Input Parameter:
339664beef6dSMatthew G. Knepley . dm - The submesh DM
339764beef6dSMatthew G. Knepley 
339864beef6dSMatthew G. Knepley   Output Parameter:
339964beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh
340064beef6dSMatthew G. Knepley 
340164beef6dSMatthew G. Knepley   Level: developer
340264beef6dSMatthew G. Knepley 
340364beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS()
340464beef6dSMatthew G. Knepley @*/
3405e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap)
3406e6ccafaeSMatthew G Knepley {
3407e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3408e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3409e6ccafaeSMatthew G Knepley   PetscValidPointer(subpointMap, 2);
341065663942SMatthew G. Knepley   *subpointMap = ((DM_Plex*) dm->data)->subpointMap;
3411e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3412e6ccafaeSMatthew G Knepley }
3413e6ccafaeSMatthew G Knepley 
3414c08575a3SMatthew G. Knepley /*@
3415c08575a3SMatthew G. Knepley   DMPlexSetSubpointMap - Sets the DMLabel with point dimension as values
3416c08575a3SMatthew G. Knepley 
3417c08575a3SMatthew G. Knepley   Input Parameters:
3418c08575a3SMatthew G. Knepley + dm - The submesh DM
3419c08575a3SMatthew G. Knepley - subpointMap - The DMLabel of all the points from the original mesh in this submesh
3420c08575a3SMatthew G. Knepley 
3421c08575a3SMatthew G. Knepley   Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh()
3422c08575a3SMatthew G. Knepley 
3423c08575a3SMatthew G. Knepley   Level: developer
3424c08575a3SMatthew G. Knepley 
3425c08575a3SMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS()
3426c08575a3SMatthew G. Knepley @*/
3427e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap)
3428e6ccafaeSMatthew G Knepley {
3429e6ccafaeSMatthew G Knepley   DM_Plex       *mesh = (DM_Plex *) dm->data;
3430285d324eSMatthew G. Knepley   DMLabel        tmp;
3431e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
3432e6ccafaeSMatthew G Knepley 
3433e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3434e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3435285d324eSMatthew G. Knepley   tmp  = mesh->subpointMap;
3436e6ccafaeSMatthew G Knepley   mesh->subpointMap = subpointMap;
3437285d324eSMatthew G. Knepley   ++mesh->subpointMap->refct;
3438285d324eSMatthew G. Knepley   ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr);
3439e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3440e6ccafaeSMatthew G Knepley }
3441e6ccafaeSMatthew G Knepley 
344264beef6dSMatthew G. Knepley /*@
3443e6ccafaeSMatthew G Knepley   DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data
3444e6ccafaeSMatthew G Knepley 
3445e6ccafaeSMatthew G Knepley   Input Parameter:
3446e6ccafaeSMatthew G Knepley . dm - The submesh DM
3447e6ccafaeSMatthew G Knepley 
3448e6ccafaeSMatthew G Knepley   Output Parameter:
34490298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh
3450e6ccafaeSMatthew G Knepley 
34513982b651SMatthew G. Knepley   Note: This IS is guaranteed to be sorted by the construction of the submesh
345264beef6dSMatthew G. Knepley 
345364beef6dSMatthew G. Knepley   Level: developer
345464beef6dSMatthew G. Knepley 
345564beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap()
345664beef6dSMatthew G. Knepley @*/
3457e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS)
3458e6ccafaeSMatthew G Knepley {
345982f516ccSBarry Smith   MPI_Comm        comm;
3460e6ccafaeSMatthew G Knepley   DMLabel         subpointMap;
3461e6ccafaeSMatthew G Knepley   IS              is;
3462e6ccafaeSMatthew G Knepley   const PetscInt *opoints;
3463e6ccafaeSMatthew G Knepley   PetscInt       *points, *depths;
3464e6ccafaeSMatthew G Knepley   PetscInt        depth, depStart, depEnd, d, pStart, pEnd, p, n, off;
3465e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
3466e6ccafaeSMatthew G Knepley 
3467e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3468e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3469e6ccafaeSMatthew G Knepley   PetscValidPointer(subpointIS, 2);
347082f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
34710298fd71SBarry Smith   *subpointIS = NULL;
3472e6ccafaeSMatthew G Knepley   ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr);
3473e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3474fed694aaSMatthew G. Knepley   if (subpointMap && depth >= 0) {
3475e6ccafaeSMatthew G Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
3476e6ccafaeSMatthew G Knepley     if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart);
3477e6ccafaeSMatthew G Knepley     ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr);
3478e6ccafaeSMatthew G Knepley     depths[0] = depth;
3479e6ccafaeSMatthew G Knepley     depths[1] = 0;
3480e6ccafaeSMatthew G Knepley     for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;}
3481785e854fSJed Brown     ierr = PetscMalloc1(pEnd, &points);CHKERRQ(ierr);
3482e6ccafaeSMatthew G Knepley     for(d = 0, off = 0; d <= depth; ++d) {
3483e6ccafaeSMatthew G Knepley       const PetscInt dep = depths[d];
3484e6ccafaeSMatthew G Knepley 
3485e6ccafaeSMatthew G Knepley       ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr);
3486e6ccafaeSMatthew G Knepley       ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr);
34871e21b6fdSMatthew G Knepley       if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */
3488e6ccafaeSMatthew 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);
3489e6ccafaeSMatthew G Knepley       } else {
34901e21b6fdSMatthew G Knepley         if (!n) {
34911e21b6fdSMatthew G Knepley           if (d == 0) {
34921e21b6fdSMatthew G Knepley             /* Missing cells */
34931e21b6fdSMatthew G Knepley             for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1;
34941e21b6fdSMatthew G Knepley           } else {
34951e21b6fdSMatthew G Knepley             /* Missing faces */
34961e21b6fdSMatthew G Knepley             for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT;
34971e21b6fdSMatthew G Knepley           }
34981e21b6fdSMatthew G Knepley         }
3499e6ccafaeSMatthew G Knepley       }
3500e6ccafaeSMatthew G Knepley       if (n) {
3501e6ccafaeSMatthew G Knepley         ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr);
3502e6ccafaeSMatthew G Knepley         ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr);
3503e6ccafaeSMatthew G Knepley         for(p = 0; p < n; ++p, ++off) points[off] = opoints[p];
3504e6ccafaeSMatthew G Knepley         ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr);
3505e6ccafaeSMatthew G Knepley         ierr = ISDestroy(&is);CHKERRQ(ierr);
3506e6ccafaeSMatthew G Knepley       }
3507e6ccafaeSMatthew G Knepley     }
3508e6ccafaeSMatthew G Knepley     ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr);
3509e6ccafaeSMatthew G Knepley     if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd);
3510fed694aaSMatthew G. Knepley     ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr);
3511e6ccafaeSMatthew G Knepley   }
3512e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3513e6ccafaeSMatthew G Knepley }
3514