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); 153*dcca6d9dSJed Brown ierr = PetscMalloc2(depth+1,&depthEnd,PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),&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) { 270*dcca6d9dSJed Brown ierr = PetscMalloc2(numRoots,&newLocation,pEnd-pStart,&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); 586*dcca6d9dSJed Brown ierr = PetscMalloc3(depth+1,&depthShift,depth+1,&depthOffset,depth+1,&pMaxNew);CHKERRQ(ierr); 587*dcca6d9dSJed Brown ierr = PetscMalloc7(depth+1,&splitIS,depth+1,&unsplitIS,depth+1,&numSplitPoints,depth+1,&numUnsplitPoints,depth+1,&numHybridPoints,depth+1,&splitPoints,depth+1,&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); 70118c5995bSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, 1);CHKERRQ(ierr); 70218c5995bSMatthew G. Knepley } else if (dep == dim-2) { 70318c5995bSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 70418c5995bSMatthew G. Knepley 70518c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 70618c5995bSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 707cd0c2139SMatthew G Knepley PetscInt val; 708cd0c2139SMatthew G Knepley 709cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 71018c5995bSMatthew G. Knepley if (val == dim-1) ++qf; 71118c5995bSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 71218c5995bSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 713cd0c2139SMatthew G Knepley } 71418c5995bSMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */ 71518c5995bSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, supportSize+3);CHKERRQ(ierr); 71618c5995bSMatthew G. Knepley /* Add hybrid face */ 71718c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 71818c5995bSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, 1);CHKERRQ(ierr); 719cd0c2139SMatthew G Knepley } 720cd0c2139SMatthew G Knepley } 721cd0c2139SMatthew G Knepley } 722cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 723cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 724cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 725dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 726*dcca6d9dSJed Brown ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),&supportNew);CHKERRQ(ierr); 727cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 728cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 729cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 730cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 7314c367dbcSMatthew G. Knepley const PetscInt newp = oldp + depthOffset[dep]; 7324c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 733cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 7344c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, q, qf, qn, qp, v, e, s; 735cd0c2139SMatthew G Knepley 736cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 737cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 738cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 739cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 740cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 741cd0c2139SMatthew G Knepley if (dep == depth-1) { 7424c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 743cd0c2139SMatthew G Knepley const PetscInt *supportF; 744cd0c2139SMatthew G Knepley 745cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 746cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 747cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 748cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 749cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 750cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 7514c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 75218c5995bSMatthew G. Knepley if (v < 0) { 75318c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 75418c5995bSMatthew 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); 75518c5995bSMatthew G. Knepley coneNew[2+q] = cone[q] + depthOffset[dep-1]; 75618c5995bSMatthew G. Knepley } else { 7574c367dbcSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep-1]; 758cd0c2139SMatthew G Knepley } 759cd0c2139SMatthew G Knepley } 760cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 761cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 762e537020bSMatthew G. Knepley /* Face support */ 763cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 764cd0c2139SMatthew G Knepley PetscInt val; 765cd0c2139SMatthew G Knepley 766cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 767cd0c2139SMatthew G Knepley if (val < 0) { 768cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 7694c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr); 770cd0c2139SMatthew G Knepley } else { 771cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 7724c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr); 773e537020bSMatthew G. Knepley /* Get orientation for cohesive face */ 774e537020bSMatthew G. Knepley { 775e537020bSMatthew G. Knepley const PetscInt *ncone, *nconeO; 776e537020bSMatthew G. Knepley PetscInt nconeSize, nc; 777e537020bSMatthew G. Knepley 778e537020bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 779e537020bSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 780e537020bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 781e537020bSMatthew G. Knepley for (nc = 0; nc < nconeSize; ++nc) { 782e537020bSMatthew G. Knepley if (ncone[nc] == oldp) { 783e537020bSMatthew G. Knepley coneONew[0] = nconeO[nc]; 784e537020bSMatthew G. Knepley break; 785cd0c2139SMatthew G Knepley } 786cd0c2139SMatthew G Knepley } 787e537020bSMatthew 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]); 788e537020bSMatthew G. Knepley } 789e537020bSMatthew G. Knepley } 790e537020bSMatthew G. Knepley } 7914c367dbcSMatthew G. Knepley /* Cohesive cell: Old and new split face, then new cohesive faces */ 792fd4b9f15SMatthew G. Knepley coneNew[0] = newp; /* Extracted negative side orientation above */ 7934c367dbcSMatthew G. Knepley coneNew[1] = splitp; 7944c367dbcSMatthew G. Knepley coneONew[1] = coneONew[0]; 795e537020bSMatthew G. Knepley for (q = 0; q < coneSize; ++q) { 79618c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 79718c5995bSMatthew G. Knepley if (v < 0) { 79818c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 79918c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 80018c5995bSMatthew G. Knepley coneONew[2+q] = 0; 80118c5995bSMatthew G. Knepley } else { 80218c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep]; 80318c5995bSMatthew G. Knepley } 804e537020bSMatthew G. Knepley coneONew[2+q] = 0; 805e537020bSMatthew G. Knepley } 8064c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr); 8074c367dbcSMatthew G. Knepley ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr); 808cd0c2139SMatthew G Knepley } else if (dep == 0) { 8094c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 810cd0c2139SMatthew G Knepley 811cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 8124c367dbcSMatthew G. Knepley for (e = 0, qn = 0; e < supportSize; ++e) { 813cd0c2139SMatthew G Knepley PetscInt val; 814cd0c2139SMatthew G Knepley 815cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 816cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 8174c367dbcSMatthew G. Knepley supportNew[qn++] = support[e] + depthOffset[dep+1]; 818cd0c2139SMatthew G Knepley } 819cd0c2139SMatthew G Knepley } 8204c367dbcSMatthew G. Knepley supportNew[qn] = hybedge; 821cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 822cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 8234c367dbcSMatthew G. Knepley for (e = 0, qp = 0; e < supportSize; ++e) { 824cd0c2139SMatthew G Knepley PetscInt val, edge; 825cd0c2139SMatthew G Knepley 826cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 827cd0c2139SMatthew G Knepley if (val == 1) { 8284c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 829cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 8304c367dbcSMatthew G. Knepley supportNew[qp++] = edge + pMaxNew[dep+1]; 831cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 8324c367dbcSMatthew G. Knepley supportNew[qp++] = support[e] + depthOffset[dep+1]; 833cd0c2139SMatthew G Knepley } 834cd0c2139SMatthew G Knepley } 8354c367dbcSMatthew G. Knepley supportNew[qp] = hybedge; 836cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 8374c367dbcSMatthew G. Knepley /* Hybrid edge: Old and new split vertex */ 838cd0c2139SMatthew G Knepley coneNew[0] = newp; 839cd0c2139SMatthew G Knepley coneNew[1] = splitp; 8404c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 8414c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 8424c367dbcSMatthew G. Knepley PetscInt val, edge; 8434c367dbcSMatthew G. Knepley 8444c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 8454c367dbcSMatthew G. Knepley if (val == 1) { 8464c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 8474c367dbcSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 8484c367dbcSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 8494c367dbcSMatthew G. Knepley } 8504c367dbcSMatthew G. Knepley } 8514c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 852cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 8534c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 8544c367dbcSMatthew G. Knepley 855cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 856cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 857cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 8584c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 859cd0c2139SMatthew G Knepley 8604c367dbcSMatthew G. Knepley coneNew[q] = v + pMaxNew[dep-1]; 861cd0c2139SMatthew G Knepley } 862cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 863cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 864cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 865cd0c2139SMatthew G Knepley PetscInt val; 866cd0c2139SMatthew G Knepley 867cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 8684c367dbcSMatthew G. Knepley if (val == dim-1) { 8694c367dbcSMatthew G. Knepley supportNew[q++] = support[e] + depthOffset[dep+1]; 8704c367dbcSMatthew G. Knepley } else if (val == (shift + dim-1)) { 8714c367dbcSMatthew G. Knepley supportNew[q++] = support[e] + depthOffset[dep+1]; 872cd0c2139SMatthew G Knepley } 873cd0c2139SMatthew G Knepley } 874b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 875cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 876cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 877cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 878cd0c2139SMatthew G Knepley PetscInt val, face; 879cd0c2139SMatthew G Knepley 880cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 881cd0c2139SMatthew G Knepley if (val == dim-1) { 8824c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 883cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 8844c367dbcSMatthew G. Knepley supportNew[q++] = face + pMaxNew[dep+1]; 885cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 8864c367dbcSMatthew G. Knepley supportNew[q++] = support[e] + depthOffset[dep+1]; 887cd0c2139SMatthew G Knepley } 888cd0c2139SMatthew G Knepley } 889b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 890cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 8914c367dbcSMatthew G. Knepley /* Hybrid face */ 8924c367dbcSMatthew G. Knepley coneNew[0] = newp; 8934c367dbcSMatthew G. Knepley coneNew[1] = splitp; 8944c367dbcSMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 8954c367dbcSMatthew G. Knepley PetscInt vertex; 8964c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr); 8974c367dbcSMatthew G. Knepley if (vertex < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not a split vertex", support[e]); 8984c367dbcSMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep]; 8994c367dbcSMatthew G. Knepley } 9004c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 9014c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 9024c367dbcSMatthew G. Knepley PetscInt val, face; 9034c367dbcSMatthew G. Knepley 9044c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 9054c367dbcSMatthew G. Knepley if (val == dim-1) { 9064c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 9074c367dbcSMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 9084c367dbcSMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 9094c367dbcSMatthew G. Knepley } 9104c367dbcSMatthew G. Knepley } 9114c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 912cd0c2139SMatthew G Knepley } 913cd0c2139SMatthew G Knepley } 914cd0c2139SMatthew G Knepley } 91518c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 91618c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 91718c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 91818c5995bSMatthew G. Knepley const PetscInt newp = oldp + depthOffset[dep]; 91918c5995bSMatthew G. Knepley const PetscInt *cone, *support, *ornt; 9204c8cfdefSMatthew G. Knepley PetscInt coneSize, supportSize, supportSizeNew, q, qf, e, s; 92118c5995bSMatthew G. Knepley 92218c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 92318c5995bSMatthew G. Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 92418c5995bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 92518c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 92618c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 92718c5995bSMatthew G. Knepley if (dep == 0) { 92818c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 92918c5995bSMatthew G. Knepley 93018c5995bSMatthew G. Knepley /* Unsplit vertex */ 93118c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 93218c5995bSMatthew G. Knepley for (s = 0, q = 0; s < supportSize; ++s) { 93318c5995bSMatthew G. Knepley supportNew[q++] = support[s] + depthOffset[dep+1]; 93418c5995bSMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 93518c5995bSMatthew G. Knepley if (e >= 0) { 93618c5995bSMatthew G. Knepley supportNew[q++] = e + pMaxNew[dep+1]; 93718c5995bSMatthew G. Knepley } 93818c5995bSMatthew G. Knepley } 93918c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 94018c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 94118c5995bSMatthew G. Knepley if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp); 94218c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 94318c5995bSMatthew G. Knepley /* Hybrid edge */ 94418c5995bSMatthew G. Knepley coneNew[0] = newp; 94518c5995bSMatthew G. Knepley coneNew[1] = newp; 94618c5995bSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 94718c5995bSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 94818c5995bSMatthew G. Knepley PetscInt val, edge; 94918c5995bSMatthew G. Knepley 95018c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 95118c5995bSMatthew G. Knepley if (val == 1) { 95218c5995bSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 95318c5995bSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 95418c5995bSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 95518c5995bSMatthew G. Knepley } 95618c5995bSMatthew G. Knepley } 95718c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 958cd0c2139SMatthew G Knepley } 959cd0c2139SMatthew G Knepley } 960cd0c2139SMatthew G Knepley } 961cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 962cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 963cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 964cd0c2139SMatthew G Knepley IS pIS; 965cd0c2139SMatthew G Knepley PetscInt numPoints; 966cd0c2139SMatthew G Knepley const PetscInt *points; 967cd0c2139SMatthew G Knepley 968cd0c2139SMatthew G Knepley if (dep >= 0) continue; 969cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 970cd0c2139SMatthew G Knepley if (!pIS) continue; 971cd0c2139SMatthew G Knepley dep = -dep - shift; 972cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 973cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 974cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 975cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 976cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + oldp; 977cd0c2139SMatthew G Knepley const PetscInt *cone; 978cd0c2139SMatthew G Knepley PetscInt coneSize, c; 97950cf782dSMatthew G. Knepley /* PetscBool replaced = PETSC_FALSE; */ 980cd0c2139SMatthew G Knepley 981cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 982cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 983cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 984cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 985cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 986cd0c2139SMatthew G Knepley const PetscInt coldp = cone[c] - depthOffset[dep-1]; 987cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 988cd0c2139SMatthew G Knepley 989cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 990cd0c2139SMatthew G Knepley if (val == dep-1) { 991cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 992cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 993cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 994cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 99550cf782dSMatthew G. Knepley /* replaced = PETSC_TRUE; */ 996cd0c2139SMatthew G Knepley } 997cd0c2139SMatthew G Knepley } 9984a189a86SMatthew G. Knepley /* Cells with only a vertex or edge on the submesh have no replacement */ 9994a189a86SMatthew G. Knepley /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 1000cd0c2139SMatthew G Knepley } 1001cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 1002cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 1003cd0c2139SMatthew G Knepley } 1004cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 1005cd0c2139SMatthew G Knepley ierr = DMPlexStratify(sdm);CHKERRQ(ierr); 1006cd0c2139SMatthew G Knepley /* Step 8: Coordinates */ 1007cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1008cd0c2139SMatthew G Knepley ierr = DMPlexGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 1009cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 1010cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 1011cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 1012cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[0] + splitPoints[0][v]; 1013cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 1014cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 1015cd0c2139SMatthew G Knepley 1016cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 1017cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 1018cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 1019cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 1020cd0c2139SMatthew G Knepley } 1021cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 1022cd0c2139SMatthew G Knepley /* Step 9: SF, if I can figure this out we can split the mesh in parallel */ 1023cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1024cd0c2139SMatthew G Knepley /* Step 10: Labels */ 1025cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1026cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 1027cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1028cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 1029cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + splitPoints[dep][p]; 1030cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 1031cd0c2139SMatthew G Knepley PetscInt l; 1032cd0c2139SMatthew G Knepley 1033cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 1034cd0c2139SMatthew G Knepley DMLabel mlabel; 1035cd0c2139SMatthew G Knepley const char *lname; 1036cd0c2139SMatthew G Knepley PetscInt val; 10379a356370SMatthew G. Knepley PetscBool isDepth; 1038cd0c2139SMatthew G Knepley 1039cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 10409a356370SMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 10419a356370SMatthew G. Knepley if (isDepth) continue; 1042cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 1043cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 1044cd0c2139SMatthew G Knepley if (val >= 0) { 1045cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 10469a356370SMatthew G. Knepley #if 0 10479a356370SMatthew G. Knepley /* Do not put cohesive edges into the label */ 1048cd0c2139SMatthew G Knepley if (dep == 0) { 10494c367dbcSMatthew G. Knepley const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1050cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr); 10514c367dbcSMatthew G. Knepley } else if (dep == dim-2) { 10524c367dbcSMatthew G. Knepley const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 10534c367dbcSMatthew G. Knepley ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr); 1054cd0c2139SMatthew G Knepley } 10554c367dbcSMatthew G. Knepley /* Do not put cohesive faces into the label */ 10569a356370SMatthew G. Knepley #endif 1057cd0c2139SMatthew G Knepley } 1058cd0c2139SMatthew G Knepley } 1059cd0c2139SMatthew G Knepley } 1060cd0c2139SMatthew G Knepley } 1061cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1062cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 1063cd0c2139SMatthew G Knepley 1064cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 106518c5995bSMatthew G. Knepley if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 106618c5995bSMatthew G. Knepley ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr); 106718c5995bSMatthew G. Knepley if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);} 106818c5995bSMatthew G. Knepley ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr); 1069cd0c2139SMatthew G Knepley } 1070cd0c2139SMatthew G Knepley if (label) { 1071cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1072cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1073cd0c2139SMatthew G Knepley } 10740d4d4d06SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 10750d4d4d06SMatthew G. Knepley ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr); 10760d4d4d06SMatthew G. Knepley pMaxNew[d] = pEnd - numHybridPoints[d]; 10770d4d4d06SMatthew G. Knepley } 10780e49e2e2SMatthew 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); 1079dcbb62e8SMatthew G. Knepley ierr = PetscFree3(depthShift, depthOffset, pMaxNew);CHKERRQ(ierr); 1080dcbb62e8SMatthew G. Knepley ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr); 108118c5995bSMatthew G. Knepley ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr); 1082cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1083cd0c2139SMatthew G Knepley } 1084cd0c2139SMatthew G Knepley 1085cd0c2139SMatthew G Knepley #undef __FUNCT__ 1086cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells" 1087cd0c2139SMatthew G Knepley /*@C 1088cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 1089cd0c2139SMatthew G Knepley 1090cd0c2139SMatthew G Knepley Collective on dm 1091cd0c2139SMatthew G Knepley 1092cd0c2139SMatthew G Knepley Input Parameters: 1093cd0c2139SMatthew G Knepley + dm - The original DM 109453156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated) 1095cd0c2139SMatthew G Knepley 1096cd0c2139SMatthew G Knepley Output Parameters: 1097cd0c2139SMatthew G Knepley - dmSplit - The new DM 1098cd0c2139SMatthew G Knepley 1099cd0c2139SMatthew G Knepley Level: developer 1100cd0c2139SMatthew G Knepley 11012be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 1102cd0c2139SMatthew G Knepley @*/ 1103cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 1104cd0c2139SMatthew G Knepley { 1105cd0c2139SMatthew G Knepley DM sdm; 1106cd0c2139SMatthew G Knepley PetscInt dim; 1107cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1108cd0c2139SMatthew G Knepley 1109cd0c2139SMatthew G Knepley PetscFunctionBegin; 1110cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 111153156dfcSMatthew G. Knepley PetscValidPointer(dmSplit, 3); 1112cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 1113cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 1114cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1115cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(sdm, dim);CHKERRQ(ierr); 1116cd0c2139SMatthew G Knepley switch (dim) { 1117cd0c2139SMatthew G Knepley case 2: 1118cd0c2139SMatthew G Knepley case 3: 1119cd0c2139SMatthew G Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 1120cd0c2139SMatthew G Knepley break; 1121cd0c2139SMatthew G Knepley default: 1122cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 1123cd0c2139SMatthew G Knepley } 1124cd0c2139SMatthew G Knepley *dmSplit = sdm; 1125cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1126cd0c2139SMatthew G Knepley } 1127cd0c2139SMatthew G Knepley 1128cd0c2139SMatthew G Knepley #undef __FUNCT__ 11292be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete" 1130cd0c2139SMatthew G Knepley /*@ 11312be2b188SMatthew G Knepley DMPlexLabelCohesiveComplete - Starting with a label marking vertices on an internal surface, we add all other mesh pieces 1132cd0c2139SMatthew G Knepley to complete the surface 1133cd0c2139SMatthew G Knepley 1134cd0c2139SMatthew G Knepley Input Parameters: 1135cd0c2139SMatthew G Knepley + dm - The DM 113647946fd8SMatthew G. Knepley . label - A DMLabel marking the surface vertices 1137bb55d314SMatthew G. Knepley . flip - Flag to flip the submesh normal and replace points on the other side 113847946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL 1139cd0c2139SMatthew G Knepley 1140cd0c2139SMatthew G Knepley Output Parameter: 1141cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 1142cd0c2139SMatthew G Knepley 1143cd0c2139SMatthew G Knepley Level: developer 1144cd0c2139SMatthew G Knepley 11452be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 1146cd0c2139SMatthew G Knepley @*/ 1147bb55d314SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, PetscBool flip, DM subdm) 1148cd0c2139SMatthew G Knepley { 1149d90583fdSMatthew G. Knepley DMLabel depthLabel; 115018c5995bSMatthew G. Knepley IS dimIS, subpointIS, facePosIS, faceNegIS; 115147946fd8SMatthew G. Knepley const PetscInt *points, *subpoints; 1152bb55d314SMatthew G. Knepley const PetscInt rev = flip ? -1 : 1; 115318c5995bSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, dim, dep, cStart, cEnd, numPoints, numSubpoints, p, val; 1154cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1155cd0c2139SMatthew G Knepley 1156cd0c2139SMatthew G Knepley PetscFunctionBegin; 1157d90583fdSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 1158cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 115947946fd8SMatthew G. Knepley if (subdm) { 116047946fd8SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 116147946fd8SMatthew G. Knepley if (subpointIS) { 116247946fd8SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 116347946fd8SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 116447946fd8SMatthew G. Knepley } 116547946fd8SMatthew G. Knepley } 1166d7c8f101SMatthew G. Knepley /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */ 1167cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 1168cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1169cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1170cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1171d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */ 1172cd0c2139SMatthew G Knepley const PetscInt *support; 1173cd0c2139SMatthew G Knepley PetscInt supportSize, s; 1174cd0c2139SMatthew G Knepley 1175cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1176cd0c2139SMatthew G Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 1177cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1178cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1179cd0c2139SMatthew G Knepley const PetscInt *cone, *ornt; 1180cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1181cd0c2139SMatthew G Knepley PetscBool pos = PETSC_TRUE; 1182cd0c2139SMatthew G Knepley 1183cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1184cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1185cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 1186cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1187cd0c2139SMatthew G Knepley if (cone[c] == points[p]) { 118847946fd8SMatthew G. Knepley PetscInt o = ornt[c]; 118947946fd8SMatthew G. Knepley 119047946fd8SMatthew G. Knepley if (subdm) { 119147946fd8SMatthew G. Knepley const PetscInt *subcone, *subornt; 119247946fd8SMatthew G. Knepley PetscInt subpoint, subface, subconeSize, sc; 119347946fd8SMatthew G. Knepley 119447946fd8SMatthew G. Knepley ierr = PetscFindInt(support[s], numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 119547946fd8SMatthew G. Knepley ierr = PetscFindInt(points[p], numSubpoints, subpoints, &subface);CHKERRQ(ierr); 119647946fd8SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 119747946fd8SMatthew G. Knepley ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 119847946fd8SMatthew G. Knepley ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 119947946fd8SMatthew G. Knepley for (sc = 0; sc < subconeSize; ++sc) { 120047946fd8SMatthew G. Knepley if (subcone[sc] == subface) { 120147946fd8SMatthew G. Knepley o = subornt[0]; 120247946fd8SMatthew G. Knepley break; 120347946fd8SMatthew G. Knepley } 120447946fd8SMatthew G. Knepley } 120547946fd8SMatthew 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); 120647946fd8SMatthew G. Knepley } 120747946fd8SMatthew G. Knepley if (o >= 0) { 1208bb55d314SMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr); 1209ffaa4bbcSMatthew G. Knepley pos = rev > 0 ? PETSC_TRUE : PETSC_FALSE; 1210cd0c2139SMatthew G Knepley } else { 1211bb55d314SMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr); 1212ffaa4bbcSMatthew G. Knepley pos = rev > 0 ? PETSC_FALSE : PETSC_TRUE; 1213cd0c2139SMatthew G Knepley } 1214cd0c2139SMatthew G Knepley break; 1215cd0c2139SMatthew G Knepley } 1216cd0c2139SMatthew G Knepley } 1217cd0c2139SMatthew 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]); 1218cd0c2139SMatthew G Knepley /* Put faces touching the fault in the label */ 1219cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1220cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 1221cd0c2139SMatthew G Knepley 1222cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1223cd0c2139SMatthew G Knepley if (val == -1) { 1224cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 1225cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 1226cd0c2139SMatthew G Knepley 1227cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1228cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1229cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 1230cd0c2139SMatthew G Knepley 1231cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1232cd0c2139SMatthew G Knepley if ((val >= 0) && (val < dim-1)) { 1233cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1234cd0c2139SMatthew G Knepley break; 1235cd0c2139SMatthew G Knepley } 1236cd0c2139SMatthew G Knepley } 1237cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1238cd0c2139SMatthew G Knepley } 1239cd0c2139SMatthew G Knepley } 1240cd0c2139SMatthew G Knepley } 1241cd0c2139SMatthew G Knepley } 124247946fd8SMatthew G. Knepley if (subdm) { 124347946fd8SMatthew G. Knepley if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 124447946fd8SMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 124547946fd8SMatthew G. Knepley } 1246cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1247cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1248cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1249cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1250cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 1251cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1252cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1253cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1254d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */ 1255cd0c2139SMatthew G Knepley PetscInt *star = NULL; 1256cd0c2139SMatthew G Knepley PetscInt starSize, s; 1257cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1258cd0c2139SMatthew G Knepley 1259d4622b2cSMatthew G. Knepley /* All points connected to the fault are inside a cell, so at the top level we will only check cells */ 1260cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1261cd0c2139SMatthew G Knepley while (again) { 1262cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1263cd0c2139SMatthew G Knepley again = 0; 1264cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1265cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1266cd0c2139SMatthew G Knepley const PetscInt *cone; 1267cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1268cd0c2139SMatthew G Knepley 1269cd0c2139SMatthew G Knepley if ((point < cStart) || (point >= cEnd)) continue; 1270cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1271cd0c2139SMatthew G Knepley if (val != -1) continue; 1272d4622b2cSMatthew G. Knepley again = again == 1 ? 1 : 2; 1273cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1274cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1275cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1276cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1277cd0c2139SMatthew G Knepley if (val != -1) { 1278d7c8f101SMatthew G. Knepley const PetscInt *ccone; 1279166d9d0cSMatthew G. Knepley PetscInt cconeSize, cc, side; 1280d7c8f101SMatthew G. Knepley 1281cd0c2139SMatthew 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); 128237a6de01SMatthew G. Knepley if (val > 0) side = 1; 128337a6de01SMatthew G. Knepley else side = -1; 128437a6de01SMatthew G. Knepley ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr); 1285d7c8f101SMatthew G. Knepley /* Mark cell faces which touch the fault */ 1286d7c8f101SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr); 1287d7c8f101SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr); 1288d7c8f101SMatthew G. Knepley for (cc = 0; cc < cconeSize; ++cc) { 1289d7c8f101SMatthew G. Knepley PetscInt *closure = NULL; 1290d7c8f101SMatthew G. Knepley PetscInt closureSize, cl; 1291d7c8f101SMatthew G. Knepley 1292166d9d0cSMatthew G. Knepley ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr); 1293166d9d0cSMatthew G. Knepley if (val != -1) continue; 1294d7c8f101SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1295d4622b2cSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1296d7c8f101SMatthew G. Knepley const PetscInt clp = closure[cl]; 1297d7c8f101SMatthew G. Knepley 1298d7c8f101SMatthew G. Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1299d7c8f101SMatthew G. Knepley if (val == -1) continue; 1300d7c8f101SMatthew G. Knepley ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr); 130137a6de01SMatthew G. Knepley break; 130237a6de01SMatthew G. Knepley } 1303d7c8f101SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1304cd0c2139SMatthew G Knepley } 1305cd0c2139SMatthew G Knepley again = 1; 1306cd0c2139SMatthew G Knepley break; 1307cd0c2139SMatthew G Knepley } 1308cd0c2139SMatthew G Knepley } 1309cd0c2139SMatthew G Knepley } 1310cd0c2139SMatthew G Knepley } 1311cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1312cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1313cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1314cd0c2139SMatthew G Knepley 1315cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1316cd0c2139SMatthew G Knepley if (val == -1) { 1317cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1318cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1319cd0c2139SMatthew G Knepley PetscBool marked = PETSC_FALSE; 1320cd0c2139SMatthew G Knepley 1321cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1322cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1323cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1324cd0c2139SMatthew G Knepley 1325cd0c2139SMatthew G Knepley if ((spoint < cStart) || (spoint >= cEnd)) continue; 1326cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1327cd0c2139SMatthew 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); 1328d90583fdSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1329cd0c2139SMatthew G Knepley if (val > 0) { 1330cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1331cd0c2139SMatthew G Knepley } else { 1332cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1333cd0c2139SMatthew G Knepley } 1334cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1335cd0c2139SMatthew G Knepley break; 1336cd0c2139SMatthew G Knepley } 1337cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1338cd0c2139SMatthew G Knepley if (!marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1339cd0c2139SMatthew G Knepley } 1340cd0c2139SMatthew G Knepley } 1341cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1342cd0c2139SMatthew G Knepley } 1343cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1344cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 134518c5995bSMatthew G. Knepley /* If any faces touching the fault divide cells on either side, split them */ 134618c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift+dim-1, &facePosIS);CHKERRQ(ierr); 134718c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr); 134818c5995bSMatthew G. Knepley ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr); 134918c5995bSMatthew G. Knepley ierr = ISDestroy(&facePosIS);CHKERRQ(ierr); 135018c5995bSMatthew G. Knepley ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr); 135118c5995bSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 135218c5995bSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 135318c5995bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 135418c5995bSMatthew G. Knepley const PetscInt point = points[p]; 135518c5995bSMatthew G. Knepley const PetscInt *support; 135618c5995bSMatthew G. Knepley PetscInt supportSize, valA, valB; 135718c5995bSMatthew G. Knepley 135818c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 135918c5995bSMatthew G. Knepley if (supportSize != 2) continue; 136018c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 136118c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr); 136218c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr); 136318c5995bSMatthew G. Knepley if ((valA == -1) || (valB == -1)) continue; 136418c5995bSMatthew G. Knepley if (valA*valB > 0) continue; 136518c5995bSMatthew G. Knepley /* Split the face */ 136618c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr); 136718c5995bSMatthew G. Knepley ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr); 136818c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr); 136918c5995bSMatthew G. Knepley /* Label its closure as unsplit */ 137018c5995bSMatthew G. Knepley { 137118c5995bSMatthew G. Knepley PetscInt *closure = NULL; 137218c5995bSMatthew G. Knepley PetscInt closureSize, cl; 137318c5995bSMatthew G. Knepley 137418c5995bSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 137518c5995bSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 137618c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr); 137718c5995bSMatthew G. Knepley if (valA != -1) continue; 137818c5995bSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 137918c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr); 138018c5995bSMatthew G. Knepley } 138118c5995bSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 138218c5995bSMatthew G. Knepley } 138318c5995bSMatthew G. Knepley } 138418c5995bSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 138518c5995bSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1386cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1387cd0c2139SMatthew G Knepley } 1388cd0c2139SMatthew G Knepley 1389cd0c2139SMatthew G Knepley #undef __FUNCT__ 13903cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh" 13913cf72582SMatthew G. Knepley /*@C 13923cf72582SMatthew G. Knepley DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface 13933cf72582SMatthew G. Knepley 13943cf72582SMatthew G. Knepley Collective on dm 13953cf72582SMatthew G. Knepley 13963cf72582SMatthew G. Knepley Input Parameters: 13973cf72582SMatthew G. Knepley + dm - The original DM 13983cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices 13993cf72582SMatthew G. Knepley 14003cf72582SMatthew G. Knepley Output Parameters: 14013cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface 14023cf72582SMatthew G. Knepley - dmHybrid - The new DM 14033cf72582SMatthew G. Knepley 14043cf72582SMatthew G. Knepley Level: developer 14053cf72582SMatthew G. Knepley 14063cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate() 14073cf72582SMatthew G. Knepley @*/ 14083cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid) 14093cf72582SMatthew G. Knepley { 14103cf72582SMatthew G. Knepley DM idm; 14113cf72582SMatthew G. Knepley DMLabel subpointMap, hlabel; 14123cf72582SMatthew G. Knepley PetscInt dim; 14133cf72582SMatthew G. Knepley PetscErrorCode ierr; 14143cf72582SMatthew G. Knepley 14153cf72582SMatthew G. Knepley PetscFunctionBegin; 14163cf72582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 14173cf72582SMatthew G. Knepley if (hybridLabel) PetscValidPointer(hybridLabel, 3); 14183cf72582SMatthew G. Knepley PetscValidPointer(dmHybrid, 4); 14193cf72582SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 14203cf72582SMatthew G. Knepley ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr); 14213cf72582SMatthew G. Knepley ierr = DMPlexOrient(idm);CHKERRQ(ierr); 14223cf72582SMatthew G. Knepley ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr); 14233cf72582SMatthew G. Knepley ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr); 14243cf72582SMatthew G. Knepley ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr); 14253cf72582SMatthew G. Knepley ierr = DMPlexLabelCohesiveComplete(dm, hlabel, PETSC_FALSE, idm);CHKERRQ(ierr); 14263cf72582SMatthew G. Knepley ierr = DMDestroy(&idm);CHKERRQ(ierr); 14273cf72582SMatthew G. Knepley ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr); 14283cf72582SMatthew G. Knepley if (hybridLabel) *hybridLabel = hlabel; 142953aa2e23SMatthew G. Knepley else {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);} 1430e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1431e6ccafaeSMatthew G Knepley } 1432e6ccafaeSMatthew G Knepley 1433e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1434efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated" 1435efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 1436efa14ee0SMatthew G Knepley 1437efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 1438efa14ee0SMatthew G Knepley */ 1439830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1440efa14ee0SMatthew G Knepley { 1441fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 1442efa14ee0SMatthew G Knepley const PetscInt *subvertices; 144377d178adSMatthew G. Knepley PetscInt *pStart, *pEnd, *pMax, pSize; 1444efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1445efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1446efa14ee0SMatthew G Knepley 1447efa14ee0SMatthew G Knepley PetscFunctionBegin; 1448efa14ee0SMatthew G Knepley *numFaces = 0; 1449efa14ee0SMatthew G Knepley *nFV = 0; 1450efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1451efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 145277d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1453*dcca6d9dSJed Brown ierr = PetscMalloc3(pSize,&pStart,pSize,&pEnd,pSize,&pMax);CHKERRQ(ierr); 1454d92e47f8SMatthew 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); 1455efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 1456efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1457efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1458efa14ee0SMatthew G Knepley } 1459efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1460fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1461efa14ee0SMatthew G Knepley if (subvertexIS) { 1462efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1463efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1464efa14ee0SMatthew G Knepley } 1465efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1466efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 14670298fd71SBarry Smith PetscInt *star = NULL; 1468efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 1469efa14ee0SMatthew G Knepley 1470efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1471efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1472efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1473efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1474efa14ee0SMatthew G Knepley } 1475efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 1476efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 14770298fd71SBarry Smith PetscInt *closure = NULL; 1478efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 1479efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 1480efa14ee0SMatthew G Knepley 1481efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 148265560c7fSMatthew G Knepley if (cellLoc == 2) continue; 148382f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1484efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1485efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1486efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1487efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1488efa14ee0SMatthew G Knepley 1489efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1490efa14ee0SMatthew G Knepley ++numCorners; 1491efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1492830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 1493efa14ee0SMatthew G Knepley } 1494efa14ee0SMatthew G Knepley } 149518ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 149682f516ccSBarry 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); 1497efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 1498007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 1499007baee2SMatthew G. Knepley PetscInt numCells, nc; 1500007baee2SMatthew G. Knepley 1501efa14ee0SMatthew G Knepley ++(*numFaces); 1502efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 1503efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 1504efa14ee0SMatthew G Knepley } 1505007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1506007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 1507007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 1508007baee2SMatthew G. Knepley } 1509007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1510efa14ee0SMatthew G Knepley } 1511efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1512efa14ee0SMatthew G Knepley } 1513efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1514efa14ee0SMatthew G Knepley } 1515efa14ee0SMatthew G Knepley if (subvertexIS) { 1516efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1517efa14ee0SMatthew G Knepley } 1518efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1519efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1520efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1521efa14ee0SMatthew G Knepley } 1522efa14ee0SMatthew G Knepley 1523efa14ee0SMatthew G Knepley #undef __FUNCT__ 1524efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated" 1525830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 1526efa14ee0SMatthew G Knepley { 1527efa14ee0SMatthew G Knepley IS subvertexIS; 1528efa14ee0SMatthew G Knepley const PetscInt *subvertices; 1529efa14ee0SMatthew G Knepley PetscInt *pStart, *pEnd, *pMax; 1530efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 1531efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1532efa14ee0SMatthew G Knepley 1533efa14ee0SMatthew G Knepley PetscFunctionBegin; 1534efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1535*dcca6d9dSJed Brown ierr = PetscMalloc3(dim+1,&pStart,dim+1,&pEnd,dim+1,&pMax);CHKERRQ(ierr); 15360298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1537efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 1538efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1539efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1540efa14ee0SMatthew G Knepley } 1541efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1542830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 1543efa14ee0SMatthew G Knepley if (subvertexIS) { 1544efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1545efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1546efa14ee0SMatthew G Knepley } 1547efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1548efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 15490298fd71SBarry Smith PetscInt *star = NULL; 1550efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 1551efa14ee0SMatthew G Knepley 1552efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1553efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1554efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1555efa14ee0SMatthew G Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 1556efa14ee0SMatthew G Knepley } 1557efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 1558efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 15590298fd71SBarry Smith PetscInt *closure = NULL; 1560efa14ee0SMatthew G Knepley PetscInt closureSize, c; 1561efa14ee0SMatthew G Knepley PetscInt faceLoc; 1562efa14ee0SMatthew G Knepley 1563efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 1564efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 156582f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 1566efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1567efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1568efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1569efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1570efa14ee0SMatthew G Knepley 1571efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1572efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1573830e53efSMatthew G. Knepley if (vertexLoc != value) break; 1574efa14ee0SMatthew G Knepley } 1575efa14ee0SMatthew G Knepley } 1576efa14ee0SMatthew G Knepley if (c == closureSize*2) { 1577efa14ee0SMatthew G Knepley const PetscInt *support; 1578efa14ee0SMatthew G Knepley PetscInt supportSize, s; 1579efa14ee0SMatthew G Knepley 1580efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1581efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1582efa14ee0SMatthew G Knepley 1583efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 1584efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1585efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1586efa14ee0SMatthew G Knepley break; 1587efa14ee0SMatthew G Knepley } 1588efa14ee0SMatthew G Knepley } 1589efa14ee0SMatthew G Knepley } 1590efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 1591efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 1592efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1593efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1594efa14ee0SMatthew G Knepley } 1595efa14ee0SMatthew G Knepley } 1596efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1597efa14ee0SMatthew G Knepley } 1598efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1599efa14ee0SMatthew G Knepley } 1600efa14ee0SMatthew G Knepley if (subvertexIS) { 1601efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1602efa14ee0SMatthew G Knepley } 1603efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1604efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1605efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1606efa14ee0SMatthew G Knepley } 1607efa14ee0SMatthew G Knepley 1608efa14ee0SMatthew G Knepley #undef __FUNCT__ 1609766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated" 161027c04023SMatthew 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) 1611766ab985SMatthew G. Knepley { 161227c04023SMatthew G. Knepley DMLabel label = NULL; 1613766ab985SMatthew G. Knepley const PetscInt *cone; 161427234c99SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize; 1615766ab985SMatthew G. Knepley PetscErrorCode ierr; 1616766ab985SMatthew G. Knepley 1617812bfc34SJed Brown PetscFunctionBegin; 1618c0ed958bSJed Brown *numFaces = 0; 1619c0ed958bSJed Brown *nFV = 0; 1620b6d5cb33SJed Brown if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1621fed694aaSMatthew G. Knepley *subCells = NULL; 1622766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1623766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1624766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1625766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 162627c04023SMatthew G. Knepley if (label) { 162727c04023SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 162827c04023SMatthew G. Knepley PetscInt val; 162927c04023SMatthew G. Knepley 163027c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 163127c04023SMatthew G. Knepley if (val == value) { 163227c04023SMatthew G. Knepley ++(*numFaces); 163327c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 163427c04023SMatthew G. Knepley } 163527c04023SMatthew G. Knepley } 163627c04023SMatthew G. Knepley } else { 1637766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 163827c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 163927c04023SMatthew G. Knepley } 1640766ab985SMatthew G. Knepley *nFV = hasLagrange ? coneSize/3 : coneSize/2; 1641766ab985SMatthew G. Knepley ierr = PetscMalloc(*numFaces *2 * sizeof(PetscInt), subCells);CHKERRQ(ierr); 1642766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1643766ab985SMatthew G. Knepley const PetscInt *cells; 1644766ab985SMatthew G. Knepley PetscInt numCells; 1645766ab985SMatthew G. Knepley 164627c04023SMatthew G. Knepley if (label) { 164727c04023SMatthew G. Knepley PetscInt val; 164827c04023SMatthew G. Knepley 164927c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 165027c04023SMatthew G. Knepley if (val != value) continue; 165127c04023SMatthew G. Knepley } 1652766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1653766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 1654766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 1655766ab985SMatthew G. Knepley } 1656766ab985SMatthew G. Knepley /* Negative face */ 1657766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 165827234c99SMatthew G. Knepley /* Not true in parallel 165927234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 1660766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 1661766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 166227234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 1663766ab985SMatthew G. Knepley } 1664766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 1665766ab985SMatthew G. Knepley /* Positive face is not included */ 1666766ab985SMatthew G. Knepley } 1667766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1668766ab985SMatthew G. Knepley } 1669766ab985SMatthew G. Knepley 1670766ab985SMatthew G. Knepley #undef __FUNCT__ 1671766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated" 1672b3154360SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DMLabel subpointMap, DM subdm) 1673766ab985SMatthew G. Knepley { 167427c04023SMatthew G. Knepley DMLabel label = NULL; 1675766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 1676766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 1677766ab985SMatthew G. Knepley PetscErrorCode ierr; 1678766ab985SMatthew G. Knepley 1679812bfc34SJed Brown PetscFunctionBegin; 168027c04023SMatthew G. Knepley if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1681766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1682766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1683766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1684766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 1685*dcca6d9dSJed Brown ierr = PetscMalloc2(dim+1,&pStart,dim+1,&pEnd);CHKERRQ(ierr); 1686b3154360SMatthew G. Knepley for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);} 1687766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1688766ab985SMatthew G. Knepley const PetscInt *cone; 1689766ab985SMatthew G. Knepley PetscInt *closure = NULL; 1690b3154360SMatthew G. Knepley PetscInt fconeSize, coneSize, closureSize, cl, val; 1691766ab985SMatthew G. Knepley 169227c04023SMatthew G. Knepley if (label) { 169327c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 169427c04023SMatthew G. Knepley if (val != value) continue; 169527c04023SMatthew G. Knepley } 1696766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 1697766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1698b3154360SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr); 1699b3154360SMatthew G. Knepley if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 1700b3154360SMatthew G. Knepley /* Negative face */ 1701766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1702766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1703766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 1704766ab985SMatthew G. Knepley 1705766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 1706766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1707766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1708766ab985SMatthew G. Knepley break; 1709766ab985SMatthew G. Knepley } 1710766ab985SMatthew G. Knepley } 1711766ab985SMatthew G. Knepley } 1712766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1713766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 1714766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 1715766ab985SMatthew G. Knepley const PetscInt *support; 1716766ab985SMatthew G. Knepley PetscInt supportSize, s; 1717766ab985SMatthew G. Knepley 1718766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 1719766ab985SMatthew G. Knepley if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); 1720766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 1721766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 1722766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1723766ab985SMatthew G. Knepley } 1724766ab985SMatthew G. Knepley } 1725766ab985SMatthew G. Knepley } 1726766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 1727766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1728766ab985SMatthew G. Knepley } 1729766ab985SMatthew G. Knepley 1730766ab985SMatthew G. Knepley #undef __FUNCT__ 1731e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation" 1732e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 1733e6ccafaeSMatthew G Knepley { 173482f516ccSBarry Smith MPI_Comm comm; 1735e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 1736e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 1737e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 1738e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1739e6ccafaeSMatthew G Knepley 174082f516ccSBarry Smith PetscFunctionBegin; 174182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1742e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &cellDim);CHKERRQ(ierr); 1743e6ccafaeSMatthew G Knepley if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 1744e6ccafaeSMatthew G Knepley 1745ddeab2a6SMatthew G. Knepley if (cellDim == 1 && numCorners == 2) { 1746ddeab2a6SMatthew G. Knepley /* Triangle */ 1747e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 1748e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1749ddeab2a6SMatthew G. Knepley } else if (cellDim == 2 && numCorners == 3) { 1750ddeab2a6SMatthew G. Knepley /* Triangle */ 1751ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 1752ddeab2a6SMatthew G. Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1753ddeab2a6SMatthew G. Knepley } else if (cellDim == 3 && numCorners == 4) { 1754ddeab2a6SMatthew G. Knepley /* Tetrahedron */ 1755ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 1756ddeab2a6SMatthew G. Knepley posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1757e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 1758e6ccafaeSMatthew G Knepley /* Quadratic line */ 1759e6ccafaeSMatthew G Knepley faceSize = 1; 1760e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1761e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 1762e6ccafaeSMatthew G Knepley /* Quads */ 1763e6ccafaeSMatthew G Knepley faceSize = 2; 1764e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 1765e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1766e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 1767e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1768e6ccafaeSMatthew G Knepley } else { 1769e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 1770e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 1771e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 1772e6ccafaeSMatthew G Knepley } 1773e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 1774e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 1775e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 1776e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 1777e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 1778e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1779e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 1780e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 1781e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 1782e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 1783e6ccafaeSMatthew G Knepley }; 1784e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 1785e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 1786e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 1787e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 1788e6ccafaeSMatthew G Knepley }; 1789e6ccafaeSMatthew G Knepley 1790e6ccafaeSMatthew G Knepley faceSize = faceSizeTri; 1791e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 1792e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 1793e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 1794e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 1795e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1796e6ccafaeSMatthew G Knepley 1797e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 1798e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 1799e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 1800e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 1801e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 1802e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1803e6ccafaeSMatthew G Knepley break; 1804e6ccafaeSMatthew G Knepley } 1805e6ccafaeSMatthew G Knepley } 1806e6ccafaeSMatthew G Knepley } 1807e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1808e6ccafaeSMatthew G Knepley break; 1809e6ccafaeSMatthew G Knepley } 1810e6ccafaeSMatthew G Knepley } 1811e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 1812e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1813e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1814e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 1815e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 1816e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 1817e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 1818e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 1819e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1820e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 1821e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 1822e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 1823e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 1824e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 1825e6ccafaeSMatthew G Knepley }; 1826e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 1827e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 1828e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 1829e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 1830e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 1831e6ccafaeSMatthew G Knepley }; 1832e6ccafaeSMatthew G Knepley 1833e6ccafaeSMatthew G Knepley faceSize = faceSizeQuad; 1834e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 1835e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 1836e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 1837e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 1838e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1839e6ccafaeSMatthew G Knepley 1840e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 1841e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 1842e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 1843e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 1844e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 1845e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1846e6ccafaeSMatthew G Knepley break; 1847e6ccafaeSMatthew G Knepley } 1848e6ccafaeSMatthew G Knepley } 1849e6ccafaeSMatthew G Knepley } 1850e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1851e6ccafaeSMatthew G Knepley break; 1852e6ccafaeSMatthew G Knepley } 1853e6ccafaeSMatthew G Knepley } 1854e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 1855e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1856e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1857e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 1858e6ccafaeSMatthew G Knepley /* Hexes 1859e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 1860e6ccafaeSMatthew G Knepley pointing up at the second. 1861e6ccafaeSMatthew G Knepley 1862e6ccafaeSMatthew G Knepley 7---6 1863e6ccafaeSMatthew G Knepley /| /| 1864e6ccafaeSMatthew G Knepley 4---5 | 1865ddeab2a6SMatthew G. Knepley | 1-|-2 1866e6ccafaeSMatthew G Knepley |/ |/ 1867ddeab2a6SMatthew G. Knepley 0---3 1868e6ccafaeSMatthew G Knepley 1869e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 1870e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 1871e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 1872e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1873e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 1874e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 1875e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 1876ddeab2a6SMatthew G. Knepley 0, 3, 4, 5, /* front */ 1877ddeab2a6SMatthew G. Knepley 2, 3, 5, 6, /* right */ 1878ddeab2a6SMatthew G. Knepley 1, 2, 6, 7, /* back */ 1879ddeab2a6SMatthew G. Knepley 0, 1, 4, 7, /* left */ 1880e6ccafaeSMatthew G Knepley }; 1881e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 1882ddeab2a6SMatthew G. Knepley 1, 2, 3, 0, /* bottom */ 1883e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 1884ddeab2a6SMatthew G. Knepley 0, 3, 5, 4, /* front */ 1885ddeab2a6SMatthew G. Knepley 3, 2, 6, 5, /* right */ 1886ddeab2a6SMatthew G. Knepley 2, 1, 7, 6, /* back */ 1887ddeab2a6SMatthew G. Knepley 1, 0, 4, 7, /* left */ 1888e6ccafaeSMatthew G Knepley }; 1889e6ccafaeSMatthew G Knepley 1890e6ccafaeSMatthew G Knepley faceSize = faceSizeHex; 1891e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 1892e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 1893e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 1894e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 1895e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1896e6ccafaeSMatthew G Knepley 1897e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 1898e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 1899e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 1900e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 1901e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 1902e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 1903e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 1904e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1905e6ccafaeSMatthew G Knepley break; 1906e6ccafaeSMatthew G Knepley } 1907e6ccafaeSMatthew G Knepley } 1908e6ccafaeSMatthew G Knepley } 1909e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1910e6ccafaeSMatthew G Knepley break; 1911e6ccafaeSMatthew G Knepley } 1912e6ccafaeSMatthew G Knepley } 1913e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 1914e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1915e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1916e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 1917e6ccafaeSMatthew G Knepley /* Quadratic tet */ 1918e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 1919e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 1920e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 1921e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1922e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 1923e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 1924e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 1925e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 1926e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 1927e6ccafaeSMatthew G Knepley }; 1928e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 1929e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 1930e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 1931e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 1932e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 1933e6ccafaeSMatthew G Knepley }; 1934e6ccafaeSMatthew G Knepley 1935e6ccafaeSMatthew G Knepley faceSize = faceSizeTet; 1936e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 1937e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 1938e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 1939e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 1940e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1941e6ccafaeSMatthew G Knepley 1942e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 1943e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 1944e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 1945e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 1946e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 1947e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 1948e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 1949e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1950e6ccafaeSMatthew G Knepley break; 1951e6ccafaeSMatthew G Knepley } 1952e6ccafaeSMatthew G Knepley } 1953e6ccafaeSMatthew G Knepley } 1954e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1955e6ccafaeSMatthew G Knepley break; 1956e6ccafaeSMatthew G Knepley } 1957e6ccafaeSMatthew G Knepley } 1958e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 1959e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1960e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1961e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 1962e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 1963e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 1964e6ccafaeSMatthew G Knepley pointing up at the second. 1965e6ccafaeSMatthew G Knepley 1966e6ccafaeSMatthew G Knepley 7---6 1967e6ccafaeSMatthew G Knepley /| /| 1968e6ccafaeSMatthew G Knepley 4---5 | 1969e6ccafaeSMatthew G Knepley | 3-|-2 1970e6ccafaeSMatthew G Knepley |/ |/ 1971e6ccafaeSMatthew G Knepley 0---1 1972e6ccafaeSMatthew G Knepley 1973e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 1974e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 1975e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 1976e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1977e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 1978e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 1979e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 1980e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 1981e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 1982e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 1983e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 1984e6ccafaeSMatthew G Knepley }; 1985e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 1986e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 1987e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 1988e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 1989e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 1990e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 1991e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 1992e6ccafaeSMatthew G Knepley }; 1993e6ccafaeSMatthew G Knepley 1994e6ccafaeSMatthew G Knepley faceSize = faceSizeQuadHex; 1995e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 1996e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 1997e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 1998e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 1999e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2000e6ccafaeSMatthew G Knepley 2001e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 2002e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 2003e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 2004e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 2005e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 2006e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 2007e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 2008e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2009e6ccafaeSMatthew G Knepley break; 2010e6ccafaeSMatthew G Knepley } 2011e6ccafaeSMatthew G Knepley } 2012e6ccafaeSMatthew G Knepley } 2013e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2014e6ccafaeSMatthew G Knepley break; 2015e6ccafaeSMatthew G Knepley } 2016e6ccafaeSMatthew G Knepley } 2017e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2018e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2019e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2020e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 2021e6ccafaeSMatthew G Knepley if (!posOrient) { 2022e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 2023e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 2024e6ccafaeSMatthew G Knepley } else { 2025e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 2026e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 2027e6ccafaeSMatthew G Knepley } 2028e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 2029e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2030e6ccafaeSMatthew G Knepley } 2031e6ccafaeSMatthew G Knepley 2032e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2033e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace" 2034e6ccafaeSMatthew G Knepley /* 2035e6ccafaeSMatthew G Knepley Given a cell and a face, as a set of vertices, 2036e6ccafaeSMatthew G Knepley return the oriented face, as a set of vertices, in faceVertices 2037e6ccafaeSMatthew G Knepley The orientation is such that the face normal points out of the cell 2038e6ccafaeSMatthew G Knepley */ 2039e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2040e6ccafaeSMatthew G Knepley { 20410298fd71SBarry Smith const PetscInt *cone = NULL; 2042e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 2043e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 2044e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2045e6ccafaeSMatthew G Knepley 2046e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2047e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 2048e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 2049e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 2050e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2051e6ccafaeSMatthew G Knepley 2052e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 2053e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 2054e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 2055e6ccafaeSMatthew G Knepley } 2056e6ccafaeSMatthew G Knepley } 2057e6ccafaeSMatthew G Knepley if (found) { 2058e6ccafaeSMatthew G Knepley indices[v2] = v; 2059e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 2060e6ccafaeSMatthew G Knepley ++v2; 2061e6ccafaeSMatthew G Knepley } else { 2062e6ccafaeSMatthew G Knepley oppositeVertex = v; 2063e6ccafaeSMatthew G Knepley } 2064e6ccafaeSMatthew G Knepley } 2065e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 2066e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2067e6ccafaeSMatthew G Knepley } 2068e6ccafaeSMatthew G Knepley 2069e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2070cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal" 2071e6ccafaeSMatthew G Knepley /* 2072cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 2073e6ccafaeSMatthew G Knepley 2074e6ccafaeSMatthew G Knepley Not collective 2075e6ccafaeSMatthew G Knepley 2076e6ccafaeSMatthew G Knepley Input Parameters: 2077e6ccafaeSMatthew G Knepley + dm - The DMPlex 2078e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 2079e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 2080e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 2081e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 2082e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 2083e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 2084e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 2085e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 2086e6ccafaeSMatthew G Knepley 2087e6ccafaeSMatthew G Knepley Output Parameters: 2088e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 2089e6ccafaeSMatthew G Knepley 2090e6ccafaeSMatthew G Knepley Level: developer 2091e6ccafaeSMatthew G Knepley */ 2092cd0c2139SMatthew 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) 2093e6ccafaeSMatthew G Knepley { 209482f516ccSBarry Smith MPI_Comm comm; 2095e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 2096e6ccafaeSMatthew G Knepley const PetscInt *faces; 2097e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 2098e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2099e6ccafaeSMatthew G Knepley 2100e6ccafaeSMatthew G Knepley PetscFunctionBegin; 210182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2102e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 2103e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 2104e6ccafaeSMatthew G Knepley #if 0 2105e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 2106e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2107e6ccafaeSMatthew G Knepley #else 2108e6ccafaeSMatthew G Knepley { 2109e6ccafaeSMatthew G Knepley PetscInt f; 2110e6ccafaeSMatthew G Knepley 2111e6ccafaeSMatthew G Knepley numFaces = 0; 2112e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2113e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 2114e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 2115e6ccafaeSMatthew G Knepley 2116e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 2117e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 2118e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 2119e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 2120e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 2121e6ccafaeSMatthew G Knepley PetscInt v; 2122e6ccafaeSMatthew G Knepley 2123e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2124e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 2125e6ccafaeSMatthew G Knepley } 2126e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 2127e6ccafaeSMatthew G Knepley } 2128e6ccafaeSMatthew G Knepley if (d == dof) { 2129e6ccafaeSMatthew G Knepley numFaces = 1; 2130e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 2131e6ccafaeSMatthew G Knepley } 2132e6ccafaeSMatthew G Knepley } 2133e6ccafaeSMatthew G Knepley } 2134e6ccafaeSMatthew G Knepley #endif 2135e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 2136e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 2137e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 2138766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 2139e6ccafaeSMatthew G Knepley } else { 2140e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 2141e6ccafaeSMatthew G Knepley PetscBool posOriented; 2142e6ccafaeSMatthew G Knepley 2143e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2144e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 2145e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 2146e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 2147e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 2148e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 2149e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2150e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 2151e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 2152e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 2153e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 2154e6ccafaeSMatthew G Knepley break; 2155e6ccafaeSMatthew G Knepley } 2156e6ccafaeSMatthew G Knepley } 2157e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 2158e6ccafaeSMatthew G Knepley } 2159e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 2160e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 2161e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2162e6ccafaeSMatthew G Knepley ++(*newFacePoint); 2163e6ccafaeSMatthew G Knepley } 2164ef07cca7SMatthew G. Knepley #if 0 2165e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2166ef07cca7SMatthew G. Knepley #else 2167ef07cca7SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2168ef07cca7SMatthew G. Knepley #endif 2169e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2170e6ccafaeSMatthew G Knepley } 2171e6ccafaeSMatthew G Knepley 2172e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2173e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated" 217453156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2175e6ccafaeSMatthew G Knepley { 217682f516ccSBarry Smith MPI_Comm comm; 217753156dfcSMatthew G. Knepley DMLabel subpointMap; 2178efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 2179efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 2180efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 2181fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 2182efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 2183e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2184e6ccafaeSMatthew G Knepley 2185e6ccafaeSMatthew G Knepley PetscFunctionBegin; 218682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2187efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2188efa14ee0SMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2189efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2190efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 219153156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);} 2192efa14ee0SMatthew G Knepley /* Setup chart */ 2193efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2194efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2195efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2196efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2197e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2198e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 2199efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 2200e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 2201efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2202efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2203efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 2204efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2205e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2206e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2207e6ccafaeSMatthew G Knepley } 2208e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2209e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2210e6ccafaeSMatthew G Knepley } 2211e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2212e6ccafaeSMatthew G Knepley /* Create face cones */ 2213efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 22140298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2215efa14ee0SMatthew G Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2216e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2217e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 2218efa14ee0SMatthew G Knepley const PetscInt subcell = c; 22190298fd71SBarry Smith PetscInt *closure = NULL; 2220efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 2221e6ccafaeSMatthew G Knepley 2222e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2223efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2224efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 2225e6ccafaeSMatthew G Knepley PetscInt subVertex; 2226e6ccafaeSMatthew G Knepley 2227efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 2228efa14ee0SMatthew G Knepley ++numCorners; 2229efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 2230efa14ee0SMatthew G Knepley if (subVertex >= 0) { 2231efa14ee0SMatthew G Knepley closure[faceSize] = point; 223265560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 2233e6ccafaeSMatthew G Knepley ++faceSize; 2234e6ccafaeSMatthew G Knepley } 2235e6ccafaeSMatthew G Knepley } 2236e6ccafaeSMatthew G Knepley } 2237efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 2238efa14ee0SMatthew G Knepley if (faceSize == nFV) { 2239cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 2240e6ccafaeSMatthew G Knepley } 224165560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2242e6ccafaeSMatthew G Knepley } 2243efa14ee0SMatthew G Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2244e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2245e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2246e6ccafaeSMatthew G Knepley /* Build coordinates */ 2247efa14ee0SMatthew G Knepley { 2248efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 2249efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 2250efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 2251285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2252efa14ee0SMatthew G Knepley 2253e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2254e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2255e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2256285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2257285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2258285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2259efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2260efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2261efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2262efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2263efa14ee0SMatthew G Knepley PetscInt dof; 2264efa14ee0SMatthew G Knepley 2265efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2266efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2267285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2268e6ccafaeSMatthew G Knepley } 2269e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2270e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2271e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2272e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 22732eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2274830e53efSMatthew G. Knepley if (coordSize) { 2275e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2276e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2277efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2278efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2279efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2280efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2281e6ccafaeSMatthew G Knepley 2282e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2283e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2284efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2285efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2286efa14ee0SMatthew 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); 2287e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2288e6ccafaeSMatthew G Knepley } 2289e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2290e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 22913b399e24SMatthew G. Knepley } 2292e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2293e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2294e6ccafaeSMatthew G Knepley } 2295efa14ee0SMatthew G Knepley /* Cleanup */ 2296efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2297efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2298efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2299efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2300e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2301e6ccafaeSMatthew G Knepley } 2302e6ccafaeSMatthew G Knepley 2303e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2304e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated" 230553156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2306e6ccafaeSMatthew G Knepley { 230782f516ccSBarry Smith MPI_Comm comm; 230853156dfcSMatthew G. Knepley DMLabel subpointMap; 2309efa14ee0SMatthew G Knepley IS *subpointIS; 2310efa14ee0SMatthew G Knepley const PetscInt **subpoints; 231101a2673eSMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *coneONew; 2312efa14ee0SMatthew G Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2313e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2314e6ccafaeSMatthew G Knepley 2315e6ccafaeSMatthew G Knepley PetscFunctionBegin; 231682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2317efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2318e6ccafaeSMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2319efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2320efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 232153156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Interpolated(dm, vertexLabel, value, subpointMap, subdm);CHKERRQ(ierr);} 2322efa14ee0SMatthew G Knepley /* Setup chart */ 2323efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2324*dcca6d9dSJed Brown ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr); 2325e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2326e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2327e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 2328e6ccafaeSMatthew G Knepley } 2329e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2330e6ccafaeSMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2331e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2332e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 2333e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2334e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2335e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2336e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2337e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2338e6ccafaeSMatthew G Knepley ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2339e6ccafaeSMatthew G Knepley } 2340e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2341e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2342e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2343e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2344e6ccafaeSMatthew G Knepley const PetscInt *cone; 2345e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 2346e6ccafaeSMatthew G Knepley 2347e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2348e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2349e6ccafaeSMatthew G Knepley if (d == dim) { 2350e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2351e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2352e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2353e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 2354e6ccafaeSMatthew G Knepley } 2355e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2356e6ccafaeSMatthew G Knepley } 2357e6ccafaeSMatthew G Knepley } 2358e6ccafaeSMatthew G Knepley } 2359e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2360e6ccafaeSMatthew G Knepley /* Set cones */ 23610298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2362*dcca6d9dSJed Brown ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&coneONew);CHKERRQ(ierr); 2363e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2364e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2365e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2366e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 23670e49e2e2SMatthew G. Knepley const PetscInt *cone, *ornt; 2368e6ccafaeSMatthew G Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2369e6ccafaeSMatthew G Knepley 2370e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2371e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2372e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 23730e49e2e2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2374e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2375e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 237601a2673eSMatthew G. Knepley if (subc >= 0) { 237701a2673eSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 237801a2673eSMatthew G. Knepley coneONew[coneSizeNew] = ornt[c]; 237901a2673eSMatthew G. Knepley ++coneSizeNew; 238001a2673eSMatthew G. Knepley } 2381e6ccafaeSMatthew G Knepley } 2382e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2383e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 238401a2673eSMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, coneONew);CHKERRQ(ierr); 2385e6ccafaeSMatthew G Knepley } 2386e6ccafaeSMatthew G Knepley } 238701a2673eSMatthew G. Knepley ierr = PetscFree2(coneNew,coneONew);CHKERRQ(ierr); 2388e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2389e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2390e6ccafaeSMatthew G Knepley /* Build coordinates */ 2391e6ccafaeSMatthew G Knepley { 2392e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 2393e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 2394e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 2395285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2396e6ccafaeSMatthew G Knepley 2397e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2398e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2399e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2400285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2401285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2402285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2403e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2404e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2405e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2406e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2407e6ccafaeSMatthew G Knepley PetscInt dof; 2408e6ccafaeSMatthew G Knepley 2409e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2410e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2411285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2412e6ccafaeSMatthew G Knepley } 2413e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2414e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2415e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2416e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 24172eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2418e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2419e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2420e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2421e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2422e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2423e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2424e6ccafaeSMatthew G Knepley 2425e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2426e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2427e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2428e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2429e6ccafaeSMatthew 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); 2430efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2431e6ccafaeSMatthew G Knepley } 2432e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2433e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2434e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2435e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2436e6ccafaeSMatthew G Knepley } 2437efa14ee0SMatthew G Knepley /* Cleanup */ 2438e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2439e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2440e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2441e6ccafaeSMatthew G Knepley } 2442efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2443e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2444e6ccafaeSMatthew G Knepley } 2445e6ccafaeSMatthew G Knepley 2446e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2447e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh" 2448d0fa310fSMatthew G. Knepley /*@ 2449e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 2450e6ccafaeSMatthew G Knepley 2451e6ccafaeSMatthew G Knepley Input Parameters: 2452e6ccafaeSMatthew G Knepley + dm - The original mesh 2453830e53efSMatthew G. Knepley . vertexLabel - The DMLabel marking vertices contained in the surface 2454830e53efSMatthew G. Knepley - value - The label value to use 2455e6ccafaeSMatthew G Knepley 2456e6ccafaeSMatthew G Knepley Output Parameter: 2457e6ccafaeSMatthew G Knepley . subdm - The surface mesh 2458e6ccafaeSMatthew G Knepley 2459e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2460e6ccafaeSMatthew G Knepley 2461e6ccafaeSMatthew G Knepley Level: developer 2462e6ccafaeSMatthew G Knepley 2463e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue() 2464830e53efSMatthew G. Knepley @*/ 246553156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm) 2466e6ccafaeSMatthew G Knepley { 2467e6ccafaeSMatthew G Knepley PetscInt dim, depth; 2468e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2469e6ccafaeSMatthew G Knepley 2470e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2471e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2472766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 2473e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2474e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 247582f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2476e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2477e6ccafaeSMatthew G Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2478e6ccafaeSMatthew G Knepley if (depth == dim) { 2479830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2480e6ccafaeSMatthew G Knepley } else { 2481830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2482e6ccafaeSMatthew G Knepley } 2483e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2484e6ccafaeSMatthew G Knepley } 2485e6ccafaeSMatthew G Knepley 2486e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2487aca35d17SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal" 2488aca35d17SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 2489aca35d17SMatthew G. Knepley { 2490aca35d17SMatthew G. Knepley PetscInt subPoint; 2491aca35d17SMatthew G. Knepley PetscErrorCode ierr; 2492aca35d17SMatthew G. Knepley 2493aca35d17SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 2494aca35d17SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 2495aca35d17SMatthew G. Knepley } 2496aca35d17SMatthew G. Knepley 2497aca35d17SMatthew G. Knepley #undef __FUNCT__ 2498766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated" 249927c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 2500766ab985SMatthew G. Knepley { 2501766ab985SMatthew G. Knepley MPI_Comm comm; 2502766ab985SMatthew G. Knepley DMLabel subpointMap; 2503766ab985SMatthew G. Knepley IS subvertexIS; 2504766ab985SMatthew G. Knepley const PetscInt *subVertices; 2505fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 2506766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 250787feddfdSMatthew G. Knepley PetscInt cMax, c, f; 2508766ab985SMatthew G. Knepley PetscErrorCode ierr; 2509766ab985SMatthew G. Knepley 2510766ab985SMatthew G. Knepley PetscFunctionBegin; 2511766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 2512766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2513766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2514766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2515766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 251627c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 2517766ab985SMatthew G. Knepley /* Setup chart */ 2518766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2519766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2520766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2521766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2522766ab985SMatthew G. Knepley /* Set cone sizes */ 2523766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 2524766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 2525766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 2526766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2527766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2528766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2529766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2530766ab985SMatthew G. Knepley } 2531766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2532766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2533766ab985SMatthew G. Knepley } 2534766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2535766ab985SMatthew G. Knepley /* Create face cones */ 2536766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 253787feddfdSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2538766ab985SMatthew G. Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2539766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2540766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 2541766ab985SMatthew G. Knepley const PetscInt subcell = c; 254287feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 254387feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 2544766ab985SMatthew G. Knepley 254587feddfdSMatthew G. Knepley if (cell < cMax) continue; 254687feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 254787feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 254887feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 254987feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 255087feddfdSMatthew G. Knepley } 255187feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 255287feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 255387feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 255427234c99SMatthew G. Knepley /* Not true in parallel 255527234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 255687feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 255787feddfdSMatthew G. Knepley PetscInt negsubcell; 2558766ab985SMatthew G. Knepley 255987feddfdSMatthew G. Knepley if (cells[p] >= cMax) continue; 256087feddfdSMatthew G. Knepley /* I know this is a crap search */ 256187feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 256287feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 2563766ab985SMatthew G. Knepley } 256487feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 256587feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 2566766ab985SMatthew G. Knepley } 256787feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 256887feddfdSMatthew G. Knepley ++newFacePoint; 2569766ab985SMatthew G. Knepley } 2570766ab985SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2571766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2572766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2573766ab985SMatthew G. Knepley /* Build coordinates */ 2574766ab985SMatthew G. Knepley { 2575766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2576766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2577766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2578285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2579766ab985SMatthew G. Knepley 2580766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2581766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2582766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2583285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2584285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2585285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2586766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2587766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2588766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2589766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2590766ab985SMatthew G. Knepley PetscInt dof; 2591766ab985SMatthew G. Knepley 2592766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2593766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2594285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2595766ab985SMatthew G. Knepley } 2596766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2597766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2598766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2599766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 26002eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2601766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2602766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2603766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2604766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2605766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2606766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 2607766ab985SMatthew G. Knepley 2608766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2609766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2610766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2611766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2612766ab985SMatthew 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); 2613766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2614766ab985SMatthew G. Knepley } 2615766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2616766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2617766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2618766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2619766ab985SMatthew G. Knepley } 2620aca35d17SMatthew G. Knepley /* Build SF */ 2621aca35d17SMatthew G. Knepley CHKMEMQ; 2622aca35d17SMatthew G. Knepley { 2623aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 2624aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 2625bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 2626aca35d17SMatthew G. Knepley const PetscInt *localPoints; 2627bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 262849c26ae4SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 2629bdcf2095SMatthew G. Knepley PetscMPIInt rank; 2630aca35d17SMatthew G. Knepley 2631bdcf2095SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 2632aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 2633aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 2634aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2635aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 2636aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 2637aca35d17SMatthew G. Knepley if (numRoots >= 0) { 2638aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 2639*dcca6d9dSJed Brown ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 2640bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 2641bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 2642bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 2643bdcf2095SMatthew G. Knepley } 26449e0823b2SMatthew G. Knepley /* Set subleaves */ 2645aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2646aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 2647bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2648aca35d17SMatthew G. Knepley 2649aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 2650bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 2651bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 2652bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 2653bdcf2095SMatthew G. Knepley ++numSubLeaves; 2654aca35d17SMatthew G. Knepley } 26559e0823b2SMatthew G. Knepley /* Must put in owned subpoints */ 26569e0823b2SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 26579e0823b2SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 26589e0823b2SMatthew G. Knepley 26599e0823b2SMatthew G. Knepley if (subPoint < 0) { 26609e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = -3; 26619e0823b2SMatthew G. Knepley newOwners[p-pStart].index = -3; 26629e0823b2SMatthew G. Knepley } else { 26639e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = rank; 26649e0823b2SMatthew G. Knepley newOwners[p-pStart].index = subPoint; 26659e0823b2SMatthew G. Knepley } 2666bdcf2095SMatthew G. Knepley } 2667bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2668bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2669bdcf2095SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2670bdcf2095SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2671aca35d17SMatthew G. Knepley ierr = PetscMalloc(numSubLeaves * sizeof(PetscInt), &slocalPoints);CHKERRQ(ierr); 2672aca35d17SMatthew G. Knepley ierr = PetscMalloc(numSubLeaves * sizeof(PetscSFNode), &sremotePoints);CHKERRQ(ierr); 267349c26ae4SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 2674bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 2675bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2676aca35d17SMatthew G. Knepley 2677aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 267849c26ae4SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 2679aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 2680bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 2681bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 2682bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 2683bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 2684aca35d17SMatthew G. Knepley ++sl; 2685aca35d17SMatthew G. Knepley } 2686bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 268749c26ae4SMatthew G. Knepley if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 268849c26ae4SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 2689aca35d17SMatthew G. Knepley } 2690aca35d17SMatthew G. Knepley } 2691aca35d17SMatthew G. Knepley CHKMEMQ; 2692766ab985SMatthew G. Knepley /* Cleanup */ 2693766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2694766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2695766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 2696766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2697766ab985SMatthew G. Knepley } 2698766ab985SMatthew G. Knepley 2699766ab985SMatthew G. Knepley #undef __FUNCT__ 2700766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated" 2701b3154360SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char label[], PetscInt value, DM subdm) 2702766ab985SMatthew G. Knepley { 2703766ab985SMatthew G. Knepley MPI_Comm comm; 2704766ab985SMatthew G. Knepley DMLabel subpointMap; 2705766ab985SMatthew G. Knepley IS *subpointIS; 2706766ab985SMatthew G. Knepley const PetscInt **subpoints; 2707b1a8e46aSMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *orntNew; 2708766ab985SMatthew G. Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2709766ab985SMatthew G. Knepley PetscErrorCode ierr; 2710766ab985SMatthew G. Knepley 2711766ab985SMatthew G. Knepley PetscFunctionBegin; 2712766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2713766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2714766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2715766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2716766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 2717b3154360SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr); 2718766ab985SMatthew G. Knepley /* Setup chart */ 2719766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2720*dcca6d9dSJed Brown ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr); 2721766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2722766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2723766ab985SMatthew G. Knepley totSubPoints += numSubPoints[d]; 2724766ab985SMatthew G. Knepley } 2725766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2726766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2727766ab985SMatthew G. Knepley /* Set cone sizes */ 2728766ab985SMatthew G. Knepley firstSubPoint[dim] = 0; 2729766ab985SMatthew G. Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2730766ab985SMatthew G. Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2731766ab985SMatthew G. Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2732766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2733766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2734766ab985SMatthew G. Knepley ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2735766ab985SMatthew G. Knepley } 2736766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2737766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2738766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2739766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2740766ab985SMatthew G. Knepley const PetscInt *cone; 2741766ab985SMatthew G. Knepley PetscInt coneSize, coneSizeNew, c, val; 2742766ab985SMatthew G. Knepley 2743766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2744766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2745766ab985SMatthew G. Knepley if (d == dim) { 2746766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2747766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2748766ab985SMatthew G. Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2749766ab985SMatthew G. Knepley if (val >= 0) coneSizeNew++; 2750766ab985SMatthew G. Knepley } 2751766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2752766ab985SMatthew G. Knepley } 2753766ab985SMatthew G. Knepley } 2754766ab985SMatthew G. Knepley } 2755766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2756766ab985SMatthew G. Knepley /* Set cones */ 2757766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2758*dcca6d9dSJed Brown ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&orntNew);CHKERRQ(ierr); 2759766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2760766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2761766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2762766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2763b1a8e46aSMatthew G. Knepley const PetscInt *cone, *ornt; 2764766ab985SMatthew G. Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2765766ab985SMatthew G. Knepley 2766766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2767766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2768766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2769b1a8e46aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2770766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2771766ab985SMatthew G. Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 2772b1a8e46aSMatthew G. Knepley if (subc >= 0) { 2773b1a8e46aSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 2774b1a8e46aSMatthew G. Knepley orntNew[coneSizeNew++] = ornt[c]; 2775b1a8e46aSMatthew G. Knepley } 2776766ab985SMatthew G. Knepley } 2777766ab985SMatthew G. Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2778766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 2779b1a8e46aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, orntNew);CHKERRQ(ierr); 2780766ab985SMatthew G. Knepley } 2781766ab985SMatthew G. Knepley } 2782b1a8e46aSMatthew G. Knepley ierr = PetscFree2(coneNew,orntNew);CHKERRQ(ierr); 2783766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2784766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2785766ab985SMatthew G. Knepley /* Build coordinates */ 2786766ab985SMatthew G. Knepley { 2787766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2788766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2789766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2790285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2791766ab985SMatthew G. Knepley 2792766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2793766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2794766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2795285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2796285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2797285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2798766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2799766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2800766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 2801766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2802766ab985SMatthew G. Knepley PetscInt dof; 2803766ab985SMatthew G. Knepley 2804766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2805766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2806285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2807766ab985SMatthew G. Knepley } 2808766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2809766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2810766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2811766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 28122eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2813766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2814766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2815766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2816766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 2817766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2818766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 2819766ab985SMatthew G. Knepley 2820766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2821766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2822766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2823766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2824766ab985SMatthew 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); 2825766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2826766ab985SMatthew G. Knepley } 2827766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2828766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2829766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2830766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2831766ab985SMatthew G. Knepley } 2832766ab985SMatthew G. Knepley /* Cleanup */ 2833766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2834766ab985SMatthew G. Knepley ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2835766ab985SMatthew G. Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2836766ab985SMatthew G. Knepley } 2837766ab985SMatthew G. Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2838766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2839766ab985SMatthew G. Knepley } 2840766ab985SMatthew G. Knepley 2841766ab985SMatthew G. Knepley #undef __FUNCT__ 2842766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh" 2843766ab985SMatthew G. Knepley /* 284427c04023SMatthew 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. 2845766ab985SMatthew G. Knepley 2846766ab985SMatthew G. Knepley Input Parameters: 2847766ab985SMatthew G. Knepley + dm - The original mesh 284827c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 284927c04023SMatthew G. Knepley . label - A label name, or PETSC_NULL 285027c04023SMatthew G. Knepley - value - A label value 2851766ab985SMatthew G. Knepley 2852766ab985SMatthew G. Knepley Output Parameter: 2853766ab985SMatthew G. Knepley . subdm - The surface mesh 2854766ab985SMatthew G. Knepley 2855766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2856766ab985SMatthew G. Knepley 2857766ab985SMatthew G. Knepley Level: developer 2858766ab985SMatthew G. Knepley 2859766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 2860766ab985SMatthew G. Knepley */ 286127c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 2862766ab985SMatthew G. Knepley { 2863766ab985SMatthew G. Knepley PetscInt dim, depth; 2864766ab985SMatthew G. Knepley PetscErrorCode ierr; 2865766ab985SMatthew G. Knepley 2866766ab985SMatthew G. Knepley PetscFunctionBegin; 2867766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 286827c04023SMatthew G. Knepley PetscValidPointer(subdm, 5); 2869766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2870766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2871766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2872766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2873766ab985SMatthew G. Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2874766ab985SMatthew G. Knepley if (depth == dim) { 2875b3154360SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr); 2876766ab985SMatthew G. Knepley } else { 287727c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 2878e6ccafaeSMatthew G Knepley } 2879e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2880e6ccafaeSMatthew G Knepley } 2881e6ccafaeSMatthew G Knepley 2882e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2883e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap" 288464beef6dSMatthew G. Knepley /*@ 288564beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 288664beef6dSMatthew G. Knepley 288764beef6dSMatthew G. Knepley Input Parameter: 288864beef6dSMatthew G. Knepley . dm - The submesh DM 288964beef6dSMatthew G. Knepley 289064beef6dSMatthew G. Knepley Output Parameter: 289164beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 289264beef6dSMatthew G. Knepley 289364beef6dSMatthew G. Knepley Level: developer 289464beef6dSMatthew G. Knepley 289564beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 289664beef6dSMatthew G. Knepley @*/ 2897e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 2898e6ccafaeSMatthew G Knepley { 2899e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 2900e6ccafaeSMatthew G Knepley 2901e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2902e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2903e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 2904e6ccafaeSMatthew G Knepley *subpointMap = mesh->subpointMap; 2905e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2906e6ccafaeSMatthew G Knepley } 2907e6ccafaeSMatthew G Knepley 2908e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2909e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap" 2910e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */ 2911e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 2912e6ccafaeSMatthew G Knepley { 2913e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 2914285d324eSMatthew G. Knepley DMLabel tmp; 2915e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2916e6ccafaeSMatthew G Knepley 2917e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2918e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2919285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 2920e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 2921285d324eSMatthew G. Knepley ++mesh->subpointMap->refct; 2922285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 2923e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2924e6ccafaeSMatthew G Knepley } 2925e6ccafaeSMatthew G Knepley 2926e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2927e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS" 292864beef6dSMatthew G. Knepley /*@ 2929e6ccafaeSMatthew G Knepley DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 2930e6ccafaeSMatthew G Knepley 2931e6ccafaeSMatthew G Knepley Input Parameter: 2932e6ccafaeSMatthew G Knepley . dm - The submesh DM 2933e6ccafaeSMatthew G Knepley 2934e6ccafaeSMatthew G Knepley Output Parameter: 29350298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 2936e6ccafaeSMatthew G Knepley 2937e6ccafaeSMatthew G Knepley Note: This is IS is guaranteed to be sorted by the construction of the submesh 293864beef6dSMatthew G. Knepley 293964beef6dSMatthew G. Knepley Level: developer 294064beef6dSMatthew G. Knepley 294164beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 294264beef6dSMatthew G. Knepley @*/ 2943e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 2944e6ccafaeSMatthew G Knepley { 294582f516ccSBarry Smith MPI_Comm comm; 2946e6ccafaeSMatthew G Knepley DMLabel subpointMap; 2947e6ccafaeSMatthew G Knepley IS is; 2948e6ccafaeSMatthew G Knepley const PetscInt *opoints; 2949e6ccafaeSMatthew G Knepley PetscInt *points, *depths; 2950e6ccafaeSMatthew G Knepley PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 2951e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2952e6ccafaeSMatthew G Knepley 2953e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2954e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2955e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 295682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 29570298fd71SBarry Smith *subpointIS = NULL; 2958e6ccafaeSMatthew G Knepley ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 2959e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2960fed694aaSMatthew G. Knepley if (subpointMap && depth >= 0) { 2961e6ccafaeSMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2962e6ccafaeSMatthew G Knepley if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 2963e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 2964e6ccafaeSMatthew G Knepley depths[0] = depth; 2965e6ccafaeSMatthew G Knepley depths[1] = 0; 2966e6ccafaeSMatthew G Knepley for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 2967e6ccafaeSMatthew G Knepley ierr = PetscMalloc(pEnd * sizeof(PetscInt), &points);CHKERRQ(ierr); 2968e6ccafaeSMatthew G Knepley for(d = 0, off = 0; d <= depth; ++d) { 2969e6ccafaeSMatthew G Knepley const PetscInt dep = depths[d]; 2970e6ccafaeSMatthew G Knepley 2971e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 2972e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 29731e21b6fdSMatthew G Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 2974e6ccafaeSMatthew 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); 2975e6ccafaeSMatthew G Knepley } else { 29761e21b6fdSMatthew G Knepley if (!n) { 29771e21b6fdSMatthew G Knepley if (d == 0) { 29781e21b6fdSMatthew G Knepley /* Missing cells */ 29791e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 29801e21b6fdSMatthew G Knepley } else { 29811e21b6fdSMatthew G Knepley /* Missing faces */ 29821e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 29831e21b6fdSMatthew G Knepley } 29841e21b6fdSMatthew G Knepley } 2985e6ccafaeSMatthew G Knepley } 2986e6ccafaeSMatthew G Knepley if (n) { 2987e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 2988e6ccafaeSMatthew G Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 2989e6ccafaeSMatthew G Knepley for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 2990e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 2991e6ccafaeSMatthew G Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 2992e6ccafaeSMatthew G Knepley } 2993e6ccafaeSMatthew G Knepley } 2994e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 2995e6ccafaeSMatthew G Knepley if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 2996fed694aaSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 2997e6ccafaeSMatthew G Knepley } 2998e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2999e6ccafaeSMatthew G Knepley } 3000