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