xref: /petsc/src/dm/impls/plex/plexsubmesh.c (revision cd0c21393bfb997ab657ed59be7ee1ead056b314)
134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h>   /*I      "petscdmplex.h"   I*/
2e6ccafaeSMatthew G Knepley 
3fb98ab4fSPeter Brune extern PetscErrorCode DMPlexGetNumFaceVertices_Internal(DM, PetscInt, PetscInt, PetscInt *);
4e6ccafaeSMatthew G Knepley 
5e6ccafaeSMatthew G Knepley #undef __FUNCT__
6*cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces"
7*cd0c2139SMatthew G Knepley /*@
8*cd0c2139SMatthew G Knepley   DMPlexMarkBoundaryFaces - Mark all faces on the boundary
9*cd0c2139SMatthew G Knepley 
10*cd0c2139SMatthew G Knepley   Not Collective
11*cd0c2139SMatthew G Knepley 
12*cd0c2139SMatthew G Knepley   Input Parameter:
13*cd0c2139SMatthew G Knepley . dm - The original DM
14*cd0c2139SMatthew G Knepley 
15*cd0c2139SMatthew G Knepley   Output Parameter:
16*cd0c2139SMatthew G Knepley . label - The DMLabel marking boundary faces with value 1
17*cd0c2139SMatthew G Knepley 
18*cd0c2139SMatthew G Knepley   Level: developer
19*cd0c2139SMatthew G Knepley 
20*cd0c2139SMatthew G Knepley .seealso: DMLabelCreate(), DMPlexCreateLabel()
21*cd0c2139SMatthew G Knepley */
22*cd0c2139SMatthew G Knepley PetscErrorCode DMPlexMarkBoundaryFaces(DM dm, DMLabel label)
23*cd0c2139SMatthew G Knepley {
24*cd0c2139SMatthew G Knepley   PetscInt       fStart, fEnd, f;
25*cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
26*cd0c2139SMatthew G Knepley 
27*cd0c2139SMatthew G Knepley   PetscFunctionBegin;
28*cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
29*cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr);
30*cd0c2139SMatthew G Knepley   for (f = fStart; f < fEnd; ++f) {
31*cd0c2139SMatthew G Knepley     PetscInt supportSize;
32*cd0c2139SMatthew G Knepley 
33*cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr);
34*cd0c2139SMatthew G Knepley     if (supportSize == 1) {
35*cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(label, f, 1);CHKERRQ(ierr);
36*cd0c2139SMatthew G Knepley     }
37*cd0c2139SMatthew G Knepley   }
38*cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
39*cd0c2139SMatthew G Knepley }
40*cd0c2139SMatthew G Knepley 
41*cd0c2139SMatthew G Knepley #undef __FUNCT__
42*cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoint_Internal"
43*cd0c2139SMatthew G Knepley PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthEnd[], PetscInt depthShift[])
44*cd0c2139SMatthew G Knepley {
45*cd0c2139SMatthew G Knepley   if (depth < 0) return p;
46*cd0c2139SMatthew G Knepley   /* Cells    */ if (p < depthEnd[depth])   return p;
47*cd0c2139SMatthew G Knepley   /* Vertices */ if (p < depthEnd[0])       return p + depthShift[depth];
48*cd0c2139SMatthew G Knepley   /* Faces    */ if (p < depthEnd[depth-1]) return p + depthShift[depth] + depthShift[0];
49*cd0c2139SMatthew G Knepley   /* Edges    */                            return p + depthShift[depth] + depthShift[0] + depthShift[depth-1];
50*cd0c2139SMatthew G Knepley }
51*cd0c2139SMatthew G Knepley 
52*cd0c2139SMatthew G Knepley #undef __FUNCT__
53*cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSizes_Internal"
54*cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew)
55*cd0c2139SMatthew G Knepley {
56*cd0c2139SMatthew G Knepley   PetscInt      *depthEnd;
57*cd0c2139SMatthew G Knepley   PetscInt       depth = 0, d, pStart, pEnd, p;
58*cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
59*cd0c2139SMatthew G Knepley 
60*cd0c2139SMatthew G Knepley   PetscFunctionBegin;
61*cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
62*cd0c2139SMatthew G Knepley   if (depth < 0) PetscFunctionReturn(0);
63*cd0c2139SMatthew G Knepley   ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr);
64*cd0c2139SMatthew G Knepley   /* Step 1: Expand chart */
65*cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
66*cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
67*cd0c2139SMatthew G Knepley     pEnd += depthShift[d];
68*cd0c2139SMatthew G Knepley     ierr  = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
69*cd0c2139SMatthew G Knepley   }
70*cd0c2139SMatthew G Knepley   ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr);
71*cd0c2139SMatthew G Knepley   /* Step 2: Set cone and support sizes */
72*cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
73*cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr);
74*cd0c2139SMatthew G Knepley     for (p = pStart; p < pEnd; ++p) {
75*cd0c2139SMatthew G Knepley       PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthEnd, depthShift);
76*cd0c2139SMatthew G Knepley       PetscInt size;
77*cd0c2139SMatthew G Knepley 
78*cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr);
79*cd0c2139SMatthew G Knepley       ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr);
80*cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr);
81*cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr);
82*cd0c2139SMatthew G Knepley     }
83*cd0c2139SMatthew G Knepley   }
84*cd0c2139SMatthew G Knepley   ierr = PetscFree(depthEnd);CHKERRQ(ierr);
85*cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
86*cd0c2139SMatthew G Knepley }
87*cd0c2139SMatthew G Knepley 
88*cd0c2139SMatthew G Knepley #undef __FUNCT__
89*cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoints_Internal"
90*cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew)
91*cd0c2139SMatthew G Knepley {
92*cd0c2139SMatthew G Knepley   PetscInt      *depthEnd, *newpoints;
93*cd0c2139SMatthew G Knepley   PetscInt       depth = 0, d, maxConeSize, maxSupportSize, pStart, pEnd, p;
94*cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
95*cd0c2139SMatthew G Knepley 
96*cd0c2139SMatthew G Knepley   PetscFunctionBegin;
97*cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
98*cd0c2139SMatthew G Knepley   if (depth < 0) PetscFunctionReturn(0);
99*cd0c2139SMatthew G Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
100*cd0c2139SMatthew G Knepley   ierr = PetscMalloc2(depth+1,PetscInt,&depthEnd,PetscMax(maxConeSize, maxSupportSize),PetscInt,&newpoints);CHKERRQ(ierr);
101*cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
102*cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
103*cd0c2139SMatthew G Knepley   }
104*cd0c2139SMatthew G Knepley   /* Step 5: Set cones and supports */
105*cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
106*cd0c2139SMatthew G Knepley   for (p = pStart; p < pEnd; ++p) {
107*cd0c2139SMatthew G Knepley     const PetscInt *points = NULL, *orientations = NULL;
108*cd0c2139SMatthew G Knepley     PetscInt        size, i, newp = DMPlexShiftPoint_Internal(p, depth, depthEnd, depthShift);
109*cd0c2139SMatthew G Knepley 
110*cd0c2139SMatthew G Knepley     ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr);
111*cd0c2139SMatthew G Knepley     ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr);
112*cd0c2139SMatthew G Knepley     ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr);
113*cd0c2139SMatthew G Knepley     for (i = 0; i < size; ++i) {
114*cd0c2139SMatthew G Knepley       newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthEnd, depthShift);
115*cd0c2139SMatthew G Knepley     }
116*cd0c2139SMatthew G Knepley     ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr);
117*cd0c2139SMatthew G Knepley     ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr);
118*cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr);
119*cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr);
120*cd0c2139SMatthew G Knepley     for (i = 0; i < size; ++i) {
121*cd0c2139SMatthew G Knepley       newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthEnd, depthShift);
122*cd0c2139SMatthew G Knepley     }
123*cd0c2139SMatthew G Knepley     ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr);
124*cd0c2139SMatthew G Knepley   }
125*cd0c2139SMatthew G Knepley   ierr = PetscFree2(depthEnd,newpoints);CHKERRQ(ierr);
126*cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
127*cd0c2139SMatthew G Knepley }
128*cd0c2139SMatthew G Knepley 
129*cd0c2139SMatthew G Knepley #undef __FUNCT__
130*cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftCoordinates_Internal"
131*cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew)
132*cd0c2139SMatthew G Knepley {
133*cd0c2139SMatthew G Knepley   PetscSection   coordSection, newCoordSection;
134*cd0c2139SMatthew G Knepley   Vec            coordinates, newCoordinates;
135*cd0c2139SMatthew G Knepley   PetscScalar   *coords, *newCoords;
136*cd0c2139SMatthew G Knepley   PetscInt      *depthEnd, coordSize;
137*cd0c2139SMatthew G Knepley   PetscInt       dim, depth = 0, d, vStart, vEnd, vStartNew, vEndNew, v;
138*cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
139*cd0c2139SMatthew G Knepley 
140*cd0c2139SMatthew G Knepley   PetscFunctionBegin;
141*cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
142*cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
143*cd0c2139SMatthew G Knepley   ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr);
144*cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
145*cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
146*cd0c2139SMatthew G Knepley   }
147*cd0c2139SMatthew G Knepley   /* Step 8: Convert coordinates */
148*cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
149*cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr);
150*cd0c2139SMatthew G Knepley   ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
151*cd0c2139SMatthew G Knepley   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr);
152*cd0c2139SMatthew G Knepley   ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr);
153*cd0c2139SMatthew G Knepley   ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr);
154*cd0c2139SMatthew G Knepley   ierr = PetscSectionSetChart(newCoordSection, vStartNew, vEndNew);CHKERRQ(ierr);
155*cd0c2139SMatthew G Knepley   for (v = vStartNew; v < vEndNew; ++v) {
156*cd0c2139SMatthew G Knepley     ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr);
157*cd0c2139SMatthew G Knepley     ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr);
158*cd0c2139SMatthew G Knepley   }
159*cd0c2139SMatthew G Knepley   ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr);
160*cd0c2139SMatthew G Knepley   ierr = DMPlexSetCoordinateSection(dmNew, newCoordSection);CHKERRQ(ierr);
161*cd0c2139SMatthew G Knepley   ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr);
162*cd0c2139SMatthew G Knepley   ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr);
163*cd0c2139SMatthew G Knepley   ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr);
164*cd0c2139SMatthew G Knepley   ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
165*cd0c2139SMatthew G Knepley   ierr = VecSetFromOptions(newCoordinates);CHKERRQ(ierr);
166*cd0c2139SMatthew G Knepley   ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr);
167*cd0c2139SMatthew G Knepley   ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
168*cd0c2139SMatthew G Knepley   ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
169*cd0c2139SMatthew G Knepley   ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr);
170*cd0c2139SMatthew G Knepley   for (v = vStart; v < vEnd; ++v) {
171*cd0c2139SMatthew G Knepley     PetscInt dof, off, noff, d;
172*cd0c2139SMatthew G Knepley 
173*cd0c2139SMatthew G Knepley     ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr);
174*cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
175*cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthEnd, depthShift), &noff);CHKERRQ(ierr);
176*cd0c2139SMatthew G Knepley     for (d = 0; d < dof; ++d) {
177*cd0c2139SMatthew G Knepley       newCoords[noff+d] = coords[off+d];
178*cd0c2139SMatthew G Knepley     }
179*cd0c2139SMatthew G Knepley   }
180*cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
181*cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr);
182*cd0c2139SMatthew G Knepley   ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr);
183*cd0c2139SMatthew G Knepley   ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr);
184*cd0c2139SMatthew G Knepley   ierr = PetscFree(depthEnd);CHKERRQ(ierr);
185*cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
186*cd0c2139SMatthew G Knepley }
187*cd0c2139SMatthew G Knepley 
188*cd0c2139SMatthew G Knepley #undef __FUNCT__
189*cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal"
190*cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew)
191*cd0c2139SMatthew G Knepley {
192*cd0c2139SMatthew G Knepley   PetscInt          *depthEnd;
193*cd0c2139SMatthew G Knepley   PetscInt           depth = 0, d;
194*cd0c2139SMatthew G Knepley   PetscSF            sfPoint, sfPointNew;
195*cd0c2139SMatthew G Knepley   const PetscSFNode *remotePoints;
196*cd0c2139SMatthew G Knepley   PetscSFNode       *gremotePoints;
197*cd0c2139SMatthew G Knepley   const PetscInt    *localPoints;
198*cd0c2139SMatthew G Knepley   PetscInt          *glocalPoints, *newLocation, *newRemoteLocation;
199*cd0c2139SMatthew G Knepley   PetscInt           numRoots, numLeaves, l, pStart, pEnd, totShift = 0;
200*cd0c2139SMatthew G Knepley   PetscMPIInt        numProcs;
201*cd0c2139SMatthew G Knepley   PetscErrorCode     ierr;
202*cd0c2139SMatthew G Knepley 
203*cd0c2139SMatthew G Knepley   PetscFunctionBegin;
204*cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
205*cd0c2139SMatthew G Knepley   ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr);
206*cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
207*cd0c2139SMatthew G Knepley     totShift += depthShift[d];
208*cd0c2139SMatthew G Knepley     ierr      = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
209*cd0c2139SMatthew G Knepley   }
210*cd0c2139SMatthew G Knepley   /* Step 9: Convert pointSF */
211*cd0c2139SMatthew G Knepley   ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &numProcs);CHKERRQ(ierr);
212*cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
213*cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr);
214*cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
215*cd0c2139SMatthew G Knepley   ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
216*cd0c2139SMatthew G Knepley   if (numRoots >= 0) {
217*cd0c2139SMatthew G Knepley     ierr = PetscMalloc2(numRoots,PetscInt,&newLocation,pEnd-pStart,PetscInt,&newRemoteLocation);CHKERRQ(ierr);
218*cd0c2139SMatthew G Knepley     for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthEnd, depthShift);
219*cd0c2139SMatthew G Knepley     ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr);
220*cd0c2139SMatthew G Knepley     ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr);
221*cd0c2139SMatthew G Knepley     ierr = PetscMalloc(numLeaves * sizeof(PetscInt),    &glocalPoints);CHKERRQ(ierr);
222*cd0c2139SMatthew G Knepley     ierr = PetscMalloc(numLeaves * sizeof(PetscSFNode), &gremotePoints);CHKERRQ(ierr);
223*cd0c2139SMatthew G Knepley     for (l = 0; l < numLeaves; ++l) {
224*cd0c2139SMatthew G Knepley       glocalPoints[l]        = DMPlexShiftPoint_Internal(localPoints[l], depth, depthEnd, depthShift);
225*cd0c2139SMatthew G Knepley       gremotePoints[l].rank  = remotePoints[l].rank;
226*cd0c2139SMatthew G Knepley       gremotePoints[l].index = newRemoteLocation[localPoints[l]];
227*cd0c2139SMatthew G Knepley     }
228*cd0c2139SMatthew G Knepley     ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr);
229*cd0c2139SMatthew G Knepley     ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
230*cd0c2139SMatthew G Knepley   }
231*cd0c2139SMatthew G Knepley   ierr = PetscFree(depthEnd);CHKERRQ(ierr);
232*cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
233*cd0c2139SMatthew G Knepley }
234*cd0c2139SMatthew G Knepley 
235*cd0c2139SMatthew G Knepley #undef __FUNCT__
236*cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal"
237*cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew)
238*cd0c2139SMatthew G Knepley {
239*cd0c2139SMatthew G Knepley   PetscSF            sfPoint;
240*cd0c2139SMatthew G Knepley   DMLabel            vtkLabel, ghostLabel;
241*cd0c2139SMatthew G Knepley   PetscInt          *depthEnd;
242*cd0c2139SMatthew G Knepley   const PetscSFNode *leafRemote;
243*cd0c2139SMatthew G Knepley   const PetscInt    *leafLocal;
244*cd0c2139SMatthew G Knepley   PetscInt           depth = 0, d, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f;
245*cd0c2139SMatthew G Knepley   PetscMPIInt        rank;
246*cd0c2139SMatthew G Knepley   PetscErrorCode     ierr;
247*cd0c2139SMatthew G Knepley 
248*cd0c2139SMatthew G Knepley   PetscFunctionBegin;
249*cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
250*cd0c2139SMatthew G Knepley   ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr);
251*cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
252*cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
253*cd0c2139SMatthew G Knepley   }
254*cd0c2139SMatthew G Knepley   /* Step 10: Convert labels */
255*cd0c2139SMatthew G Knepley   ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr);
256*cd0c2139SMatthew G Knepley   for (l = 0; l < numLabels; ++l) {
257*cd0c2139SMatthew G Knepley     DMLabel         label, newlabel;
258*cd0c2139SMatthew G Knepley     const char     *lname;
259*cd0c2139SMatthew G Knepley     PetscBool       isDepth;
260*cd0c2139SMatthew G Knepley     IS              valueIS;
261*cd0c2139SMatthew G Knepley     const PetscInt *values;
262*cd0c2139SMatthew G Knepley     PetscInt        numValues, val;
263*cd0c2139SMatthew G Knepley 
264*cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr);
265*cd0c2139SMatthew G Knepley     ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr);
266*cd0c2139SMatthew G Knepley     if (isDepth) continue;
267*cd0c2139SMatthew G Knepley     ierr = DMPlexCreateLabel(dmNew, lname);CHKERRQ(ierr);
268*cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr);
269*cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr);
270*cd0c2139SMatthew G Knepley     ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
271*cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr);
272*cd0c2139SMatthew G Knepley     ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
273*cd0c2139SMatthew G Knepley     for (val = 0; val < numValues; ++val) {
274*cd0c2139SMatthew G Knepley       IS              pointIS;
275*cd0c2139SMatthew G Knepley       const PetscInt *points;
276*cd0c2139SMatthew G Knepley       PetscInt        numPoints, p;
277*cd0c2139SMatthew G Knepley 
278*cd0c2139SMatthew G Knepley       ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr);
279*cd0c2139SMatthew G Knepley       ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);
280*cd0c2139SMatthew G Knepley       ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
281*cd0c2139SMatthew G Knepley       for (p = 0; p < numPoints; ++p) {
282*cd0c2139SMatthew G Knepley         const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthEnd, depthShift);
283*cd0c2139SMatthew G Knepley 
284*cd0c2139SMatthew G Knepley         ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr);
285*cd0c2139SMatthew G Knepley       }
286*cd0c2139SMatthew G Knepley       ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);
287*cd0c2139SMatthew G Knepley       ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
288*cd0c2139SMatthew G Knepley     }
289*cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
290*cd0c2139SMatthew G Knepley     ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
291*cd0c2139SMatthew G Knepley   }
292*cd0c2139SMatthew G Knepley   ierr = PetscFree(depthEnd);CHKERRQ(ierr);
293*cd0c2139SMatthew G Knepley   /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */
294*cd0c2139SMatthew G Knepley   ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr);
295*cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
296*cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
297*cd0c2139SMatthew G Knepley   ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr);
298*cd0c2139SMatthew G Knepley   ierr = DMPlexCreateLabel(dmNew, "vtk");CHKERRQ(ierr);
299*cd0c2139SMatthew G Knepley   ierr = DMPlexCreateLabel(dmNew, "ghost");CHKERRQ(ierr);
300*cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr);
301*cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr);
302*cd0c2139SMatthew G Knepley   for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) {
303*cd0c2139SMatthew G Knepley     for (; c < leafLocal[l] && c < cEnd; ++c) {
304*cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
305*cd0c2139SMatthew G Knepley     }
306*cd0c2139SMatthew G Knepley     if (leafLocal[l] >= cEnd) break;
307*cd0c2139SMatthew G Knepley     if (leafRemote[l].rank == rank) {
308*cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
309*cd0c2139SMatthew G Knepley     } else {
310*cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr);
311*cd0c2139SMatthew G Knepley     }
312*cd0c2139SMatthew G Knepley   }
313*cd0c2139SMatthew G Knepley   for (; c < cEnd; ++c) {
314*cd0c2139SMatthew G Knepley     ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
315*cd0c2139SMatthew G Knepley   }
316*cd0c2139SMatthew G Knepley   if (0) {
317*cd0c2139SMatthew G Knepley     ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr);
318*cd0c2139SMatthew G Knepley     ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
319*cd0c2139SMatthew G Knepley     ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
320*cd0c2139SMatthew G Knepley   }
321*cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr);
322*cd0c2139SMatthew G Knepley   for (f = fStart; f < fEnd; ++f) {
323*cd0c2139SMatthew G Knepley     PetscInt numCells;
324*cd0c2139SMatthew G Knepley 
325*cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr);
326*cd0c2139SMatthew G Knepley     if (numCells < 2) {
327*cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);
328*cd0c2139SMatthew G Knepley     } else {
329*cd0c2139SMatthew G Knepley       const PetscInt *cells = NULL;
330*cd0c2139SMatthew G Knepley       PetscInt        vA, vB;
331*cd0c2139SMatthew G Knepley 
332*cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr);
333*cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr);
334*cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr);
335*cd0c2139SMatthew G Knepley       if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);}
336*cd0c2139SMatthew G Knepley     }
337*cd0c2139SMatthew G Knepley   }
338*cd0c2139SMatthew G Knepley   if (0) {
339*cd0c2139SMatthew G Knepley     ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr);
340*cd0c2139SMatthew G Knepley     ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
341*cd0c2139SMatthew G Knepley     ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
342*cd0c2139SMatthew G Knepley   }
343*cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
344*cd0c2139SMatthew G Knepley }
345*cd0c2139SMatthew G Knepley 
346*cd0c2139SMatthew G Knepley #undef __FUNCT__
347*cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal"
348*cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm)
349*cd0c2139SMatthew G Knepley {
350*cd0c2139SMatthew G Knepley   IS              valueIS;
351*cd0c2139SMatthew G Knepley   const PetscInt *values;
352*cd0c2139SMatthew G Knepley   PetscInt       *depthShift;
353*cd0c2139SMatthew G Knepley   PetscInt        depth = 0, numFS, fs, ghostCell, cEnd, c;
354*cd0c2139SMatthew G Knepley   PetscErrorCode  ierr;
355*cd0c2139SMatthew G Knepley 
356*cd0c2139SMatthew G Knepley   PetscFunctionBegin;
357*cd0c2139SMatthew G Knepley   /* Count ghost cells */
358*cd0c2139SMatthew G Knepley   ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
359*cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr);
360*cd0c2139SMatthew G Knepley   ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
361*cd0c2139SMatthew G Knepley 
362*cd0c2139SMatthew G Knepley   *numGhostCells = 0;
363*cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
364*cd0c2139SMatthew G Knepley     PetscInt numBdFaces;
365*cd0c2139SMatthew G Knepley 
366*cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumSize(label, values[fs], &numBdFaces);CHKERRQ(ierr);
367*cd0c2139SMatthew G Knepley 
368*cd0c2139SMatthew G Knepley     *numGhostCells += numBdFaces;
369*cd0c2139SMatthew G Knepley   }
370*cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
371*cd0c2139SMatthew G Knepley   ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthShift);CHKERRQ(ierr);
372*cd0c2139SMatthew G Knepley   ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr);
373*cd0c2139SMatthew G Knepley   if (depth >= 0) depthShift[depth] = *numGhostCells;
374*cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
375*cd0c2139SMatthew G Knepley   /* Step 3: Set cone/support sizes for new points */
376*cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
377*cd0c2139SMatthew G Knepley   for (c = cEnd; c < cEnd + *numGhostCells; ++c) {
378*cd0c2139SMatthew G Knepley     ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr);
379*cd0c2139SMatthew G Knepley   }
380*cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
381*cd0c2139SMatthew G Knepley     IS              faceIS;
382*cd0c2139SMatthew G Knepley     const PetscInt *faces;
383*cd0c2139SMatthew G Knepley     PetscInt        numFaces, f;
384*cd0c2139SMatthew G Knepley 
385*cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
386*cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
387*cd0c2139SMatthew G Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
388*cd0c2139SMatthew G Knepley     for (f = 0; f < numFaces; ++f) {
389*cd0c2139SMatthew G Knepley       PetscInt size;
390*cd0c2139SMatthew G Knepley 
391*cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr);
392*cd0c2139SMatthew G Knepley       if (size != 1) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "DM has boundary face %d with %d support cells", faces[f], size);
393*cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(gdm, faces[f] + *numGhostCells, 2);CHKERRQ(ierr);
394*cd0c2139SMatthew G Knepley     }
395*cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr);
396*cd0c2139SMatthew G Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
397*cd0c2139SMatthew G Knepley   }
398*cd0c2139SMatthew G Knepley   /* Step 4: Setup ghosted DM */
399*cd0c2139SMatthew G Knepley   ierr = DMSetUp(gdm);CHKERRQ(ierr);
400*cd0c2139SMatthew G Knepley   ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
401*cd0c2139SMatthew G Knepley   /* Step 6: Set cones and supports for new points */
402*cd0c2139SMatthew G Knepley   ghostCell = cEnd;
403*cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
404*cd0c2139SMatthew G Knepley     IS              faceIS;
405*cd0c2139SMatthew G Knepley     const PetscInt *faces;
406*cd0c2139SMatthew G Knepley     PetscInt        numFaces, f;
407*cd0c2139SMatthew G Knepley 
408*cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
409*cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
410*cd0c2139SMatthew G Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
411*cd0c2139SMatthew G Knepley     for (f = 0; f < numFaces; ++f, ++ghostCell) {
412*cd0c2139SMatthew G Knepley       PetscInt newFace = faces[f] + *numGhostCells;
413*cd0c2139SMatthew G Knepley 
414*cd0c2139SMatthew G Knepley       ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr);
415*cd0c2139SMatthew G Knepley       ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr);
416*cd0c2139SMatthew G Knepley     }
417*cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr);
418*cd0c2139SMatthew G Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
419*cd0c2139SMatthew G Knepley   }
420*cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
421*cd0c2139SMatthew G Knepley   ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
422*cd0c2139SMatthew G Knepley   /* Step 7: Stratify */
423*cd0c2139SMatthew G Knepley   ierr = DMPlexStratify(gdm);CHKERRQ(ierr);
424*cd0c2139SMatthew G Knepley   ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
425*cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
426*cd0c2139SMatthew G Knepley   ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
427*cd0c2139SMatthew G Knepley   ierr = PetscFree(depthShift);CHKERRQ(ierr);
428*cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
429*cd0c2139SMatthew G Knepley }
430*cd0c2139SMatthew G Knepley 
431*cd0c2139SMatthew G Knepley #undef __FUNCT__
432*cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells"
433*cd0c2139SMatthew G Knepley /*@C
434*cd0c2139SMatthew G Knepley   DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face
435*cd0c2139SMatthew G Knepley 
436*cd0c2139SMatthew G Knepley   Collective on dm
437*cd0c2139SMatthew G Knepley 
438*cd0c2139SMatthew G Knepley   Input Parameters:
439*cd0c2139SMatthew G Knepley + dm - The original DM
440*cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL
441*cd0c2139SMatthew G Knepley 
442*cd0c2139SMatthew G Knepley   Output Parameters:
443*cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM
444*cd0c2139SMatthew G Knepley - dmGhosted - The new DM
445*cd0c2139SMatthew G Knepley 
446*cd0c2139SMatthew G Knepley   Note: If no label exists of that name, one will be created marking all boundary faces
447*cd0c2139SMatthew G Knepley 
448*cd0c2139SMatthew G Knepley   Level: developer
449*cd0c2139SMatthew G Knepley 
450*cd0c2139SMatthew G Knepley .seealso: DMCreate()
451*cd0c2139SMatthew G Knepley */
452*cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted)
453*cd0c2139SMatthew G Knepley {
454*cd0c2139SMatthew G Knepley   DM             gdm;
455*cd0c2139SMatthew G Knepley   DMLabel        label;
456*cd0c2139SMatthew G Knepley   const char    *name = labelName ? labelName : "Face Sets";
457*cd0c2139SMatthew G Knepley   PetscInt       dim;
458*cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
459*cd0c2139SMatthew G Knepley 
460*cd0c2139SMatthew G Knepley   PetscFunctionBegin;
461*cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
462*cd0c2139SMatthew G Knepley   PetscValidPointer(numGhostCells, 3);
463*cd0c2139SMatthew G Knepley   PetscValidPointer(dmGhosted, 4);
464*cd0c2139SMatthew G Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr);
465*cd0c2139SMatthew G Knepley   ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr);
466*cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
467*cd0c2139SMatthew G Knepley   ierr = DMPlexSetDimension(gdm, dim);CHKERRQ(ierr);
468*cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr);
469*cd0c2139SMatthew G Knepley   if (!label) {
470*cd0c2139SMatthew G Knepley     /* Get label for boundary faces */
471*cd0c2139SMatthew G Knepley     ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr);
472*cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr);
473*cd0c2139SMatthew G Knepley     ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr);
474*cd0c2139SMatthew G Knepley   }
475*cd0c2139SMatthew G Knepley   ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr);
476*cd0c2139SMatthew G Knepley   ierr = DMSetFromOptions(gdm);CHKERRQ(ierr);
477*cd0c2139SMatthew G Knepley   *dmGhosted = gdm;
478*cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
479*cd0c2139SMatthew G Knepley }
480*cd0c2139SMatthew G Knepley 
481*cd0c2139SMatthew G Knepley #undef __FUNCT__
482*cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal"
483*cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm)
484*cd0c2139SMatthew G Knepley {
485*cd0c2139SMatthew G Knepley   MPI_Comm        comm;
486*cd0c2139SMatthew G Knepley   IS              valueIS, *pointIS;
487*cd0c2139SMatthew G Knepley   const PetscInt *values, **splitPoints;
488*cd0c2139SMatthew G Knepley   PetscSection    coordSection;
489*cd0c2139SMatthew G Knepley   Vec             coordinates;
490*cd0c2139SMatthew G Knepley   PetscScalar    *coords;
491*cd0c2139SMatthew G Knepley   PetscInt       *depthShift, *depthOffset, *pMaxNew, *numSplitPoints, *coneNew, *supportNew;
492*cd0c2139SMatthew G Knepley   PetscInt        shift = 100, depth = 0, dep, dim, d, numSP = 0, sp, maxConeSize, maxSupportSize, numLabels, p, v;
493*cd0c2139SMatthew G Knepley   PetscErrorCode  ierr;
494*cd0c2139SMatthew G Knepley 
495*cd0c2139SMatthew G Knepley   PetscFunctionBegin;
496*cd0c2139SMatthew G Knepley   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
497*cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
498*cd0c2139SMatthew G Knepley   /* Count split points and add cohesive cells */
499*cd0c2139SMatthew G Knepley   if (label) {
500*cd0c2139SMatthew G Knepley     ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
501*cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr);
502*cd0c2139SMatthew G Knepley     ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
503*cd0c2139SMatthew G Knepley   }
504*cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
505*cd0c2139SMatthew G Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
506*cd0c2139SMatthew G Knepley   ierr = PetscMalloc5(depth+1,PetscInt,&depthShift,depth+1,PetscInt,&depthOffset,depth+1,PetscInt,&pMaxNew,maxConeSize*3,PetscInt,&coneNew,maxSupportSize,PetscInt,&supportNew);CHKERRQ(ierr);
507*cd0c2139SMatthew G Knepley   ierr = PetscMalloc3(depth+1,IS,&pointIS,depth+1,PetscInt,&numSplitPoints,depth+1,const PetscInt*,&splitPoints);CHKERRQ(ierr);
508*cd0c2139SMatthew G Knepley   ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr);
509*cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
510*cd0c2139SMatthew G Knepley     ierr              = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr);
511*cd0c2139SMatthew G Knepley     numSplitPoints[d] = 0;
512*cd0c2139SMatthew G Knepley     splitPoints[d]    = NULL;
513*cd0c2139SMatthew G Knepley     pointIS[d]        = NULL;
514*cd0c2139SMatthew G Knepley   }
515*cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
516*cd0c2139SMatthew G Knepley     const PetscInt dep = values[sp];
517*cd0c2139SMatthew G Knepley 
518*cd0c2139SMatthew G Knepley     if ((dep < 0) || (dep > depth)) continue;
519*cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumSize(label, dep, &depthShift[dep]);CHKERRQ(ierr);
520*cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, dep, &pointIS[dep]);CHKERRQ(ierr);
521*cd0c2139SMatthew G Knepley     if (pointIS[dep]) {
522*cd0c2139SMatthew G Knepley       ierr = ISGetLocalSize(pointIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr);
523*cd0c2139SMatthew G Knepley       ierr = ISGetIndices(pointIS[dep], &splitPoints[dep]);CHKERRQ(ierr);
524*cd0c2139SMatthew G Knepley     }
525*cd0c2139SMatthew G Knepley   }
526*cd0c2139SMatthew G Knepley   if (depth >= 0) {
527*cd0c2139SMatthew G Knepley     /* Calculate number of additional points */
528*cd0c2139SMatthew G Knepley     depthShift[depth] = depthShift[depth-1]; /* There is a cohesive cell for every split face   */
529*cd0c2139SMatthew G Knepley     depthShift[1]    += depthShift[0];       /* There is a cohesive edge for every split vertex */
530*cd0c2139SMatthew G Knepley     /* Calculate hybrid bound for each dimension */
531*cd0c2139SMatthew G Knepley     pMaxNew[0] += depthShift[depth];
532*cd0c2139SMatthew G Knepley     if (depth > 1) pMaxNew[dim-1] += depthShift[depth] + depthShift[0];
533*cd0c2139SMatthew G Knepley     if (depth > 2) pMaxNew[1]     += depthShift[depth] + depthShift[0] + depthShift[dim-1];
534*cd0c2139SMatthew G Knepley 
535*cd0c2139SMatthew G Knepley     /* Calculate point offset for each dimension */
536*cd0c2139SMatthew G Knepley     depthOffset[depth] = 0;
537*cd0c2139SMatthew G Knepley     depthOffset[0]     = depthOffset[depth] + depthShift[depth];
538*cd0c2139SMatthew G Knepley     if (depth > 1) depthOffset[dim-1] = depthOffset[0]     + depthShift[0];
539*cd0c2139SMatthew G Knepley     if (depth > 2) depthOffset[1]     = depthOffset[dim-1] + depthShift[dim-1];
540*cd0c2139SMatthew G Knepley   }
541*cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
542*cd0c2139SMatthew G Knepley   /* Step 3: Set cone/support sizes for new points */
543*cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
544*cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
545*cd0c2139SMatthew G Knepley       const PetscInt  oldp   = splitPoints[dep][p];
546*cd0c2139SMatthew G Knepley       const PetscInt  newp   = depthOffset[dep] + oldp;
547*cd0c2139SMatthew G Knepley       const PetscInt  splitp = pMaxNew[dep] + p;
548*cd0c2139SMatthew G Knepley       const PetscInt *support;
549*cd0c2139SMatthew G Knepley       PetscInt        coneSize, supportSize, q, e;
550*cd0c2139SMatthew G Knepley 
551*cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
552*cd0c2139SMatthew G Knepley       ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr);
553*cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
554*cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr);
555*cd0c2139SMatthew G Knepley       if (dep == depth-1) {
556*cd0c2139SMatthew G Knepley         const PetscInt ccell = pMaxNew[depth] + p;
557*cd0c2139SMatthew G Knepley         /* Add cohesive cells, they are prisms */
558*cd0c2139SMatthew G Knepley         ierr = DMPlexSetConeSize(sdm, ccell, 2 + coneSize);CHKERRQ(ierr);
559*cd0c2139SMatthew G Knepley       } else if (dep == 0) {
560*cd0c2139SMatthew G Knepley         const PetscInt cedge = pMaxNew[1] + (depthShift[1] - depthShift[0]) + p;
561*cd0c2139SMatthew G Knepley 
562*cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
563*cd0c2139SMatthew G Knepley         /* Split old vertex: Edges in old split faces and new cohesive edge */
564*cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
565*cd0c2139SMatthew G Knepley           PetscInt val;
566*cd0c2139SMatthew G Knepley 
567*cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
568*cd0c2139SMatthew G Knepley           if ((val == 1) || (val == (shift + 1))) ++q;
569*cd0c2139SMatthew G Knepley         }
570*cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupportSize(sdm, newp, q+1);CHKERRQ(ierr);
571*cd0c2139SMatthew G Knepley         /* Split new vertex: Edges in new split faces and new cohesive edge */
572*cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
573*cd0c2139SMatthew G Knepley           PetscInt val;
574*cd0c2139SMatthew G Knepley 
575*cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
576*cd0c2139SMatthew G Knepley           if ((val == 1) || (val == -(shift + 1))) ++q;
577*cd0c2139SMatthew G Knepley         }
578*cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupportSize(sdm, splitp, q+1);CHKERRQ(ierr);
579*cd0c2139SMatthew G Knepley         /* Add cohesive edges */
580*cd0c2139SMatthew G Knepley         ierr = DMPlexSetConeSize(sdm, cedge, 2);CHKERRQ(ierr);
581*cd0c2139SMatthew G Knepley         /* Punt for now on support, you loop over closure, extract faces, check which ones are in the label */
582*cd0c2139SMatthew G Knepley       } else if (dep == dim-2) {
583*cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
584*cd0c2139SMatthew G Knepley         /* Split old edge: Faces in positive side cells and old split faces */
585*cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
586*cd0c2139SMatthew G Knepley           PetscInt val;
587*cd0c2139SMatthew G Knepley 
588*cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
589*cd0c2139SMatthew G Knepley           if ((val == dim-1) || (val == (shift + dim-1))) ++q;
590*cd0c2139SMatthew G Knepley         }
591*cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupportSize(sdm, newp, q);CHKERRQ(ierr);
592*cd0c2139SMatthew G Knepley         /* Split new edge: Faces in negative side cells and new split faces */
593*cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
594*cd0c2139SMatthew G Knepley           PetscInt val;
595*cd0c2139SMatthew G Knepley 
596*cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
597*cd0c2139SMatthew G Knepley           if ((val == dim-1) || (val == -(shift + dim-1))) ++q;
598*cd0c2139SMatthew G Knepley         }
599*cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupportSize(sdm, splitp, q);CHKERRQ(ierr);
600*cd0c2139SMatthew G Knepley       }
601*cd0c2139SMatthew G Knepley     }
602*cd0c2139SMatthew G Knepley   }
603*cd0c2139SMatthew G Knepley   /* Step 4: Setup split DM */
604*cd0c2139SMatthew G Knepley   ierr = DMSetUp(sdm);CHKERRQ(ierr);
605*cd0c2139SMatthew G Knepley   ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
606*cd0c2139SMatthew G Knepley   /* Step 6: Set cones and supports for new points */
607*cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
608*cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
609*cd0c2139SMatthew G Knepley       const PetscInt  oldp   = splitPoints[dep][p];
610*cd0c2139SMatthew G Knepley       const PetscInt  newp   = depthOffset[dep] + oldp;
611*cd0c2139SMatthew G Knepley       const PetscInt  splitp = pMaxNew[dep] + p;
612*cd0c2139SMatthew G Knepley       const PetscInt *cone, *support, *ornt;
613*cd0c2139SMatthew G Knepley       PetscInt        coneSize, supportSize, q, v, e, s;
614*cd0c2139SMatthew G Knepley 
615*cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
616*cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr);
617*cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr);
618*cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
619*cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
620*cd0c2139SMatthew G Knepley       if (dep == depth-1) {
621*cd0c2139SMatthew G Knepley         const PetscInt  ccell = pMaxNew[depth] + p;
622*cd0c2139SMatthew G Knepley         const PetscInt *supportF;
623*cd0c2139SMatthew G Knepley 
624*cd0c2139SMatthew G Knepley         /* Split face:       copy in old face to new face to start */
625*cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(sdm, newp,  &supportF);CHKERRQ(ierr);
626*cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr);
627*cd0c2139SMatthew G Knepley         /* Split old face:   old vertices/edges in cone so no change */
628*cd0c2139SMatthew G Knepley         /* Split new face:   new vertices/edges in cone */
629*cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
630*cd0c2139SMatthew G Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dim-2], splitPoints[dim-2], &v);CHKERRQ(ierr);
631*cd0c2139SMatthew G Knepley 
632*cd0c2139SMatthew G Knepley           coneNew[2+q] = pMaxNew[dim-2] + v;
633*cd0c2139SMatthew G Knepley         }
634*cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr);
635*cd0c2139SMatthew G Knepley         ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr);
636*cd0c2139SMatthew G Knepley         /* Cohesive cell:    Old and new split face, then new cohesive edges */
637*cd0c2139SMatthew G Knepley         coneNew[0] = newp;
638*cd0c2139SMatthew G Knepley         coneNew[1] = splitp;
639*cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
640*cd0c2139SMatthew G Knepley           coneNew[2+q] = (pMaxNew[1] - pMaxNew[dim-2]) + (depthShift[1] - depthShift[0]) + coneNew[2+q];
641*cd0c2139SMatthew G Knepley         }
642*cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, ccell, coneNew);CHKERRQ(ierr);
643*cd0c2139SMatthew G Knepley 
644*cd0c2139SMatthew G Knepley 
645*cd0c2139SMatthew G Knepley         for (s = 0; s < supportSize; ++s) {
646*cd0c2139SMatthew G Knepley           PetscInt val;
647*cd0c2139SMatthew G Knepley 
648*cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr);
649*cd0c2139SMatthew G Knepley           if (val < 0) {
650*cd0c2139SMatthew G Knepley             /* Split old face:   Replace negative side cell with cohesive cell */
651*cd0c2139SMatthew G Knepley             ierr = DMPlexInsertSupport(sdm, newp, s, ccell);CHKERRQ(ierr);
652*cd0c2139SMatthew G Knepley           } else {
653*cd0c2139SMatthew G Knepley             /* Split new face:   Replace positive side cell with cohesive cell */
654*cd0c2139SMatthew G Knepley             ierr = DMPlexInsertSupport(sdm, splitp, s, ccell);CHKERRQ(ierr);
655*cd0c2139SMatthew G Knepley           }
656*cd0c2139SMatthew G Knepley         }
657*cd0c2139SMatthew G Knepley       } else if (dep == 0) {
658*cd0c2139SMatthew G Knepley         const PetscInt cedge = pMaxNew[1] + (depthShift[1] - depthShift[0]) + p;
659*cd0c2139SMatthew G Knepley 
660*cd0c2139SMatthew G Knepley         /* Split old vertex: Edges in old split faces and new cohesive edge */
661*cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
662*cd0c2139SMatthew G Knepley           PetscInt val;
663*cd0c2139SMatthew G Knepley 
664*cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
665*cd0c2139SMatthew G Knepley           if ((val == 1) || (val == (shift + 1))) {
666*cd0c2139SMatthew G Knepley             supportNew[q++] = depthOffset[1] + support[e];
667*cd0c2139SMatthew G Knepley           }
668*cd0c2139SMatthew G Knepley         }
669*cd0c2139SMatthew G Knepley         supportNew[q] = cedge;
670*cd0c2139SMatthew G Knepley 
671*cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
672*cd0c2139SMatthew G Knepley         /* Split new vertex: Edges in new split faces and new cohesive edge */
673*cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
674*cd0c2139SMatthew G Knepley           PetscInt val, edge;
675*cd0c2139SMatthew G Knepley 
676*cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
677*cd0c2139SMatthew G Knepley           if (val == 1) {
678*cd0c2139SMatthew G Knepley             ierr = PetscFindInt(support[e], numSplitPoints[1], splitPoints[1], &edge);CHKERRQ(ierr);
679*cd0c2139SMatthew G Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
680*cd0c2139SMatthew G Knepley             supportNew[q++] = pMaxNew[1] + edge;
681*cd0c2139SMatthew G Knepley           } else if (val == -(shift + 1)) {
682*cd0c2139SMatthew G Knepley             supportNew[q++] = depthOffset[1] + support[e];
683*cd0c2139SMatthew G Knepley           }
684*cd0c2139SMatthew G Knepley         }
685*cd0c2139SMatthew G Knepley         supportNew[q] = cedge;
686*cd0c2139SMatthew G Knepley         ierr          = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr);
687*cd0c2139SMatthew G Knepley         /* Cohesive edge:    Old and new split vertex, punting on support */
688*cd0c2139SMatthew G Knepley         coneNew[0] = newp;
689*cd0c2139SMatthew G Knepley         coneNew[1] = splitp;
690*cd0c2139SMatthew G Knepley         ierr       = DMPlexSetCone(sdm, cedge, coneNew);CHKERRQ(ierr);
691*cd0c2139SMatthew G Knepley       } else if (dep == dim-2) {
692*cd0c2139SMatthew G Knepley         /* Split old edge:   old vertices in cone so no change */
693*cd0c2139SMatthew G Knepley         /* Split new edge:   new vertices in cone */
694*cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
695*cd0c2139SMatthew G Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dim-3], splitPoints[dim-3], &v);CHKERRQ(ierr);
696*cd0c2139SMatthew G Knepley 
697*cd0c2139SMatthew G Knepley           coneNew[q] = pMaxNew[dim-3] + v;
698*cd0c2139SMatthew G Knepley         }
699*cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr);
700*cd0c2139SMatthew G Knepley         /* Split old edge: Faces in positive side cells and old split faces */
701*cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
702*cd0c2139SMatthew G Knepley           PetscInt val;
703*cd0c2139SMatthew G Knepley 
704*cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
705*cd0c2139SMatthew G Knepley           if ((val == dim-1) || (val == (shift + dim-1))) {
706*cd0c2139SMatthew G Knepley             supportNew[q++] = depthOffset[dim-1] + support[e];
707*cd0c2139SMatthew G Knepley           }
708*cd0c2139SMatthew G Knepley         }
709*cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
710*cd0c2139SMatthew G Knepley         /* Split new edge: Faces in negative side cells and new split faces */
711*cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
712*cd0c2139SMatthew G Knepley           PetscInt val, face;
713*cd0c2139SMatthew G Knepley 
714*cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
715*cd0c2139SMatthew G Knepley           if (val == dim-1) {
716*cd0c2139SMatthew G Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dim-1], splitPoints[dim-1], &face);CHKERRQ(ierr);
717*cd0c2139SMatthew G Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]);
718*cd0c2139SMatthew G Knepley             supportNew[q++] = pMaxNew[dim-1] + face;
719*cd0c2139SMatthew G Knepley           } else if (val == -(shift + dim-1)) {
720*cd0c2139SMatthew G Knepley             supportNew[q++] = depthOffset[dim-1] + support[e];
721*cd0c2139SMatthew G Knepley           }
722*cd0c2139SMatthew G Knepley         }
723*cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr);
724*cd0c2139SMatthew G Knepley       }
725*cd0c2139SMatthew G Knepley     }
726*cd0c2139SMatthew G Knepley   }
727*cd0c2139SMatthew G Knepley   /* Step 6b: Replace split points in negative side cones */
728*cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
729*cd0c2139SMatthew G Knepley     PetscInt        dep = values[sp];
730*cd0c2139SMatthew G Knepley     IS              pIS;
731*cd0c2139SMatthew G Knepley     PetscInt        numPoints;
732*cd0c2139SMatthew G Knepley     const PetscInt *points;
733*cd0c2139SMatthew G Knepley 
734*cd0c2139SMatthew G Knepley     if (dep >= 0) continue;
735*cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr);
736*cd0c2139SMatthew G Knepley     if (!pIS) continue;
737*cd0c2139SMatthew G Knepley     dep  = -dep - shift;
738*cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr);
739*cd0c2139SMatthew G Knepley     ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr);
740*cd0c2139SMatthew G Knepley     for (p = 0; p < numPoints; ++p) {
741*cd0c2139SMatthew G Knepley       const PetscInt  oldp = points[p];
742*cd0c2139SMatthew G Knepley       const PetscInt  newp = depthOffset[dep] + oldp;
743*cd0c2139SMatthew G Knepley       const PetscInt *cone;
744*cd0c2139SMatthew G Knepley       PetscInt        coneSize, c;
745*cd0c2139SMatthew G Knepley       PetscBool       replaced = PETSC_FALSE;
746*cd0c2139SMatthew G Knepley 
747*cd0c2139SMatthew G Knepley       /* Negative edge: replace split vertex */
748*cd0c2139SMatthew G Knepley       /* Negative cell: replace split face */
749*cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr);
750*cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr);
751*cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
752*cd0c2139SMatthew G Knepley         const PetscInt coldp = cone[c] - depthOffset[dep-1];
753*cd0c2139SMatthew G Knepley         PetscInt       csplitp, cp, val;
754*cd0c2139SMatthew G Knepley 
755*cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr);
756*cd0c2139SMatthew G Knepley         if (val == dep-1) {
757*cd0c2139SMatthew G Knepley           ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr);
758*cd0c2139SMatthew G Knepley           if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1);
759*cd0c2139SMatthew G Knepley           csplitp  = pMaxNew[dep-1] + cp;
760*cd0c2139SMatthew G Knepley           ierr     = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr);
761*cd0c2139SMatthew G Knepley           replaced = PETSC_TRUE;
762*cd0c2139SMatthew G Knepley         }
763*cd0c2139SMatthew G Knepley       }
764*cd0c2139SMatthew G Knepley       if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp);
765*cd0c2139SMatthew G Knepley     }
766*cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr);
767*cd0c2139SMatthew G Knepley     ierr = ISDestroy(&pIS);CHKERRQ(ierr);
768*cd0c2139SMatthew G Knepley   }
769*cd0c2139SMatthew G Knepley   /* Step 7: Stratify */
770*cd0c2139SMatthew G Knepley   ierr = DMPlexStratify(sdm);CHKERRQ(ierr);
771*cd0c2139SMatthew G Knepley   /* Step 8: Coordinates */
772*cd0c2139SMatthew G Knepley   ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
773*cd0c2139SMatthew G Knepley   ierr = DMPlexGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr);
774*cd0c2139SMatthew G Knepley   ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr);
775*cd0c2139SMatthew G Knepley   ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
776*cd0c2139SMatthew G Knepley   for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) {
777*cd0c2139SMatthew G Knepley     const PetscInt newp   = depthOffset[0] + splitPoints[0][v];
778*cd0c2139SMatthew G Knepley     const PetscInt splitp = pMaxNew[0] + v;
779*cd0c2139SMatthew G Knepley     PetscInt       dof, off, soff, d;
780*cd0c2139SMatthew G Knepley 
781*cd0c2139SMatthew G Knepley     ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr);
782*cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr);
783*cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr);
784*cd0c2139SMatthew G Knepley     for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d];
785*cd0c2139SMatthew G Knepley   }
786*cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
787*cd0c2139SMatthew G Knepley   /* Step 9: SF, if I can figure this out we can split the mesh in parallel */
788*cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
789*cd0c2139SMatthew G Knepley   /* Step 10: Labels */
790*cd0c2139SMatthew G Knepley   ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
791*cd0c2139SMatthew G Knepley   ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr);
792*cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
793*cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
794*cd0c2139SMatthew G Knepley       const PetscInt newp   = depthOffset[dep] + splitPoints[dep][p];
795*cd0c2139SMatthew G Knepley       const PetscInt splitp = pMaxNew[dep] + p;
796*cd0c2139SMatthew G Knepley       PetscInt       l;
797*cd0c2139SMatthew G Knepley 
798*cd0c2139SMatthew G Knepley       for (l = 0; l < numLabels; ++l) {
799*cd0c2139SMatthew G Knepley         DMLabel     mlabel;
800*cd0c2139SMatthew G Knepley         const char *lname;
801*cd0c2139SMatthew G Knepley         PetscInt    val;
802*cd0c2139SMatthew G Knepley 
803*cd0c2139SMatthew G Knepley         ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr);
804*cd0c2139SMatthew G Knepley         ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr);
805*cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr);
806*cd0c2139SMatthew G Knepley         if (val >= 0) {
807*cd0c2139SMatthew G Knepley           ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr);
808*cd0c2139SMatthew G Knepley           if (dep == 0) {
809*cd0c2139SMatthew G Knepley             const PetscInt cedge = pMaxNew[1] + (depthShift[1] - depthShift[0]) + p;
810*cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr);
811*cd0c2139SMatthew G Knepley           }
812*cd0c2139SMatthew G Knepley         }
813*cd0c2139SMatthew G Knepley       }
814*cd0c2139SMatthew G Knepley     }
815*cd0c2139SMatthew G Knepley   }
816*cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
817*cd0c2139SMatthew G Knepley     const PetscInt dep = values[sp];
818*cd0c2139SMatthew G Knepley 
819*cd0c2139SMatthew G Knepley     if ((dep < 0) || (dep > depth)) continue;
820*cd0c2139SMatthew G Knepley     if (pointIS[dep]) {ierr = ISRestoreIndices(pointIS[dep], &splitPoints[dep]);CHKERRQ(ierr);}
821*cd0c2139SMatthew G Knepley     ierr = ISDestroy(&pointIS[dep]);CHKERRQ(ierr);
822*cd0c2139SMatthew G Knepley   }
823*cd0c2139SMatthew G Knepley   if (label) {
824*cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
825*cd0c2139SMatthew G Knepley     ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
826*cd0c2139SMatthew G Knepley   }
827*cd0c2139SMatthew G Knepley   ierr = PetscFree5(depthShift, depthOffset, pMaxNew, coneNew, supportNew);CHKERRQ(ierr);
828*cd0c2139SMatthew G Knepley   ierr = PetscFree3(pointIS, numSplitPoints, splitPoints);CHKERRQ(ierr);
829*cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
830*cd0c2139SMatthew G Knepley }
831*cd0c2139SMatthew G Knepley 
832*cd0c2139SMatthew G Knepley #undef __FUNCT__
833*cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells"
834*cd0c2139SMatthew G Knepley /*@C
835*cd0c2139SMatthew G Knepley   DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface
836*cd0c2139SMatthew G Knepley 
837*cd0c2139SMatthew G Knepley   Collective on dm
838*cd0c2139SMatthew G Knepley 
839*cd0c2139SMatthew G Knepley   Input Parameters:
840*cd0c2139SMatthew G Knepley + dm - The original DM
841*cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces (this could be auto-generated)
842*cd0c2139SMatthew G Knepley 
843*cd0c2139SMatthew G Knepley   Output Parameters:
844*cd0c2139SMatthew G Knepley - dmSplit - The new DM
845*cd0c2139SMatthew G Knepley 
846*cd0c2139SMatthew G Knepley   Level: developer
847*cd0c2139SMatthew G Knepley 
848*cd0c2139SMatthew G Knepley .seealso: DMCreate(), DMLabelCohesiveComplete()
849*cd0c2139SMatthew G Knepley @*/
850*cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit)
851*cd0c2139SMatthew G Knepley {
852*cd0c2139SMatthew G Knepley   DM             sdm;
853*cd0c2139SMatthew G Knepley   PetscInt       dim;
854*cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
855*cd0c2139SMatthew G Knepley 
856*cd0c2139SMatthew G Knepley   PetscFunctionBegin;
857*cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
858*cd0c2139SMatthew G Knepley   PetscValidPointer(dmSplit, 4);
859*cd0c2139SMatthew G Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr);
860*cd0c2139SMatthew G Knepley   ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr);
861*cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
862*cd0c2139SMatthew G Knepley   ierr = DMPlexSetDimension(sdm, dim);CHKERRQ(ierr);
863*cd0c2139SMatthew G Knepley   switch (dim) {
864*cd0c2139SMatthew G Knepley   case 2:
865*cd0c2139SMatthew G Knepley   case 3:
866*cd0c2139SMatthew G Knepley     ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr);
867*cd0c2139SMatthew G Knepley     break;
868*cd0c2139SMatthew G Knepley   default:
869*cd0c2139SMatthew G Knepley     SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim);
870*cd0c2139SMatthew G Knepley   }
871*cd0c2139SMatthew G Knepley   *dmSplit = sdm;
872*cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
873*cd0c2139SMatthew G Knepley }
874*cd0c2139SMatthew G Knepley 
875*cd0c2139SMatthew G Knepley #undef __FUNCT__
876*cd0c2139SMatthew G Knepley #define __FUNCT__ "DMLabelCohesiveComplete"
877*cd0c2139SMatthew G Knepley /*@
878*cd0c2139SMatthew G Knepley   DMLabelCohesiveComplete - Starting with a label marking vertices on an internal surface, we add all other mesh pieces
879*cd0c2139SMatthew G Knepley   to complete the surface
880*cd0c2139SMatthew G Knepley 
881*cd0c2139SMatthew G Knepley   Input Parameters:
882*cd0c2139SMatthew G Knepley + dm - The DM
883*cd0c2139SMatthew G Knepley - label - A DMLabel marking the surface vertices
884*cd0c2139SMatthew G Knepley 
885*cd0c2139SMatthew G Knepley   Output Parameter:
886*cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points
887*cd0c2139SMatthew G Knepley 
888*cd0c2139SMatthew G Knepley   Level: developer
889*cd0c2139SMatthew G Knepley 
890*cd0c2139SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells()
891*cd0c2139SMatthew G Knepley @*/
892*cd0c2139SMatthew G Knepley PetscErrorCode DMLabelCohesiveComplete(DM dm, DMLabel label)
893*cd0c2139SMatthew G Knepley {
894*cd0c2139SMatthew G Knepley   IS              dimIS;
895*cd0c2139SMatthew G Knepley   const PetscInt *points;
896*cd0c2139SMatthew G Knepley   PetscInt        shift = 100, dim, dep, cStart, cEnd, numPoints, p, val;
897*cd0c2139SMatthew G Knepley   PetscErrorCode  ierr;
898*cd0c2139SMatthew G Knepley 
899*cd0c2139SMatthew G Knepley   PetscFunctionBegin;
900*cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
901*cd0c2139SMatthew G Knepley   /* Cell orientation for face gives the side of the fault */
902*cd0c2139SMatthew G Knepley   ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr);
903*cd0c2139SMatthew G Knepley   if (!dimIS) PetscFunctionReturn(0);
904*cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
905*cd0c2139SMatthew G Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
906*cd0c2139SMatthew G Knepley   for (p = 0; p < numPoints; ++p) {
907*cd0c2139SMatthew G Knepley     const PetscInt *support;
908*cd0c2139SMatthew G Knepley     PetscInt        supportSize, s;
909*cd0c2139SMatthew G Knepley 
910*cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr);
911*cd0c2139SMatthew G Knepley     if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize);
912*cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr);
913*cd0c2139SMatthew G Knepley     for (s = 0; s < supportSize; ++s) {
914*cd0c2139SMatthew G Knepley       const PetscInt *cone, *ornt;
915*cd0c2139SMatthew G Knepley       PetscInt        coneSize, c;
916*cd0c2139SMatthew G Knepley       PetscBool       pos = PETSC_TRUE;
917*cd0c2139SMatthew G Knepley 
918*cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
919*cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
920*cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr);
921*cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
922*cd0c2139SMatthew G Knepley         if (cone[c] == points[p]) {
923*cd0c2139SMatthew G Knepley           if (ornt[c] >= 0) {
924*cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, support[s],   shift+dim);CHKERRQ(ierr);
925*cd0c2139SMatthew G Knepley           } else {
926*cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, support[s], -(shift+dim));CHKERRQ(ierr);
927*cd0c2139SMatthew G Knepley             pos  = PETSC_FALSE;
928*cd0c2139SMatthew G Knepley           }
929*cd0c2139SMatthew G Knepley           break;
930*cd0c2139SMatthew G Knepley         }
931*cd0c2139SMatthew G Knepley       }
932*cd0c2139SMatthew G Knepley       if (c == coneSize) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Cell split face %d support does not have it in the cone", points[p]);
933*cd0c2139SMatthew G Knepley       /* Put faces touching the fault in the label */
934*cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
935*cd0c2139SMatthew G Knepley         const PetscInt point = cone[c];
936*cd0c2139SMatthew G Knepley 
937*cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
938*cd0c2139SMatthew G Knepley         if (val == -1) {
939*cd0c2139SMatthew G Knepley           PetscInt *closure = NULL;
940*cd0c2139SMatthew G Knepley           PetscInt  closureSize, cl;
941*cd0c2139SMatthew G Knepley 
942*cd0c2139SMatthew G Knepley           ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
943*cd0c2139SMatthew G Knepley           for (cl = 0; cl < closureSize*2; cl += 2) {
944*cd0c2139SMatthew G Knepley             const PetscInt clp = closure[cl];
945*cd0c2139SMatthew G Knepley 
946*cd0c2139SMatthew G Knepley             ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr);
947*cd0c2139SMatthew G Knepley             if ((val >= 0) && (val < dim-1)) {
948*cd0c2139SMatthew G Knepley               ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr);
949*cd0c2139SMatthew G Knepley               break;
950*cd0c2139SMatthew G Knepley             }
951*cd0c2139SMatthew G Knepley           }
952*cd0c2139SMatthew G Knepley           ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
953*cd0c2139SMatthew G Knepley         }
954*cd0c2139SMatthew G Knepley       }
955*cd0c2139SMatthew G Knepley     }
956*cd0c2139SMatthew G Knepley   }
957*cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
958*cd0c2139SMatthew G Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
959*cd0c2139SMatthew G Knepley   /* Search for other cells/faces/edges connected to the fault by a vertex */
960*cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
961*cd0c2139SMatthew G Knepley   ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr);
962*cd0c2139SMatthew G Knepley   if (!dimIS) PetscFunctionReturn(0);
963*cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
964*cd0c2139SMatthew G Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
965*cd0c2139SMatthew G Knepley   for (p = 0; p < numPoints; ++p) {
966*cd0c2139SMatthew G Knepley     PetscInt *star = NULL;
967*cd0c2139SMatthew G Knepley     PetscInt  starSize, s;
968*cd0c2139SMatthew G Knepley     PetscInt  again = 1;  /* 0: Finished 1: Keep iterating after a change 2: No change */
969*cd0c2139SMatthew G Knepley 
970*cd0c2139SMatthew G Knepley     /* First mark cells connected to the fault */
971*cd0c2139SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
972*cd0c2139SMatthew G Knepley     while (again) {
973*cd0c2139SMatthew G Knepley       if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault");
974*cd0c2139SMatthew G Knepley       again = 0;
975*cd0c2139SMatthew G Knepley       for (s = 0; s < starSize*2; s += 2) {
976*cd0c2139SMatthew G Knepley         const PetscInt  point = star[s];
977*cd0c2139SMatthew G Knepley         const PetscInt *cone;
978*cd0c2139SMatthew G Knepley         PetscInt        coneSize, c;
979*cd0c2139SMatthew G Knepley 
980*cd0c2139SMatthew G Knepley         if ((point < cStart) || (point >= cEnd)) continue;
981*cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
982*cd0c2139SMatthew G Knepley         if (val != -1) continue;
983*cd0c2139SMatthew G Knepley         again = 2;
984*cd0c2139SMatthew G Knepley         ierr  = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
985*cd0c2139SMatthew G Knepley         ierr  = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
986*cd0c2139SMatthew G Knepley         for (c = 0; c < coneSize; ++c) {
987*cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr);
988*cd0c2139SMatthew G Knepley           if (val != -1) {
989*cd0c2139SMatthew G Knepley             if (abs(val) < shift) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d on cell %d has an invalid label %d", cone[c], point, val);
990*cd0c2139SMatthew G Knepley             if (val > 0) {
991*cd0c2139SMatthew G Knepley               ierr = DMLabelSetValue(label, point,   shift+dim);CHKERRQ(ierr);
992*cd0c2139SMatthew G Knepley             } else {
993*cd0c2139SMatthew G Knepley               ierr = DMLabelSetValue(label, point, -(shift+dim));CHKERRQ(ierr);
994*cd0c2139SMatthew G Knepley             }
995*cd0c2139SMatthew G Knepley             again = 1;
996*cd0c2139SMatthew G Knepley             break;
997*cd0c2139SMatthew G Knepley           }
998*cd0c2139SMatthew G Knepley         }
999*cd0c2139SMatthew G Knepley       }
1000*cd0c2139SMatthew G Knepley     }
1001*cd0c2139SMatthew G Knepley     /* Classify the rest by cell membership */
1002*cd0c2139SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1003*cd0c2139SMatthew G Knepley       const PetscInt point = star[s];
1004*cd0c2139SMatthew G Knepley 
1005*cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1006*cd0c2139SMatthew G Knepley       if (val == -1) {
1007*cd0c2139SMatthew G Knepley         PetscInt  *sstar = NULL;
1008*cd0c2139SMatthew G Knepley         PetscInt   sstarSize, ss;
1009*cd0c2139SMatthew G Knepley         PetscBool  marked = PETSC_FALSE;
1010*cd0c2139SMatthew G Knepley 
1011*cd0c2139SMatthew G Knepley         ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr);
1012*cd0c2139SMatthew G Knepley         for (ss = 0; ss < sstarSize*2; ss += 2) {
1013*cd0c2139SMatthew G Knepley           const PetscInt spoint = sstar[ss];
1014*cd0c2139SMatthew G Knepley 
1015*cd0c2139SMatthew G Knepley           if ((spoint < cStart) || (spoint >= cEnd)) continue;
1016*cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr);
1017*cd0c2139SMatthew 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);
1018*cd0c2139SMatthew G Knepley           ierr = DMPlexGetLabelValue(dm, "depth", point, &dep);CHKERRQ(ierr);
1019*cd0c2139SMatthew G Knepley           if (val > 0) {
1020*cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, point,   shift+dep);CHKERRQ(ierr);
1021*cd0c2139SMatthew G Knepley           } else {
1022*cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr);
1023*cd0c2139SMatthew G Knepley           }
1024*cd0c2139SMatthew G Knepley           marked = PETSC_TRUE;
1025*cd0c2139SMatthew G Knepley           break;
1026*cd0c2139SMatthew G Knepley         }
1027*cd0c2139SMatthew G Knepley         ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr);
1028*cd0c2139SMatthew G Knepley         if (!marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point);
1029*cd0c2139SMatthew G Knepley       }
1030*cd0c2139SMatthew G Knepley     }
1031*cd0c2139SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1032*cd0c2139SMatthew G Knepley   }
1033*cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
1034*cd0c2139SMatthew G Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
1035*cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1036*cd0c2139SMatthew G Knepley }
1037*cd0c2139SMatthew G Knepley 
1038*cd0c2139SMatthew G Knepley #undef __FUNCT__
1039efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated"
1040efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that:
1041efa14ee0SMatthew G Knepley 
1042efa14ee0SMatthew G Knepley      For any marked cell, the marked vertices constitute a single face
1043efa14ee0SMatthew G Knepley */
1044efa14ee0SMatthew G Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm)
1045efa14ee0SMatthew G Knepley {
1046efa14ee0SMatthew G Knepley   IS               subvertexIS;
1047efa14ee0SMatthew G Knepley   const PetscInt  *subvertices;
1048efa14ee0SMatthew G Knepley   PetscInt        *pStart, *pEnd, *pMax;
1049efa14ee0SMatthew G Knepley   PetscInt         depth, dim, d, numSubVerticesInitial = 0, v;
1050efa14ee0SMatthew G Knepley   PetscErrorCode   ierr;
1051efa14ee0SMatthew G Knepley 
1052efa14ee0SMatthew G Knepley   PetscFunctionBegin;
1053efa14ee0SMatthew G Knepley   *numFaces = 0;
1054efa14ee0SMatthew G Knepley   *nFV      = 0;
1055efa14ee0SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1056efa14ee0SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
1057efa14ee0SMatthew G Knepley   ierr = PetscMalloc3(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd,dim+1,PetscInt,&pMax);CHKERRQ(ierr);
10580298fd71SBarry Smith   ierr = DMPlexGetHybridBounds(dm, &pMax[depth], depth>1 ? &pMax[depth-1] : NULL, depth > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr);
1059efa14ee0SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
1060efa14ee0SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1061efa14ee0SMatthew G Knepley     if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]);
1062efa14ee0SMatthew G Knepley   }
1063efa14ee0SMatthew G Knepley   /* Loop over initial vertices and mark all faces in the collective star() */
1064efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(vertexLabel, 1, &subvertexIS);CHKERRQ(ierr);
1065efa14ee0SMatthew G Knepley   if (subvertexIS) {
1066efa14ee0SMatthew G Knepley     ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr);
1067efa14ee0SMatthew G Knepley     ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1068efa14ee0SMatthew G Knepley   }
1069efa14ee0SMatthew G Knepley   for (v = 0; v < numSubVerticesInitial; ++v) {
1070efa14ee0SMatthew G Knepley     const PetscInt vertex = subvertices[v];
10710298fd71SBarry Smith     PetscInt      *star   = NULL;
1072efa14ee0SMatthew G Knepley     PetscInt       starSize, s, numCells = 0, c;
1073efa14ee0SMatthew G Knepley 
1074efa14ee0SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1075efa14ee0SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1076efa14ee0SMatthew G Knepley       const PetscInt point = star[s];
1077efa14ee0SMatthew G Knepley       if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point;
1078efa14ee0SMatthew G Knepley     }
1079efa14ee0SMatthew G Knepley     for (c = 0; c < numCells; ++c) {
1080efa14ee0SMatthew G Knepley       const PetscInt cell    = star[c];
10810298fd71SBarry Smith       PetscInt      *closure = NULL;
1082efa14ee0SMatthew G Knepley       PetscInt       closureSize, cl;
1083efa14ee0SMatthew G Knepley       PetscInt       cellLoc, numCorners = 0, faceSize = 0;
1084efa14ee0SMatthew G Knepley 
1085efa14ee0SMatthew G Knepley       ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr);
108665560c7fSMatthew G Knepley       if (cellLoc == 2) continue;
108782f516ccSBarry Smith       if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc);
1088efa14ee0SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1089efa14ee0SMatthew G Knepley       for (cl = 0; cl < closureSize*2; cl += 2) {
1090efa14ee0SMatthew G Knepley         const PetscInt point = closure[cl];
1091efa14ee0SMatthew G Knepley         PetscInt       vertexLoc;
1092efa14ee0SMatthew G Knepley 
1093efa14ee0SMatthew G Knepley         if ((point >= pStart[0]) && (point < pEnd[0])) {
1094efa14ee0SMatthew G Knepley           ++numCorners;
1095efa14ee0SMatthew G Knepley           ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr);
1096efa14ee0SMatthew G Knepley           if (vertexLoc >= 0) closure[faceSize++] = point;
1097efa14ee0SMatthew G Knepley         }
1098efa14ee0SMatthew G Knepley       }
1099fb98ab4fSPeter Brune       if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices_Internal(dm, dim, numCorners, nFV);CHKERRQ(ierr);}
110082f516ccSBarry 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);
1101efa14ee0SMatthew G Knepley       if (faceSize == *nFV) {
1102efa14ee0SMatthew G Knepley         ++(*numFaces);
1103efa14ee0SMatthew G Knepley         for (cl = 0; cl < faceSize; ++cl) {
1104efa14ee0SMatthew G Knepley           ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr);
1105efa14ee0SMatthew G Knepley         }
1106efa14ee0SMatthew G Knepley         ierr = DMLabelSetValue(subpointMap, cell, 2);CHKERRQ(ierr);
1107efa14ee0SMatthew G Knepley       }
1108efa14ee0SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1109efa14ee0SMatthew G Knepley     }
1110efa14ee0SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1111efa14ee0SMatthew G Knepley   }
1112efa14ee0SMatthew G Knepley   if (subvertexIS) {
1113efa14ee0SMatthew G Knepley     ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1114efa14ee0SMatthew G Knepley   }
1115efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
1116efa14ee0SMatthew G Knepley   ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr);
1117efa14ee0SMatthew G Knepley   PetscFunctionReturn(0);
1118efa14ee0SMatthew G Knepley }
1119efa14ee0SMatthew G Knepley 
1120efa14ee0SMatthew G Knepley #undef __FUNCT__
1121efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated"
1122efa14ee0SMatthew G Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, DMLabel subpointMap, DM subdm)
1123efa14ee0SMatthew G Knepley {
1124efa14ee0SMatthew G Knepley   IS               subvertexIS;
1125efa14ee0SMatthew G Knepley   const PetscInt  *subvertices;
1126efa14ee0SMatthew G Knepley   PetscInt        *pStart, *pEnd, *pMax;
1127efa14ee0SMatthew G Knepley   PetscInt         dim, d, numSubVerticesInitial = 0, v;
1128efa14ee0SMatthew G Knepley   PetscErrorCode   ierr;
1129efa14ee0SMatthew G Knepley 
1130efa14ee0SMatthew G Knepley   PetscFunctionBegin;
1131efa14ee0SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
1132efa14ee0SMatthew G Knepley   ierr = PetscMalloc3(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd,dim+1,PetscInt,&pMax);CHKERRQ(ierr);
11330298fd71SBarry Smith   ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr);
1134efa14ee0SMatthew G Knepley   for (d = 0; d <= dim; ++d) {
1135efa14ee0SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1136efa14ee0SMatthew G Knepley     if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]);
1137efa14ee0SMatthew G Knepley   }
1138efa14ee0SMatthew G Knepley   /* Loop over initial vertices and mark all faces in the collective star() */
1139efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(vertexLabel, 1, &subvertexIS);CHKERRQ(ierr);
1140efa14ee0SMatthew G Knepley   if (subvertexIS) {
1141efa14ee0SMatthew G Knepley     ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr);
1142efa14ee0SMatthew G Knepley     ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1143efa14ee0SMatthew G Knepley   }
1144efa14ee0SMatthew G Knepley   for (v = 0; v < numSubVerticesInitial; ++v) {
1145efa14ee0SMatthew G Knepley     const PetscInt vertex = subvertices[v];
11460298fd71SBarry Smith     PetscInt      *star   = NULL;
1147efa14ee0SMatthew G Knepley     PetscInt       starSize, s, numFaces = 0, f;
1148efa14ee0SMatthew G Knepley 
1149efa14ee0SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1150efa14ee0SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1151efa14ee0SMatthew G Knepley       const PetscInt point = star[s];
1152efa14ee0SMatthew G Knepley       if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point;
1153efa14ee0SMatthew G Knepley     }
1154efa14ee0SMatthew G Knepley     for (f = 0; f < numFaces; ++f) {
1155efa14ee0SMatthew G Knepley       const PetscInt face    = star[f];
11560298fd71SBarry Smith       PetscInt      *closure = NULL;
1157efa14ee0SMatthew G Knepley       PetscInt       closureSize, c;
1158efa14ee0SMatthew G Knepley       PetscInt       faceLoc;
1159efa14ee0SMatthew G Knepley 
1160efa14ee0SMatthew G Knepley       ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr);
1161efa14ee0SMatthew G Knepley       if (faceLoc == dim-1) continue;
116282f516ccSBarry Smith       if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc);
1163efa14ee0SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1164efa14ee0SMatthew G Knepley       for (c = 0; c < closureSize*2; c += 2) {
1165efa14ee0SMatthew G Knepley         const PetscInt point = closure[c];
1166efa14ee0SMatthew G Knepley         PetscInt       vertexLoc;
1167efa14ee0SMatthew G Knepley 
1168efa14ee0SMatthew G Knepley         if ((point >= pStart[0]) && (point < pEnd[0])) {
1169efa14ee0SMatthew G Knepley           ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr);
1170efa14ee0SMatthew G Knepley           if (vertexLoc < 0) break;
1171efa14ee0SMatthew G Knepley         }
1172efa14ee0SMatthew G Knepley       }
1173efa14ee0SMatthew G Knepley       if (c == closureSize*2) {
1174efa14ee0SMatthew G Knepley         const PetscInt *support;
1175efa14ee0SMatthew G Knepley         PetscInt        supportSize, s;
1176efa14ee0SMatthew G Knepley 
1177efa14ee0SMatthew G Knepley         for (c = 0; c < closureSize*2; c += 2) {
1178efa14ee0SMatthew G Knepley           const PetscInt point = closure[c];
1179efa14ee0SMatthew G Knepley 
1180efa14ee0SMatthew G Knepley           for (d = 0; d < dim; ++d) {
1181efa14ee0SMatthew G Knepley             if ((point >= pStart[d]) && (point < pEnd[d])) {
1182efa14ee0SMatthew G Knepley               ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr);
1183efa14ee0SMatthew G Knepley               break;
1184efa14ee0SMatthew G Knepley             }
1185efa14ee0SMatthew G Knepley           }
1186efa14ee0SMatthew G Knepley         }
1187efa14ee0SMatthew G Knepley         ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr);
1188efa14ee0SMatthew G Knepley         ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr);
1189efa14ee0SMatthew G Knepley         for (s = 0; s < supportSize; ++s) {
1190efa14ee0SMatthew G Knepley           ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr);
1191efa14ee0SMatthew G Knepley         }
1192efa14ee0SMatthew G Knepley       }
1193efa14ee0SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1194efa14ee0SMatthew G Knepley     }
1195efa14ee0SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1196efa14ee0SMatthew G Knepley   }
1197efa14ee0SMatthew G Knepley   if (subvertexIS) {
1198efa14ee0SMatthew G Knepley     ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1199efa14ee0SMatthew G Knepley   }
1200efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
1201efa14ee0SMatthew G Knepley   ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr);
1202efa14ee0SMatthew G Knepley   PetscFunctionReturn(0);
1203efa14ee0SMatthew G Knepley }
1204efa14ee0SMatthew G Knepley 
1205efa14ee0SMatthew G Knepley #undef __FUNCT__
1206e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation"
1207e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented)
1208e6ccafaeSMatthew G Knepley {
120982f516ccSBarry Smith   MPI_Comm       comm;
1210e6ccafaeSMatthew G Knepley   PetscBool      posOrient = PETSC_FALSE;
1211e6ccafaeSMatthew G Knepley   const PetscInt debug     = 0;
1212e6ccafaeSMatthew G Knepley   PetscInt       cellDim, faceSize, f;
1213e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
1214e6ccafaeSMatthew G Knepley 
121582f516ccSBarry Smith   PetscFunctionBegin;
121682f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
1217e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDimension(dm, &cellDim);CHKERRQ(ierr);
1218e6ccafaeSMatthew G Knepley   if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);}
1219e6ccafaeSMatthew G Knepley 
1220e6ccafaeSMatthew G Knepley   if (cellDim == numCorners-1) {
1221e6ccafaeSMatthew G Knepley     /* Simplices */
1222e6ccafaeSMatthew G Knepley     faceSize  = numCorners-1;
1223e6ccafaeSMatthew G Knepley     posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
1224e6ccafaeSMatthew G Knepley   } else if (cellDim == 1 && numCorners == 3) {
1225e6ccafaeSMatthew G Knepley     /* Quadratic line */
1226e6ccafaeSMatthew G Knepley     faceSize  = 1;
1227e6ccafaeSMatthew G Knepley     posOrient = PETSC_TRUE;
1228e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 4) {
1229e6ccafaeSMatthew G Knepley     /* Quads */
1230e6ccafaeSMatthew G Knepley     faceSize = 2;
1231e6ccafaeSMatthew G Knepley     if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) {
1232e6ccafaeSMatthew G Knepley       posOrient = PETSC_TRUE;
1233e6ccafaeSMatthew G Knepley     } else if ((indices[0] == 3) && (indices[1] == 0)) {
1234e6ccafaeSMatthew G Knepley       posOrient = PETSC_TRUE;
1235e6ccafaeSMatthew G Knepley     } else {
1236e6ccafaeSMatthew G Knepley       if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) {
1237e6ccafaeSMatthew G Knepley         posOrient = PETSC_FALSE;
1238e6ccafaeSMatthew G Knepley       } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge");
1239e6ccafaeSMatthew G Knepley     }
1240e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 6) {
1241e6ccafaeSMatthew G Knepley     /* Quadratic triangle (I hate this) */
1242e6ccafaeSMatthew G Knepley     /* Edges are determined by the first 2 vertices (corners of edges) */
1243e6ccafaeSMatthew G Knepley     const PetscInt faceSizeTri = 3;
1244e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[3], i, iFace;
1245e6ccafaeSMatthew G Knepley     PetscBool      found                    = PETSC_FALSE;
1246e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTriSorted[9] = {
1247e6ccafaeSMatthew G Knepley       0, 3,  4, /* bottom */
1248e6ccafaeSMatthew G Knepley       1, 4,  5, /* right */
1249e6ccafaeSMatthew G Knepley       2, 3,  5, /* left */
1250e6ccafaeSMatthew G Knepley     };
1251e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTri[9] = {
1252e6ccafaeSMatthew G Knepley       0, 3,  4, /* bottom */
1253e6ccafaeSMatthew G Knepley       1, 4,  5, /* right */
1254e6ccafaeSMatthew G Knepley       2, 5,  3, /* left */
1255e6ccafaeSMatthew G Knepley     };
1256e6ccafaeSMatthew G Knepley 
1257e6ccafaeSMatthew G Knepley     faceSize = faceSizeTri;
1258e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i];
1259e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr);
1260e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 3; ++iFace) {
1261e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeTri;
1262e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
1263e6ccafaeSMatthew G Knepley 
1264e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) &&
1265e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesTriSorted[ii+1])) {
1266e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) {
1267e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) {
1268e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesTri[ii+fVertex]) {
1269e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
1270e6ccafaeSMatthew G Knepley               break;
1271e6ccafaeSMatthew G Knepley             }
1272e6ccafaeSMatthew G Knepley           }
1273e6ccafaeSMatthew G Knepley         }
1274e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
1275e6ccafaeSMatthew G Knepley         break;
1276e6ccafaeSMatthew G Knepley       }
1277e6ccafaeSMatthew G Knepley     }
1278e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface");
1279e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
1280e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
1281e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 9) {
1282e6ccafaeSMatthew G Knepley     /* Quadratic quad (I hate this) */
1283e6ccafaeSMatthew G Knepley     /* Edges are determined by the first 2 vertices (corners of edges) */
1284e6ccafaeSMatthew G Knepley     const PetscInt faceSizeQuad = 3;
1285e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[3], i, iFace;
1286e6ccafaeSMatthew G Knepley     PetscBool      found                      = PETSC_FALSE;
1287e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadSorted[12] = {
1288e6ccafaeSMatthew G Knepley       0, 1,  4, /* bottom */
1289e6ccafaeSMatthew G Knepley       1, 2,  5, /* right */
1290e6ccafaeSMatthew G Knepley       2, 3,  6, /* top */
1291e6ccafaeSMatthew G Knepley       0, 3,  7, /* left */
1292e6ccafaeSMatthew G Knepley     };
1293e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuad[12] = {
1294e6ccafaeSMatthew G Knepley       0, 1,  4, /* bottom */
1295e6ccafaeSMatthew G Knepley       1, 2,  5, /* right */
1296e6ccafaeSMatthew G Knepley       2, 3,  6, /* top */
1297e6ccafaeSMatthew G Knepley       3, 0,  7, /* left */
1298e6ccafaeSMatthew G Knepley     };
1299e6ccafaeSMatthew G Knepley 
1300e6ccafaeSMatthew G Knepley     faceSize = faceSizeQuad;
1301e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i];
1302e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr);
1303e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 4; ++iFace) {
1304e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeQuad;
1305e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
1306e6ccafaeSMatthew G Knepley 
1307e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) &&
1308e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) {
1309e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) {
1310e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) {
1311e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) {
1312e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
1313e6ccafaeSMatthew G Knepley               break;
1314e6ccafaeSMatthew G Knepley             }
1315e6ccafaeSMatthew G Knepley           }
1316e6ccafaeSMatthew G Knepley         }
1317e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
1318e6ccafaeSMatthew G Knepley         break;
1319e6ccafaeSMatthew G Knepley       }
1320e6ccafaeSMatthew G Knepley     }
1321e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface");
1322e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
1323e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
1324e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 8) {
1325e6ccafaeSMatthew G Knepley     /* Hexes
1326e6ccafaeSMatthew G Knepley        A hex is two oriented quads with the normal of the first
1327e6ccafaeSMatthew G Knepley        pointing up at the second.
1328e6ccafaeSMatthew G Knepley 
1329e6ccafaeSMatthew G Knepley           7---6
1330e6ccafaeSMatthew G Knepley          /|  /|
1331e6ccafaeSMatthew G Knepley         4---5 |
1332e6ccafaeSMatthew G Knepley         | 3-|-2
1333e6ccafaeSMatthew G Knepley         |/  |/
1334e6ccafaeSMatthew G Knepley         0---1
1335e6ccafaeSMatthew G Knepley 
1336e6ccafaeSMatthew G Knepley         Faces are determined by the first 4 vertices (corners of faces) */
1337e6ccafaeSMatthew G Knepley     const PetscInt faceSizeHex = 4;
1338e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[4], i, iFace;
1339e6ccafaeSMatthew G Knepley     PetscBool      found                     = PETSC_FALSE;
1340e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesHexSorted[24] = {
1341e6ccafaeSMatthew G Knepley       0, 1, 2, 3,  /* bottom */
1342e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  /* top */
1343e6ccafaeSMatthew G Knepley       0, 1, 4, 5,  /* front */
1344e6ccafaeSMatthew G Knepley       1, 2, 5, 6,  /* right */
1345e6ccafaeSMatthew G Knepley       2, 3, 6, 7,  /* back */
1346e6ccafaeSMatthew G Knepley       0, 3, 4, 7,  /* left */
1347e6ccafaeSMatthew G Knepley     };
1348e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesHex[24] = {
1349e6ccafaeSMatthew G Knepley       3, 2, 1, 0,  /* bottom */
1350e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  /* top */
1351e6ccafaeSMatthew G Knepley       0, 1, 5, 4,  /* front */
1352e6ccafaeSMatthew G Knepley       1, 2, 6, 5,  /* right */
1353e6ccafaeSMatthew G Knepley       2, 3, 7, 6,  /* back */
1354e6ccafaeSMatthew G Knepley       3, 0, 4, 7,  /* left */
1355e6ccafaeSMatthew G Knepley     };
1356e6ccafaeSMatthew G Knepley 
1357e6ccafaeSMatthew G Knepley     faceSize = faceSizeHex;
1358e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i];
1359e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr);
1360e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 6; ++iFace) {
1361e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeHex;
1362e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
1363e6ccafaeSMatthew G Knepley 
1364e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) &&
1365e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesHexSorted[ii+1]) &&
1366e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesHexSorted[ii+2]) &&
1367e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesHexSorted[ii+3])) {
1368e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) {
1369e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) {
1370e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesHex[ii+fVertex]) {
1371e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
1372e6ccafaeSMatthew G Knepley               break;
1373e6ccafaeSMatthew G Knepley             }
1374e6ccafaeSMatthew G Knepley           }
1375e6ccafaeSMatthew G Knepley         }
1376e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
1377e6ccafaeSMatthew G Knepley         break;
1378e6ccafaeSMatthew G Knepley       }
1379e6ccafaeSMatthew G Knepley     }
1380e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface");
1381e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
1382e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
1383e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 10) {
1384e6ccafaeSMatthew G Knepley     /* Quadratic tet */
1385e6ccafaeSMatthew G Knepley     /* Faces are determined by the first 3 vertices (corners of faces) */
1386e6ccafaeSMatthew G Knepley     const PetscInt faceSizeTet = 6;
1387e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[6], i, iFace;
1388e6ccafaeSMatthew G Knepley     PetscBool      found                     = PETSC_FALSE;
1389e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTetSorted[24] = {
1390e6ccafaeSMatthew G Knepley       0, 1, 2,  6, 7, 8, /* bottom */
1391e6ccafaeSMatthew G Knepley       0, 3, 4,  6, 7, 9,  /* front */
1392e6ccafaeSMatthew G Knepley       1, 4, 5,  7, 8, 9,  /* right */
1393e6ccafaeSMatthew G Knepley       2, 3, 5,  6, 8, 9,  /* left */
1394e6ccafaeSMatthew G Knepley     };
1395e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTet[24] = {
1396e6ccafaeSMatthew G Knepley       0, 1, 2,  6, 7, 8, /* bottom */
1397e6ccafaeSMatthew G Knepley       0, 4, 3,  6, 7, 9,  /* front */
1398e6ccafaeSMatthew G Knepley       1, 5, 4,  7, 8, 9,  /* right */
1399e6ccafaeSMatthew G Knepley       2, 3, 5,  8, 6, 9,  /* left */
1400e6ccafaeSMatthew G Knepley     };
1401e6ccafaeSMatthew G Knepley 
1402e6ccafaeSMatthew G Knepley     faceSize = faceSizeTet;
1403e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i];
1404e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr);
1405e6ccafaeSMatthew G Knepley     for (iFace=0; iFace < 4; ++iFace) {
1406e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeTet;
1407e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
1408e6ccafaeSMatthew G Knepley 
1409e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) &&
1410e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesTetSorted[ii+1]) &&
1411e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesTetSorted[ii+2]) &&
1412e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesTetSorted[ii+3])) {
1413e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) {
1414e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) {
1415e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesTet[ii+fVertex]) {
1416e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
1417e6ccafaeSMatthew G Knepley               break;
1418e6ccafaeSMatthew G Knepley             }
1419e6ccafaeSMatthew G Knepley           }
1420e6ccafaeSMatthew G Knepley         }
1421e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
1422e6ccafaeSMatthew G Knepley         break;
1423e6ccafaeSMatthew G Knepley       }
1424e6ccafaeSMatthew G Knepley     }
1425e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface");
1426e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
1427e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
1428e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 27) {
1429e6ccafaeSMatthew G Knepley     /* Quadratic hexes (I hate this)
1430e6ccafaeSMatthew G Knepley        A hex is two oriented quads with the normal of the first
1431e6ccafaeSMatthew G Knepley        pointing up at the second.
1432e6ccafaeSMatthew G Knepley 
1433e6ccafaeSMatthew G Knepley          7---6
1434e6ccafaeSMatthew G Knepley         /|  /|
1435e6ccafaeSMatthew G Knepley        4---5 |
1436e6ccafaeSMatthew G Knepley        | 3-|-2
1437e6ccafaeSMatthew G Knepley        |/  |/
1438e6ccafaeSMatthew G Knepley        0---1
1439e6ccafaeSMatthew G Knepley 
1440e6ccafaeSMatthew G Knepley        Faces are determined by the first 4 vertices (corners of faces) */
1441e6ccafaeSMatthew G Knepley     const PetscInt faceSizeQuadHex = 9;
1442e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[9], i, iFace;
1443e6ccafaeSMatthew G Knepley     PetscBool      found                         = PETSC_FALSE;
1444e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadHexSorted[54] = {
1445e6ccafaeSMatthew G Knepley       0, 1, 2, 3,  8, 9, 10, 11,  24, /* bottom */
1446e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  12, 13, 14, 15,  25, /* top */
1447e6ccafaeSMatthew G Knepley       0, 1, 4, 5,  8, 12, 16, 17,  22, /* front */
1448e6ccafaeSMatthew G Knepley       1, 2, 5, 6,  9, 13, 17, 18,  21, /* right */
1449e6ccafaeSMatthew G Knepley       2, 3, 6, 7,  10, 14, 18, 19,  23, /* back */
1450e6ccafaeSMatthew G Knepley       0, 3, 4, 7,  11, 15, 16, 19,  20, /* left */
1451e6ccafaeSMatthew G Knepley     };
1452e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadHex[54] = {
1453e6ccafaeSMatthew G Knepley       3, 2, 1, 0,  10, 9, 8, 11,  24, /* bottom */
1454e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  12, 13, 14, 15,  25, /* top */
1455e6ccafaeSMatthew G Knepley       0, 1, 5, 4,  8, 17, 12, 16,  22, /* front */
1456e6ccafaeSMatthew G Knepley       1, 2, 6, 5,  9, 18, 13, 17,  21, /* right */
1457e6ccafaeSMatthew G Knepley       2, 3, 7, 6,  10, 19, 14, 18,  23, /* back */
1458e6ccafaeSMatthew G Knepley       3, 0, 4, 7,  11, 16, 15, 19,  20 /* left */
1459e6ccafaeSMatthew G Knepley     };
1460e6ccafaeSMatthew G Knepley 
1461e6ccafaeSMatthew G Knepley     faceSize = faceSizeQuadHex;
1462e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i];
1463e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr);
1464e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 6; ++iFace) {
1465e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeQuadHex;
1466e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
1467e6ccafaeSMatthew G Knepley 
1468e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) &&
1469e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) &&
1470e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) &&
1471e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) {
1472e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) {
1473e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) {
1474e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) {
1475e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
1476e6ccafaeSMatthew G Knepley               break;
1477e6ccafaeSMatthew G Knepley             }
1478e6ccafaeSMatthew G Knepley           }
1479e6ccafaeSMatthew G Knepley         }
1480e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
1481e6ccafaeSMatthew G Knepley         break;
1482e6ccafaeSMatthew G Knepley       }
1483e6ccafaeSMatthew G Knepley     }
1484e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface");
1485e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
1486e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
1487e6ccafaeSMatthew G Knepley   } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation().");
1488e6ccafaeSMatthew G Knepley   if (!posOrient) {
1489e6ccafaeSMatthew G Knepley     if (debug) {ierr = PetscPrintf(comm, "  Reversing initial face orientation\n");CHKERRQ(ierr);}
1490e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f];
1491e6ccafaeSMatthew G Knepley   } else {
1492e6ccafaeSMatthew G Knepley     if (debug) {ierr = PetscPrintf(comm, "  Keeping initial face orientation\n");CHKERRQ(ierr);}
1493e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f];
1494e6ccafaeSMatthew G Knepley   }
1495e6ccafaeSMatthew G Knepley   if (posOriented) *posOriented = posOrient;
1496e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
1497e6ccafaeSMatthew G Knepley }
1498e6ccafaeSMatthew G Knepley 
1499e6ccafaeSMatthew G Knepley #undef __FUNCT__
1500e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace"
1501e6ccafaeSMatthew G Knepley /*
1502e6ccafaeSMatthew G Knepley     Given a cell and a face, as a set of vertices,
1503e6ccafaeSMatthew G Knepley       return the oriented face, as a set of vertices, in faceVertices
1504e6ccafaeSMatthew G Knepley     The orientation is such that the face normal points out of the cell
1505e6ccafaeSMatthew G Knepley */
1506e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented)
1507e6ccafaeSMatthew G Knepley {
15080298fd71SBarry Smith   const PetscInt *cone = NULL;
1509e6ccafaeSMatthew G Knepley   PetscInt        coneSize, v, f, v2;
1510e6ccafaeSMatthew G Knepley   PetscInt        oppositeVertex = -1;
1511e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
1512e6ccafaeSMatthew G Knepley 
1513e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
1514e6ccafaeSMatthew G Knepley   ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr);
1515e6ccafaeSMatthew G Knepley   ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
1516e6ccafaeSMatthew G Knepley   for (v = 0, v2 = 0; v < coneSize; ++v) {
1517e6ccafaeSMatthew G Knepley     PetscBool found = PETSC_FALSE;
1518e6ccafaeSMatthew G Knepley 
1519e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) {
1520e6ccafaeSMatthew G Knepley       if (face[f] == cone[v]) {
1521e6ccafaeSMatthew G Knepley         found = PETSC_TRUE; break;
1522e6ccafaeSMatthew G Knepley       }
1523e6ccafaeSMatthew G Knepley     }
1524e6ccafaeSMatthew G Knepley     if (found) {
1525e6ccafaeSMatthew G Knepley       indices[v2]      = v;
1526e6ccafaeSMatthew G Knepley       origVertices[v2] = cone[v];
1527e6ccafaeSMatthew G Knepley       ++v2;
1528e6ccafaeSMatthew G Knepley     } else {
1529e6ccafaeSMatthew G Knepley       oppositeVertex = v;
1530e6ccafaeSMatthew G Knepley     }
1531e6ccafaeSMatthew G Knepley   }
1532e6ccafaeSMatthew G Knepley   ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr);
1533e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
1534e6ccafaeSMatthew G Knepley }
1535e6ccafaeSMatthew G Knepley 
1536e6ccafaeSMatthew G Knepley #undef __FUNCT__
1537*cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal"
1538e6ccafaeSMatthew G Knepley /*
1539*cd0c2139SMatthew G Knepley   DMPlexInsertFace_Internal - Puts a face into the mesh
1540e6ccafaeSMatthew G Knepley 
1541e6ccafaeSMatthew G Knepley   Not collective
1542e6ccafaeSMatthew G Knepley 
1543e6ccafaeSMatthew G Knepley   Input Parameters:
1544e6ccafaeSMatthew G Knepley   + dm              - The DMPlex
1545e6ccafaeSMatthew G Knepley   . numFaceVertex   - The number of vertices in the face
1546e6ccafaeSMatthew G Knepley   . faceVertices    - The vertices in the face for dm
1547e6ccafaeSMatthew G Knepley   . subfaceVertices - The vertices in the face for subdm
1548e6ccafaeSMatthew G Knepley   . numCorners      - The number of vertices in the cell
1549e6ccafaeSMatthew G Knepley   . cell            - A cell in dm containing the face
1550e6ccafaeSMatthew G Knepley   . subcell         - A cell in subdm containing the face
1551e6ccafaeSMatthew G Knepley   . firstFace       - First face in the mesh
1552e6ccafaeSMatthew G Knepley   - newFacePoint    - Next face in the mesh
1553e6ccafaeSMatthew G Knepley 
1554e6ccafaeSMatthew G Knepley   Output Parameters:
1555e6ccafaeSMatthew G Knepley   . newFacePoint - Contains next face point number on input, updated on output
1556e6ccafaeSMatthew G Knepley 
1557e6ccafaeSMatthew G Knepley   Level: developer
1558e6ccafaeSMatthew G Knepley */
1559*cd0c2139SMatthew 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)
1560e6ccafaeSMatthew G Knepley {
156182f516ccSBarry Smith   MPI_Comm        comm;
1562e6ccafaeSMatthew G Knepley   DM_Plex        *submesh = (DM_Plex*) subdm->data;
1563e6ccafaeSMatthew G Knepley   const PetscInt *faces;
1564e6ccafaeSMatthew G Knepley   PetscInt        numFaces, coneSize;
1565e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
1566e6ccafaeSMatthew G Knepley 
1567e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
156882f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
1569e6ccafaeSMatthew G Knepley   ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr);
1570e6ccafaeSMatthew G Knepley   if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize);
1571e6ccafaeSMatthew G Knepley #if 0
1572e6ccafaeSMatthew G Knepley   /* Cannot use this because support() has not been constructed yet */
1573e6ccafaeSMatthew G Knepley   ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr);
1574e6ccafaeSMatthew G Knepley #else
1575e6ccafaeSMatthew G Knepley   {
1576e6ccafaeSMatthew G Knepley     PetscInt f;
1577e6ccafaeSMatthew G Knepley 
1578e6ccafaeSMatthew G Knepley     numFaces = 0;
1579e6ccafaeSMatthew G Knepley     ierr     = DMGetWorkArray(subdm, 1, PETSC_INT, (void**) &faces);CHKERRQ(ierr);
1580e6ccafaeSMatthew G Knepley     for (f = firstFace; f < *newFacePoint; ++f) {
1581e6ccafaeSMatthew G Knepley       PetscInt dof, off, d;
1582e6ccafaeSMatthew G Knepley 
1583e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr);
1584e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr);
1585e6ccafaeSMatthew G Knepley       /* Yes, I know this is quadratic, but I expect the sizes to be <5 */
1586e6ccafaeSMatthew G Knepley       for (d = 0; d < dof; ++d) {
1587e6ccafaeSMatthew G Knepley         const PetscInt p = submesh->cones[off+d];
1588e6ccafaeSMatthew G Knepley         PetscInt       v;
1589e6ccafaeSMatthew G Knepley 
1590e6ccafaeSMatthew G Knepley         for (v = 0; v < numFaceVertices; ++v) {
1591e6ccafaeSMatthew G Knepley           if (subfaceVertices[v] == p) break;
1592e6ccafaeSMatthew G Knepley         }
1593e6ccafaeSMatthew G Knepley         if (v == numFaceVertices) break;
1594e6ccafaeSMatthew G Knepley       }
1595e6ccafaeSMatthew G Knepley       if (d == dof) {
1596e6ccafaeSMatthew G Knepley         numFaces               = 1;
1597e6ccafaeSMatthew G Knepley         ((PetscInt*) faces)[0] = f;
1598e6ccafaeSMatthew G Knepley       }
1599e6ccafaeSMatthew G Knepley     }
1600e6ccafaeSMatthew G Knepley   }
1601e6ccafaeSMatthew G Knepley #endif
1602e6ccafaeSMatthew G Knepley   if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces);
1603e6ccafaeSMatthew G Knepley   else if (numFaces == 1) {
1604e6ccafaeSMatthew G Knepley     /* Add the other cell neighbor for this face */
1605e6ccafaeSMatthew G Knepley     ierr = DMPlexSetCone(subdm, cell, faces);CHKERRQ(ierr);
1606e6ccafaeSMatthew G Knepley   } else {
1607e6ccafaeSMatthew G Knepley     PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov;
1608e6ccafaeSMatthew G Knepley     PetscBool posOriented;
1609e6ccafaeSMatthew G Knepley 
1610e6ccafaeSMatthew G Knepley     ierr                = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr);
1611e6ccafaeSMatthew G Knepley     origVertices        = &orientedVertices[numFaceVertices];
1612e6ccafaeSMatthew G Knepley     indices             = &orientedVertices[numFaceVertices*2];
1613e6ccafaeSMatthew G Knepley     orientedSubVertices = &orientedVertices[numFaceVertices*3];
1614e6ccafaeSMatthew G Knepley     ierr                = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr);
1615e6ccafaeSMatthew G Knepley     /* TODO: I know that routine should return a permutation, not the indices */
1616e6ccafaeSMatthew G Knepley     for (v = 0; v < numFaceVertices; ++v) {
1617e6ccafaeSMatthew G Knepley       const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v];
1618e6ccafaeSMatthew G Knepley       for (ov = 0; ov < numFaceVertices; ++ov) {
1619e6ccafaeSMatthew G Knepley         if (orientedVertices[ov] == vertex) {
1620e6ccafaeSMatthew G Knepley           orientedSubVertices[ov] = subvertex;
1621e6ccafaeSMatthew G Knepley           break;
1622e6ccafaeSMatthew G Knepley         }
1623e6ccafaeSMatthew G Knepley       }
1624e6ccafaeSMatthew G Knepley       if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex);
1625e6ccafaeSMatthew G Knepley     }
1626e6ccafaeSMatthew G Knepley     ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr);
1627e6ccafaeSMatthew G Knepley     ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr);
1628e6ccafaeSMatthew G Knepley     ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr);
1629e6ccafaeSMatthew G Knepley     ++(*newFacePoint);
1630e6ccafaeSMatthew G Knepley   }
1631e6ccafaeSMatthew G Knepley   ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr);
1632e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
1633e6ccafaeSMatthew G Knepley }
1634e6ccafaeSMatthew G Knepley 
1635e6ccafaeSMatthew G Knepley #undef __FUNCT__
1636e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated"
1637efa14ee0SMatthew G Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, const char vertexLabelName[], DM subdm)
1638e6ccafaeSMatthew G Knepley {
163982f516ccSBarry Smith   MPI_Comm        comm;
1640efa14ee0SMatthew G Knepley   DMLabel         vertexLabel, subpointMap;
1641efa14ee0SMatthew G Knepley   IS              subvertexIS,  subcellIS;
1642efa14ee0SMatthew G Knepley   const PetscInt *subVertices, *subCells;
1643efa14ee0SMatthew G Knepley   PetscInt        numSubVertices, firstSubVertex, numSubCells;
1644efa14ee0SMatthew G Knepley   PetscInt       *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV;
1645efa14ee0SMatthew G Knepley   PetscInt        vStart, vEnd, c, f;
1646e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
1647e6ccafaeSMatthew G Knepley 
1648e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
164982f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
1650efa14ee0SMatthew G Knepley   /* Create subpointMap which marks the submesh */
1651efa14ee0SMatthew G Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
1652efa14ee0SMatthew G Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
1653efa14ee0SMatthew G Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
1654efa14ee0SMatthew G Knepley   ierr = DMPlexGetLabel(dm, vertexLabelName, &vertexLabel);CHKERRQ(ierr);
1655efa14ee0SMatthew G Knepley   ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);
1656efa14ee0SMatthew G Knepley   /* Setup chart */
1657efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr);
1658efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr);
1659efa14ee0SMatthew G Knepley   ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr);
1660efa14ee0SMatthew G Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
1661e6ccafaeSMatthew G Knepley   /* Set cone sizes */
1662e6ccafaeSMatthew G Knepley   firstSubVertex = numSubCells;
1663efa14ee0SMatthew G Knepley   firstSubFace   = numSubCells+numSubVertices;
1664e6ccafaeSMatthew G Knepley   newFacePoint   = firstSubFace;
1665efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr);
1666efa14ee0SMatthew G Knepley   if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
1667efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr);
1668efa14ee0SMatthew G Knepley   if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);}
1669e6ccafaeSMatthew G Knepley   for (c = 0; c < numSubCells; ++c) {
1670e6ccafaeSMatthew G Knepley     ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr);
1671e6ccafaeSMatthew G Knepley   }
1672e6ccafaeSMatthew G Knepley   for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) {
1673e6ccafaeSMatthew G Knepley     ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr);
1674e6ccafaeSMatthew G Knepley   }
1675e6ccafaeSMatthew G Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
1676e6ccafaeSMatthew G Knepley   /* Create face cones */
1677efa14ee0SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
16780298fd71SBarry Smith   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
1679efa14ee0SMatthew G Knepley   ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
1680e6ccafaeSMatthew G Knepley   for (c = 0; c < numSubCells; ++c) {
1681e6ccafaeSMatthew G Knepley     const PetscInt cell    = subCells[c];
1682efa14ee0SMatthew G Knepley     const PetscInt subcell = c;
16830298fd71SBarry Smith     PetscInt      *closure = NULL;
1684efa14ee0SMatthew G Knepley     PetscInt       closureSize, cl, numCorners = 0, faceSize = 0;
1685e6ccafaeSMatthew G Knepley 
1686e6ccafaeSMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1687efa14ee0SMatthew G Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
1688efa14ee0SMatthew G Knepley       const PetscInt point = closure[cl];
1689e6ccafaeSMatthew G Knepley       PetscInt       subVertex;
1690e6ccafaeSMatthew G Knepley 
1691efa14ee0SMatthew G Knepley       if ((point >= vStart) && (point < vEnd)) {
1692efa14ee0SMatthew G Knepley         ++numCorners;
1693efa14ee0SMatthew G Knepley         ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr);
1694efa14ee0SMatthew G Knepley         if (subVertex >= 0) {
1695efa14ee0SMatthew G Knepley           closure[faceSize] = point;
169665560c7fSMatthew G Knepley           subface[faceSize] = firstSubVertex+subVertex;
1697e6ccafaeSMatthew G Knepley           ++faceSize;
1698e6ccafaeSMatthew G Knepley         }
1699e6ccafaeSMatthew G Knepley       }
1700e6ccafaeSMatthew G Knepley     }
1701efa14ee0SMatthew G Knepley     if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize);
1702efa14ee0SMatthew G Knepley     if (faceSize == nFV) {
1703*cd0c2139SMatthew G Knepley       ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr);
1704e6ccafaeSMatthew G Knepley     }
170565560c7fSMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1706e6ccafaeSMatthew G Knepley   }
1707efa14ee0SMatthew G Knepley   ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
1708e6ccafaeSMatthew G Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
1709e6ccafaeSMatthew G Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
1710e6ccafaeSMatthew G Knepley   /* Build coordinates */
1711efa14ee0SMatthew G Knepley   {
1712efa14ee0SMatthew G Knepley     PetscSection coordSection, subCoordSection;
1713efa14ee0SMatthew G Knepley     Vec          coordinates, subCoordinates;
1714efa14ee0SMatthew G Knepley     PetscScalar *coords, *subCoords;
1715efa14ee0SMatthew G Knepley     PetscInt     coordSize, v;
1716efa14ee0SMatthew G Knepley 
1717e6ccafaeSMatthew G Knepley     ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
1718e6ccafaeSMatthew G Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
1719e6ccafaeSMatthew G Knepley     ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
1720efa14ee0SMatthew G Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr);
1721efa14ee0SMatthew G Knepley     for (v = 0; v < numSubVertices; ++v) {
1722efa14ee0SMatthew G Knepley       const PetscInt vertex    = subVertices[v];
1723efa14ee0SMatthew G Knepley       const PetscInt subvertex = firstSubVertex+v;
1724efa14ee0SMatthew G Knepley       PetscInt       dof;
1725efa14ee0SMatthew G Knepley 
1726efa14ee0SMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
1727efa14ee0SMatthew G Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
1728e6ccafaeSMatthew G Knepley     }
1729e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
1730e6ccafaeSMatthew G Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
1731e6ccafaeSMatthew G Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
1732e6ccafaeSMatthew G Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
1733e6ccafaeSMatthew G Knepley     ierr = VecSetFromOptions(subCoordinates);CHKERRQ(ierr);
1734e6ccafaeSMatthew G Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
1735e6ccafaeSMatthew G Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
1736efa14ee0SMatthew G Knepley     for (v = 0; v < numSubVertices; ++v) {
1737efa14ee0SMatthew G Knepley       const PetscInt vertex    = subVertices[v];
1738efa14ee0SMatthew G Knepley       const PetscInt subvertex = firstSubVertex+v;
1739efa14ee0SMatthew G Knepley       PetscInt       dof, off, sdof, soff, d;
1740e6ccafaeSMatthew G Knepley 
1741e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
1742e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
1743efa14ee0SMatthew G Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
1744efa14ee0SMatthew G Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
1745efa14ee0SMatthew 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);
1746e6ccafaeSMatthew G Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
1747e6ccafaeSMatthew G Knepley     }
1748e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
1749e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
1750e6ccafaeSMatthew G Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
1751e6ccafaeSMatthew G Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
1752e6ccafaeSMatthew G Knepley   }
1753efa14ee0SMatthew G Knepley   /* Cleanup */
1754efa14ee0SMatthew G Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
1755efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
1756efa14ee0SMatthew G Knepley   if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);}
1757efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subcellIS);CHKERRQ(ierr);
1758e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
1759e6ccafaeSMatthew G Knepley }
1760e6ccafaeSMatthew G Knepley 
1761e6ccafaeSMatthew G Knepley #undef __FUNCT__
1762e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated"
1763e6ccafaeSMatthew G Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, const char vertexLabelName[], DM subdm)
1764e6ccafaeSMatthew G Knepley {
176582f516ccSBarry Smith   MPI_Comm         comm;
1766e6ccafaeSMatthew G Knepley   DMLabel          subpointMap, vertexLabel;
1767efa14ee0SMatthew G Knepley   IS              *subpointIS;
1768efa14ee0SMatthew G Knepley   const PetscInt **subpoints;
1769efa14ee0SMatthew G Knepley   PetscInt        *numSubPoints, *firstSubPoint, *coneNew;
1770efa14ee0SMatthew G Knepley   PetscInt         totSubPoints = 0, maxConeSize, dim, p, d, v;
1771e6ccafaeSMatthew G Knepley   PetscErrorCode   ierr;
1772e6ccafaeSMatthew G Knepley 
1773e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
177482f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
1775efa14ee0SMatthew G Knepley   /* Create subpointMap which marks the submesh */
1776e6ccafaeSMatthew G Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
1777efa14ee0SMatthew G Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
1778efa14ee0SMatthew G Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
1779e6ccafaeSMatthew G Knepley   ierr = DMPlexGetLabel(dm, vertexLabelName, &vertexLabel);CHKERRQ(ierr);
1780efa14ee0SMatthew G Knepley   ierr = DMPlexMarkSubmesh_Interpolated(dm, vertexLabel, subpointMap, subdm);CHKERRQ(ierr);
1781efa14ee0SMatthew G Knepley   /* Setup chart */
1782efa14ee0SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
1783efa14ee0SMatthew G Knepley   ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr);
1784e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
1785e6ccafaeSMatthew G Knepley     ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr);
1786e6ccafaeSMatthew G Knepley     totSubPoints += numSubPoints[d];
1787e6ccafaeSMatthew G Knepley   }
1788e6ccafaeSMatthew G Knepley   ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr);
1789e6ccafaeSMatthew G Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
1790e6ccafaeSMatthew G Knepley   /* Set cone sizes */
1791e6ccafaeSMatthew G Knepley   firstSubPoint[dim] = 0;
1792e6ccafaeSMatthew G Knepley   firstSubPoint[0]   = firstSubPoint[dim] + numSubPoints[dim];
1793e6ccafaeSMatthew G Knepley   if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0]     + numSubPoints[0];}
1794e6ccafaeSMatthew G Knepley   if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];}
1795e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
1796e6ccafaeSMatthew G Knepley     ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr);
1797e6ccafaeSMatthew G Knepley     ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);
1798e6ccafaeSMatthew G Knepley   }
1799e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
1800e6ccafaeSMatthew G Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
1801e6ccafaeSMatthew G Knepley       const PetscInt  point    = subpoints[d][p];
1802e6ccafaeSMatthew G Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
1803e6ccafaeSMatthew G Knepley       const PetscInt *cone;
1804e6ccafaeSMatthew G Knepley       PetscInt        coneSize, coneSizeNew, c, val;
1805e6ccafaeSMatthew G Knepley 
1806e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
1807e6ccafaeSMatthew G Knepley       ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr);
1808e6ccafaeSMatthew G Knepley       if (d == dim) {
1809e6ccafaeSMatthew G Knepley         ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
1810e6ccafaeSMatthew G Knepley         for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
1811e6ccafaeSMatthew G Knepley           ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr);
1812e6ccafaeSMatthew G Knepley           if (val >= 0) coneSizeNew++;
1813e6ccafaeSMatthew G Knepley         }
1814e6ccafaeSMatthew G Knepley         ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr);
1815e6ccafaeSMatthew G Knepley       }
1816e6ccafaeSMatthew G Knepley     }
1817e6ccafaeSMatthew G Knepley   }
1818e6ccafaeSMatthew G Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
1819e6ccafaeSMatthew G Knepley   /* Set cones */
18200298fd71SBarry Smith   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
1821e6ccafaeSMatthew G Knepley   ierr = PetscMalloc(maxConeSize * sizeof(PetscInt), &coneNew);CHKERRQ(ierr);
1822e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
1823e6ccafaeSMatthew G Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
1824e6ccafaeSMatthew G Knepley       const PetscInt  point    = subpoints[d][p];
1825e6ccafaeSMatthew G Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
1826e6ccafaeSMatthew G Knepley       const PetscInt *cone;
1827e6ccafaeSMatthew G Knepley       PetscInt        coneSize, subconeSize, coneSizeNew, c, subc;
1828e6ccafaeSMatthew G Knepley 
1829e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
1830e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
1831e6ccafaeSMatthew G Knepley       ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
1832e6ccafaeSMatthew G Knepley       for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
1833e6ccafaeSMatthew G Knepley         ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr);
1834e6ccafaeSMatthew G Knepley         if (subc >= 0) coneNew[coneSizeNew++] = firstSubPoint[d-1] + subc;
1835e6ccafaeSMatthew G Knepley       }
1836e6ccafaeSMatthew G Knepley       if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize);
1837e6ccafaeSMatthew G Knepley       ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr);
1838e6ccafaeSMatthew G Knepley     }
1839e6ccafaeSMatthew G Knepley   }
1840e6ccafaeSMatthew G Knepley   ierr = PetscFree(coneNew);CHKERRQ(ierr);
1841e6ccafaeSMatthew G Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
1842e6ccafaeSMatthew G Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
1843e6ccafaeSMatthew G Knepley   /* Build coordinates */
1844e6ccafaeSMatthew G Knepley   {
1845e6ccafaeSMatthew G Knepley     PetscSection coordSection, subCoordSection;
1846e6ccafaeSMatthew G Knepley     Vec          coordinates, subCoordinates;
1847e6ccafaeSMatthew G Knepley     PetscScalar *coords, *subCoords;
1848e6ccafaeSMatthew G Knepley     PetscInt     coordSize;
1849e6ccafaeSMatthew G Knepley 
1850e6ccafaeSMatthew G Knepley     ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
1851e6ccafaeSMatthew G Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
1852e6ccafaeSMatthew G Knepley     ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
1853e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr);
1854e6ccafaeSMatthew G Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
1855e6ccafaeSMatthew G Knepley       const PetscInt vertex    = subpoints[0][v];
1856e6ccafaeSMatthew G Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
1857e6ccafaeSMatthew G Knepley       PetscInt       dof;
1858e6ccafaeSMatthew G Knepley 
1859e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
1860e6ccafaeSMatthew G Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
1861e6ccafaeSMatthew G Knepley     }
1862e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
1863e6ccafaeSMatthew G Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
1864e6ccafaeSMatthew G Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
1865e6ccafaeSMatthew G Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
1866e6ccafaeSMatthew G Knepley     ierr = VecSetFromOptions(subCoordinates);CHKERRQ(ierr);
1867e6ccafaeSMatthew G Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
1868e6ccafaeSMatthew G Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
1869e6ccafaeSMatthew G Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
1870e6ccafaeSMatthew G Knepley       const PetscInt vertex    = subpoints[0][v];
1871e6ccafaeSMatthew G Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
1872e6ccafaeSMatthew G Knepley       PetscInt dof, off, sdof, soff, d;
1873e6ccafaeSMatthew G Knepley 
1874e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
1875e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
1876e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
1877e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
1878e6ccafaeSMatthew 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);
1879efa14ee0SMatthew G Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
1880e6ccafaeSMatthew G Knepley     }
1881e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
1882e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
1883e6ccafaeSMatthew G Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
1884e6ccafaeSMatthew G Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
1885e6ccafaeSMatthew G Knepley   }
1886efa14ee0SMatthew G Knepley   /* Cleanup */
1887e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
1888e6ccafaeSMatthew G Knepley     ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);
1889e6ccafaeSMatthew G Knepley     ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr);
1890e6ccafaeSMatthew G Knepley   }
1891efa14ee0SMatthew G Knepley   ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr);
1892e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
1893e6ccafaeSMatthew G Knepley }
1894e6ccafaeSMatthew G Knepley 
1895e6ccafaeSMatthew G Knepley #undef __FUNCT__
1896e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh"
1897e6ccafaeSMatthew G Knepley /*
1898e6ccafaeSMatthew G Knepley   DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label
1899e6ccafaeSMatthew G Knepley 
1900e6ccafaeSMatthew G Knepley   Input Parameters:
1901e6ccafaeSMatthew G Knepley + dm           - The original mesh
1902e6ccafaeSMatthew G Knepley - vertexLabel  - The DMLabel marking vertices contained in the surface
1903e6ccafaeSMatthew G Knepley 
1904e6ccafaeSMatthew G Knepley   Output Parameter:
1905e6ccafaeSMatthew G Knepley . subdm - The surface mesh
1906e6ccafaeSMatthew G Knepley 
1907e6ccafaeSMatthew G Knepley   Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap().
1908e6ccafaeSMatthew G Knepley 
1909e6ccafaeSMatthew G Knepley   Level: developer
1910e6ccafaeSMatthew G Knepley 
1911e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue()
1912e6ccafaeSMatthew G Knepley */
1913e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, const char vertexLabel[], DM *subdm)
1914e6ccafaeSMatthew G Knepley {
1915e6ccafaeSMatthew G Knepley   PetscInt       dim, depth;
1916e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
1917e6ccafaeSMatthew G Knepley 
1918e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
1919e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1920e6ccafaeSMatthew G Knepley   PetscValidCharPointer(vertexLabel, 2);
1921e6ccafaeSMatthew G Knepley   PetscValidPointer(subdm, 4);
1922e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
1923e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
192482f516ccSBarry Smith   ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr);
1925e6ccafaeSMatthew G Knepley   ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr);
1926e6ccafaeSMatthew G Knepley   ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr);
1927e6ccafaeSMatthew G Knepley   if (depth == dim) {
1928e6ccafaeSMatthew G Knepley     ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, *subdm);CHKERRQ(ierr);
1929e6ccafaeSMatthew G Knepley   } else {
1930e6ccafaeSMatthew G Knepley     ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, *subdm);CHKERRQ(ierr);
1931e6ccafaeSMatthew G Knepley   }
1932e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
1933e6ccafaeSMatthew G Knepley }
1934e6ccafaeSMatthew G Knepley 
1935e6ccafaeSMatthew G Knepley #undef __FUNCT__
1936e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap"
1937e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap)
1938e6ccafaeSMatthew G Knepley {
1939e6ccafaeSMatthew G Knepley   DM_Plex *mesh = (DM_Plex*) dm->data;
1940e6ccafaeSMatthew G Knepley 
1941e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
1942e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1943e6ccafaeSMatthew G Knepley   PetscValidPointer(subpointMap, 2);
1944e6ccafaeSMatthew G Knepley   *subpointMap = mesh->subpointMap;
1945e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
1946e6ccafaeSMatthew G Knepley }
1947e6ccafaeSMatthew G Knepley 
1948e6ccafaeSMatthew G Knepley #undef __FUNCT__
1949e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap"
1950e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */
1951e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap)
1952e6ccafaeSMatthew G Knepley {
1953e6ccafaeSMatthew G Knepley   DM_Plex       *mesh = (DM_Plex *) dm->data;
1954e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
1955e6ccafaeSMatthew G Knepley 
1956e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
1957e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1958e6ccafaeSMatthew G Knepley   ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr);
1959e6ccafaeSMatthew G Knepley   mesh->subpointMap = subpointMap;
1960e6ccafaeSMatthew G Knepley   ++mesh->subpointMap->refct;CHKERRQ(ierr);
1961e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
1962e6ccafaeSMatthew G Knepley }
1963e6ccafaeSMatthew G Knepley 
1964e6ccafaeSMatthew G Knepley #undef __FUNCT__
1965e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS"
1966e6ccafaeSMatthew G Knepley /*
1967e6ccafaeSMatthew G Knepley   DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data
1968e6ccafaeSMatthew G Knepley 
1969e6ccafaeSMatthew G Knepley   Input Parameter:
1970e6ccafaeSMatthew G Knepley . dm - The submesh DM
1971e6ccafaeSMatthew G Knepley 
1972e6ccafaeSMatthew G Knepley   Output Parameter:
19730298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh
1974e6ccafaeSMatthew G Knepley 
1975e6ccafaeSMatthew G Knepley   Note: This is IS is guaranteed to be sorted by the construction of the submesh
1976e6ccafaeSMatthew G Knepley */
1977e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS)
1978e6ccafaeSMatthew G Knepley {
197982f516ccSBarry Smith   MPI_Comm        comm;
1980e6ccafaeSMatthew G Knepley   DMLabel         subpointMap;
1981e6ccafaeSMatthew G Knepley   IS              is;
1982e6ccafaeSMatthew G Knepley   const PetscInt *opoints;
1983e6ccafaeSMatthew G Knepley   PetscInt       *points, *depths;
1984e6ccafaeSMatthew G Knepley   PetscInt        depth, depStart, depEnd, d, pStart, pEnd, p, n, off;
1985e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
1986e6ccafaeSMatthew G Knepley 
1987e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
1988e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1989e6ccafaeSMatthew G Knepley   PetscValidPointer(subpointIS, 2);
199082f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
19910298fd71SBarry Smith   *subpointIS = NULL;
1992e6ccafaeSMatthew G Knepley   ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr);
1993e6ccafaeSMatthew G Knepley   if (subpointMap) {
1994e6ccafaeSMatthew G Knepley     ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1995e6ccafaeSMatthew G Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
1996e6ccafaeSMatthew G Knepley     if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart);
1997e6ccafaeSMatthew G Knepley     ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr);
1998e6ccafaeSMatthew G Knepley     depths[0] = depth;
1999e6ccafaeSMatthew G Knepley     depths[1] = 0;
2000e6ccafaeSMatthew G Knepley     for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;}
2001e6ccafaeSMatthew G Knepley     ierr = PetscMalloc(pEnd * sizeof(PetscInt), &points);CHKERRQ(ierr);
2002e6ccafaeSMatthew G Knepley     for(d = 0, off = 0; d <= depth; ++d) {
2003e6ccafaeSMatthew G Knepley       const PetscInt dep = depths[d];
2004e6ccafaeSMatthew G Knepley 
2005e6ccafaeSMatthew G Knepley       ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr);
2006e6ccafaeSMatthew G Knepley       ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr);
20071e21b6fdSMatthew G Knepley       if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */
2008e6ccafaeSMatthew 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);
2009e6ccafaeSMatthew G Knepley       } else {
20101e21b6fdSMatthew G Knepley         if (!n) {
20111e21b6fdSMatthew G Knepley           if (d == 0) {
20121e21b6fdSMatthew G Knepley             /* Missing cells */
20131e21b6fdSMatthew G Knepley             for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1;
20141e21b6fdSMatthew G Knepley           } else {
20151e21b6fdSMatthew G Knepley             /* Missing faces */
20161e21b6fdSMatthew G Knepley             for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT;
20171e21b6fdSMatthew G Knepley           }
20181e21b6fdSMatthew G Knepley         }
2019e6ccafaeSMatthew G Knepley       }
2020e6ccafaeSMatthew G Knepley       if (n) {
2021e6ccafaeSMatthew G Knepley         ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr);
2022e6ccafaeSMatthew G Knepley         ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr);
2023e6ccafaeSMatthew G Knepley         for(p = 0; p < n; ++p, ++off) points[off] = opoints[p];
2024e6ccafaeSMatthew G Knepley         ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr);
2025e6ccafaeSMatthew G Knepley         ierr = ISDestroy(&is);CHKERRQ(ierr);
2026e6ccafaeSMatthew G Knepley       }
2027e6ccafaeSMatthew G Knepley     }
2028e6ccafaeSMatthew G Knepley     ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr);
2029e6ccafaeSMatthew G Knepley     if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd);
2030e6ccafaeSMatthew G Knepley     ierr = ISCreateGeneral(comm, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr);
2031e6ccafaeSMatthew G Knepley   }
2032e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2033e6ccafaeSMatthew G Knepley }
2034