xref: /petsc/src/dm/impls/plex/plexsubmesh.c (revision 166d9d0cd0beca779b4a31eb5deb23ec76fb66cf)
134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h>   /*I      "petscdmplex.h"   I*/
20c312b8eSJed Brown #include <petscsf.h>
3e6ccafaeSMatthew G Knepley 
4e6ccafaeSMatthew G Knepley #undef __FUNCT__
5cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces"
6cd0c2139SMatthew G Knepley /*@
7cd0c2139SMatthew G Knepley   DMPlexMarkBoundaryFaces - Mark all faces on the boundary
8cd0c2139SMatthew G Knepley 
9cd0c2139SMatthew G Knepley   Not Collective
10cd0c2139SMatthew G Knepley 
11cd0c2139SMatthew G Knepley   Input Parameter:
12cd0c2139SMatthew G Knepley . dm - The original DM
13cd0c2139SMatthew G Knepley 
14cd0c2139SMatthew G Knepley   Output Parameter:
15cd0c2139SMatthew G Knepley . label - The DMLabel marking boundary faces with value 1
16cd0c2139SMatthew G Knepley 
17cd0c2139SMatthew G Knepley   Level: developer
18cd0c2139SMatthew G Knepley 
19cd0c2139SMatthew G Knepley .seealso: DMLabelCreate(), DMPlexCreateLabel()
2009f723d9SJed Brown @*/
21cd0c2139SMatthew G Knepley PetscErrorCode DMPlexMarkBoundaryFaces(DM dm, DMLabel label)
22cd0c2139SMatthew G Knepley {
23cd0c2139SMatthew G Knepley   PetscInt       fStart, fEnd, f;
24cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
25cd0c2139SMatthew G Knepley 
26cd0c2139SMatthew G Knepley   PetscFunctionBegin;
27cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
28cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr);
29cd0c2139SMatthew G Knepley   for (f = fStart; f < fEnd; ++f) {
30cd0c2139SMatthew G Knepley     PetscInt supportSize;
31cd0c2139SMatthew G Knepley 
32cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr);
33cd0c2139SMatthew G Knepley     if (supportSize == 1) {
34cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(label, f, 1);CHKERRQ(ierr);
35cd0c2139SMatthew G Knepley     }
36cd0c2139SMatthew G Knepley   }
37cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
38cd0c2139SMatthew G Knepley }
39cd0c2139SMatthew G Knepley 
40cd0c2139SMatthew G Knepley #undef __FUNCT__
412be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelComplete"
422be2b188SMatthew G Knepley /*@
432be2b188SMatthew G Knepley   DMPlexLabelComplete - Starting with a label marking points on a surface, we add the transitive closure to the surface
442be2b188SMatthew G Knepley 
452be2b188SMatthew G Knepley   Input Parameters:
462be2b188SMatthew G Knepley + dm - The DM
472be2b188SMatthew G Knepley - label - A DMLabel marking the surface points
482be2b188SMatthew G Knepley 
492be2b188SMatthew G Knepley   Output Parameter:
502be2b188SMatthew G Knepley . label - A DMLabel marking all surface points in the transitive closure
512be2b188SMatthew G Knepley 
522be2b188SMatthew G Knepley   Level: developer
532be2b188SMatthew G Knepley 
542be2b188SMatthew G Knepley .seealso: DMPlexLabelCohesiveComplete()
552be2b188SMatthew G Knepley @*/
562be2b188SMatthew G Knepley PetscErrorCode DMPlexLabelComplete(DM dm, DMLabel label)
572be2b188SMatthew G Knepley {
582be2b188SMatthew G Knepley   IS              valueIS;
592be2b188SMatthew G Knepley   const PetscInt *values;
602be2b188SMatthew G Knepley   PetscInt        numValues, v;
612be2b188SMatthew G Knepley   PetscErrorCode  ierr;
622be2b188SMatthew G Knepley 
632be2b188SMatthew G Knepley   PetscFunctionBegin;
642be2b188SMatthew G Knepley   ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr);
652be2b188SMatthew G Knepley   ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
662be2b188SMatthew G Knepley   ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
672be2b188SMatthew G Knepley   for (v = 0; v < numValues; ++v) {
682be2b188SMatthew G Knepley     IS              pointIS;
692be2b188SMatthew G Knepley     const PetscInt *points;
702be2b188SMatthew G Knepley     PetscInt        numPoints, p;
712be2b188SMatthew G Knepley 
722be2b188SMatthew G Knepley     ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr);
732be2b188SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr);
742be2b188SMatthew G Knepley     ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
752be2b188SMatthew G Knepley     for (p = 0; p < numPoints; ++p) {
762be2b188SMatthew G Knepley       PetscInt *closure = NULL;
772be2b188SMatthew G Knepley       PetscInt  closureSize, c;
782be2b188SMatthew G Knepley 
792be2b188SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
802be2b188SMatthew G Knepley       for (c = 0; c < closureSize*2; c += 2) {
812be2b188SMatthew G Knepley         ierr = DMLabelSetValue(label, closure[c], values[v]);CHKERRQ(ierr);
822be2b188SMatthew G Knepley       }
832be2b188SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
842be2b188SMatthew G Knepley     }
852be2b188SMatthew G Knepley     ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);
862be2b188SMatthew G Knepley     ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
872be2b188SMatthew G Knepley   }
882be2b188SMatthew G Knepley   ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
892be2b188SMatthew G Knepley   ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
902be2b188SMatthew G Knepley   PetscFunctionReturn(0);
912be2b188SMatthew G Knepley }
922be2b188SMatthew G Knepley 
932be2b188SMatthew G Knepley #undef __FUNCT__
94cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoint_Internal"
95cd0c2139SMatthew G Knepley PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthEnd[], PetscInt depthShift[])
96cd0c2139SMatthew G Knepley {
97cd0c2139SMatthew G Knepley   if (depth < 0) return p;
98cd0c2139SMatthew G Knepley   /* Cells    */ if (p < depthEnd[depth])   return p;
99cd0c2139SMatthew G Knepley   /* Vertices */ if (p < depthEnd[0])       return p + depthShift[depth];
100cd0c2139SMatthew G Knepley   /* Faces    */ if (p < depthEnd[depth-1]) return p + depthShift[depth] + depthShift[0];
101cd0c2139SMatthew G Knepley   /* Edges    */                            return p + depthShift[depth] + depthShift[0] + depthShift[depth-1];
102cd0c2139SMatthew G Knepley }
103cd0c2139SMatthew G Knepley 
104cd0c2139SMatthew G Knepley #undef __FUNCT__
105cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSizes_Internal"
106cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew)
107cd0c2139SMatthew G Knepley {
108cd0c2139SMatthew G Knepley   PetscInt      *depthEnd;
109cd0c2139SMatthew G Knepley   PetscInt       depth = 0, d, pStart, pEnd, p;
110cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
111cd0c2139SMatthew G Knepley 
112cd0c2139SMatthew G Knepley   PetscFunctionBegin;
113cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
114cd0c2139SMatthew G Knepley   if (depth < 0) PetscFunctionReturn(0);
115cd0c2139SMatthew G Knepley   ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr);
116cd0c2139SMatthew G Knepley   /* Step 1: Expand chart */
117cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
118cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
119cd0c2139SMatthew G Knepley     pEnd += depthShift[d];
120cd0c2139SMatthew G Knepley     ierr  = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
121cd0c2139SMatthew G Knepley   }
122cd0c2139SMatthew G Knepley   ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr);
123cd0c2139SMatthew G Knepley   /* Step 2: Set cone and support sizes */
124cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
125cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr);
126cd0c2139SMatthew G Knepley     for (p = pStart; p < pEnd; ++p) {
127cd0c2139SMatthew G Knepley       PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthEnd, depthShift);
128cd0c2139SMatthew G Knepley       PetscInt size;
129cd0c2139SMatthew G Knepley 
130cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr);
131cd0c2139SMatthew G Knepley       ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr);
132cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr);
133cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr);
134cd0c2139SMatthew G Knepley     }
135cd0c2139SMatthew G Knepley   }
136cd0c2139SMatthew G Knepley   ierr = PetscFree(depthEnd);CHKERRQ(ierr);
137cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
138cd0c2139SMatthew G Knepley }
139cd0c2139SMatthew G Knepley 
140cd0c2139SMatthew G Knepley #undef __FUNCT__
141cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoints_Internal"
142cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew)
143cd0c2139SMatthew G Knepley {
144cd0c2139SMatthew G Knepley   PetscInt      *depthEnd, *newpoints;
145dcbb62e8SMatthew G. Knepley   PetscInt       depth = 0, d, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, pStart, pEnd, p;
146cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
147cd0c2139SMatthew G Knepley 
148cd0c2139SMatthew G Knepley   PetscFunctionBegin;
149cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
150cd0c2139SMatthew G Knepley   if (depth < 0) PetscFunctionReturn(0);
151cd0c2139SMatthew G Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
152dcbb62e8SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dmNew, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr);
153dcbb62e8SMatthew G. Knepley   ierr = PetscMalloc2(depth+1,PetscInt,&depthEnd,PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),PetscInt,&newpoints);CHKERRQ(ierr);
154cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
155cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
156cd0c2139SMatthew G Knepley   }
157cd0c2139SMatthew G Knepley   /* Step 5: Set cones and supports */
158cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
159cd0c2139SMatthew G Knepley   for (p = pStart; p < pEnd; ++p) {
160cd0c2139SMatthew G Knepley     const PetscInt *points = NULL, *orientations = NULL;
161dcbb62e8SMatthew G. Knepley     PetscInt        size,sizeNew, i, newp = DMPlexShiftPoint_Internal(p, depth, depthEnd, depthShift);
162cd0c2139SMatthew G Knepley 
163cd0c2139SMatthew G Knepley     ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr);
164cd0c2139SMatthew G Knepley     ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr);
165cd0c2139SMatthew G Knepley     ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr);
166cd0c2139SMatthew G Knepley     for (i = 0; i < size; ++i) {
167cd0c2139SMatthew G Knepley       newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthEnd, depthShift);
168cd0c2139SMatthew G Knepley     }
169cd0c2139SMatthew G Knepley     ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr);
170cd0c2139SMatthew G Knepley     ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr);
171cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr);
172dcbb62e8SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dmNew, newp, &sizeNew);CHKERRQ(ierr);
173cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr);
174cd0c2139SMatthew G Knepley     for (i = 0; i < size; ++i) {
175cd0c2139SMatthew G Knepley       newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthEnd, depthShift);
176cd0c2139SMatthew G Knepley     }
177dcbb62e8SMatthew G. Knepley     for (i = size; i < sizeNew; ++i) newpoints[i] = 0;
178cd0c2139SMatthew G Knepley     ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr);
179cd0c2139SMatthew G Knepley   }
180cd0c2139SMatthew G Knepley   ierr = PetscFree2(depthEnd,newpoints);CHKERRQ(ierr);
181cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
182cd0c2139SMatthew G Knepley }
183cd0c2139SMatthew G Knepley 
184cd0c2139SMatthew G Knepley #undef __FUNCT__
185cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftCoordinates_Internal"
186cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew)
187cd0c2139SMatthew G Knepley {
188cd0c2139SMatthew G Knepley   PetscSection   coordSection, newCoordSection;
189cd0c2139SMatthew G Knepley   Vec            coordinates, newCoordinates;
190cd0c2139SMatthew G Knepley   PetscScalar   *coords, *newCoords;
191cd0c2139SMatthew G Knepley   PetscInt      *depthEnd, coordSize;
192cd0c2139SMatthew G Knepley   PetscInt       dim, depth = 0, d, vStart, vEnd, vStartNew, vEndNew, v;
193cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
194cd0c2139SMatthew G Knepley 
195cd0c2139SMatthew G Knepley   PetscFunctionBegin;
196cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
197cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
198cd0c2139SMatthew G Knepley   ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr);
199cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
200cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
201cd0c2139SMatthew G Knepley   }
202cd0c2139SMatthew G Knepley   /* Step 8: Convert coordinates */
203cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
204cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr);
205cd0c2139SMatthew G Knepley   ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
206cd0c2139SMatthew G Knepley   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr);
207cd0c2139SMatthew G Knepley   ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr);
208cd0c2139SMatthew G Knepley   ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr);
209cd0c2139SMatthew G Knepley   ierr = PetscSectionSetChart(newCoordSection, vStartNew, vEndNew);CHKERRQ(ierr);
210cd0c2139SMatthew G Knepley   for (v = vStartNew; v < vEndNew; ++v) {
211cd0c2139SMatthew G Knepley     ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr);
212cd0c2139SMatthew G Knepley     ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr);
213cd0c2139SMatthew G Knepley   }
214cd0c2139SMatthew G Knepley   ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr);
215cd0c2139SMatthew G Knepley   ierr = DMPlexSetCoordinateSection(dmNew, newCoordSection);CHKERRQ(ierr);
216cd0c2139SMatthew G Knepley   ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr);
217cd0c2139SMatthew G Knepley   ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr);
218cd0c2139SMatthew G Knepley   ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr);
219cd0c2139SMatthew G Knepley   ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
2202eb5907fSJed Brown   ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr);
221cd0c2139SMatthew G Knepley   ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr);
222cd0c2139SMatthew G Knepley   ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
223cd0c2139SMatthew G Knepley   ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
224cd0c2139SMatthew G Knepley   ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr);
225cd0c2139SMatthew G Knepley   for (v = vStart; v < vEnd; ++v) {
226cd0c2139SMatthew G Knepley     PetscInt dof, off, noff, d;
227cd0c2139SMatthew G Knepley 
228cd0c2139SMatthew G Knepley     ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr);
229cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
230cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthEnd, depthShift), &noff);CHKERRQ(ierr);
231cd0c2139SMatthew G Knepley     for (d = 0; d < dof; ++d) {
232cd0c2139SMatthew G Knepley       newCoords[noff+d] = coords[off+d];
233cd0c2139SMatthew G Knepley     }
234cd0c2139SMatthew G Knepley   }
235cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
236cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr);
237cd0c2139SMatthew G Knepley   ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr);
238cd0c2139SMatthew G Knepley   ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr);
239cd0c2139SMatthew G Knepley   ierr = PetscFree(depthEnd);CHKERRQ(ierr);
240cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
241cd0c2139SMatthew G Knepley }
242cd0c2139SMatthew G Knepley 
243cd0c2139SMatthew G Knepley #undef __FUNCT__
244cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal"
245cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew)
246cd0c2139SMatthew G Knepley {
247cd0c2139SMatthew G Knepley   PetscInt          *depthEnd;
248cd0c2139SMatthew G Knepley   PetscInt           depth = 0, d;
249cd0c2139SMatthew G Knepley   PetscSF            sfPoint, sfPointNew;
250cd0c2139SMatthew G Knepley   const PetscSFNode *remotePoints;
251cd0c2139SMatthew G Knepley   PetscSFNode       *gremotePoints;
252cd0c2139SMatthew G Knepley   const PetscInt    *localPoints;
253cd0c2139SMatthew G Knepley   PetscInt          *glocalPoints, *newLocation, *newRemoteLocation;
254cd0c2139SMatthew G Knepley   PetscInt           numRoots, numLeaves, l, pStart, pEnd, totShift = 0;
255cd0c2139SMatthew G Knepley   PetscErrorCode     ierr;
256cd0c2139SMatthew G Knepley 
257cd0c2139SMatthew G Knepley   PetscFunctionBegin;
258cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
259cd0c2139SMatthew G Knepley   ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr);
260cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
261cd0c2139SMatthew G Knepley     totShift += depthShift[d];
262cd0c2139SMatthew G Knepley     ierr      = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
263cd0c2139SMatthew G Knepley   }
264cd0c2139SMatthew G Knepley   /* Step 9: Convert pointSF */
265cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
266cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr);
267cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
268cd0c2139SMatthew G Knepley   ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
269cd0c2139SMatthew G Knepley   if (numRoots >= 0) {
270cd0c2139SMatthew G Knepley     ierr = PetscMalloc2(numRoots,PetscInt,&newLocation,pEnd-pStart,PetscInt,&newRemoteLocation);CHKERRQ(ierr);
271cd0c2139SMatthew G Knepley     for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthEnd, depthShift);
272cd0c2139SMatthew G Knepley     ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr);
273cd0c2139SMatthew G Knepley     ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr);
274cd0c2139SMatthew G Knepley     ierr = PetscMalloc(numLeaves * sizeof(PetscInt),    &glocalPoints);CHKERRQ(ierr);
275cd0c2139SMatthew G Knepley     ierr = PetscMalloc(numLeaves * sizeof(PetscSFNode), &gremotePoints);CHKERRQ(ierr);
276cd0c2139SMatthew G Knepley     for (l = 0; l < numLeaves; ++l) {
277cd0c2139SMatthew G Knepley       glocalPoints[l]        = DMPlexShiftPoint_Internal(localPoints[l], depth, depthEnd, depthShift);
278cd0c2139SMatthew G Knepley       gremotePoints[l].rank  = remotePoints[l].rank;
279cd0c2139SMatthew G Knepley       gremotePoints[l].index = newRemoteLocation[localPoints[l]];
280cd0c2139SMatthew G Knepley     }
281cd0c2139SMatthew G Knepley     ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr);
282cd0c2139SMatthew G Knepley     ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
283cd0c2139SMatthew G Knepley   }
284cd0c2139SMatthew G Knepley   ierr = PetscFree(depthEnd);CHKERRQ(ierr);
285cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
286cd0c2139SMatthew G Knepley }
287cd0c2139SMatthew G Knepley 
288cd0c2139SMatthew G Knepley #undef __FUNCT__
289cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal"
290cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew)
291cd0c2139SMatthew G Knepley {
292cd0c2139SMatthew G Knepley   PetscSF            sfPoint;
293cd0c2139SMatthew G Knepley   DMLabel            vtkLabel, ghostLabel;
294cd0c2139SMatthew G Knepley   PetscInt          *depthEnd;
295cd0c2139SMatthew G Knepley   const PetscSFNode *leafRemote;
296cd0c2139SMatthew G Knepley   const PetscInt    *leafLocal;
297cd0c2139SMatthew G Knepley   PetscInt           depth = 0, d, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f;
298cd0c2139SMatthew G Knepley   PetscMPIInt        rank;
299cd0c2139SMatthew G Knepley   PetscErrorCode     ierr;
300cd0c2139SMatthew G Knepley 
301cd0c2139SMatthew G Knepley   PetscFunctionBegin;
302cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
303cd0c2139SMatthew G Knepley   ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr);
304cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
305cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
306cd0c2139SMatthew G Knepley   }
307cd0c2139SMatthew G Knepley   /* Step 10: Convert labels */
308cd0c2139SMatthew G Knepley   ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr);
309cd0c2139SMatthew G Knepley   for (l = 0; l < numLabels; ++l) {
310cd0c2139SMatthew G Knepley     DMLabel         label, newlabel;
311cd0c2139SMatthew G Knepley     const char     *lname;
312cd0c2139SMatthew G Knepley     PetscBool       isDepth;
313cd0c2139SMatthew G Knepley     IS              valueIS;
314cd0c2139SMatthew G Knepley     const PetscInt *values;
315cd0c2139SMatthew G Knepley     PetscInt        numValues, val;
316cd0c2139SMatthew G Knepley 
317cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr);
318cd0c2139SMatthew G Knepley     ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr);
319cd0c2139SMatthew G Knepley     if (isDepth) continue;
320cd0c2139SMatthew G Knepley     ierr = DMPlexCreateLabel(dmNew, lname);CHKERRQ(ierr);
321cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr);
322cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr);
323cd0c2139SMatthew G Knepley     ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
324cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr);
325cd0c2139SMatthew G Knepley     ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
326cd0c2139SMatthew G Knepley     for (val = 0; val < numValues; ++val) {
327cd0c2139SMatthew G Knepley       IS              pointIS;
328cd0c2139SMatthew G Knepley       const PetscInt *points;
329cd0c2139SMatthew G Knepley       PetscInt        numPoints, p;
330cd0c2139SMatthew G Knepley 
331cd0c2139SMatthew G Knepley       ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr);
332cd0c2139SMatthew G Knepley       ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);
333cd0c2139SMatthew G Knepley       ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
334cd0c2139SMatthew G Knepley       for (p = 0; p < numPoints; ++p) {
335cd0c2139SMatthew G Knepley         const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthEnd, depthShift);
336cd0c2139SMatthew G Knepley 
337cd0c2139SMatthew G Knepley         ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr);
338cd0c2139SMatthew G Knepley       }
339cd0c2139SMatthew G Knepley       ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);
340cd0c2139SMatthew G Knepley       ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
341cd0c2139SMatthew G Knepley     }
342cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
343cd0c2139SMatthew G Knepley     ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
344cd0c2139SMatthew G Knepley   }
345cd0c2139SMatthew G Knepley   ierr = PetscFree(depthEnd);CHKERRQ(ierr);
346cd0c2139SMatthew G Knepley   /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */
347cd0c2139SMatthew G Knepley   ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr);
348cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
349cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
350cd0c2139SMatthew G Knepley   ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr);
351cd0c2139SMatthew G Knepley   ierr = DMPlexCreateLabel(dmNew, "vtk");CHKERRQ(ierr);
352cd0c2139SMatthew G Knepley   ierr = DMPlexCreateLabel(dmNew, "ghost");CHKERRQ(ierr);
353cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr);
354cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr);
355cd0c2139SMatthew G Knepley   for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) {
356cd0c2139SMatthew G Knepley     for (; c < leafLocal[l] && c < cEnd; ++c) {
357cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
358cd0c2139SMatthew G Knepley     }
359cd0c2139SMatthew G Knepley     if (leafLocal[l] >= cEnd) break;
360cd0c2139SMatthew G Knepley     if (leafRemote[l].rank == rank) {
361cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
362cd0c2139SMatthew G Knepley     } else {
363cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr);
364cd0c2139SMatthew G Knepley     }
365cd0c2139SMatthew G Knepley   }
366cd0c2139SMatthew G Knepley   for (; c < cEnd; ++c) {
367cd0c2139SMatthew G Knepley     ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
368cd0c2139SMatthew G Knepley   }
369cd0c2139SMatthew G Knepley   if (0) {
370cd0c2139SMatthew G Knepley     ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr);
371cd0c2139SMatthew G Knepley     ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
372cd0c2139SMatthew G Knepley     ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
373cd0c2139SMatthew G Knepley   }
374cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr);
375cd0c2139SMatthew G Knepley   for (f = fStart; f < fEnd; ++f) {
376cd0c2139SMatthew G Knepley     PetscInt numCells;
377cd0c2139SMatthew G Knepley 
378cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr);
379cd0c2139SMatthew G Knepley     if (numCells < 2) {
380cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);
381cd0c2139SMatthew G Knepley     } else {
382cd0c2139SMatthew G Knepley       const PetscInt *cells = NULL;
383cd0c2139SMatthew G Knepley       PetscInt        vA, vB;
384cd0c2139SMatthew G Knepley 
385cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr);
386cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr);
387cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr);
388cd0c2139SMatthew G Knepley       if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);}
389cd0c2139SMatthew G Knepley     }
390cd0c2139SMatthew G Knepley   }
391cd0c2139SMatthew G Knepley   if (0) {
392cd0c2139SMatthew G Knepley     ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr);
393cd0c2139SMatthew G Knepley     ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
394cd0c2139SMatthew G Knepley     ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
395cd0c2139SMatthew G Knepley   }
396cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
397cd0c2139SMatthew G Knepley }
398cd0c2139SMatthew G Knepley 
399cd0c2139SMatthew G Knepley #undef __FUNCT__
400cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal"
401cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm)
402cd0c2139SMatthew G Knepley {
403cd0c2139SMatthew G Knepley   IS              valueIS;
404cd0c2139SMatthew G Knepley   const PetscInt *values;
405cd0c2139SMatthew G Knepley   PetscInt       *depthShift;
406cd0c2139SMatthew G Knepley   PetscInt        depth = 0, numFS, fs, ghostCell, cEnd, c;
407cd0c2139SMatthew G Knepley   PetscErrorCode  ierr;
408cd0c2139SMatthew G Knepley 
409cd0c2139SMatthew G Knepley   PetscFunctionBegin;
410cd0c2139SMatthew G Knepley   /* Count ghost cells */
411cd0c2139SMatthew G Knepley   ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
412cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr);
413cd0c2139SMatthew G Knepley   ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
414cd0c2139SMatthew G Knepley 
415cd0c2139SMatthew G Knepley   *numGhostCells = 0;
416cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
417cd0c2139SMatthew G Knepley     PetscInt numBdFaces;
418cd0c2139SMatthew G Knepley 
419cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumSize(label, values[fs], &numBdFaces);CHKERRQ(ierr);
420cd0c2139SMatthew G Knepley 
421cd0c2139SMatthew G Knepley     *numGhostCells += numBdFaces;
422cd0c2139SMatthew G Knepley   }
423cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
424cd0c2139SMatthew G Knepley   ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthShift);CHKERRQ(ierr);
425cd0c2139SMatthew G Knepley   ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr);
426cd0c2139SMatthew G Knepley   if (depth >= 0) depthShift[depth] = *numGhostCells;
427cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
428cd0c2139SMatthew G Knepley   /* Step 3: Set cone/support sizes for new points */
429cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
430cd0c2139SMatthew G Knepley   for (c = cEnd; c < cEnd + *numGhostCells; ++c) {
431cd0c2139SMatthew G Knepley     ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr);
432cd0c2139SMatthew G Knepley   }
433cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
434cd0c2139SMatthew G Knepley     IS              faceIS;
435cd0c2139SMatthew G Knepley     const PetscInt *faces;
436cd0c2139SMatthew G Knepley     PetscInt        numFaces, f;
437cd0c2139SMatthew G Knepley 
438cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
439cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
440cd0c2139SMatthew G Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
441cd0c2139SMatthew G Knepley     for (f = 0; f < numFaces; ++f) {
442cd0c2139SMatthew G Knepley       PetscInt size;
443cd0c2139SMatthew G Knepley 
444cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr);
445cd0c2139SMatthew 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);
446cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(gdm, faces[f] + *numGhostCells, 2);CHKERRQ(ierr);
447cd0c2139SMatthew G Knepley     }
448cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr);
449cd0c2139SMatthew G Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
450cd0c2139SMatthew G Knepley   }
451cd0c2139SMatthew G Knepley   /* Step 4: Setup ghosted DM */
452cd0c2139SMatthew G Knepley   ierr = DMSetUp(gdm);CHKERRQ(ierr);
453cd0c2139SMatthew G Knepley   ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
454cd0c2139SMatthew G Knepley   /* Step 6: Set cones and supports for new points */
455cd0c2139SMatthew G Knepley   ghostCell = cEnd;
456cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
457cd0c2139SMatthew G Knepley     IS              faceIS;
458cd0c2139SMatthew G Knepley     const PetscInt *faces;
459cd0c2139SMatthew G Knepley     PetscInt        numFaces, f;
460cd0c2139SMatthew G Knepley 
461cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
462cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
463cd0c2139SMatthew G Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
464cd0c2139SMatthew G Knepley     for (f = 0; f < numFaces; ++f, ++ghostCell) {
465cd0c2139SMatthew G Knepley       PetscInt newFace = faces[f] + *numGhostCells;
466cd0c2139SMatthew G Knepley 
467cd0c2139SMatthew G Knepley       ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr);
468cd0c2139SMatthew G Knepley       ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr);
469cd0c2139SMatthew G Knepley     }
470cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr);
471cd0c2139SMatthew G Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
472cd0c2139SMatthew G Knepley   }
473cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
474cd0c2139SMatthew G Knepley   ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
475cd0c2139SMatthew G Knepley   /* Step 7: Stratify */
476cd0c2139SMatthew G Knepley   ierr = DMPlexStratify(gdm);CHKERRQ(ierr);
477cd0c2139SMatthew G Knepley   ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
478cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
479cd0c2139SMatthew G Knepley   ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
480cd0c2139SMatthew G Knepley   ierr = PetscFree(depthShift);CHKERRQ(ierr);
481cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
482cd0c2139SMatthew G Knepley }
483cd0c2139SMatthew G Knepley 
484cd0c2139SMatthew G Knepley #undef __FUNCT__
485cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells"
486cd0c2139SMatthew G Knepley /*@C
487cd0c2139SMatthew G Knepley   DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face
488cd0c2139SMatthew G Knepley 
489cd0c2139SMatthew G Knepley   Collective on dm
490cd0c2139SMatthew G Knepley 
491cd0c2139SMatthew G Knepley   Input Parameters:
492cd0c2139SMatthew G Knepley + dm - The original DM
493cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL
494cd0c2139SMatthew G Knepley 
495cd0c2139SMatthew G Knepley   Output Parameters:
496cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM
497cd0c2139SMatthew G Knepley - dmGhosted - The new DM
498cd0c2139SMatthew G Knepley 
499cd0c2139SMatthew G Knepley   Note: If no label exists of that name, one will be created marking all boundary faces
500cd0c2139SMatthew G Knepley 
501cd0c2139SMatthew G Knepley   Level: developer
502cd0c2139SMatthew G Knepley 
503cd0c2139SMatthew G Knepley .seealso: DMCreate()
504cd0c2139SMatthew G Knepley */
505cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted)
506cd0c2139SMatthew G Knepley {
507cd0c2139SMatthew G Knepley   DM             gdm;
508cd0c2139SMatthew G Knepley   DMLabel        label;
509cd0c2139SMatthew G Knepley   const char    *name = labelName ? labelName : "Face Sets";
510cd0c2139SMatthew G Knepley   PetscInt       dim;
511cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
512cd0c2139SMatthew G Knepley 
513cd0c2139SMatthew G Knepley   PetscFunctionBegin;
514cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
515cd0c2139SMatthew G Knepley   PetscValidPointer(numGhostCells, 3);
516cd0c2139SMatthew G Knepley   PetscValidPointer(dmGhosted, 4);
517cd0c2139SMatthew G Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr);
518cd0c2139SMatthew G Knepley   ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr);
519cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
520cd0c2139SMatthew G Knepley   ierr = DMPlexSetDimension(gdm, dim);CHKERRQ(ierr);
521cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr);
522cd0c2139SMatthew G Knepley   if (!label) {
523cd0c2139SMatthew G Knepley     /* Get label for boundary faces */
524cd0c2139SMatthew G Knepley     ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr);
525cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr);
526cd0c2139SMatthew G Knepley     ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr);
527cd0c2139SMatthew G Knepley   }
528cd0c2139SMatthew G Knepley   ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr);
529cd0c2139SMatthew G Knepley   ierr = DMSetFromOptions(gdm);CHKERRQ(ierr);
530cd0c2139SMatthew G Knepley   *dmGhosted = gdm;
531cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
532cd0c2139SMatthew G Knepley }
533cd0c2139SMatthew G Knepley 
534cd0c2139SMatthew G Knepley #undef __FUNCT__
535cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal"
536607ab7a9SMatthew G. Knepley /*
537607ab7a9SMatthew G. Knepley   We are adding two kinds of points here:
538607ab7a9SMatthew G. Knepley     Replicated: Copies of points which exist in the mesh, such as vertices identified across a fault
539607ab7a9SMatthew G. Knepley     Hybrid:     Entirely new points, such as cohesive cells
540607ab7a9SMatthew G. Knepley */
541cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm)
542cd0c2139SMatthew G Knepley {
543cd0c2139SMatthew G Knepley   MPI_Comm         comm;
544607ab7a9SMatthew G. Knepley   IS               valueIS;
545607ab7a9SMatthew G. Knepley   PetscInt         numSP = 0;       /* The number of depths for which we have replicated points */
546607ab7a9SMatthew G. Knepley   const PetscInt  *values;          /* List of depths for which we have replicated points */
547607ab7a9SMatthew G. Knepley   IS              *pointIS;
548607ab7a9SMatthew G. Knepley   PetscInt        *numSplitPoints;  /* The number of replicated points at each depth */
549607ab7a9SMatthew G. Knepley   PetscInt        *numHybridPoints; /* The number of hybrid points at each depth */
550607ab7a9SMatthew G. Knepley   const PetscInt **splitPoints;     /* Replicated points for each depth */
551cd0c2139SMatthew G Knepley   PetscSection     coordSection;
552cd0c2139SMatthew G Knepley   Vec              coordinates;
553cd0c2139SMatthew G Knepley   PetscScalar     *coords;
554607ab7a9SMatthew G. Knepley   PetscInt         depths[4];       /* Depths in the order that plex points are numbered */
555607ab7a9SMatthew G. Knepley   PetscInt        *depthShift;      /* Number of replicated+hybrid points at each depth */
556607ab7a9SMatthew G. Knepley   PetscInt        *depthOffset;     /* Prefix sums of depthShift */
557607ab7a9SMatthew G. Knepley   PetscInt        *pMaxNew;         /* The first replicated point at each depth in the new mesh, hybrids come after this */
558607ab7a9SMatthew G. Knepley   PetscInt        *coneNew, *coneONew, *supportNew;
559dcbb62e8SMatthew G. Knepley   PetscInt         shift = 100, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v;
560cd0c2139SMatthew G Knepley   PetscErrorCode   ierr;
561cd0c2139SMatthew G Knepley 
562cd0c2139SMatthew G Knepley   PetscFunctionBegin;
563cd0c2139SMatthew G Knepley   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
564cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
565607ab7a9SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
566fd4b9f15SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
567607ab7a9SMatthew G. Knepley   depths[0] = depth;
568607ab7a9SMatthew G. Knepley   depths[1] = 0;
569607ab7a9SMatthew G. Knepley   depths[2] = depth-1;
570607ab7a9SMatthew G. Knepley   depths[3] = 1;
571cd0c2139SMatthew G Knepley   /* Count split points and add cohesive cells */
572607ab7a9SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
573dcbb62e8SMatthew G. Knepley   ierr = PetscMalloc3(depth+1,PetscInt,&depthShift,depth+1,PetscInt,&depthOffset,depth+1,PetscInt,&pMaxNew);CHKERRQ(ierr);
574607ab7a9SMatthew G. Knepley   ierr = PetscMalloc4(depth+1,IS,&pointIS,depth+1,PetscInt,&numSplitPoints,depth+1,PetscInt,&numHybridPoints,depth+1,const PetscInt*,&splitPoints);CHKERRQ(ierr);
575607ab7a9SMatthew G. Knepley   ierr = PetscMemzero(depthShift,  (depth+1) * sizeof(PetscInt));CHKERRQ(ierr);
576607ab7a9SMatthew G. Knepley   ierr = PetscMemzero(depthOffset, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr);
577607ab7a9SMatthew G. Knepley   for (d = 0; d <= depth; ++d) {
578607ab7a9SMatthew G. Knepley     ierr               = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr);
579607ab7a9SMatthew G. Knepley     numSplitPoints[d]  = 0;
580607ab7a9SMatthew G. Knepley     numHybridPoints[d] = 0;
581607ab7a9SMatthew G. Knepley     splitPoints[d]     = NULL;
582607ab7a9SMatthew G. Knepley     pointIS[d]         = NULL;
583607ab7a9SMatthew G. Knepley   }
584cd0c2139SMatthew G Knepley   if (label) {
585cd0c2139SMatthew G Knepley     ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
586cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr);
587cd0c2139SMatthew G Knepley     ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
588cd0c2139SMatthew G Knepley   }
589cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
590cd0c2139SMatthew G Knepley     const PetscInt dep = values[sp];
591cd0c2139SMatthew G Knepley 
592cd0c2139SMatthew G Knepley     if ((dep < 0) || (dep > depth)) continue;
593cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, dep, &pointIS[dep]);CHKERRQ(ierr);
594cd0c2139SMatthew G Knepley     if (pointIS[dep]) {
595cd0c2139SMatthew G Knepley       ierr = ISGetLocalSize(pointIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr);
596cd0c2139SMatthew G Knepley       ierr = ISGetIndices(pointIS[dep], &splitPoints[dep]);CHKERRQ(ierr);
597cd0c2139SMatthew G Knepley     }
598cd0c2139SMatthew G Knepley   }
599607ab7a9SMatthew G. Knepley   /* Calculate number of hybrid points */
600607ab7a9SMatthew G. Knepley   for (d = 1; d <= depth; ++d) numHybridPoints[d]     = numSplitPoints[d-1]; /* There is a hybrid cell/face/edge for every split face/edge/vertex   */
601607ab7a9SMatthew G. Knepley   for (d = 0; d <= depth; ++d) depthShift[d]          = numSplitPoints[d] + numHybridPoints[d];
602607ab7a9SMatthew G. Knepley   for (d = 1; d <= depth; ++d) depthOffset[depths[d]] = depthOffset[depths[d-1]] + depthShift[depths[d-1]];
603607ab7a9SMatthew G. Knepley   for (d = 0; d <= depth; ++d) pMaxNew[d]            += depthOffset[d];
604cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
605cd0c2139SMatthew G Knepley   /* Step 3: Set cone/support sizes for new points */
606cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
607cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
608cd0c2139SMatthew G Knepley       const PetscInt  oldp   = splitPoints[dep][p];
6094c367dbcSMatthew G. Knepley       const PetscInt  newp   = oldp + depthOffset[dep];
6104c367dbcSMatthew G. Knepley       const PetscInt  splitp = p    + pMaxNew[dep];
611cd0c2139SMatthew G Knepley       const PetscInt *support;
6124c367dbcSMatthew G. Knepley       PetscInt        coneSize, supportSize, qf, qn, qp, e;
613cd0c2139SMatthew G Knepley 
614cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
615cd0c2139SMatthew G Knepley       ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr);
616cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
617cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr);
618cd0c2139SMatthew G Knepley       if (dep == depth-1) {
6194c367dbcSMatthew G. Knepley         const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
6204c367dbcSMatthew G. Knepley 
621cd0c2139SMatthew G Knepley         /* Add cohesive cells, they are prisms */
6224c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr);
623cd0c2139SMatthew G Knepley       } else if (dep == 0) {
6244c367dbcSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
625cd0c2139SMatthew G Knepley 
626cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
6274c367dbcSMatthew G. Knepley         for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) {
628cd0c2139SMatthew G Knepley           PetscInt val;
629cd0c2139SMatthew G Knepley 
630cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
6314c367dbcSMatthew G. Knepley           if (val == 1) ++qf;
6324c367dbcSMatthew G. Knepley           if ((val == 1) || (val ==  (shift + 1))) ++qn;
6334c367dbcSMatthew G. Knepley           if ((val == 1) || (val == -(shift + 1))) ++qp;
634cd0c2139SMatthew G Knepley         }
6354c367dbcSMatthew G. Knepley         /* Split old vertex: Edges into original vertex and new cohesive edge */
6364c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr);
6374c367dbcSMatthew G. Knepley         /* Split new vertex: Edges into split vertex and new cohesive edge */
6384c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr);
6394c367dbcSMatthew G. Knepley         /* Add hybrid edge */
6404c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr);
6414c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr);
642cd0c2139SMatthew G Knepley       } else if (dep == dim-2) {
6434c367dbcSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
6444c367dbcSMatthew G. Knepley 
645cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
6464c367dbcSMatthew G. Knepley         for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) {
647cd0c2139SMatthew G Knepley           PetscInt val;
648cd0c2139SMatthew G Knepley 
649cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
6504c367dbcSMatthew G. Knepley           if (val == dim-1) ++qf;
6514c367dbcSMatthew G. Knepley           if ((val == dim-1) || (val ==  (shift + dim-1))) ++qn;
6524c367dbcSMatthew G. Knepley           if ((val == dim-1) || (val == -(shift + dim-1))) ++qp;
653cd0c2139SMatthew G Knepley         }
6544c367dbcSMatthew G. Knepley         /* Split old edge: Faces into original edge and cohesive face (positive side?) */
6554c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr);
6564c367dbcSMatthew G. Knepley         /* Split new edge: Faces into split edge and cohesive face (negative side?) */
6574c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr);
6584c367dbcSMatthew G. Knepley         /* Add hybrid face */
6594c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr);
6604c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr);
661cd0c2139SMatthew G Knepley       }
662cd0c2139SMatthew G Knepley     }
663cd0c2139SMatthew G Knepley   }
664cd0c2139SMatthew G Knepley   /* Step 4: Setup split DM */
665cd0c2139SMatthew G Knepley   ierr = DMSetUp(sdm);CHKERRQ(ierr);
666cd0c2139SMatthew G Knepley   ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
667dcbb62e8SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr);
668dcbb62e8SMatthew G. Knepley   ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,PetscInt,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,PetscInt,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),PetscInt,&supportNew);CHKERRQ(ierr);
669cd0c2139SMatthew G Knepley   /* Step 6: Set cones and supports for new points */
670cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
671cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
672cd0c2139SMatthew G Knepley       const PetscInt  oldp   = splitPoints[dep][p];
6734c367dbcSMatthew G. Knepley       const PetscInt  newp   = oldp + depthOffset[dep];
6744c367dbcSMatthew G. Knepley       const PetscInt  splitp = p    + pMaxNew[dep];
675cd0c2139SMatthew G Knepley       const PetscInt *cone, *support, *ornt;
6764c367dbcSMatthew G. Knepley       PetscInt        coneSize, supportSize, q, qf, qn, qp, v, e, s;
677cd0c2139SMatthew G Knepley 
678cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
679cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr);
680cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr);
681cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
682cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
683cd0c2139SMatthew G Knepley       if (dep == depth-1) {
6844c367dbcSMatthew G. Knepley         const PetscInt  hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
685cd0c2139SMatthew G Knepley         const PetscInt *supportF;
686cd0c2139SMatthew G Knepley 
687cd0c2139SMatthew G Knepley         /* Split face:       copy in old face to new face to start */
688cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(sdm, newp,  &supportF);CHKERRQ(ierr);
689cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr);
690cd0c2139SMatthew G Knepley         /* Split old face:   old vertices/edges in cone so no change */
691cd0c2139SMatthew G Knepley         /* Split new face:   new vertices/edges in cone */
692cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
6934c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
694cd0c2139SMatthew G Knepley 
6954c367dbcSMatthew G. Knepley           coneNew[2+q] = v + pMaxNew[dep-1];
696cd0c2139SMatthew G Knepley         }
697cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr);
698cd0c2139SMatthew G Knepley         ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr);
699e537020bSMatthew G. Knepley         /* Face support */
700cd0c2139SMatthew G Knepley         for (s = 0; s < supportSize; ++s) {
701cd0c2139SMatthew G Knepley           PetscInt val;
702cd0c2139SMatthew G Knepley 
703cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr);
704cd0c2139SMatthew G Knepley           if (val < 0) {
705cd0c2139SMatthew G Knepley             /* Split old face:   Replace negative side cell with cohesive cell */
7064c367dbcSMatthew G. Knepley              ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr);
707cd0c2139SMatthew G Knepley           } else {
708cd0c2139SMatthew G Knepley             /* Split new face:   Replace positive side cell with cohesive cell */
7094c367dbcSMatthew G. Knepley             ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr);
710e537020bSMatthew G. Knepley             /* Get orientation for cohesive face */
711e537020bSMatthew G. Knepley             {
712e537020bSMatthew G. Knepley               const PetscInt *ncone, *nconeO;
713e537020bSMatthew G. Knepley               PetscInt        nconeSize, nc;
714e537020bSMatthew G. Knepley 
715e537020bSMatthew G. Knepley               ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr);
716e537020bSMatthew G. Knepley               ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr);
717e537020bSMatthew G. Knepley               ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr);
718e537020bSMatthew G. Knepley               for (nc = 0; nc < nconeSize; ++nc) {
719e537020bSMatthew G. Knepley                 if (ncone[nc] == oldp) {
720e537020bSMatthew G. Knepley                   coneONew[0] = nconeO[nc];
721e537020bSMatthew G. Knepley                   break;
722cd0c2139SMatthew G Knepley                 }
723cd0c2139SMatthew G Knepley               }
724e537020bSMatthew G. Knepley               if (nc >= nconeSize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate face %d in neighboring cell %d", oldp, support[s]);
725e537020bSMatthew G. Knepley             }
726e537020bSMatthew G. Knepley           }
727e537020bSMatthew G. Knepley         }
7284c367dbcSMatthew G. Knepley         /* Cohesive cell:    Old and new split face, then new cohesive faces */
729fd4b9f15SMatthew G. Knepley         coneNew[0]  = newp;   /* Extracted negative side orientation above */
7304c367dbcSMatthew G. Knepley         coneNew[1]  = splitp;
7314c367dbcSMatthew G. Knepley         coneONew[1] = coneONew[0];
732e537020bSMatthew G. Knepley         for (q = 0; q < coneSize; ++q) {
7334c367dbcSMatthew G. Knepley           coneNew[2+q] += (pMaxNew[dep] - pMaxNew[dep-1]) + numSplitPoints[dep];
734e537020bSMatthew G. Knepley           coneONew[2+q] = 0;
735e537020bSMatthew G. Knepley         }
7364c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr);
7374c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr);
738cd0c2139SMatthew G Knepley       } else if (dep == 0) {
7394c367dbcSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
740cd0c2139SMatthew G Knepley 
741cd0c2139SMatthew G Knepley         /* Split old vertex: Edges in old split faces and new cohesive edge */
7424c367dbcSMatthew G. Knepley         for (e = 0, qn = 0; e < supportSize; ++e) {
743cd0c2139SMatthew G Knepley           PetscInt val;
744cd0c2139SMatthew G Knepley 
745cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
746cd0c2139SMatthew G Knepley           if ((val == 1) || (val == (shift + 1))) {
7474c367dbcSMatthew G. Knepley             supportNew[qn++] = support[e] + depthOffset[dep+1];
748cd0c2139SMatthew G Knepley           }
749cd0c2139SMatthew G Knepley         }
7504c367dbcSMatthew G. Knepley         supportNew[qn] = hybedge;
751cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
752cd0c2139SMatthew G Knepley         /* Split new vertex: Edges in new split faces and new cohesive edge */
7534c367dbcSMatthew G. Knepley         for (e = 0, qp = 0; e < supportSize; ++e) {
754cd0c2139SMatthew G Knepley           PetscInt val, edge;
755cd0c2139SMatthew G Knepley 
756cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
757cd0c2139SMatthew G Knepley           if (val == 1) {
7584c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
759cd0c2139SMatthew G Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
7604c367dbcSMatthew G. Knepley             supportNew[qp++] = edge + pMaxNew[dep+1];
761cd0c2139SMatthew G Knepley           } else if (val == -(shift + 1)) {
7624c367dbcSMatthew G. Knepley             supportNew[qp++] = support[e] + depthOffset[dep+1];
763cd0c2139SMatthew G Knepley           }
764cd0c2139SMatthew G Knepley         }
7654c367dbcSMatthew G. Knepley         supportNew[qp] = hybedge;
766cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr);
7674c367dbcSMatthew G. Knepley         /* Hybrid edge:    Old and new split vertex */
768cd0c2139SMatthew G Knepley         coneNew[0] = newp;
769cd0c2139SMatthew G Knepley         coneNew[1] = splitp;
7704c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr);
7714c367dbcSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
7724c367dbcSMatthew G. Knepley           PetscInt val, edge;
7734c367dbcSMatthew G. Knepley 
7744c367dbcSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
7754c367dbcSMatthew G. Knepley           if (val == 1) {
7764c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
7774c367dbcSMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
7784c367dbcSMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2];
7794c367dbcSMatthew G. Knepley           }
7804c367dbcSMatthew G. Knepley         }
7814c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr);
782cd0c2139SMatthew G Knepley       } else if (dep == dim-2) {
7834c367dbcSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
7844c367dbcSMatthew G. Knepley 
785cd0c2139SMatthew G Knepley         /* Split old edge:   old vertices in cone so no change */
786cd0c2139SMatthew G Knepley         /* Split new edge:   new vertices in cone */
787cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
7884c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
789cd0c2139SMatthew G Knepley 
7904c367dbcSMatthew G. Knepley           coneNew[q] = v + pMaxNew[dep-1];
791cd0c2139SMatthew G Knepley         }
792cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr);
793cd0c2139SMatthew G Knepley         /* Split old edge: Faces in positive side cells and old split faces */
794cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
795cd0c2139SMatthew G Knepley           PetscInt val;
796cd0c2139SMatthew G Knepley 
797cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
7984c367dbcSMatthew G. Knepley           if (val == dim-1) {
7994c367dbcSMatthew G. Knepley             supportNew[q++] = support[e] + depthOffset[dep+1];
8004c367dbcSMatthew G. Knepley           } else if (val == (shift + dim-1)) {
8014c367dbcSMatthew G. Knepley             supportNew[q++] = support[e] + depthOffset[dep+1];
802cd0c2139SMatthew G Knepley           }
803cd0c2139SMatthew G Knepley         }
804b279cd2aSMatthew G. Knepley         supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
805cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
806cd0c2139SMatthew G Knepley         /* Split new edge: Faces in negative side cells and new split faces */
807cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
808cd0c2139SMatthew G Knepley           PetscInt val, face;
809cd0c2139SMatthew G Knepley 
810cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
811cd0c2139SMatthew G Knepley           if (val == dim-1) {
8124c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
813cd0c2139SMatthew G Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]);
8144c367dbcSMatthew G. Knepley             supportNew[q++] = face + pMaxNew[dep+1];
815cd0c2139SMatthew G Knepley           } else if (val == -(shift + dim-1)) {
8164c367dbcSMatthew G. Knepley             supportNew[q++] = support[e] + depthOffset[dep+1];
817cd0c2139SMatthew G Knepley           }
818cd0c2139SMatthew G Knepley         }
819b279cd2aSMatthew G. Knepley         supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
820cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr);
8214c367dbcSMatthew G. Knepley         /* Hybrid face */
8224c367dbcSMatthew G. Knepley         coneNew[0] = newp;
8234c367dbcSMatthew G. Knepley         coneNew[1] = splitp;
8244c367dbcSMatthew G. Knepley         for (v = 0; v < coneSize; ++v) {
8254c367dbcSMatthew G. Knepley           PetscInt vertex;
8264c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr);
8274c367dbcSMatthew G. Knepley           if (vertex < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not a split vertex", support[e]);
8284c367dbcSMatthew G. Knepley           coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep];
8294c367dbcSMatthew G. Knepley         }
8304c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr);
8314c367dbcSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
8324c367dbcSMatthew G. Knepley           PetscInt val, face;
8334c367dbcSMatthew G. Knepley 
8344c367dbcSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
8354c367dbcSMatthew G. Knepley           if (val == dim-1) {
8364c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
8374c367dbcSMatthew G. Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]);
8384c367dbcSMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2];
8394c367dbcSMatthew G. Knepley           }
8404c367dbcSMatthew G. Knepley         }
8414c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr);
842cd0c2139SMatthew G Knepley       }
843cd0c2139SMatthew G Knepley     }
844cd0c2139SMatthew G Knepley   }
845cd0c2139SMatthew G Knepley   /* Step 6b: Replace split points in negative side cones */
846cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
847cd0c2139SMatthew G Knepley     PetscInt        dep = values[sp];
848cd0c2139SMatthew G Knepley     IS              pIS;
849cd0c2139SMatthew G Knepley     PetscInt        numPoints;
850cd0c2139SMatthew G Knepley     const PetscInt *points;
851cd0c2139SMatthew G Knepley 
852cd0c2139SMatthew G Knepley     if (dep >= 0) continue;
853cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr);
854cd0c2139SMatthew G Knepley     if (!pIS) continue;
855cd0c2139SMatthew G Knepley     dep  = -dep - shift;
856cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr);
857cd0c2139SMatthew G Knepley     ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr);
858cd0c2139SMatthew G Knepley     for (p = 0; p < numPoints; ++p) {
859cd0c2139SMatthew G Knepley       const PetscInt  oldp = points[p];
860cd0c2139SMatthew G Knepley       const PetscInt  newp = depthOffset[dep] + oldp;
861cd0c2139SMatthew G Knepley       const PetscInt *cone;
862cd0c2139SMatthew G Knepley       PetscInt        coneSize, c;
86350cf782dSMatthew G. Knepley       /* PetscBool       replaced = PETSC_FALSE; */
864cd0c2139SMatthew G Knepley 
865cd0c2139SMatthew G Knepley       /* Negative edge: replace split vertex */
866cd0c2139SMatthew G Knepley       /* Negative cell: replace split face */
867cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr);
868cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr);
869cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
870cd0c2139SMatthew G Knepley         const PetscInt coldp = cone[c] - depthOffset[dep-1];
871cd0c2139SMatthew G Knepley         PetscInt       csplitp, cp, val;
872cd0c2139SMatthew G Knepley 
873cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr);
874cd0c2139SMatthew G Knepley         if (val == dep-1) {
875cd0c2139SMatthew G Knepley           ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr);
876cd0c2139SMatthew G Knepley           if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1);
877cd0c2139SMatthew G Knepley           csplitp  = pMaxNew[dep-1] + cp;
878cd0c2139SMatthew G Knepley           ierr     = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr);
87950cf782dSMatthew G. Knepley           /* replaced = PETSC_TRUE; */
880cd0c2139SMatthew G Knepley         }
881cd0c2139SMatthew G Knepley       }
8824a189a86SMatthew G. Knepley       /* Cells with only a vertex or edge on the submesh have no replacement */
8834a189a86SMatthew G. Knepley       /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */
884cd0c2139SMatthew G Knepley     }
885cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr);
886cd0c2139SMatthew G Knepley     ierr = ISDestroy(&pIS);CHKERRQ(ierr);
887cd0c2139SMatthew G Knepley   }
888cd0c2139SMatthew G Knepley   /* Step 7: Stratify */
889cd0c2139SMatthew G Knepley   ierr = DMPlexStratify(sdm);CHKERRQ(ierr);
890cd0c2139SMatthew G Knepley   /* Step 8: Coordinates */
891cd0c2139SMatthew G Knepley   ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
892cd0c2139SMatthew G Knepley   ierr = DMPlexGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr);
893cd0c2139SMatthew G Knepley   ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr);
894cd0c2139SMatthew G Knepley   ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
895cd0c2139SMatthew G Knepley   for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) {
896cd0c2139SMatthew G Knepley     const PetscInt newp   = depthOffset[0] + splitPoints[0][v];
897cd0c2139SMatthew G Knepley     const PetscInt splitp = pMaxNew[0] + v;
898cd0c2139SMatthew G Knepley     PetscInt       dof, off, soff, d;
899cd0c2139SMatthew G Knepley 
900cd0c2139SMatthew G Knepley     ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr);
901cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr);
902cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr);
903cd0c2139SMatthew G Knepley     for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d];
904cd0c2139SMatthew G Knepley   }
905cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
906cd0c2139SMatthew G Knepley   /* Step 9: SF, if I can figure this out we can split the mesh in parallel */
907cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
908cd0c2139SMatthew G Knepley   /* Step 10: Labels */
909cd0c2139SMatthew G Knepley   ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
910cd0c2139SMatthew G Knepley   ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr);
911cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
912cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
913cd0c2139SMatthew G Knepley       const PetscInt newp   = depthOffset[dep] + splitPoints[dep][p];
914cd0c2139SMatthew G Knepley       const PetscInt splitp = pMaxNew[dep] + p;
915cd0c2139SMatthew G Knepley       PetscInt       l;
916cd0c2139SMatthew G Knepley 
917cd0c2139SMatthew G Knepley       for (l = 0; l < numLabels; ++l) {
918cd0c2139SMatthew G Knepley         DMLabel     mlabel;
919cd0c2139SMatthew G Knepley         const char *lname;
920cd0c2139SMatthew G Knepley         PetscInt    val;
9219a356370SMatthew G. Knepley         PetscBool   isDepth;
922cd0c2139SMatthew G Knepley 
923cd0c2139SMatthew G Knepley         ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr);
9249a356370SMatthew G. Knepley         ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr);
9259a356370SMatthew G. Knepley         if (isDepth) continue;
926cd0c2139SMatthew G Knepley         ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr);
927cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr);
928cd0c2139SMatthew G Knepley         if (val >= 0) {
929cd0c2139SMatthew G Knepley           ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr);
9309a356370SMatthew G. Knepley #if 0
9319a356370SMatthew G. Knepley           /* Do not put cohesive edges into the label */
932cd0c2139SMatthew G Knepley           if (dep == 0) {
9334c367dbcSMatthew G. Knepley             const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
934cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr);
9354c367dbcSMatthew G. Knepley           } else if (dep == dim-2) {
9364c367dbcSMatthew G. Knepley             const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
9374c367dbcSMatthew G. Knepley             ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr);
938cd0c2139SMatthew G Knepley           }
9394c367dbcSMatthew G. Knepley           /* Do not put cohesive faces into the label */
9409a356370SMatthew G. Knepley #endif
941cd0c2139SMatthew G Knepley         }
942cd0c2139SMatthew G Knepley       }
943cd0c2139SMatthew G Knepley     }
944cd0c2139SMatthew G Knepley   }
945cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
946cd0c2139SMatthew G Knepley     const PetscInt dep = values[sp];
947cd0c2139SMatthew G Knepley 
948cd0c2139SMatthew G Knepley     if ((dep < 0) || (dep > depth)) continue;
949cd0c2139SMatthew G Knepley     if (pointIS[dep]) {ierr = ISRestoreIndices(pointIS[dep], &splitPoints[dep]);CHKERRQ(ierr);}
950cd0c2139SMatthew G Knepley     ierr = ISDestroy(&pointIS[dep]);CHKERRQ(ierr);
951cd0c2139SMatthew G Knepley   }
952cd0c2139SMatthew G Knepley   if (label) {
953cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
954cd0c2139SMatthew G Knepley     ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
955cd0c2139SMatthew G Knepley   }
9560d4d4d06SMatthew G. Knepley   for (d = 0; d <= depth; ++d) {
9570d4d4d06SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr);
9580d4d4d06SMatthew G. Knepley     pMaxNew[d] = pEnd - numHybridPoints[d];
9590d4d4d06SMatthew G. Knepley   }
9600e49e2e2SMatthew G. Knepley   ierr = DMPlexSetHybridBounds(sdm, depth >= 0 ? pMaxNew[depth] : PETSC_DETERMINE, depth>1 ? pMaxNew[depth-1] : PETSC_DETERMINE, depth>2 ? pMaxNew[1] : PETSC_DETERMINE, depth >= 0 ? pMaxNew[0] : PETSC_DETERMINE);CHKERRQ(ierr);
961dcbb62e8SMatthew G. Knepley   ierr = PetscFree3(depthShift, depthOffset, pMaxNew);CHKERRQ(ierr);
962dcbb62e8SMatthew G. Knepley   ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr);
963607ab7a9SMatthew G. Knepley   ierr = PetscFree4(pointIS, numSplitPoints, numHybridPoints, splitPoints);CHKERRQ(ierr);
964cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
965cd0c2139SMatthew G Knepley }
966cd0c2139SMatthew G Knepley 
967cd0c2139SMatthew G Knepley #undef __FUNCT__
968cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells"
969cd0c2139SMatthew G Knepley /*@C
970cd0c2139SMatthew G Knepley   DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface
971cd0c2139SMatthew G Knepley 
972cd0c2139SMatthew G Knepley   Collective on dm
973cd0c2139SMatthew G Knepley 
974cd0c2139SMatthew G Knepley   Input Parameters:
975cd0c2139SMatthew G Knepley + dm - The original DM
97653156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated)
977cd0c2139SMatthew G Knepley 
978cd0c2139SMatthew G Knepley   Output Parameters:
979cd0c2139SMatthew G Knepley - dmSplit - The new DM
980cd0c2139SMatthew G Knepley 
981cd0c2139SMatthew G Knepley   Level: developer
982cd0c2139SMatthew G Knepley 
9832be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete()
984cd0c2139SMatthew G Knepley @*/
985cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit)
986cd0c2139SMatthew G Knepley {
987cd0c2139SMatthew G Knepley   DM             sdm;
988cd0c2139SMatthew G Knepley   PetscInt       dim;
989cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
990cd0c2139SMatthew G Knepley 
991cd0c2139SMatthew G Knepley   PetscFunctionBegin;
992cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
99353156dfcSMatthew G. Knepley   PetscValidPointer(dmSplit, 3);
994cd0c2139SMatthew G Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr);
995cd0c2139SMatthew G Knepley   ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr);
996cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
997cd0c2139SMatthew G Knepley   ierr = DMPlexSetDimension(sdm, dim);CHKERRQ(ierr);
998cd0c2139SMatthew G Knepley   switch (dim) {
999cd0c2139SMatthew G Knepley   case 2:
1000cd0c2139SMatthew G Knepley   case 3:
1001cd0c2139SMatthew G Knepley     ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr);
1002cd0c2139SMatthew G Knepley     break;
1003cd0c2139SMatthew G Knepley   default:
1004cd0c2139SMatthew G Knepley     SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim);
1005cd0c2139SMatthew G Knepley   }
1006cd0c2139SMatthew G Knepley   *dmSplit = sdm;
1007cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1008cd0c2139SMatthew G Knepley }
1009cd0c2139SMatthew G Knepley 
1010cd0c2139SMatthew G Knepley #undef __FUNCT__
10112be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete"
1012cd0c2139SMatthew G Knepley /*@
10132be2b188SMatthew G Knepley   DMPlexLabelCohesiveComplete - Starting with a label marking vertices on an internal surface, we add all other mesh pieces
1014cd0c2139SMatthew G Knepley   to complete the surface
1015cd0c2139SMatthew G Knepley 
1016cd0c2139SMatthew G Knepley   Input Parameters:
1017cd0c2139SMatthew G Knepley + dm - The DM
101847946fd8SMatthew G. Knepley . label - A DMLabel marking the surface vertices
1019bb55d314SMatthew G. Knepley . flip  - Flag to flip the submesh normal and replace points on the other side
102047946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL
1021cd0c2139SMatthew G Knepley 
1022cd0c2139SMatthew G Knepley   Output Parameter:
1023cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points
1024cd0c2139SMatthew G Knepley 
1025cd0c2139SMatthew G Knepley   Level: developer
1026cd0c2139SMatthew G Knepley 
10272be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete()
1028cd0c2139SMatthew G Knepley @*/
1029bb55d314SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, PetscBool flip, DM subdm)
1030cd0c2139SMatthew G Knepley {
1031d90583fdSMatthew G. Knepley   DMLabel         depthLabel;
103247946fd8SMatthew G. Knepley   IS              dimIS, subpointIS;
103347946fd8SMatthew G. Knepley   const PetscInt *points, *subpoints;
1034bb55d314SMatthew G. Knepley   const PetscInt  rev   = flip ? -1 : 1;
103547946fd8SMatthew G. Knepley   PetscInt        shift = 100, dim, dep, cStart, cEnd, numPoints, numSubpoints, p, val;
1036cd0c2139SMatthew G Knepley   PetscErrorCode  ierr;
1037cd0c2139SMatthew G Knepley 
1038cd0c2139SMatthew G Knepley   PetscFunctionBegin;
1039d90583fdSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr);
1040cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
104147946fd8SMatthew G. Knepley   if (subdm) {
104247946fd8SMatthew G. Knepley     ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr);
104347946fd8SMatthew G. Knepley     if (subpointIS) {
104447946fd8SMatthew G. Knepley       ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr);
104547946fd8SMatthew G. Knepley       ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr);
104647946fd8SMatthew G. Knepley     }
104747946fd8SMatthew G. Knepley   }
1048d7c8f101SMatthew G. Knepley   /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */
1049cd0c2139SMatthew G Knepley   ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr);
1050cd0c2139SMatthew G Knepley   if (!dimIS) PetscFunctionReturn(0);
1051cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1052cd0c2139SMatthew G Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1053d7c8f101SMatthew G. Knepley   for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */
1054cd0c2139SMatthew G Knepley     const PetscInt *support;
1055cd0c2139SMatthew G Knepley     PetscInt        supportSize, s;
1056cd0c2139SMatthew G Knepley 
1057cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr);
1058cd0c2139SMatthew G Knepley     if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize);
1059cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr);
1060cd0c2139SMatthew G Knepley     for (s = 0; s < supportSize; ++s) {
1061cd0c2139SMatthew G Knepley       const PetscInt *cone, *ornt;
1062cd0c2139SMatthew G Knepley       PetscInt        coneSize, c;
1063cd0c2139SMatthew G Knepley       PetscBool       pos = PETSC_TRUE;
1064cd0c2139SMatthew G Knepley 
1065cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
1066cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
1067cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr);
1068cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
1069cd0c2139SMatthew G Knepley         if (cone[c] == points[p]) {
107047946fd8SMatthew G. Knepley           PetscInt o = ornt[c];
107147946fd8SMatthew G. Knepley 
107247946fd8SMatthew G. Knepley           if (subdm) {
107347946fd8SMatthew G. Knepley             const PetscInt *subcone, *subornt;
107447946fd8SMatthew G. Knepley             PetscInt        subpoint, subface, subconeSize, sc;
107547946fd8SMatthew G. Knepley 
107647946fd8SMatthew G. Knepley             ierr = PetscFindInt(support[s], numSubpoints, subpoints, &subpoint);CHKERRQ(ierr);
107747946fd8SMatthew G. Knepley             ierr = PetscFindInt(points[p],  numSubpoints, subpoints, &subface);CHKERRQ(ierr);
107847946fd8SMatthew G. Knepley             ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
107947946fd8SMatthew G. Knepley             ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr);
108047946fd8SMatthew G. Knepley             ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr);
108147946fd8SMatthew G. Knepley             for (sc = 0; sc < subconeSize; ++sc) {
108247946fd8SMatthew G. Knepley               if (subcone[sc] == subface) {
108347946fd8SMatthew G. Knepley                 o = subornt[0];
108447946fd8SMatthew G. Knepley                 break;
108547946fd8SMatthew G. Knepley               }
108647946fd8SMatthew G. Knepley             }
108747946fd8SMatthew G. Knepley             if (sc >= subconeSize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find point %d in cone for subpoint %d", points[p], subpoint);
108847946fd8SMatthew G. Knepley           }
108947946fd8SMatthew G. Knepley           if (o >= 0) {
1090bb55d314SMatthew G. Knepley             ierr = DMLabelSetValue(label, support[s],  rev*(shift+dim));CHKERRQ(ierr);
1091ffaa4bbcSMatthew G. Knepley             pos  = rev > 0 ? PETSC_TRUE : PETSC_FALSE;
1092cd0c2139SMatthew G Knepley           } else {
1093bb55d314SMatthew G. Knepley             ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);
1094ffaa4bbcSMatthew G. Knepley             pos  = rev > 0 ? PETSC_FALSE : PETSC_TRUE;
1095cd0c2139SMatthew G Knepley           }
1096cd0c2139SMatthew G Knepley           break;
1097cd0c2139SMatthew G Knepley         }
1098cd0c2139SMatthew G Knepley       }
1099cd0c2139SMatthew 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]);
1100cd0c2139SMatthew G Knepley       /* Put faces touching the fault in the label */
1101cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
1102cd0c2139SMatthew G Knepley         const PetscInt point = cone[c];
1103cd0c2139SMatthew G Knepley 
1104cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1105cd0c2139SMatthew G Knepley         if (val == -1) {
1106cd0c2139SMatthew G Knepley           PetscInt *closure = NULL;
1107cd0c2139SMatthew G Knepley           PetscInt  closureSize, cl;
1108cd0c2139SMatthew G Knepley 
1109cd0c2139SMatthew G Knepley           ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1110cd0c2139SMatthew G Knepley           for (cl = 0; cl < closureSize*2; cl += 2) {
1111cd0c2139SMatthew G Knepley             const PetscInt clp = closure[cl];
1112cd0c2139SMatthew G Knepley 
1113cd0c2139SMatthew G Knepley             ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr);
1114cd0c2139SMatthew G Knepley             if ((val >= 0) && (val < dim-1)) {
1115cd0c2139SMatthew G Knepley               ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr);
1116cd0c2139SMatthew G Knepley               break;
1117cd0c2139SMatthew G Knepley             }
1118cd0c2139SMatthew G Knepley           }
1119cd0c2139SMatthew G Knepley           ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1120cd0c2139SMatthew G Knepley         }
1121cd0c2139SMatthew G Knepley       }
1122cd0c2139SMatthew G Knepley     }
1123cd0c2139SMatthew G Knepley   }
112447946fd8SMatthew G. Knepley   if (subdm) {
112547946fd8SMatthew G. Knepley     if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);}
112647946fd8SMatthew G. Knepley     ierr = ISDestroy(&subpointIS);CHKERRQ(ierr);
112747946fd8SMatthew G. Knepley   }
1128cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
1129cd0c2139SMatthew G Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
1130cd0c2139SMatthew G Knepley   /* Search for other cells/faces/edges connected to the fault by a vertex */
1131cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
1132cd0c2139SMatthew G Knepley   ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr);
1133cd0c2139SMatthew G Knepley   if (!dimIS) PetscFunctionReturn(0);
1134cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1135cd0c2139SMatthew G Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1136d7c8f101SMatthew G. Knepley   for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */
1137cd0c2139SMatthew G Knepley     PetscInt *star = NULL;
1138cd0c2139SMatthew G Knepley     PetscInt  starSize, s;
1139cd0c2139SMatthew G Knepley     PetscInt  again = 1;  /* 0: Finished 1: Keep iterating after a change 2: No change */
1140cd0c2139SMatthew G Knepley 
1141d4622b2cSMatthew G. Knepley     /* All points connected to the fault are inside a cell, so at the top level we will only check cells */
1142cd0c2139SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1143cd0c2139SMatthew G Knepley     while (again) {
1144cd0c2139SMatthew G Knepley       if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault");
1145cd0c2139SMatthew G Knepley       again = 0;
1146cd0c2139SMatthew G Knepley       for (s = 0; s < starSize*2; s += 2) {
1147cd0c2139SMatthew G Knepley         const PetscInt  point = star[s];
1148cd0c2139SMatthew G Knepley         const PetscInt *cone;
1149cd0c2139SMatthew G Knepley         PetscInt        coneSize, c;
1150cd0c2139SMatthew G Knepley 
1151cd0c2139SMatthew G Knepley         if ((point < cStart) || (point >= cEnd)) continue;
1152cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1153cd0c2139SMatthew G Knepley         if (val != -1) continue;
1154d4622b2cSMatthew G. Knepley         again = again == 1 ? 1 : 2;
1155cd0c2139SMatthew G Knepley         ierr  = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
1156cd0c2139SMatthew G Knepley         ierr  = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
1157cd0c2139SMatthew G Knepley         for (c = 0; c < coneSize; ++c) {
1158cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr);
1159cd0c2139SMatthew G Knepley           if (val != -1) {
1160d7c8f101SMatthew G. Knepley             const PetscInt *ccone;
1161*166d9d0cSMatthew G. Knepley             PetscInt        cconeSize, cc, side;
1162d7c8f101SMatthew G. Knepley 
1163cd0c2139SMatthew 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);
116437a6de01SMatthew G. Knepley             if (val > 0) side =  1;
116537a6de01SMatthew G. Knepley             else         side = -1;
116637a6de01SMatthew G. Knepley             ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr);
1167d7c8f101SMatthew G. Knepley             /* Mark cell faces which touch the fault */
1168d7c8f101SMatthew G. Knepley             ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr);
1169d7c8f101SMatthew G. Knepley             ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr);
1170d7c8f101SMatthew G. Knepley             for (cc = 0; cc < cconeSize; ++cc) {
1171d7c8f101SMatthew G. Knepley               PetscInt *closure = NULL;
1172d7c8f101SMatthew G. Knepley               PetscInt  closureSize, cl;
1173d7c8f101SMatthew G. Knepley 
1174*166d9d0cSMatthew G. Knepley               ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr);
1175*166d9d0cSMatthew G. Knepley               if (val != -1) continue;
1176d7c8f101SMatthew G. Knepley               ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1177d4622b2cSMatthew G. Knepley               for (cl = 0; cl < closureSize*2; cl += 2) {
1178d7c8f101SMatthew G. Knepley                 const PetscInt clp = closure[cl];
1179d7c8f101SMatthew G. Knepley 
1180d7c8f101SMatthew G. Knepley                 ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr);
1181d7c8f101SMatthew G. Knepley                 if (val == -1) continue;
1182d7c8f101SMatthew G. Knepley                 ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr);
118337a6de01SMatthew G. Knepley                 break;
118437a6de01SMatthew G. Knepley               }
1185d7c8f101SMatthew G. Knepley               ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
118637a6de01SMatthew G. Knepley             }
1187cd0c2139SMatthew G Knepley             again = 1;
1188cd0c2139SMatthew G Knepley             break;
1189cd0c2139SMatthew G Knepley           }
1190cd0c2139SMatthew G Knepley         }
1191cd0c2139SMatthew G Knepley       }
1192cd0c2139SMatthew G Knepley     }
1193cd0c2139SMatthew G Knepley     /* Classify the rest by cell membership */
1194cd0c2139SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1195cd0c2139SMatthew G Knepley       const PetscInt point = star[s];
1196cd0c2139SMatthew G Knepley 
1197cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1198cd0c2139SMatthew G Knepley       if (val == -1) {
1199cd0c2139SMatthew G Knepley         PetscInt  *sstar = NULL;
1200cd0c2139SMatthew G Knepley         PetscInt   sstarSize, ss;
1201cd0c2139SMatthew G Knepley         PetscBool  marked = PETSC_FALSE;
1202cd0c2139SMatthew G Knepley 
1203cd0c2139SMatthew G Knepley         ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr);
1204cd0c2139SMatthew G Knepley         for (ss = 0; ss < sstarSize*2; ss += 2) {
1205cd0c2139SMatthew G Knepley           const PetscInt spoint = sstar[ss];
1206cd0c2139SMatthew G Knepley 
1207cd0c2139SMatthew G Knepley           if ((spoint < cStart) || (spoint >= cEnd)) continue;
1208cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr);
1209cd0c2139SMatthew 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);
1210d90583fdSMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr);
1211cd0c2139SMatthew G Knepley           if (val > 0) {
1212cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, point,   shift+dep);CHKERRQ(ierr);
1213cd0c2139SMatthew G Knepley           } else {
1214cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr);
1215cd0c2139SMatthew G Knepley           }
1216cd0c2139SMatthew G Knepley           marked = PETSC_TRUE;
1217cd0c2139SMatthew G Knepley           break;
1218cd0c2139SMatthew G Knepley         }
1219cd0c2139SMatthew G Knepley         ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr);
1220cd0c2139SMatthew G Knepley         if (!marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point);
1221cd0c2139SMatthew G Knepley       }
1222cd0c2139SMatthew G Knepley     }
1223cd0c2139SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1224cd0c2139SMatthew G Knepley   }
1225cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
1226cd0c2139SMatthew G Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
1227cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1228cd0c2139SMatthew G Knepley }
1229cd0c2139SMatthew G Knepley 
1230cd0c2139SMatthew G Knepley #undef __FUNCT__
12313cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh"
12323cf72582SMatthew G. Knepley /*@C
12333cf72582SMatthew G. Knepley   DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface
12343cf72582SMatthew G. Knepley 
12353cf72582SMatthew G. Knepley   Collective on dm
12363cf72582SMatthew G. Knepley 
12373cf72582SMatthew G. Knepley   Input Parameters:
12383cf72582SMatthew G. Knepley + dm - The original DM
12393cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices
12403cf72582SMatthew G. Knepley 
12413cf72582SMatthew G. Knepley   Output Parameters:
12423cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface
12433cf72582SMatthew G. Knepley - dmHybrid - The new DM
12443cf72582SMatthew G. Knepley 
12453cf72582SMatthew G. Knepley   Level: developer
12463cf72582SMatthew G. Knepley 
12473cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate()
12483cf72582SMatthew G. Knepley @*/
12493cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid)
12503cf72582SMatthew G. Knepley {
12513cf72582SMatthew G. Knepley   DM             idm;
12523cf72582SMatthew G. Knepley   DMLabel        subpointMap, hlabel;
12533cf72582SMatthew G. Knepley   PetscInt       dim;
12543cf72582SMatthew G. Knepley   PetscErrorCode ierr;
12553cf72582SMatthew G. Knepley 
12563cf72582SMatthew G. Knepley   PetscFunctionBegin;
12573cf72582SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
12583cf72582SMatthew G. Knepley   if (hybridLabel) PetscValidPointer(hybridLabel, 3);
12593cf72582SMatthew G. Knepley   PetscValidPointer(dmHybrid, 4);
12603cf72582SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
12613cf72582SMatthew G. Knepley   ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr);
12623cf72582SMatthew G. Knepley   ierr = DMPlexOrient(idm);CHKERRQ(ierr);
12633cf72582SMatthew G. Knepley   ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr);
12643cf72582SMatthew G. Knepley   ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr);
12653cf72582SMatthew G. Knepley   ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr);
12663cf72582SMatthew G. Knepley   ierr = DMPlexLabelCohesiveComplete(dm, hlabel, PETSC_FALSE, idm);CHKERRQ(ierr);
12673cf72582SMatthew G. Knepley   ierr = DMDestroy(&idm);CHKERRQ(ierr);
12683cf72582SMatthew G. Knepley   ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr);
12693cf72582SMatthew G. Knepley   if (hybridLabel) *hybridLabel = hlabel;
127053aa2e23SMatthew G. Knepley   else             {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);}
12713cf72582SMatthew G. Knepley   PetscFunctionReturn(0);
12723cf72582SMatthew G. Knepley }
12733cf72582SMatthew G. Knepley 
12743cf72582SMatthew G. Knepley #undef __FUNCT__
1275efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated"
1276efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that:
1277efa14ee0SMatthew G Knepley 
1278efa14ee0SMatthew G Knepley      For any marked cell, the marked vertices constitute a single face
1279efa14ee0SMatthew G Knepley */
1280830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm)
1281efa14ee0SMatthew G Knepley {
1282fed694aaSMatthew G. Knepley   IS               subvertexIS = NULL;
1283efa14ee0SMatthew G Knepley   const PetscInt  *subvertices;
128477d178adSMatthew G. Knepley   PetscInt        *pStart, *pEnd, *pMax, pSize;
1285efa14ee0SMatthew G Knepley   PetscInt         depth, dim, d, numSubVerticesInitial = 0, v;
1286efa14ee0SMatthew G Knepley   PetscErrorCode   ierr;
1287efa14ee0SMatthew G Knepley 
1288efa14ee0SMatthew G Knepley   PetscFunctionBegin;
1289efa14ee0SMatthew G Knepley   *numFaces = 0;
1290efa14ee0SMatthew G Knepley   *nFV      = 0;
1291efa14ee0SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1292efa14ee0SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
129377d178adSMatthew G. Knepley   pSize = PetscMax(depth, dim) + 1;
129477d178adSMatthew G. Knepley   ierr = PetscMalloc3(pSize,PetscInt,&pStart,pSize,PetscInt,&pEnd,pSize,PetscInt,&pMax);CHKERRQ(ierr);
1295d92e47f8SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &pMax[depth] : NULL, depth>1 ? &pMax[depth-1] : NULL, depth>2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr);
1296efa14ee0SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
1297efa14ee0SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1298efa14ee0SMatthew G Knepley     if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]);
1299efa14ee0SMatthew G Knepley   }
1300efa14ee0SMatthew G Knepley   /* Loop over initial vertices and mark all faces in the collective star() */
1301fed694aaSMatthew G. Knepley   if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);}
1302efa14ee0SMatthew G Knepley   if (subvertexIS) {
1303efa14ee0SMatthew G Knepley     ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr);
1304efa14ee0SMatthew G Knepley     ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1305efa14ee0SMatthew G Knepley   }
1306efa14ee0SMatthew G Knepley   for (v = 0; v < numSubVerticesInitial; ++v) {
1307efa14ee0SMatthew G Knepley     const PetscInt vertex = subvertices[v];
13080298fd71SBarry Smith     PetscInt      *star   = NULL;
1309efa14ee0SMatthew G Knepley     PetscInt       starSize, s, numCells = 0, c;
1310efa14ee0SMatthew G Knepley 
1311efa14ee0SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1312efa14ee0SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1313efa14ee0SMatthew G Knepley       const PetscInt point = star[s];
1314efa14ee0SMatthew G Knepley       if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point;
1315efa14ee0SMatthew G Knepley     }
1316efa14ee0SMatthew G Knepley     for (c = 0; c < numCells; ++c) {
1317efa14ee0SMatthew G Knepley       const PetscInt cell    = star[c];
13180298fd71SBarry Smith       PetscInt      *closure = NULL;
1319efa14ee0SMatthew G Knepley       PetscInt       closureSize, cl;
1320efa14ee0SMatthew G Knepley       PetscInt       cellLoc, numCorners = 0, faceSize = 0;
1321efa14ee0SMatthew G Knepley 
1322efa14ee0SMatthew G Knepley       ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr);
132365560c7fSMatthew G Knepley       if (cellLoc == 2) continue;
132482f516ccSBarry Smith       if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc);
1325efa14ee0SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1326efa14ee0SMatthew G Knepley       for (cl = 0; cl < closureSize*2; cl += 2) {
1327efa14ee0SMatthew G Knepley         const PetscInt point = closure[cl];
1328efa14ee0SMatthew G Knepley         PetscInt       vertexLoc;
1329efa14ee0SMatthew G Knepley 
1330efa14ee0SMatthew G Knepley         if ((point >= pStart[0]) && (point < pEnd[0])) {
1331efa14ee0SMatthew G Knepley           ++numCorners;
1332efa14ee0SMatthew G Knepley           ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr);
1333830e53efSMatthew G. Knepley           if (vertexLoc == value) closure[faceSize++] = point;
1334efa14ee0SMatthew G Knepley         }
1335efa14ee0SMatthew G Knepley       }
133618ad9376SMatthew G. Knepley       if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);}
133782f516ccSBarry 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);
1338efa14ee0SMatthew G Knepley       if (faceSize == *nFV) {
1339007baee2SMatthew G. Knepley         const PetscInt *cells = NULL;
1340007baee2SMatthew G. Knepley         PetscInt        numCells, nc;
1341007baee2SMatthew G. Knepley 
1342efa14ee0SMatthew G Knepley         ++(*numFaces);
1343efa14ee0SMatthew G Knepley         for (cl = 0; cl < faceSize; ++cl) {
1344efa14ee0SMatthew G Knepley           ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr);
1345efa14ee0SMatthew G Knepley         }
1346007baee2SMatthew G. Knepley         ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr);
1347007baee2SMatthew G. Knepley         for (nc = 0; nc < numCells; ++nc) {
1348007baee2SMatthew G. Knepley           ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr);
1349007baee2SMatthew G. Knepley         }
1350007baee2SMatthew G. Knepley         ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr);
1351efa14ee0SMatthew G Knepley       }
1352efa14ee0SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1353efa14ee0SMatthew G Knepley     }
1354efa14ee0SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1355efa14ee0SMatthew G Knepley   }
1356efa14ee0SMatthew G Knepley   if (subvertexIS) {
1357efa14ee0SMatthew G Knepley     ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1358efa14ee0SMatthew G Knepley   }
1359efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
1360efa14ee0SMatthew G Knepley   ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr);
1361efa14ee0SMatthew G Knepley   PetscFunctionReturn(0);
1362efa14ee0SMatthew G Knepley }
1363efa14ee0SMatthew G Knepley 
1364efa14ee0SMatthew G Knepley #undef __FUNCT__
1365efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated"
1366830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm)
1367efa14ee0SMatthew G Knepley {
1368efa14ee0SMatthew G Knepley   IS               subvertexIS;
1369efa14ee0SMatthew G Knepley   const PetscInt  *subvertices;
1370efa14ee0SMatthew G Knepley   PetscInt        *pStart, *pEnd, *pMax;
1371efa14ee0SMatthew G Knepley   PetscInt         dim, d, numSubVerticesInitial = 0, v;
1372efa14ee0SMatthew G Knepley   PetscErrorCode   ierr;
1373efa14ee0SMatthew G Knepley 
1374efa14ee0SMatthew G Knepley   PetscFunctionBegin;
1375efa14ee0SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
1376efa14ee0SMatthew G Knepley   ierr = PetscMalloc3(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd,dim+1,PetscInt,&pMax);CHKERRQ(ierr);
13770298fd71SBarry Smith   ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr);
1378efa14ee0SMatthew G Knepley   for (d = 0; d <= dim; ++d) {
1379efa14ee0SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1380efa14ee0SMatthew G Knepley     if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]);
1381efa14ee0SMatthew G Knepley   }
1382efa14ee0SMatthew G Knepley   /* Loop over initial vertices and mark all faces in the collective star() */
1383830e53efSMatthew G. Knepley   ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);
1384efa14ee0SMatthew G Knepley   if (subvertexIS) {
1385efa14ee0SMatthew G Knepley     ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr);
1386efa14ee0SMatthew G Knepley     ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1387efa14ee0SMatthew G Knepley   }
1388efa14ee0SMatthew G Knepley   for (v = 0; v < numSubVerticesInitial; ++v) {
1389efa14ee0SMatthew G Knepley     const PetscInt vertex = subvertices[v];
13900298fd71SBarry Smith     PetscInt      *star   = NULL;
1391efa14ee0SMatthew G Knepley     PetscInt       starSize, s, numFaces = 0, f;
1392efa14ee0SMatthew G Knepley 
1393efa14ee0SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1394efa14ee0SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1395efa14ee0SMatthew G Knepley       const PetscInt point = star[s];
1396efa14ee0SMatthew G Knepley       if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point;
1397efa14ee0SMatthew G Knepley     }
1398efa14ee0SMatthew G Knepley     for (f = 0; f < numFaces; ++f) {
1399efa14ee0SMatthew G Knepley       const PetscInt face    = star[f];
14000298fd71SBarry Smith       PetscInt      *closure = NULL;
1401efa14ee0SMatthew G Knepley       PetscInt       closureSize, c;
1402efa14ee0SMatthew G Knepley       PetscInt       faceLoc;
1403efa14ee0SMatthew G Knepley 
1404efa14ee0SMatthew G Knepley       ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr);
1405efa14ee0SMatthew G Knepley       if (faceLoc == dim-1) continue;
140682f516ccSBarry Smith       if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc);
1407efa14ee0SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1408efa14ee0SMatthew G Knepley       for (c = 0; c < closureSize*2; c += 2) {
1409efa14ee0SMatthew G Knepley         const PetscInt point = closure[c];
1410efa14ee0SMatthew G Knepley         PetscInt       vertexLoc;
1411efa14ee0SMatthew G Knepley 
1412efa14ee0SMatthew G Knepley         if ((point >= pStart[0]) && (point < pEnd[0])) {
1413efa14ee0SMatthew G Knepley           ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr);
1414830e53efSMatthew G. Knepley           if (vertexLoc != value) break;
1415efa14ee0SMatthew G Knepley         }
1416efa14ee0SMatthew G Knepley       }
1417efa14ee0SMatthew G Knepley       if (c == closureSize*2) {
1418efa14ee0SMatthew G Knepley         const PetscInt *support;
1419efa14ee0SMatthew G Knepley         PetscInt        supportSize, s;
1420efa14ee0SMatthew G Knepley 
1421efa14ee0SMatthew G Knepley         for (c = 0; c < closureSize*2; c += 2) {
1422efa14ee0SMatthew G Knepley           const PetscInt point = closure[c];
1423efa14ee0SMatthew G Knepley 
1424efa14ee0SMatthew G Knepley           for (d = 0; d < dim; ++d) {
1425efa14ee0SMatthew G Knepley             if ((point >= pStart[d]) && (point < pEnd[d])) {
1426efa14ee0SMatthew G Knepley               ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr);
1427efa14ee0SMatthew G Knepley               break;
1428efa14ee0SMatthew G Knepley             }
1429efa14ee0SMatthew G Knepley           }
1430efa14ee0SMatthew G Knepley         }
1431efa14ee0SMatthew G Knepley         ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr);
1432efa14ee0SMatthew G Knepley         ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr);
1433efa14ee0SMatthew G Knepley         for (s = 0; s < supportSize; ++s) {
1434efa14ee0SMatthew G Knepley           ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr);
1435efa14ee0SMatthew G Knepley         }
1436efa14ee0SMatthew G Knepley       }
1437efa14ee0SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1438efa14ee0SMatthew G Knepley     }
1439efa14ee0SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1440efa14ee0SMatthew G Knepley   }
1441efa14ee0SMatthew G Knepley   if (subvertexIS) {
1442efa14ee0SMatthew G Knepley     ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1443efa14ee0SMatthew G Knepley   }
1444efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
1445efa14ee0SMatthew G Knepley   ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr);
1446efa14ee0SMatthew G Knepley   PetscFunctionReturn(0);
1447efa14ee0SMatthew G Knepley }
1448efa14ee0SMatthew G Knepley 
1449efa14ee0SMatthew G Knepley #undef __FUNCT__
1450766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated"
145127c04023SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char labelname[], PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, PetscInt *subCells[], DM subdm)
1452766ab985SMatthew G. Knepley {
145327c04023SMatthew G. Knepley   DMLabel         label = NULL;
1454766ab985SMatthew G. Knepley   const PetscInt *cone;
145527234c99SMatthew G. Knepley   PetscInt        dim, cMax, cEnd, c, subc = 0, p, coneSize;
1456766ab985SMatthew G. Knepley   PetscErrorCode  ierr;
1457766ab985SMatthew G. Knepley 
1458812bfc34SJed Brown   PetscFunctionBegin;
1459c0ed958bSJed Brown   *numFaces = 0;
1460c0ed958bSJed Brown   *nFV = 0;
1461b6d5cb33SJed Brown   if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);}
1462fed694aaSMatthew G. Knepley   *subCells = NULL;
1463766ab985SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
1464766ab985SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
1465766ab985SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
1466766ab985SMatthew G. Knepley   if (cMax < 0) PetscFunctionReturn(0);
146727c04023SMatthew G. Knepley   if (label) {
146827c04023SMatthew G. Knepley     for (c = cMax; c < cEnd; ++c) {
146927c04023SMatthew G. Knepley       PetscInt val;
147027c04023SMatthew G. Knepley 
147127c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
147227c04023SMatthew G. Knepley       if (val == value) {
147327c04023SMatthew G. Knepley         ++(*numFaces);
147427c04023SMatthew G. Knepley         ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
147527c04023SMatthew G. Knepley       }
147627c04023SMatthew G. Knepley     }
147727c04023SMatthew G. Knepley   } else {
1478766ab985SMatthew G. Knepley     *numFaces = cEnd - cMax;
147927c04023SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr);
148027c04023SMatthew G. Knepley   }
1481766ab985SMatthew G. Knepley   *nFV = hasLagrange ? coneSize/3 : coneSize/2;
1482766ab985SMatthew G. Knepley   ierr = PetscMalloc(*numFaces *2 * sizeof(PetscInt), subCells);CHKERRQ(ierr);
1483766ab985SMatthew G. Knepley   for (c = cMax; c < cEnd; ++c) {
1484766ab985SMatthew G. Knepley     const PetscInt *cells;
1485766ab985SMatthew G. Knepley     PetscInt        numCells;
1486766ab985SMatthew G. Knepley 
148727c04023SMatthew G. Knepley     if (label) {
148827c04023SMatthew G. Knepley       PetscInt val;
148927c04023SMatthew G. Knepley 
149027c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
149127c04023SMatthew G. Knepley       if (val != value) continue;
149227c04023SMatthew G. Knepley     }
1493766ab985SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
1494766ab985SMatthew G. Knepley     for (p = 0; p < *nFV; ++p) {
1495766ab985SMatthew G. Knepley       ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr);
1496766ab985SMatthew G. Knepley     }
1497766ab985SMatthew G. Knepley     /* Negative face */
1498766ab985SMatthew G. Knepley     ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr);
149927234c99SMatthew G. Knepley     /* Not true in parallel
150027234c99SMatthew G. Knepley     if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */
1501766ab985SMatthew G. Knepley     for (p = 0; p < numCells; ++p) {
1502766ab985SMatthew G. Knepley       ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr);
150327234c99SMatthew G. Knepley       (*subCells)[subc++] = cells[p];
1504766ab985SMatthew G. Knepley     }
1505766ab985SMatthew G. Knepley     ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr);
1506766ab985SMatthew G. Knepley     /* Positive face is not included */
1507766ab985SMatthew G. Knepley   }
1508766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
1509766ab985SMatthew G. Knepley }
1510766ab985SMatthew G. Knepley 
1511766ab985SMatthew G. Knepley #undef __FUNCT__
1512766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated"
151327c04023SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, PetscBool hasLagrange, const char labelname[], PetscInt value, DMLabel subpointMap, DM subdm)
1514766ab985SMatthew G. Knepley {
151527c04023SMatthew G. Knepley   DMLabel        label = NULL;
1516766ab985SMatthew G. Knepley   PetscInt      *pStart, *pEnd;
1517766ab985SMatthew G. Knepley   PetscInt       dim, cMax, cEnd, c, d;
1518766ab985SMatthew G. Knepley   PetscErrorCode ierr;
1519766ab985SMatthew G. Knepley 
1520812bfc34SJed Brown   PetscFunctionBegin;
152127c04023SMatthew G. Knepley   if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);}
1522766ab985SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
1523766ab985SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
1524766ab985SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
1525766ab985SMatthew G. Knepley   if (cMax < 0) PetscFunctionReturn(0);
1526766ab985SMatthew G. Knepley   ierr = PetscMalloc2(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd);CHKERRQ(ierr);
1527766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
1528766ab985SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1529766ab985SMatthew G. Knepley   }
1530766ab985SMatthew G. Knepley   for (c = cMax; c < cEnd; ++c) {
1531766ab985SMatthew G. Knepley     const PetscInt *cone;
1532766ab985SMatthew G. Knepley     PetscInt       *closure = NULL;
1533766ab985SMatthew G. Knepley     PetscInt        coneSize, closureSize, cl;
1534766ab985SMatthew G. Knepley 
153527c04023SMatthew G. Knepley     if (label) {
153627c04023SMatthew G. Knepley       PetscInt val;
153727c04023SMatthew G. Knepley 
153827c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
153927c04023SMatthew G. Knepley       if (val != value) continue;
154027c04023SMatthew G. Knepley     }
1541766ab985SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
1542766ab985SMatthew G. Knepley     if (hasLagrange) {
1543766ab985SMatthew G. Knepley       if (coneSize != 3) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells");
1544766ab985SMatthew G. Knepley     } else {
1545766ab985SMatthew G. Knepley       if (coneSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells");
1546766ab985SMatthew G. Knepley     }
1547766ab985SMatthew G. Knepley     /* Negative face */
1548766ab985SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
1549766ab985SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1550766ab985SMatthew G. Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
1551766ab985SMatthew G. Knepley       const PetscInt point = closure[cl];
1552766ab985SMatthew G. Knepley 
1553766ab985SMatthew G. Knepley       for (d = 0; d <= dim; ++d) {
1554766ab985SMatthew G. Knepley         if ((point >= pStart[d]) && (point < pEnd[d])) {
1555766ab985SMatthew G. Knepley           ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr);
1556766ab985SMatthew G. Knepley           break;
1557766ab985SMatthew G. Knepley         }
1558766ab985SMatthew G. Knepley       }
1559766ab985SMatthew G. Knepley     }
1560766ab985SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1561766ab985SMatthew G. Knepley     /* Cells -- positive face is not included */
1562766ab985SMatthew G. Knepley     for (cl = 0; cl < 1; ++cl) {
1563766ab985SMatthew G. Knepley       const PetscInt *support;
1564766ab985SMatthew G. Knepley       PetscInt        supportSize, s;
1565766ab985SMatthew G. Knepley 
1566766ab985SMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr);
1567766ab985SMatthew G. Knepley       if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells");
1568766ab985SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr);
1569766ab985SMatthew G. Knepley       for (s = 0; s < supportSize; ++s) {
1570766ab985SMatthew G. Knepley         ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr);
1571766ab985SMatthew G. Knepley       }
1572766ab985SMatthew G. Knepley     }
1573766ab985SMatthew G. Knepley   }
1574766ab985SMatthew G. Knepley   ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr);
1575766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
1576766ab985SMatthew G. Knepley }
1577766ab985SMatthew G. Knepley 
1578766ab985SMatthew G. Knepley #undef __FUNCT__
1579e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation"
1580e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented)
1581e6ccafaeSMatthew G Knepley {
158282f516ccSBarry Smith   MPI_Comm       comm;
1583e6ccafaeSMatthew G Knepley   PetscBool      posOrient = PETSC_FALSE;
1584e6ccafaeSMatthew G Knepley   const PetscInt debug     = 0;
1585e6ccafaeSMatthew G Knepley   PetscInt       cellDim, faceSize, f;
1586e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
1587e6ccafaeSMatthew G Knepley 
158882f516ccSBarry Smith   PetscFunctionBegin;
158982f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
1590e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDimension(dm, &cellDim);CHKERRQ(ierr);
1591e6ccafaeSMatthew G Knepley   if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);}
1592e6ccafaeSMatthew G Knepley 
1593ddeab2a6SMatthew G. Knepley   if (cellDim == 1 && numCorners == 2) {
1594ddeab2a6SMatthew G. Knepley     /* Triangle */
1595e6ccafaeSMatthew G Knepley     faceSize  = numCorners-1;
1596e6ccafaeSMatthew G Knepley     posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
1597ddeab2a6SMatthew G. Knepley   } else if (cellDim == 2 && numCorners == 3) {
1598ddeab2a6SMatthew G. Knepley     /* Triangle */
1599ddeab2a6SMatthew G. Knepley     faceSize  = numCorners-1;
1600ddeab2a6SMatthew G. Knepley     posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
1601ddeab2a6SMatthew G. Knepley   } else if (cellDim == 3 && numCorners == 4) {
1602ddeab2a6SMatthew G. Knepley     /* Tetrahedron */
1603ddeab2a6SMatthew G. Knepley     faceSize  = numCorners-1;
1604ddeab2a6SMatthew G. Knepley     posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
1605e6ccafaeSMatthew G Knepley   } else if (cellDim == 1 && numCorners == 3) {
1606e6ccafaeSMatthew G Knepley     /* Quadratic line */
1607e6ccafaeSMatthew G Knepley     faceSize  = 1;
1608e6ccafaeSMatthew G Knepley     posOrient = PETSC_TRUE;
1609e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 4) {
1610e6ccafaeSMatthew G Knepley     /* Quads */
1611e6ccafaeSMatthew G Knepley     faceSize = 2;
1612e6ccafaeSMatthew G Knepley     if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) {
1613e6ccafaeSMatthew G Knepley       posOrient = PETSC_TRUE;
1614e6ccafaeSMatthew G Knepley     } else if ((indices[0] == 3) && (indices[1] == 0)) {
1615e6ccafaeSMatthew G Knepley       posOrient = PETSC_TRUE;
1616e6ccafaeSMatthew G Knepley     } else {
1617e6ccafaeSMatthew G Knepley       if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) {
1618e6ccafaeSMatthew G Knepley         posOrient = PETSC_FALSE;
1619e6ccafaeSMatthew G Knepley       } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge");
1620e6ccafaeSMatthew G Knepley     }
1621e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 6) {
1622e6ccafaeSMatthew G Knepley     /* Quadratic triangle (I hate this) */
1623e6ccafaeSMatthew G Knepley     /* Edges are determined by the first 2 vertices (corners of edges) */
1624e6ccafaeSMatthew G Knepley     const PetscInt faceSizeTri = 3;
1625e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[3], i, iFace;
1626e6ccafaeSMatthew G Knepley     PetscBool      found                    = PETSC_FALSE;
1627e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTriSorted[9] = {
1628e6ccafaeSMatthew G Knepley       0, 3,  4, /* bottom */
1629e6ccafaeSMatthew G Knepley       1, 4,  5, /* right */
1630e6ccafaeSMatthew G Knepley       2, 3,  5, /* left */
1631e6ccafaeSMatthew G Knepley     };
1632e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTri[9] = {
1633e6ccafaeSMatthew G Knepley       0, 3,  4, /* bottom */
1634e6ccafaeSMatthew G Knepley       1, 4,  5, /* right */
1635e6ccafaeSMatthew G Knepley       2, 5,  3, /* left */
1636e6ccafaeSMatthew G Knepley     };
1637e6ccafaeSMatthew G Knepley 
1638e6ccafaeSMatthew G Knepley     faceSize = faceSizeTri;
1639e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i];
1640e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr);
1641e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 3; ++iFace) {
1642e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeTri;
1643e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
1644e6ccafaeSMatthew G Knepley 
1645e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) &&
1646e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesTriSorted[ii+1])) {
1647e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) {
1648e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) {
1649e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesTri[ii+fVertex]) {
1650e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
1651e6ccafaeSMatthew G Knepley               break;
1652e6ccafaeSMatthew G Knepley             }
1653e6ccafaeSMatthew G Knepley           }
1654e6ccafaeSMatthew G Knepley         }
1655e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
1656e6ccafaeSMatthew G Knepley         break;
1657e6ccafaeSMatthew G Knepley       }
1658e6ccafaeSMatthew G Knepley     }
1659e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface");
1660e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
1661e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
1662e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 9) {
1663e6ccafaeSMatthew G Knepley     /* Quadratic quad (I hate this) */
1664e6ccafaeSMatthew G Knepley     /* Edges are determined by the first 2 vertices (corners of edges) */
1665e6ccafaeSMatthew G Knepley     const PetscInt faceSizeQuad = 3;
1666e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[3], i, iFace;
1667e6ccafaeSMatthew G Knepley     PetscBool      found                      = PETSC_FALSE;
1668e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadSorted[12] = {
1669e6ccafaeSMatthew G Knepley       0, 1,  4, /* bottom */
1670e6ccafaeSMatthew G Knepley       1, 2,  5, /* right */
1671e6ccafaeSMatthew G Knepley       2, 3,  6, /* top */
1672e6ccafaeSMatthew G Knepley       0, 3,  7, /* left */
1673e6ccafaeSMatthew G Knepley     };
1674e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuad[12] = {
1675e6ccafaeSMatthew G Knepley       0, 1,  4, /* bottom */
1676e6ccafaeSMatthew G Knepley       1, 2,  5, /* right */
1677e6ccafaeSMatthew G Knepley       2, 3,  6, /* top */
1678e6ccafaeSMatthew G Knepley       3, 0,  7, /* left */
1679e6ccafaeSMatthew G Knepley     };
1680e6ccafaeSMatthew G Knepley 
1681e6ccafaeSMatthew G Knepley     faceSize = faceSizeQuad;
1682e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i];
1683e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr);
1684e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 4; ++iFace) {
1685e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeQuad;
1686e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
1687e6ccafaeSMatthew G Knepley 
1688e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) &&
1689e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) {
1690e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) {
1691e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) {
1692e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) {
1693e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
1694e6ccafaeSMatthew G Knepley               break;
1695e6ccafaeSMatthew G Knepley             }
1696e6ccafaeSMatthew G Knepley           }
1697e6ccafaeSMatthew G Knepley         }
1698e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
1699e6ccafaeSMatthew G Knepley         break;
1700e6ccafaeSMatthew G Knepley       }
1701e6ccafaeSMatthew G Knepley     }
1702e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface");
1703e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
1704e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
1705e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 8) {
1706e6ccafaeSMatthew G Knepley     /* Hexes
1707e6ccafaeSMatthew G Knepley        A hex is two oriented quads with the normal of the first
1708e6ccafaeSMatthew G Knepley        pointing up at the second.
1709e6ccafaeSMatthew G Knepley 
1710e6ccafaeSMatthew G Knepley           7---6
1711e6ccafaeSMatthew G Knepley          /|  /|
1712e6ccafaeSMatthew G Knepley         4---5 |
1713ddeab2a6SMatthew G. Knepley         | 1-|-2
1714e6ccafaeSMatthew G Knepley         |/  |/
1715ddeab2a6SMatthew G. Knepley         0---3
1716e6ccafaeSMatthew G Knepley 
1717e6ccafaeSMatthew G Knepley         Faces are determined by the first 4 vertices (corners of faces) */
1718e6ccafaeSMatthew G Knepley     const PetscInt faceSizeHex = 4;
1719e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[4], i, iFace;
1720e6ccafaeSMatthew G Knepley     PetscBool      found                     = PETSC_FALSE;
1721e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesHexSorted[24] = {
1722e6ccafaeSMatthew G Knepley       0, 1, 2, 3,  /* bottom */
1723e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  /* top */
1724ddeab2a6SMatthew G. Knepley       0, 3, 4, 5,  /* front */
1725ddeab2a6SMatthew G. Knepley       2, 3, 5, 6,  /* right */
1726ddeab2a6SMatthew G. Knepley       1, 2, 6, 7,  /* back */
1727ddeab2a6SMatthew G. Knepley       0, 1, 4, 7,  /* left */
1728e6ccafaeSMatthew G Knepley     };
1729e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesHex[24] = {
1730ddeab2a6SMatthew G. Knepley       1, 2, 3, 0,  /* bottom */
1731e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  /* top */
1732ddeab2a6SMatthew G. Knepley       0, 3, 5, 4,  /* front */
1733ddeab2a6SMatthew G. Knepley       3, 2, 6, 5,  /* right */
1734ddeab2a6SMatthew G. Knepley       2, 1, 7, 6,  /* back */
1735ddeab2a6SMatthew G. Knepley       1, 0, 4, 7,  /* left */
1736e6ccafaeSMatthew G Knepley     };
1737e6ccafaeSMatthew G Knepley 
1738e6ccafaeSMatthew G Knepley     faceSize = faceSizeHex;
1739e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i];
1740e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr);
1741e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 6; ++iFace) {
1742e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeHex;
1743e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
1744e6ccafaeSMatthew G Knepley 
1745e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) &&
1746e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesHexSorted[ii+1]) &&
1747e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesHexSorted[ii+2]) &&
1748e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesHexSorted[ii+3])) {
1749e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) {
1750e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) {
1751e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesHex[ii+fVertex]) {
1752e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
1753e6ccafaeSMatthew G Knepley               break;
1754e6ccafaeSMatthew G Knepley             }
1755e6ccafaeSMatthew G Knepley           }
1756e6ccafaeSMatthew G Knepley         }
1757e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
1758e6ccafaeSMatthew G Knepley         break;
1759e6ccafaeSMatthew G Knepley       }
1760e6ccafaeSMatthew G Knepley     }
1761e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface");
1762e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
1763e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
1764e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 10) {
1765e6ccafaeSMatthew G Knepley     /* Quadratic tet */
1766e6ccafaeSMatthew G Knepley     /* Faces are determined by the first 3 vertices (corners of faces) */
1767e6ccafaeSMatthew G Knepley     const PetscInt faceSizeTet = 6;
1768e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[6], i, iFace;
1769e6ccafaeSMatthew G Knepley     PetscBool      found                     = PETSC_FALSE;
1770e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTetSorted[24] = {
1771e6ccafaeSMatthew G Knepley       0, 1, 2,  6, 7, 8, /* bottom */
1772e6ccafaeSMatthew G Knepley       0, 3, 4,  6, 7, 9,  /* front */
1773e6ccafaeSMatthew G Knepley       1, 4, 5,  7, 8, 9,  /* right */
1774e6ccafaeSMatthew G Knepley       2, 3, 5,  6, 8, 9,  /* left */
1775e6ccafaeSMatthew G Knepley     };
1776e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTet[24] = {
1777e6ccafaeSMatthew G Knepley       0, 1, 2,  6, 7, 8, /* bottom */
1778e6ccafaeSMatthew G Knepley       0, 4, 3,  6, 7, 9,  /* front */
1779e6ccafaeSMatthew G Knepley       1, 5, 4,  7, 8, 9,  /* right */
1780e6ccafaeSMatthew G Knepley       2, 3, 5,  8, 6, 9,  /* left */
1781e6ccafaeSMatthew G Knepley     };
1782e6ccafaeSMatthew G Knepley 
1783e6ccafaeSMatthew G Knepley     faceSize = faceSizeTet;
1784e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i];
1785e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr);
1786e6ccafaeSMatthew G Knepley     for (iFace=0; iFace < 4; ++iFace) {
1787e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeTet;
1788e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
1789e6ccafaeSMatthew G Knepley 
1790e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) &&
1791e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesTetSorted[ii+1]) &&
1792e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesTetSorted[ii+2]) &&
1793e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesTetSorted[ii+3])) {
1794e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) {
1795e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) {
1796e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesTet[ii+fVertex]) {
1797e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
1798e6ccafaeSMatthew G Knepley               break;
1799e6ccafaeSMatthew G Knepley             }
1800e6ccafaeSMatthew G Knepley           }
1801e6ccafaeSMatthew G Knepley         }
1802e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
1803e6ccafaeSMatthew G Knepley         break;
1804e6ccafaeSMatthew G Knepley       }
1805e6ccafaeSMatthew G Knepley     }
1806e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface");
1807e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
1808e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
1809e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 27) {
1810e6ccafaeSMatthew G Knepley     /* Quadratic hexes (I hate this)
1811e6ccafaeSMatthew G Knepley        A hex is two oriented quads with the normal of the first
1812e6ccafaeSMatthew G Knepley        pointing up at the second.
1813e6ccafaeSMatthew G Knepley 
1814e6ccafaeSMatthew G Knepley          7---6
1815e6ccafaeSMatthew G Knepley         /|  /|
1816e6ccafaeSMatthew G Knepley        4---5 |
1817e6ccafaeSMatthew G Knepley        | 3-|-2
1818e6ccafaeSMatthew G Knepley        |/  |/
1819e6ccafaeSMatthew G Knepley        0---1
1820e6ccafaeSMatthew G Knepley 
1821e6ccafaeSMatthew G Knepley        Faces are determined by the first 4 vertices (corners of faces) */
1822e6ccafaeSMatthew G Knepley     const PetscInt faceSizeQuadHex = 9;
1823e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[9], i, iFace;
1824e6ccafaeSMatthew G Knepley     PetscBool      found                         = PETSC_FALSE;
1825e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadHexSorted[54] = {
1826e6ccafaeSMatthew G Knepley       0, 1, 2, 3,  8, 9, 10, 11,  24, /* bottom */
1827e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  12, 13, 14, 15,  25, /* top */
1828e6ccafaeSMatthew G Knepley       0, 1, 4, 5,  8, 12, 16, 17,  22, /* front */
1829e6ccafaeSMatthew G Knepley       1, 2, 5, 6,  9, 13, 17, 18,  21, /* right */
1830e6ccafaeSMatthew G Knepley       2, 3, 6, 7,  10, 14, 18, 19,  23, /* back */
1831e6ccafaeSMatthew G Knepley       0, 3, 4, 7,  11, 15, 16, 19,  20, /* left */
1832e6ccafaeSMatthew G Knepley     };
1833e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadHex[54] = {
1834e6ccafaeSMatthew G Knepley       3, 2, 1, 0,  10, 9, 8, 11,  24, /* bottom */
1835e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  12, 13, 14, 15,  25, /* top */
1836e6ccafaeSMatthew G Knepley       0, 1, 5, 4,  8, 17, 12, 16,  22, /* front */
1837e6ccafaeSMatthew G Knepley       1, 2, 6, 5,  9, 18, 13, 17,  21, /* right */
1838e6ccafaeSMatthew G Knepley       2, 3, 7, 6,  10, 19, 14, 18,  23, /* back */
1839e6ccafaeSMatthew G Knepley       3, 0, 4, 7,  11, 16, 15, 19,  20 /* left */
1840e6ccafaeSMatthew G Knepley     };
1841e6ccafaeSMatthew G Knepley 
1842e6ccafaeSMatthew G Knepley     faceSize = faceSizeQuadHex;
1843e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i];
1844e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr);
1845e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 6; ++iFace) {
1846e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeQuadHex;
1847e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
1848e6ccafaeSMatthew G Knepley 
1849e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) &&
1850e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) &&
1851e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) &&
1852e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) {
1853e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) {
1854e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) {
1855e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) {
1856e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
1857e6ccafaeSMatthew G Knepley               break;
1858e6ccafaeSMatthew G Knepley             }
1859e6ccafaeSMatthew G Knepley           }
1860e6ccafaeSMatthew G Knepley         }
1861e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
1862e6ccafaeSMatthew G Knepley         break;
1863e6ccafaeSMatthew G Knepley       }
1864e6ccafaeSMatthew G Knepley     }
1865e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface");
1866e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
1867e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
1868e6ccafaeSMatthew G Knepley   } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation().");
1869e6ccafaeSMatthew G Knepley   if (!posOrient) {
1870e6ccafaeSMatthew G Knepley     if (debug) {ierr = PetscPrintf(comm, "  Reversing initial face orientation\n");CHKERRQ(ierr);}
1871e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f];
1872e6ccafaeSMatthew G Knepley   } else {
1873e6ccafaeSMatthew G Knepley     if (debug) {ierr = PetscPrintf(comm, "  Keeping initial face orientation\n");CHKERRQ(ierr);}
1874e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f];
1875e6ccafaeSMatthew G Knepley   }
1876e6ccafaeSMatthew G Knepley   if (posOriented) *posOriented = posOrient;
1877e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
1878e6ccafaeSMatthew G Knepley }
1879e6ccafaeSMatthew G Knepley 
1880e6ccafaeSMatthew G Knepley #undef __FUNCT__
1881e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace"
1882e6ccafaeSMatthew G Knepley /*
1883e6ccafaeSMatthew G Knepley     Given a cell and a face, as a set of vertices,
1884e6ccafaeSMatthew G Knepley       return the oriented face, as a set of vertices, in faceVertices
1885e6ccafaeSMatthew G Knepley     The orientation is such that the face normal points out of the cell
1886e6ccafaeSMatthew G Knepley */
1887e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented)
1888e6ccafaeSMatthew G Knepley {
18890298fd71SBarry Smith   const PetscInt *cone = NULL;
1890e6ccafaeSMatthew G Knepley   PetscInt        coneSize, v, f, v2;
1891e6ccafaeSMatthew G Knepley   PetscInt        oppositeVertex = -1;
1892e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
1893e6ccafaeSMatthew G Knepley 
1894e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
1895e6ccafaeSMatthew G Knepley   ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr);
1896e6ccafaeSMatthew G Knepley   ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
1897e6ccafaeSMatthew G Knepley   for (v = 0, v2 = 0; v < coneSize; ++v) {
1898e6ccafaeSMatthew G Knepley     PetscBool found = PETSC_FALSE;
1899e6ccafaeSMatthew G Knepley 
1900e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) {
1901e6ccafaeSMatthew G Knepley       if (face[f] == cone[v]) {
1902e6ccafaeSMatthew G Knepley         found = PETSC_TRUE; break;
1903e6ccafaeSMatthew G Knepley       }
1904e6ccafaeSMatthew G Knepley     }
1905e6ccafaeSMatthew G Knepley     if (found) {
1906e6ccafaeSMatthew G Knepley       indices[v2]      = v;
1907e6ccafaeSMatthew G Knepley       origVertices[v2] = cone[v];
1908e6ccafaeSMatthew G Knepley       ++v2;
1909e6ccafaeSMatthew G Knepley     } else {
1910e6ccafaeSMatthew G Knepley       oppositeVertex = v;
1911e6ccafaeSMatthew G Knepley     }
1912e6ccafaeSMatthew G Knepley   }
1913e6ccafaeSMatthew G Knepley   ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr);
1914e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
1915e6ccafaeSMatthew G Knepley }
1916e6ccafaeSMatthew G Knepley 
1917e6ccafaeSMatthew G Knepley #undef __FUNCT__
1918cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal"
1919e6ccafaeSMatthew G Knepley /*
1920cd0c2139SMatthew G Knepley   DMPlexInsertFace_Internal - Puts a face into the mesh
1921e6ccafaeSMatthew G Knepley 
1922e6ccafaeSMatthew G Knepley   Not collective
1923e6ccafaeSMatthew G Knepley 
1924e6ccafaeSMatthew G Knepley   Input Parameters:
1925e6ccafaeSMatthew G Knepley   + dm              - The DMPlex
1926e6ccafaeSMatthew G Knepley   . numFaceVertex   - The number of vertices in the face
1927e6ccafaeSMatthew G Knepley   . faceVertices    - The vertices in the face for dm
1928e6ccafaeSMatthew G Knepley   . subfaceVertices - The vertices in the face for subdm
1929e6ccafaeSMatthew G Knepley   . numCorners      - The number of vertices in the cell
1930e6ccafaeSMatthew G Knepley   . cell            - A cell in dm containing the face
1931e6ccafaeSMatthew G Knepley   . subcell         - A cell in subdm containing the face
1932e6ccafaeSMatthew G Knepley   . firstFace       - First face in the mesh
1933e6ccafaeSMatthew G Knepley   - newFacePoint    - Next face in the mesh
1934e6ccafaeSMatthew G Knepley 
1935e6ccafaeSMatthew G Knepley   Output Parameters:
1936e6ccafaeSMatthew G Knepley   . newFacePoint - Contains next face point number on input, updated on output
1937e6ccafaeSMatthew G Knepley 
1938e6ccafaeSMatthew G Knepley   Level: developer
1939e6ccafaeSMatthew G Knepley */
1940cd0c2139SMatthew 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)
1941e6ccafaeSMatthew G Knepley {
194282f516ccSBarry Smith   MPI_Comm        comm;
1943e6ccafaeSMatthew G Knepley   DM_Plex        *submesh = (DM_Plex*) subdm->data;
1944e6ccafaeSMatthew G Knepley   const PetscInt *faces;
1945e6ccafaeSMatthew G Knepley   PetscInt        numFaces, coneSize;
1946e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
1947e6ccafaeSMatthew G Knepley 
1948e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
194982f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
1950e6ccafaeSMatthew G Knepley   ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr);
1951e6ccafaeSMatthew G Knepley   if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize);
1952e6ccafaeSMatthew G Knepley #if 0
1953e6ccafaeSMatthew G Knepley   /* Cannot use this because support() has not been constructed yet */
1954e6ccafaeSMatthew G Knepley   ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr);
1955e6ccafaeSMatthew G Knepley #else
1956e6ccafaeSMatthew G Knepley   {
1957e6ccafaeSMatthew G Knepley     PetscInt f;
1958e6ccafaeSMatthew G Knepley 
1959e6ccafaeSMatthew G Knepley     numFaces = 0;
1960e6ccafaeSMatthew G Knepley     ierr     = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr);
1961e6ccafaeSMatthew G Knepley     for (f = firstFace; f < *newFacePoint; ++f) {
1962e6ccafaeSMatthew G Knepley       PetscInt dof, off, d;
1963e6ccafaeSMatthew G Knepley 
1964e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr);
1965e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr);
1966e6ccafaeSMatthew G Knepley       /* Yes, I know this is quadratic, but I expect the sizes to be <5 */
1967e6ccafaeSMatthew G Knepley       for (d = 0; d < dof; ++d) {
1968e6ccafaeSMatthew G Knepley         const PetscInt p = submesh->cones[off+d];
1969e6ccafaeSMatthew G Knepley         PetscInt       v;
1970e6ccafaeSMatthew G Knepley 
1971e6ccafaeSMatthew G Knepley         for (v = 0; v < numFaceVertices; ++v) {
1972e6ccafaeSMatthew G Knepley           if (subfaceVertices[v] == p) break;
1973e6ccafaeSMatthew G Knepley         }
1974e6ccafaeSMatthew G Knepley         if (v == numFaceVertices) break;
1975e6ccafaeSMatthew G Knepley       }
1976e6ccafaeSMatthew G Knepley       if (d == dof) {
1977e6ccafaeSMatthew G Knepley         numFaces               = 1;
1978e6ccafaeSMatthew G Knepley         ((PetscInt*) faces)[0] = f;
1979e6ccafaeSMatthew G Knepley       }
1980e6ccafaeSMatthew G Knepley     }
1981e6ccafaeSMatthew G Knepley   }
1982e6ccafaeSMatthew G Knepley #endif
1983e6ccafaeSMatthew G Knepley   if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces);
1984e6ccafaeSMatthew G Knepley   else if (numFaces == 1) {
1985e6ccafaeSMatthew G Knepley     /* Add the other cell neighbor for this face */
1986766ab985SMatthew G. Knepley     ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr);
1987e6ccafaeSMatthew G Knepley   } else {
1988e6ccafaeSMatthew G Knepley     PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov;
1989e6ccafaeSMatthew G Knepley     PetscBool posOriented;
1990e6ccafaeSMatthew G Knepley 
1991e6ccafaeSMatthew G Knepley     ierr                = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr);
1992e6ccafaeSMatthew G Knepley     origVertices        = &orientedVertices[numFaceVertices];
1993e6ccafaeSMatthew G Knepley     indices             = &orientedVertices[numFaceVertices*2];
1994e6ccafaeSMatthew G Knepley     orientedSubVertices = &orientedVertices[numFaceVertices*3];
1995e6ccafaeSMatthew G Knepley     ierr                = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr);
1996e6ccafaeSMatthew G Knepley     /* TODO: I know that routine should return a permutation, not the indices */
1997e6ccafaeSMatthew G Knepley     for (v = 0; v < numFaceVertices; ++v) {
1998e6ccafaeSMatthew G Knepley       const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v];
1999e6ccafaeSMatthew G Knepley       for (ov = 0; ov < numFaceVertices; ++ov) {
2000e6ccafaeSMatthew G Knepley         if (orientedVertices[ov] == vertex) {
2001e6ccafaeSMatthew G Knepley           orientedSubVertices[ov] = subvertex;
2002e6ccafaeSMatthew G Knepley           break;
2003e6ccafaeSMatthew G Knepley         }
2004e6ccafaeSMatthew G Knepley       }
2005e6ccafaeSMatthew G Knepley       if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex);
2006e6ccafaeSMatthew G Knepley     }
2007e6ccafaeSMatthew G Knepley     ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr);
2008e6ccafaeSMatthew G Knepley     ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr);
2009e6ccafaeSMatthew G Knepley     ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr);
2010e6ccafaeSMatthew G Knepley     ++(*newFacePoint);
2011e6ccafaeSMatthew G Knepley   }
2012ef07cca7SMatthew G. Knepley #if 0
2013e6ccafaeSMatthew G Knepley   ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr);
2014ef07cca7SMatthew G. Knepley #else
2015ef07cca7SMatthew G. Knepley   ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr);
2016ef07cca7SMatthew G. Knepley #endif
2017e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2018e6ccafaeSMatthew G Knepley }
2019e6ccafaeSMatthew G Knepley 
2020e6ccafaeSMatthew G Knepley #undef __FUNCT__
2021e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated"
202253156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm)
2023e6ccafaeSMatthew G Knepley {
202482f516ccSBarry Smith   MPI_Comm        comm;
202553156dfcSMatthew G. Knepley   DMLabel         subpointMap;
2026efa14ee0SMatthew G Knepley   IS              subvertexIS,  subcellIS;
2027efa14ee0SMatthew G Knepley   const PetscInt *subVertices, *subCells;
2028efa14ee0SMatthew G Knepley   PetscInt        numSubVertices, firstSubVertex, numSubCells;
2029fed694aaSMatthew G. Knepley   PetscInt       *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0;
2030efa14ee0SMatthew G Knepley   PetscInt        vStart, vEnd, c, f;
2031e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2032e6ccafaeSMatthew G Knepley 
2033e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
203482f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2035efa14ee0SMatthew G Knepley   /* Create subpointMap which marks the submesh */
2036efa14ee0SMatthew G Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2037efa14ee0SMatthew G Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2038efa14ee0SMatthew G Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
203953156dfcSMatthew G. Knepley   if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);}
2040efa14ee0SMatthew G Knepley   /* Setup chart */
2041efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr);
2042efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr);
2043efa14ee0SMatthew G Knepley   ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr);
2044efa14ee0SMatthew G Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2045e6ccafaeSMatthew G Knepley   /* Set cone sizes */
2046e6ccafaeSMatthew G Knepley   firstSubVertex = numSubCells;
2047efa14ee0SMatthew G Knepley   firstSubFace   = numSubCells+numSubVertices;
2048e6ccafaeSMatthew G Knepley   newFacePoint   = firstSubFace;
2049efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr);
2050efa14ee0SMatthew G Knepley   if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2051efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr);
2052efa14ee0SMatthew G Knepley   if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);}
2053e6ccafaeSMatthew G Knepley   for (c = 0; c < numSubCells; ++c) {
2054e6ccafaeSMatthew G Knepley     ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr);
2055e6ccafaeSMatthew G Knepley   }
2056e6ccafaeSMatthew G Knepley   for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) {
2057e6ccafaeSMatthew G Knepley     ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr);
2058e6ccafaeSMatthew G Knepley   }
2059e6ccafaeSMatthew G Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2060e6ccafaeSMatthew G Knepley   /* Create face cones */
2061efa14ee0SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
20620298fd71SBarry Smith   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
2063efa14ee0SMatthew G Knepley   ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2064e6ccafaeSMatthew G Knepley   for (c = 0; c < numSubCells; ++c) {
2065e6ccafaeSMatthew G Knepley     const PetscInt cell    = subCells[c];
2066efa14ee0SMatthew G Knepley     const PetscInt subcell = c;
20670298fd71SBarry Smith     PetscInt      *closure = NULL;
2068efa14ee0SMatthew G Knepley     PetscInt       closureSize, cl, numCorners = 0, faceSize = 0;
2069e6ccafaeSMatthew G Knepley 
2070e6ccafaeSMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2071efa14ee0SMatthew G Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
2072efa14ee0SMatthew G Knepley       const PetscInt point = closure[cl];
2073e6ccafaeSMatthew G Knepley       PetscInt       subVertex;
2074e6ccafaeSMatthew G Knepley 
2075efa14ee0SMatthew G Knepley       if ((point >= vStart) && (point < vEnd)) {
2076efa14ee0SMatthew G Knepley         ++numCorners;
2077efa14ee0SMatthew G Knepley         ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr);
2078efa14ee0SMatthew G Knepley         if (subVertex >= 0) {
2079efa14ee0SMatthew G Knepley           closure[faceSize] = point;
208065560c7fSMatthew G Knepley           subface[faceSize] = firstSubVertex+subVertex;
2081e6ccafaeSMatthew G Knepley           ++faceSize;
2082e6ccafaeSMatthew G Knepley         }
2083e6ccafaeSMatthew G Knepley       }
2084e6ccafaeSMatthew G Knepley     }
2085efa14ee0SMatthew G Knepley     if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize);
2086efa14ee0SMatthew G Knepley     if (faceSize == nFV) {
2087cd0c2139SMatthew G Knepley       ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr);
2088e6ccafaeSMatthew G Knepley     }
208965560c7fSMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2090e6ccafaeSMatthew G Knepley   }
2091efa14ee0SMatthew G Knepley   ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2092e6ccafaeSMatthew G Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2093e6ccafaeSMatthew G Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2094e6ccafaeSMatthew G Knepley   /* Build coordinates */
2095efa14ee0SMatthew G Knepley   {
2096efa14ee0SMatthew G Knepley     PetscSection coordSection, subCoordSection;
2097efa14ee0SMatthew G Knepley     Vec          coordinates, subCoordinates;
2098efa14ee0SMatthew G Knepley     PetscScalar *coords, *subCoords;
2099285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize, v;
2100efa14ee0SMatthew G Knepley 
2101e6ccafaeSMatthew G Knepley     ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2102e6ccafaeSMatthew G Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
2103e6ccafaeSMatthew G Knepley     ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2104285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2105285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2106285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2107efa14ee0SMatthew G Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr);
2108efa14ee0SMatthew G Knepley     for (v = 0; v < numSubVertices; ++v) {
2109efa14ee0SMatthew G Knepley       const PetscInt vertex    = subVertices[v];
2110efa14ee0SMatthew G Knepley       const PetscInt subvertex = firstSubVertex+v;
2111efa14ee0SMatthew G Knepley       PetscInt       dof;
2112efa14ee0SMatthew G Knepley 
2113efa14ee0SMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2114efa14ee0SMatthew G Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2115285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2116e6ccafaeSMatthew G Knepley     }
2117e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2118e6ccafaeSMatthew G Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2119e6ccafaeSMatthew G Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2120e6ccafaeSMatthew G Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
21212eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2122830e53efSMatthew G. Knepley     if (coordSize) {
2123e6ccafaeSMatthew G Knepley       ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2124e6ccafaeSMatthew G Knepley       ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2125efa14ee0SMatthew G Knepley       for (v = 0; v < numSubVertices; ++v) {
2126efa14ee0SMatthew G Knepley         const PetscInt vertex    = subVertices[v];
2127efa14ee0SMatthew G Knepley         const PetscInt subvertex = firstSubVertex+v;
2128efa14ee0SMatthew G Knepley         PetscInt       dof, off, sdof, soff, d;
2129e6ccafaeSMatthew G Knepley 
2130e6ccafaeSMatthew G Knepley         ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2131e6ccafaeSMatthew G Knepley         ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2132efa14ee0SMatthew G Knepley         ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2133efa14ee0SMatthew G Knepley         ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2134efa14ee0SMatthew 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);
2135e6ccafaeSMatthew G Knepley         for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2136e6ccafaeSMatthew G Knepley       }
2137e6ccafaeSMatthew G Knepley       ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2138e6ccafaeSMatthew G Knepley       ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
21393b399e24SMatthew G. Knepley     }
2140e6ccafaeSMatthew G Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2141e6ccafaeSMatthew G Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2142e6ccafaeSMatthew G Knepley   }
2143efa14ee0SMatthew G Knepley   /* Cleanup */
2144efa14ee0SMatthew G Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2145efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
2146efa14ee0SMatthew G Knepley   if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);}
2147efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subcellIS);CHKERRQ(ierr);
2148e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2149e6ccafaeSMatthew G Knepley }
2150e6ccafaeSMatthew G Knepley 
2151e6ccafaeSMatthew G Knepley #undef __FUNCT__
2152e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated"
215353156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm)
2154e6ccafaeSMatthew G Knepley {
215582f516ccSBarry Smith   MPI_Comm         comm;
215653156dfcSMatthew G. Knepley   DMLabel          subpointMap;
2157efa14ee0SMatthew G Knepley   IS              *subpointIS;
2158efa14ee0SMatthew G Knepley   const PetscInt **subpoints;
215901a2673eSMatthew G. Knepley   PetscInt        *numSubPoints, *firstSubPoint, *coneNew, *coneONew;
2160efa14ee0SMatthew G Knepley   PetscInt         totSubPoints = 0, maxConeSize, dim, p, d, v;
2161e6ccafaeSMatthew G Knepley   PetscErrorCode   ierr;
2162e6ccafaeSMatthew G Knepley 
2163e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
216482f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2165efa14ee0SMatthew G Knepley   /* Create subpointMap which marks the submesh */
2166e6ccafaeSMatthew G Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2167efa14ee0SMatthew G Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2168efa14ee0SMatthew G Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
216953156dfcSMatthew G. Knepley   if (vertexLabel) {ierr = DMPlexMarkSubmesh_Interpolated(dm, vertexLabel, value, subpointMap, subdm);CHKERRQ(ierr);}
2170efa14ee0SMatthew G Knepley   /* Setup chart */
2171efa14ee0SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
2172efa14ee0SMatthew G Knepley   ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr);
2173e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2174e6ccafaeSMatthew G Knepley     ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr);
2175e6ccafaeSMatthew G Knepley     totSubPoints += numSubPoints[d];
2176e6ccafaeSMatthew G Knepley   }
2177e6ccafaeSMatthew G Knepley   ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr);
2178e6ccafaeSMatthew G Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2179e6ccafaeSMatthew G Knepley   /* Set cone sizes */
2180e6ccafaeSMatthew G Knepley   firstSubPoint[dim] = 0;
2181e6ccafaeSMatthew G Knepley   firstSubPoint[0]   = firstSubPoint[dim] + numSubPoints[dim];
2182e6ccafaeSMatthew G Knepley   if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0]     + numSubPoints[0];}
2183e6ccafaeSMatthew G Knepley   if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];}
2184e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2185e6ccafaeSMatthew G Knepley     ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr);
2186e6ccafaeSMatthew G Knepley     ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);
2187e6ccafaeSMatthew G Knepley   }
2188e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2189e6ccafaeSMatthew G Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2190e6ccafaeSMatthew G Knepley       const PetscInt  point    = subpoints[d][p];
2191e6ccafaeSMatthew G Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
2192e6ccafaeSMatthew G Knepley       const PetscInt *cone;
2193e6ccafaeSMatthew G Knepley       PetscInt        coneSize, coneSizeNew, c, val;
2194e6ccafaeSMatthew G Knepley 
2195e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2196e6ccafaeSMatthew G Knepley       ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr);
2197e6ccafaeSMatthew G Knepley       if (d == dim) {
2198e6ccafaeSMatthew G Knepley         ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
2199e6ccafaeSMatthew G Knepley         for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2200e6ccafaeSMatthew G Knepley           ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr);
2201e6ccafaeSMatthew G Knepley           if (val >= 0) coneSizeNew++;
2202e6ccafaeSMatthew G Knepley         }
2203e6ccafaeSMatthew G Knepley         ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr);
2204e6ccafaeSMatthew G Knepley       }
2205e6ccafaeSMatthew G Knepley     }
2206e6ccafaeSMatthew G Knepley   }
2207e6ccafaeSMatthew G Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2208e6ccafaeSMatthew G Knepley   /* Set cones */
22090298fd71SBarry Smith   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
221001a2673eSMatthew G. Knepley   ierr = PetscMalloc2(maxConeSize,PetscInt,&coneNew,maxConeSize,PetscInt,&coneONew);CHKERRQ(ierr);
2211e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2212e6ccafaeSMatthew G Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2213e6ccafaeSMatthew G Knepley       const PetscInt  point    = subpoints[d][p];
2214e6ccafaeSMatthew G Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
22150e49e2e2SMatthew G. Knepley       const PetscInt *cone, *ornt;
2216e6ccafaeSMatthew G Knepley       PetscInt        coneSize, subconeSize, coneSizeNew, c, subc;
2217e6ccafaeSMatthew G Knepley 
2218e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2219e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
2220e6ccafaeSMatthew G Knepley       ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
22210e49e2e2SMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr);
2222e6ccafaeSMatthew G Knepley       for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2223e6ccafaeSMatthew G Knepley         ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr);
222401a2673eSMatthew G. Knepley         if (subc >= 0) {
222501a2673eSMatthew G. Knepley           coneNew[coneSizeNew]  = firstSubPoint[d-1] + subc;
222601a2673eSMatthew G. Knepley           coneONew[coneSizeNew] = ornt[c];
222701a2673eSMatthew G. Knepley           ++coneSizeNew;
222801a2673eSMatthew G. Knepley         }
2229e6ccafaeSMatthew G Knepley       }
2230e6ccafaeSMatthew G Knepley       if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize);
2231e6ccafaeSMatthew G Knepley       ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr);
223201a2673eSMatthew G. Knepley       ierr = DMPlexSetConeOrientation(subdm, subpoint, coneONew);CHKERRQ(ierr);
2233e6ccafaeSMatthew G Knepley     }
2234e6ccafaeSMatthew G Knepley   }
223501a2673eSMatthew G. Knepley   ierr = PetscFree2(coneNew,coneONew);CHKERRQ(ierr);
2236e6ccafaeSMatthew G Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2237e6ccafaeSMatthew G Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2238e6ccafaeSMatthew G Knepley   /* Build coordinates */
2239e6ccafaeSMatthew G Knepley   {
2240e6ccafaeSMatthew G Knepley     PetscSection coordSection, subCoordSection;
2241e6ccafaeSMatthew G Knepley     Vec          coordinates, subCoordinates;
2242e6ccafaeSMatthew G Knepley     PetscScalar *coords, *subCoords;
2243285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize;
2244e6ccafaeSMatthew G Knepley 
2245e6ccafaeSMatthew G Knepley     ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2246e6ccafaeSMatthew G Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
2247e6ccafaeSMatthew G Knepley     ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2248285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2249285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2250285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2251e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr);
2252e6ccafaeSMatthew G Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2253e6ccafaeSMatthew G Knepley       const PetscInt vertex    = subpoints[0][v];
2254e6ccafaeSMatthew G Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2255e6ccafaeSMatthew G Knepley       PetscInt       dof;
2256e6ccafaeSMatthew G Knepley 
2257e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2258e6ccafaeSMatthew G Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2259285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2260e6ccafaeSMatthew G Knepley     }
2261e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2262e6ccafaeSMatthew G Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2263e6ccafaeSMatthew G Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2264e6ccafaeSMatthew G Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
22652eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2266e6ccafaeSMatthew G Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2267e6ccafaeSMatthew G Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2268e6ccafaeSMatthew G Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2269e6ccafaeSMatthew G Knepley       const PetscInt vertex    = subpoints[0][v];
2270e6ccafaeSMatthew G Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2271e6ccafaeSMatthew G Knepley       PetscInt dof, off, sdof, soff, d;
2272e6ccafaeSMatthew G Knepley 
2273e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2274e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2275e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2276e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2277e6ccafaeSMatthew 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);
2278efa14ee0SMatthew G Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2279e6ccafaeSMatthew G Knepley     }
2280e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2281e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2282e6ccafaeSMatthew G Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2283e6ccafaeSMatthew G Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2284e6ccafaeSMatthew G Knepley   }
2285efa14ee0SMatthew G Knepley   /* Cleanup */
2286e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2287e6ccafaeSMatthew G Knepley     ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);
2288e6ccafaeSMatthew G Knepley     ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr);
2289e6ccafaeSMatthew G Knepley   }
2290efa14ee0SMatthew G Knepley   ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr);
2291e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2292e6ccafaeSMatthew G Knepley }
2293e6ccafaeSMatthew G Knepley 
2294e6ccafaeSMatthew G Knepley #undef __FUNCT__
2295e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh"
2296d0fa310fSMatthew G. Knepley /*@
2297e6ccafaeSMatthew G Knepley   DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label
2298e6ccafaeSMatthew G Knepley 
2299e6ccafaeSMatthew G Knepley   Input Parameters:
2300e6ccafaeSMatthew G Knepley + dm           - The original mesh
2301830e53efSMatthew G. Knepley . vertexLabel  - The DMLabel marking vertices contained in the surface
2302830e53efSMatthew G. Knepley - value        - The label value to use
2303e6ccafaeSMatthew G Knepley 
2304e6ccafaeSMatthew G Knepley   Output Parameter:
2305e6ccafaeSMatthew G Knepley . subdm - The surface mesh
2306e6ccafaeSMatthew G Knepley 
2307e6ccafaeSMatthew G Knepley   Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap().
2308e6ccafaeSMatthew G Knepley 
2309e6ccafaeSMatthew G Knepley   Level: developer
2310e6ccafaeSMatthew G Knepley 
2311e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue()
2312830e53efSMatthew G. Knepley @*/
231353156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm)
2314e6ccafaeSMatthew G Knepley {
2315e6ccafaeSMatthew G Knepley   PetscInt       dim, depth;
2316e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
2317e6ccafaeSMatthew G Knepley 
2318e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
2319e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2320766ab985SMatthew G. Knepley   PetscValidPointer(subdm, 3);
2321e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
2322e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
232382f516ccSBarry Smith   ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr);
2324e6ccafaeSMatthew G Knepley   ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr);
2325e6ccafaeSMatthew G Knepley   ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr);
2326e6ccafaeSMatthew G Knepley   if (depth == dim) {
2327830e53efSMatthew G. Knepley     ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr);
2328e6ccafaeSMatthew G Knepley   } else {
2329830e53efSMatthew G. Knepley     ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr);
2330e6ccafaeSMatthew G Knepley   }
2331e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2332e6ccafaeSMatthew G Knepley }
2333e6ccafaeSMatthew G Knepley 
2334e6ccafaeSMatthew G Knepley #undef __FUNCT__
2335aca35d17SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal"
2336aca35d17SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[])
2337aca35d17SMatthew G. Knepley {
2338aca35d17SMatthew G. Knepley   PetscInt       subPoint;
2339aca35d17SMatthew G. Knepley   PetscErrorCode ierr;
2340aca35d17SMatthew G. Knepley 
2341aca35d17SMatthew G. Knepley   ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr;
2342aca35d17SMatthew G. Knepley   return subPoint < 0 ? subPoint : firstSubPoint+subPoint;
2343aca35d17SMatthew G. Knepley }
2344aca35d17SMatthew G. Knepley 
2345aca35d17SMatthew G. Knepley #undef __FUNCT__
2346766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated"
234727c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm)
2348766ab985SMatthew G. Knepley {
2349766ab985SMatthew G. Knepley   MPI_Comm        comm;
2350766ab985SMatthew G. Knepley   DMLabel         subpointMap;
2351766ab985SMatthew G. Knepley   IS              subvertexIS;
2352766ab985SMatthew G. Knepley   const PetscInt *subVertices;
2353fed694aaSMatthew G. Knepley   PetscInt        numSubVertices, firstSubVertex, numSubCells, *subCells = NULL;
2354766ab985SMatthew G. Knepley   PetscInt       *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV;
235587feddfdSMatthew G. Knepley   PetscInt        cMax, c, f;
2356766ab985SMatthew G. Knepley   PetscErrorCode  ierr;
2357766ab985SMatthew G. Knepley 
2358766ab985SMatthew G. Knepley   PetscFunctionBegin;
2359766ab985SMatthew G. Knepley   ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr);
2360766ab985SMatthew G. Knepley   /* Create subpointMap which marks the submesh */
2361766ab985SMatthew G. Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2362766ab985SMatthew G. Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2363766ab985SMatthew G. Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
236427c04023SMatthew G. Knepley   ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr);
2365766ab985SMatthew G. Knepley   /* Setup chart */
2366766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr);
2367766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr);
2368766ab985SMatthew G. Knepley   ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr);
2369766ab985SMatthew G. Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2370766ab985SMatthew G. Knepley   /* Set cone sizes */
2371766ab985SMatthew G. Knepley   firstSubVertex = numSubCells;
2372766ab985SMatthew G. Knepley   firstSubFace   = numSubCells+numSubVertices;
2373766ab985SMatthew G. Knepley   newFacePoint   = firstSubFace;
2374766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr);
2375766ab985SMatthew G. Knepley   if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2376766ab985SMatthew G. Knepley   for (c = 0; c < numSubCells; ++c) {
2377766ab985SMatthew G. Knepley     ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr);
2378766ab985SMatthew G. Knepley   }
2379766ab985SMatthew G. Knepley   for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) {
2380766ab985SMatthew G. Knepley     ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr);
2381766ab985SMatthew G. Knepley   }
2382766ab985SMatthew G. Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2383766ab985SMatthew G. Knepley   /* Create face cones */
2384766ab985SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
238587feddfdSMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
2386766ab985SMatthew G. Knepley   ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2387766ab985SMatthew G. Knepley   for (c = 0; c < numSubCells; ++c) {
2388766ab985SMatthew G. Knepley     const PetscInt  cell    = subCells[c];
2389766ab985SMatthew G. Knepley     const PetscInt  subcell = c;
239087feddfdSMatthew G. Knepley     const PetscInt *cone, *cells;
239187feddfdSMatthew G. Knepley     PetscInt        numCells, subVertex, p, v;
2392766ab985SMatthew G. Knepley 
239387feddfdSMatthew G. Knepley     if (cell < cMax) continue;
239487feddfdSMatthew G. Knepley     ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
239587feddfdSMatthew G. Knepley     for (v = 0; v < nFV; ++v) {
239687feddfdSMatthew G. Knepley       ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr);
239787feddfdSMatthew G. Knepley       subface[v] = firstSubVertex+subVertex;
239887feddfdSMatthew G. Knepley     }
239987feddfdSMatthew G. Knepley     ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr);
240087feddfdSMatthew G. Knepley     ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr);
240187feddfdSMatthew G. Knepley     ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr);
240227234c99SMatthew G. Knepley     /* Not true in parallel
240327234c99SMatthew G. Knepley     if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */
240487feddfdSMatthew G. Knepley     for (p = 0; p < numCells; ++p) {
240587feddfdSMatthew G. Knepley       PetscInt negsubcell;
2406766ab985SMatthew G. Knepley 
240787feddfdSMatthew G. Knepley       if (cells[p] >= cMax) continue;
240887feddfdSMatthew G. Knepley       /* I know this is a crap search */
240987feddfdSMatthew G. Knepley       for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) {
241087feddfdSMatthew G. Knepley         if (subCells[negsubcell] == cells[p]) break;
2411766ab985SMatthew G. Knepley       }
241287feddfdSMatthew G. Knepley       if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell);
241387feddfdSMatthew G. Knepley       ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr);
2414766ab985SMatthew G. Knepley     }
241587feddfdSMatthew G. Knepley     ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr);
241687feddfdSMatthew G. Knepley     ++newFacePoint;
2417766ab985SMatthew G. Knepley   }
2418766ab985SMatthew G. Knepley   ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2419766ab985SMatthew G. Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2420766ab985SMatthew G. Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2421766ab985SMatthew G. Knepley   /* Build coordinates */
2422766ab985SMatthew G. Knepley   {
2423766ab985SMatthew G. Knepley     PetscSection coordSection, subCoordSection;
2424766ab985SMatthew G. Knepley     Vec          coordinates, subCoordinates;
2425766ab985SMatthew G. Knepley     PetscScalar *coords, *subCoords;
2426285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize, v;
2427766ab985SMatthew G. Knepley 
2428766ab985SMatthew G. Knepley     ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2429766ab985SMatthew G. Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
2430766ab985SMatthew G. Knepley     ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2431285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2432285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2433285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2434766ab985SMatthew G. Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr);
2435766ab985SMatthew G. Knepley     for (v = 0; v < numSubVertices; ++v) {
2436766ab985SMatthew G. Knepley       const PetscInt vertex    = subVertices[v];
2437766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubVertex+v;
2438766ab985SMatthew G. Knepley       PetscInt       dof;
2439766ab985SMatthew G. Knepley 
2440766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2441766ab985SMatthew G. Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2442285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2443766ab985SMatthew G. Knepley     }
2444766ab985SMatthew G. Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2445766ab985SMatthew G. Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2446766ab985SMatthew G. Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2447766ab985SMatthew G. Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
24482eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2449766ab985SMatthew G. Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2450766ab985SMatthew G. Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2451766ab985SMatthew G. Knepley     for (v = 0; v < numSubVertices; ++v) {
2452766ab985SMatthew G. Knepley       const PetscInt vertex    = subVertices[v];
2453766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubVertex+v;
2454766ab985SMatthew G. Knepley       PetscInt       dof, off, sdof, soff, d;
2455766ab985SMatthew G. Knepley 
2456766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2457766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2458766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2459766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2460766ab985SMatthew 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);
2461766ab985SMatthew G. Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2462766ab985SMatthew G. Knepley     }
2463766ab985SMatthew G. Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2464766ab985SMatthew G. Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2465766ab985SMatthew G. Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2466766ab985SMatthew G. Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2467766ab985SMatthew G. Knepley   }
2468aca35d17SMatthew G. Knepley   /* Build SF */
2469aca35d17SMatthew G. Knepley   CHKMEMQ;
2470aca35d17SMatthew G. Knepley   {
2471aca35d17SMatthew G. Knepley     PetscSF            sfPoint, sfPointSub;
2472aca35d17SMatthew G. Knepley     const PetscSFNode *remotePoints;
2473bdcf2095SMatthew G. Knepley     PetscSFNode       *sremotePoints, *newLocalPoints, *newOwners;
2474aca35d17SMatthew G. Knepley     const PetscInt    *localPoints;
2475bdcf2095SMatthew G. Knepley     PetscInt          *slocalPoints;
247649c26ae4SMatthew G. Knepley     PetscInt           numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd;
2477bdcf2095SMatthew G. Knepley     PetscMPIInt        rank;
2478aca35d17SMatthew G. Knepley 
2479bdcf2095SMatthew G. Knepley     ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr);
2480aca35d17SMatthew G. Knepley     ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
2481aca35d17SMatthew G. Knepley     ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr);
2482aca35d17SMatthew G. Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
2483aca35d17SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
2484aca35d17SMatthew G. Knepley     ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
2485aca35d17SMatthew G. Knepley     if (numRoots >= 0) {
2486aca35d17SMatthew G. Knepley       /* Only vertices should be shared */
2487bdcf2095SMatthew G. Knepley       ierr = PetscMalloc2(pEnd-pStart,PetscSFNode,&newLocalPoints,numRoots,PetscSFNode,&newOwners);CHKERRQ(ierr);
2488bdcf2095SMatthew G. Knepley       for (p = 0; p < pEnd-pStart; ++p) {
2489bdcf2095SMatthew G. Knepley         newLocalPoints[p].rank  = -2;
2490bdcf2095SMatthew G. Knepley         newLocalPoints[p].index = -2;
2491bdcf2095SMatthew G. Knepley       }
24929e0823b2SMatthew G. Knepley       /* Set subleaves */
2493aca35d17SMatthew G. Knepley       for (l = 0; l < numLeaves; ++l) {
2494aca35d17SMatthew G. Knepley         const PetscInt point    = localPoints[l];
2495bdcf2095SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices);
2496aca35d17SMatthew G. Knepley 
2497aca35d17SMatthew G. Knepley         if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point);
2498bdcf2095SMatthew G. Knepley         if (subPoint < 0) continue;
2499bdcf2095SMatthew G. Knepley         newLocalPoints[point-pStart].rank  = rank;
2500bdcf2095SMatthew G. Knepley         newLocalPoints[point-pStart].index = subPoint;
2501bdcf2095SMatthew G. Knepley         ++numSubLeaves;
2502aca35d17SMatthew G. Knepley       }
25039e0823b2SMatthew G. Knepley       /* Must put in owned subpoints */
25049e0823b2SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {
25059e0823b2SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices);
25069e0823b2SMatthew G. Knepley 
25079e0823b2SMatthew G. Knepley         if (subPoint < 0) {
25089e0823b2SMatthew G. Knepley           newOwners[p-pStart].rank  = -3;
25099e0823b2SMatthew G. Knepley           newOwners[p-pStart].index = -3;
25109e0823b2SMatthew G. Knepley         } else {
25119e0823b2SMatthew G. Knepley           newOwners[p-pStart].rank  = rank;
25129e0823b2SMatthew G. Knepley           newOwners[p-pStart].index = subPoint;
25139e0823b2SMatthew G. Knepley         }
2514bdcf2095SMatthew G. Knepley       }
2515bdcf2095SMatthew G. Knepley       ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
2516bdcf2095SMatthew G. Knepley       ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
2517bdcf2095SMatthew G. Knepley       ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
2518bdcf2095SMatthew G. Knepley       ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
2519aca35d17SMatthew G. Knepley       ierr = PetscMalloc(numSubLeaves * sizeof(PetscInt),    &slocalPoints);CHKERRQ(ierr);
2520aca35d17SMatthew G. Knepley       ierr = PetscMalloc(numSubLeaves * sizeof(PetscSFNode), &sremotePoints);CHKERRQ(ierr);
252149c26ae4SMatthew G. Knepley       for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) {
2522bdcf2095SMatthew G. Knepley         const PetscInt point    = localPoints[l];
2523bdcf2095SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices);
2524aca35d17SMatthew G. Knepley 
2525aca35d17SMatthew G. Knepley         if (subPoint < 0) continue;
252649c26ae4SMatthew G. Knepley         if (newLocalPoints[point].rank == rank) {++ll; continue;}
2527aca35d17SMatthew G. Knepley         slocalPoints[sl]        = subPoint;
2528bdcf2095SMatthew G. Knepley         sremotePoints[sl].rank  = newLocalPoints[point].rank;
2529bdcf2095SMatthew G. Knepley         sremotePoints[sl].index = newLocalPoints[point].index;
2530bdcf2095SMatthew G. Knepley         if (sremotePoints[sl].rank  < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point);
2531bdcf2095SMatthew G. Knepley         if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point);
2532aca35d17SMatthew G. Knepley         ++sl;
2533aca35d17SMatthew G. Knepley       }
2534bdcf2095SMatthew G. Knepley       ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr);
253549c26ae4SMatthew G. Knepley       if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves);
253649c26ae4SMatthew G. Knepley       ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
2537aca35d17SMatthew G. Knepley     }
2538aca35d17SMatthew G. Knepley   }
2539aca35d17SMatthew G. Knepley   CHKMEMQ;
2540766ab985SMatthew G. Knepley   /* Cleanup */
2541766ab985SMatthew G. Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2542766ab985SMatthew G. Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
2543766ab985SMatthew G. Knepley   ierr = PetscFree(subCells);CHKERRQ(ierr);
2544766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
2545766ab985SMatthew G. Knepley }
2546766ab985SMatthew G. Knepley 
2547766ab985SMatthew G. Knepley #undef __FUNCT__
2548766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated"
254927c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm)
2550766ab985SMatthew G. Knepley {
2551766ab985SMatthew G. Knepley   MPI_Comm         comm;
2552766ab985SMatthew G. Knepley   DMLabel          subpointMap;
2553766ab985SMatthew G. Knepley   IS              *subpointIS;
2554766ab985SMatthew G. Knepley   const PetscInt **subpoints;
2555766ab985SMatthew G. Knepley   PetscInt        *numSubPoints, *firstSubPoint, *coneNew;
2556766ab985SMatthew G. Knepley   PetscInt         totSubPoints = 0, maxConeSize, dim, p, d, v;
2557766ab985SMatthew G. Knepley   PetscErrorCode   ierr;
2558766ab985SMatthew G. Knepley 
2559766ab985SMatthew G. Knepley   PetscFunctionBegin;
2560766ab985SMatthew G. Knepley   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2561766ab985SMatthew G. Knepley   /* Create subpointMap which marks the submesh */
2562766ab985SMatthew G. Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2563766ab985SMatthew G. Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2564766ab985SMatthew G. Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
256527c04023SMatthew G. Knepley   ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, hasLagrange, label, value, subpointMap, subdm);CHKERRQ(ierr);
2566766ab985SMatthew G. Knepley   /* Setup chart */
2567766ab985SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
2568766ab985SMatthew G. Knepley   ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr);
2569766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
2570766ab985SMatthew G. Knepley     ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr);
2571766ab985SMatthew G. Knepley     totSubPoints += numSubPoints[d];
2572766ab985SMatthew G. Knepley   }
2573766ab985SMatthew G. Knepley   ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr);
2574766ab985SMatthew G. Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2575766ab985SMatthew G. Knepley   /* Set cone sizes */
2576766ab985SMatthew G. Knepley   firstSubPoint[dim] = 0;
2577766ab985SMatthew G. Knepley   firstSubPoint[0]   = firstSubPoint[dim] + numSubPoints[dim];
2578766ab985SMatthew G. Knepley   if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0]     + numSubPoints[0];}
2579766ab985SMatthew G. Knepley   if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];}
2580766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
2581766ab985SMatthew G. Knepley     ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr);
2582766ab985SMatthew G. Knepley     ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);
2583766ab985SMatthew G. Knepley   }
2584766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
2585766ab985SMatthew G. Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2586766ab985SMatthew G. Knepley       const PetscInt  point    = subpoints[d][p];
2587766ab985SMatthew G. Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
2588766ab985SMatthew G. Knepley       const PetscInt *cone;
2589766ab985SMatthew G. Knepley       PetscInt        coneSize, coneSizeNew, c, val;
2590766ab985SMatthew G. Knepley 
2591766ab985SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2592766ab985SMatthew G. Knepley       ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr);
2593766ab985SMatthew G. Knepley       if (d == dim) {
2594766ab985SMatthew G. Knepley         ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
2595766ab985SMatthew G. Knepley         for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2596766ab985SMatthew G. Knepley           ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr);
2597766ab985SMatthew G. Knepley           if (val >= 0) coneSizeNew++;
2598766ab985SMatthew G. Knepley         }
2599766ab985SMatthew G. Knepley         ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr);
2600766ab985SMatthew G. Knepley       }
2601766ab985SMatthew G. Knepley     }
2602766ab985SMatthew G. Knepley   }
2603766ab985SMatthew G. Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2604766ab985SMatthew G. Knepley   /* Set cones */
2605766ab985SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
2606766ab985SMatthew G. Knepley   ierr = PetscMalloc(maxConeSize * sizeof(PetscInt), &coneNew);CHKERRQ(ierr);
2607766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
2608766ab985SMatthew G. Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2609766ab985SMatthew G. Knepley       const PetscInt  point    = subpoints[d][p];
2610766ab985SMatthew G. Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
2611766ab985SMatthew G. Knepley       const PetscInt *cone;
2612766ab985SMatthew G. Knepley       PetscInt        coneSize, subconeSize, coneSizeNew, c, subc;
2613766ab985SMatthew G. Knepley 
2614766ab985SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2615766ab985SMatthew G. Knepley       ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
2616766ab985SMatthew G. Knepley       ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
2617766ab985SMatthew G. Knepley       for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2618766ab985SMatthew G. Knepley         ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr);
2619766ab985SMatthew G. Knepley         if (subc >= 0) coneNew[coneSizeNew++] = firstSubPoint[d-1] + subc;
2620766ab985SMatthew G. Knepley       }
2621766ab985SMatthew G. Knepley       if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize);
2622766ab985SMatthew G. Knepley       ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr);
2623766ab985SMatthew G. Knepley     }
2624766ab985SMatthew G. Knepley   }
2625766ab985SMatthew G. Knepley   ierr = PetscFree(coneNew);CHKERRQ(ierr);
2626766ab985SMatthew G. Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2627766ab985SMatthew G. Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2628766ab985SMatthew G. Knepley   /* Build coordinates */
2629766ab985SMatthew G. Knepley   {
2630766ab985SMatthew G. Knepley     PetscSection coordSection, subCoordSection;
2631766ab985SMatthew G. Knepley     Vec          coordinates, subCoordinates;
2632766ab985SMatthew G. Knepley     PetscScalar *coords, *subCoords;
2633285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize;
2634766ab985SMatthew G. Knepley 
2635766ab985SMatthew G. Knepley     ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2636766ab985SMatthew G. Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
2637766ab985SMatthew G. Knepley     ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2638285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2639285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2640285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2641766ab985SMatthew G. Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr);
2642766ab985SMatthew G. Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2643766ab985SMatthew G. Knepley       const PetscInt vertex    = subpoints[0][v];
2644766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2645766ab985SMatthew G. Knepley       PetscInt       dof;
2646766ab985SMatthew G. Knepley 
2647766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2648766ab985SMatthew G. Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2649285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2650766ab985SMatthew G. Knepley     }
2651766ab985SMatthew G. Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2652766ab985SMatthew G. Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2653766ab985SMatthew G. Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2654766ab985SMatthew G. Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
26552eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2656766ab985SMatthew G. Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2657766ab985SMatthew G. Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2658766ab985SMatthew G. Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2659766ab985SMatthew G. Knepley       const PetscInt vertex    = subpoints[0][v];
2660766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2661766ab985SMatthew G. Knepley       PetscInt dof, off, sdof, soff, d;
2662766ab985SMatthew G. Knepley 
2663766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2664766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2665766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2666766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2667766ab985SMatthew 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);
2668766ab985SMatthew G. Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2669766ab985SMatthew G. Knepley     }
2670766ab985SMatthew G. Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2671766ab985SMatthew G. Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2672766ab985SMatthew G. Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2673766ab985SMatthew G. Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2674766ab985SMatthew G. Knepley   }
2675766ab985SMatthew G. Knepley   /* Cleanup */
2676766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
2677766ab985SMatthew G. Knepley     ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);
2678766ab985SMatthew G. Knepley     ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr);
2679766ab985SMatthew G. Knepley   }
2680766ab985SMatthew G. Knepley   ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr);
2681766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
2682766ab985SMatthew G. Knepley }
2683766ab985SMatthew G. Knepley 
2684766ab985SMatthew G. Knepley #undef __FUNCT__
2685766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh"
2686766ab985SMatthew G. Knepley /*
268727c04023SMatthew G. Knepley   DMPlexCreateCohesiveSubmesh - Extract from a mesh with cohesive cells the hypersurface defined by one face of the cells. Optionally, a Label an be given to restrict the cells.
2688766ab985SMatthew G. Knepley 
2689766ab985SMatthew G. Knepley   Input Parameters:
2690766ab985SMatthew G. Knepley + dm          - The original mesh
269127c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells
269227c04023SMatthew G. Knepley . label       - A label name, or PETSC_NULL
269327c04023SMatthew G. Knepley - value  - A label value
2694766ab985SMatthew G. Knepley 
2695766ab985SMatthew G. Knepley   Output Parameter:
2696766ab985SMatthew G. Knepley . subdm - The surface mesh
2697766ab985SMatthew G. Knepley 
2698766ab985SMatthew G. Knepley   Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap().
2699766ab985SMatthew G. Knepley 
2700766ab985SMatthew G. Knepley   Level: developer
2701766ab985SMatthew G. Knepley 
2702766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh()
2703766ab985SMatthew G. Knepley */
270427c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm)
2705766ab985SMatthew G. Knepley {
2706766ab985SMatthew G. Knepley   PetscInt       dim, depth;
2707766ab985SMatthew G. Knepley   PetscErrorCode ierr;
2708766ab985SMatthew G. Knepley 
2709766ab985SMatthew G. Knepley   PetscFunctionBegin;
2710766ab985SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
271127c04023SMatthew G. Knepley   PetscValidPointer(subdm, 5);
2712766ab985SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
2713766ab985SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
2714766ab985SMatthew G. Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr);
2715766ab985SMatthew G. Knepley   ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr);
2716766ab985SMatthew G. Knepley   ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr);
2717766ab985SMatthew G. Knepley   if (depth == dim) {
271827c04023SMatthew G. Knepley     ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr);
2719766ab985SMatthew G. Knepley   } else {
272027c04023SMatthew G. Knepley     ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr);
2721e6ccafaeSMatthew G Knepley   }
2722e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2723e6ccafaeSMatthew G Knepley }
2724e6ccafaeSMatthew G Knepley 
2725e6ccafaeSMatthew G Knepley #undef __FUNCT__
2726e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap"
272764beef6dSMatthew G. Knepley /*@
272864beef6dSMatthew G. Knepley   DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values
272964beef6dSMatthew G. Knepley 
273064beef6dSMatthew G. Knepley   Input Parameter:
273164beef6dSMatthew G. Knepley . dm - The submesh DM
273264beef6dSMatthew G. Knepley 
273364beef6dSMatthew G. Knepley   Output Parameter:
273464beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh
273564beef6dSMatthew G. Knepley 
273664beef6dSMatthew G. Knepley   Level: developer
273764beef6dSMatthew G. Knepley 
273864beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS()
273964beef6dSMatthew G. Knepley @*/
2740e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap)
2741e6ccafaeSMatthew G Knepley {
2742e6ccafaeSMatthew G Knepley   DM_Plex *mesh = (DM_Plex*) dm->data;
2743e6ccafaeSMatthew G Knepley 
2744e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
2745e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2746e6ccafaeSMatthew G Knepley   PetscValidPointer(subpointMap, 2);
2747e6ccafaeSMatthew G Knepley   *subpointMap = mesh->subpointMap;
2748e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2749e6ccafaeSMatthew G Knepley }
2750e6ccafaeSMatthew G Knepley 
2751e6ccafaeSMatthew G Knepley #undef __FUNCT__
2752e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap"
2753e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */
2754e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap)
2755e6ccafaeSMatthew G Knepley {
2756e6ccafaeSMatthew G Knepley   DM_Plex       *mesh = (DM_Plex *) dm->data;
2757285d324eSMatthew G. Knepley   DMLabel        tmp;
2758e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
2759e6ccafaeSMatthew G Knepley 
2760e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
2761e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2762285d324eSMatthew G. Knepley   tmp  = mesh->subpointMap;
2763e6ccafaeSMatthew G Knepley   mesh->subpointMap = subpointMap;
2764285d324eSMatthew G. Knepley   ++mesh->subpointMap->refct;
2765285d324eSMatthew G. Knepley   ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr);
2766e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2767e6ccafaeSMatthew G Knepley }
2768e6ccafaeSMatthew G Knepley 
2769e6ccafaeSMatthew G Knepley #undef __FUNCT__
2770e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS"
277164beef6dSMatthew G. Knepley /*@
2772e6ccafaeSMatthew G Knepley   DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data
2773e6ccafaeSMatthew G Knepley 
2774e6ccafaeSMatthew G Knepley   Input Parameter:
2775e6ccafaeSMatthew G Knepley . dm - The submesh DM
2776e6ccafaeSMatthew G Knepley 
2777e6ccafaeSMatthew G Knepley   Output Parameter:
27780298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh
2779e6ccafaeSMatthew G Knepley 
2780e6ccafaeSMatthew G Knepley   Note: This is IS is guaranteed to be sorted by the construction of the submesh
278164beef6dSMatthew G. Knepley 
278264beef6dSMatthew G. Knepley   Level: developer
278364beef6dSMatthew G. Knepley 
278464beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap()
278564beef6dSMatthew G. Knepley @*/
2786e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS)
2787e6ccafaeSMatthew G Knepley {
278882f516ccSBarry Smith   MPI_Comm        comm;
2789e6ccafaeSMatthew G Knepley   DMLabel         subpointMap;
2790e6ccafaeSMatthew G Knepley   IS              is;
2791e6ccafaeSMatthew G Knepley   const PetscInt *opoints;
2792e6ccafaeSMatthew G Knepley   PetscInt       *points, *depths;
2793e6ccafaeSMatthew G Knepley   PetscInt        depth, depStart, depEnd, d, pStart, pEnd, p, n, off;
2794e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2795e6ccafaeSMatthew G Knepley 
2796e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
2797e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2798e6ccafaeSMatthew G Knepley   PetscValidPointer(subpointIS, 2);
279982f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
28000298fd71SBarry Smith   *subpointIS = NULL;
2801e6ccafaeSMatthew G Knepley   ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr);
2802e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
2803fed694aaSMatthew G. Knepley   if (subpointMap && depth >= 0) {
2804e6ccafaeSMatthew G Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
2805e6ccafaeSMatthew G Knepley     if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart);
2806e6ccafaeSMatthew G Knepley     ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr);
2807e6ccafaeSMatthew G Knepley     depths[0] = depth;
2808e6ccafaeSMatthew G Knepley     depths[1] = 0;
2809e6ccafaeSMatthew G Knepley     for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;}
2810e6ccafaeSMatthew G Knepley     ierr = PetscMalloc(pEnd * sizeof(PetscInt), &points);CHKERRQ(ierr);
2811e6ccafaeSMatthew G Knepley     for(d = 0, off = 0; d <= depth; ++d) {
2812e6ccafaeSMatthew G Knepley       const PetscInt dep = depths[d];
2813e6ccafaeSMatthew G Knepley 
2814e6ccafaeSMatthew G Knepley       ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr);
2815e6ccafaeSMatthew G Knepley       ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr);
28161e21b6fdSMatthew G Knepley       if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */
2817e6ccafaeSMatthew 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);
2818e6ccafaeSMatthew G Knepley       } else {
28191e21b6fdSMatthew G Knepley         if (!n) {
28201e21b6fdSMatthew G Knepley           if (d == 0) {
28211e21b6fdSMatthew G Knepley             /* Missing cells */
28221e21b6fdSMatthew G Knepley             for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1;
28231e21b6fdSMatthew G Knepley           } else {
28241e21b6fdSMatthew G Knepley             /* Missing faces */
28251e21b6fdSMatthew G Knepley             for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT;
28261e21b6fdSMatthew G Knepley           }
28271e21b6fdSMatthew G Knepley         }
2828e6ccafaeSMatthew G Knepley       }
2829e6ccafaeSMatthew G Knepley       if (n) {
2830e6ccafaeSMatthew G Knepley         ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr);
2831e6ccafaeSMatthew G Knepley         ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr);
2832e6ccafaeSMatthew G Knepley         for(p = 0; p < n; ++p, ++off) points[off] = opoints[p];
2833e6ccafaeSMatthew G Knepley         ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr);
2834e6ccafaeSMatthew G Knepley         ierr = ISDestroy(&is);CHKERRQ(ierr);
2835e6ccafaeSMatthew G Knepley       }
2836e6ccafaeSMatthew G Knepley     }
2837e6ccafaeSMatthew G Knepley     ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr);
2838e6ccafaeSMatthew G Knepley     if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd);
2839fed694aaSMatthew G. Knepley     ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr);
2840e6ccafaeSMatthew G Knepley   }
2841e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2842e6ccafaeSMatthew G Knepley }
2843