134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 20c312b8eSJed Brown #include <petscsf.h> 3e6ccafaeSMatthew G Knepley 4e6ccafaeSMatthew G Knepley #undef __FUNCT__ 5cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces" 6cd0c2139SMatthew G Knepley /*@ 7cd0c2139SMatthew G Knepley DMPlexMarkBoundaryFaces - Mark all faces on the boundary 8cd0c2139SMatthew G Knepley 9cd0c2139SMatthew G Knepley Not Collective 10cd0c2139SMatthew G Knepley 11cd0c2139SMatthew G Knepley Input Parameter: 12cd0c2139SMatthew G Knepley . dm - The original DM 13cd0c2139SMatthew G Knepley 14cd0c2139SMatthew G Knepley Output Parameter: 15cd0c2139SMatthew G Knepley . label - The DMLabel marking boundary faces with value 1 16cd0c2139SMatthew G Knepley 17cd0c2139SMatthew G Knepley Level: developer 18cd0c2139SMatthew G Knepley 19cd0c2139SMatthew G Knepley .seealso: DMLabelCreate(), DMPlexCreateLabel() 2009f723d9SJed Brown @*/ 21cd0c2139SMatthew G Knepley PetscErrorCode DMPlexMarkBoundaryFaces(DM dm, DMLabel label) 22cd0c2139SMatthew G Knepley { 23cd0c2139SMatthew G Knepley PetscInt fStart, fEnd, f; 24cd0c2139SMatthew G Knepley PetscErrorCode ierr; 25cd0c2139SMatthew G Knepley 26cd0c2139SMatthew G Knepley PetscFunctionBegin; 27cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 28cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 29cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 30cd0c2139SMatthew G Knepley PetscInt supportSize; 31cd0c2139SMatthew G Knepley 32cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 33cd0c2139SMatthew G Knepley if (supportSize == 1) { 34cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, f, 1);CHKERRQ(ierr); 35cd0c2139SMatthew G Knepley } 36cd0c2139SMatthew G Knepley } 37cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 38cd0c2139SMatthew G Knepley } 39cd0c2139SMatthew G Knepley 40cd0c2139SMatthew G Knepley #undef __FUNCT__ 412be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelComplete" 422be2b188SMatthew G Knepley /*@ 432be2b188SMatthew G Knepley DMPlexLabelComplete - Starting with a label marking points on a surface, we add the transitive closure to the surface 442be2b188SMatthew G Knepley 452be2b188SMatthew G Knepley Input Parameters: 462be2b188SMatthew G Knepley + dm - The DM 472be2b188SMatthew G Knepley - label - A DMLabel marking the surface points 482be2b188SMatthew G Knepley 492be2b188SMatthew G Knepley Output Parameter: 502be2b188SMatthew G Knepley . label - A DMLabel marking all surface points in the transitive closure 512be2b188SMatthew G Knepley 522be2b188SMatthew G Knepley Level: developer 532be2b188SMatthew G Knepley 542be2b188SMatthew G Knepley .seealso: DMPlexLabelCohesiveComplete() 552be2b188SMatthew G Knepley @*/ 562be2b188SMatthew G Knepley PetscErrorCode DMPlexLabelComplete(DM dm, DMLabel label) 572be2b188SMatthew G Knepley { 582be2b188SMatthew G Knepley IS valueIS; 592be2b188SMatthew G Knepley const PetscInt *values; 602be2b188SMatthew G Knepley PetscInt numValues, v; 612be2b188SMatthew G Knepley PetscErrorCode ierr; 622be2b188SMatthew G Knepley 632be2b188SMatthew G Knepley PetscFunctionBegin; 642be2b188SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 652be2b188SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 662be2b188SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 672be2b188SMatthew G Knepley for (v = 0; v < numValues; ++v) { 682be2b188SMatthew G Knepley IS pointIS; 692be2b188SMatthew G Knepley const PetscInt *points; 702be2b188SMatthew G Knepley PetscInt numPoints, p; 712be2b188SMatthew G Knepley 722be2b188SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 732be2b188SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 742be2b188SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 752be2b188SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 762be2b188SMatthew G Knepley PetscInt *closure = NULL; 772be2b188SMatthew G Knepley PetscInt closureSize, c; 782be2b188SMatthew G Knepley 792be2b188SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 802be2b188SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 812be2b188SMatthew G Knepley ierr = DMLabelSetValue(label, closure[c], values[v]);CHKERRQ(ierr); 822be2b188SMatthew G Knepley } 832be2b188SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 842be2b188SMatthew G Knepley } 852be2b188SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 862be2b188SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 872be2b188SMatthew G Knepley } 882be2b188SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 892be2b188SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 902be2b188SMatthew G Knepley PetscFunctionReturn(0); 912be2b188SMatthew G Knepley } 922be2b188SMatthew G Knepley 932be2b188SMatthew G Knepley #undef __FUNCT__ 94cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoint_Internal" 95cd0c2139SMatthew G Knepley PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthEnd[], PetscInt depthShift[]) 96cd0c2139SMatthew G Knepley { 97cd0c2139SMatthew G Knepley if (depth < 0) return p; 98cd0c2139SMatthew G Knepley /* Cells */ if (p < depthEnd[depth]) return p; 99cd0c2139SMatthew G Knepley /* Vertices */ if (p < depthEnd[0]) return p + depthShift[depth]; 100cd0c2139SMatthew G Knepley /* Faces */ if (p < depthEnd[depth-1]) return p + depthShift[depth] + depthShift[0]; 101cd0c2139SMatthew G Knepley /* Edges */ return p + depthShift[depth] + depthShift[0] + depthShift[depth-1]; 102cd0c2139SMatthew G Knepley } 103cd0c2139SMatthew G Knepley 104cd0c2139SMatthew G Knepley #undef __FUNCT__ 105cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSizes_Internal" 106cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew) 107cd0c2139SMatthew G Knepley { 108cd0c2139SMatthew G Knepley PetscInt *depthEnd; 109cd0c2139SMatthew G Knepley PetscInt depth = 0, d, pStart, pEnd, p; 110cd0c2139SMatthew G Knepley PetscErrorCode ierr; 111cd0c2139SMatthew G Knepley 112cd0c2139SMatthew G Knepley PetscFunctionBegin; 113cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 114cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 115cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 116cd0c2139SMatthew G Knepley /* Step 1: Expand chart */ 117cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 118cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 119cd0c2139SMatthew G Knepley pEnd += depthShift[d]; 120cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 121cd0c2139SMatthew G Knepley } 122cd0c2139SMatthew G Knepley ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr); 123cd0c2139SMatthew G Knepley /* Step 2: Set cone and support sizes */ 124cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 125cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 126cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 127cd0c2139SMatthew G Knepley PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthEnd, depthShift); 128cd0c2139SMatthew G Knepley PetscInt size; 129cd0c2139SMatthew G Knepley 130cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 131cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr); 132cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 133cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr); 134cd0c2139SMatthew G Knepley } 135cd0c2139SMatthew G Knepley } 136cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 137cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 138cd0c2139SMatthew G Knepley } 139cd0c2139SMatthew G Knepley 140cd0c2139SMatthew G Knepley #undef __FUNCT__ 141cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoints_Internal" 142cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew) 143cd0c2139SMatthew G Knepley { 144cd0c2139SMatthew G Knepley PetscInt *depthEnd, *newpoints; 145cd0c2139SMatthew G Knepley PetscInt depth = 0, d, maxConeSize, maxSupportSize, pStart, pEnd, p; 146cd0c2139SMatthew G Knepley PetscErrorCode ierr; 147cd0c2139SMatthew G Knepley 148cd0c2139SMatthew G Knepley PetscFunctionBegin; 149cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 150cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 151cd0c2139SMatthew G Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 152cd0c2139SMatthew G Knepley ierr = PetscMalloc2(depth+1,PetscInt,&depthEnd,PetscMax(maxConeSize, maxSupportSize),PetscInt,&newpoints);CHKERRQ(ierr); 153cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 154cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 155cd0c2139SMatthew G Knepley } 156cd0c2139SMatthew G Knepley /* Step 5: Set cones and supports */ 157cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 158cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 159cd0c2139SMatthew G Knepley const PetscInt *points = NULL, *orientations = NULL; 160cd0c2139SMatthew G Knepley PetscInt size, i, newp = DMPlexShiftPoint_Internal(p, depth, depthEnd, depthShift); 161cd0c2139SMatthew G Knepley 162cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 163cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr); 164cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr); 165cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 166cd0c2139SMatthew G Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthEnd, depthShift); 167cd0c2139SMatthew G Knepley } 168cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr); 169cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr); 170cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 171cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr); 172cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 173cd0c2139SMatthew G Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthEnd, depthShift); 174cd0c2139SMatthew G Knepley } 175cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr); 176cd0c2139SMatthew G Knepley } 177cd0c2139SMatthew G Knepley ierr = PetscFree2(depthEnd,newpoints);CHKERRQ(ierr); 178cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 179cd0c2139SMatthew G Knepley } 180cd0c2139SMatthew G Knepley 181cd0c2139SMatthew G Knepley #undef __FUNCT__ 182cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftCoordinates_Internal" 183cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew) 184cd0c2139SMatthew G Knepley { 185cd0c2139SMatthew G Knepley PetscSection coordSection, newCoordSection; 186cd0c2139SMatthew G Knepley Vec coordinates, newCoordinates; 187cd0c2139SMatthew G Knepley PetscScalar *coords, *newCoords; 188cd0c2139SMatthew G Knepley PetscInt *depthEnd, coordSize; 189cd0c2139SMatthew G Knepley PetscInt dim, depth = 0, d, vStart, vEnd, vStartNew, vEndNew, v; 190cd0c2139SMatthew G Knepley PetscErrorCode ierr; 191cd0c2139SMatthew G Knepley 192cd0c2139SMatthew G Knepley PetscFunctionBegin; 193cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 194cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 195cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 196cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 197cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 198cd0c2139SMatthew G Knepley } 199cd0c2139SMatthew G Knepley /* Step 8: Convert coordinates */ 200cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 201cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr); 202cd0c2139SMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 203cd0c2139SMatthew G Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr); 204cd0c2139SMatthew G Knepley ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr); 205cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr); 206cd0c2139SMatthew G Knepley ierr = PetscSectionSetChart(newCoordSection, vStartNew, vEndNew);CHKERRQ(ierr); 207cd0c2139SMatthew G Knepley for (v = vStartNew; v < vEndNew; ++v) { 208cd0c2139SMatthew G Knepley ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr); 209cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr); 210cd0c2139SMatthew G Knepley } 211cd0c2139SMatthew G Knepley ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr); 212cd0c2139SMatthew G Knepley ierr = DMPlexSetCoordinateSection(dmNew, newCoordSection);CHKERRQ(ierr); 213cd0c2139SMatthew G Knepley ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr); 214cd0c2139SMatthew G Knepley ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr); 215cd0c2139SMatthew G Knepley ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr); 216cd0c2139SMatthew G Knepley ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2172eb5907fSJed Brown ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr); 218cd0c2139SMatthew G Knepley ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr); 219cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 220cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 221cd0c2139SMatthew G Knepley ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr); 222cd0c2139SMatthew G Knepley for (v = vStart; v < vEnd; ++v) { 223cd0c2139SMatthew G Knepley PetscInt dof, off, noff, d; 224cd0c2139SMatthew G Knepley 225cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 226cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 227cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthEnd, depthShift), &noff);CHKERRQ(ierr); 228cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) { 229cd0c2139SMatthew G Knepley newCoords[noff+d] = coords[off+d]; 230cd0c2139SMatthew G Knepley } 231cd0c2139SMatthew G Knepley } 232cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 233cd0c2139SMatthew G Knepley ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr); 234cd0c2139SMatthew G Knepley ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 235cd0c2139SMatthew G Knepley ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr); 236cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 237cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 238cd0c2139SMatthew G Knepley } 239cd0c2139SMatthew G Knepley 240cd0c2139SMatthew G Knepley #undef __FUNCT__ 241cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal" 242cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew) 243cd0c2139SMatthew G Knepley { 244cd0c2139SMatthew G Knepley PetscInt *depthEnd; 245cd0c2139SMatthew G Knepley PetscInt depth = 0, d; 246cd0c2139SMatthew G Knepley PetscSF sfPoint, sfPointNew; 247cd0c2139SMatthew G Knepley const PetscSFNode *remotePoints; 248cd0c2139SMatthew G Knepley PetscSFNode *gremotePoints; 249cd0c2139SMatthew G Knepley const PetscInt *localPoints; 250cd0c2139SMatthew G Knepley PetscInt *glocalPoints, *newLocation, *newRemoteLocation; 251cd0c2139SMatthew G Knepley PetscInt numRoots, numLeaves, l, pStart, pEnd, totShift = 0; 252cd0c2139SMatthew G Knepley PetscErrorCode ierr; 253cd0c2139SMatthew G Knepley 254cd0c2139SMatthew G Knepley PetscFunctionBegin; 255cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 256cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 257cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 258cd0c2139SMatthew G Knepley totShift += depthShift[d]; 259cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 260cd0c2139SMatthew G Knepley } 261cd0c2139SMatthew G Knepley /* Step 9: Convert pointSF */ 262cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 263cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr); 264cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 265cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 266cd0c2139SMatthew G Knepley if (numRoots >= 0) { 267cd0c2139SMatthew G Knepley ierr = PetscMalloc2(numRoots,PetscInt,&newLocation,pEnd-pStart,PetscInt,&newRemoteLocation);CHKERRQ(ierr); 268cd0c2139SMatthew G Knepley for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthEnd, depthShift); 269cd0c2139SMatthew G Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 270cd0c2139SMatthew G Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 271cd0c2139SMatthew G Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscInt), &glocalPoints);CHKERRQ(ierr); 272cd0c2139SMatthew G Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscSFNode), &gremotePoints);CHKERRQ(ierr); 273cd0c2139SMatthew G Knepley for (l = 0; l < numLeaves; ++l) { 274cd0c2139SMatthew G Knepley glocalPoints[l] = DMPlexShiftPoint_Internal(localPoints[l], depth, depthEnd, depthShift); 275cd0c2139SMatthew G Knepley gremotePoints[l].rank = remotePoints[l].rank; 276cd0c2139SMatthew G Knepley gremotePoints[l].index = newRemoteLocation[localPoints[l]]; 277cd0c2139SMatthew G Knepley } 278cd0c2139SMatthew G Knepley ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr); 279cd0c2139SMatthew G Knepley ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 280cd0c2139SMatthew G Knepley } 281cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 282cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 283cd0c2139SMatthew G Knepley } 284cd0c2139SMatthew G Knepley 285cd0c2139SMatthew G Knepley #undef __FUNCT__ 286cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal" 287cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew) 288cd0c2139SMatthew G Knepley { 289cd0c2139SMatthew G Knepley PetscSF sfPoint; 290cd0c2139SMatthew G Knepley DMLabel vtkLabel, ghostLabel; 291cd0c2139SMatthew G Knepley PetscInt *depthEnd; 292cd0c2139SMatthew G Knepley const PetscSFNode *leafRemote; 293cd0c2139SMatthew G Knepley const PetscInt *leafLocal; 294cd0c2139SMatthew G Knepley PetscInt depth = 0, d, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f; 295cd0c2139SMatthew G Knepley PetscMPIInt rank; 296cd0c2139SMatthew G Knepley PetscErrorCode ierr; 297cd0c2139SMatthew G Knepley 298cd0c2139SMatthew G Knepley PetscFunctionBegin; 299cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 300cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 301cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 302cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 303cd0c2139SMatthew G Knepley } 304cd0c2139SMatthew G Knepley /* Step 10: Convert labels */ 305cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 306cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 307cd0c2139SMatthew G Knepley DMLabel label, newlabel; 308cd0c2139SMatthew G Knepley const char *lname; 309cd0c2139SMatthew G Knepley PetscBool isDepth; 310cd0c2139SMatthew G Knepley IS valueIS; 311cd0c2139SMatthew G Knepley const PetscInt *values; 312cd0c2139SMatthew G Knepley PetscInt numValues, val; 313cd0c2139SMatthew G Knepley 314cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr); 315cd0c2139SMatthew G Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 316cd0c2139SMatthew G Knepley if (isDepth) continue; 317cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, lname);CHKERRQ(ierr); 318cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr); 319cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr); 320cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 321cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 322cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 323cd0c2139SMatthew G Knepley for (val = 0; val < numValues; ++val) { 324cd0c2139SMatthew G Knepley IS pointIS; 325cd0c2139SMatthew G Knepley const PetscInt *points; 326cd0c2139SMatthew G Knepley PetscInt numPoints, p; 327cd0c2139SMatthew G Knepley 328cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 329cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 330cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 331cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 332cd0c2139SMatthew G Knepley const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthEnd, depthShift); 333cd0c2139SMatthew G Knepley 334cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr); 335cd0c2139SMatthew G Knepley } 336cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 337cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 338cd0c2139SMatthew G Knepley } 339cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 340cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 341cd0c2139SMatthew G Knepley } 342cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 343cd0c2139SMatthew G Knepley /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */ 344cd0c2139SMatthew G Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 345cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 346cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 347cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr); 348cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "vtk");CHKERRQ(ierr); 349cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "ghost");CHKERRQ(ierr); 350cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr); 351cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr); 352cd0c2139SMatthew G Knepley for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { 353cd0c2139SMatthew G Knepley for (; c < leafLocal[l] && c < cEnd; ++c) { 354cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 355cd0c2139SMatthew G Knepley } 356cd0c2139SMatthew G Knepley if (leafLocal[l] >= cEnd) break; 357cd0c2139SMatthew G Knepley if (leafRemote[l].rank == rank) { 358cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 359cd0c2139SMatthew G Knepley } else { 360cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr); 361cd0c2139SMatthew G Knepley } 362cd0c2139SMatthew G Knepley } 363cd0c2139SMatthew G Knepley for (; c < cEnd; ++c) { 364cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 365cd0c2139SMatthew G Knepley } 366cd0c2139SMatthew G Knepley if (0) { 367cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 368cd0c2139SMatthew G Knepley ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 369cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 370cd0c2139SMatthew G Knepley } 371cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr); 372cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 373cd0c2139SMatthew G Knepley PetscInt numCells; 374cd0c2139SMatthew G Knepley 375cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr); 376cd0c2139SMatthew G Knepley if (numCells < 2) { 377cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr); 378cd0c2139SMatthew G Knepley } else { 379cd0c2139SMatthew G Knepley const PetscInt *cells = NULL; 380cd0c2139SMatthew G Knepley PetscInt vA, vB; 381cd0c2139SMatthew G Knepley 382cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr); 383cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr); 384cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr); 385cd0c2139SMatthew G Knepley if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);} 386cd0c2139SMatthew G Knepley } 387cd0c2139SMatthew G Knepley } 388cd0c2139SMatthew G Knepley if (0) { 389cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 390cd0c2139SMatthew G Knepley ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 391cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 392cd0c2139SMatthew G Knepley } 393cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 394cd0c2139SMatthew G Knepley } 395cd0c2139SMatthew G Knepley 396cd0c2139SMatthew G Knepley #undef __FUNCT__ 397cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal" 398cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm) 399cd0c2139SMatthew G Knepley { 400cd0c2139SMatthew G Knepley IS valueIS; 401cd0c2139SMatthew G Knepley const PetscInt *values; 402cd0c2139SMatthew G Knepley PetscInt *depthShift; 403cd0c2139SMatthew G Knepley PetscInt depth = 0, numFS, fs, ghostCell, cEnd, c; 404cd0c2139SMatthew G Knepley PetscErrorCode ierr; 405cd0c2139SMatthew G Knepley 406cd0c2139SMatthew G Knepley PetscFunctionBegin; 407cd0c2139SMatthew G Knepley /* Count ghost cells */ 408cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 409cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr); 410cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 411cd0c2139SMatthew G Knepley 412cd0c2139SMatthew G Knepley *numGhostCells = 0; 413cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 414cd0c2139SMatthew G Knepley PetscInt numBdFaces; 415cd0c2139SMatthew G Knepley 416cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[fs], &numBdFaces);CHKERRQ(ierr); 417cd0c2139SMatthew G Knepley 418cd0c2139SMatthew G Knepley *numGhostCells += numBdFaces; 419cd0c2139SMatthew G Knepley } 420cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 421cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthShift);CHKERRQ(ierr); 422cd0c2139SMatthew G Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 423cd0c2139SMatthew G Knepley if (depth >= 0) depthShift[depth] = *numGhostCells; 424cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 425cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 426cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 427cd0c2139SMatthew G Knepley for (c = cEnd; c < cEnd + *numGhostCells; ++c) { 428cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr); 429cd0c2139SMatthew G Knepley } 430cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 431cd0c2139SMatthew G Knepley IS faceIS; 432cd0c2139SMatthew G Knepley const PetscInt *faces; 433cd0c2139SMatthew G Knepley PetscInt numFaces, f; 434cd0c2139SMatthew G Knepley 435cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 436cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 437cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 438cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 439cd0c2139SMatthew G Knepley PetscInt size; 440cd0c2139SMatthew G Knepley 441cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr); 442cd0c2139SMatthew 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); 443cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(gdm, faces[f] + *numGhostCells, 2);CHKERRQ(ierr); 444cd0c2139SMatthew G Knepley } 445cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 446cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 447cd0c2139SMatthew G Knepley } 448cd0c2139SMatthew G Knepley /* Step 4: Setup ghosted DM */ 449cd0c2139SMatthew G Knepley ierr = DMSetUp(gdm);CHKERRQ(ierr); 450cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 451cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 452cd0c2139SMatthew G Knepley ghostCell = cEnd; 453cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 454cd0c2139SMatthew G Knepley IS faceIS; 455cd0c2139SMatthew G Knepley const PetscInt *faces; 456cd0c2139SMatthew G Knepley PetscInt numFaces, f; 457cd0c2139SMatthew G Knepley 458cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 459cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 460cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 461cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f, ++ghostCell) { 462cd0c2139SMatthew G Knepley PetscInt newFace = faces[f] + *numGhostCells; 463cd0c2139SMatthew G Knepley 464cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr); 465cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr); 466cd0c2139SMatthew G Knepley } 467cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 468cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 469cd0c2139SMatthew G Knepley } 470cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 471cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 472cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 473cd0c2139SMatthew G Knepley ierr = DMPlexStratify(gdm);CHKERRQ(ierr); 474cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 475cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 476cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 477cd0c2139SMatthew G Knepley ierr = PetscFree(depthShift);CHKERRQ(ierr); 478cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 479cd0c2139SMatthew G Knepley } 480cd0c2139SMatthew G Knepley 481cd0c2139SMatthew G Knepley #undef __FUNCT__ 482cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells" 483cd0c2139SMatthew G Knepley /*@C 484cd0c2139SMatthew G Knepley DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face 485cd0c2139SMatthew G Knepley 486cd0c2139SMatthew G Knepley Collective on dm 487cd0c2139SMatthew G Knepley 488cd0c2139SMatthew G Knepley Input Parameters: 489cd0c2139SMatthew G Knepley + dm - The original DM 490cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL 491cd0c2139SMatthew G Knepley 492cd0c2139SMatthew G Knepley Output Parameters: 493cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM 494cd0c2139SMatthew G Knepley - dmGhosted - The new DM 495cd0c2139SMatthew G Knepley 496cd0c2139SMatthew G Knepley Note: If no label exists of that name, one will be created marking all boundary faces 497cd0c2139SMatthew G Knepley 498cd0c2139SMatthew G Knepley Level: developer 499cd0c2139SMatthew G Knepley 500cd0c2139SMatthew G Knepley .seealso: DMCreate() 501cd0c2139SMatthew G Knepley */ 502cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted) 503cd0c2139SMatthew G Knepley { 504cd0c2139SMatthew G Knepley DM gdm; 505cd0c2139SMatthew G Knepley DMLabel label; 506cd0c2139SMatthew G Knepley const char *name = labelName ? labelName : "Face Sets"; 507cd0c2139SMatthew G Knepley PetscInt dim; 508cd0c2139SMatthew G Knepley PetscErrorCode ierr; 509cd0c2139SMatthew G Knepley 510cd0c2139SMatthew G Knepley PetscFunctionBegin; 511cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 512cd0c2139SMatthew G Knepley PetscValidPointer(numGhostCells, 3); 513cd0c2139SMatthew G Knepley PetscValidPointer(dmGhosted, 4); 514cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr); 515cd0c2139SMatthew G Knepley ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr); 516cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 517cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(gdm, dim);CHKERRQ(ierr); 518cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 519cd0c2139SMatthew G Knepley if (!label) { 520cd0c2139SMatthew G Knepley /* Get label for boundary faces */ 521cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr); 522cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 523cd0c2139SMatthew G Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 524cd0c2139SMatthew G Knepley } 525cd0c2139SMatthew G Knepley ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr); 526cd0c2139SMatthew G Knepley ierr = DMSetFromOptions(gdm);CHKERRQ(ierr); 527cd0c2139SMatthew G Knepley *dmGhosted = gdm; 528cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 529cd0c2139SMatthew G Knepley } 530cd0c2139SMatthew G Knepley 531cd0c2139SMatthew G Knepley #undef __FUNCT__ 532cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal" 533607ab7a9SMatthew G. Knepley /* 534607ab7a9SMatthew G. Knepley We are adding two kinds of points here: 535607ab7a9SMatthew G. Knepley Replicated: Copies of points which exist in the mesh, such as vertices identified across a fault 536607ab7a9SMatthew G. Knepley Hybrid: Entirely new points, such as cohesive cells 537607ab7a9SMatthew G. Knepley */ 538cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm) 539cd0c2139SMatthew G Knepley { 540cd0c2139SMatthew G Knepley MPI_Comm comm; 541607ab7a9SMatthew G. Knepley IS valueIS; 542607ab7a9SMatthew G. Knepley PetscInt numSP = 0; /* The number of depths for which we have replicated points */ 543607ab7a9SMatthew G. Knepley const PetscInt *values; /* List of depths for which we have replicated points */ 544607ab7a9SMatthew G. Knepley IS *pointIS; 545607ab7a9SMatthew G. Knepley PetscInt *numSplitPoints; /* The number of replicated points at each depth */ 546607ab7a9SMatthew G. Knepley PetscInt *numHybridPoints; /* The number of hybrid points at each depth */ 547607ab7a9SMatthew G. Knepley const PetscInt **splitPoints; /* Replicated points for each depth */ 548cd0c2139SMatthew G Knepley PetscSection coordSection; 549cd0c2139SMatthew G Knepley Vec coordinates; 550cd0c2139SMatthew G Knepley PetscScalar *coords; 551607ab7a9SMatthew G. Knepley PetscInt depths[4]; /* Depths in the order that plex points are numbered */ 552607ab7a9SMatthew G. Knepley PetscInt *depthShift; /* Number of replicated+hybrid points at each depth */ 553607ab7a9SMatthew G. Knepley PetscInt *depthOffset; /* Prefix sums of depthShift */ 554607ab7a9SMatthew G. Knepley PetscInt *pMaxNew; /* The first replicated point at each depth in the new mesh, hybrids come after this */ 555607ab7a9SMatthew G. Knepley PetscInt *coneNew, *coneONew, *supportNew; 556607ab7a9SMatthew G. Knepley PetscInt shift = 100, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, numLabels, vStart, vEnd, pEnd, p, v; 557cd0c2139SMatthew G Knepley PetscErrorCode ierr; 558cd0c2139SMatthew G Knepley 559cd0c2139SMatthew G Knepley PetscFunctionBegin; 560cd0c2139SMatthew G Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 561cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 562607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 563fd4b9f15SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 564607ab7a9SMatthew G. Knepley depths[0] = depth; 565607ab7a9SMatthew G. Knepley depths[1] = 0; 566607ab7a9SMatthew G. Knepley depths[2] = depth-1; 567607ab7a9SMatthew G. Knepley depths[3] = 1; 568cd0c2139SMatthew G Knepley /* Count split points and add cohesive cells */ 569607ab7a9SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 570607ab7a9SMatthew G. Knepley ierr = PetscMalloc6(depth+1,PetscInt,&depthShift,depth+1,PetscInt,&depthOffset,depth+1,PetscInt,&pMaxNew,maxConeSize*3,PetscInt,&coneNew,maxConeSize*3,PetscInt,&coneONew,maxSupportSize,PetscInt,&supportNew);CHKERRQ(ierr); 571607ab7a9SMatthew G. Knepley ierr = PetscMalloc4(depth+1,IS,&pointIS,depth+1,PetscInt,&numSplitPoints,depth+1,PetscInt,&numHybridPoints,depth+1,const PetscInt*,&splitPoints);CHKERRQ(ierr); 572607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 573607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthOffset, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 574607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 575607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 576607ab7a9SMatthew G. Knepley numSplitPoints[d] = 0; 577607ab7a9SMatthew G. Knepley numHybridPoints[d] = 0; 578607ab7a9SMatthew G. Knepley splitPoints[d] = NULL; 579607ab7a9SMatthew G. Knepley pointIS[d] = NULL; 580607ab7a9SMatthew G. Knepley } 581cd0c2139SMatthew G Knepley if (label) { 582cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 583cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 584cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 585cd0c2139SMatthew G Knepley } 586cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 587cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 588cd0c2139SMatthew G Knepley 589cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 590cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pointIS[dep]);CHKERRQ(ierr); 591cd0c2139SMatthew G Knepley if (pointIS[dep]) { 592cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 593cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 594cd0c2139SMatthew G Knepley } 595cd0c2139SMatthew G Knepley } 596607ab7a9SMatthew G. Knepley /* Calculate number of hybrid points */ 597607ab7a9SMatthew G. Knepley for (d = 1; d <= depth; ++d) numHybridPoints[d] = numSplitPoints[d-1]; /* There is a hybrid cell/face/edge for every split face/edge/vertex */ 598607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) depthShift[d] = numSplitPoints[d] + numHybridPoints[d]; 599607ab7a9SMatthew G. Knepley for (d = 1; d <= depth; ++d) depthOffset[depths[d]] = depthOffset[depths[d-1]] + depthShift[depths[d-1]]; 600607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) pMaxNew[d] += depthOffset[d]; 601cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 602cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 603cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 604cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 605cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 6064c367dbcSMatthew G. Knepley const PetscInt newp = oldp + depthOffset[dep]; 6074c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 608cd0c2139SMatthew G Knepley const PetscInt *support; 6094c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, qf, qn, qp, e; 610cd0c2139SMatthew G Knepley 611cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 612cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 613cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 614cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 615cd0c2139SMatthew G Knepley if (dep == depth-1) { 6164c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 6174c367dbcSMatthew G. Knepley 618cd0c2139SMatthew G Knepley /* Add cohesive cells, they are prisms */ 6194c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr); 620cd0c2139SMatthew G Knepley } else if (dep == 0) { 6214c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 622cd0c2139SMatthew G Knepley 623cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 6244c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 625cd0c2139SMatthew G Knepley PetscInt val; 626cd0c2139SMatthew G Knepley 627cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 6284c367dbcSMatthew G. Knepley if (val == 1) ++qf; 6294c367dbcSMatthew G. Knepley if ((val == 1) || (val == (shift + 1))) ++qn; 6304c367dbcSMatthew G. Knepley if ((val == 1) || (val == -(shift + 1))) ++qp; 631cd0c2139SMatthew G Knepley } 6324c367dbcSMatthew G. Knepley /* Split old vertex: Edges into original vertex and new cohesive edge */ 6334c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 6344c367dbcSMatthew G. Knepley /* Split new vertex: Edges into split vertex and new cohesive edge */ 6354c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 6364c367dbcSMatthew G. Knepley /* Add hybrid edge */ 6374c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 6384c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 639cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 6404c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 6414c367dbcSMatthew G. Knepley 642cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 6434c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 644cd0c2139SMatthew G Knepley PetscInt val; 645cd0c2139SMatthew G Knepley 646cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 6474c367dbcSMatthew G. Knepley if (val == dim-1) ++qf; 6484c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 6494c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 650cd0c2139SMatthew G Knepley } 6514c367dbcSMatthew G. Knepley /* Split old edge: Faces into original edge and cohesive face (positive side?) */ 6524c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 6534c367dbcSMatthew G. Knepley /* Split new edge: Faces into split edge and cohesive face (negative side?) */ 6544c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 6554c367dbcSMatthew G. Knepley /* Add hybrid face */ 6564c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 6574c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 658cd0c2139SMatthew G Knepley } 659cd0c2139SMatthew G Knepley } 660cd0c2139SMatthew G Knepley } 661cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 662cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 663cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 664cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 665cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 666cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 667cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 6684c367dbcSMatthew G. Knepley const PetscInt newp = oldp + depthOffset[dep]; 6694c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 670cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 6714c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, q, qf, qn, qp, v, e, s; 672cd0c2139SMatthew G Knepley 673cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 674cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 675cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 676cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 677cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 678cd0c2139SMatthew G Knepley if (dep == depth-1) { 6794c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 680cd0c2139SMatthew G Knepley const PetscInt *supportF; 681cd0c2139SMatthew G Knepley 682cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 683cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 684cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 685cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 686cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 687cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 6884c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 689cd0c2139SMatthew G Knepley 6904c367dbcSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep-1]; 691cd0c2139SMatthew G Knepley } 692cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 693cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 694e537020bSMatthew G. Knepley /* Face support */ 695cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 696cd0c2139SMatthew G Knepley PetscInt val; 697cd0c2139SMatthew G Knepley 698cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 699cd0c2139SMatthew G Knepley if (val < 0) { 700cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 7014c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr); 702cd0c2139SMatthew G Knepley } else { 703cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 7044c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr); 705e537020bSMatthew G. Knepley /* Get orientation for cohesive face */ 706e537020bSMatthew G. Knepley { 707e537020bSMatthew G. Knepley const PetscInt *ncone, *nconeO; 708e537020bSMatthew G. Knepley PetscInt nconeSize, nc; 709e537020bSMatthew G. Knepley 710e537020bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 711e537020bSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 712e537020bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 713e537020bSMatthew G. Knepley for (nc = 0; nc < nconeSize; ++nc) { 714e537020bSMatthew G. Knepley if (ncone[nc] == oldp) { 715e537020bSMatthew G. Knepley coneONew[0] = nconeO[nc]; 716e537020bSMatthew G. Knepley break; 717cd0c2139SMatthew G Knepley } 718cd0c2139SMatthew G Knepley } 719e537020bSMatthew G. Knepley if (nc >= nconeSize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate face %d in neighboring cell %d", oldp, support[s]); 720e537020bSMatthew G. Knepley } 721e537020bSMatthew G. Knepley } 722e537020bSMatthew G. Knepley } 7234c367dbcSMatthew G. Knepley /* Cohesive cell: Old and new split face, then new cohesive faces */ 724fd4b9f15SMatthew G. Knepley coneNew[0] = newp; /* Extracted negative side orientation above */ 7254c367dbcSMatthew G. Knepley coneNew[1] = splitp; 7264c367dbcSMatthew G. Knepley coneONew[1] = coneONew[0]; 727e537020bSMatthew G. Knepley for (q = 0; q < coneSize; ++q) { 7284c367dbcSMatthew G. Knepley coneNew[2+q] += (pMaxNew[dep] - pMaxNew[dep-1]) + numSplitPoints[dep]; 729e537020bSMatthew G. Knepley coneONew[2+q] = 0; 730e537020bSMatthew G. Knepley } 7314c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr); 7324c367dbcSMatthew G. Knepley ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr); 733cd0c2139SMatthew G Knepley } else if (dep == 0) { 7344c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 735cd0c2139SMatthew G Knepley 736cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 7374c367dbcSMatthew G. Knepley for (e = 0, qn = 0; e < supportSize; ++e) { 738cd0c2139SMatthew G Knepley PetscInt val; 739cd0c2139SMatthew G Knepley 740cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 741cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 7424c367dbcSMatthew G. Knepley supportNew[qn++] = support[e] + depthOffset[dep+1]; 743cd0c2139SMatthew G Knepley } 744cd0c2139SMatthew G Knepley } 7454c367dbcSMatthew G. Knepley supportNew[qn] = hybedge; 746cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 747cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 7484c367dbcSMatthew G. Knepley for (e = 0, qp = 0; e < supportSize; ++e) { 749cd0c2139SMatthew G Knepley PetscInt val, edge; 750cd0c2139SMatthew G Knepley 751cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 752cd0c2139SMatthew G Knepley if (val == 1) { 7534c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 754cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 7554c367dbcSMatthew G. Knepley supportNew[qp++] = edge + pMaxNew[dep+1]; 756cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 7574c367dbcSMatthew G. Knepley supportNew[qp++] = support[e] + depthOffset[dep+1]; 758cd0c2139SMatthew G Knepley } 759cd0c2139SMatthew G Knepley } 7604c367dbcSMatthew G. Knepley supportNew[qp] = hybedge; 761cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 7624c367dbcSMatthew G. Knepley /* Hybrid edge: Old and new split vertex */ 763cd0c2139SMatthew G Knepley coneNew[0] = newp; 764cd0c2139SMatthew G Knepley coneNew[1] = splitp; 7654c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 7664c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 7674c367dbcSMatthew G. Knepley PetscInt val, edge; 7684c367dbcSMatthew G. Knepley 7694c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 7704c367dbcSMatthew G. Knepley if (val == 1) { 7714c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 7724c367dbcSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 7734c367dbcSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 7744c367dbcSMatthew G. Knepley } 7754c367dbcSMatthew G. Knepley } 7764c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 777cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 7784c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 7794c367dbcSMatthew G. Knepley 780cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 781cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 782cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 7834c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 784cd0c2139SMatthew G Knepley 7854c367dbcSMatthew G. Knepley coneNew[q] = v + pMaxNew[dep-1]; 786cd0c2139SMatthew G Knepley } 787cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 788cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 789cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 790cd0c2139SMatthew G Knepley PetscInt val; 791cd0c2139SMatthew G Knepley 792cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 7934c367dbcSMatthew G. Knepley if (val == dim-1) { 7944c367dbcSMatthew G. Knepley supportNew[q++] = support[e] + depthOffset[dep+1]; 7954c367dbcSMatthew G. Knepley } else if (val == (shift + dim-1)) { 7964c367dbcSMatthew G. Knepley supportNew[q++] = support[e] + depthOffset[dep+1]; 797cd0c2139SMatthew G Knepley } 798cd0c2139SMatthew G Knepley } 799b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 800cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 801cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 802cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 803cd0c2139SMatthew G Knepley PetscInt val, face; 804cd0c2139SMatthew G Knepley 805cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 806cd0c2139SMatthew G Knepley if (val == dim-1) { 8074c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 808cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 8094c367dbcSMatthew G. Knepley supportNew[q++] = face + pMaxNew[dep+1]; 810cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 8114c367dbcSMatthew G. Knepley supportNew[q++] = support[e] + depthOffset[dep+1]; 812cd0c2139SMatthew G Knepley } 813cd0c2139SMatthew G Knepley } 814b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 815cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 8164c367dbcSMatthew G. Knepley /* Hybrid face */ 8174c367dbcSMatthew G. Knepley coneNew[0] = newp; 8184c367dbcSMatthew G. Knepley coneNew[1] = splitp; 8194c367dbcSMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 8204c367dbcSMatthew G. Knepley PetscInt vertex; 8214c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr); 8224c367dbcSMatthew G. Knepley if (vertex < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not a split vertex", support[e]); 8234c367dbcSMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep]; 8244c367dbcSMatthew G. Knepley } 8254c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 8264c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 8274c367dbcSMatthew G. Knepley PetscInt val, face; 8284c367dbcSMatthew G. Knepley 8294c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 8304c367dbcSMatthew G. Knepley if (val == dim-1) { 8314c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 8324c367dbcSMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 8334c367dbcSMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 8344c367dbcSMatthew G. Knepley } 8354c367dbcSMatthew G. Knepley } 8364c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 837cd0c2139SMatthew G Knepley } 838cd0c2139SMatthew G Knepley } 839cd0c2139SMatthew G Knepley } 840cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 841cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 842cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 843cd0c2139SMatthew G Knepley IS pIS; 844cd0c2139SMatthew G Knepley PetscInt numPoints; 845cd0c2139SMatthew G Knepley const PetscInt *points; 846cd0c2139SMatthew G Knepley 847cd0c2139SMatthew G Knepley if (dep >= 0) continue; 848cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 849cd0c2139SMatthew G Knepley if (!pIS) continue; 850cd0c2139SMatthew G Knepley dep = -dep - shift; 851cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 852cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 853cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 854cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 855cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + oldp; 856cd0c2139SMatthew G Knepley const PetscInt *cone; 857cd0c2139SMatthew G Knepley PetscInt coneSize, c; 85850cf782dSMatthew G. Knepley /* PetscBool replaced = PETSC_FALSE; */ 859cd0c2139SMatthew G Knepley 860cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 861cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 862cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 863cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 864cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 865cd0c2139SMatthew G Knepley const PetscInt coldp = cone[c] - depthOffset[dep-1]; 866cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 867cd0c2139SMatthew G Knepley 868cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 869cd0c2139SMatthew G Knepley if (val == dep-1) { 870cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 871cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 872cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 873cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 87450cf782dSMatthew G. Knepley /* replaced = PETSC_TRUE; */ 875cd0c2139SMatthew G Knepley } 876cd0c2139SMatthew G Knepley } 8774a189a86SMatthew G. Knepley /* Cells with only a vertex or edge on the submesh have no replacement */ 8784a189a86SMatthew G. Knepley /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 879cd0c2139SMatthew G Knepley } 880cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 881cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 882cd0c2139SMatthew G Knepley } 883cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 884cd0c2139SMatthew G Knepley ierr = DMPlexStratify(sdm);CHKERRQ(ierr); 885cd0c2139SMatthew G Knepley /* Step 8: Coordinates */ 886cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 887cd0c2139SMatthew G Knepley ierr = DMPlexGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 888cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 889cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 890cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 891cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[0] + splitPoints[0][v]; 892cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 893cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 894cd0c2139SMatthew G Knepley 895cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 896cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 897cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 898cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 899cd0c2139SMatthew G Knepley } 900cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 901cd0c2139SMatthew G Knepley /* Step 9: SF, if I can figure this out we can split the mesh in parallel */ 902cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 903cd0c2139SMatthew G Knepley /* Step 10: Labels */ 904cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 905cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 906cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 907cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 908cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + splitPoints[dep][p]; 909cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 910cd0c2139SMatthew G Knepley PetscInt l; 911cd0c2139SMatthew G Knepley 912cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 913cd0c2139SMatthew G Knepley DMLabel mlabel; 914cd0c2139SMatthew G Knepley const char *lname; 915cd0c2139SMatthew G Knepley PetscInt val; 9169a356370SMatthew G. Knepley PetscBool isDepth; 917cd0c2139SMatthew G Knepley 918cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 9199a356370SMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 9209a356370SMatthew G. Knepley if (isDepth) continue; 921cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 922cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 923cd0c2139SMatthew G Knepley if (val >= 0) { 924cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 9259a356370SMatthew G. Knepley #if 0 9269a356370SMatthew G. Knepley /* Do not put cohesive edges into the label */ 927cd0c2139SMatthew G Knepley if (dep == 0) { 9284c367dbcSMatthew G. Knepley const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 929cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr); 9304c367dbcSMatthew G. Knepley } else if (dep == dim-2) { 9314c367dbcSMatthew G. Knepley const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 9324c367dbcSMatthew G. Knepley ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr); 933cd0c2139SMatthew G Knepley } 9344c367dbcSMatthew G. Knepley /* Do not put cohesive faces into the label */ 9359a356370SMatthew G. Knepley #endif 936cd0c2139SMatthew G Knepley } 937cd0c2139SMatthew G Knepley } 938cd0c2139SMatthew G Knepley } 939cd0c2139SMatthew G Knepley } 940cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 941cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 942cd0c2139SMatthew G Knepley 943cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 944cd0c2139SMatthew G Knepley if (pointIS[dep]) {ierr = ISRestoreIndices(pointIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 945cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS[dep]);CHKERRQ(ierr); 946cd0c2139SMatthew G Knepley } 947cd0c2139SMatthew G Knepley if (label) { 948cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 949cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 950cd0c2139SMatthew G Knepley } 9510d4d4d06SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 9520d4d4d06SMatthew G. Knepley ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr); 9530d4d4d06SMatthew G. Knepley pMaxNew[d] = pEnd - numHybridPoints[d]; 9540d4d4d06SMatthew G. Knepley } 9550e49e2e2SMatthew G. Knepley ierr = DMPlexSetHybridBounds(sdm, depth >= 0 ? pMaxNew[depth] : PETSC_DETERMINE, depth>1 ? pMaxNew[depth-1] : PETSC_DETERMINE, depth>2 ? pMaxNew[1] : PETSC_DETERMINE, depth >= 0 ? pMaxNew[0] : PETSC_DETERMINE);CHKERRQ(ierr); 9560e49e2e2SMatthew G. Knepley ierr = PetscFree6(depthShift, depthOffset, pMaxNew, coneNew, coneONew, supportNew);CHKERRQ(ierr); 957607ab7a9SMatthew G. Knepley ierr = PetscFree4(pointIS, numSplitPoints, numHybridPoints, splitPoints);CHKERRQ(ierr); 958cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 959cd0c2139SMatthew G Knepley } 960cd0c2139SMatthew G Knepley 961cd0c2139SMatthew G Knepley #undef __FUNCT__ 962cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells" 963cd0c2139SMatthew G Knepley /*@C 964cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 965cd0c2139SMatthew G Knepley 966cd0c2139SMatthew G Knepley Collective on dm 967cd0c2139SMatthew G Knepley 968cd0c2139SMatthew G Knepley Input Parameters: 969cd0c2139SMatthew G Knepley + dm - The original DM 97053156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated) 971cd0c2139SMatthew G Knepley 972cd0c2139SMatthew G Knepley Output Parameters: 973cd0c2139SMatthew G Knepley - dmSplit - The new DM 974cd0c2139SMatthew G Knepley 975cd0c2139SMatthew G Knepley Level: developer 976cd0c2139SMatthew G Knepley 9772be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 978cd0c2139SMatthew G Knepley @*/ 979cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 980cd0c2139SMatthew G Knepley { 981cd0c2139SMatthew G Knepley DM sdm; 982cd0c2139SMatthew G Knepley PetscInt dim; 983cd0c2139SMatthew G Knepley PetscErrorCode ierr; 984cd0c2139SMatthew G Knepley 985cd0c2139SMatthew G Knepley PetscFunctionBegin; 986cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 98753156dfcSMatthew G. Knepley PetscValidPointer(dmSplit, 3); 988cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 989cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 990cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 991cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(sdm, dim);CHKERRQ(ierr); 992cd0c2139SMatthew G Knepley switch (dim) { 993cd0c2139SMatthew G Knepley case 2: 994cd0c2139SMatthew G Knepley case 3: 995cd0c2139SMatthew G Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 996cd0c2139SMatthew G Knepley break; 997cd0c2139SMatthew G Knepley default: 998cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 999cd0c2139SMatthew G Knepley } 1000cd0c2139SMatthew G Knepley *dmSplit = sdm; 1001cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1002cd0c2139SMatthew G Knepley } 1003cd0c2139SMatthew G Knepley 1004cd0c2139SMatthew G Knepley #undef __FUNCT__ 10052be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete" 1006cd0c2139SMatthew G Knepley /*@ 10072be2b188SMatthew G Knepley DMPlexLabelCohesiveComplete - Starting with a label marking vertices on an internal surface, we add all other mesh pieces 1008cd0c2139SMatthew G Knepley to complete the surface 1009cd0c2139SMatthew G Knepley 1010cd0c2139SMatthew G Knepley Input Parameters: 1011cd0c2139SMatthew G Knepley + dm - The DM 101247946fd8SMatthew G. Knepley . label - A DMLabel marking the surface vertices 1013bb55d314SMatthew G. Knepley . flip - Flag to flip the submesh normal and replace points on the other side 101447946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL 1015cd0c2139SMatthew G Knepley 1016cd0c2139SMatthew G Knepley Output Parameter: 1017cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 1018cd0c2139SMatthew G Knepley 1019cd0c2139SMatthew G Knepley Level: developer 1020cd0c2139SMatthew G Knepley 10212be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 1022cd0c2139SMatthew G Knepley @*/ 1023bb55d314SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, PetscBool flip, DM subdm) 1024cd0c2139SMatthew G Knepley { 1025d90583fdSMatthew G. Knepley DMLabel depthLabel; 102647946fd8SMatthew G. Knepley IS dimIS, subpointIS; 102747946fd8SMatthew G. Knepley const PetscInt *points, *subpoints; 1028bb55d314SMatthew G. Knepley const PetscInt rev = flip ? -1 : 1; 102947946fd8SMatthew G. Knepley PetscInt shift = 100, dim, dep, cStart, cEnd, numPoints, numSubpoints, p, val; 1030cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1031cd0c2139SMatthew G Knepley 1032cd0c2139SMatthew G Knepley PetscFunctionBegin; 1033d90583fdSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 1034cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 103547946fd8SMatthew G. Knepley if (subdm) { 103647946fd8SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 103747946fd8SMatthew G. Knepley if (subpointIS) { 103847946fd8SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 103947946fd8SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 104047946fd8SMatthew G. Knepley } 104147946fd8SMatthew G. Knepley } 1042cd0c2139SMatthew G Knepley /* Cell orientation for face gives the side of the fault */ 1043cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 1044cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1045cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1046cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1047cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1048cd0c2139SMatthew G Knepley const PetscInt *support; 1049cd0c2139SMatthew G Knepley PetscInt supportSize, s; 1050cd0c2139SMatthew G Knepley 1051cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1052cd0c2139SMatthew G Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 1053cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1054cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1055cd0c2139SMatthew G Knepley const PetscInt *cone, *ornt; 1056cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1057cd0c2139SMatthew G Knepley PetscBool pos = PETSC_TRUE; 1058cd0c2139SMatthew G Knepley 1059cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1060cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1061cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 1062cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1063cd0c2139SMatthew G Knepley if (cone[c] == points[p]) { 106447946fd8SMatthew G. Knepley PetscInt o = ornt[c]; 106547946fd8SMatthew G. Knepley 106647946fd8SMatthew G. Knepley if (subdm) { 106747946fd8SMatthew G. Knepley const PetscInt *subcone, *subornt; 106847946fd8SMatthew G. Knepley PetscInt subpoint, subface, subconeSize, sc; 106947946fd8SMatthew G. Knepley 107047946fd8SMatthew G. Knepley ierr = PetscFindInt(support[s], numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 107147946fd8SMatthew G. Knepley ierr = PetscFindInt(points[p], numSubpoints, subpoints, &subface);CHKERRQ(ierr); 107247946fd8SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 107347946fd8SMatthew G. Knepley ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 107447946fd8SMatthew G. Knepley ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 107547946fd8SMatthew G. Knepley for (sc = 0; sc < subconeSize; ++sc) { 107647946fd8SMatthew G. Knepley if (subcone[sc] == subface) { 107747946fd8SMatthew G. Knepley o = subornt[0]; 107847946fd8SMatthew G. Knepley break; 107947946fd8SMatthew G. Knepley } 108047946fd8SMatthew G. Knepley } 108147946fd8SMatthew G. Knepley if (sc >= subconeSize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find point %d in cone for subpoint %d", points[p], subpoint); 108247946fd8SMatthew G. Knepley } 108347946fd8SMatthew G. Knepley if (o >= 0) { 1084bb55d314SMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr); 1085ffaa4bbcSMatthew G. Knepley pos = rev > 0 ? PETSC_TRUE : PETSC_FALSE; 1086cd0c2139SMatthew G Knepley } else { 1087bb55d314SMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr); 1088ffaa4bbcSMatthew G. Knepley pos = rev > 0 ? PETSC_FALSE : PETSC_TRUE; 1089cd0c2139SMatthew G Knepley } 1090cd0c2139SMatthew G Knepley break; 1091cd0c2139SMatthew G Knepley } 1092cd0c2139SMatthew G Knepley } 1093cd0c2139SMatthew 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]); 1094cd0c2139SMatthew G Knepley /* Put faces touching the fault in the label */ 1095cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1096cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 1097cd0c2139SMatthew G Knepley 1098cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1099cd0c2139SMatthew G Knepley if (val == -1) { 1100cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 1101cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 1102cd0c2139SMatthew G Knepley 1103cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1104cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1105cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 1106cd0c2139SMatthew G Knepley 1107cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1108cd0c2139SMatthew G Knepley if ((val >= 0) && (val < dim-1)) { 1109cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1110cd0c2139SMatthew G Knepley break; 1111cd0c2139SMatthew G Knepley } 1112cd0c2139SMatthew G Knepley } 1113cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1114cd0c2139SMatthew G Knepley } 1115cd0c2139SMatthew G Knepley } 1116cd0c2139SMatthew G Knepley } 1117cd0c2139SMatthew G Knepley } 111847946fd8SMatthew G. Knepley if (subdm) { 111947946fd8SMatthew G. Knepley if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 112047946fd8SMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 112147946fd8SMatthew G. Knepley } 1122cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1123cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1124cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1125cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1126cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 1127cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1128cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1129cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1130cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1131cd0c2139SMatthew G Knepley PetscInt *star = NULL; 1132cd0c2139SMatthew G Knepley PetscInt starSize, s; 1133cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1134cd0c2139SMatthew G Knepley 1135*d4622b2cSMatthew G. Knepley /* All points connected to the fault are inside a cell, so at the top level we will only check cells */ 1136cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1137cd0c2139SMatthew G Knepley while (again) { 1138cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1139cd0c2139SMatthew G Knepley again = 0; 1140cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1141cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1142cd0c2139SMatthew G Knepley const PetscInt *cone; 1143cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1144cd0c2139SMatthew G Knepley 1145cd0c2139SMatthew G Knepley if ((point < cStart) || (point >= cEnd)) continue; 1146cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1147cd0c2139SMatthew G Knepley if (val != -1) continue; 1148*d4622b2cSMatthew G. Knepley again = again == 1 ? 1 : 2; 1149cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1150cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1151cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1152cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1153cd0c2139SMatthew G Knepley if (val != -1) { 1154*d4622b2cSMatthew G. Knepley PetscInt marker, closureSize, cl, st, *closure = NULL; 1155cd0c2139SMatthew 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); 1156*d4622b2cSMatthew G. Knepley if (val > 0) marker = shift+dim; 1157*d4622b2cSMatthew G. Knepley else marker = -(shift+dim); 1158*d4622b2cSMatthew G. Knepley ierr = DMLabelSetValue(label, point, marker);CHKERRQ(ierr); 1159*d4622b2cSMatthew G. Knepley /* Mark all other cell parts */ 1160*d4622b2cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1161*d4622b2cSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1162*d4622b2cSMatthew G. Knepley const PetscInt clpoint = closure[cl]; 1163*d4622b2cSMatthew G. Knepley for (st = 0; st < starSize*2; st += 2) if (star[st] == clpoint) {ierr = DMLabelSetValue(label, clpoint, marker);CHKERRQ(ierr); break;} 1164cd0c2139SMatthew G Knepley } 1165*d4622b2cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1166cd0c2139SMatthew G Knepley again = 1; 1167cd0c2139SMatthew G Knepley break; 1168cd0c2139SMatthew G Knepley } 1169cd0c2139SMatthew G Knepley } 1170cd0c2139SMatthew G Knepley } 1171cd0c2139SMatthew G Knepley } 1172cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1173cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1174cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1175cd0c2139SMatthew G Knepley 1176cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1177cd0c2139SMatthew G Knepley if (val == -1) { 1178cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1179cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1180cd0c2139SMatthew G Knepley PetscBool marked = PETSC_FALSE; 1181cd0c2139SMatthew G Knepley 1182cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1183cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1184cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1185cd0c2139SMatthew G Knepley 1186cd0c2139SMatthew G Knepley if ((spoint < cStart) || (spoint >= cEnd)) continue; 1187cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1188cd0c2139SMatthew 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); 1189d90583fdSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1190cd0c2139SMatthew G Knepley if (val > 0) { 1191cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1192cd0c2139SMatthew G Knepley } else { 1193cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1194cd0c2139SMatthew G Knepley } 1195cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1196cd0c2139SMatthew G Knepley break; 1197cd0c2139SMatthew G Knepley } 1198cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1199cd0c2139SMatthew G Knepley if (!marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1200cd0c2139SMatthew G Knepley } 1201cd0c2139SMatthew G Knepley } 1202cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1203cd0c2139SMatthew G Knepley } 1204cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1205cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1206cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1207cd0c2139SMatthew G Knepley } 1208cd0c2139SMatthew G Knepley 1209cd0c2139SMatthew G Knepley #undef __FUNCT__ 12103cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh" 12113cf72582SMatthew G. Knepley /*@C 12123cf72582SMatthew G. Knepley DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface 12133cf72582SMatthew G. Knepley 12143cf72582SMatthew G. Knepley Collective on dm 12153cf72582SMatthew G. Knepley 12163cf72582SMatthew G. Knepley Input Parameters: 12173cf72582SMatthew G. Knepley + dm - The original DM 12183cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices 12193cf72582SMatthew G. Knepley 12203cf72582SMatthew G. Knepley Output Parameters: 12213cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface 12223cf72582SMatthew G. Knepley - dmHybrid - The new DM 12233cf72582SMatthew G. Knepley 12243cf72582SMatthew G. Knepley Level: developer 12253cf72582SMatthew G. Knepley 12263cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate() 12273cf72582SMatthew G. Knepley @*/ 12283cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid) 12293cf72582SMatthew G. Knepley { 12303cf72582SMatthew G. Knepley DM idm; 12313cf72582SMatthew G. Knepley DMLabel subpointMap, hlabel; 12323cf72582SMatthew G. Knepley PetscInt dim; 12333cf72582SMatthew G. Knepley PetscErrorCode ierr; 12343cf72582SMatthew G. Knepley 12353cf72582SMatthew G. Knepley PetscFunctionBegin; 12363cf72582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 12373cf72582SMatthew G. Knepley if (hybridLabel) PetscValidPointer(hybridLabel, 3); 12383cf72582SMatthew G. Knepley PetscValidPointer(dmHybrid, 4); 12393cf72582SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 12403cf72582SMatthew G. Knepley ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr); 12413cf72582SMatthew G. Knepley ierr = DMPlexOrient(idm);CHKERRQ(ierr); 12423cf72582SMatthew G. Knepley ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr); 12433cf72582SMatthew G. Knepley ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr); 12443cf72582SMatthew G. Knepley ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr); 12453cf72582SMatthew G. Knepley ierr = DMPlexLabelCohesiveComplete(dm, hlabel, PETSC_FALSE, idm);CHKERRQ(ierr); 12463cf72582SMatthew G. Knepley ierr = DMDestroy(&idm);CHKERRQ(ierr); 12473cf72582SMatthew G. Knepley ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr); 12483cf72582SMatthew G. Knepley if (hybridLabel) *hybridLabel = hlabel; 124953aa2e23SMatthew G. Knepley else {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);} 12503cf72582SMatthew G. Knepley PetscFunctionReturn(0); 12513cf72582SMatthew G. Knepley } 12523cf72582SMatthew G. Knepley 12533cf72582SMatthew G. Knepley #undef __FUNCT__ 1254efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated" 1255efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 1256efa14ee0SMatthew G Knepley 1257efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 1258efa14ee0SMatthew G Knepley */ 1259830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1260efa14ee0SMatthew G Knepley { 1261fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 1262efa14ee0SMatthew G Knepley const PetscInt *subvertices; 126377d178adSMatthew G. Knepley PetscInt *pStart, *pEnd, *pMax, pSize; 1264efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1265efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1266efa14ee0SMatthew G Knepley 1267efa14ee0SMatthew G Knepley PetscFunctionBegin; 1268efa14ee0SMatthew G Knepley *numFaces = 0; 1269efa14ee0SMatthew G Knepley *nFV = 0; 1270efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1271efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 127277d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 127377d178adSMatthew G. Knepley ierr = PetscMalloc3(pSize,PetscInt,&pStart,pSize,PetscInt,&pEnd,pSize,PetscInt,&pMax);CHKERRQ(ierr); 1274d92e47f8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &pMax[depth] : NULL, depth>1 ? &pMax[depth-1] : NULL, depth>2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1275efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 1276efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1277efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1278efa14ee0SMatthew G Knepley } 1279efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1280fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1281efa14ee0SMatthew G Knepley if (subvertexIS) { 1282efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1283efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1284efa14ee0SMatthew G Knepley } 1285efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1286efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 12870298fd71SBarry Smith PetscInt *star = NULL; 1288efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 1289efa14ee0SMatthew G Knepley 1290efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1291efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1292efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1293efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1294efa14ee0SMatthew G Knepley } 1295efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 1296efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 12970298fd71SBarry Smith PetscInt *closure = NULL; 1298efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 1299efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 1300efa14ee0SMatthew G Knepley 1301efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 130265560c7fSMatthew G Knepley if (cellLoc == 2) continue; 130382f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1304efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1305efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1306efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1307efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1308efa14ee0SMatthew G Knepley 1309efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1310efa14ee0SMatthew G Knepley ++numCorners; 1311efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1312830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 1313efa14ee0SMatthew G Knepley } 1314efa14ee0SMatthew G Knepley } 131518ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 131682f516ccSBarry 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); 1317efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 1318007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 1319007baee2SMatthew G. Knepley PetscInt numCells, nc; 1320007baee2SMatthew G. Knepley 1321efa14ee0SMatthew G Knepley ++(*numFaces); 1322efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 1323efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 1324efa14ee0SMatthew G Knepley } 1325007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1326007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 1327007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 1328007baee2SMatthew G. Knepley } 1329007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1330efa14ee0SMatthew G Knepley } 1331efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1332efa14ee0SMatthew G Knepley } 1333efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1334efa14ee0SMatthew G Knepley } 1335efa14ee0SMatthew G Knepley if (subvertexIS) { 1336efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1337efa14ee0SMatthew G Knepley } 1338efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1339efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1340efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1341efa14ee0SMatthew G Knepley } 1342efa14ee0SMatthew G Knepley 1343efa14ee0SMatthew G Knepley #undef __FUNCT__ 1344efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated" 1345830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 1346efa14ee0SMatthew G Knepley { 1347efa14ee0SMatthew G Knepley IS subvertexIS; 1348efa14ee0SMatthew G Knepley const PetscInt *subvertices; 1349efa14ee0SMatthew G Knepley PetscInt *pStart, *pEnd, *pMax; 1350efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 1351efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1352efa14ee0SMatthew G Knepley 1353efa14ee0SMatthew G Knepley PetscFunctionBegin; 1354efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1355efa14ee0SMatthew G Knepley ierr = PetscMalloc3(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd,dim+1,PetscInt,&pMax);CHKERRQ(ierr); 13560298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1357efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 1358efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1359efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1360efa14ee0SMatthew G Knepley } 1361efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1362830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 1363efa14ee0SMatthew G Knepley if (subvertexIS) { 1364efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1365efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1366efa14ee0SMatthew G Knepley } 1367efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1368efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 13690298fd71SBarry Smith PetscInt *star = NULL; 1370efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 1371efa14ee0SMatthew G Knepley 1372efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1373efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1374efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1375efa14ee0SMatthew G Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 1376efa14ee0SMatthew G Knepley } 1377efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 1378efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 13790298fd71SBarry Smith PetscInt *closure = NULL; 1380efa14ee0SMatthew G Knepley PetscInt closureSize, c; 1381efa14ee0SMatthew G Knepley PetscInt faceLoc; 1382efa14ee0SMatthew G Knepley 1383efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 1384efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 138582f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 1386efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1387efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1388efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1389efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1390efa14ee0SMatthew G Knepley 1391efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1392efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1393830e53efSMatthew G. Knepley if (vertexLoc != value) break; 1394efa14ee0SMatthew G Knepley } 1395efa14ee0SMatthew G Knepley } 1396efa14ee0SMatthew G Knepley if (c == closureSize*2) { 1397efa14ee0SMatthew G Knepley const PetscInt *support; 1398efa14ee0SMatthew G Knepley PetscInt supportSize, s; 1399efa14ee0SMatthew G Knepley 1400efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1401efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1402efa14ee0SMatthew G Knepley 1403efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 1404efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1405efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1406efa14ee0SMatthew G Knepley break; 1407efa14ee0SMatthew G Knepley } 1408efa14ee0SMatthew G Knepley } 1409efa14ee0SMatthew G Knepley } 1410efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 1411efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 1412efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1413efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1414efa14ee0SMatthew G Knepley } 1415efa14ee0SMatthew G Knepley } 1416efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1417efa14ee0SMatthew G Knepley } 1418efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1419efa14ee0SMatthew G Knepley } 1420efa14ee0SMatthew G Knepley if (subvertexIS) { 1421efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1422efa14ee0SMatthew G Knepley } 1423efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1424efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1425efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1426efa14ee0SMatthew G Knepley } 1427efa14ee0SMatthew G Knepley 1428efa14ee0SMatthew G Knepley #undef __FUNCT__ 1429766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated" 143027c04023SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char labelname[], PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, PetscInt *subCells[], DM subdm) 1431766ab985SMatthew G. Knepley { 143227c04023SMatthew G. Knepley DMLabel label = NULL; 1433766ab985SMatthew G. Knepley const PetscInt *cone; 143427234c99SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize; 1435766ab985SMatthew G. Knepley PetscErrorCode ierr; 1436766ab985SMatthew G. Knepley 1437812bfc34SJed Brown PetscFunctionBegin; 1438c0ed958bSJed Brown *numFaces = 0; 1439c0ed958bSJed Brown *nFV = 0; 1440b6d5cb33SJed Brown if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1441fed694aaSMatthew G. Knepley *subCells = NULL; 1442766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1443766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1444766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1445766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 144627c04023SMatthew G. Knepley if (label) { 144727c04023SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 144827c04023SMatthew G. Knepley PetscInt val; 144927c04023SMatthew G. Knepley 145027c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 145127c04023SMatthew G. Knepley if (val == value) { 145227c04023SMatthew G. Knepley ++(*numFaces); 145327c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 145427c04023SMatthew G. Knepley } 145527c04023SMatthew G. Knepley } 145627c04023SMatthew G. Knepley } else { 1457766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 145827c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 145927c04023SMatthew G. Knepley } 1460766ab985SMatthew G. Knepley *nFV = hasLagrange ? coneSize/3 : coneSize/2; 1461766ab985SMatthew G. Knepley ierr = PetscMalloc(*numFaces *2 * sizeof(PetscInt), subCells);CHKERRQ(ierr); 1462766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1463766ab985SMatthew G. Knepley const PetscInt *cells; 1464766ab985SMatthew G. Knepley PetscInt numCells; 1465766ab985SMatthew G. Knepley 146627c04023SMatthew G. Knepley if (label) { 146727c04023SMatthew G. Knepley PetscInt val; 146827c04023SMatthew G. Knepley 146927c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 147027c04023SMatthew G. Knepley if (val != value) continue; 147127c04023SMatthew G. Knepley } 1472766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1473766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 1474766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 1475766ab985SMatthew G. Knepley } 1476766ab985SMatthew G. Knepley /* Negative face */ 1477766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 147827234c99SMatthew G. Knepley /* Not true in parallel 147927234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 1480766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 1481766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 148227234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 1483766ab985SMatthew G. Knepley } 1484766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 1485766ab985SMatthew G. Knepley /* Positive face is not included */ 1486766ab985SMatthew G. Knepley } 1487766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1488766ab985SMatthew G. Knepley } 1489766ab985SMatthew G. Knepley 1490766ab985SMatthew G. Knepley #undef __FUNCT__ 1491766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated" 149227c04023SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, PetscBool hasLagrange, const char labelname[], PetscInt value, DMLabel subpointMap, DM subdm) 1493766ab985SMatthew G. Knepley { 149427c04023SMatthew G. Knepley DMLabel label = NULL; 1495766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 1496766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 1497766ab985SMatthew G. Knepley PetscErrorCode ierr; 1498766ab985SMatthew G. Knepley 1499812bfc34SJed Brown PetscFunctionBegin; 150027c04023SMatthew G. Knepley if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1501766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1502766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1503766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1504766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 1505766ab985SMatthew G. Knepley ierr = PetscMalloc2(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd);CHKERRQ(ierr); 1506766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 1507766ab985SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1508766ab985SMatthew G. Knepley } 1509766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1510766ab985SMatthew G. Knepley const PetscInt *cone; 1511766ab985SMatthew G. Knepley PetscInt *closure = NULL; 1512766ab985SMatthew G. Knepley PetscInt coneSize, closureSize, cl; 1513766ab985SMatthew G. Knepley 151427c04023SMatthew G. Knepley if (label) { 151527c04023SMatthew G. Knepley PetscInt val; 151627c04023SMatthew G. Knepley 151727c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 151827c04023SMatthew G. Knepley if (val != value) continue; 151927c04023SMatthew G. Knepley } 1520766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 1521766ab985SMatthew G. Knepley if (hasLagrange) { 1522766ab985SMatthew G. Knepley if (coneSize != 3) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 1523766ab985SMatthew G. Knepley } else { 1524766ab985SMatthew G. Knepley if (coneSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 1525766ab985SMatthew G. Knepley } 1526766ab985SMatthew G. Knepley /* Negative face */ 1527766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1528766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1529766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1530766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 1531766ab985SMatthew G. Knepley 1532766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 1533766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1534766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1535766ab985SMatthew G. Knepley break; 1536766ab985SMatthew G. Knepley } 1537766ab985SMatthew G. Knepley } 1538766ab985SMatthew G. Knepley } 1539766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1540766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 1541766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 1542766ab985SMatthew G. Knepley const PetscInt *support; 1543766ab985SMatthew G. Knepley PetscInt supportSize, s; 1544766ab985SMatthew G. Knepley 1545766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 1546766ab985SMatthew G. Knepley if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); 1547766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 1548766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 1549766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1550766ab985SMatthew G. Knepley } 1551766ab985SMatthew G. Knepley } 1552766ab985SMatthew G. Knepley } 1553766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 1554766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1555766ab985SMatthew G. Knepley } 1556766ab985SMatthew G. Knepley 1557766ab985SMatthew G. Knepley #undef __FUNCT__ 1558e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation" 1559e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 1560e6ccafaeSMatthew G Knepley { 156182f516ccSBarry Smith MPI_Comm comm; 1562e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 1563e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 1564e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 1565e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1566e6ccafaeSMatthew G Knepley 156782f516ccSBarry Smith PetscFunctionBegin; 156882f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1569e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &cellDim);CHKERRQ(ierr); 1570e6ccafaeSMatthew G Knepley if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 1571e6ccafaeSMatthew G Knepley 1572ddeab2a6SMatthew G. Knepley if (cellDim == 1 && numCorners == 2) { 1573ddeab2a6SMatthew G. Knepley /* Triangle */ 1574e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 1575e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1576ddeab2a6SMatthew G. Knepley } else if (cellDim == 2 && numCorners == 3) { 1577ddeab2a6SMatthew G. Knepley /* Triangle */ 1578ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 1579ddeab2a6SMatthew G. Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1580ddeab2a6SMatthew G. Knepley } else if (cellDim == 3 && numCorners == 4) { 1581ddeab2a6SMatthew G. Knepley /* Tetrahedron */ 1582ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 1583ddeab2a6SMatthew G. Knepley posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1584e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 1585e6ccafaeSMatthew G Knepley /* Quadratic line */ 1586e6ccafaeSMatthew G Knepley faceSize = 1; 1587e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1588e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 1589e6ccafaeSMatthew G Knepley /* Quads */ 1590e6ccafaeSMatthew G Knepley faceSize = 2; 1591e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 1592e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1593e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 1594e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1595e6ccafaeSMatthew G Knepley } else { 1596e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 1597e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 1598e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 1599e6ccafaeSMatthew G Knepley } 1600e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 1601e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 1602e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 1603e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 1604e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 1605e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1606e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 1607e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 1608e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 1609e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 1610e6ccafaeSMatthew G Knepley }; 1611e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 1612e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 1613e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 1614e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 1615e6ccafaeSMatthew G Knepley }; 1616e6ccafaeSMatthew G Knepley 1617e6ccafaeSMatthew G Knepley faceSize = faceSizeTri; 1618e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 1619e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 1620e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 1621e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 1622e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1623e6ccafaeSMatthew G Knepley 1624e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 1625e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 1626e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 1627e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 1628e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 1629e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1630e6ccafaeSMatthew G Knepley break; 1631e6ccafaeSMatthew G Knepley } 1632e6ccafaeSMatthew G Knepley } 1633e6ccafaeSMatthew G Knepley } 1634e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1635e6ccafaeSMatthew G Knepley break; 1636e6ccafaeSMatthew G Knepley } 1637e6ccafaeSMatthew G Knepley } 1638e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 1639e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1640e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1641e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 1642e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 1643e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 1644e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 1645e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 1646e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1647e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 1648e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 1649e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 1650e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 1651e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 1652e6ccafaeSMatthew G Knepley }; 1653e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 1654e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 1655e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 1656e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 1657e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 1658e6ccafaeSMatthew G Knepley }; 1659e6ccafaeSMatthew G Knepley 1660e6ccafaeSMatthew G Knepley faceSize = faceSizeQuad; 1661e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 1662e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 1663e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 1664e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 1665e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1666e6ccafaeSMatthew G Knepley 1667e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 1668e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 1669e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 1670e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 1671e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 1672e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1673e6ccafaeSMatthew G Knepley break; 1674e6ccafaeSMatthew G Knepley } 1675e6ccafaeSMatthew G Knepley } 1676e6ccafaeSMatthew G Knepley } 1677e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1678e6ccafaeSMatthew G Knepley break; 1679e6ccafaeSMatthew G Knepley } 1680e6ccafaeSMatthew G Knepley } 1681e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 1682e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1683e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1684e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 1685e6ccafaeSMatthew G Knepley /* Hexes 1686e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 1687e6ccafaeSMatthew G Knepley pointing up at the second. 1688e6ccafaeSMatthew G Knepley 1689e6ccafaeSMatthew G Knepley 7---6 1690e6ccafaeSMatthew G Knepley /| /| 1691e6ccafaeSMatthew G Knepley 4---5 | 1692ddeab2a6SMatthew G. Knepley | 1-|-2 1693e6ccafaeSMatthew G Knepley |/ |/ 1694ddeab2a6SMatthew G. Knepley 0---3 1695e6ccafaeSMatthew G Knepley 1696e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 1697e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 1698e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 1699e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1700e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 1701e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 1702e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 1703ddeab2a6SMatthew G. Knepley 0, 3, 4, 5, /* front */ 1704ddeab2a6SMatthew G. Knepley 2, 3, 5, 6, /* right */ 1705ddeab2a6SMatthew G. Knepley 1, 2, 6, 7, /* back */ 1706ddeab2a6SMatthew G. Knepley 0, 1, 4, 7, /* left */ 1707e6ccafaeSMatthew G Knepley }; 1708e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 1709ddeab2a6SMatthew G. Knepley 1, 2, 3, 0, /* bottom */ 1710e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 1711ddeab2a6SMatthew G. Knepley 0, 3, 5, 4, /* front */ 1712ddeab2a6SMatthew G. Knepley 3, 2, 6, 5, /* right */ 1713ddeab2a6SMatthew G. Knepley 2, 1, 7, 6, /* back */ 1714ddeab2a6SMatthew G. Knepley 1, 0, 4, 7, /* left */ 1715e6ccafaeSMatthew G Knepley }; 1716e6ccafaeSMatthew G Knepley 1717e6ccafaeSMatthew G Knepley faceSize = faceSizeHex; 1718e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 1719e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 1720e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 1721e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 1722e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1723e6ccafaeSMatthew G Knepley 1724e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 1725e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 1726e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 1727e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 1728e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 1729e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 1730e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 1731e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1732e6ccafaeSMatthew G Knepley break; 1733e6ccafaeSMatthew G Knepley } 1734e6ccafaeSMatthew G Knepley } 1735e6ccafaeSMatthew G Knepley } 1736e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1737e6ccafaeSMatthew G Knepley break; 1738e6ccafaeSMatthew G Knepley } 1739e6ccafaeSMatthew G Knepley } 1740e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 1741e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1742e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1743e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 1744e6ccafaeSMatthew G Knepley /* Quadratic tet */ 1745e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 1746e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 1747e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 1748e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1749e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 1750e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 1751e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 1752e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 1753e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 1754e6ccafaeSMatthew G Knepley }; 1755e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 1756e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 1757e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 1758e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 1759e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 1760e6ccafaeSMatthew G Knepley }; 1761e6ccafaeSMatthew G Knepley 1762e6ccafaeSMatthew G Knepley faceSize = faceSizeTet; 1763e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 1764e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 1765e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 1766e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 1767e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1768e6ccafaeSMatthew G Knepley 1769e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 1770e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 1771e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 1772e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 1773e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 1774e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 1775e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 1776e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1777e6ccafaeSMatthew G Knepley break; 1778e6ccafaeSMatthew G Knepley } 1779e6ccafaeSMatthew G Knepley } 1780e6ccafaeSMatthew G Knepley } 1781e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1782e6ccafaeSMatthew G Knepley break; 1783e6ccafaeSMatthew G Knepley } 1784e6ccafaeSMatthew G Knepley } 1785e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 1786e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1787e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1788e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 1789e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 1790e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 1791e6ccafaeSMatthew G Knepley pointing up at the second. 1792e6ccafaeSMatthew G Knepley 1793e6ccafaeSMatthew G Knepley 7---6 1794e6ccafaeSMatthew G Knepley /| /| 1795e6ccafaeSMatthew G Knepley 4---5 | 1796e6ccafaeSMatthew G Knepley | 3-|-2 1797e6ccafaeSMatthew G Knepley |/ |/ 1798e6ccafaeSMatthew G Knepley 0---1 1799e6ccafaeSMatthew G Knepley 1800e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 1801e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 1802e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 1803e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1804e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 1805e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 1806e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 1807e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 1808e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 1809e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 1810e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 1811e6ccafaeSMatthew G Knepley }; 1812e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 1813e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 1814e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 1815e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 1816e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 1817e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 1818e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 1819e6ccafaeSMatthew G Knepley }; 1820e6ccafaeSMatthew G Knepley 1821e6ccafaeSMatthew G Knepley faceSize = faceSizeQuadHex; 1822e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 1823e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 1824e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 1825e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 1826e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1827e6ccafaeSMatthew G Knepley 1828e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 1829e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 1830e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 1831e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 1832e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 1833e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 1834e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 1835e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1836e6ccafaeSMatthew G Knepley break; 1837e6ccafaeSMatthew G Knepley } 1838e6ccafaeSMatthew G Knepley } 1839e6ccafaeSMatthew G Knepley } 1840e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1841e6ccafaeSMatthew G Knepley break; 1842e6ccafaeSMatthew G Knepley } 1843e6ccafaeSMatthew G Knepley } 1844e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 1845e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1846e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1847e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 1848e6ccafaeSMatthew G Knepley if (!posOrient) { 1849e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 1850e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 1851e6ccafaeSMatthew G Knepley } else { 1852e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 1853e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 1854e6ccafaeSMatthew G Knepley } 1855e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 1856e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1857e6ccafaeSMatthew G Knepley } 1858e6ccafaeSMatthew G Knepley 1859e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1860e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace" 1861e6ccafaeSMatthew G Knepley /* 1862e6ccafaeSMatthew G Knepley Given a cell and a face, as a set of vertices, 1863e6ccafaeSMatthew G Knepley return the oriented face, as a set of vertices, in faceVertices 1864e6ccafaeSMatthew G Knepley The orientation is such that the face normal points out of the cell 1865e6ccafaeSMatthew G Knepley */ 1866e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 1867e6ccafaeSMatthew G Knepley { 18680298fd71SBarry Smith const PetscInt *cone = NULL; 1869e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 1870e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 1871e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1872e6ccafaeSMatthew G Knepley 1873e6ccafaeSMatthew G Knepley PetscFunctionBegin; 1874e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 1875e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 1876e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 1877e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1878e6ccafaeSMatthew G Knepley 1879e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 1880e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 1881e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 1882e6ccafaeSMatthew G Knepley } 1883e6ccafaeSMatthew G Knepley } 1884e6ccafaeSMatthew G Knepley if (found) { 1885e6ccafaeSMatthew G Knepley indices[v2] = v; 1886e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 1887e6ccafaeSMatthew G Knepley ++v2; 1888e6ccafaeSMatthew G Knepley } else { 1889e6ccafaeSMatthew G Knepley oppositeVertex = v; 1890e6ccafaeSMatthew G Knepley } 1891e6ccafaeSMatthew G Knepley } 1892e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 1893e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1894e6ccafaeSMatthew G Knepley } 1895e6ccafaeSMatthew G Knepley 1896e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1897cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal" 1898e6ccafaeSMatthew G Knepley /* 1899cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 1900e6ccafaeSMatthew G Knepley 1901e6ccafaeSMatthew G Knepley Not collective 1902e6ccafaeSMatthew G Knepley 1903e6ccafaeSMatthew G Knepley Input Parameters: 1904e6ccafaeSMatthew G Knepley + dm - The DMPlex 1905e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 1906e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 1907e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 1908e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 1909e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 1910e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 1911e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 1912e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 1913e6ccafaeSMatthew G Knepley 1914e6ccafaeSMatthew G Knepley Output Parameters: 1915e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 1916e6ccafaeSMatthew G Knepley 1917e6ccafaeSMatthew G Knepley Level: developer 1918e6ccafaeSMatthew G Knepley */ 1919cd0c2139SMatthew 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) 1920e6ccafaeSMatthew G Knepley { 192182f516ccSBarry Smith MPI_Comm comm; 1922e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 1923e6ccafaeSMatthew G Knepley const PetscInt *faces; 1924e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 1925e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1926e6ccafaeSMatthew G Knepley 1927e6ccafaeSMatthew G Knepley PetscFunctionBegin; 192882f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1929e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 1930e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 1931e6ccafaeSMatthew G Knepley #if 0 1932e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 1933e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 1934e6ccafaeSMatthew G Knepley #else 1935e6ccafaeSMatthew G Knepley { 1936e6ccafaeSMatthew G Knepley PetscInt f; 1937e6ccafaeSMatthew G Knepley 1938e6ccafaeSMatthew G Knepley numFaces = 0; 1939e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 1940e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 1941e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 1942e6ccafaeSMatthew G Knepley 1943e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 1944e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 1945e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 1946e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 1947e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 1948e6ccafaeSMatthew G Knepley PetscInt v; 1949e6ccafaeSMatthew G Knepley 1950e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 1951e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 1952e6ccafaeSMatthew G Knepley } 1953e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 1954e6ccafaeSMatthew G Knepley } 1955e6ccafaeSMatthew G Knepley if (d == dof) { 1956e6ccafaeSMatthew G Knepley numFaces = 1; 1957e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 1958e6ccafaeSMatthew G Knepley } 1959e6ccafaeSMatthew G Knepley } 1960e6ccafaeSMatthew G Knepley } 1961e6ccafaeSMatthew G Knepley #endif 1962e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 1963e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 1964e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 1965766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 1966e6ccafaeSMatthew G Knepley } else { 1967e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 1968e6ccafaeSMatthew G Knepley PetscBool posOriented; 1969e6ccafaeSMatthew G Knepley 1970e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 1971e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 1972e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 1973e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 1974e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 1975e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 1976e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 1977e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 1978e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 1979e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 1980e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 1981e6ccafaeSMatthew G Knepley break; 1982e6ccafaeSMatthew G Knepley } 1983e6ccafaeSMatthew G Knepley } 1984e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 1985e6ccafaeSMatthew G Knepley } 1986e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 1987e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 1988e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 1989e6ccafaeSMatthew G Knepley ++(*newFacePoint); 1990e6ccafaeSMatthew G Knepley } 1991ef07cca7SMatthew G. Knepley #if 0 1992e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 1993ef07cca7SMatthew G. Knepley #else 1994ef07cca7SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 1995ef07cca7SMatthew G. Knepley #endif 1996e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1997e6ccafaeSMatthew G Knepley } 1998e6ccafaeSMatthew G Knepley 1999e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2000e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated" 200153156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2002e6ccafaeSMatthew G Knepley { 200382f516ccSBarry Smith MPI_Comm comm; 200453156dfcSMatthew G. Knepley DMLabel subpointMap; 2005efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 2006efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 2007efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 2008fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 2009efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 2010e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2011e6ccafaeSMatthew G Knepley 2012e6ccafaeSMatthew G Knepley PetscFunctionBegin; 201382f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2014efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2015efa14ee0SMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2016efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2017efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 201853156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);} 2019efa14ee0SMatthew G Knepley /* Setup chart */ 2020efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2021efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2022efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2023efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2024e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2025e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 2026efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 2027e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 2028efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2029efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2030efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 2031efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2032e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2033e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2034e6ccafaeSMatthew G Knepley } 2035e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2036e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2037e6ccafaeSMatthew G Knepley } 2038e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2039e6ccafaeSMatthew G Knepley /* Create face cones */ 2040efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 20410298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2042efa14ee0SMatthew G Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2043e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2044e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 2045efa14ee0SMatthew G Knepley const PetscInt subcell = c; 20460298fd71SBarry Smith PetscInt *closure = NULL; 2047efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 2048e6ccafaeSMatthew G Knepley 2049e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2050efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2051efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 2052e6ccafaeSMatthew G Knepley PetscInt subVertex; 2053e6ccafaeSMatthew G Knepley 2054efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 2055efa14ee0SMatthew G Knepley ++numCorners; 2056efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 2057efa14ee0SMatthew G Knepley if (subVertex >= 0) { 2058efa14ee0SMatthew G Knepley closure[faceSize] = point; 205965560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 2060e6ccafaeSMatthew G Knepley ++faceSize; 2061e6ccafaeSMatthew G Knepley } 2062e6ccafaeSMatthew G Knepley } 2063e6ccafaeSMatthew G Knepley } 2064efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 2065efa14ee0SMatthew G Knepley if (faceSize == nFV) { 2066cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 2067e6ccafaeSMatthew G Knepley } 206865560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2069e6ccafaeSMatthew G Knepley } 2070efa14ee0SMatthew G Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2071e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2072e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2073e6ccafaeSMatthew G Knepley /* Build coordinates */ 2074efa14ee0SMatthew G Knepley { 2075efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 2076efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 2077efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 2078285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2079efa14ee0SMatthew G Knepley 2080e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2081e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2082e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2083285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2084285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2085285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2086efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2087efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2088efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2089efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2090efa14ee0SMatthew G Knepley PetscInt dof; 2091efa14ee0SMatthew G Knepley 2092efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2093efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2094285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2095e6ccafaeSMatthew G Knepley } 2096e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2097e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2098e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2099e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 21002eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2101830e53efSMatthew G. Knepley if (coordSize) { 2102e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2103e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2104efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2105efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2106efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2107efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2108e6ccafaeSMatthew G Knepley 2109e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2110e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2111efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2112efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2113efa14ee0SMatthew 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); 2114e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2115e6ccafaeSMatthew G Knepley } 2116e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2117e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 21183b399e24SMatthew G. Knepley } 2119e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2120e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2121e6ccafaeSMatthew G Knepley } 2122efa14ee0SMatthew G Knepley /* Cleanup */ 2123efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2124efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2125efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2126efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2127e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2128e6ccafaeSMatthew G Knepley } 2129e6ccafaeSMatthew G Knepley 2130e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2131e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated" 213253156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2133e6ccafaeSMatthew G Knepley { 213482f516ccSBarry Smith MPI_Comm comm; 213553156dfcSMatthew G. Knepley DMLabel subpointMap; 2136efa14ee0SMatthew G Knepley IS *subpointIS; 2137efa14ee0SMatthew G Knepley const PetscInt **subpoints; 213801a2673eSMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *coneONew; 2139efa14ee0SMatthew G Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2140e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2141e6ccafaeSMatthew G Knepley 2142e6ccafaeSMatthew G Knepley PetscFunctionBegin; 214382f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2144efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2145e6ccafaeSMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2146efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2147efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 214853156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Interpolated(dm, vertexLabel, value, subpointMap, subdm);CHKERRQ(ierr);} 2149efa14ee0SMatthew G Knepley /* Setup chart */ 2150efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2151efa14ee0SMatthew G Knepley ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr); 2152e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2153e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2154e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 2155e6ccafaeSMatthew G Knepley } 2156e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2157e6ccafaeSMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2158e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2159e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 2160e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2161e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2162e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2163e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2164e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2165e6ccafaeSMatthew G Knepley ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2166e6ccafaeSMatthew G Knepley } 2167e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2168e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2169e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2170e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2171e6ccafaeSMatthew G Knepley const PetscInt *cone; 2172e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 2173e6ccafaeSMatthew G Knepley 2174e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2175e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2176e6ccafaeSMatthew G Knepley if (d == dim) { 2177e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2178e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2179e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2180e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 2181e6ccafaeSMatthew G Knepley } 2182e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2183e6ccafaeSMatthew G Knepley } 2184e6ccafaeSMatthew G Knepley } 2185e6ccafaeSMatthew G Knepley } 2186e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2187e6ccafaeSMatthew G Knepley /* Set cones */ 21880298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 218901a2673eSMatthew G. Knepley ierr = PetscMalloc2(maxConeSize,PetscInt,&coneNew,maxConeSize,PetscInt,&coneONew);CHKERRQ(ierr); 2190e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2191e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2192e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2193e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 21940e49e2e2SMatthew G. Knepley const PetscInt *cone, *ornt; 2195e6ccafaeSMatthew G Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2196e6ccafaeSMatthew G Knepley 2197e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2198e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2199e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 22000e49e2e2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2201e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2202e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 220301a2673eSMatthew G. Knepley if (subc >= 0) { 220401a2673eSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 220501a2673eSMatthew G. Knepley coneONew[coneSizeNew] = ornt[c]; 220601a2673eSMatthew G. Knepley ++coneSizeNew; 220701a2673eSMatthew G. Knepley } 2208e6ccafaeSMatthew G Knepley } 2209e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2210e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 221101a2673eSMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, coneONew);CHKERRQ(ierr); 2212e6ccafaeSMatthew G Knepley } 2213e6ccafaeSMatthew G Knepley } 221401a2673eSMatthew G. Knepley ierr = PetscFree2(coneNew,coneONew);CHKERRQ(ierr); 2215e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2216e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2217e6ccafaeSMatthew G Knepley /* Build coordinates */ 2218e6ccafaeSMatthew G Knepley { 2219e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 2220e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 2221e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 2222285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2223e6ccafaeSMatthew G Knepley 2224e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2225e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2226e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2227285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2228285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2229285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2230e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2231e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2232e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2233e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2234e6ccafaeSMatthew G Knepley PetscInt dof; 2235e6ccafaeSMatthew G Knepley 2236e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2237e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2238285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2239e6ccafaeSMatthew G Knepley } 2240e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2241e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2242e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2243e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 22442eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2245e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2246e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2247e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2248e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2249e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2250e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2251e6ccafaeSMatthew G Knepley 2252e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2253e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2254e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2255e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2256e6ccafaeSMatthew 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); 2257efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2258e6ccafaeSMatthew G Knepley } 2259e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2260e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2261e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2262e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2263e6ccafaeSMatthew G Knepley } 2264efa14ee0SMatthew G Knepley /* Cleanup */ 2265e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2266e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2267e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2268e6ccafaeSMatthew G Knepley } 2269efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2270e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2271e6ccafaeSMatthew G Knepley } 2272e6ccafaeSMatthew G Knepley 2273e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2274e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh" 2275d0fa310fSMatthew G. Knepley /*@ 2276e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 2277e6ccafaeSMatthew G Knepley 2278e6ccafaeSMatthew G Knepley Input Parameters: 2279e6ccafaeSMatthew G Knepley + dm - The original mesh 2280830e53efSMatthew G. Knepley . vertexLabel - The DMLabel marking vertices contained in the surface 2281830e53efSMatthew G. Knepley - value - The label value to use 2282e6ccafaeSMatthew G Knepley 2283e6ccafaeSMatthew G Knepley Output Parameter: 2284e6ccafaeSMatthew G Knepley . subdm - The surface mesh 2285e6ccafaeSMatthew G Knepley 2286e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2287e6ccafaeSMatthew G Knepley 2288e6ccafaeSMatthew G Knepley Level: developer 2289e6ccafaeSMatthew G Knepley 2290e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue() 2291830e53efSMatthew G. Knepley @*/ 229253156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm) 2293e6ccafaeSMatthew G Knepley { 2294e6ccafaeSMatthew G Knepley PetscInt dim, depth; 2295e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2296e6ccafaeSMatthew G Knepley 2297e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2298e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2299766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 2300e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2301e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 230282f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2303e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2304e6ccafaeSMatthew G Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2305e6ccafaeSMatthew G Knepley if (depth == dim) { 2306830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2307e6ccafaeSMatthew G Knepley } else { 2308830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2309e6ccafaeSMatthew G Knepley } 2310e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2311e6ccafaeSMatthew G Knepley } 2312e6ccafaeSMatthew G Knepley 2313e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2314aca35d17SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal" 2315aca35d17SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 2316aca35d17SMatthew G. Knepley { 2317aca35d17SMatthew G. Knepley PetscInt subPoint; 2318aca35d17SMatthew G. Knepley PetscErrorCode ierr; 2319aca35d17SMatthew G. Knepley 2320aca35d17SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 2321aca35d17SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 2322aca35d17SMatthew G. Knepley } 2323aca35d17SMatthew G. Knepley 2324aca35d17SMatthew G. Knepley #undef __FUNCT__ 2325766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated" 232627c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 2327766ab985SMatthew G. Knepley { 2328766ab985SMatthew G. Knepley MPI_Comm comm; 2329766ab985SMatthew G. Knepley DMLabel subpointMap; 2330766ab985SMatthew G. Knepley IS subvertexIS; 2331766ab985SMatthew G. Knepley const PetscInt *subVertices; 2332fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 2333766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 233487feddfdSMatthew G. Knepley PetscInt cMax, c, f; 2335766ab985SMatthew G. Knepley PetscErrorCode ierr; 2336766ab985SMatthew G. Knepley 2337766ab985SMatthew G. Knepley PetscFunctionBegin; 2338766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 2339766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2340766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2341766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2342766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 234327c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 2344766ab985SMatthew G. Knepley /* Setup chart */ 2345766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2346766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2347766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2348766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2349766ab985SMatthew G. Knepley /* Set cone sizes */ 2350766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 2351766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 2352766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 2353766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2354766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2355766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2356766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2357766ab985SMatthew G. Knepley } 2358766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2359766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2360766ab985SMatthew G. Knepley } 2361766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2362766ab985SMatthew G. Knepley /* Create face cones */ 2363766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 236487feddfdSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2365766ab985SMatthew G. Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2366766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2367766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 2368766ab985SMatthew G. Knepley const PetscInt subcell = c; 236987feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 237087feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 2371766ab985SMatthew G. Knepley 237287feddfdSMatthew G. Knepley if (cell < cMax) continue; 237387feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 237487feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 237587feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 237687feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 237787feddfdSMatthew G. Knepley } 237887feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 237987feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 238087feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 238127234c99SMatthew G. Knepley /* Not true in parallel 238227234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 238387feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 238487feddfdSMatthew G. Knepley PetscInt negsubcell; 2385766ab985SMatthew G. Knepley 238687feddfdSMatthew G. Knepley if (cells[p] >= cMax) continue; 238787feddfdSMatthew G. Knepley /* I know this is a crap search */ 238887feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 238987feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 2390766ab985SMatthew G. Knepley } 239187feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 239287feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 2393766ab985SMatthew G. Knepley } 239487feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 239587feddfdSMatthew G. Knepley ++newFacePoint; 2396766ab985SMatthew G. Knepley } 2397766ab985SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2398766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2399766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2400766ab985SMatthew G. Knepley /* Build coordinates */ 2401766ab985SMatthew G. Knepley { 2402766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2403766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2404766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2405285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2406766ab985SMatthew G. Knepley 2407766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2408766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2409766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2410285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2411285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2412285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2413766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2414766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2415766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2416766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2417766ab985SMatthew G. Knepley PetscInt dof; 2418766ab985SMatthew G. Knepley 2419766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2420766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2421285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2422766ab985SMatthew G. Knepley } 2423766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2424766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2425766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2426766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 24272eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2428766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2429766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2430766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2431766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2432766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2433766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 2434766ab985SMatthew G. Knepley 2435766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2436766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2437766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2438766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2439766ab985SMatthew 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); 2440766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2441766ab985SMatthew G. Knepley } 2442766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2443766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2444766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2445766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2446766ab985SMatthew G. Knepley } 2447aca35d17SMatthew G. Knepley /* Build SF */ 2448aca35d17SMatthew G. Knepley CHKMEMQ; 2449aca35d17SMatthew G. Knepley { 2450aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 2451aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 2452bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 2453aca35d17SMatthew G. Knepley const PetscInt *localPoints; 2454bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 245549c26ae4SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 2456bdcf2095SMatthew G. Knepley PetscMPIInt rank; 2457aca35d17SMatthew G. Knepley 2458bdcf2095SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 2459aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 2460aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 2461aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2462aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 2463aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 2464aca35d17SMatthew G. Knepley if (numRoots >= 0) { 2465aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 2466bdcf2095SMatthew G. Knepley ierr = PetscMalloc2(pEnd-pStart,PetscSFNode,&newLocalPoints,numRoots,PetscSFNode,&newOwners);CHKERRQ(ierr); 2467bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 2468bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 2469bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 2470bdcf2095SMatthew G. Knepley } 24719e0823b2SMatthew G. Knepley /* Set subleaves */ 2472aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2473aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 2474bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2475aca35d17SMatthew G. Knepley 2476aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 2477bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 2478bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 2479bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 2480bdcf2095SMatthew G. Knepley ++numSubLeaves; 2481aca35d17SMatthew G. Knepley } 24829e0823b2SMatthew G. Knepley /* Must put in owned subpoints */ 24839e0823b2SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 24849e0823b2SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 24859e0823b2SMatthew G. Knepley 24869e0823b2SMatthew G. Knepley if (subPoint < 0) { 24879e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = -3; 24889e0823b2SMatthew G. Knepley newOwners[p-pStart].index = -3; 24899e0823b2SMatthew G. Knepley } else { 24909e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = rank; 24919e0823b2SMatthew G. Knepley newOwners[p-pStart].index = subPoint; 24929e0823b2SMatthew G. Knepley } 2493bdcf2095SMatthew G. Knepley } 2494bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2495bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2496bdcf2095SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2497bdcf2095SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2498aca35d17SMatthew G. Knepley ierr = PetscMalloc(numSubLeaves * sizeof(PetscInt), &slocalPoints);CHKERRQ(ierr); 2499aca35d17SMatthew G. Knepley ierr = PetscMalloc(numSubLeaves * sizeof(PetscSFNode), &sremotePoints);CHKERRQ(ierr); 250049c26ae4SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 2501bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 2502bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2503aca35d17SMatthew G. Knepley 2504aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 250549c26ae4SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 2506aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 2507bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 2508bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 2509bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 2510bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 2511aca35d17SMatthew G. Knepley ++sl; 2512aca35d17SMatthew G. Knepley } 2513bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 251449c26ae4SMatthew G. Knepley if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 251549c26ae4SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 2516aca35d17SMatthew G. Knepley } 2517aca35d17SMatthew G. Knepley } 2518aca35d17SMatthew G. Knepley CHKMEMQ; 2519766ab985SMatthew G. Knepley /* Cleanup */ 2520766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2521766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2522766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 2523766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2524766ab985SMatthew G. Knepley } 2525766ab985SMatthew G. Knepley 2526766ab985SMatthew G. Knepley #undef __FUNCT__ 2527766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated" 252827c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 2529766ab985SMatthew G. Knepley { 2530766ab985SMatthew G. Knepley MPI_Comm comm; 2531766ab985SMatthew G. Knepley DMLabel subpointMap; 2532766ab985SMatthew G. Knepley IS *subpointIS; 2533766ab985SMatthew G. Knepley const PetscInt **subpoints; 2534766ab985SMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew; 2535766ab985SMatthew G. Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2536766ab985SMatthew G. Knepley PetscErrorCode ierr; 2537766ab985SMatthew G. Knepley 2538766ab985SMatthew G. Knepley PetscFunctionBegin; 2539766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2540766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2541766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2542766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2543766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 254427c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, hasLagrange, label, value, subpointMap, subdm);CHKERRQ(ierr); 2545766ab985SMatthew G. Knepley /* Setup chart */ 2546766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2547766ab985SMatthew G. Knepley ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr); 2548766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2549766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2550766ab985SMatthew G. Knepley totSubPoints += numSubPoints[d]; 2551766ab985SMatthew G. Knepley } 2552766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2553766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2554766ab985SMatthew G. Knepley /* Set cone sizes */ 2555766ab985SMatthew G. Knepley firstSubPoint[dim] = 0; 2556766ab985SMatthew G. Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2557766ab985SMatthew G. Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2558766ab985SMatthew G. Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2559766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2560766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2561766ab985SMatthew G. Knepley ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2562766ab985SMatthew G. Knepley } 2563766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2564766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2565766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2566766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2567766ab985SMatthew G. Knepley const PetscInt *cone; 2568766ab985SMatthew G. Knepley PetscInt coneSize, coneSizeNew, c, val; 2569766ab985SMatthew G. Knepley 2570766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2571766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2572766ab985SMatthew G. Knepley if (d == dim) { 2573766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2574766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2575766ab985SMatthew G. Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2576766ab985SMatthew G. Knepley if (val >= 0) coneSizeNew++; 2577766ab985SMatthew G. Knepley } 2578766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2579766ab985SMatthew G. Knepley } 2580766ab985SMatthew G. Knepley } 2581766ab985SMatthew G. Knepley } 2582766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2583766ab985SMatthew G. Knepley /* Set cones */ 2584766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2585766ab985SMatthew G. Knepley ierr = PetscMalloc(maxConeSize * sizeof(PetscInt), &coneNew);CHKERRQ(ierr); 2586766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2587766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2588766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2589766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2590766ab985SMatthew G. Knepley const PetscInt *cone; 2591766ab985SMatthew G. Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2592766ab985SMatthew G. Knepley 2593766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2594766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2595766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2596766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2597766ab985SMatthew G. Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 2598766ab985SMatthew G. Knepley if (subc >= 0) coneNew[coneSizeNew++] = firstSubPoint[d-1] + subc; 2599766ab985SMatthew G. Knepley } 2600766ab985SMatthew G. Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2601766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 2602766ab985SMatthew G. Knepley } 2603766ab985SMatthew G. Knepley } 2604766ab985SMatthew G. Knepley ierr = PetscFree(coneNew);CHKERRQ(ierr); 2605766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2606766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2607766ab985SMatthew G. Knepley /* Build coordinates */ 2608766ab985SMatthew G. Knepley { 2609766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2610766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2611766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2612285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2613766ab985SMatthew G. Knepley 2614766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2615766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2616766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2617285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2618285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2619285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2620766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2621766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2622766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 2623766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2624766ab985SMatthew G. Knepley PetscInt dof; 2625766ab985SMatthew G. Knepley 2626766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2627766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2628285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2629766ab985SMatthew G. Knepley } 2630766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2631766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2632766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2633766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 26342eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2635766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2636766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2637766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2638766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 2639766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2640766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 2641766ab985SMatthew G. Knepley 2642766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2643766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2644766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2645766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2646766ab985SMatthew 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); 2647766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2648766ab985SMatthew G. Knepley } 2649766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2650766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2651766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2652766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2653766ab985SMatthew G. Knepley } 2654766ab985SMatthew G. Knepley /* Cleanup */ 2655766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2656766ab985SMatthew G. Knepley ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2657766ab985SMatthew G. Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2658766ab985SMatthew G. Knepley } 2659766ab985SMatthew G. Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2660766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2661766ab985SMatthew G. Knepley } 2662766ab985SMatthew G. Knepley 2663766ab985SMatthew G. Knepley #undef __FUNCT__ 2664766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh" 2665766ab985SMatthew G. Knepley /* 266627c04023SMatthew G. Knepley DMPlexCreateCohesiveSubmesh - Extract from a mesh with cohesive cells the hypersurface defined by one face of the cells. Optionally, a Label an be given to restrict the cells. 2667766ab985SMatthew G. Knepley 2668766ab985SMatthew G. Knepley Input Parameters: 2669766ab985SMatthew G. Knepley + dm - The original mesh 267027c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 267127c04023SMatthew G. Knepley . label - A label name, or PETSC_NULL 267227c04023SMatthew G. Knepley - value - A label value 2673766ab985SMatthew G. Knepley 2674766ab985SMatthew G. Knepley Output Parameter: 2675766ab985SMatthew G. Knepley . subdm - The surface mesh 2676766ab985SMatthew G. Knepley 2677766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2678766ab985SMatthew G. Knepley 2679766ab985SMatthew G. Knepley Level: developer 2680766ab985SMatthew G. Knepley 2681766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 2682766ab985SMatthew G. Knepley */ 268327c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 2684766ab985SMatthew G. Knepley { 2685766ab985SMatthew G. Knepley PetscInt dim, depth; 2686766ab985SMatthew G. Knepley PetscErrorCode ierr; 2687766ab985SMatthew G. Knepley 2688766ab985SMatthew G. Knepley PetscFunctionBegin; 2689766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 269027c04023SMatthew G. Knepley PetscValidPointer(subdm, 5); 2691766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2692766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2693766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2694766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2695766ab985SMatthew G. Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2696766ab985SMatthew G. Knepley if (depth == dim) { 269727c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 2698766ab985SMatthew G. Knepley } else { 269927c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 2700e6ccafaeSMatthew G Knepley } 2701e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2702e6ccafaeSMatthew G Knepley } 2703e6ccafaeSMatthew G Knepley 2704e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2705e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap" 270664beef6dSMatthew G. Knepley /*@ 270764beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 270864beef6dSMatthew G. Knepley 270964beef6dSMatthew G. Knepley Input Parameter: 271064beef6dSMatthew G. Knepley . dm - The submesh DM 271164beef6dSMatthew G. Knepley 271264beef6dSMatthew G. Knepley Output Parameter: 271364beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 271464beef6dSMatthew G. Knepley 271564beef6dSMatthew G. Knepley Level: developer 271664beef6dSMatthew G. Knepley 271764beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 271864beef6dSMatthew G. Knepley @*/ 2719e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 2720e6ccafaeSMatthew G Knepley { 2721e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 2722e6ccafaeSMatthew G Knepley 2723e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2724e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2725e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 2726e6ccafaeSMatthew G Knepley *subpointMap = mesh->subpointMap; 2727e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2728e6ccafaeSMatthew G Knepley } 2729e6ccafaeSMatthew G Knepley 2730e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2731e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap" 2732e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */ 2733e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 2734e6ccafaeSMatthew G Knepley { 2735e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 2736285d324eSMatthew G. Knepley DMLabel tmp; 2737e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2738e6ccafaeSMatthew G Knepley 2739e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2740e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2741285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 2742e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 2743285d324eSMatthew G. Knepley ++mesh->subpointMap->refct; 2744285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 2745e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2746e6ccafaeSMatthew G Knepley } 2747e6ccafaeSMatthew G Knepley 2748e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2749e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS" 275064beef6dSMatthew G. Knepley /*@ 2751e6ccafaeSMatthew G Knepley DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 2752e6ccafaeSMatthew G Knepley 2753e6ccafaeSMatthew G Knepley Input Parameter: 2754e6ccafaeSMatthew G Knepley . dm - The submesh DM 2755e6ccafaeSMatthew G Knepley 2756e6ccafaeSMatthew G Knepley Output Parameter: 27570298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 2758e6ccafaeSMatthew G Knepley 2759e6ccafaeSMatthew G Knepley Note: This is IS is guaranteed to be sorted by the construction of the submesh 276064beef6dSMatthew G. Knepley 276164beef6dSMatthew G. Knepley Level: developer 276264beef6dSMatthew G. Knepley 276364beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 276464beef6dSMatthew G. Knepley @*/ 2765e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 2766e6ccafaeSMatthew G Knepley { 276782f516ccSBarry Smith MPI_Comm comm; 2768e6ccafaeSMatthew G Knepley DMLabel subpointMap; 2769e6ccafaeSMatthew G Knepley IS is; 2770e6ccafaeSMatthew G Knepley const PetscInt *opoints; 2771e6ccafaeSMatthew G Knepley PetscInt *points, *depths; 2772e6ccafaeSMatthew G Knepley PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 2773e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2774e6ccafaeSMatthew G Knepley 2775e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2776e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2777e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 277882f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 27790298fd71SBarry Smith *subpointIS = NULL; 2780e6ccafaeSMatthew G Knepley ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 2781e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2782fed694aaSMatthew G. Knepley if (subpointMap && depth >= 0) { 2783e6ccafaeSMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2784e6ccafaeSMatthew G Knepley if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 2785e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 2786e6ccafaeSMatthew G Knepley depths[0] = depth; 2787e6ccafaeSMatthew G Knepley depths[1] = 0; 2788e6ccafaeSMatthew G Knepley for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 2789e6ccafaeSMatthew G Knepley ierr = PetscMalloc(pEnd * sizeof(PetscInt), &points);CHKERRQ(ierr); 2790e6ccafaeSMatthew G Knepley for(d = 0, off = 0; d <= depth; ++d) { 2791e6ccafaeSMatthew G Knepley const PetscInt dep = depths[d]; 2792e6ccafaeSMatthew G Knepley 2793e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 2794e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 27951e21b6fdSMatthew G Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 2796e6ccafaeSMatthew 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); 2797e6ccafaeSMatthew G Knepley } else { 27981e21b6fdSMatthew G Knepley if (!n) { 27991e21b6fdSMatthew G Knepley if (d == 0) { 28001e21b6fdSMatthew G Knepley /* Missing cells */ 28011e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 28021e21b6fdSMatthew G Knepley } else { 28031e21b6fdSMatthew G Knepley /* Missing faces */ 28041e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 28051e21b6fdSMatthew G Knepley } 28061e21b6fdSMatthew G Knepley } 2807e6ccafaeSMatthew G Knepley } 2808e6ccafaeSMatthew G Knepley if (n) { 2809e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 2810e6ccafaeSMatthew G Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 2811e6ccafaeSMatthew G Knepley for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 2812e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 2813e6ccafaeSMatthew G Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 2814e6ccafaeSMatthew G Knepley } 2815e6ccafaeSMatthew G Knepley } 2816e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 2817e6ccafaeSMatthew G Knepley if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 2818fed694aaSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 2819e6ccafaeSMatthew G Knepley } 2820e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2821e6ccafaeSMatthew G Knepley } 2822