134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 20c312b8eSJed Brown #include <petscsf.h> 3e6ccafaeSMatthew G Knepley 4e6ccafaeSMatthew G Knepley #undef __FUNCT__ 5cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces" 6cd0c2139SMatthew G Knepley /*@ 7cd0c2139SMatthew G Knepley DMPlexMarkBoundaryFaces - Mark all faces on the boundary 8cd0c2139SMatthew G Knepley 9cd0c2139SMatthew G Knepley Not Collective 10cd0c2139SMatthew G Knepley 11cd0c2139SMatthew G Knepley Input Parameter: 12cd0c2139SMatthew G Knepley . dm - The original DM 13cd0c2139SMatthew G Knepley 14cd0c2139SMatthew G Knepley Output Parameter: 15cd0c2139SMatthew G Knepley . label - The DMLabel marking boundary faces with value 1 16cd0c2139SMatthew G Knepley 17cd0c2139SMatthew G Knepley Level: developer 18cd0c2139SMatthew G Knepley 19cd0c2139SMatthew G Knepley .seealso: DMLabelCreate(), DMPlexCreateLabel() 2009f723d9SJed Brown @*/ 21cd0c2139SMatthew G Knepley PetscErrorCode DMPlexMarkBoundaryFaces(DM dm, DMLabel label) 22cd0c2139SMatthew G Knepley { 23cd0c2139SMatthew G Knepley PetscInt fStart, fEnd, f; 24cd0c2139SMatthew G Knepley PetscErrorCode ierr; 25cd0c2139SMatthew G Knepley 26cd0c2139SMatthew G Knepley PetscFunctionBegin; 27cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 28cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 29cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 30cd0c2139SMatthew G Knepley PetscInt supportSize; 31cd0c2139SMatthew G Knepley 32cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 33cd0c2139SMatthew G Knepley if (supportSize == 1) { 34cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, f, 1);CHKERRQ(ierr); 35cd0c2139SMatthew G Knepley } 36cd0c2139SMatthew G Knepley } 37cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 38cd0c2139SMatthew G Knepley } 39cd0c2139SMatthew G Knepley 40cd0c2139SMatthew G Knepley #undef __FUNCT__ 412be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelComplete" 422be2b188SMatthew G Knepley /*@ 432be2b188SMatthew G Knepley DMPlexLabelComplete - Starting with a label marking points on a surface, we add the transitive closure to the surface 442be2b188SMatthew G Knepley 452be2b188SMatthew G Knepley Input Parameters: 462be2b188SMatthew G Knepley + dm - The DM 472be2b188SMatthew G Knepley - label - A DMLabel marking the surface points 482be2b188SMatthew G Knepley 492be2b188SMatthew G Knepley Output Parameter: 502be2b188SMatthew G Knepley . label - A DMLabel marking all surface points in the transitive closure 512be2b188SMatthew G Knepley 522be2b188SMatthew G Knepley Level: developer 532be2b188SMatthew G Knepley 542be2b188SMatthew G Knepley .seealso: DMPlexLabelCohesiveComplete() 552be2b188SMatthew G Knepley @*/ 562be2b188SMatthew G Knepley PetscErrorCode DMPlexLabelComplete(DM dm, DMLabel label) 572be2b188SMatthew G Knepley { 582be2b188SMatthew G Knepley IS valueIS; 592be2b188SMatthew G Knepley const PetscInt *values; 602be2b188SMatthew G Knepley PetscInt numValues, v; 612be2b188SMatthew G Knepley PetscErrorCode ierr; 622be2b188SMatthew G Knepley 632be2b188SMatthew G Knepley PetscFunctionBegin; 642be2b188SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 652be2b188SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 662be2b188SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 672be2b188SMatthew G Knepley for (v = 0; v < numValues; ++v) { 682be2b188SMatthew G Knepley IS pointIS; 692be2b188SMatthew G Knepley const PetscInt *points; 702be2b188SMatthew G Knepley PetscInt numPoints, p; 712be2b188SMatthew G Knepley 722be2b188SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 732be2b188SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 742be2b188SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 752be2b188SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 762be2b188SMatthew G Knepley PetscInt *closure = NULL; 772be2b188SMatthew G Knepley PetscInt closureSize, c; 782be2b188SMatthew G Knepley 792be2b188SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 802be2b188SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 812be2b188SMatthew G Knepley ierr = DMLabelSetValue(label, closure[c], values[v]);CHKERRQ(ierr); 822be2b188SMatthew G Knepley } 832be2b188SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 842be2b188SMatthew G Knepley } 852be2b188SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 862be2b188SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 872be2b188SMatthew G Knepley } 882be2b188SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 892be2b188SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 902be2b188SMatthew G Knepley PetscFunctionReturn(0); 912be2b188SMatthew G Knepley } 922be2b188SMatthew G Knepley 932be2b188SMatthew G Knepley #undef __FUNCT__ 94cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoint_Internal" 95cd0c2139SMatthew G Knepley PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthEnd[], PetscInt depthShift[]) 96cd0c2139SMatthew G Knepley { 97cd0c2139SMatthew G Knepley if (depth < 0) return p; 98cd0c2139SMatthew G Knepley /* Cells */ if (p < depthEnd[depth]) return p; 99cd0c2139SMatthew G Knepley /* Vertices */ if (p < depthEnd[0]) return p + depthShift[depth]; 100cd0c2139SMatthew G Knepley /* Faces */ if (p < depthEnd[depth-1]) return p + depthShift[depth] + depthShift[0]; 101cd0c2139SMatthew G Knepley /* Edges */ return p + depthShift[depth] + depthShift[0] + depthShift[depth-1]; 102cd0c2139SMatthew G Knepley } 103cd0c2139SMatthew G Knepley 104cd0c2139SMatthew G Knepley #undef __FUNCT__ 105cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSizes_Internal" 106cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew) 107cd0c2139SMatthew G Knepley { 108cd0c2139SMatthew G Knepley PetscInt *depthEnd; 109cd0c2139SMatthew G Knepley PetscInt depth = 0, d, pStart, pEnd, p; 110cd0c2139SMatthew G Knepley PetscErrorCode ierr; 111cd0c2139SMatthew G Knepley 112cd0c2139SMatthew G Knepley PetscFunctionBegin; 113cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 114cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 115cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 116cd0c2139SMatthew G Knepley /* Step 1: Expand chart */ 117cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 118cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 119cd0c2139SMatthew G Knepley pEnd += depthShift[d]; 120cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 121cd0c2139SMatthew G Knepley } 122cd0c2139SMatthew G Knepley ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr); 123cd0c2139SMatthew G Knepley /* Step 2: Set cone and support sizes */ 124cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 125cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 126cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 127cd0c2139SMatthew G Knepley PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthEnd, depthShift); 128cd0c2139SMatthew G Knepley PetscInt size; 129cd0c2139SMatthew G Knepley 130cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 131cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr); 132cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 133cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr); 134cd0c2139SMatthew G Knepley } 135cd0c2139SMatthew G Knepley } 136cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 137cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 138cd0c2139SMatthew G Knepley } 139cd0c2139SMatthew G Knepley 140cd0c2139SMatthew G Knepley #undef __FUNCT__ 141cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoints_Internal" 142cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew) 143cd0c2139SMatthew G Knepley { 144cd0c2139SMatthew G Knepley PetscInt *depthEnd, *newpoints; 145dcbb62e8SMatthew G. Knepley PetscInt depth = 0, d, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, pStart, pEnd, p; 146cd0c2139SMatthew G Knepley PetscErrorCode ierr; 147cd0c2139SMatthew G Knepley 148cd0c2139SMatthew G Knepley PetscFunctionBegin; 149cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 150cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 151cd0c2139SMatthew G Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 152dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dmNew, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 153dcbb62e8SMatthew G. Knepley ierr = PetscMalloc2(depth+1,PetscInt,&depthEnd,PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),PetscInt,&newpoints);CHKERRQ(ierr); 154cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 155cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 156cd0c2139SMatthew G Knepley } 157cd0c2139SMatthew G Knepley /* Step 5: Set cones and supports */ 158cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 159cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 160cd0c2139SMatthew G Knepley const PetscInt *points = NULL, *orientations = NULL; 161dcbb62e8SMatthew G. Knepley PetscInt size,sizeNew, i, newp = DMPlexShiftPoint_Internal(p, depth, depthEnd, depthShift); 162cd0c2139SMatthew G Knepley 163cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 164cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr); 165cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr); 166cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 167cd0c2139SMatthew G Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthEnd, depthShift); 168cd0c2139SMatthew G Knepley } 169cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr); 170cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr); 171cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 172dcbb62e8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmNew, newp, &sizeNew);CHKERRQ(ierr); 173cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr); 174cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 175cd0c2139SMatthew G Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthEnd, depthShift); 176cd0c2139SMatthew G Knepley } 177dcbb62e8SMatthew G. Knepley for (i = size; i < sizeNew; ++i) newpoints[i] = 0; 178cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr); 179cd0c2139SMatthew G Knepley } 180cd0c2139SMatthew G Knepley ierr = PetscFree2(depthEnd,newpoints);CHKERRQ(ierr); 181cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 182cd0c2139SMatthew G Knepley } 183cd0c2139SMatthew G Knepley 184cd0c2139SMatthew G Knepley #undef __FUNCT__ 185cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftCoordinates_Internal" 186cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew) 187cd0c2139SMatthew G Knepley { 188cd0c2139SMatthew G Knepley PetscSection coordSection, newCoordSection; 189cd0c2139SMatthew G Knepley Vec coordinates, newCoordinates; 190cd0c2139SMatthew G Knepley PetscScalar *coords, *newCoords; 191cd0c2139SMatthew G Knepley PetscInt *depthEnd, coordSize; 192cd0c2139SMatthew G Knepley PetscInt dim, depth = 0, d, vStart, vEnd, vStartNew, vEndNew, v; 193cd0c2139SMatthew G Knepley PetscErrorCode ierr; 194cd0c2139SMatthew G Knepley 195cd0c2139SMatthew G Knepley PetscFunctionBegin; 196cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 197cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 198cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 199cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 200cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 201cd0c2139SMatthew G Knepley } 202cd0c2139SMatthew G Knepley /* Step 8: Convert coordinates */ 203cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 204cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr); 205cd0c2139SMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 206cd0c2139SMatthew G Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr); 207cd0c2139SMatthew G Knepley ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr); 208cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr); 209cd0c2139SMatthew G Knepley ierr = PetscSectionSetChart(newCoordSection, vStartNew, vEndNew);CHKERRQ(ierr); 210cd0c2139SMatthew G Knepley for (v = vStartNew; v < vEndNew; ++v) { 211cd0c2139SMatthew G Knepley ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr); 212cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr); 213cd0c2139SMatthew G Knepley } 214cd0c2139SMatthew G Knepley ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr); 215cd0c2139SMatthew G Knepley ierr = DMPlexSetCoordinateSection(dmNew, newCoordSection);CHKERRQ(ierr); 216cd0c2139SMatthew G Knepley ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr); 217cd0c2139SMatthew G Knepley ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr); 218cd0c2139SMatthew G Knepley ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr); 219cd0c2139SMatthew G Knepley ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2202eb5907fSJed Brown ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr); 221cd0c2139SMatthew G Knepley ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr); 222cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 223cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 224cd0c2139SMatthew G Knepley ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr); 225cd0c2139SMatthew G Knepley for (v = vStart; v < vEnd; ++v) { 226cd0c2139SMatthew G Knepley PetscInt dof, off, noff, d; 227cd0c2139SMatthew G Knepley 228cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 229cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 230cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthEnd, depthShift), &noff);CHKERRQ(ierr); 231cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) { 232cd0c2139SMatthew G Knepley newCoords[noff+d] = coords[off+d]; 233cd0c2139SMatthew G Knepley } 234cd0c2139SMatthew G Knepley } 235cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 236cd0c2139SMatthew G Knepley ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr); 237cd0c2139SMatthew G Knepley ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 238cd0c2139SMatthew G Knepley ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr); 239cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 240cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 241cd0c2139SMatthew G Knepley } 242cd0c2139SMatthew G Knepley 243cd0c2139SMatthew G Knepley #undef __FUNCT__ 244cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal" 245cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew) 246cd0c2139SMatthew G Knepley { 247cd0c2139SMatthew G Knepley PetscInt *depthEnd; 248cd0c2139SMatthew G Knepley PetscInt depth = 0, d; 249cd0c2139SMatthew G Knepley PetscSF sfPoint, sfPointNew; 250cd0c2139SMatthew G Knepley const PetscSFNode *remotePoints; 251cd0c2139SMatthew G Knepley PetscSFNode *gremotePoints; 252cd0c2139SMatthew G Knepley const PetscInt *localPoints; 253cd0c2139SMatthew G Knepley PetscInt *glocalPoints, *newLocation, *newRemoteLocation; 254cd0c2139SMatthew G Knepley PetscInt numRoots, numLeaves, l, pStart, pEnd, totShift = 0; 255cd0c2139SMatthew G Knepley PetscErrorCode ierr; 256cd0c2139SMatthew G Knepley 257cd0c2139SMatthew G Knepley PetscFunctionBegin; 258cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 259cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 260cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 261cd0c2139SMatthew G Knepley totShift += depthShift[d]; 262cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 263cd0c2139SMatthew G Knepley } 264cd0c2139SMatthew G Knepley /* Step 9: Convert pointSF */ 265cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 266cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr); 267cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 268cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 269cd0c2139SMatthew G Knepley if (numRoots >= 0) { 270cd0c2139SMatthew G Knepley ierr = PetscMalloc2(numRoots,PetscInt,&newLocation,pEnd-pStart,PetscInt,&newRemoteLocation);CHKERRQ(ierr); 271cd0c2139SMatthew G Knepley for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthEnd, depthShift); 272cd0c2139SMatthew G Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 273cd0c2139SMatthew G Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 274cd0c2139SMatthew G Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscInt), &glocalPoints);CHKERRQ(ierr); 275cd0c2139SMatthew G Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscSFNode), &gremotePoints);CHKERRQ(ierr); 276cd0c2139SMatthew G Knepley for (l = 0; l < numLeaves; ++l) { 277cd0c2139SMatthew G Knepley glocalPoints[l] = DMPlexShiftPoint_Internal(localPoints[l], depth, depthEnd, depthShift); 278cd0c2139SMatthew G Knepley gremotePoints[l].rank = remotePoints[l].rank; 279cd0c2139SMatthew G Knepley gremotePoints[l].index = newRemoteLocation[localPoints[l]]; 280cd0c2139SMatthew G Knepley } 281cd0c2139SMatthew G Knepley ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr); 282cd0c2139SMatthew G Knepley ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 283cd0c2139SMatthew G Knepley } 284cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 285cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 286cd0c2139SMatthew G Knepley } 287cd0c2139SMatthew G Knepley 288cd0c2139SMatthew G Knepley #undef __FUNCT__ 289cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal" 290cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew) 291cd0c2139SMatthew G Knepley { 292cd0c2139SMatthew G Knepley PetscSF sfPoint; 293cd0c2139SMatthew G Knepley DMLabel vtkLabel, ghostLabel; 294cd0c2139SMatthew G Knepley PetscInt *depthEnd; 295cd0c2139SMatthew G Knepley const PetscSFNode *leafRemote; 296cd0c2139SMatthew G Knepley const PetscInt *leafLocal; 297cd0c2139SMatthew G Knepley PetscInt depth = 0, d, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f; 298cd0c2139SMatthew G Knepley PetscMPIInt rank; 299cd0c2139SMatthew G Knepley PetscErrorCode ierr; 300cd0c2139SMatthew G Knepley 301cd0c2139SMatthew G Knepley PetscFunctionBegin; 302cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 303cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 304cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 305cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 306cd0c2139SMatthew G Knepley } 307cd0c2139SMatthew G Knepley /* Step 10: Convert labels */ 308cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 309cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 310cd0c2139SMatthew G Knepley DMLabel label, newlabel; 311cd0c2139SMatthew G Knepley const char *lname; 312cd0c2139SMatthew G Knepley PetscBool isDepth; 313cd0c2139SMatthew G Knepley IS valueIS; 314cd0c2139SMatthew G Knepley const PetscInt *values; 315cd0c2139SMatthew G Knepley PetscInt numValues, val; 316cd0c2139SMatthew G Knepley 317cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr); 318cd0c2139SMatthew G Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 319cd0c2139SMatthew G Knepley if (isDepth) continue; 320cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, lname);CHKERRQ(ierr); 321cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr); 322cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr); 323cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 324cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 325cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 326cd0c2139SMatthew G Knepley for (val = 0; val < numValues; ++val) { 327cd0c2139SMatthew G Knepley IS pointIS; 328cd0c2139SMatthew G Knepley const PetscInt *points; 329cd0c2139SMatthew G Knepley PetscInt numPoints, p; 330cd0c2139SMatthew G Knepley 331cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 332cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 333cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 334cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 335cd0c2139SMatthew G Knepley const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthEnd, depthShift); 336cd0c2139SMatthew G Knepley 337cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr); 338cd0c2139SMatthew G Knepley } 339cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 340cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 341cd0c2139SMatthew G Knepley } 342cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 343cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 344cd0c2139SMatthew G Knepley } 345cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 346cd0c2139SMatthew G Knepley /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */ 347cd0c2139SMatthew G Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 348cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 349cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 350cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr); 351cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "vtk");CHKERRQ(ierr); 352cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "ghost");CHKERRQ(ierr); 353cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr); 354cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr); 355cd0c2139SMatthew G Knepley for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { 356cd0c2139SMatthew G Knepley for (; c < leafLocal[l] && c < cEnd; ++c) { 357cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 358cd0c2139SMatthew G Knepley } 359cd0c2139SMatthew G Knepley if (leafLocal[l] >= cEnd) break; 360cd0c2139SMatthew G Knepley if (leafRemote[l].rank == rank) { 361cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 362cd0c2139SMatthew G Knepley } else { 363cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr); 364cd0c2139SMatthew G Knepley } 365cd0c2139SMatthew G Knepley } 366cd0c2139SMatthew G Knepley for (; c < cEnd; ++c) { 367cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 368cd0c2139SMatthew G Knepley } 369cd0c2139SMatthew G Knepley if (0) { 370cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 371cd0c2139SMatthew G Knepley ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 372cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 373cd0c2139SMatthew G Knepley } 374cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr); 375cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 376cd0c2139SMatthew G Knepley PetscInt numCells; 377cd0c2139SMatthew G Knepley 378cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr); 379cd0c2139SMatthew G Knepley if (numCells < 2) { 380cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr); 381cd0c2139SMatthew G Knepley } else { 382cd0c2139SMatthew G Knepley const PetscInt *cells = NULL; 383cd0c2139SMatthew G Knepley PetscInt vA, vB; 384cd0c2139SMatthew G Knepley 385cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr); 386cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr); 387cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr); 388cd0c2139SMatthew G Knepley if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);} 389cd0c2139SMatthew G Knepley } 390cd0c2139SMatthew G Knepley } 391cd0c2139SMatthew G Knepley if (0) { 392cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 393cd0c2139SMatthew G Knepley ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 394cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 395cd0c2139SMatthew G Knepley } 396cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 397cd0c2139SMatthew G Knepley } 398cd0c2139SMatthew G Knepley 399cd0c2139SMatthew G Knepley #undef __FUNCT__ 400cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal" 401cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm) 402cd0c2139SMatthew G Knepley { 403cd0c2139SMatthew G Knepley IS valueIS; 404cd0c2139SMatthew G Knepley const PetscInt *values; 405cd0c2139SMatthew G Knepley PetscInt *depthShift; 40646c796b9SMatthew G. Knepley PetscInt depth = 0, numFS, fs, fStart, fEnd, ghostCell, cEnd, c; 407cd0c2139SMatthew G Knepley PetscErrorCode ierr; 408cd0c2139SMatthew G Knepley 409cd0c2139SMatthew G Knepley PetscFunctionBegin; 41046c796b9SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 411cd0c2139SMatthew G Knepley /* Count ghost cells */ 412cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 413cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr); 414cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 415cd0c2139SMatthew G Knepley *numGhostCells = 0; 416cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 41746c796b9SMatthew G. Knepley IS faceIS; 41846c796b9SMatthew G. Knepley const PetscInt *faces; 41946c796b9SMatthew G. Knepley PetscInt numFaces, f, numBdFaces = 0; 420cd0c2139SMatthew G Knepley 42146c796b9SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 42246c796b9SMatthew G. Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 42346c796b9SMatthew G. Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 42446c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 42546c796b9SMatthew G. Knepley if ((faces[f] >= fStart) && (faces[f] < fEnd)) ++numBdFaces; 42646c796b9SMatthew G. Knepley } 427cd0c2139SMatthew G Knepley *numGhostCells += numBdFaces; 42846c796b9SMatthew G. Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 429cd0c2139SMatthew G Knepley } 430cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 431cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthShift);CHKERRQ(ierr); 432cd0c2139SMatthew G Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 433cd0c2139SMatthew G Knepley if (depth >= 0) depthShift[depth] = *numGhostCells; 434cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 435cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 436cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 437cd0c2139SMatthew G Knepley for (c = cEnd; c < cEnd + *numGhostCells; ++c) { 438cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr); 439cd0c2139SMatthew G Knepley } 440cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 441cd0c2139SMatthew G Knepley IS faceIS; 442cd0c2139SMatthew G Knepley const PetscInt *faces; 443cd0c2139SMatthew G Knepley PetscInt numFaces, f; 444cd0c2139SMatthew G Knepley 445cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 446cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 447cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 448cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 449cd0c2139SMatthew G Knepley PetscInt size; 450cd0c2139SMatthew G Knepley 45146c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 452cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr); 453cd0c2139SMatthew 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); 454cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(gdm, faces[f] + *numGhostCells, 2);CHKERRQ(ierr); 455cd0c2139SMatthew G Knepley } 456cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 457cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 458cd0c2139SMatthew G Knepley } 459cd0c2139SMatthew G Knepley /* Step 4: Setup ghosted DM */ 460cd0c2139SMatthew G Knepley ierr = DMSetUp(gdm);CHKERRQ(ierr); 461cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 462cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 463cd0c2139SMatthew G Knepley ghostCell = cEnd; 464cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 465cd0c2139SMatthew G Knepley IS faceIS; 466cd0c2139SMatthew G Knepley const PetscInt *faces; 467cd0c2139SMatthew G Knepley PetscInt numFaces, f; 468cd0c2139SMatthew G Knepley 469cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 470cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 471cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 47246c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 473cd0c2139SMatthew G Knepley PetscInt newFace = faces[f] + *numGhostCells; 474cd0c2139SMatthew G Knepley 47546c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 476cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr); 477cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr); 47846c796b9SMatthew G. Knepley ++ghostCell; 479cd0c2139SMatthew G Knepley } 480cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 481cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 482cd0c2139SMatthew G Knepley } 483cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 484cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 485cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 486cd0c2139SMatthew G Knepley ierr = DMPlexStratify(gdm);CHKERRQ(ierr); 487cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 488cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 489cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 490cd0c2139SMatthew G Knepley ierr = PetscFree(depthShift);CHKERRQ(ierr); 491cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 492cd0c2139SMatthew G Knepley } 493cd0c2139SMatthew G Knepley 494cd0c2139SMatthew G Knepley #undef __FUNCT__ 495cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells" 496cd0c2139SMatthew G Knepley /*@C 497cd0c2139SMatthew G Knepley DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face 498cd0c2139SMatthew G Knepley 499cd0c2139SMatthew G Knepley Collective on dm 500cd0c2139SMatthew G Knepley 501cd0c2139SMatthew G Knepley Input Parameters: 502cd0c2139SMatthew G Knepley + dm - The original DM 503cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL 504cd0c2139SMatthew G Knepley 505cd0c2139SMatthew G Knepley Output Parameters: 506cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM 507cd0c2139SMatthew G Knepley - dmGhosted - The new DM 508cd0c2139SMatthew G Knepley 509cd0c2139SMatthew G Knepley Note: If no label exists of that name, one will be created marking all boundary faces 510cd0c2139SMatthew G Knepley 511cd0c2139SMatthew G Knepley Level: developer 512cd0c2139SMatthew G Knepley 513cd0c2139SMatthew G Knepley .seealso: DMCreate() 51431266bc0SMatthew G. Knepley @*/ 515cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted) 516cd0c2139SMatthew G Knepley { 517cd0c2139SMatthew G Knepley DM gdm; 518cd0c2139SMatthew G Knepley DMLabel label; 519cd0c2139SMatthew G Knepley const char *name = labelName ? labelName : "Face Sets"; 520cd0c2139SMatthew G Knepley PetscInt dim; 521cd0c2139SMatthew G Knepley PetscErrorCode ierr; 522cd0c2139SMatthew G Knepley 523cd0c2139SMatthew G Knepley PetscFunctionBegin; 524cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 525cd0c2139SMatthew G Knepley PetscValidPointer(numGhostCells, 3); 526cd0c2139SMatthew G Knepley PetscValidPointer(dmGhosted, 4); 527cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr); 528cd0c2139SMatthew G Knepley ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr); 529cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 530cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(gdm, dim);CHKERRQ(ierr); 531cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 532cd0c2139SMatthew G Knepley if (!label) { 533cd0c2139SMatthew G Knepley /* Get label for boundary faces */ 534cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr); 535cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 536cd0c2139SMatthew G Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 537cd0c2139SMatthew G Knepley } 538cd0c2139SMatthew G Knepley ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr); 539cd0c2139SMatthew G Knepley ierr = DMSetFromOptions(gdm);CHKERRQ(ierr); 540cd0c2139SMatthew G Knepley *dmGhosted = gdm; 541cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 542cd0c2139SMatthew G Knepley } 543cd0c2139SMatthew G Knepley 544cd0c2139SMatthew G Knepley #undef __FUNCT__ 545cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal" 546607ab7a9SMatthew G. Knepley /* 547607ab7a9SMatthew G. Knepley We are adding two kinds of points here: 548607ab7a9SMatthew G. Knepley Replicated: Copies of points which exist in the mesh, such as vertices identified across a fault 549607ab7a9SMatthew G. Knepley Hybrid: Entirely new points, such as cohesive cells 550607ab7a9SMatthew G. Knepley */ 551cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm) 552cd0c2139SMatthew G Knepley { 553cd0c2139SMatthew G Knepley MPI_Comm comm; 554607ab7a9SMatthew G. Knepley IS valueIS; 555607ab7a9SMatthew G. Knepley PetscInt numSP = 0; /* The number of depths for which we have replicated points */ 556607ab7a9SMatthew G. Knepley const PetscInt *values; /* List of depths for which we have replicated points */ 55718c5995bSMatthew G. Knepley IS *splitIS; 55818c5995bSMatthew G. Knepley IS *unsplitIS; 559607ab7a9SMatthew G. Knepley PetscInt *numSplitPoints; /* The number of replicated points at each depth */ 56018c5995bSMatthew G. Knepley PetscInt *numUnsplitPoints; /* The number of non-replicated points at each depth which still give rise to hybrid points */ 561607ab7a9SMatthew G. Knepley PetscInt *numHybridPoints; /* The number of hybrid points at each depth */ 562607ab7a9SMatthew G. Knepley const PetscInt **splitPoints; /* Replicated points for each depth */ 56318c5995bSMatthew G. Knepley const PetscInt **unsplitPoints; /* Non-replicated points for each depth */ 564cd0c2139SMatthew G Knepley PetscSection coordSection; 565cd0c2139SMatthew G Knepley Vec coordinates; 566cd0c2139SMatthew G Knepley PetscScalar *coords; 567607ab7a9SMatthew G. Knepley PetscInt depths[4]; /* Depths in the order that plex points are numbered */ 568607ab7a9SMatthew G. Knepley PetscInt *depthShift; /* Number of replicated+hybrid points at each depth */ 569607ab7a9SMatthew G. Knepley PetscInt *depthOffset; /* Prefix sums of depthShift */ 570607ab7a9SMatthew G. Knepley PetscInt *pMaxNew; /* The first replicated point at each depth in the new mesh, hybrids come after this */ 571607ab7a9SMatthew G. Knepley PetscInt *coneNew, *coneONew, *supportNew; 57218c5995bSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v; 573cd0c2139SMatthew G Knepley PetscErrorCode ierr; 574cd0c2139SMatthew G Knepley 575cd0c2139SMatthew G Knepley PetscFunctionBegin; 576cd0c2139SMatthew G Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 577cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 578607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 579fd4b9f15SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 580607ab7a9SMatthew G. Knepley depths[0] = depth; 581607ab7a9SMatthew G. Knepley depths[1] = 0; 582607ab7a9SMatthew G. Knepley depths[2] = depth-1; 583607ab7a9SMatthew G. Knepley depths[3] = 1; 584cd0c2139SMatthew G Knepley /* Count split points and add cohesive cells */ 585607ab7a9SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 586dcbb62e8SMatthew G. Knepley ierr = PetscMalloc3(depth+1,PetscInt,&depthShift,depth+1,PetscInt,&depthOffset,depth+1,PetscInt,&pMaxNew);CHKERRQ(ierr); 58718c5995bSMatthew G. Knepley ierr = PetscMalloc7(depth+1,IS,&splitIS,depth+1,IS,&unsplitIS,depth+1,PetscInt,&numSplitPoints,depth+1,PetscInt,&numUnsplitPoints,depth+1,PetscInt,&numHybridPoints,depth+1,const PetscInt*,&splitPoints,depth+1,const PetscInt*,&unsplitPoints);CHKERRQ(ierr); 588607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 589607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthOffset, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 590607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 591607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 592607ab7a9SMatthew G. Knepley numSplitPoints[d] = 0; 59318c5995bSMatthew G. Knepley numUnsplitPoints[d] = 0; 594607ab7a9SMatthew G. Knepley numHybridPoints[d] = 0; 595607ab7a9SMatthew G. Knepley splitPoints[d] = NULL; 59618c5995bSMatthew G. Knepley unsplitPoints[d] = NULL; 59718c5995bSMatthew G. Knepley splitIS[d] = NULL; 59818c5995bSMatthew G. Knepley unsplitIS[d] = NULL; 599607ab7a9SMatthew G. Knepley } 600cd0c2139SMatthew G Knepley if (label) { 601cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 602cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 603cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 604cd0c2139SMatthew G Knepley } 605cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 606cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 607cd0c2139SMatthew G Knepley 608cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 60918c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr); 61018c5995bSMatthew G. Knepley if (splitIS[dep]) { 61118c5995bSMatthew G. Knepley ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 61218c5995bSMatthew G. Knepley ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 61318c5995bSMatthew G. Knepley } 61418c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr); 61518c5995bSMatthew G. Knepley if (unsplitIS[dep]) { 61618c5995bSMatthew G. Knepley ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr); 61718c5995bSMatthew G. Knepley ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr); 618cd0c2139SMatthew G Knepley } 619cd0c2139SMatthew G Knepley } 620607ab7a9SMatthew G. Knepley /* Calculate number of hybrid points */ 62118c5995bSMatthew G. Knepley for (d = 1; d <= depth; ++d) numHybridPoints[d] = numSplitPoints[d-1] + numUnsplitPoints[d-1]; /* There is a hybrid cell/face/edge for every split face/edge/vertex */ 622607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) depthShift[d] = numSplitPoints[d] + numHybridPoints[d]; 623607ab7a9SMatthew G. Knepley for (d = 1; d <= depth; ++d) depthOffset[depths[d]] = depthOffset[depths[d-1]] + depthShift[depths[d-1]]; 624607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) pMaxNew[d] += depthOffset[d]; 625cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 626cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 627cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 628cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 629cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 6304c367dbcSMatthew G. Knepley const PetscInt newp = oldp + depthOffset[dep]; 6314c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 632cd0c2139SMatthew G Knepley const PetscInt *support; 6334c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, qf, qn, qp, e; 634cd0c2139SMatthew G Knepley 635cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 636cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 637cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 638cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 639cd0c2139SMatthew G Knepley if (dep == depth-1) { 6404c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 6414c367dbcSMatthew G. Knepley 642cd0c2139SMatthew G Knepley /* Add cohesive cells, they are prisms */ 6434c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr); 644cd0c2139SMatthew G Knepley } else if (dep == 0) { 6454c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 646cd0c2139SMatthew G Knepley 647cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 6484c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 649cd0c2139SMatthew G Knepley PetscInt val; 650cd0c2139SMatthew G Knepley 651cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 6524c367dbcSMatthew G. Knepley if (val == 1) ++qf; 6534c367dbcSMatthew G. Knepley if ((val == 1) || (val == (shift + 1))) ++qn; 6544c367dbcSMatthew G. Knepley if ((val == 1) || (val == -(shift + 1))) ++qp; 655cd0c2139SMatthew G Knepley } 6564c367dbcSMatthew G. Knepley /* Split old vertex: Edges into original vertex and new cohesive edge */ 6574c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 6584c367dbcSMatthew G. Knepley /* Split new vertex: Edges into split vertex and new cohesive edge */ 6594c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 6604c367dbcSMatthew G. Knepley /* Add hybrid edge */ 6614c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 6624c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 663cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 6644c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 6654c367dbcSMatthew G. Knepley 666cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 6674c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 668cd0c2139SMatthew G Knepley PetscInt val; 669cd0c2139SMatthew G Knepley 670cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 6714c367dbcSMatthew G. Knepley if (val == dim-1) ++qf; 6724c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 6734c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 674cd0c2139SMatthew G Knepley } 6754c367dbcSMatthew G. Knepley /* Split old edge: Faces into original edge and cohesive face (positive side?) */ 6764c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 6774c367dbcSMatthew G. Knepley /* Split new edge: Faces into split edge and cohesive face (negative side?) */ 6784c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 6794c367dbcSMatthew G. Knepley /* Add hybrid face */ 6804c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 6814c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 682cd0c2139SMatthew G Knepley } 683cd0c2139SMatthew G Knepley } 684cd0c2139SMatthew G Knepley } 68518c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 68618c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 68718c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 68818c5995bSMatthew G. Knepley const PetscInt newp = oldp + depthOffset[dep]; 68918c5995bSMatthew G. Knepley const PetscInt *support; 69018c5995bSMatthew G. Knepley PetscInt coneSize, supportSize, qf, qn, qp, e; 69118c5995bSMatthew G. Knepley 69218c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 69318c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 69418c5995bSMatthew G. Knepley if (dep == 0) { 69518c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 69618c5995bSMatthew G. Knepley 69718c5995bSMatthew G. Knepley /* Unsplit vertex: Edges into original vertex, split edge, and new cohesive edge twice */ 69818c5995bSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, supportSize+3);CHKERRQ(ierr); 69918c5995bSMatthew G. Knepley /* Add hybrid edge */ 70018c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 701*e1757548SMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 702*e1757548SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 703*e1757548SMatthew G. Knepley PetscInt val; 704*e1757548SMatthew G. Knepley 705*e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 706*e1757548SMatthew G. Knepley /* Split and unsplit edges produce hybrid faces */ 707*e1757548SMatthew G. Knepley if ((val == 1) || (val == (shift2 + 1))) ++qf; 708*e1757548SMatthew G. Knepley } 709*e1757548SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 71018c5995bSMatthew G. Knepley } else if (dep == dim-2) { 71118c5995bSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 71218c5995bSMatthew G. Knepley 71318c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 71418c5995bSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 715cd0c2139SMatthew G Knepley PetscInt val; 716cd0c2139SMatthew G Knepley 717cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 71818c5995bSMatthew G. Knepley if (val == dim-1) ++qf; 71918c5995bSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 72018c5995bSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 721cd0c2139SMatthew G Knepley } 72218c5995bSMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */ 72318c5995bSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, supportSize+3);CHKERRQ(ierr); 72418c5995bSMatthew G. Knepley /* Add hybrid face */ 72518c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 726*e1757548SMatthew G. Knepley /* TODO: Here we should check for neighboring faults for which this is unsplit */ 72718c5995bSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, 1);CHKERRQ(ierr); 728cd0c2139SMatthew G Knepley } 729cd0c2139SMatthew G Knepley } 730cd0c2139SMatthew G Knepley } 731cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 732cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 733cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 734dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 735dcbb62e8SMatthew G. Knepley ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,PetscInt,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,PetscInt,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),PetscInt,&supportNew);CHKERRQ(ierr); 736cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 737cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 738cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 739cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 7404c367dbcSMatthew G. Knepley const PetscInt newp = oldp + depthOffset[dep]; 7414c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 742cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 7434c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, q, qf, qn, qp, v, e, s; 744cd0c2139SMatthew G Knepley 745cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 746cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 747cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 748cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 749cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 750cd0c2139SMatthew G Knepley if (dep == depth-1) { 7514c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 752cd0c2139SMatthew G Knepley const PetscInt *supportF; 753cd0c2139SMatthew G Knepley 754cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 755cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 756cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 757cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 758cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 759cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 7604c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 76118c5995bSMatthew G. Knepley if (v < 0) { 76218c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 76318c5995bSMatthew G. Knepley if (v < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate point %d in split or unsplit points of depth %d", cone[q], dep-1); 76418c5995bSMatthew G. Knepley coneNew[2+q] = cone[q] + depthOffset[dep-1]; 76518c5995bSMatthew G. Knepley } else { 7664c367dbcSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep-1]; 767cd0c2139SMatthew G Knepley } 768cd0c2139SMatthew G Knepley } 769cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 770cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 771e537020bSMatthew G. Knepley /* Face support */ 772cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 773cd0c2139SMatthew G Knepley PetscInt val; 774cd0c2139SMatthew G Knepley 775cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 776cd0c2139SMatthew G Knepley if (val < 0) { 777cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 7784c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr); 779cd0c2139SMatthew G Knepley } else { 780cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 7814c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr); 782e537020bSMatthew G. Knepley /* Get orientation for cohesive face */ 783e537020bSMatthew G. Knepley { 784e537020bSMatthew G. Knepley const PetscInt *ncone, *nconeO; 785e537020bSMatthew G. Knepley PetscInt nconeSize, nc; 786e537020bSMatthew G. Knepley 787e537020bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 788e537020bSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 789e537020bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 790e537020bSMatthew G. Knepley for (nc = 0; nc < nconeSize; ++nc) { 791e537020bSMatthew G. Knepley if (ncone[nc] == oldp) { 792e537020bSMatthew G. Knepley coneONew[0] = nconeO[nc]; 793e537020bSMatthew G. Knepley break; 794cd0c2139SMatthew G Knepley } 795cd0c2139SMatthew G Knepley } 796e537020bSMatthew 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]); 797e537020bSMatthew G. Knepley } 798e537020bSMatthew G. Knepley } 799e537020bSMatthew G. Knepley } 8004c367dbcSMatthew G. Knepley /* Cohesive cell: Old and new split face, then new cohesive faces */ 801fd4b9f15SMatthew G. Knepley coneNew[0] = newp; /* Extracted negative side orientation above */ 8024c367dbcSMatthew G. Knepley coneNew[1] = splitp; 8034c367dbcSMatthew G. Knepley coneONew[1] = coneONew[0]; 804e537020bSMatthew G. Knepley for (q = 0; q < coneSize; ++q) { 80518c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 80618c5995bSMatthew G. Knepley if (v < 0) { 80718c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 80818c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 80918c5995bSMatthew G. Knepley coneONew[2+q] = 0; 81018c5995bSMatthew G. Knepley } else { 81118c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep]; 81218c5995bSMatthew G. Knepley } 813e537020bSMatthew G. Knepley coneONew[2+q] = 0; 814e537020bSMatthew G. Knepley } 8154c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr); 8164c367dbcSMatthew G. Knepley ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr); 817cd0c2139SMatthew G Knepley } else if (dep == 0) { 8184c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 819cd0c2139SMatthew G Knepley 820cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 8214c367dbcSMatthew G. Knepley for (e = 0, qn = 0; e < supportSize; ++e) { 822cd0c2139SMatthew G Knepley PetscInt val; 823cd0c2139SMatthew G Knepley 824cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 825cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 8264c367dbcSMatthew G. Knepley supportNew[qn++] = support[e] + depthOffset[dep+1]; 827cd0c2139SMatthew G Knepley } 828cd0c2139SMatthew G Knepley } 8294c367dbcSMatthew G. Knepley supportNew[qn] = hybedge; 830cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 831cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 8324c367dbcSMatthew G. Knepley for (e = 0, qp = 0; e < supportSize; ++e) { 833cd0c2139SMatthew G Knepley PetscInt val, edge; 834cd0c2139SMatthew G Knepley 835cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 836cd0c2139SMatthew G Knepley if (val == 1) { 8374c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 838cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 8394c367dbcSMatthew G. Knepley supportNew[qp++] = edge + pMaxNew[dep+1]; 840cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 8414c367dbcSMatthew G. Knepley supportNew[qp++] = support[e] + depthOffset[dep+1]; 842cd0c2139SMatthew G Knepley } 843cd0c2139SMatthew G Knepley } 8444c367dbcSMatthew G. Knepley supportNew[qp] = hybedge; 845cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 8464c367dbcSMatthew G. Knepley /* Hybrid edge: Old and new split vertex */ 847cd0c2139SMatthew G Knepley coneNew[0] = newp; 848cd0c2139SMatthew G Knepley coneNew[1] = splitp; 8494c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 8504c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 8514c367dbcSMatthew G. Knepley PetscInt val, edge; 8524c367dbcSMatthew G. Knepley 8534c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 8544c367dbcSMatthew G. Knepley if (val == 1) { 8554c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 8564c367dbcSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 8574c367dbcSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 8584c367dbcSMatthew G. Knepley } 8594c367dbcSMatthew G. Knepley } 8604c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 861cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 8624c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 8634c367dbcSMatthew G. Knepley 864cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 865cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 866cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 8674c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 868*e1757548SMatthew G. Knepley if (v < 0) { 869*e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 870*e1757548SMatthew G. Knepley if (v < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate point %d in split or unsplit points of depth %d", cone[q], dep-1); 871*e1757548SMatthew G. Knepley coneNew[q] = cone[q] + depthOffset[dep-1]; 872*e1757548SMatthew G. Knepley } else { 8734c367dbcSMatthew G. Knepley coneNew[q] = v + pMaxNew[dep-1]; 874cd0c2139SMatthew G Knepley } 875*e1757548SMatthew G. Knepley } 876cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 877cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 878cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 879cd0c2139SMatthew G Knepley PetscInt val; 880cd0c2139SMatthew G Knepley 881cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 8824c367dbcSMatthew G. Knepley if (val == dim-1) { 8834c367dbcSMatthew G. Knepley supportNew[q++] = support[e] + depthOffset[dep+1]; 8844c367dbcSMatthew G. Knepley } else if (val == (shift + dim-1)) { 8854c367dbcSMatthew G. Knepley supportNew[q++] = support[e] + depthOffset[dep+1]; 886cd0c2139SMatthew G Knepley } 887cd0c2139SMatthew G Knepley } 888b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 889cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 890cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 891cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 892cd0c2139SMatthew G Knepley PetscInt val, face; 893cd0c2139SMatthew G Knepley 894cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 895cd0c2139SMatthew G Knepley if (val == dim-1) { 8964c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 897cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 8984c367dbcSMatthew G. Knepley supportNew[q++] = face + pMaxNew[dep+1]; 899cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 9004c367dbcSMatthew G. Knepley supportNew[q++] = support[e] + depthOffset[dep+1]; 901cd0c2139SMatthew G Knepley } 902cd0c2139SMatthew G Knepley } 903b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 904cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 9054c367dbcSMatthew G. Knepley /* Hybrid face */ 9064c367dbcSMatthew G. Knepley coneNew[0] = newp; 9074c367dbcSMatthew G. Knepley coneNew[1] = splitp; 9084c367dbcSMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 9094c367dbcSMatthew G. Knepley PetscInt vertex; 9104c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr); 911*e1757548SMatthew G. Knepley if (vertex < 0) { 912*e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr); 913*e1757548SMatthew G. Knepley if (vertex < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate point %d in split or unsplit points of depth %d", cone[v], dep-1); 914*e1757548SMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 915*e1757548SMatthew G. Knepley } else { 9164c367dbcSMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep]; 9174c367dbcSMatthew G. Knepley } 918*e1757548SMatthew G. Knepley } 9194c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 9204c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 9214c367dbcSMatthew G. Knepley PetscInt val, face; 9224c367dbcSMatthew G. Knepley 9234c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 9244c367dbcSMatthew G. Knepley if (val == dim-1) { 9254c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 9264c367dbcSMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 9274c367dbcSMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 9284c367dbcSMatthew G. Knepley } 9294c367dbcSMatthew G. Knepley } 9304c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 931cd0c2139SMatthew G Knepley } 932cd0c2139SMatthew G Knepley } 933cd0c2139SMatthew G Knepley } 93418c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 93518c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 93618c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 93718c5995bSMatthew G. Knepley const PetscInt newp = oldp + depthOffset[dep]; 93818c5995bSMatthew G. Knepley const PetscInt *cone, *support, *ornt; 939*e1757548SMatthew G. Knepley PetscInt coneSize, supportSize, supportSizeNew, q, qf, e, f, s; 94018c5995bSMatthew G. Knepley 94118c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 94218c5995bSMatthew G. Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 94318c5995bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 94418c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 94518c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 94618c5995bSMatthew G. Knepley if (dep == 0) { 94718c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 94818c5995bSMatthew G. Knepley 94918c5995bSMatthew G. Knepley /* Unsplit vertex */ 95018c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 95118c5995bSMatthew G. Knepley for (s = 0, q = 0; s < supportSize; ++s) { 95218c5995bSMatthew G. Knepley supportNew[q++] = support[s] + depthOffset[dep+1]; 95318c5995bSMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 95418c5995bSMatthew G. Knepley if (e >= 0) { 95518c5995bSMatthew G. Knepley supportNew[q++] = e + pMaxNew[dep+1]; 95618c5995bSMatthew G. Knepley } 95718c5995bSMatthew G. Knepley } 95818c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 95918c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 96018c5995bSMatthew G. Knepley if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp); 96118c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 96218c5995bSMatthew G. Knepley /* Hybrid edge */ 96318c5995bSMatthew G. Knepley coneNew[0] = newp; 96418c5995bSMatthew G. Knepley coneNew[1] = newp; 96518c5995bSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 96618c5995bSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 96718c5995bSMatthew G. Knepley PetscInt val, edge; 96818c5995bSMatthew G. Knepley 96918c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 97018c5995bSMatthew G. Knepley if (val == 1) { 97118c5995bSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 97218c5995bSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 97318c5995bSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 974*e1757548SMatthew G. Knepley } else if (val == (shift2 + 1)) { 975*e1757548SMatthew G. Knepley ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr); 976*e1757548SMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]); 977*e1757548SMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1]; 97818c5995bSMatthew G. Knepley } 97918c5995bSMatthew G. Knepley } 98018c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 981*e1757548SMatthew G. Knepley } else if (dep == dim-2) { 982*e1757548SMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 983*e1757548SMatthew G. Knepley PetscInt hybcell; 984*e1757548SMatthew G. Knepley 985*e1757548SMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */ 986*e1757548SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 987*e1757548SMatthew G. Knepley PetscInt val, face; 988*e1757548SMatthew G. Knepley 989*e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 990*e1757548SMatthew G. Knepley if (val == dim-1) { 991*e1757548SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 992*e1757548SMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]); 993*e1757548SMatthew G. Knepley supportNew[qf++] = support[f] + depthOffset[dep+1]; 994*e1757548SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+1]; 995*e1757548SMatthew G. Knepley hybcell = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 996*e1757548SMatthew G. Knepley } else { 997*e1757548SMatthew G. Knepley supportNew[qf++] = support[f] + depthOffset[dep+1]; 998*e1757548SMatthew G. Knepley } 999*e1757548SMatthew G. Knepley } 1000*e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1001*e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1002*e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1003*e1757548SMatthew G. Knepley /* Add hybrid face */ 1004*e1757548SMatthew G. Knepley coneNew[0] = newp; 1005*e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[0], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1006*e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[0]); 1007*e1757548SMatthew G. Knepley coneNew[1] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1008*e1757548SMatthew G. Knepley coneNew[2] = newp; 1009*e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1010*e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]); 1011*e1757548SMatthew G. Knepley coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1012*e1757548SMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 1013*e1757548SMatthew G. Knepley supportNew[0] = hybcell; 1014*e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1015cd0c2139SMatthew G Knepley } 1016cd0c2139SMatthew G Knepley } 1017cd0c2139SMatthew G Knepley } 1018cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 1019cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1020cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 1021cd0c2139SMatthew G Knepley IS pIS; 1022cd0c2139SMatthew G Knepley PetscInt numPoints; 1023cd0c2139SMatthew G Knepley const PetscInt *points; 1024cd0c2139SMatthew G Knepley 1025cd0c2139SMatthew G Knepley if (dep >= 0) continue; 1026cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 1027cd0c2139SMatthew G Knepley if (!pIS) continue; 1028cd0c2139SMatthew G Knepley dep = -dep - shift; 1029cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 1030cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 1031cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1032cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 1033cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + oldp; 1034cd0c2139SMatthew G Knepley const PetscInt *cone; 1035cd0c2139SMatthew G Knepley PetscInt coneSize, c; 103650cf782dSMatthew G. Knepley /* PetscBool replaced = PETSC_FALSE; */ 1037cd0c2139SMatthew G Knepley 1038cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 1039cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 1040cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 1041cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 1042cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1043cd0c2139SMatthew G Knepley const PetscInt coldp = cone[c] - depthOffset[dep-1]; 1044cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 1045cd0c2139SMatthew G Knepley 1046cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 1047cd0c2139SMatthew G Knepley if (val == dep-1) { 1048cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 1049cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 1050cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 1051cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 105250cf782dSMatthew G. Knepley /* replaced = PETSC_TRUE; */ 1053cd0c2139SMatthew G Knepley } 1054cd0c2139SMatthew G Knepley } 10554a189a86SMatthew G. Knepley /* Cells with only a vertex or edge on the submesh have no replacement */ 10564a189a86SMatthew G. Knepley /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 1057cd0c2139SMatthew G Knepley } 1058cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 1059cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 1060cd0c2139SMatthew G Knepley } 1061cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 1062cd0c2139SMatthew G Knepley ierr = DMPlexStratify(sdm);CHKERRQ(ierr); 1063cd0c2139SMatthew G Knepley /* Step 8: Coordinates */ 1064cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1065cd0c2139SMatthew G Knepley ierr = DMPlexGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 1066cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 1067cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 1068cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 1069cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[0] + splitPoints[0][v]; 1070cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 1071cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 1072cd0c2139SMatthew G Knepley 1073cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 1074cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 1075cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 1076cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 1077cd0c2139SMatthew G Knepley } 1078cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 1079cd0c2139SMatthew G Knepley /* Step 9: SF, if I can figure this out we can split the mesh in parallel */ 1080cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1081cd0c2139SMatthew G Knepley /* Step 10: Labels */ 1082cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1083cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 1084cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1085cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 1086cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + splitPoints[dep][p]; 1087cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 1088cd0c2139SMatthew G Knepley PetscInt l; 1089cd0c2139SMatthew G Knepley 1090cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 1091cd0c2139SMatthew G Knepley DMLabel mlabel; 1092cd0c2139SMatthew G Knepley const char *lname; 1093cd0c2139SMatthew G Knepley PetscInt val; 10949a356370SMatthew G. Knepley PetscBool isDepth; 1095cd0c2139SMatthew G Knepley 1096cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 10979a356370SMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 10989a356370SMatthew G. Knepley if (isDepth) continue; 1099cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 1100cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 1101cd0c2139SMatthew G Knepley if (val >= 0) { 1102cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 11039a356370SMatthew G. Knepley #if 0 11049a356370SMatthew G. Knepley /* Do not put cohesive edges into the label */ 1105cd0c2139SMatthew G Knepley if (dep == 0) { 11064c367dbcSMatthew G. Knepley const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1107cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr); 11084c367dbcSMatthew G. Knepley } else if (dep == dim-2) { 11094c367dbcSMatthew G. Knepley const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 11104c367dbcSMatthew G. Knepley ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr); 1111cd0c2139SMatthew G Knepley } 11124c367dbcSMatthew G. Knepley /* Do not put cohesive faces into the label */ 11139a356370SMatthew G. Knepley #endif 1114cd0c2139SMatthew G Knepley } 1115cd0c2139SMatthew G Knepley } 1116cd0c2139SMatthew G Knepley } 1117cd0c2139SMatthew G Knepley } 1118cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1119cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 1120cd0c2139SMatthew G Knepley 1121cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 112218c5995bSMatthew G. Knepley if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 112318c5995bSMatthew G. Knepley ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr); 112418c5995bSMatthew G. Knepley if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);} 112518c5995bSMatthew G. Knepley ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr); 1126cd0c2139SMatthew G Knepley } 1127cd0c2139SMatthew G Knepley if (label) { 1128cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1129cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1130cd0c2139SMatthew G Knepley } 11310d4d4d06SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 11320d4d4d06SMatthew G. Knepley ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr); 11330d4d4d06SMatthew G. Knepley pMaxNew[d] = pEnd - numHybridPoints[d]; 11340d4d4d06SMatthew G. Knepley } 11350e49e2e2SMatthew 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); 1136dcbb62e8SMatthew G. Knepley ierr = PetscFree3(depthShift, depthOffset, pMaxNew);CHKERRQ(ierr); 1137dcbb62e8SMatthew G. Knepley ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr); 113818c5995bSMatthew G. Knepley ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr); 1139cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1140cd0c2139SMatthew G Knepley } 1141cd0c2139SMatthew G Knepley 1142cd0c2139SMatthew G Knepley #undef __FUNCT__ 1143cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells" 1144cd0c2139SMatthew G Knepley /*@C 1145cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 1146cd0c2139SMatthew G Knepley 1147cd0c2139SMatthew G Knepley Collective on dm 1148cd0c2139SMatthew G Knepley 1149cd0c2139SMatthew G Knepley Input Parameters: 1150cd0c2139SMatthew G Knepley + dm - The original DM 115153156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated) 1152cd0c2139SMatthew G Knepley 1153cd0c2139SMatthew G Knepley Output Parameters: 1154cd0c2139SMatthew G Knepley - dmSplit - The new DM 1155cd0c2139SMatthew G Knepley 1156cd0c2139SMatthew G Knepley Level: developer 1157cd0c2139SMatthew G Knepley 11582be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 1159cd0c2139SMatthew G Knepley @*/ 1160cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 1161cd0c2139SMatthew G Knepley { 1162cd0c2139SMatthew G Knepley DM sdm; 1163cd0c2139SMatthew G Knepley PetscInt dim; 1164cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1165cd0c2139SMatthew G Knepley 1166cd0c2139SMatthew G Knepley PetscFunctionBegin; 1167cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 116853156dfcSMatthew G. Knepley PetscValidPointer(dmSplit, 3); 1169cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 1170cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 1171cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1172cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(sdm, dim);CHKERRQ(ierr); 1173cd0c2139SMatthew G Knepley switch (dim) { 1174cd0c2139SMatthew G Knepley case 2: 1175cd0c2139SMatthew G Knepley case 3: 1176cd0c2139SMatthew G Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 1177cd0c2139SMatthew G Knepley break; 1178cd0c2139SMatthew G Knepley default: 1179cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 1180cd0c2139SMatthew G Knepley } 1181cd0c2139SMatthew G Knepley *dmSplit = sdm; 1182cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1183cd0c2139SMatthew G Knepley } 1184cd0c2139SMatthew G Knepley 1185cd0c2139SMatthew G Knepley #undef __FUNCT__ 11862be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete" 1187cd0c2139SMatthew G Knepley /*@ 11882be2b188SMatthew G Knepley DMPlexLabelCohesiveComplete - Starting with a label marking vertices on an internal surface, we add all other mesh pieces 1189cd0c2139SMatthew G Knepley to complete the surface 1190cd0c2139SMatthew G Knepley 1191cd0c2139SMatthew G Knepley Input Parameters: 1192cd0c2139SMatthew G Knepley + dm - The DM 119347946fd8SMatthew G. Knepley . label - A DMLabel marking the surface vertices 1194bb55d314SMatthew G. Knepley . flip - Flag to flip the submesh normal and replace points on the other side 119547946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL 1196cd0c2139SMatthew G Knepley 1197cd0c2139SMatthew G Knepley Output Parameter: 1198cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 1199cd0c2139SMatthew G Knepley 1200cd0c2139SMatthew G Knepley Level: developer 1201cd0c2139SMatthew G Knepley 12022be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 1203cd0c2139SMatthew G Knepley @*/ 1204bb55d314SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, PetscBool flip, DM subdm) 1205cd0c2139SMatthew G Knepley { 1206d90583fdSMatthew G. Knepley DMLabel depthLabel; 120718c5995bSMatthew G. Knepley IS dimIS, subpointIS, facePosIS, faceNegIS; 120847946fd8SMatthew G. Knepley const PetscInt *points, *subpoints; 1209bb55d314SMatthew G. Knepley const PetscInt rev = flip ? -1 : 1; 121018c5995bSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, dim, dep, cStart, cEnd, numPoints, numSubpoints, p, val; 1211cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1212cd0c2139SMatthew G Knepley 1213cd0c2139SMatthew G Knepley PetscFunctionBegin; 1214d90583fdSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 1215cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 121647946fd8SMatthew G. Knepley if (subdm) { 121747946fd8SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 121847946fd8SMatthew G. Knepley if (subpointIS) { 121947946fd8SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 122047946fd8SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 122147946fd8SMatthew G. Knepley } 122247946fd8SMatthew G. Knepley } 1223d7c8f101SMatthew G. Knepley /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */ 1224cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 1225cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1226cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1227cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1228d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */ 1229cd0c2139SMatthew G Knepley const PetscInt *support; 1230cd0c2139SMatthew G Knepley PetscInt supportSize, s; 1231cd0c2139SMatthew G Knepley 1232cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1233cd0c2139SMatthew G Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 1234cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1235cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1236cd0c2139SMatthew G Knepley const PetscInt *cone, *ornt; 1237cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1238cd0c2139SMatthew G Knepley PetscBool pos = PETSC_TRUE; 1239cd0c2139SMatthew G Knepley 1240cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1241cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1242cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 1243cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1244cd0c2139SMatthew G Knepley if (cone[c] == points[p]) { 124547946fd8SMatthew G. Knepley PetscInt o = ornt[c]; 124647946fd8SMatthew G. Knepley 124747946fd8SMatthew G. Knepley if (subdm) { 124847946fd8SMatthew G. Knepley const PetscInt *subcone, *subornt; 124947946fd8SMatthew G. Knepley PetscInt subpoint, subface, subconeSize, sc; 125047946fd8SMatthew G. Knepley 125147946fd8SMatthew G. Knepley ierr = PetscFindInt(support[s], numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 125247946fd8SMatthew G. Knepley ierr = PetscFindInt(points[p], numSubpoints, subpoints, &subface);CHKERRQ(ierr); 125347946fd8SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 125447946fd8SMatthew G. Knepley ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 125547946fd8SMatthew G. Knepley ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 125647946fd8SMatthew G. Knepley for (sc = 0; sc < subconeSize; ++sc) { 125747946fd8SMatthew G. Knepley if (subcone[sc] == subface) { 125847946fd8SMatthew G. Knepley o = subornt[0]; 125947946fd8SMatthew G. Knepley break; 126047946fd8SMatthew G. Knepley } 126147946fd8SMatthew G. Knepley } 126247946fd8SMatthew 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); 126347946fd8SMatthew G. Knepley } 126447946fd8SMatthew G. Knepley if (o >= 0) { 1265bb55d314SMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr); 1266ffaa4bbcSMatthew G. Knepley pos = rev > 0 ? PETSC_TRUE : PETSC_FALSE; 1267cd0c2139SMatthew G Knepley } else { 1268bb55d314SMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr); 1269ffaa4bbcSMatthew G. Knepley pos = rev > 0 ? PETSC_FALSE : PETSC_TRUE; 1270cd0c2139SMatthew G Knepley } 1271cd0c2139SMatthew G Knepley break; 1272cd0c2139SMatthew G Knepley } 1273cd0c2139SMatthew G Knepley } 1274cd0c2139SMatthew 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]); 1275cd0c2139SMatthew G Knepley /* Put faces touching the fault in the label */ 1276cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1277cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 1278cd0c2139SMatthew G Knepley 1279cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1280cd0c2139SMatthew G Knepley if (val == -1) { 1281cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 1282cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 1283cd0c2139SMatthew G Knepley 1284cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1285cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1286cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 1287cd0c2139SMatthew G Knepley 1288cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1289cd0c2139SMatthew G Knepley if ((val >= 0) && (val < dim-1)) { 1290cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1291cd0c2139SMatthew G Knepley break; 1292cd0c2139SMatthew G Knepley } 1293cd0c2139SMatthew G Knepley } 1294cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1295cd0c2139SMatthew G Knepley } 1296cd0c2139SMatthew G Knepley } 1297cd0c2139SMatthew G Knepley } 1298cd0c2139SMatthew G Knepley } 129947946fd8SMatthew G. Knepley if (subdm) { 130047946fd8SMatthew G. Knepley if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 130147946fd8SMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 130247946fd8SMatthew G. Knepley } 1303cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1304cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1305cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1306cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1307cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 1308cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1309cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1310cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1311d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */ 1312cd0c2139SMatthew G Knepley PetscInt *star = NULL; 1313cd0c2139SMatthew G Knepley PetscInt starSize, s; 1314cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1315cd0c2139SMatthew G Knepley 1316d4622b2cSMatthew G. Knepley /* All points connected to the fault are inside a cell, so at the top level we will only check cells */ 1317cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1318cd0c2139SMatthew G Knepley while (again) { 1319cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1320cd0c2139SMatthew G Knepley again = 0; 1321cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1322cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1323cd0c2139SMatthew G Knepley const PetscInt *cone; 1324cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1325cd0c2139SMatthew G Knepley 1326cd0c2139SMatthew G Knepley if ((point < cStart) || (point >= cEnd)) continue; 1327cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1328cd0c2139SMatthew G Knepley if (val != -1) continue; 1329d4622b2cSMatthew G. Knepley again = again == 1 ? 1 : 2; 1330cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1331cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1332cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1333cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1334cd0c2139SMatthew G Knepley if (val != -1) { 1335d7c8f101SMatthew G. Knepley const PetscInt *ccone; 1336166d9d0cSMatthew G. Knepley PetscInt cconeSize, cc, side; 1337d7c8f101SMatthew G. Knepley 1338cd0c2139SMatthew 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); 133937a6de01SMatthew G. Knepley if (val > 0) side = 1; 134037a6de01SMatthew G. Knepley else side = -1; 134137a6de01SMatthew G. Knepley ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr); 1342d7c8f101SMatthew G. Knepley /* Mark cell faces which touch the fault */ 1343d7c8f101SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr); 1344d7c8f101SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr); 1345d7c8f101SMatthew G. Knepley for (cc = 0; cc < cconeSize; ++cc) { 1346d7c8f101SMatthew G. Knepley PetscInt *closure = NULL; 1347d7c8f101SMatthew G. Knepley PetscInt closureSize, cl; 1348d7c8f101SMatthew G. Knepley 1349166d9d0cSMatthew G. Knepley ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr); 1350166d9d0cSMatthew G. Knepley if (val != -1) continue; 1351d7c8f101SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1352d4622b2cSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1353d7c8f101SMatthew G. Knepley const PetscInt clp = closure[cl]; 1354d7c8f101SMatthew G. Knepley 1355d7c8f101SMatthew G. Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1356d7c8f101SMatthew G. Knepley if (val == -1) continue; 1357d7c8f101SMatthew G. Knepley ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr); 135837a6de01SMatthew G. Knepley break; 135937a6de01SMatthew G. Knepley } 1360d7c8f101SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1361cd0c2139SMatthew G Knepley } 1362cd0c2139SMatthew G Knepley again = 1; 1363cd0c2139SMatthew G Knepley break; 1364cd0c2139SMatthew G Knepley } 1365cd0c2139SMatthew G Knepley } 1366cd0c2139SMatthew G Knepley } 1367cd0c2139SMatthew G Knepley } 1368cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1369cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1370cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1371cd0c2139SMatthew G Knepley 1372cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1373cd0c2139SMatthew G Knepley if (val == -1) { 1374cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1375cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1376cd0c2139SMatthew G Knepley PetscBool marked = PETSC_FALSE; 1377cd0c2139SMatthew G Knepley 1378cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1379cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1380cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1381cd0c2139SMatthew G Knepley 1382cd0c2139SMatthew G Knepley if ((spoint < cStart) || (spoint >= cEnd)) continue; 1383cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1384cd0c2139SMatthew 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); 1385d90583fdSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1386cd0c2139SMatthew G Knepley if (val > 0) { 1387cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1388cd0c2139SMatthew G Knepley } else { 1389cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1390cd0c2139SMatthew G Knepley } 1391cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1392cd0c2139SMatthew G Knepley break; 1393cd0c2139SMatthew G Knepley } 1394cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1395cd0c2139SMatthew G Knepley if (!marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1396cd0c2139SMatthew G Knepley } 1397cd0c2139SMatthew G Knepley } 1398cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1399cd0c2139SMatthew G Knepley } 1400cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1401cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 140218c5995bSMatthew G. Knepley /* If any faces touching the fault divide cells on either side, split them */ 140318c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift+dim-1, &facePosIS);CHKERRQ(ierr); 140418c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr); 140518c5995bSMatthew G. Knepley ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr); 140618c5995bSMatthew G. Knepley ierr = ISDestroy(&facePosIS);CHKERRQ(ierr); 140718c5995bSMatthew G. Knepley ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr); 140818c5995bSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 140918c5995bSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 141018c5995bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 141118c5995bSMatthew G. Knepley const PetscInt point = points[p]; 141218c5995bSMatthew G. Knepley const PetscInt *support; 141318c5995bSMatthew G. Knepley PetscInt supportSize, valA, valB; 141418c5995bSMatthew G. Knepley 141518c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 141618c5995bSMatthew G. Knepley if (supportSize != 2) continue; 141718c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 141818c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr); 141918c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr); 142018c5995bSMatthew G. Knepley if ((valA == -1) || (valB == -1)) continue; 142118c5995bSMatthew G. Knepley if (valA*valB > 0) continue; 142218c5995bSMatthew G. Knepley /* Split the face */ 142318c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr); 142418c5995bSMatthew G. Knepley ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr); 142518c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr); 1426*e1757548SMatthew G. Knepley /* Label its closure: 1427*e1757548SMatthew G. Knepley unmarked: label as unsplit 1428*e1757548SMatthew G. Knepley incident: relabel as split 1429*e1757548SMatthew G. Knepley split: do nothing 1430*e1757548SMatthew G. Knepley */ 143118c5995bSMatthew G. Knepley { 143218c5995bSMatthew G. Knepley PetscInt *closure = NULL; 143318c5995bSMatthew G. Knepley PetscInt closureSize, cl; 143418c5995bSMatthew G. Knepley 143518c5995bSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 143618c5995bSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 143718c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr); 1438*e1757548SMatthew G. Knepley if (valA < 0) { /* Mark as unsplit */ 143918c5995bSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 144018c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr); 1441*e1757548SMatthew G. Knepley } else if (valA >= shift) { 1442*e1757548SMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 1443*e1757548SMatthew G. Knepley ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr); 1444*e1757548SMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr); 1445*e1757548SMatthew G. Knepley } 144618c5995bSMatthew G. Knepley } 144718c5995bSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 144818c5995bSMatthew G. Knepley } 144918c5995bSMatthew G. Knepley } 145018c5995bSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 145118c5995bSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1452cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1453cd0c2139SMatthew G Knepley } 1454cd0c2139SMatthew G Knepley 1455cd0c2139SMatthew G Knepley #undef __FUNCT__ 14563cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh" 14573cf72582SMatthew G. Knepley /*@C 14583cf72582SMatthew G. Knepley DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface 14593cf72582SMatthew G. Knepley 14603cf72582SMatthew G. Knepley Collective on dm 14613cf72582SMatthew G. Knepley 14623cf72582SMatthew G. Knepley Input Parameters: 14633cf72582SMatthew G. Knepley + dm - The original DM 14643cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices 14653cf72582SMatthew G. Knepley 14663cf72582SMatthew G. Knepley Output Parameters: 14673cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface 14683cf72582SMatthew G. Knepley - dmHybrid - The new DM 14693cf72582SMatthew G. Knepley 14703cf72582SMatthew G. Knepley Level: developer 14713cf72582SMatthew G. Knepley 14723cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate() 14733cf72582SMatthew G. Knepley @*/ 14743cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid) 14753cf72582SMatthew G. Knepley { 14763cf72582SMatthew G. Knepley DM idm; 14773cf72582SMatthew G. Knepley DMLabel subpointMap, hlabel; 14783cf72582SMatthew G. Knepley PetscInt dim; 14793cf72582SMatthew G. Knepley PetscErrorCode ierr; 14803cf72582SMatthew G. Knepley 14813cf72582SMatthew G. Knepley PetscFunctionBegin; 14823cf72582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 14833cf72582SMatthew G. Knepley if (hybridLabel) PetscValidPointer(hybridLabel, 3); 14843cf72582SMatthew G. Knepley PetscValidPointer(dmHybrid, 4); 14853cf72582SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 14863cf72582SMatthew G. Knepley ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr); 14873cf72582SMatthew G. Knepley ierr = DMPlexOrient(idm);CHKERRQ(ierr); 14883cf72582SMatthew G. Knepley ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr); 14893cf72582SMatthew G. Knepley ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr); 14903cf72582SMatthew G. Knepley ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr); 14913cf72582SMatthew G. Knepley ierr = DMPlexLabelCohesiveComplete(dm, hlabel, PETSC_FALSE, idm);CHKERRQ(ierr); 14923cf72582SMatthew G. Knepley ierr = DMDestroy(&idm);CHKERRQ(ierr); 14933cf72582SMatthew G. Knepley ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr); 14943cf72582SMatthew G. Knepley if (hybridLabel) *hybridLabel = hlabel; 149553aa2e23SMatthew G. Knepley else {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);} 1496e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1497e6ccafaeSMatthew G Knepley } 1498e6ccafaeSMatthew G Knepley 1499e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1500efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated" 1501efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 1502efa14ee0SMatthew G Knepley 1503efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 1504efa14ee0SMatthew G Knepley */ 1505830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1506efa14ee0SMatthew G Knepley { 1507fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 1508efa14ee0SMatthew G Knepley const PetscInt *subvertices; 150977d178adSMatthew G. Knepley PetscInt *pStart, *pEnd, *pMax, pSize; 1510efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1511efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1512efa14ee0SMatthew G Knepley 1513efa14ee0SMatthew G Knepley PetscFunctionBegin; 1514efa14ee0SMatthew G Knepley *numFaces = 0; 1515efa14ee0SMatthew G Knepley *nFV = 0; 1516efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1517efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 151877d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 151977d178adSMatthew G. Knepley ierr = PetscMalloc3(pSize,PetscInt,&pStart,pSize,PetscInt,&pEnd,pSize,PetscInt,&pMax);CHKERRQ(ierr); 1520d92e47f8SMatthew 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); 1521efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 1522efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1523efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1524efa14ee0SMatthew G Knepley } 1525efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1526fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1527efa14ee0SMatthew G Knepley if (subvertexIS) { 1528efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1529efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1530efa14ee0SMatthew G Knepley } 1531efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1532efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 15330298fd71SBarry Smith PetscInt *star = NULL; 1534efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 1535efa14ee0SMatthew G Knepley 1536efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1537efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1538efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1539efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1540efa14ee0SMatthew G Knepley } 1541efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 1542efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 15430298fd71SBarry Smith PetscInt *closure = NULL; 1544efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 1545efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 1546efa14ee0SMatthew G Knepley 1547efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 154865560c7fSMatthew G Knepley if (cellLoc == 2) continue; 154982f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1550efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1551efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1552efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1553efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1554efa14ee0SMatthew G Knepley 1555efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1556efa14ee0SMatthew G Knepley ++numCorners; 1557efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1558830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 1559efa14ee0SMatthew G Knepley } 1560efa14ee0SMatthew G Knepley } 156118ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 156282f516ccSBarry 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); 1563efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 1564007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 1565007baee2SMatthew G. Knepley PetscInt numCells, nc; 1566007baee2SMatthew G. Knepley 1567efa14ee0SMatthew G Knepley ++(*numFaces); 1568efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 1569efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 1570efa14ee0SMatthew G Knepley } 1571007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1572007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 1573007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 1574007baee2SMatthew G. Knepley } 1575007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1576efa14ee0SMatthew G Knepley } 1577efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1578efa14ee0SMatthew G Knepley } 1579efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1580efa14ee0SMatthew G Knepley } 1581efa14ee0SMatthew G Knepley if (subvertexIS) { 1582efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1583efa14ee0SMatthew G Knepley } 1584efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1585efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1586efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1587efa14ee0SMatthew G Knepley } 1588efa14ee0SMatthew G Knepley 1589efa14ee0SMatthew G Knepley #undef __FUNCT__ 1590efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated" 1591830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 1592efa14ee0SMatthew G Knepley { 1593efa14ee0SMatthew G Knepley IS subvertexIS; 1594efa14ee0SMatthew G Knepley const PetscInt *subvertices; 1595efa14ee0SMatthew G Knepley PetscInt *pStart, *pEnd, *pMax; 1596efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 1597efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1598efa14ee0SMatthew G Knepley 1599efa14ee0SMatthew G Knepley PetscFunctionBegin; 1600efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1601efa14ee0SMatthew G Knepley ierr = PetscMalloc3(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd,dim+1,PetscInt,&pMax);CHKERRQ(ierr); 16020298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1603efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 1604efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1605efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1606efa14ee0SMatthew G Knepley } 1607efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1608830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 1609efa14ee0SMatthew G Knepley if (subvertexIS) { 1610efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1611efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1612efa14ee0SMatthew G Knepley } 1613efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1614efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 16150298fd71SBarry Smith PetscInt *star = NULL; 1616efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 1617efa14ee0SMatthew G Knepley 1618efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1619efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1620efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1621efa14ee0SMatthew G Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 1622efa14ee0SMatthew G Knepley } 1623efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 1624efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 16250298fd71SBarry Smith PetscInt *closure = NULL; 1626efa14ee0SMatthew G Knepley PetscInt closureSize, c; 1627efa14ee0SMatthew G Knepley PetscInt faceLoc; 1628efa14ee0SMatthew G Knepley 1629efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 1630efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 163182f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 1632efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1633efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1634efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1635efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1636efa14ee0SMatthew G Knepley 1637efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1638efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1639830e53efSMatthew G. Knepley if (vertexLoc != value) break; 1640efa14ee0SMatthew G Knepley } 1641efa14ee0SMatthew G Knepley } 1642efa14ee0SMatthew G Knepley if (c == closureSize*2) { 1643efa14ee0SMatthew G Knepley const PetscInt *support; 1644efa14ee0SMatthew G Knepley PetscInt supportSize, s; 1645efa14ee0SMatthew G Knepley 1646efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1647efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1648efa14ee0SMatthew G Knepley 1649efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 1650efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1651efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1652efa14ee0SMatthew G Knepley break; 1653efa14ee0SMatthew G Knepley } 1654efa14ee0SMatthew G Knepley } 1655efa14ee0SMatthew G Knepley } 1656efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 1657efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 1658efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1659efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1660efa14ee0SMatthew G Knepley } 1661efa14ee0SMatthew G Knepley } 1662efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1663efa14ee0SMatthew G Knepley } 1664efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1665efa14ee0SMatthew G Knepley } 1666efa14ee0SMatthew G Knepley if (subvertexIS) { 1667efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1668efa14ee0SMatthew G Knepley } 1669efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1670efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1671efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1672efa14ee0SMatthew G Knepley } 1673efa14ee0SMatthew G Knepley 1674efa14ee0SMatthew G Knepley #undef __FUNCT__ 1675766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated" 167627c04023SMatthew 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) 1677766ab985SMatthew G. Knepley { 167827c04023SMatthew G. Knepley DMLabel label = NULL; 1679766ab985SMatthew G. Knepley const PetscInt *cone; 168027234c99SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize; 1681766ab985SMatthew G. Knepley PetscErrorCode ierr; 1682766ab985SMatthew G. Knepley 1683812bfc34SJed Brown PetscFunctionBegin; 1684c0ed958bSJed Brown *numFaces = 0; 1685c0ed958bSJed Brown *nFV = 0; 1686b6d5cb33SJed Brown if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1687fed694aaSMatthew G. Knepley *subCells = NULL; 1688766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1689766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1690766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1691766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 169227c04023SMatthew G. Knepley if (label) { 169327c04023SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 169427c04023SMatthew G. Knepley PetscInt val; 169527c04023SMatthew G. Knepley 169627c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 169727c04023SMatthew G. Knepley if (val == value) { 169827c04023SMatthew G. Knepley ++(*numFaces); 169927c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 170027c04023SMatthew G. Knepley } 170127c04023SMatthew G. Knepley } 170227c04023SMatthew G. Knepley } else { 1703766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 170427c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 170527c04023SMatthew G. Knepley } 1706766ab985SMatthew G. Knepley *nFV = hasLagrange ? coneSize/3 : coneSize/2; 1707766ab985SMatthew G. Knepley ierr = PetscMalloc(*numFaces *2 * sizeof(PetscInt), subCells);CHKERRQ(ierr); 1708766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1709766ab985SMatthew G. Knepley const PetscInt *cells; 1710766ab985SMatthew G. Knepley PetscInt numCells; 1711766ab985SMatthew G. Knepley 171227c04023SMatthew G. Knepley if (label) { 171327c04023SMatthew G. Knepley PetscInt val; 171427c04023SMatthew G. Knepley 171527c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 171627c04023SMatthew G. Knepley if (val != value) continue; 171727c04023SMatthew G. Knepley } 1718766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1719766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 1720766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 1721766ab985SMatthew G. Knepley } 1722766ab985SMatthew G. Knepley /* Negative face */ 1723766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 172427234c99SMatthew G. Knepley /* Not true in parallel 172527234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 1726766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 1727766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 172827234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 1729766ab985SMatthew G. Knepley } 1730766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 1731766ab985SMatthew G. Knepley /* Positive face is not included */ 1732766ab985SMatthew G. Knepley } 1733766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1734766ab985SMatthew G. Knepley } 1735766ab985SMatthew G. Knepley 1736766ab985SMatthew G. Knepley #undef __FUNCT__ 1737766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated" 1738b3154360SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DMLabel subpointMap, DM subdm) 1739766ab985SMatthew G. Knepley { 174027c04023SMatthew G. Knepley DMLabel label = NULL; 1741766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 1742766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 1743766ab985SMatthew G. Knepley PetscErrorCode ierr; 1744766ab985SMatthew G. Knepley 1745812bfc34SJed Brown PetscFunctionBegin; 174627c04023SMatthew G. Knepley if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1747766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1748766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1749766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1750766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 1751766ab985SMatthew G. Knepley ierr = PetscMalloc2(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd);CHKERRQ(ierr); 1752b3154360SMatthew G. Knepley for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);} 1753766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1754766ab985SMatthew G. Knepley const PetscInt *cone; 1755766ab985SMatthew G. Knepley PetscInt *closure = NULL; 1756b3154360SMatthew G. Knepley PetscInt fconeSize, coneSize, closureSize, cl, val; 1757766ab985SMatthew G. Knepley 175827c04023SMatthew G. Knepley if (label) { 175927c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 176027c04023SMatthew G. Knepley if (val != value) continue; 176127c04023SMatthew G. Knepley } 1762766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 1763766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1764b3154360SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr); 1765b3154360SMatthew G. Knepley if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 1766b3154360SMatthew G. Knepley /* Negative face */ 1767766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1768766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1769766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 1770766ab985SMatthew G. Knepley 1771766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 1772766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1773766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1774766ab985SMatthew G. Knepley break; 1775766ab985SMatthew G. Knepley } 1776766ab985SMatthew G. Knepley } 1777766ab985SMatthew G. Knepley } 1778766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1779766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 1780766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 1781766ab985SMatthew G. Knepley const PetscInt *support; 1782766ab985SMatthew G. Knepley PetscInt supportSize, s; 1783766ab985SMatthew G. Knepley 1784766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 1785766ab985SMatthew G. Knepley if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); 1786766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 1787766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 1788766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1789766ab985SMatthew G. Knepley } 1790766ab985SMatthew G. Knepley } 1791766ab985SMatthew G. Knepley } 1792766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 1793766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1794766ab985SMatthew G. Knepley } 1795766ab985SMatthew G. Knepley 1796766ab985SMatthew G. Knepley #undef __FUNCT__ 1797e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation" 1798e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 1799e6ccafaeSMatthew G Knepley { 180082f516ccSBarry Smith MPI_Comm comm; 1801e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 1802e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 1803e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 1804e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1805e6ccafaeSMatthew G Knepley 180682f516ccSBarry Smith PetscFunctionBegin; 180782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1808e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &cellDim);CHKERRQ(ierr); 1809e6ccafaeSMatthew G Knepley if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 1810e6ccafaeSMatthew G Knepley 1811ddeab2a6SMatthew G. Knepley if (cellDim == 1 && numCorners == 2) { 1812ddeab2a6SMatthew G. Knepley /* Triangle */ 1813e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 1814e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1815ddeab2a6SMatthew G. Knepley } else if (cellDim == 2 && numCorners == 3) { 1816ddeab2a6SMatthew G. Knepley /* Triangle */ 1817ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 1818ddeab2a6SMatthew G. Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1819ddeab2a6SMatthew G. Knepley } else if (cellDim == 3 && numCorners == 4) { 1820ddeab2a6SMatthew G. Knepley /* Tetrahedron */ 1821ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 1822ddeab2a6SMatthew G. Knepley posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1823e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 1824e6ccafaeSMatthew G Knepley /* Quadratic line */ 1825e6ccafaeSMatthew G Knepley faceSize = 1; 1826e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1827e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 1828e6ccafaeSMatthew G Knepley /* Quads */ 1829e6ccafaeSMatthew G Knepley faceSize = 2; 1830e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 1831e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1832e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 1833e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1834e6ccafaeSMatthew G Knepley } else { 1835e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 1836e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 1837e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 1838e6ccafaeSMatthew G Knepley } 1839e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 1840e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 1841e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 1842e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 1843e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 1844e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1845e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 1846e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 1847e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 1848e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 1849e6ccafaeSMatthew G Knepley }; 1850e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 1851e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 1852e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 1853e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 1854e6ccafaeSMatthew G Knepley }; 1855e6ccafaeSMatthew G Knepley 1856e6ccafaeSMatthew G Knepley faceSize = faceSizeTri; 1857e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 1858e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 1859e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 1860e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 1861e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1862e6ccafaeSMatthew G Knepley 1863e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 1864e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 1865e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 1866e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 1867e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 1868e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1869e6ccafaeSMatthew G Knepley break; 1870e6ccafaeSMatthew G Knepley } 1871e6ccafaeSMatthew G Knepley } 1872e6ccafaeSMatthew G Knepley } 1873e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1874e6ccafaeSMatthew G Knepley break; 1875e6ccafaeSMatthew G Knepley } 1876e6ccafaeSMatthew G Knepley } 1877e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 1878e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1879e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1880e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 1881e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 1882e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 1883e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 1884e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 1885e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1886e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 1887e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 1888e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 1889e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 1890e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 1891e6ccafaeSMatthew G Knepley }; 1892e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 1893e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 1894e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 1895e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 1896e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 1897e6ccafaeSMatthew G Knepley }; 1898e6ccafaeSMatthew G Knepley 1899e6ccafaeSMatthew G Knepley faceSize = faceSizeQuad; 1900e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 1901e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 1902e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 1903e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 1904e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1905e6ccafaeSMatthew G Knepley 1906e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 1907e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 1908e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 1909e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 1910e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 1911e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1912e6ccafaeSMatthew G Knepley break; 1913e6ccafaeSMatthew G Knepley } 1914e6ccafaeSMatthew G Knepley } 1915e6ccafaeSMatthew G Knepley } 1916e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1917e6ccafaeSMatthew G Knepley break; 1918e6ccafaeSMatthew G Knepley } 1919e6ccafaeSMatthew G Knepley } 1920e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 1921e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1922e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1923e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 1924e6ccafaeSMatthew G Knepley /* Hexes 1925e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 1926e6ccafaeSMatthew G Knepley pointing up at the second. 1927e6ccafaeSMatthew G Knepley 1928e6ccafaeSMatthew G Knepley 7---6 1929e6ccafaeSMatthew G Knepley /| /| 1930e6ccafaeSMatthew G Knepley 4---5 | 1931ddeab2a6SMatthew G. Knepley | 1-|-2 1932e6ccafaeSMatthew G Knepley |/ |/ 1933ddeab2a6SMatthew G. Knepley 0---3 1934e6ccafaeSMatthew G Knepley 1935e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 1936e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 1937e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 1938e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1939e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 1940e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 1941e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 1942ddeab2a6SMatthew G. Knepley 0, 3, 4, 5, /* front */ 1943ddeab2a6SMatthew G. Knepley 2, 3, 5, 6, /* right */ 1944ddeab2a6SMatthew G. Knepley 1, 2, 6, 7, /* back */ 1945ddeab2a6SMatthew G. Knepley 0, 1, 4, 7, /* left */ 1946e6ccafaeSMatthew G Knepley }; 1947e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 1948ddeab2a6SMatthew G. Knepley 1, 2, 3, 0, /* bottom */ 1949e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 1950ddeab2a6SMatthew G. Knepley 0, 3, 5, 4, /* front */ 1951ddeab2a6SMatthew G. Knepley 3, 2, 6, 5, /* right */ 1952ddeab2a6SMatthew G. Knepley 2, 1, 7, 6, /* back */ 1953ddeab2a6SMatthew G. Knepley 1, 0, 4, 7, /* left */ 1954e6ccafaeSMatthew G Knepley }; 1955e6ccafaeSMatthew G Knepley 1956e6ccafaeSMatthew G Knepley faceSize = faceSizeHex; 1957e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 1958e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 1959e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 1960e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 1961e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1962e6ccafaeSMatthew G Knepley 1963e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 1964e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 1965e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 1966e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 1967e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 1968e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 1969e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 1970e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1971e6ccafaeSMatthew G Knepley break; 1972e6ccafaeSMatthew G Knepley } 1973e6ccafaeSMatthew G Knepley } 1974e6ccafaeSMatthew G Knepley } 1975e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1976e6ccafaeSMatthew G Knepley break; 1977e6ccafaeSMatthew G Knepley } 1978e6ccafaeSMatthew G Knepley } 1979e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 1980e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1981e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1982e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 1983e6ccafaeSMatthew G Knepley /* Quadratic tet */ 1984e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 1985e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 1986e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 1987e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1988e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 1989e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 1990e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 1991e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 1992e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 1993e6ccafaeSMatthew G Knepley }; 1994e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 1995e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 1996e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 1997e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 1998e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 1999e6ccafaeSMatthew G Knepley }; 2000e6ccafaeSMatthew G Knepley 2001e6ccafaeSMatthew G Knepley faceSize = faceSizeTet; 2002e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 2003e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 2004e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 2005e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 2006e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2007e6ccafaeSMatthew G Knepley 2008e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 2009e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 2010e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 2011e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 2012e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 2013e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 2014e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 2015e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2016e6ccafaeSMatthew G Knepley break; 2017e6ccafaeSMatthew G Knepley } 2018e6ccafaeSMatthew G Knepley } 2019e6ccafaeSMatthew G Knepley } 2020e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2021e6ccafaeSMatthew G Knepley break; 2022e6ccafaeSMatthew G Knepley } 2023e6ccafaeSMatthew G Knepley } 2024e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 2025e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2026e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2027e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 2028e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 2029e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2030e6ccafaeSMatthew G Knepley pointing up at the second. 2031e6ccafaeSMatthew G Knepley 2032e6ccafaeSMatthew G Knepley 7---6 2033e6ccafaeSMatthew G Knepley /| /| 2034e6ccafaeSMatthew G Knepley 4---5 | 2035e6ccafaeSMatthew G Knepley | 3-|-2 2036e6ccafaeSMatthew G Knepley |/ |/ 2037e6ccafaeSMatthew G Knepley 0---1 2038e6ccafaeSMatthew G Knepley 2039e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2040e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 2041e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 2042e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2043e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 2044e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 2045e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2046e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 2047e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 2048e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 2049e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 2050e6ccafaeSMatthew G Knepley }; 2051e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 2052e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 2053e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2054e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 2055e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 2056e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 2057e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 2058e6ccafaeSMatthew G Knepley }; 2059e6ccafaeSMatthew G Knepley 2060e6ccafaeSMatthew G Knepley faceSize = faceSizeQuadHex; 2061e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 2062e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 2063e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2064e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 2065e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2066e6ccafaeSMatthew G Knepley 2067e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 2068e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 2069e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 2070e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 2071e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 2072e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 2073e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 2074e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2075e6ccafaeSMatthew G Knepley break; 2076e6ccafaeSMatthew G Knepley } 2077e6ccafaeSMatthew G Knepley } 2078e6ccafaeSMatthew G Knepley } 2079e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2080e6ccafaeSMatthew G Knepley break; 2081e6ccafaeSMatthew G Knepley } 2082e6ccafaeSMatthew G Knepley } 2083e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2084e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2085e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2086e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 2087e6ccafaeSMatthew G Knepley if (!posOrient) { 2088e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 2089e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 2090e6ccafaeSMatthew G Knepley } else { 2091e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 2092e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 2093e6ccafaeSMatthew G Knepley } 2094e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 2095e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2096e6ccafaeSMatthew G Knepley } 2097e6ccafaeSMatthew G Knepley 2098e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2099e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace" 2100e6ccafaeSMatthew G Knepley /* 2101e6ccafaeSMatthew G Knepley Given a cell and a face, as a set of vertices, 2102e6ccafaeSMatthew G Knepley return the oriented face, as a set of vertices, in faceVertices 2103e6ccafaeSMatthew G Knepley The orientation is such that the face normal points out of the cell 2104e6ccafaeSMatthew G Knepley */ 2105e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2106e6ccafaeSMatthew G Knepley { 21070298fd71SBarry Smith const PetscInt *cone = NULL; 2108e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 2109e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 2110e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2111e6ccafaeSMatthew G Knepley 2112e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2113e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 2114e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 2115e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 2116e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2117e6ccafaeSMatthew G Knepley 2118e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 2119e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 2120e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 2121e6ccafaeSMatthew G Knepley } 2122e6ccafaeSMatthew G Knepley } 2123e6ccafaeSMatthew G Knepley if (found) { 2124e6ccafaeSMatthew G Knepley indices[v2] = v; 2125e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 2126e6ccafaeSMatthew G Knepley ++v2; 2127e6ccafaeSMatthew G Knepley } else { 2128e6ccafaeSMatthew G Knepley oppositeVertex = v; 2129e6ccafaeSMatthew G Knepley } 2130e6ccafaeSMatthew G Knepley } 2131e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 2132e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2133e6ccafaeSMatthew G Knepley } 2134e6ccafaeSMatthew G Knepley 2135e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2136cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal" 2137e6ccafaeSMatthew G Knepley /* 2138cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 2139e6ccafaeSMatthew G Knepley 2140e6ccafaeSMatthew G Knepley Not collective 2141e6ccafaeSMatthew G Knepley 2142e6ccafaeSMatthew G Knepley Input Parameters: 2143e6ccafaeSMatthew G Knepley + dm - The DMPlex 2144e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 2145e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 2146e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 2147e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 2148e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 2149e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 2150e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 2151e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 2152e6ccafaeSMatthew G Knepley 2153e6ccafaeSMatthew G Knepley Output Parameters: 2154e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 2155e6ccafaeSMatthew G Knepley 2156e6ccafaeSMatthew G Knepley Level: developer 2157e6ccafaeSMatthew G Knepley */ 2158cd0c2139SMatthew 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) 2159e6ccafaeSMatthew G Knepley { 216082f516ccSBarry Smith MPI_Comm comm; 2161e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 2162e6ccafaeSMatthew G Knepley const PetscInt *faces; 2163e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 2164e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2165e6ccafaeSMatthew G Knepley 2166e6ccafaeSMatthew G Knepley PetscFunctionBegin; 216782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2168e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 2169e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 2170e6ccafaeSMatthew G Knepley #if 0 2171e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 2172e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2173e6ccafaeSMatthew G Knepley #else 2174e6ccafaeSMatthew G Knepley { 2175e6ccafaeSMatthew G Knepley PetscInt f; 2176e6ccafaeSMatthew G Knepley 2177e6ccafaeSMatthew G Knepley numFaces = 0; 2178e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2179e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 2180e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 2181e6ccafaeSMatthew G Knepley 2182e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 2183e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 2184e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 2185e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 2186e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 2187e6ccafaeSMatthew G Knepley PetscInt v; 2188e6ccafaeSMatthew G Knepley 2189e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2190e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 2191e6ccafaeSMatthew G Knepley } 2192e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 2193e6ccafaeSMatthew G Knepley } 2194e6ccafaeSMatthew G Knepley if (d == dof) { 2195e6ccafaeSMatthew G Knepley numFaces = 1; 2196e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 2197e6ccafaeSMatthew G Knepley } 2198e6ccafaeSMatthew G Knepley } 2199e6ccafaeSMatthew G Knepley } 2200e6ccafaeSMatthew G Knepley #endif 2201e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 2202e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 2203e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 2204766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 2205e6ccafaeSMatthew G Knepley } else { 2206e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 2207e6ccafaeSMatthew G Knepley PetscBool posOriented; 2208e6ccafaeSMatthew G Knepley 2209e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2210e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 2211e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 2212e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 2213e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 2214e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 2215e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2216e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 2217e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 2218e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 2219e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 2220e6ccafaeSMatthew G Knepley break; 2221e6ccafaeSMatthew G Knepley } 2222e6ccafaeSMatthew G Knepley } 2223e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 2224e6ccafaeSMatthew G Knepley } 2225e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 2226e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 2227e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2228e6ccafaeSMatthew G Knepley ++(*newFacePoint); 2229e6ccafaeSMatthew G Knepley } 2230ef07cca7SMatthew G. Knepley #if 0 2231e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2232ef07cca7SMatthew G. Knepley #else 2233ef07cca7SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2234ef07cca7SMatthew G. Knepley #endif 2235e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2236e6ccafaeSMatthew G Knepley } 2237e6ccafaeSMatthew G Knepley 2238e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2239e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated" 224053156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2241e6ccafaeSMatthew G Knepley { 224282f516ccSBarry Smith MPI_Comm comm; 224353156dfcSMatthew G. Knepley DMLabel subpointMap; 2244efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 2245efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 2246efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 2247fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 2248efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 2249e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2250e6ccafaeSMatthew G Knepley 2251e6ccafaeSMatthew G Knepley PetscFunctionBegin; 225282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2253efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2254efa14ee0SMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2255efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2256efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 225753156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);} 2258efa14ee0SMatthew G Knepley /* Setup chart */ 2259efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2260efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2261efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2262efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2263e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2264e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 2265efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 2266e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 2267efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2268efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2269efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 2270efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2271e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2272e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2273e6ccafaeSMatthew G Knepley } 2274e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2275e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2276e6ccafaeSMatthew G Knepley } 2277e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2278e6ccafaeSMatthew G Knepley /* Create face cones */ 2279efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 22800298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2281efa14ee0SMatthew G Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2282e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2283e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 2284efa14ee0SMatthew G Knepley const PetscInt subcell = c; 22850298fd71SBarry Smith PetscInt *closure = NULL; 2286efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 2287e6ccafaeSMatthew G Knepley 2288e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2289efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2290efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 2291e6ccafaeSMatthew G Knepley PetscInt subVertex; 2292e6ccafaeSMatthew G Knepley 2293efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 2294efa14ee0SMatthew G Knepley ++numCorners; 2295efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 2296efa14ee0SMatthew G Knepley if (subVertex >= 0) { 2297efa14ee0SMatthew G Knepley closure[faceSize] = point; 229865560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 2299e6ccafaeSMatthew G Knepley ++faceSize; 2300e6ccafaeSMatthew G Knepley } 2301e6ccafaeSMatthew G Knepley } 2302e6ccafaeSMatthew G Knepley } 2303efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 2304efa14ee0SMatthew G Knepley if (faceSize == nFV) { 2305cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 2306e6ccafaeSMatthew G Knepley } 230765560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2308e6ccafaeSMatthew G Knepley } 2309efa14ee0SMatthew G Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2310e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2311e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2312e6ccafaeSMatthew G Knepley /* Build coordinates */ 2313efa14ee0SMatthew G Knepley { 2314efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 2315efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 2316efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 2317285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2318efa14ee0SMatthew G Knepley 2319e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2320e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2321e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2322285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2323285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2324285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2325efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2326efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2327efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2328efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2329efa14ee0SMatthew G Knepley PetscInt dof; 2330efa14ee0SMatthew G Knepley 2331efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2332efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2333285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2334e6ccafaeSMatthew G Knepley } 2335e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2336e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2337e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2338e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 23392eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2340830e53efSMatthew G. Knepley if (coordSize) { 2341e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2342e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2343efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2344efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2345efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2346efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2347e6ccafaeSMatthew G Knepley 2348e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2349e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2350efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2351efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2352efa14ee0SMatthew 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); 2353e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2354e6ccafaeSMatthew G Knepley } 2355e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2356e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 23573b399e24SMatthew G. Knepley } 2358e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2359e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2360e6ccafaeSMatthew G Knepley } 2361efa14ee0SMatthew G Knepley /* Cleanup */ 2362efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2363efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2364efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2365efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2366e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2367e6ccafaeSMatthew G Knepley } 2368e6ccafaeSMatthew G Knepley 2369e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2370e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated" 237153156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2372e6ccafaeSMatthew G Knepley { 237382f516ccSBarry Smith MPI_Comm comm; 237453156dfcSMatthew G. Knepley DMLabel subpointMap; 2375efa14ee0SMatthew G Knepley IS *subpointIS; 2376efa14ee0SMatthew G Knepley const PetscInt **subpoints; 237701a2673eSMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *coneONew; 2378efa14ee0SMatthew G Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2379e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2380e6ccafaeSMatthew G Knepley 2381e6ccafaeSMatthew G Knepley PetscFunctionBegin; 238282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2383efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2384e6ccafaeSMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2385efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2386efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 238753156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Interpolated(dm, vertexLabel, value, subpointMap, subdm);CHKERRQ(ierr);} 2388efa14ee0SMatthew G Knepley /* Setup chart */ 2389efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2390efa14ee0SMatthew G Knepley ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr); 2391e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2392e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2393e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 2394e6ccafaeSMatthew G Knepley } 2395e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2396e6ccafaeSMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2397e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2398e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 2399e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2400e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2401e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2402e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2403e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2404e6ccafaeSMatthew G Knepley ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2405e6ccafaeSMatthew G Knepley } 2406e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2407e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2408e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2409e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2410e6ccafaeSMatthew G Knepley const PetscInt *cone; 2411e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 2412e6ccafaeSMatthew G Knepley 2413e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2414e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2415e6ccafaeSMatthew G Knepley if (d == dim) { 2416e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2417e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2418e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2419e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 2420e6ccafaeSMatthew G Knepley } 2421e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2422e6ccafaeSMatthew G Knepley } 2423e6ccafaeSMatthew G Knepley } 2424e6ccafaeSMatthew G Knepley } 2425e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2426e6ccafaeSMatthew G Knepley /* Set cones */ 24270298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 242801a2673eSMatthew G. Knepley ierr = PetscMalloc2(maxConeSize,PetscInt,&coneNew,maxConeSize,PetscInt,&coneONew);CHKERRQ(ierr); 2429e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2430e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2431e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2432e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 24330e49e2e2SMatthew G. Knepley const PetscInt *cone, *ornt; 2434e6ccafaeSMatthew G Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2435e6ccafaeSMatthew G Knepley 2436e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2437e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2438e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 24390e49e2e2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2440e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2441e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 244201a2673eSMatthew G. Knepley if (subc >= 0) { 244301a2673eSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 244401a2673eSMatthew G. Knepley coneONew[coneSizeNew] = ornt[c]; 244501a2673eSMatthew G. Knepley ++coneSizeNew; 244601a2673eSMatthew G. Knepley } 2447e6ccafaeSMatthew G Knepley } 2448e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2449e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 245001a2673eSMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, coneONew);CHKERRQ(ierr); 2451e6ccafaeSMatthew G Knepley } 2452e6ccafaeSMatthew G Knepley } 245301a2673eSMatthew G. Knepley ierr = PetscFree2(coneNew,coneONew);CHKERRQ(ierr); 2454e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2455e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2456e6ccafaeSMatthew G Knepley /* Build coordinates */ 2457e6ccafaeSMatthew G Knepley { 2458e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 2459e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 2460e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 2461285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2462e6ccafaeSMatthew G Knepley 2463e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2464e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2465e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2466285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2467285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2468285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2469e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2470e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2471e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2472e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2473e6ccafaeSMatthew G Knepley PetscInt dof; 2474e6ccafaeSMatthew G Knepley 2475e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2476e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2477285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2478e6ccafaeSMatthew G Knepley } 2479e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2480e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2481e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2482e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 24832eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2484e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2485e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2486e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2487e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2488e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2489e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2490e6ccafaeSMatthew G Knepley 2491e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2492e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2493e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2494e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2495e6ccafaeSMatthew 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); 2496efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2497e6ccafaeSMatthew G Knepley } 2498e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2499e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2500e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2501e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2502e6ccafaeSMatthew G Knepley } 2503efa14ee0SMatthew G Knepley /* Cleanup */ 2504e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2505e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2506e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2507e6ccafaeSMatthew G Knepley } 2508efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2509e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2510e6ccafaeSMatthew G Knepley } 2511e6ccafaeSMatthew G Knepley 2512e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2513e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh" 2514d0fa310fSMatthew G. Knepley /*@ 2515e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 2516e6ccafaeSMatthew G Knepley 2517e6ccafaeSMatthew G Knepley Input Parameters: 2518e6ccafaeSMatthew G Knepley + dm - The original mesh 2519830e53efSMatthew G. Knepley . vertexLabel - The DMLabel marking vertices contained in the surface 2520830e53efSMatthew G. Knepley - value - The label value to use 2521e6ccafaeSMatthew G Knepley 2522e6ccafaeSMatthew G Knepley Output Parameter: 2523e6ccafaeSMatthew G Knepley . subdm - The surface mesh 2524e6ccafaeSMatthew G Knepley 2525e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2526e6ccafaeSMatthew G Knepley 2527e6ccafaeSMatthew G Knepley Level: developer 2528e6ccafaeSMatthew G Knepley 2529e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue() 2530830e53efSMatthew G. Knepley @*/ 253153156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm) 2532e6ccafaeSMatthew G Knepley { 2533e6ccafaeSMatthew G Knepley PetscInt dim, depth; 2534e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2535e6ccafaeSMatthew G Knepley 2536e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2537e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2538766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 2539e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2540e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 254182f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2542e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2543e6ccafaeSMatthew G Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2544e6ccafaeSMatthew G Knepley if (depth == dim) { 2545830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2546e6ccafaeSMatthew G Knepley } else { 2547830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2548e6ccafaeSMatthew G Knepley } 2549e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2550e6ccafaeSMatthew G Knepley } 2551e6ccafaeSMatthew G Knepley 2552e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2553aca35d17SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal" 2554aca35d17SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 2555aca35d17SMatthew G. Knepley { 2556aca35d17SMatthew G. Knepley PetscInt subPoint; 2557aca35d17SMatthew G. Knepley PetscErrorCode ierr; 2558aca35d17SMatthew G. Knepley 2559aca35d17SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 2560aca35d17SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 2561aca35d17SMatthew G. Knepley } 2562aca35d17SMatthew G. Knepley 2563aca35d17SMatthew G. Knepley #undef __FUNCT__ 2564766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated" 256527c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 2566766ab985SMatthew G. Knepley { 2567766ab985SMatthew G. Knepley MPI_Comm comm; 2568766ab985SMatthew G. Knepley DMLabel subpointMap; 2569766ab985SMatthew G. Knepley IS subvertexIS; 2570766ab985SMatthew G. Knepley const PetscInt *subVertices; 2571fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 2572766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 257387feddfdSMatthew G. Knepley PetscInt cMax, c, f; 2574766ab985SMatthew G. Knepley PetscErrorCode ierr; 2575766ab985SMatthew G. Knepley 2576766ab985SMatthew G. Knepley PetscFunctionBegin; 2577766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 2578766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2579766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2580766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2581766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 258227c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 2583766ab985SMatthew G. Knepley /* Setup chart */ 2584766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2585766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2586766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2587766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2588766ab985SMatthew G. Knepley /* Set cone sizes */ 2589766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 2590766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 2591766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 2592766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2593766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2594766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2595766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2596766ab985SMatthew G. Knepley } 2597766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2598766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2599766ab985SMatthew G. Knepley } 2600766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2601766ab985SMatthew G. Knepley /* Create face cones */ 2602766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 260387feddfdSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2604766ab985SMatthew G. Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2605766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2606766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 2607766ab985SMatthew G. Knepley const PetscInt subcell = c; 260887feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 260987feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 2610766ab985SMatthew G. Knepley 261187feddfdSMatthew G. Knepley if (cell < cMax) continue; 261287feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 261387feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 261487feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 261587feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 261687feddfdSMatthew G. Knepley } 261787feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 261887feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 261987feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 262027234c99SMatthew G. Knepley /* Not true in parallel 262127234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 262287feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 262387feddfdSMatthew G. Knepley PetscInt negsubcell; 2624766ab985SMatthew G. Knepley 262587feddfdSMatthew G. Knepley if (cells[p] >= cMax) continue; 262687feddfdSMatthew G. Knepley /* I know this is a crap search */ 262787feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 262887feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 2629766ab985SMatthew G. Knepley } 263087feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 263187feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 2632766ab985SMatthew G. Knepley } 263387feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 263487feddfdSMatthew G. Knepley ++newFacePoint; 2635766ab985SMatthew G. Knepley } 2636766ab985SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2637766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2638766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2639766ab985SMatthew G. Knepley /* Build coordinates */ 2640766ab985SMatthew G. Knepley { 2641766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2642766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2643766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2644285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2645766ab985SMatthew G. Knepley 2646766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2647766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2648766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2649285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2650285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2651285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2652766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2653766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2654766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2655766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2656766ab985SMatthew G. Knepley PetscInt dof; 2657766ab985SMatthew G. Knepley 2658766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2659766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2660285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2661766ab985SMatthew G. Knepley } 2662766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2663766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2664766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2665766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 26662eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2667766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2668766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2669766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2670766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2671766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2672766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 2673766ab985SMatthew G. Knepley 2674766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2675766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2676766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2677766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2678766ab985SMatthew 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); 2679766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2680766ab985SMatthew G. Knepley } 2681766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2682766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2683766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2684766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2685766ab985SMatthew G. Knepley } 2686aca35d17SMatthew G. Knepley /* Build SF */ 2687aca35d17SMatthew G. Knepley CHKMEMQ; 2688aca35d17SMatthew G. Knepley { 2689aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 2690aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 2691bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 2692aca35d17SMatthew G. Knepley const PetscInt *localPoints; 2693bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 269449c26ae4SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 2695bdcf2095SMatthew G. Knepley PetscMPIInt rank; 2696aca35d17SMatthew G. Knepley 2697bdcf2095SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 2698aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 2699aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 2700aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2701aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 2702aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 2703aca35d17SMatthew G. Knepley if (numRoots >= 0) { 2704aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 2705bdcf2095SMatthew G. Knepley ierr = PetscMalloc2(pEnd-pStart,PetscSFNode,&newLocalPoints,numRoots,PetscSFNode,&newOwners);CHKERRQ(ierr); 2706bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 2707bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 2708bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 2709bdcf2095SMatthew G. Knepley } 27109e0823b2SMatthew G. Knepley /* Set subleaves */ 2711aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2712aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 2713bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2714aca35d17SMatthew G. Knepley 2715aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 2716bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 2717bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 2718bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 2719bdcf2095SMatthew G. Knepley ++numSubLeaves; 2720aca35d17SMatthew G. Knepley } 27219e0823b2SMatthew G. Knepley /* Must put in owned subpoints */ 27229e0823b2SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 27239e0823b2SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 27249e0823b2SMatthew G. Knepley 27259e0823b2SMatthew G. Knepley if (subPoint < 0) { 27269e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = -3; 27279e0823b2SMatthew G. Knepley newOwners[p-pStart].index = -3; 27289e0823b2SMatthew G. Knepley } else { 27299e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = rank; 27309e0823b2SMatthew G. Knepley newOwners[p-pStart].index = subPoint; 27319e0823b2SMatthew G. Knepley } 2732bdcf2095SMatthew G. Knepley } 2733bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2734bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2735bdcf2095SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2736bdcf2095SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2737aca35d17SMatthew G. Knepley ierr = PetscMalloc(numSubLeaves * sizeof(PetscInt), &slocalPoints);CHKERRQ(ierr); 2738aca35d17SMatthew G. Knepley ierr = PetscMalloc(numSubLeaves * sizeof(PetscSFNode), &sremotePoints);CHKERRQ(ierr); 273949c26ae4SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 2740bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 2741bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2742aca35d17SMatthew G. Knepley 2743aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 274449c26ae4SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 2745aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 2746bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 2747bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 2748bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 2749bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 2750aca35d17SMatthew G. Knepley ++sl; 2751aca35d17SMatthew G. Knepley } 2752bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 275349c26ae4SMatthew G. Knepley if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 275449c26ae4SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 2755aca35d17SMatthew G. Knepley } 2756aca35d17SMatthew G. Knepley } 2757aca35d17SMatthew G. Knepley CHKMEMQ; 2758766ab985SMatthew G. Knepley /* Cleanup */ 2759766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2760766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2761766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 2762766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2763766ab985SMatthew G. Knepley } 2764766ab985SMatthew G. Knepley 2765766ab985SMatthew G. Knepley #undef __FUNCT__ 2766766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated" 2767b3154360SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char label[], PetscInt value, DM subdm) 2768766ab985SMatthew G. Knepley { 2769766ab985SMatthew G. Knepley MPI_Comm comm; 2770766ab985SMatthew G. Knepley DMLabel subpointMap; 2771766ab985SMatthew G. Knepley IS *subpointIS; 2772766ab985SMatthew G. Knepley const PetscInt **subpoints; 2773766ab985SMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew; 2774766ab985SMatthew G. Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2775766ab985SMatthew G. Knepley PetscErrorCode ierr; 2776766ab985SMatthew G. Knepley 2777766ab985SMatthew G. Knepley PetscFunctionBegin; 2778766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2779766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2780766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2781766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2782766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 2783b3154360SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr); 2784766ab985SMatthew G. Knepley /* Setup chart */ 2785766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2786766ab985SMatthew G. Knepley ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr); 2787766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2788766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2789766ab985SMatthew G. Knepley totSubPoints += numSubPoints[d]; 2790766ab985SMatthew G. Knepley } 2791766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2792766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2793766ab985SMatthew G. Knepley /* Set cone sizes */ 2794766ab985SMatthew G. Knepley firstSubPoint[dim] = 0; 2795766ab985SMatthew G. Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2796766ab985SMatthew G. Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2797766ab985SMatthew G. Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2798766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2799766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2800766ab985SMatthew G. Knepley ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2801766ab985SMatthew G. Knepley } 2802766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2803766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2804766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2805766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2806766ab985SMatthew G. Knepley const PetscInt *cone; 2807766ab985SMatthew G. Knepley PetscInt coneSize, coneSizeNew, c, val; 2808766ab985SMatthew G. Knepley 2809766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2810766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2811766ab985SMatthew G. Knepley if (d == dim) { 2812766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2813766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2814766ab985SMatthew G. Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2815766ab985SMatthew G. Knepley if (val >= 0) coneSizeNew++; 2816766ab985SMatthew G. Knepley } 2817766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2818766ab985SMatthew G. Knepley } 2819766ab985SMatthew G. Knepley } 2820766ab985SMatthew G. Knepley } 2821766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2822766ab985SMatthew G. Knepley /* Set cones */ 2823766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2824766ab985SMatthew G. Knepley ierr = PetscMalloc(maxConeSize * sizeof(PetscInt), &coneNew);CHKERRQ(ierr); 2825766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2826766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2827766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2828766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2829766ab985SMatthew G. Knepley const PetscInt *cone; 2830766ab985SMatthew G. Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2831766ab985SMatthew G. Knepley 2832766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2833766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2834766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2835766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2836766ab985SMatthew G. Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 2837766ab985SMatthew G. Knepley if (subc >= 0) coneNew[coneSizeNew++] = firstSubPoint[d-1] + subc; 2838766ab985SMatthew G. Knepley } 2839766ab985SMatthew G. Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2840766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 2841766ab985SMatthew G. Knepley } 2842766ab985SMatthew G. Knepley } 2843766ab985SMatthew G. Knepley ierr = PetscFree(coneNew);CHKERRQ(ierr); 2844766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2845766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2846766ab985SMatthew G. Knepley /* Build coordinates */ 2847766ab985SMatthew G. Knepley { 2848766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2849766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2850766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2851285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2852766ab985SMatthew G. Knepley 2853766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2854766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2855766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2856285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2857285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2858285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2859766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2860766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2861766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 2862766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2863766ab985SMatthew G. Knepley PetscInt dof; 2864766ab985SMatthew G. Knepley 2865766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2866766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2867285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2868766ab985SMatthew G. Knepley } 2869766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2870766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2871766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2872766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 28732eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2874766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2875766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2876766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2877766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 2878766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2879766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 2880766ab985SMatthew G. Knepley 2881766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2882766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2883766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2884766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2885766ab985SMatthew 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); 2886766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2887766ab985SMatthew G. Knepley } 2888766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2889766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2890766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2891766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2892766ab985SMatthew G. Knepley } 2893766ab985SMatthew G. Knepley /* Cleanup */ 2894766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2895766ab985SMatthew G. Knepley ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2896766ab985SMatthew G. Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2897766ab985SMatthew G. Knepley } 2898766ab985SMatthew G. Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2899766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2900766ab985SMatthew G. Knepley } 2901766ab985SMatthew G. Knepley 2902766ab985SMatthew G. Knepley #undef __FUNCT__ 2903766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh" 2904766ab985SMatthew G. Knepley /* 290527c04023SMatthew 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. 2906766ab985SMatthew G. Knepley 2907766ab985SMatthew G. Knepley Input Parameters: 2908766ab985SMatthew G. Knepley + dm - The original mesh 290927c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 291027c04023SMatthew G. Knepley . label - A label name, or PETSC_NULL 291127c04023SMatthew G. Knepley - value - A label value 2912766ab985SMatthew G. Knepley 2913766ab985SMatthew G. Knepley Output Parameter: 2914766ab985SMatthew G. Knepley . subdm - The surface mesh 2915766ab985SMatthew G. Knepley 2916766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2917766ab985SMatthew G. Knepley 2918766ab985SMatthew G. Knepley Level: developer 2919766ab985SMatthew G. Knepley 2920766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 2921766ab985SMatthew G. Knepley */ 292227c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 2923766ab985SMatthew G. Knepley { 2924766ab985SMatthew G. Knepley PetscInt dim, depth; 2925766ab985SMatthew G. Knepley PetscErrorCode ierr; 2926766ab985SMatthew G. Knepley 2927766ab985SMatthew G. Knepley PetscFunctionBegin; 2928766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 292927c04023SMatthew G. Knepley PetscValidPointer(subdm, 5); 2930766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2931766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2932766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2933766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2934766ab985SMatthew G. Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2935766ab985SMatthew G. Knepley if (depth == dim) { 2936b3154360SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr); 2937766ab985SMatthew G. Knepley } else { 293827c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 2939e6ccafaeSMatthew G Knepley } 2940e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2941e6ccafaeSMatthew G Knepley } 2942e6ccafaeSMatthew G Knepley 2943e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2944e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap" 294564beef6dSMatthew G. Knepley /*@ 294664beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 294764beef6dSMatthew G. Knepley 294864beef6dSMatthew G. Knepley Input Parameter: 294964beef6dSMatthew G. Knepley . dm - The submesh DM 295064beef6dSMatthew G. Knepley 295164beef6dSMatthew G. Knepley Output Parameter: 295264beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 295364beef6dSMatthew G. Knepley 295464beef6dSMatthew G. Knepley Level: developer 295564beef6dSMatthew G. Knepley 295664beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 295764beef6dSMatthew G. Knepley @*/ 2958e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 2959e6ccafaeSMatthew G Knepley { 2960e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 2961e6ccafaeSMatthew G Knepley 2962e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2963e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2964e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 2965e6ccafaeSMatthew G Knepley *subpointMap = mesh->subpointMap; 2966e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2967e6ccafaeSMatthew G Knepley } 2968e6ccafaeSMatthew G Knepley 2969e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2970e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap" 2971e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */ 2972e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 2973e6ccafaeSMatthew G Knepley { 2974e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 2975285d324eSMatthew G. Knepley DMLabel tmp; 2976e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2977e6ccafaeSMatthew G Knepley 2978e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2979e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2980285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 2981e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 2982285d324eSMatthew G. Knepley ++mesh->subpointMap->refct; 2983285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 2984e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2985e6ccafaeSMatthew G Knepley } 2986e6ccafaeSMatthew G Knepley 2987e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2988e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS" 298964beef6dSMatthew G. Knepley /*@ 2990e6ccafaeSMatthew G Knepley DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 2991e6ccafaeSMatthew G Knepley 2992e6ccafaeSMatthew G Knepley Input Parameter: 2993e6ccafaeSMatthew G Knepley . dm - The submesh DM 2994e6ccafaeSMatthew G Knepley 2995e6ccafaeSMatthew G Knepley Output Parameter: 29960298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 2997e6ccafaeSMatthew G Knepley 2998e6ccafaeSMatthew G Knepley Note: This is IS is guaranteed to be sorted by the construction of the submesh 299964beef6dSMatthew G. Knepley 300064beef6dSMatthew G. Knepley Level: developer 300164beef6dSMatthew G. Knepley 300264beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 300364beef6dSMatthew G. Knepley @*/ 3004e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 3005e6ccafaeSMatthew G Knepley { 300682f516ccSBarry Smith MPI_Comm comm; 3007e6ccafaeSMatthew G Knepley DMLabel subpointMap; 3008e6ccafaeSMatthew G Knepley IS is; 3009e6ccafaeSMatthew G Knepley const PetscInt *opoints; 3010e6ccafaeSMatthew G Knepley PetscInt *points, *depths; 3011e6ccafaeSMatthew G Knepley PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 3012e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3013e6ccafaeSMatthew G Knepley 3014e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3015e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3016e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 301782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 30180298fd71SBarry Smith *subpointIS = NULL; 3019e6ccafaeSMatthew G Knepley ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 3020e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3021fed694aaSMatthew G. Knepley if (subpointMap && depth >= 0) { 3022e6ccafaeSMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3023e6ccafaeSMatthew G Knepley if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 3024e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3025e6ccafaeSMatthew G Knepley depths[0] = depth; 3026e6ccafaeSMatthew G Knepley depths[1] = 0; 3027e6ccafaeSMatthew G Knepley for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 3028e6ccafaeSMatthew G Knepley ierr = PetscMalloc(pEnd * sizeof(PetscInt), &points);CHKERRQ(ierr); 3029e6ccafaeSMatthew G Knepley for(d = 0, off = 0; d <= depth; ++d) { 3030e6ccafaeSMatthew G Knepley const PetscInt dep = depths[d]; 3031e6ccafaeSMatthew G Knepley 3032e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 3033e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 30341e21b6fdSMatthew G Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 3035e6ccafaeSMatthew 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); 3036e6ccafaeSMatthew G Knepley } else { 30371e21b6fdSMatthew G Knepley if (!n) { 30381e21b6fdSMatthew G Knepley if (d == 0) { 30391e21b6fdSMatthew G Knepley /* Missing cells */ 30401e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 30411e21b6fdSMatthew G Knepley } else { 30421e21b6fdSMatthew G Knepley /* Missing faces */ 30431e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 30441e21b6fdSMatthew G Knepley } 30451e21b6fdSMatthew G Knepley } 3046e6ccafaeSMatthew G Knepley } 3047e6ccafaeSMatthew G Knepley if (n) { 3048e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 3049e6ccafaeSMatthew G Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 3050e6ccafaeSMatthew G Knepley for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 3051e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 3052e6ccafaeSMatthew G Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 3053e6ccafaeSMatthew G Knepley } 3054e6ccafaeSMatthew G Knepley } 3055e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3056e6ccafaeSMatthew G Knepley if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 3057fed694aaSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 3058e6ccafaeSMatthew G Knepley } 3059e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3060e6ccafaeSMatthew G Knepley } 3061