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" 95*a6ae58d1SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthMax[], PetscInt depthEnd[], PetscInt depthShift[]) 96cd0c2139SMatthew G Knepley { 97cd0c2139SMatthew G Knepley if (depth < 0) return p; 98*a6ae58d1SMatthew G. Knepley /* Normal Cells */ if (p < depthMax[depth]) return p; 99*a6ae58d1SMatthew G. Knepley /* Hybrid Cells+Normal Vertices */ if (p < depthMax[0]) return p + depthShift[depth]; 100*a6ae58d1SMatthew G. Knepley /* Hybrid Vertices+Normal Faces */ if (depth < 2 || p < depthMax[depth-1]) return p + depthShift[depth] + depthShift[0]; 101*a6ae58d1SMatthew G. Knepley /* Hybrid Faces+Normal Edges */ if (depth < 3 || p < depthMax[depth-2]) return p + depthShift[depth] + depthShift[0] + depthShift[depth-1]; 102*a6ae58d1SMatthew G. Knepley /* Hybrid Edges */ return p + depthShift[depth] + depthShift[0] + depthShift[depth-1] + depthShift[depth-2]; 103cd0c2139SMatthew G Knepley } 104cd0c2139SMatthew G Knepley 105cd0c2139SMatthew G Knepley #undef __FUNCT__ 106cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSizes_Internal" 107cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew) 108cd0c2139SMatthew G Knepley { 109*a6ae58d1SMatthew G. Knepley PetscInt *depthMax, *depthEnd; 110cd0c2139SMatthew G Knepley PetscInt depth = 0, d, pStart, pEnd, p; 111cd0c2139SMatthew G Knepley PetscErrorCode ierr; 112cd0c2139SMatthew G Knepley 113cd0c2139SMatthew G Knepley PetscFunctionBegin; 114cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 115cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 116*a6ae58d1SMatthew G. Knepley ierr = PetscMalloc2(depth+1,PetscInt,&depthMax,depth+1,PetscInt,&depthEnd);CHKERRQ(ierr); 117cd0c2139SMatthew G Knepley /* Step 1: Expand chart */ 118cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 119*a6ae58d1SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &depthMax[depth], depth > 0 ? &depthMax[depth-1] : NULL, &depthMax[1], &depthMax[0]);CHKERRQ(ierr); 120cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 121cd0c2139SMatthew G Knepley pEnd += depthShift[d]; 122cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 123*a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 124cd0c2139SMatthew G Knepley } 125cd0c2139SMatthew G Knepley ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr); 126cd0c2139SMatthew G Knepley /* Step 2: Set cone and support sizes */ 127cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 128cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 129cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 130*a6ae58d1SMatthew G. Knepley PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthMax, depthEnd, depthShift); 131cd0c2139SMatthew G Knepley PetscInt size; 132cd0c2139SMatthew G Knepley 133cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 134cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr); 135cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 136cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr); 137cd0c2139SMatthew G Knepley } 138cd0c2139SMatthew G Knepley } 139*a6ae58d1SMatthew G. Knepley ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr); 140cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 141cd0c2139SMatthew G Knepley } 142cd0c2139SMatthew G Knepley 143cd0c2139SMatthew G Knepley #undef __FUNCT__ 144cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoints_Internal" 145cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew) 146cd0c2139SMatthew G Knepley { 147*a6ae58d1SMatthew G. Knepley PetscInt *depthEnd, *depthMax, *newpoints; 148dcbb62e8SMatthew G. Knepley PetscInt depth = 0, d, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, pStart, pEnd, p; 149cd0c2139SMatthew G Knepley PetscErrorCode ierr; 150cd0c2139SMatthew G Knepley 151cd0c2139SMatthew G Knepley PetscFunctionBegin; 152cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 153cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 154cd0c2139SMatthew G Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 155dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dmNew, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 156*a6ae58d1SMatthew G. Knepley ierr = PetscMalloc3(depth+1,PetscInt,&depthEnd,depth+1,PetscInt,&depthMax,PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),PetscInt,&newpoints);CHKERRQ(ierr); 157*a6ae58d1SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &depthMax[depth], depth > 0 ? &depthMax[depth-1] : NULL, &depthMax[1], &depthMax[0]);CHKERRQ(ierr); 158cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 159cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 160*a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 161cd0c2139SMatthew G Knepley } 162cd0c2139SMatthew G Knepley /* Step 5: Set cones and supports */ 163cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 164cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 165cd0c2139SMatthew G Knepley const PetscInt *points = NULL, *orientations = NULL; 166*a6ae58d1SMatthew G. Knepley PetscInt size,sizeNew, i, newp = DMPlexShiftPoint_Internal(p, depth, depthMax, depthEnd, depthShift); 167cd0c2139SMatthew G Knepley 168cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 169cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr); 170cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr); 171cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 172*a6ae58d1SMatthew G. Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthMax, depthEnd, depthShift); 173cd0c2139SMatthew G Knepley } 174cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr); 175cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr); 176cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 177dcbb62e8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmNew, newp, &sizeNew);CHKERRQ(ierr); 178cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr); 179cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 180*a6ae58d1SMatthew G. Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthMax, depthEnd, depthShift); 181cd0c2139SMatthew G Knepley } 182dcbb62e8SMatthew G. Knepley for (i = size; i < sizeNew; ++i) newpoints[i] = 0; 183cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr); 184cd0c2139SMatthew G Knepley } 185*a6ae58d1SMatthew G. Knepley ierr = PetscFree3(depthEnd,depthMax,newpoints);CHKERRQ(ierr); 186cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 187cd0c2139SMatthew G Knepley } 188cd0c2139SMatthew G Knepley 189cd0c2139SMatthew G Knepley #undef __FUNCT__ 190cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftCoordinates_Internal" 191cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew) 192cd0c2139SMatthew G Knepley { 193cd0c2139SMatthew G Knepley PetscSection coordSection, newCoordSection; 194cd0c2139SMatthew G Knepley Vec coordinates, newCoordinates; 195cd0c2139SMatthew G Knepley PetscScalar *coords, *newCoords; 196cd0c2139SMatthew G Knepley PetscInt *depthEnd, coordSize; 197cd0c2139SMatthew G Knepley PetscInt dim, depth = 0, d, vStart, vEnd, vStartNew, vEndNew, v; 198cd0c2139SMatthew G Knepley PetscErrorCode ierr; 199cd0c2139SMatthew G Knepley 200cd0c2139SMatthew G Knepley PetscFunctionBegin; 201cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 202cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 203cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 204cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 205cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 206cd0c2139SMatthew G Knepley } 207cd0c2139SMatthew G Knepley /* Step 8: Convert coordinates */ 208cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 209cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr); 210cd0c2139SMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 211cd0c2139SMatthew G Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr); 212cd0c2139SMatthew G Knepley ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr); 213cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr); 214cd0c2139SMatthew G Knepley ierr = PetscSectionSetChart(newCoordSection, vStartNew, vEndNew);CHKERRQ(ierr); 215cd0c2139SMatthew G Knepley for (v = vStartNew; v < vEndNew; ++v) { 216cd0c2139SMatthew G Knepley ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr); 217cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr); 218cd0c2139SMatthew G Knepley } 219cd0c2139SMatthew G Knepley ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr); 220cd0c2139SMatthew G Knepley ierr = DMPlexSetCoordinateSection(dmNew, newCoordSection);CHKERRQ(ierr); 221cd0c2139SMatthew G Knepley ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr); 222cd0c2139SMatthew G Knepley ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr); 223cd0c2139SMatthew G Knepley ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr); 224cd0c2139SMatthew G Knepley ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2252eb5907fSJed Brown ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr); 226cd0c2139SMatthew G Knepley ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr); 227cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 228cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 229cd0c2139SMatthew G Knepley ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr); 230cd0c2139SMatthew G Knepley for (v = vStart; v < vEnd; ++v) { 231cd0c2139SMatthew G Knepley PetscInt dof, off, noff, d; 232cd0c2139SMatthew G Knepley 233cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 234cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 235*a6ae58d1SMatthew G. Knepley ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthEnd, depthEnd, depthShift), &noff);CHKERRQ(ierr); 236cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) { 237cd0c2139SMatthew G Knepley newCoords[noff+d] = coords[off+d]; 238cd0c2139SMatthew G Knepley } 239cd0c2139SMatthew G Knepley } 240cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 241cd0c2139SMatthew G Knepley ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr); 242cd0c2139SMatthew G Knepley ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 243cd0c2139SMatthew G Knepley ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr); 244cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 245cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 246cd0c2139SMatthew G Knepley } 247cd0c2139SMatthew G Knepley 248cd0c2139SMatthew G Knepley #undef __FUNCT__ 249cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal" 250cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew) 251cd0c2139SMatthew G Knepley { 252*a6ae58d1SMatthew G. Knepley PetscInt *depthMax, *depthEnd; 253cd0c2139SMatthew G Knepley PetscInt depth = 0, d; 254cd0c2139SMatthew G Knepley PetscSF sfPoint, sfPointNew; 255cd0c2139SMatthew G Knepley const PetscSFNode *remotePoints; 256cd0c2139SMatthew G Knepley PetscSFNode *gremotePoints; 257cd0c2139SMatthew G Knepley const PetscInt *localPoints; 258cd0c2139SMatthew G Knepley PetscInt *glocalPoints, *newLocation, *newRemoteLocation; 259cd0c2139SMatthew G Knepley PetscInt numRoots, numLeaves, l, pStart, pEnd, totShift = 0; 260cd0c2139SMatthew G Knepley PetscErrorCode ierr; 261cd0c2139SMatthew G Knepley 262cd0c2139SMatthew G Knepley PetscFunctionBegin; 263cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 264*a6ae58d1SMatthew G. Knepley ierr = PetscMalloc2(depth+1,PetscInt,&depthMax,depth+1,PetscInt,&depthEnd);CHKERRQ(ierr); 265*a6ae58d1SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &depthMax[depth] : NULL, depth>1 ? &depthMax[depth-1] : NULL, depth>2 ? &depthMax[1] : NULL, depth >= 0 ? &depthMax[0] : NULL);CHKERRQ(ierr); 266cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 267cd0c2139SMatthew G Knepley totShift += depthShift[d]; 268cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 269*a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 270cd0c2139SMatthew G Knepley } 271cd0c2139SMatthew G Knepley /* Step 9: Convert pointSF */ 272cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 273cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr); 274cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 275cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 276cd0c2139SMatthew G Knepley if (numRoots >= 0) { 277cd0c2139SMatthew G Knepley ierr = PetscMalloc2(numRoots,PetscInt,&newLocation,pEnd-pStart,PetscInt,&newRemoteLocation);CHKERRQ(ierr); 278*a6ae58d1SMatthew G. Knepley for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthMax, depthEnd, depthShift); 279cd0c2139SMatthew G Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 280cd0c2139SMatthew G Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 281cd0c2139SMatthew G Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscInt), &glocalPoints);CHKERRQ(ierr); 282cd0c2139SMatthew G Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscSFNode), &gremotePoints);CHKERRQ(ierr); 283cd0c2139SMatthew G Knepley for (l = 0; l < numLeaves; ++l) { 284*a6ae58d1SMatthew G. Knepley glocalPoints[l] = DMPlexShiftPoint_Internal(localPoints[l], depth, depthMax, depthEnd, depthShift); 285cd0c2139SMatthew G Knepley gremotePoints[l].rank = remotePoints[l].rank; 286cd0c2139SMatthew G Knepley gremotePoints[l].index = newRemoteLocation[localPoints[l]]; 287cd0c2139SMatthew G Knepley } 288cd0c2139SMatthew G Knepley ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr); 289cd0c2139SMatthew G Knepley ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 290cd0c2139SMatthew G Knepley } 291*a6ae58d1SMatthew G. Knepley ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr); 292cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 293cd0c2139SMatthew G Knepley } 294cd0c2139SMatthew G Knepley 295cd0c2139SMatthew G Knepley #undef __FUNCT__ 296cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal" 297cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew) 298cd0c2139SMatthew G Knepley { 299cd0c2139SMatthew G Knepley PetscSF sfPoint; 300cd0c2139SMatthew G Knepley DMLabel vtkLabel, ghostLabel; 301*a6ae58d1SMatthew G. Knepley PetscInt *depthMax, *depthEnd; 302cd0c2139SMatthew G Knepley const PetscSFNode *leafRemote; 303cd0c2139SMatthew G Knepley const PetscInt *leafLocal; 304cd0c2139SMatthew G Knepley PetscInt depth = 0, d, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f; 305cd0c2139SMatthew G Knepley PetscMPIInt rank; 306cd0c2139SMatthew G Knepley PetscErrorCode ierr; 307cd0c2139SMatthew G Knepley 308cd0c2139SMatthew G Knepley PetscFunctionBegin; 309cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 310*a6ae58d1SMatthew G. Knepley ierr = PetscMalloc2(depth+1,PetscInt,&depthMax,depth+1,PetscInt,&depthEnd);CHKERRQ(ierr); 311*a6ae58d1SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &depthMax[depth] : NULL, depth>1 ? &depthMax[depth-1] : NULL, depth>2 ? &depthMax[1] : NULL, depth >= 0 ? &depthMax[0] : NULL);CHKERRQ(ierr); 312cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 313cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 314*a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 315cd0c2139SMatthew G Knepley } 316cd0c2139SMatthew G Knepley /* Step 10: Convert labels */ 317cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 318cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 319cd0c2139SMatthew G Knepley DMLabel label, newlabel; 320cd0c2139SMatthew G Knepley const char *lname; 321cd0c2139SMatthew G Knepley PetscBool isDepth; 322cd0c2139SMatthew G Knepley IS valueIS; 323cd0c2139SMatthew G Knepley const PetscInt *values; 324cd0c2139SMatthew G Knepley PetscInt numValues, val; 325cd0c2139SMatthew G Knepley 326cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr); 327cd0c2139SMatthew G Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 328cd0c2139SMatthew G Knepley if (isDepth) continue; 329cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, lname);CHKERRQ(ierr); 330cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr); 331cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr); 332cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 333cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 334cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 335cd0c2139SMatthew G Knepley for (val = 0; val < numValues; ++val) { 336cd0c2139SMatthew G Knepley IS pointIS; 337cd0c2139SMatthew G Knepley const PetscInt *points; 338cd0c2139SMatthew G Knepley PetscInt numPoints, p; 339cd0c2139SMatthew G Knepley 340cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 341cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 342cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 343cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 344*a6ae58d1SMatthew G. Knepley const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthMax, depthEnd, depthShift); 345cd0c2139SMatthew G Knepley 346cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr); 347cd0c2139SMatthew G Knepley } 348cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 349cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 350cd0c2139SMatthew G Knepley } 351cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 352cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 353cd0c2139SMatthew G Knepley } 354*a6ae58d1SMatthew G. Knepley ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr); 355cd0c2139SMatthew G Knepley /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */ 356cd0c2139SMatthew G Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 357cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 358cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 359cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr); 360cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "vtk");CHKERRQ(ierr); 361cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "ghost");CHKERRQ(ierr); 362cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr); 363cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr); 364cd0c2139SMatthew G Knepley for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { 365cd0c2139SMatthew G Knepley for (; c < leafLocal[l] && c < cEnd; ++c) { 366cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 367cd0c2139SMatthew G Knepley } 368cd0c2139SMatthew G Knepley if (leafLocal[l] >= cEnd) break; 369cd0c2139SMatthew G Knepley if (leafRemote[l].rank == rank) { 370cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 371cd0c2139SMatthew G Knepley } else { 372cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr); 373cd0c2139SMatthew G Knepley } 374cd0c2139SMatthew G Knepley } 375cd0c2139SMatthew G Knepley for (; c < cEnd; ++c) { 376cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 377cd0c2139SMatthew G Knepley } 378cd0c2139SMatthew G Knepley if (0) { 379cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 380cd0c2139SMatthew G Knepley ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 381cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 382cd0c2139SMatthew G Knepley } 383cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr); 384cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 385cd0c2139SMatthew G Knepley PetscInt numCells; 386cd0c2139SMatthew G Knepley 387cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr); 388cd0c2139SMatthew G Knepley if (numCells < 2) { 389cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr); 390cd0c2139SMatthew G Knepley } else { 391cd0c2139SMatthew G Knepley const PetscInt *cells = NULL; 392cd0c2139SMatthew G Knepley PetscInt vA, vB; 393cd0c2139SMatthew G Knepley 394cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr); 395cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr); 396cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr); 397cd0c2139SMatthew G Knepley if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);} 398cd0c2139SMatthew G Knepley } 399cd0c2139SMatthew G Knepley } 400cd0c2139SMatthew G Knepley if (0) { 401cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 402cd0c2139SMatthew G Knepley ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 403cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 404cd0c2139SMatthew G Knepley } 405cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 406cd0c2139SMatthew G Knepley } 407cd0c2139SMatthew G Knepley 408cd0c2139SMatthew G Knepley #undef __FUNCT__ 409cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal" 410cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm) 411cd0c2139SMatthew G Knepley { 412cd0c2139SMatthew G Knepley IS valueIS; 413cd0c2139SMatthew G Knepley const PetscInt *values; 414cd0c2139SMatthew G Knepley PetscInt *depthShift; 41546c796b9SMatthew G. Knepley PetscInt depth = 0, numFS, fs, fStart, fEnd, ghostCell, cEnd, c; 416cd0c2139SMatthew G Knepley PetscErrorCode ierr; 417cd0c2139SMatthew G Knepley 418cd0c2139SMatthew G Knepley PetscFunctionBegin; 41946c796b9SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 420cd0c2139SMatthew G Knepley /* Count ghost cells */ 421cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 422cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr); 423cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 424cd0c2139SMatthew G Knepley *numGhostCells = 0; 425cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 42646c796b9SMatthew G. Knepley IS faceIS; 42746c796b9SMatthew G. Knepley const PetscInt *faces; 42846c796b9SMatthew G. Knepley PetscInt numFaces, f, numBdFaces = 0; 429cd0c2139SMatthew G Knepley 43046c796b9SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 43146c796b9SMatthew G. Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 43246c796b9SMatthew G. Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 43346c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 43446c796b9SMatthew G. Knepley if ((faces[f] >= fStart) && (faces[f] < fEnd)) ++numBdFaces; 43546c796b9SMatthew G. Knepley } 436cd0c2139SMatthew G Knepley *numGhostCells += numBdFaces; 43746c796b9SMatthew G. Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 438cd0c2139SMatthew G Knepley } 439cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 440cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthShift);CHKERRQ(ierr); 441cd0c2139SMatthew G Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 442cd0c2139SMatthew G Knepley if (depth >= 0) depthShift[depth] = *numGhostCells; 443cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 444cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 445cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 446cd0c2139SMatthew G Knepley for (c = cEnd; c < cEnd + *numGhostCells; ++c) { 447cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr); 448cd0c2139SMatthew G Knepley } 449cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 450cd0c2139SMatthew G Knepley IS faceIS; 451cd0c2139SMatthew G Knepley const PetscInt *faces; 452cd0c2139SMatthew G Knepley PetscInt numFaces, f; 453cd0c2139SMatthew G Knepley 454cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 455cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 456cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 457cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 458cd0c2139SMatthew G Knepley PetscInt size; 459cd0c2139SMatthew G Knepley 46046c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 461cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr); 462cd0c2139SMatthew 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); 463cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(gdm, faces[f] + *numGhostCells, 2);CHKERRQ(ierr); 464cd0c2139SMatthew G Knepley } 465cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 466cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 467cd0c2139SMatthew G Knepley } 468cd0c2139SMatthew G Knepley /* Step 4: Setup ghosted DM */ 469cd0c2139SMatthew G Knepley ierr = DMSetUp(gdm);CHKERRQ(ierr); 470cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 471cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 472cd0c2139SMatthew G Knepley ghostCell = cEnd; 473cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 474cd0c2139SMatthew G Knepley IS faceIS; 475cd0c2139SMatthew G Knepley const PetscInt *faces; 476cd0c2139SMatthew G Knepley PetscInt numFaces, f; 477cd0c2139SMatthew G Knepley 478cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 479cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 480cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 48146c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 482cd0c2139SMatthew G Knepley PetscInt newFace = faces[f] + *numGhostCells; 483cd0c2139SMatthew G Knepley 48446c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 485cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr); 486cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr); 48746c796b9SMatthew G. Knepley ++ghostCell; 488cd0c2139SMatthew G Knepley } 489cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 490cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 491cd0c2139SMatthew G Knepley } 492cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 493cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 494cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 495cd0c2139SMatthew G Knepley ierr = DMPlexStratify(gdm);CHKERRQ(ierr); 496cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 497cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 498cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 499cd0c2139SMatthew G Knepley ierr = PetscFree(depthShift);CHKERRQ(ierr); 500cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 501cd0c2139SMatthew G Knepley } 502cd0c2139SMatthew G Knepley 503cd0c2139SMatthew G Knepley #undef __FUNCT__ 504cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells" 505cd0c2139SMatthew G Knepley /*@C 506cd0c2139SMatthew G Knepley DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face 507cd0c2139SMatthew G Knepley 508cd0c2139SMatthew G Knepley Collective on dm 509cd0c2139SMatthew G Knepley 510cd0c2139SMatthew G Knepley Input Parameters: 511cd0c2139SMatthew G Knepley + dm - The original DM 512cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL 513cd0c2139SMatthew G Knepley 514cd0c2139SMatthew G Knepley Output Parameters: 515cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM 516cd0c2139SMatthew G Knepley - dmGhosted - The new DM 517cd0c2139SMatthew G Knepley 518cd0c2139SMatthew G Knepley Note: If no label exists of that name, one will be created marking all boundary faces 519cd0c2139SMatthew G Knepley 520cd0c2139SMatthew G Knepley Level: developer 521cd0c2139SMatthew G Knepley 522cd0c2139SMatthew G Knepley .seealso: DMCreate() 52331266bc0SMatthew G. Knepley @*/ 524cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted) 525cd0c2139SMatthew G Knepley { 526cd0c2139SMatthew G Knepley DM gdm; 527cd0c2139SMatthew G Knepley DMLabel label; 528cd0c2139SMatthew G Knepley const char *name = labelName ? labelName : "Face Sets"; 529cd0c2139SMatthew G Knepley PetscInt dim; 530cd0c2139SMatthew G Knepley PetscErrorCode ierr; 531cd0c2139SMatthew G Knepley 532cd0c2139SMatthew G Knepley PetscFunctionBegin; 533cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 534cd0c2139SMatthew G Knepley PetscValidPointer(numGhostCells, 3); 535cd0c2139SMatthew G Knepley PetscValidPointer(dmGhosted, 4); 536cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr); 537cd0c2139SMatthew G Knepley ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr); 538cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 539cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(gdm, dim);CHKERRQ(ierr); 540cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 541cd0c2139SMatthew G Knepley if (!label) { 542cd0c2139SMatthew G Knepley /* Get label for boundary faces */ 543cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr); 544cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 545cd0c2139SMatthew G Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 546cd0c2139SMatthew G Knepley } 547cd0c2139SMatthew G Knepley ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr); 548cd0c2139SMatthew G Knepley ierr = DMSetFromOptions(gdm);CHKERRQ(ierr); 549cd0c2139SMatthew G Knepley *dmGhosted = gdm; 550cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 551cd0c2139SMatthew G Knepley } 552cd0c2139SMatthew G Knepley 553cd0c2139SMatthew G Knepley #undef __FUNCT__ 554cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal" 555607ab7a9SMatthew G. Knepley /* 556*a6ae58d1SMatthew G. Knepley We are adding three kinds of points here: 557607ab7a9SMatthew G. Knepley Replicated: Copies of points which exist in the mesh, such as vertices identified across a fault 558*a6ae58d1SMatthew G. Knepley Non-replicated: Points which exist on the fault, but are not replicated 559607ab7a9SMatthew G. Knepley Hybrid: Entirely new points, such as cohesive cells 560*a6ae58d1SMatthew G. Knepley 561*a6ae58d1SMatthew G. Knepley When creating subsequent cohesive cells, we shift the old hybrid cells to the end of the numbering at 562*a6ae58d1SMatthew G. Knepley each depth so that the new split/hybrid points can be inserted as a block. 563607ab7a9SMatthew G. Knepley */ 564cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm) 565cd0c2139SMatthew G Knepley { 566cd0c2139SMatthew G Knepley MPI_Comm comm; 567607ab7a9SMatthew G. Knepley IS valueIS; 568607ab7a9SMatthew G. Knepley PetscInt numSP = 0; /* The number of depths for which we have replicated points */ 569607ab7a9SMatthew G. Knepley const PetscInt *values; /* List of depths for which we have replicated points */ 57018c5995bSMatthew G. Knepley IS *splitIS; 57118c5995bSMatthew G. Knepley IS *unsplitIS; 572607ab7a9SMatthew G. Knepley PetscInt *numSplitPoints; /* The number of replicated points at each depth */ 57318c5995bSMatthew G. Knepley PetscInt *numUnsplitPoints; /* The number of non-replicated points at each depth which still give rise to hybrid points */ 57436dbac82SMatthew G. Knepley PetscInt *numHybridPoints; /* The number of new hybrid points at each depth */ 57536dbac82SMatthew G. Knepley PetscInt *numHybridPointsOld; /* The number of existing hybrid points at each depth */ 576607ab7a9SMatthew G. Knepley const PetscInt **splitPoints; /* Replicated points for each depth */ 57718c5995bSMatthew G. Knepley const PetscInt **unsplitPoints; /* Non-replicated points for each depth */ 578cd0c2139SMatthew G Knepley PetscSection coordSection; 579cd0c2139SMatthew G Knepley Vec coordinates; 580cd0c2139SMatthew G Knepley PetscScalar *coords; 581607ab7a9SMatthew G. Knepley PetscInt depths[4]; /* Depths in the order that plex points are numbered */ 582*a6ae58d1SMatthew G. Knepley PetscInt *depthMax; /* The first hybrid point at each depth in the original mesh */ 583*a6ae58d1SMatthew G. Knepley PetscInt *depthEnd; /* The point limit at each depth in the original mesh */ 584607ab7a9SMatthew G. Knepley PetscInt *depthShift; /* Number of replicated+hybrid points at each depth */ 585607ab7a9SMatthew G. Knepley PetscInt *depthOffset; /* Prefix sums of depthShift */ 586607ab7a9SMatthew G. Knepley PetscInt *pMaxNew; /* The first replicated point at each depth in the new mesh, hybrids come after this */ 587607ab7a9SMatthew G. Knepley PetscInt *coneNew, *coneONew, *supportNew; 58818c5995bSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v; 589cd0c2139SMatthew G Knepley PetscErrorCode ierr; 590cd0c2139SMatthew G Knepley 591cd0c2139SMatthew G Knepley PetscFunctionBegin; 592cd0c2139SMatthew G Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 593cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 594607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 595fd4b9f15SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 596607ab7a9SMatthew G. Knepley depths[0] = depth; 597607ab7a9SMatthew G. Knepley depths[1] = 0; 598607ab7a9SMatthew G. Knepley depths[2] = depth-1; 599607ab7a9SMatthew G. Knepley depths[3] = 1; 600cd0c2139SMatthew G Knepley /* Count split points and add cohesive cells */ 601607ab7a9SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 602*a6ae58d1SMatthew G. Knepley ierr = PetscMalloc6(depth+1,PetscInt,&depthMax,depth+1,PetscInt,&depthEnd,depth+1,PetscInt,&depthShift,depth+1,PetscInt,&depthOffset,depth+1,PetscInt,&pMaxNew,depth+1,PetscInt,&numHybridPointsOld);CHKERRQ(ierr); 60318c5995bSMatthew G. Knepley ierr = PetscMalloc7(depth+1,IS,&splitIS,depth+1,IS,&unsplitIS,depth+1,PetscInt,&numSplitPoints,depth+1,PetscInt,&numUnsplitPoints,depth+1,PetscInt,&numHybridPoints,depth+1,const PetscInt*,&splitPoints,depth+1,const PetscInt*,&unsplitPoints);CHKERRQ(ierr); 604607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 605607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthOffset, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 606*a6ae58d1SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &depthMax[depth] : NULL, depth>1 ? &depthMax[depth-1] : NULL, depth>2 ? &depthMax[1] : NULL, depth >= 0 ? &depthMax[0] : NULL);CHKERRQ(ierr); 607607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 608607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 609*a6ae58d1SMatthew G. Knepley depthEnd[d] = pMaxNew[d]; 610*a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 611607ab7a9SMatthew G. Knepley numSplitPoints[d] = 0; 61218c5995bSMatthew G. Knepley numUnsplitPoints[d] = 0; 613607ab7a9SMatthew G. Knepley numHybridPoints[d] = 0; 614*a6ae58d1SMatthew G. Knepley numHybridPointsOld[d] = depthMax[d] < 0 ? 0 : depthEnd[d] - depthMax[d]; 615607ab7a9SMatthew G. Knepley splitPoints[d] = NULL; 61618c5995bSMatthew G. Knepley unsplitPoints[d] = NULL; 61718c5995bSMatthew G. Knepley splitIS[d] = NULL; 61818c5995bSMatthew G. Knepley unsplitIS[d] = NULL; 619607ab7a9SMatthew G. Knepley } 620cd0c2139SMatthew G Knepley if (label) { 621cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 622cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 623cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 624cd0c2139SMatthew G Knepley } 625cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 626cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 627cd0c2139SMatthew G Knepley 628cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 62918c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr); 63018c5995bSMatthew G. Knepley if (splitIS[dep]) { 63118c5995bSMatthew G. Knepley ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 63218c5995bSMatthew G. Knepley ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 63318c5995bSMatthew G. Knepley } 63418c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr); 63518c5995bSMatthew G. Knepley if (unsplitIS[dep]) { 63618c5995bSMatthew G. Knepley ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr); 63718c5995bSMatthew G. Knepley ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr); 638cd0c2139SMatthew G Knepley } 639cd0c2139SMatthew G Knepley } 640607ab7a9SMatthew G. Knepley /* Calculate number of hybrid points */ 64118c5995bSMatthew 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 */ 642607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) depthShift[d] = numSplitPoints[d] + numHybridPoints[d]; 643607ab7a9SMatthew G. Knepley for (d = 1; d <= depth; ++d) depthOffset[depths[d]] = depthOffset[depths[d-1]] + depthShift[depths[d-1]]; 644*a6ae58d1SMatthew G. Knepley for (d = 0; d <= depth; ++d) pMaxNew[d] += depthOffset[d] - numHybridPointsOld[d]; 645cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 646cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 647cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 648cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 649cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 650*a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 6514c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 652cd0c2139SMatthew G Knepley const PetscInt *support; 6534c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, qf, qn, qp, e; 654cd0c2139SMatthew G Knepley 655cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 656cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 657cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 658cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 659cd0c2139SMatthew G Knepley if (dep == depth-1) { 6604c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 6614c367dbcSMatthew G. Knepley 662cd0c2139SMatthew G Knepley /* Add cohesive cells, they are prisms */ 6634c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr); 664cd0c2139SMatthew G Knepley } else if (dep == 0) { 6654c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 666cd0c2139SMatthew G Knepley 667cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 6684c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 669cd0c2139SMatthew G Knepley PetscInt val; 670cd0c2139SMatthew G Knepley 671cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 6724c367dbcSMatthew G. Knepley if (val == 1) ++qf; 6734c367dbcSMatthew G. Knepley if ((val == 1) || (val == (shift + 1))) ++qn; 6744c367dbcSMatthew G. Knepley if ((val == 1) || (val == -(shift + 1))) ++qp; 675cd0c2139SMatthew G Knepley } 6764c367dbcSMatthew G. Knepley /* Split old vertex: Edges into original vertex and new cohesive edge */ 6774c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 6784c367dbcSMatthew G. Knepley /* Split new vertex: Edges into split vertex and new cohesive edge */ 6794c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 6804c367dbcSMatthew G. Knepley /* Add hybrid edge */ 6814c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 6824c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 683cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 6844c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 6854c367dbcSMatthew G. Knepley 686cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 6874c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 688cd0c2139SMatthew G Knepley PetscInt val; 689cd0c2139SMatthew G Knepley 690cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 6914c367dbcSMatthew G. Knepley if (val == dim-1) ++qf; 6924c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 6934c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 694cd0c2139SMatthew G Knepley } 6954c367dbcSMatthew G. Knepley /* Split old edge: Faces into original edge and cohesive face (positive side?) */ 6964c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 6974c367dbcSMatthew G. Knepley /* Split new edge: Faces into split edge and cohesive face (negative side?) */ 6984c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 6994c367dbcSMatthew G. Knepley /* Add hybrid face */ 7004c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 7014c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 702cd0c2139SMatthew G Knepley } 703cd0c2139SMatthew G Knepley } 704cd0c2139SMatthew G Knepley } 70518c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 70618c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 70718c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 708*a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 70918c5995bSMatthew G. Knepley const PetscInt *support; 71018c5995bSMatthew G. Knepley PetscInt coneSize, supportSize, qf, qn, qp, e; 71118c5995bSMatthew G. Knepley 71218c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 71318c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 71418c5995bSMatthew G. Knepley if (dep == 0) { 71518c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 71618c5995bSMatthew G. Knepley 71718c5995bSMatthew G. Knepley /* Unsplit vertex: Edges into original vertex, split edge, and new cohesive edge twice */ 71818c5995bSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, supportSize+3);CHKERRQ(ierr); 71918c5995bSMatthew G. Knepley /* Add hybrid edge */ 72018c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 721e1757548SMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 722e1757548SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 723e1757548SMatthew G. Knepley PetscInt val; 724e1757548SMatthew G. Knepley 725e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 726e1757548SMatthew G. Knepley /* Split and unsplit edges produce hybrid faces */ 727e1757548SMatthew G. Knepley if ((val == 1) || (val == (shift2 + 1))) ++qf; 728e1757548SMatthew G. Knepley } 729e1757548SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 73018c5995bSMatthew G. Knepley } else if (dep == dim-2) { 73118c5995bSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 73218c5995bSMatthew G. Knepley 73318c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 73418c5995bSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 735cd0c2139SMatthew G Knepley PetscInt val; 736cd0c2139SMatthew G Knepley 737cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 73818c5995bSMatthew G. Knepley if (val == dim-1) ++qf; 73918c5995bSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 74018c5995bSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 741cd0c2139SMatthew G Knepley } 74218c5995bSMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */ 74318c5995bSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, supportSize+3);CHKERRQ(ierr); 74418c5995bSMatthew G. Knepley /* Add hybrid face */ 74518c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 746e1757548SMatthew G. Knepley /* TODO: Here we should check for neighboring faults for which this is unsplit */ 74718c5995bSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, 1);CHKERRQ(ierr); 748cd0c2139SMatthew G Knepley } 749cd0c2139SMatthew G Knepley } 750cd0c2139SMatthew G Knepley } 751cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 752cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 753cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 754dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 755dcbb62e8SMatthew G. Knepley ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,PetscInt,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,PetscInt,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),PetscInt,&supportNew);CHKERRQ(ierr); 756cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 757cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 758cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 759cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 760*a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 7614c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 762cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 7634c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, q, qf, qn, qp, v, e, s; 764cd0c2139SMatthew G Knepley 765cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 766cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 767cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 768cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 769cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 770cd0c2139SMatthew G Knepley if (dep == depth-1) { 7714c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 772cd0c2139SMatthew G Knepley const PetscInt *supportF; 773cd0c2139SMatthew G Knepley 774cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 775cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 776cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 777cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 778cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 779cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 7804c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 78118c5995bSMatthew G. Knepley if (v < 0) { 78218c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 78318c5995bSMatthew 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); 784*a6ae58d1SMatthew G. Knepley coneNew[2+q] = DMPlexShiftPoint_Internal(cone[q], depth, depthMax, depthEnd, depthShift) /*cone[q] + depthOffset[dep-1]*/; 78518c5995bSMatthew G. Knepley } else { 7864c367dbcSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep-1]; 787cd0c2139SMatthew G Knepley } 788cd0c2139SMatthew G Knepley } 789cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 790cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 791e537020bSMatthew G. Knepley /* Face support */ 792cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 793cd0c2139SMatthew G Knepley PetscInt val; 794cd0c2139SMatthew G Knepley 795cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 796cd0c2139SMatthew G Knepley if (val < 0) { 797cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 7984c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr); 799cd0c2139SMatthew G Knepley } else { 800cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 8014c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr); 802e537020bSMatthew G. Knepley /* Get orientation for cohesive face */ 803e537020bSMatthew G. Knepley { 804e537020bSMatthew G. Knepley const PetscInt *ncone, *nconeO; 805e537020bSMatthew G. Knepley PetscInt nconeSize, nc; 806e537020bSMatthew G. Knepley 807e537020bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 808e537020bSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 809e537020bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 810e537020bSMatthew G. Knepley for (nc = 0; nc < nconeSize; ++nc) { 811e537020bSMatthew G. Knepley if (ncone[nc] == oldp) { 812e537020bSMatthew G. Knepley coneONew[0] = nconeO[nc]; 813e537020bSMatthew G. Knepley break; 814cd0c2139SMatthew G Knepley } 815cd0c2139SMatthew G Knepley } 816e537020bSMatthew 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]); 817e537020bSMatthew G. Knepley } 818e537020bSMatthew G. Knepley } 819e537020bSMatthew G. Knepley } 8204c367dbcSMatthew G. Knepley /* Cohesive cell: Old and new split face, then new cohesive faces */ 821fd4b9f15SMatthew G. Knepley coneNew[0] = newp; /* Extracted negative side orientation above */ 8224c367dbcSMatthew G. Knepley coneNew[1] = splitp; 8234c367dbcSMatthew G. Knepley coneONew[1] = coneONew[0]; 824e537020bSMatthew G. Knepley for (q = 0; q < coneSize; ++q) { 82518c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 82618c5995bSMatthew G. Knepley if (v < 0) { 82718c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 82818c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 82918c5995bSMatthew G. Knepley coneONew[2+q] = 0; 83018c5995bSMatthew G. Knepley } else { 83118c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep]; 83218c5995bSMatthew G. Knepley } 833e537020bSMatthew G. Knepley coneONew[2+q] = 0; 834e537020bSMatthew G. Knepley } 8354c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr); 8364c367dbcSMatthew G. Knepley ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr); 837cd0c2139SMatthew G Knepley } else if (dep == 0) { 8384c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 839cd0c2139SMatthew G Knepley 840cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 8414c367dbcSMatthew G. Knepley for (e = 0, qn = 0; e < supportSize; ++e) { 842cd0c2139SMatthew G Knepley PetscInt val; 843cd0c2139SMatthew G Knepley 844cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 845cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 846*a6ae58d1SMatthew G. Knepley supportNew[qn++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 847cd0c2139SMatthew G Knepley } 848cd0c2139SMatthew G Knepley } 8494c367dbcSMatthew G. Knepley supportNew[qn] = hybedge; 850cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 851cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 8524c367dbcSMatthew G. Knepley for (e = 0, qp = 0; e < supportSize; ++e) { 853cd0c2139SMatthew G Knepley PetscInt val, edge; 854cd0c2139SMatthew G Knepley 855cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 856cd0c2139SMatthew G Knepley if (val == 1) { 8574c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 858cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 8594c367dbcSMatthew G. Knepley supportNew[qp++] = edge + pMaxNew[dep+1]; 860cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 861*a6ae58d1SMatthew G. Knepley supportNew[qp++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 862cd0c2139SMatthew G Knepley } 863cd0c2139SMatthew G Knepley } 8644c367dbcSMatthew G. Knepley supportNew[qp] = hybedge; 865cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 8664c367dbcSMatthew G. Knepley /* Hybrid edge: Old and new split vertex */ 867cd0c2139SMatthew G Knepley coneNew[0] = newp; 868cd0c2139SMatthew G Knepley coneNew[1] = splitp; 8694c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 8704c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 8714c367dbcSMatthew G. Knepley PetscInt val, edge; 8724c367dbcSMatthew G. Knepley 8734c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 8744c367dbcSMatthew G. Knepley if (val == 1) { 8754c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 8764c367dbcSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 8774c367dbcSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 8784c367dbcSMatthew G. Knepley } 8794c367dbcSMatthew G. Knepley } 8804c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 881cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 8824c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 8834c367dbcSMatthew G. Knepley 884cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 885cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 886cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 8874c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 888e1757548SMatthew G. Knepley if (v < 0) { 889e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 890e1757548SMatthew 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); 891*a6ae58d1SMatthew G. Knepley coneNew[q] = DMPlexShiftPoint_Internal(cone[q], depth, depthMax, depthEnd, depthShift) /*cone[q] + depthOffset[dep-1]*/; 892e1757548SMatthew G. Knepley } else { 8934c367dbcSMatthew G. Knepley coneNew[q] = v + pMaxNew[dep-1]; 894cd0c2139SMatthew G Knepley } 895e1757548SMatthew G. Knepley } 896cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 897cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 898cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 899cd0c2139SMatthew G Knepley PetscInt val; 900cd0c2139SMatthew G Knepley 901cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 9024c367dbcSMatthew G. Knepley if (val == dim-1) { 903*a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 9044c367dbcSMatthew G. Knepley } else if (val == (shift + dim-1)) { 905*a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 906cd0c2139SMatthew G Knepley } 907cd0c2139SMatthew G Knepley } 908b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 909cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 910cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 911cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 912cd0c2139SMatthew G Knepley PetscInt val, face; 913cd0c2139SMatthew G Knepley 914cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 915cd0c2139SMatthew G Knepley if (val == dim-1) { 9164c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 917cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 9184c367dbcSMatthew G. Knepley supportNew[q++] = face + pMaxNew[dep+1]; 919cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 920*a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 921cd0c2139SMatthew G Knepley } 922cd0c2139SMatthew G Knepley } 923b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 924cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 9254c367dbcSMatthew G. Knepley /* Hybrid face */ 9264c367dbcSMatthew G. Knepley coneNew[0] = newp; 9274c367dbcSMatthew G. Knepley coneNew[1] = splitp; 9284c367dbcSMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 9294c367dbcSMatthew G. Knepley PetscInt vertex; 9304c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr); 931e1757548SMatthew G. Knepley if (vertex < 0) { 932e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr); 933e1757548SMatthew G. Knepley if (vertex < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate point %d in split or unsplit points of depth %d", cone[v], dep-1); 934e1757548SMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 935e1757548SMatthew G. Knepley } else { 9364c367dbcSMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep]; 9374c367dbcSMatthew G. Knepley } 938e1757548SMatthew G. Knepley } 9394c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 9404c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 9414c367dbcSMatthew G. Knepley PetscInt val, face; 9424c367dbcSMatthew G. Knepley 9434c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 9444c367dbcSMatthew G. Knepley if (val == dim-1) { 9454c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 9464c367dbcSMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 9474c367dbcSMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 9484c367dbcSMatthew G. Knepley } 9494c367dbcSMatthew G. Knepley } 9504c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 951cd0c2139SMatthew G Knepley } 952cd0c2139SMatthew G Knepley } 953cd0c2139SMatthew G Knepley } 95418c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 95518c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 95618c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 957*a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 95818c5995bSMatthew G. Knepley const PetscInt *cone, *support, *ornt; 959e1757548SMatthew G. Knepley PetscInt coneSize, supportSize, supportSizeNew, q, qf, e, f, s; 96018c5995bSMatthew G. Knepley 96118c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 96218c5995bSMatthew G. Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 96318c5995bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 96418c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 96518c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 96618c5995bSMatthew G. Knepley if (dep == 0) { 96718c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 96818c5995bSMatthew G. Knepley 96918c5995bSMatthew G. Knepley /* Unsplit vertex */ 97018c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 97118c5995bSMatthew G. Knepley for (s = 0, q = 0; s < supportSize; ++s) { 972*a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[s], depth, depthMax, depthEnd, depthShift) /*support[s] + depthOffset[dep+1]*/; 97318c5995bSMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 97418c5995bSMatthew G. Knepley if (e >= 0) { 97518c5995bSMatthew G. Knepley supportNew[q++] = e + pMaxNew[dep+1]; 97618c5995bSMatthew G. Knepley } 97718c5995bSMatthew G. Knepley } 97818c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 97918c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 98018c5995bSMatthew G. Knepley if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp); 98118c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 98218c5995bSMatthew G. Knepley /* Hybrid edge */ 98318c5995bSMatthew G. Knepley coneNew[0] = newp; 98418c5995bSMatthew G. Knepley coneNew[1] = newp; 98518c5995bSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 98618c5995bSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 98718c5995bSMatthew G. Knepley PetscInt val, edge; 98818c5995bSMatthew G. Knepley 98918c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 99018c5995bSMatthew G. Knepley if (val == 1) { 99118c5995bSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 99218c5995bSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 99318c5995bSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 994e1757548SMatthew G. Knepley } else if (val == (shift2 + 1)) { 995e1757548SMatthew G. Knepley ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr); 996e1757548SMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]); 997e1757548SMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1]; 99818c5995bSMatthew G. Knepley } 99918c5995bSMatthew G. Knepley } 100018c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1001e1757548SMatthew G. Knepley } else if (dep == dim-2) { 1002e1757548SMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 10036402118dSMatthew G. Knepley PetscInt hybcell = -1; 1004e1757548SMatthew G. Knepley 1005e1757548SMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */ 1006e1757548SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1007e1757548SMatthew G. Knepley PetscInt val, face; 1008e1757548SMatthew G. Knepley 1009e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1010e1757548SMatthew G. Knepley if (val == dim-1) { 1011e1757548SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1012e1757548SMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]); 1013*a6ae58d1SMatthew G. Knepley supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthMax, depthEnd, depthShift) /*support[f] + depthOffset[dep+1]*/; 1014e1757548SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+1]; 1015e1757548SMatthew G. Knepley hybcell = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1016e1757548SMatthew G. Knepley } else { 1017*a6ae58d1SMatthew G. Knepley supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthMax, depthEnd, depthShift) /*support[f] + depthOffset[dep+1]*/; 1018e1757548SMatthew G. Knepley } 1019e1757548SMatthew G. Knepley } 1020e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1021e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1022e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1023e1757548SMatthew G. Knepley /* Add hybrid face */ 1024e1757548SMatthew G. Knepley coneNew[0] = newp; 1025e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[0], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1026e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[0]); 1027e1757548SMatthew G. Knepley coneNew[1] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1028e1757548SMatthew G. Knepley coneNew[2] = newp; 1029e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1030e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]); 1031e1757548SMatthew G. Knepley coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1032e1757548SMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 1033e1757548SMatthew G. Knepley supportNew[0] = hybcell; 1034e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1035cd0c2139SMatthew G Knepley } 1036cd0c2139SMatthew G Knepley } 1037cd0c2139SMatthew G Knepley } 1038cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 1039cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1040cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 1041cd0c2139SMatthew G Knepley IS pIS; 1042cd0c2139SMatthew G Knepley PetscInt numPoints; 1043cd0c2139SMatthew G Knepley const PetscInt *points; 1044cd0c2139SMatthew G Knepley 1045cd0c2139SMatthew G Knepley if (dep >= 0) continue; 1046cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 1047cd0c2139SMatthew G Knepley if (!pIS) continue; 1048cd0c2139SMatthew G Knepley dep = -dep - shift; 1049cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 1050cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 1051cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1052cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 1053*a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*depthOffset[dep] + oldp*/; 1054cd0c2139SMatthew G Knepley const PetscInt *cone; 1055cd0c2139SMatthew G Knepley PetscInt coneSize, c; 105650cf782dSMatthew G. Knepley /* PetscBool replaced = PETSC_FALSE; */ 1057cd0c2139SMatthew G Knepley 1058cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 1059cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 1060cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 1061cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 1062cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1063cd0c2139SMatthew G Knepley const PetscInt coldp = cone[c] - depthOffset[dep-1]; 1064cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 1065cd0c2139SMatthew G Knepley 1066cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 1067cd0c2139SMatthew G Knepley if (val == dep-1) { 1068cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 1069cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 1070cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 1071cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 107250cf782dSMatthew G. Knepley /* replaced = PETSC_TRUE; */ 1073cd0c2139SMatthew G Knepley } 1074cd0c2139SMatthew G Knepley } 10754a189a86SMatthew G. Knepley /* Cells with only a vertex or edge on the submesh have no replacement */ 10764a189a86SMatthew G. Knepley /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 1077cd0c2139SMatthew G Knepley } 1078cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 1079cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 1080cd0c2139SMatthew G Knepley } 1081cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 1082cd0c2139SMatthew G Knepley ierr = DMPlexStratify(sdm);CHKERRQ(ierr); 1083cd0c2139SMatthew G Knepley /* Step 8: Coordinates */ 1084cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1085cd0c2139SMatthew G Knepley ierr = DMPlexGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 1086cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 1087cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 1088cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 1089*a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[0][v], depth, depthMax, depthEnd, depthShift) /*depthOffset[0] + splitPoints[0][v]*/; 1090cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 1091cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 1092cd0c2139SMatthew G Knepley 1093cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 1094cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 1095cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 1096cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 1097cd0c2139SMatthew G Knepley } 1098cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 1099cd0c2139SMatthew G Knepley /* Step 9: SF, if I can figure this out we can split the mesh in parallel */ 1100cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1101cd0c2139SMatthew G Knepley /* Step 10: Labels */ 1102cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1103cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 1104cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1105cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 1106*a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[dep][p], depth, depthMax, depthEnd, depthShift) /*depthOffset[dep] + splitPoints[dep][p]*/; 1107cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 1108cd0c2139SMatthew G Knepley PetscInt l; 1109cd0c2139SMatthew G Knepley 1110cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 1111cd0c2139SMatthew G Knepley DMLabel mlabel; 1112cd0c2139SMatthew G Knepley const char *lname; 1113cd0c2139SMatthew G Knepley PetscInt val; 11149a356370SMatthew G. Knepley PetscBool isDepth; 1115cd0c2139SMatthew G Knepley 1116cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 11179a356370SMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 11189a356370SMatthew G. Knepley if (isDepth) continue; 1119cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 1120cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 1121cd0c2139SMatthew G Knepley if (val >= 0) { 1122cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 11239a356370SMatthew G. Knepley #if 0 11249a356370SMatthew G. Knepley /* Do not put cohesive edges into the label */ 1125cd0c2139SMatthew G Knepley if (dep == 0) { 11264c367dbcSMatthew G. Knepley const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1127cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr); 11284c367dbcSMatthew G. Knepley } else if (dep == dim-2) { 11294c367dbcSMatthew G. Knepley const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 11304c367dbcSMatthew G. Knepley ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr); 1131cd0c2139SMatthew G Knepley } 11324c367dbcSMatthew G. Knepley /* Do not put cohesive faces into the label */ 11339a356370SMatthew G. Knepley #endif 1134cd0c2139SMatthew G Knepley } 1135cd0c2139SMatthew G Knepley } 1136cd0c2139SMatthew G Knepley } 1137cd0c2139SMatthew G Knepley } 1138cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1139cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 1140cd0c2139SMatthew G Knepley 1141cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 114218c5995bSMatthew G. Knepley if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 114318c5995bSMatthew G. Knepley ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr); 114418c5995bSMatthew G. Knepley if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);} 114518c5995bSMatthew G. Knepley ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr); 1146cd0c2139SMatthew G Knepley } 1147cd0c2139SMatthew G Knepley if (label) { 1148cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1149cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1150cd0c2139SMatthew G Knepley } 11510d4d4d06SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 11520d4d4d06SMatthew G. Knepley ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr); 115336dbac82SMatthew G. Knepley pMaxNew[d] = pEnd - numHybridPoints[d] - numHybridPointsOld[d]; 11540d4d4d06SMatthew G. Knepley } 11550e49e2e2SMatthew 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); 1156dcbb62e8SMatthew G. Knepley ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr); 1157*a6ae58d1SMatthew G. Knepley ierr = PetscFree6(depthMax, depthEnd, depthShift, depthOffset, pMaxNew, numHybridPointsOld);CHKERRQ(ierr); 115818c5995bSMatthew G. Knepley ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr); 1159cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1160cd0c2139SMatthew G Knepley } 1161cd0c2139SMatthew G Knepley 1162cd0c2139SMatthew G Knepley #undef __FUNCT__ 1163cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells" 1164cd0c2139SMatthew G Knepley /*@C 1165cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 1166cd0c2139SMatthew G Knepley 1167cd0c2139SMatthew G Knepley Collective on dm 1168cd0c2139SMatthew G Knepley 1169cd0c2139SMatthew G Knepley Input Parameters: 1170cd0c2139SMatthew G Knepley + dm - The original DM 117153156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated) 1172cd0c2139SMatthew G Knepley 1173cd0c2139SMatthew G Knepley Output Parameters: 1174cd0c2139SMatthew G Knepley - dmSplit - The new DM 1175cd0c2139SMatthew G Knepley 1176cd0c2139SMatthew G Knepley Level: developer 1177cd0c2139SMatthew G Knepley 11782be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 1179cd0c2139SMatthew G Knepley @*/ 1180cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 1181cd0c2139SMatthew G Knepley { 1182cd0c2139SMatthew G Knepley DM sdm; 1183cd0c2139SMatthew G Knepley PetscInt dim; 1184cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1185cd0c2139SMatthew G Knepley 1186cd0c2139SMatthew G Knepley PetscFunctionBegin; 1187cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 118853156dfcSMatthew G. Knepley PetscValidPointer(dmSplit, 3); 1189cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 1190cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 1191cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1192cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(sdm, dim);CHKERRQ(ierr); 1193cd0c2139SMatthew G Knepley switch (dim) { 1194cd0c2139SMatthew G Knepley case 2: 1195cd0c2139SMatthew G Knepley case 3: 1196cd0c2139SMatthew G Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 1197cd0c2139SMatthew G Knepley break; 1198cd0c2139SMatthew G Knepley default: 1199cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 1200cd0c2139SMatthew G Knepley } 1201cd0c2139SMatthew G Knepley *dmSplit = sdm; 1202cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1203cd0c2139SMatthew G Knepley } 1204cd0c2139SMatthew G Knepley 1205cd0c2139SMatthew G Knepley #undef __FUNCT__ 12062be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete" 1207cd0c2139SMatthew G Knepley /*@ 12082be2b188SMatthew G Knepley DMPlexLabelCohesiveComplete - Starting with a label marking vertices on an internal surface, we add all other mesh pieces 1209cd0c2139SMatthew G Knepley to complete the surface 1210cd0c2139SMatthew G Knepley 1211cd0c2139SMatthew G Knepley Input Parameters: 1212cd0c2139SMatthew G Knepley + dm - The DM 121347946fd8SMatthew G. Knepley . label - A DMLabel marking the surface vertices 1214bb55d314SMatthew G. Knepley . flip - Flag to flip the submesh normal and replace points on the other side 121547946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL 1216cd0c2139SMatthew G Knepley 1217cd0c2139SMatthew G Knepley Output Parameter: 1218cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 1219cd0c2139SMatthew G Knepley 1220cd0c2139SMatthew G Knepley Level: developer 1221cd0c2139SMatthew G Knepley 12222be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 1223cd0c2139SMatthew G Knepley @*/ 1224bb55d314SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, PetscBool flip, DM subdm) 1225cd0c2139SMatthew G Knepley { 1226d90583fdSMatthew G. Knepley DMLabel depthLabel; 122718c5995bSMatthew G. Knepley IS dimIS, subpointIS, facePosIS, faceNegIS; 122847946fd8SMatthew G. Knepley const PetscInt *points, *subpoints; 1229bb55d314SMatthew G. Knepley const PetscInt rev = flip ? -1 : 1; 123018c5995bSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, dim, dep, cStart, cEnd, numPoints, numSubpoints, p, val; 1231cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1232cd0c2139SMatthew G Knepley 1233cd0c2139SMatthew G Knepley PetscFunctionBegin; 1234d90583fdSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 1235cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 123647946fd8SMatthew G. Knepley if (subdm) { 123747946fd8SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 123847946fd8SMatthew G. Knepley if (subpointIS) { 123947946fd8SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 124047946fd8SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 124147946fd8SMatthew G. Knepley } 124247946fd8SMatthew G. Knepley } 1243d7c8f101SMatthew G. Knepley /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */ 1244cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 1245cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1246cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1247cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1248d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */ 1249cd0c2139SMatthew G Knepley const PetscInt *support; 1250cd0c2139SMatthew G Knepley PetscInt supportSize, s; 1251cd0c2139SMatthew G Knepley 1252cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1253cd0c2139SMatthew G Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 1254cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1255cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1256cd0c2139SMatthew G Knepley const PetscInt *cone, *ornt; 1257cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1258cd0c2139SMatthew G Knepley PetscBool pos = PETSC_TRUE; 1259cd0c2139SMatthew G Knepley 1260cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1261cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1262cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 1263cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1264cd0c2139SMatthew G Knepley if (cone[c] == points[p]) { 126547946fd8SMatthew G. Knepley PetscInt o = ornt[c]; 126647946fd8SMatthew G. Knepley 126747946fd8SMatthew G. Knepley if (subdm) { 126847946fd8SMatthew G. Knepley const PetscInt *subcone, *subornt; 126947946fd8SMatthew G. Knepley PetscInt subpoint, subface, subconeSize, sc; 127047946fd8SMatthew G. Knepley 127147946fd8SMatthew G. Knepley ierr = PetscFindInt(support[s], numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 127247946fd8SMatthew G. Knepley ierr = PetscFindInt(points[p], numSubpoints, subpoints, &subface);CHKERRQ(ierr); 127347946fd8SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 127447946fd8SMatthew G. Knepley ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 127547946fd8SMatthew G. Knepley ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 127647946fd8SMatthew G. Knepley for (sc = 0; sc < subconeSize; ++sc) { 127747946fd8SMatthew G. Knepley if (subcone[sc] == subface) { 127847946fd8SMatthew G. Knepley o = subornt[0]; 127947946fd8SMatthew G. Knepley break; 128047946fd8SMatthew G. Knepley } 128147946fd8SMatthew G. Knepley } 128247946fd8SMatthew 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); 128347946fd8SMatthew G. Knepley } 128447946fd8SMatthew G. Knepley if (o >= 0) { 1285bb55d314SMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr); 1286ffaa4bbcSMatthew G. Knepley pos = rev > 0 ? PETSC_TRUE : PETSC_FALSE; 1287cd0c2139SMatthew G Knepley } else { 1288bb55d314SMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr); 1289ffaa4bbcSMatthew G. Knepley pos = rev > 0 ? PETSC_FALSE : PETSC_TRUE; 1290cd0c2139SMatthew G Knepley } 1291cd0c2139SMatthew G Knepley break; 1292cd0c2139SMatthew G Knepley } 1293cd0c2139SMatthew G Knepley } 1294cd0c2139SMatthew 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]); 1295cd0c2139SMatthew G Knepley /* Put faces touching the fault in the label */ 1296cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1297cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 1298cd0c2139SMatthew G Knepley 1299cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1300cd0c2139SMatthew G Knepley if (val == -1) { 1301cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 1302cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 1303cd0c2139SMatthew G Knepley 1304cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1305cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1306cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 1307cd0c2139SMatthew G Knepley 1308cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1309cd0c2139SMatthew G Knepley if ((val >= 0) && (val < dim-1)) { 1310cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1311cd0c2139SMatthew G Knepley break; 1312cd0c2139SMatthew G Knepley } 1313cd0c2139SMatthew G Knepley } 1314cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1315cd0c2139SMatthew G Knepley } 1316cd0c2139SMatthew G Knepley } 1317cd0c2139SMatthew G Knepley } 1318cd0c2139SMatthew G Knepley } 131947946fd8SMatthew G. Knepley if (subdm) { 132047946fd8SMatthew G. Knepley if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 132147946fd8SMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 132247946fd8SMatthew G. Knepley } 1323cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1324cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1325cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1326cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1327cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 1328cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1329cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1330cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1331d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */ 1332cd0c2139SMatthew G Knepley PetscInt *star = NULL; 1333cd0c2139SMatthew G Knepley PetscInt starSize, s; 1334cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1335cd0c2139SMatthew G Knepley 1336d4622b2cSMatthew G. Knepley /* All points connected to the fault are inside a cell, so at the top level we will only check cells */ 1337cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1338cd0c2139SMatthew G Knepley while (again) { 1339cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1340cd0c2139SMatthew G Knepley again = 0; 1341cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1342cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1343cd0c2139SMatthew G Knepley const PetscInt *cone; 1344cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1345cd0c2139SMatthew G Knepley 1346cd0c2139SMatthew G Knepley if ((point < cStart) || (point >= cEnd)) continue; 1347cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1348cd0c2139SMatthew G Knepley if (val != -1) continue; 1349d4622b2cSMatthew G. Knepley again = again == 1 ? 1 : 2; 1350cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1351cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1352cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1353cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1354cd0c2139SMatthew G Knepley if (val != -1) { 1355d7c8f101SMatthew G. Knepley const PetscInt *ccone; 1356166d9d0cSMatthew G. Knepley PetscInt cconeSize, cc, side; 1357d7c8f101SMatthew G. Knepley 1358cd0c2139SMatthew 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); 135937a6de01SMatthew G. Knepley if (val > 0) side = 1; 136037a6de01SMatthew G. Knepley else side = -1; 136137a6de01SMatthew G. Knepley ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr); 1362d7c8f101SMatthew G. Knepley /* Mark cell faces which touch the fault */ 1363d7c8f101SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr); 1364d7c8f101SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr); 1365d7c8f101SMatthew G. Knepley for (cc = 0; cc < cconeSize; ++cc) { 1366d7c8f101SMatthew G. Knepley PetscInt *closure = NULL; 1367d7c8f101SMatthew G. Knepley PetscInt closureSize, cl; 1368d7c8f101SMatthew G. Knepley 1369166d9d0cSMatthew G. Knepley ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr); 1370166d9d0cSMatthew G. Knepley if (val != -1) continue; 1371d7c8f101SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1372d4622b2cSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1373d7c8f101SMatthew G. Knepley const PetscInt clp = closure[cl]; 1374d7c8f101SMatthew G. Knepley 1375d7c8f101SMatthew G. Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1376d7c8f101SMatthew G. Knepley if (val == -1) continue; 1377d7c8f101SMatthew G. Knepley ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr); 137837a6de01SMatthew G. Knepley break; 137937a6de01SMatthew G. Knepley } 1380d7c8f101SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1381cd0c2139SMatthew G Knepley } 1382cd0c2139SMatthew G Knepley again = 1; 1383cd0c2139SMatthew G Knepley break; 1384cd0c2139SMatthew G Knepley } 1385cd0c2139SMatthew G Knepley } 1386cd0c2139SMatthew G Knepley } 1387cd0c2139SMatthew G Knepley } 1388cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1389cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1390cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1391cd0c2139SMatthew G Knepley 1392cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1393cd0c2139SMatthew G Knepley if (val == -1) { 1394cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1395cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1396cd0c2139SMatthew G Knepley PetscBool marked = PETSC_FALSE; 1397cd0c2139SMatthew G Knepley 1398cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1399cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1400cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1401cd0c2139SMatthew G Knepley 1402cd0c2139SMatthew G Knepley if ((spoint < cStart) || (spoint >= cEnd)) continue; 1403cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1404cd0c2139SMatthew 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); 1405d90583fdSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1406cd0c2139SMatthew G Knepley if (val > 0) { 1407cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1408cd0c2139SMatthew G Knepley } else { 1409cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1410cd0c2139SMatthew G Knepley } 1411cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1412cd0c2139SMatthew G Knepley break; 1413cd0c2139SMatthew G Knepley } 1414cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1415cd0c2139SMatthew G Knepley if (!marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1416cd0c2139SMatthew G Knepley } 1417cd0c2139SMatthew G Knepley } 1418cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1419cd0c2139SMatthew G Knepley } 1420cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1421cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 142218c5995bSMatthew G. Knepley /* If any faces touching the fault divide cells on either side, split them */ 142318c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift+dim-1, &facePosIS);CHKERRQ(ierr); 142418c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr); 142518c5995bSMatthew G. Knepley ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr); 142618c5995bSMatthew G. Knepley ierr = ISDestroy(&facePosIS);CHKERRQ(ierr); 142718c5995bSMatthew G. Knepley ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr); 142818c5995bSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 142918c5995bSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 143018c5995bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 143118c5995bSMatthew G. Knepley const PetscInt point = points[p]; 143218c5995bSMatthew G. Knepley const PetscInt *support; 143318c5995bSMatthew G. Knepley PetscInt supportSize, valA, valB; 143418c5995bSMatthew G. Knepley 143518c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 143618c5995bSMatthew G. Knepley if (supportSize != 2) continue; 143718c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 143818c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr); 143918c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr); 144018c5995bSMatthew G. Knepley if ((valA == -1) || (valB == -1)) continue; 144118c5995bSMatthew G. Knepley if (valA*valB > 0) continue; 144218c5995bSMatthew G. Knepley /* Split the face */ 144318c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr); 144418c5995bSMatthew G. Knepley ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr); 144518c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr); 1446e1757548SMatthew G. Knepley /* Label its closure: 1447e1757548SMatthew G. Knepley unmarked: label as unsplit 1448e1757548SMatthew G. Knepley incident: relabel as split 1449e1757548SMatthew G. Knepley split: do nothing 1450e1757548SMatthew G. Knepley */ 145118c5995bSMatthew G. Knepley { 145218c5995bSMatthew G. Knepley PetscInt *closure = NULL; 145318c5995bSMatthew G. Knepley PetscInt closureSize, cl; 145418c5995bSMatthew G. Knepley 145518c5995bSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 145618c5995bSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 145718c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr); 1458e1757548SMatthew G. Knepley if (valA < 0) { /* Mark as unsplit */ 145918c5995bSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 146018c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr); 1461e1757548SMatthew G. Knepley } else if (valA >= shift) { 1462e1757548SMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 1463e1757548SMatthew G. Knepley ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr); 1464e1757548SMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr); 1465e1757548SMatthew G. Knepley } 146618c5995bSMatthew G. Knepley } 146718c5995bSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 146818c5995bSMatthew G. Knepley } 146918c5995bSMatthew G. Knepley } 147018c5995bSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 147118c5995bSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1472cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1473cd0c2139SMatthew G Knepley } 1474cd0c2139SMatthew G Knepley 1475cd0c2139SMatthew G Knepley #undef __FUNCT__ 14763cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh" 14773cf72582SMatthew G. Knepley /*@C 14783cf72582SMatthew G. Knepley DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface 14793cf72582SMatthew G. Knepley 14803cf72582SMatthew G. Knepley Collective on dm 14813cf72582SMatthew G. Knepley 14823cf72582SMatthew G. Knepley Input Parameters: 14833cf72582SMatthew G. Knepley + dm - The original DM 14843cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices 14853cf72582SMatthew G. Knepley 14863cf72582SMatthew G. Knepley Output Parameters: 14873cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface 14883cf72582SMatthew G. Knepley - dmHybrid - The new DM 14893cf72582SMatthew G. Knepley 14903cf72582SMatthew G. Knepley Level: developer 14913cf72582SMatthew G. Knepley 14923cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate() 14933cf72582SMatthew G. Knepley @*/ 14943cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid) 14953cf72582SMatthew G. Knepley { 14963cf72582SMatthew G. Knepley DM idm; 14973cf72582SMatthew G. Knepley DMLabel subpointMap, hlabel; 14983cf72582SMatthew G. Knepley PetscInt dim; 14993cf72582SMatthew G. Knepley PetscErrorCode ierr; 15003cf72582SMatthew G. Knepley 15013cf72582SMatthew G. Knepley PetscFunctionBegin; 15023cf72582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 15033cf72582SMatthew G. Knepley if (hybridLabel) PetscValidPointer(hybridLabel, 3); 15043cf72582SMatthew G. Knepley PetscValidPointer(dmHybrid, 4); 15053cf72582SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 15063cf72582SMatthew G. Knepley ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr); 15073cf72582SMatthew G. Knepley ierr = DMPlexOrient(idm);CHKERRQ(ierr); 15083cf72582SMatthew G. Knepley ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr); 15093cf72582SMatthew G. Knepley ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr); 15103cf72582SMatthew G. Knepley ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr); 15113cf72582SMatthew G. Knepley ierr = DMPlexLabelCohesiveComplete(dm, hlabel, PETSC_FALSE, idm);CHKERRQ(ierr); 15123cf72582SMatthew G. Knepley ierr = DMDestroy(&idm);CHKERRQ(ierr); 15133cf72582SMatthew G. Knepley ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr); 15143cf72582SMatthew G. Knepley if (hybridLabel) *hybridLabel = hlabel; 151553aa2e23SMatthew G. Knepley else {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);} 1516e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1517e6ccafaeSMatthew G Knepley } 1518e6ccafaeSMatthew G Knepley 1519e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1520efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated" 1521efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 1522efa14ee0SMatthew G Knepley 1523efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 1524efa14ee0SMatthew G Knepley */ 1525830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1526efa14ee0SMatthew G Knepley { 1527fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 1528efa14ee0SMatthew G Knepley const PetscInt *subvertices; 152977d178adSMatthew G. Knepley PetscInt *pStart, *pEnd, *pMax, pSize; 1530efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1531efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1532efa14ee0SMatthew G Knepley 1533efa14ee0SMatthew G Knepley PetscFunctionBegin; 1534efa14ee0SMatthew G Knepley *numFaces = 0; 1535efa14ee0SMatthew G Knepley *nFV = 0; 1536efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1537efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 153877d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 153977d178adSMatthew G. Knepley ierr = PetscMalloc3(pSize,PetscInt,&pStart,pSize,PetscInt,&pEnd,pSize,PetscInt,&pMax);CHKERRQ(ierr); 1540d92e47f8SMatthew 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); 1541efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 1542efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1543efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1544efa14ee0SMatthew G Knepley } 1545efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1546fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1547efa14ee0SMatthew G Knepley if (subvertexIS) { 1548efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1549efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1550efa14ee0SMatthew G Knepley } 1551efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1552efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 15530298fd71SBarry Smith PetscInt *star = NULL; 1554efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 1555efa14ee0SMatthew G Knepley 1556efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1557efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1558efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1559efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1560efa14ee0SMatthew G Knepley } 1561efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 1562efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 15630298fd71SBarry Smith PetscInt *closure = NULL; 1564efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 1565efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 1566efa14ee0SMatthew G Knepley 1567efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 156865560c7fSMatthew G Knepley if (cellLoc == 2) continue; 156982f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1570efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1571efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1572efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1573efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1574efa14ee0SMatthew G Knepley 1575efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1576efa14ee0SMatthew G Knepley ++numCorners; 1577efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1578830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 1579efa14ee0SMatthew G Knepley } 1580efa14ee0SMatthew G Knepley } 158118ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 158282f516ccSBarry 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); 1583efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 1584007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 1585007baee2SMatthew G. Knepley PetscInt numCells, nc; 1586007baee2SMatthew G. Knepley 1587efa14ee0SMatthew G Knepley ++(*numFaces); 1588efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 1589efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 1590efa14ee0SMatthew G Knepley } 1591007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1592007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 1593007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 1594007baee2SMatthew G. Knepley } 1595007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1596efa14ee0SMatthew G Knepley } 1597efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1598efa14ee0SMatthew G Knepley } 1599efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1600efa14ee0SMatthew G Knepley } 1601efa14ee0SMatthew G Knepley if (subvertexIS) { 1602efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1603efa14ee0SMatthew G Knepley } 1604efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1605efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1606efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1607efa14ee0SMatthew G Knepley } 1608efa14ee0SMatthew G Knepley 1609efa14ee0SMatthew G Knepley #undef __FUNCT__ 1610efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated" 1611830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 1612efa14ee0SMatthew G Knepley { 1613efa14ee0SMatthew G Knepley IS subvertexIS; 1614efa14ee0SMatthew G Knepley const PetscInt *subvertices; 1615efa14ee0SMatthew G Knepley PetscInt *pStart, *pEnd, *pMax; 1616efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 1617efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1618efa14ee0SMatthew G Knepley 1619efa14ee0SMatthew G Knepley PetscFunctionBegin; 1620efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1621efa14ee0SMatthew G Knepley ierr = PetscMalloc3(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd,dim+1,PetscInt,&pMax);CHKERRQ(ierr); 16220298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1623efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 1624efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1625efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1626efa14ee0SMatthew G Knepley } 1627efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1628830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 1629efa14ee0SMatthew G Knepley if (subvertexIS) { 1630efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1631efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1632efa14ee0SMatthew G Knepley } 1633efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1634efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 16350298fd71SBarry Smith PetscInt *star = NULL; 1636efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 1637efa14ee0SMatthew G Knepley 1638efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1639efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1640efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1641efa14ee0SMatthew G Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 1642efa14ee0SMatthew G Knepley } 1643efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 1644efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 16450298fd71SBarry Smith PetscInt *closure = NULL; 1646efa14ee0SMatthew G Knepley PetscInt closureSize, c; 1647efa14ee0SMatthew G Knepley PetscInt faceLoc; 1648efa14ee0SMatthew G Knepley 1649efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 1650efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 165182f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 1652efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1653efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1654efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1655efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1656efa14ee0SMatthew G Knepley 1657efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1658efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1659830e53efSMatthew G. Knepley if (vertexLoc != value) break; 1660efa14ee0SMatthew G Knepley } 1661efa14ee0SMatthew G Knepley } 1662efa14ee0SMatthew G Knepley if (c == closureSize*2) { 1663efa14ee0SMatthew G Knepley const PetscInt *support; 1664efa14ee0SMatthew G Knepley PetscInt supportSize, s; 1665efa14ee0SMatthew G Knepley 1666efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1667efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1668efa14ee0SMatthew G Knepley 1669efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 1670efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1671efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1672efa14ee0SMatthew G Knepley break; 1673efa14ee0SMatthew G Knepley } 1674efa14ee0SMatthew G Knepley } 1675efa14ee0SMatthew G Knepley } 1676efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 1677efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 1678efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1679efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1680efa14ee0SMatthew G Knepley } 1681efa14ee0SMatthew G Knepley } 1682efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1683efa14ee0SMatthew G Knepley } 1684efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1685efa14ee0SMatthew G Knepley } 1686efa14ee0SMatthew G Knepley if (subvertexIS) { 1687efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1688efa14ee0SMatthew G Knepley } 1689efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1690efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1691efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1692efa14ee0SMatthew G Knepley } 1693efa14ee0SMatthew G Knepley 1694efa14ee0SMatthew G Knepley #undef __FUNCT__ 1695766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated" 169627c04023SMatthew 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) 1697766ab985SMatthew G. Knepley { 169827c04023SMatthew G. Knepley DMLabel label = NULL; 1699766ab985SMatthew G. Knepley const PetscInt *cone; 170027234c99SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize; 1701766ab985SMatthew G. Knepley PetscErrorCode ierr; 1702766ab985SMatthew G. Knepley 1703812bfc34SJed Brown PetscFunctionBegin; 1704c0ed958bSJed Brown *numFaces = 0; 1705c0ed958bSJed Brown *nFV = 0; 1706b6d5cb33SJed Brown if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1707fed694aaSMatthew G. Knepley *subCells = NULL; 1708766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1709766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1710766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1711766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 171227c04023SMatthew G. Knepley if (label) { 171327c04023SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 171427c04023SMatthew G. Knepley PetscInt val; 171527c04023SMatthew G. Knepley 171627c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 171727c04023SMatthew G. Knepley if (val == value) { 171827c04023SMatthew G. Knepley ++(*numFaces); 171927c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 172027c04023SMatthew G. Knepley } 172127c04023SMatthew G. Knepley } 172227c04023SMatthew G. Knepley } else { 1723766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 172427c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 172527c04023SMatthew G. Knepley } 1726766ab985SMatthew G. Knepley *nFV = hasLagrange ? coneSize/3 : coneSize/2; 1727766ab985SMatthew G. Knepley ierr = PetscMalloc(*numFaces *2 * sizeof(PetscInt), subCells);CHKERRQ(ierr); 1728766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1729766ab985SMatthew G. Knepley const PetscInt *cells; 1730766ab985SMatthew G. Knepley PetscInt numCells; 1731766ab985SMatthew G. Knepley 173227c04023SMatthew G. Knepley if (label) { 173327c04023SMatthew G. Knepley PetscInt val; 173427c04023SMatthew G. Knepley 173527c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 173627c04023SMatthew G. Knepley if (val != value) continue; 173727c04023SMatthew G. Knepley } 1738766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1739766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 1740766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 1741766ab985SMatthew G. Knepley } 1742766ab985SMatthew G. Knepley /* Negative face */ 1743766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 174427234c99SMatthew G. Knepley /* Not true in parallel 174527234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 1746766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 1747766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 174827234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 1749766ab985SMatthew G. Knepley } 1750766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 1751766ab985SMatthew G. Knepley /* Positive face is not included */ 1752766ab985SMatthew G. Knepley } 1753766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1754766ab985SMatthew G. Knepley } 1755766ab985SMatthew G. Knepley 1756766ab985SMatthew G. Knepley #undef __FUNCT__ 1757766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated" 1758b3154360SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DMLabel subpointMap, DM subdm) 1759766ab985SMatthew G. Knepley { 176027c04023SMatthew G. Knepley DMLabel label = NULL; 1761766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 1762766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 1763766ab985SMatthew G. Knepley PetscErrorCode ierr; 1764766ab985SMatthew G. Knepley 1765812bfc34SJed Brown PetscFunctionBegin; 176627c04023SMatthew G. Knepley if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1767766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1768766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1769766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1770766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 1771766ab985SMatthew G. Knepley ierr = PetscMalloc2(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd);CHKERRQ(ierr); 1772b3154360SMatthew G. Knepley for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);} 1773766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1774766ab985SMatthew G. Knepley const PetscInt *cone; 1775766ab985SMatthew G. Knepley PetscInt *closure = NULL; 1776b3154360SMatthew G. Knepley PetscInt fconeSize, coneSize, closureSize, cl, val; 1777766ab985SMatthew G. Knepley 177827c04023SMatthew G. Knepley if (label) { 177927c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 178027c04023SMatthew G. Knepley if (val != value) continue; 178127c04023SMatthew G. Knepley } 1782766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 1783766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1784b3154360SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr); 1785b3154360SMatthew G. Knepley if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 1786b3154360SMatthew G. Knepley /* Negative face */ 1787766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1788766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1789766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 1790766ab985SMatthew G. Knepley 1791766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 1792766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1793766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1794766ab985SMatthew G. Knepley break; 1795766ab985SMatthew G. Knepley } 1796766ab985SMatthew G. Knepley } 1797766ab985SMatthew G. Knepley } 1798766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1799766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 1800766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 1801766ab985SMatthew G. Knepley const PetscInt *support; 1802766ab985SMatthew G. Knepley PetscInt supportSize, s; 1803766ab985SMatthew G. Knepley 1804766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 1805766ab985SMatthew G. Knepley if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); 1806766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 1807766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 1808766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1809766ab985SMatthew G. Knepley } 1810766ab985SMatthew G. Knepley } 1811766ab985SMatthew G. Knepley } 1812766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 1813766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1814766ab985SMatthew G. Knepley } 1815766ab985SMatthew G. Knepley 1816766ab985SMatthew G. Knepley #undef __FUNCT__ 1817e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation" 1818e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 1819e6ccafaeSMatthew G Knepley { 182082f516ccSBarry Smith MPI_Comm comm; 1821e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 1822e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 1823e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 1824e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1825e6ccafaeSMatthew G Knepley 182682f516ccSBarry Smith PetscFunctionBegin; 182782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1828e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &cellDim);CHKERRQ(ierr); 1829e6ccafaeSMatthew G Knepley if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 1830e6ccafaeSMatthew G Knepley 1831ddeab2a6SMatthew G. Knepley if (cellDim == 1 && numCorners == 2) { 1832ddeab2a6SMatthew G. Knepley /* Triangle */ 1833e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 1834e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1835ddeab2a6SMatthew G. Knepley } else if (cellDim == 2 && numCorners == 3) { 1836ddeab2a6SMatthew G. Knepley /* Triangle */ 1837ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 1838ddeab2a6SMatthew G. Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1839ddeab2a6SMatthew G. Knepley } else if (cellDim == 3 && numCorners == 4) { 1840ddeab2a6SMatthew G. Knepley /* Tetrahedron */ 1841ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 1842ddeab2a6SMatthew G. Knepley posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1843e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 1844e6ccafaeSMatthew G Knepley /* Quadratic line */ 1845e6ccafaeSMatthew G Knepley faceSize = 1; 1846e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1847e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 1848e6ccafaeSMatthew G Knepley /* Quads */ 1849e6ccafaeSMatthew G Knepley faceSize = 2; 1850e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 1851e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1852e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 1853e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1854e6ccafaeSMatthew G Knepley } else { 1855e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 1856e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 1857e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 1858e6ccafaeSMatthew G Knepley } 1859e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 1860e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 1861e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 1862e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 1863e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 1864e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1865e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 1866e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 1867e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 1868e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 1869e6ccafaeSMatthew G Knepley }; 1870e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 1871e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 1872e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 1873e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 1874e6ccafaeSMatthew G Knepley }; 1875e6ccafaeSMatthew G Knepley 1876e6ccafaeSMatthew G Knepley faceSize = faceSizeTri; 1877e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 1878e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 1879e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 1880e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 1881e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1882e6ccafaeSMatthew G Knepley 1883e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 1884e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 1885e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 1886e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 1887e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 1888e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1889e6ccafaeSMatthew G Knepley break; 1890e6ccafaeSMatthew G Knepley } 1891e6ccafaeSMatthew G Knepley } 1892e6ccafaeSMatthew G Knepley } 1893e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1894e6ccafaeSMatthew G Knepley break; 1895e6ccafaeSMatthew G Knepley } 1896e6ccafaeSMatthew G Knepley } 1897e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 1898e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1899e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1900e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 1901e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 1902e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 1903e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 1904e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 1905e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1906e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 1907e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 1908e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 1909e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 1910e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 1911e6ccafaeSMatthew G Knepley }; 1912e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 1913e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 1914e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 1915e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 1916e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 1917e6ccafaeSMatthew G Knepley }; 1918e6ccafaeSMatthew G Knepley 1919e6ccafaeSMatthew G Knepley faceSize = faceSizeQuad; 1920e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 1921e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 1922e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 1923e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 1924e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1925e6ccafaeSMatthew G Knepley 1926e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 1927e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 1928e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 1929e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 1930e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 1931e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1932e6ccafaeSMatthew G Knepley break; 1933e6ccafaeSMatthew G Knepley } 1934e6ccafaeSMatthew G Knepley } 1935e6ccafaeSMatthew G Knepley } 1936e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1937e6ccafaeSMatthew G Knepley break; 1938e6ccafaeSMatthew G Knepley } 1939e6ccafaeSMatthew G Knepley } 1940e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 1941e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1942e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1943e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 1944e6ccafaeSMatthew G Knepley /* Hexes 1945e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 1946e6ccafaeSMatthew G Knepley pointing up at the second. 1947e6ccafaeSMatthew G Knepley 1948e6ccafaeSMatthew G Knepley 7---6 1949e6ccafaeSMatthew G Knepley /| /| 1950e6ccafaeSMatthew G Knepley 4---5 | 1951ddeab2a6SMatthew G. Knepley | 1-|-2 1952e6ccafaeSMatthew G Knepley |/ |/ 1953ddeab2a6SMatthew G. Knepley 0---3 1954e6ccafaeSMatthew G Knepley 1955e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 1956e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 1957e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 1958e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1959e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 1960e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 1961e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 1962ddeab2a6SMatthew G. Knepley 0, 3, 4, 5, /* front */ 1963ddeab2a6SMatthew G. Knepley 2, 3, 5, 6, /* right */ 1964ddeab2a6SMatthew G. Knepley 1, 2, 6, 7, /* back */ 1965ddeab2a6SMatthew G. Knepley 0, 1, 4, 7, /* left */ 1966e6ccafaeSMatthew G Knepley }; 1967e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 1968ddeab2a6SMatthew G. Knepley 1, 2, 3, 0, /* bottom */ 1969e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 1970ddeab2a6SMatthew G. Knepley 0, 3, 5, 4, /* front */ 1971ddeab2a6SMatthew G. Knepley 3, 2, 6, 5, /* right */ 1972ddeab2a6SMatthew G. Knepley 2, 1, 7, 6, /* back */ 1973ddeab2a6SMatthew G. Knepley 1, 0, 4, 7, /* left */ 1974e6ccafaeSMatthew G Knepley }; 1975e6ccafaeSMatthew G Knepley 1976e6ccafaeSMatthew G Knepley faceSize = faceSizeHex; 1977e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 1978e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 1979e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 1980e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 1981e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1982e6ccafaeSMatthew G Knepley 1983e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 1984e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 1985e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 1986e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 1987e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 1988e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 1989e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 1990e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1991e6ccafaeSMatthew G Knepley break; 1992e6ccafaeSMatthew G Knepley } 1993e6ccafaeSMatthew G Knepley } 1994e6ccafaeSMatthew G Knepley } 1995e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1996e6ccafaeSMatthew G Knepley break; 1997e6ccafaeSMatthew G Knepley } 1998e6ccafaeSMatthew G Knepley } 1999e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2000e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2001e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2002e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 2003e6ccafaeSMatthew G Knepley /* Quadratic tet */ 2004e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 2005e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 2006e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 2007e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2008e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 2009e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2010e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 2011e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 2012e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 2013e6ccafaeSMatthew G Knepley }; 2014e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 2015e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2016e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 2017e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 2018e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 2019e6ccafaeSMatthew G Knepley }; 2020e6ccafaeSMatthew G Knepley 2021e6ccafaeSMatthew G Knepley faceSize = faceSizeTet; 2022e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 2023e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 2024e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 2025e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 2026e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2027e6ccafaeSMatthew G Knepley 2028e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 2029e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 2030e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 2031e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 2032e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 2033e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 2034e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 2035e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2036e6ccafaeSMatthew G Knepley break; 2037e6ccafaeSMatthew G Knepley } 2038e6ccafaeSMatthew G Knepley } 2039e6ccafaeSMatthew G Knepley } 2040e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2041e6ccafaeSMatthew G Knepley break; 2042e6ccafaeSMatthew G Knepley } 2043e6ccafaeSMatthew G Knepley } 2044e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 2045e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2046e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2047e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 2048e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 2049e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2050e6ccafaeSMatthew G Knepley pointing up at the second. 2051e6ccafaeSMatthew G Knepley 2052e6ccafaeSMatthew G Knepley 7---6 2053e6ccafaeSMatthew G Knepley /| /| 2054e6ccafaeSMatthew G Knepley 4---5 | 2055e6ccafaeSMatthew G Knepley | 3-|-2 2056e6ccafaeSMatthew G Knepley |/ |/ 2057e6ccafaeSMatthew G Knepley 0---1 2058e6ccafaeSMatthew G Knepley 2059e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2060e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 2061e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 2062e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2063e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 2064e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 2065e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2066e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 2067e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 2068e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 2069e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 2070e6ccafaeSMatthew G Knepley }; 2071e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 2072e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 2073e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2074e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 2075e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 2076e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 2077e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 2078e6ccafaeSMatthew G Knepley }; 2079e6ccafaeSMatthew G Knepley 2080e6ccafaeSMatthew G Knepley faceSize = faceSizeQuadHex; 2081e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 2082e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 2083e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2084e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 2085e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2086e6ccafaeSMatthew G Knepley 2087e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 2088e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 2089e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 2090e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 2091e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 2092e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 2093e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 2094e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2095e6ccafaeSMatthew G Knepley break; 2096e6ccafaeSMatthew G Knepley } 2097e6ccafaeSMatthew G Knepley } 2098e6ccafaeSMatthew G Knepley } 2099e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2100e6ccafaeSMatthew G Knepley break; 2101e6ccafaeSMatthew G Knepley } 2102e6ccafaeSMatthew G Knepley } 2103e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2104e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2105e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2106e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 2107e6ccafaeSMatthew G Knepley if (!posOrient) { 2108e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 2109e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 2110e6ccafaeSMatthew G Knepley } else { 2111e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 2112e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 2113e6ccafaeSMatthew G Knepley } 2114e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 2115e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2116e6ccafaeSMatthew G Knepley } 2117e6ccafaeSMatthew G Knepley 2118e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2119e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace" 2120e6ccafaeSMatthew G Knepley /* 2121e6ccafaeSMatthew G Knepley Given a cell and a face, as a set of vertices, 2122e6ccafaeSMatthew G Knepley return the oriented face, as a set of vertices, in faceVertices 2123e6ccafaeSMatthew G Knepley The orientation is such that the face normal points out of the cell 2124e6ccafaeSMatthew G Knepley */ 2125e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2126e6ccafaeSMatthew G Knepley { 21270298fd71SBarry Smith const PetscInt *cone = NULL; 2128e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 2129e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 2130e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2131e6ccafaeSMatthew G Knepley 2132e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2133e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 2134e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 2135e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 2136e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2137e6ccafaeSMatthew G Knepley 2138e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 2139e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 2140e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 2141e6ccafaeSMatthew G Knepley } 2142e6ccafaeSMatthew G Knepley } 2143e6ccafaeSMatthew G Knepley if (found) { 2144e6ccafaeSMatthew G Knepley indices[v2] = v; 2145e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 2146e6ccafaeSMatthew G Knepley ++v2; 2147e6ccafaeSMatthew G Knepley } else { 2148e6ccafaeSMatthew G Knepley oppositeVertex = v; 2149e6ccafaeSMatthew G Knepley } 2150e6ccafaeSMatthew G Knepley } 2151e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 2152e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2153e6ccafaeSMatthew G Knepley } 2154e6ccafaeSMatthew G Knepley 2155e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2156cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal" 2157e6ccafaeSMatthew G Knepley /* 2158cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 2159e6ccafaeSMatthew G Knepley 2160e6ccafaeSMatthew G Knepley Not collective 2161e6ccafaeSMatthew G Knepley 2162e6ccafaeSMatthew G Knepley Input Parameters: 2163e6ccafaeSMatthew G Knepley + dm - The DMPlex 2164e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 2165e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 2166e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 2167e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 2168e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 2169e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 2170e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 2171e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 2172e6ccafaeSMatthew G Knepley 2173e6ccafaeSMatthew G Knepley Output Parameters: 2174e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 2175e6ccafaeSMatthew G Knepley 2176e6ccafaeSMatthew G Knepley Level: developer 2177e6ccafaeSMatthew G Knepley */ 2178cd0c2139SMatthew 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) 2179e6ccafaeSMatthew G Knepley { 218082f516ccSBarry Smith MPI_Comm comm; 2181e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 2182e6ccafaeSMatthew G Knepley const PetscInt *faces; 2183e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 2184e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2185e6ccafaeSMatthew G Knepley 2186e6ccafaeSMatthew G Knepley PetscFunctionBegin; 218782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2188e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 2189e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 2190e6ccafaeSMatthew G Knepley #if 0 2191e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 2192e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2193e6ccafaeSMatthew G Knepley #else 2194e6ccafaeSMatthew G Knepley { 2195e6ccafaeSMatthew G Knepley PetscInt f; 2196e6ccafaeSMatthew G Knepley 2197e6ccafaeSMatthew G Knepley numFaces = 0; 2198e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2199e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 2200e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 2201e6ccafaeSMatthew G Knepley 2202e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 2203e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 2204e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 2205e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 2206e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 2207e6ccafaeSMatthew G Knepley PetscInt v; 2208e6ccafaeSMatthew G Knepley 2209e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2210e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 2211e6ccafaeSMatthew G Knepley } 2212e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 2213e6ccafaeSMatthew G Knepley } 2214e6ccafaeSMatthew G Knepley if (d == dof) { 2215e6ccafaeSMatthew G Knepley numFaces = 1; 2216e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 2217e6ccafaeSMatthew G Knepley } 2218e6ccafaeSMatthew G Knepley } 2219e6ccafaeSMatthew G Knepley } 2220e6ccafaeSMatthew G Knepley #endif 2221e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 2222e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 2223e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 2224766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 2225e6ccafaeSMatthew G Knepley } else { 2226e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 2227e6ccafaeSMatthew G Knepley PetscBool posOriented; 2228e6ccafaeSMatthew G Knepley 2229e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2230e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 2231e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 2232e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 2233e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 2234e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 2235e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2236e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 2237e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 2238e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 2239e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 2240e6ccafaeSMatthew G Knepley break; 2241e6ccafaeSMatthew G Knepley } 2242e6ccafaeSMatthew G Knepley } 2243e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 2244e6ccafaeSMatthew G Knepley } 2245e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 2246e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 2247e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2248e6ccafaeSMatthew G Knepley ++(*newFacePoint); 2249e6ccafaeSMatthew G Knepley } 2250ef07cca7SMatthew G. Knepley #if 0 2251e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2252ef07cca7SMatthew G. Knepley #else 2253ef07cca7SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2254ef07cca7SMatthew G. Knepley #endif 2255e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2256e6ccafaeSMatthew G Knepley } 2257e6ccafaeSMatthew G Knepley 2258e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2259e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated" 226053156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2261e6ccafaeSMatthew G Knepley { 226282f516ccSBarry Smith MPI_Comm comm; 226353156dfcSMatthew G. Knepley DMLabel subpointMap; 2264efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 2265efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 2266efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 2267fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 2268efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 2269e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2270e6ccafaeSMatthew G Knepley 2271e6ccafaeSMatthew G Knepley PetscFunctionBegin; 227282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2273efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2274efa14ee0SMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2275efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2276efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 227753156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);} 2278efa14ee0SMatthew G Knepley /* Setup chart */ 2279efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2280efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2281efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2282efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2283e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2284e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 2285efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 2286e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 2287efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2288efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2289efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 2290efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2291e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2292e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2293e6ccafaeSMatthew G Knepley } 2294e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2295e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2296e6ccafaeSMatthew G Knepley } 2297e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2298e6ccafaeSMatthew G Knepley /* Create face cones */ 2299efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 23000298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2301efa14ee0SMatthew G Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2302e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2303e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 2304efa14ee0SMatthew G Knepley const PetscInt subcell = c; 23050298fd71SBarry Smith PetscInt *closure = NULL; 2306efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 2307e6ccafaeSMatthew G Knepley 2308e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2309efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2310efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 2311e6ccafaeSMatthew G Knepley PetscInt subVertex; 2312e6ccafaeSMatthew G Knepley 2313efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 2314efa14ee0SMatthew G Knepley ++numCorners; 2315efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 2316efa14ee0SMatthew G Knepley if (subVertex >= 0) { 2317efa14ee0SMatthew G Knepley closure[faceSize] = point; 231865560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 2319e6ccafaeSMatthew G Knepley ++faceSize; 2320e6ccafaeSMatthew G Knepley } 2321e6ccafaeSMatthew G Knepley } 2322e6ccafaeSMatthew G Knepley } 2323efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 2324efa14ee0SMatthew G Knepley if (faceSize == nFV) { 2325cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 2326e6ccafaeSMatthew G Knepley } 232765560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2328e6ccafaeSMatthew G Knepley } 2329efa14ee0SMatthew G Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2330e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2331e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2332e6ccafaeSMatthew G Knepley /* Build coordinates */ 2333efa14ee0SMatthew G Knepley { 2334efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 2335efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 2336efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 2337285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2338efa14ee0SMatthew G Knepley 2339e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2340e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2341e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2342285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2343285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2344285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2345efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2346efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2347efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2348efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2349efa14ee0SMatthew G Knepley PetscInt dof; 2350efa14ee0SMatthew G Knepley 2351efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2352efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2353285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2354e6ccafaeSMatthew G Knepley } 2355e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2356e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2357e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2358e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 23592eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2360830e53efSMatthew G. Knepley if (coordSize) { 2361e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2362e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2363efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2364efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2365efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2366efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2367e6ccafaeSMatthew G Knepley 2368e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2369e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2370efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2371efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2372efa14ee0SMatthew 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); 2373e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2374e6ccafaeSMatthew G Knepley } 2375e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2376e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 23773b399e24SMatthew G. Knepley } 2378e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2379e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2380e6ccafaeSMatthew G Knepley } 2381efa14ee0SMatthew G Knepley /* Cleanup */ 2382efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2383efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2384efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2385efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2386e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2387e6ccafaeSMatthew G Knepley } 2388e6ccafaeSMatthew G Knepley 2389e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2390e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated" 239153156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2392e6ccafaeSMatthew G Knepley { 239382f516ccSBarry Smith MPI_Comm comm; 239453156dfcSMatthew G. Knepley DMLabel subpointMap; 2395efa14ee0SMatthew G Knepley IS *subpointIS; 2396efa14ee0SMatthew G Knepley const PetscInt **subpoints; 239701a2673eSMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *coneONew; 2398efa14ee0SMatthew G Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2399e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2400e6ccafaeSMatthew G Knepley 2401e6ccafaeSMatthew G Knepley PetscFunctionBegin; 240282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2403efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2404e6ccafaeSMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2405efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2406efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 240753156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Interpolated(dm, vertexLabel, value, subpointMap, subdm);CHKERRQ(ierr);} 2408efa14ee0SMatthew G Knepley /* Setup chart */ 2409efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2410efa14ee0SMatthew G Knepley ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr); 2411e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2412e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2413e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 2414e6ccafaeSMatthew G Knepley } 2415e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2416e6ccafaeSMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2417e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2418e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 2419e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2420e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2421e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2422e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2423e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2424e6ccafaeSMatthew G Knepley ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2425e6ccafaeSMatthew G Knepley } 2426e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2427e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2428e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2429e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2430e6ccafaeSMatthew G Knepley const PetscInt *cone; 2431e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 2432e6ccafaeSMatthew G Knepley 2433e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2434e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2435e6ccafaeSMatthew G Knepley if (d == dim) { 2436e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2437e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2438e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2439e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 2440e6ccafaeSMatthew G Knepley } 2441e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2442e6ccafaeSMatthew G Knepley } 2443e6ccafaeSMatthew G Knepley } 2444e6ccafaeSMatthew G Knepley } 2445e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2446e6ccafaeSMatthew G Knepley /* Set cones */ 24470298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 244801a2673eSMatthew G. Knepley ierr = PetscMalloc2(maxConeSize,PetscInt,&coneNew,maxConeSize,PetscInt,&coneONew);CHKERRQ(ierr); 2449e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2450e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2451e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2452e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 24530e49e2e2SMatthew G. Knepley const PetscInt *cone, *ornt; 2454e6ccafaeSMatthew G Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2455e6ccafaeSMatthew G Knepley 2456e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2457e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2458e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 24590e49e2e2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2460e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2461e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 246201a2673eSMatthew G. Knepley if (subc >= 0) { 246301a2673eSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 246401a2673eSMatthew G. Knepley coneONew[coneSizeNew] = ornt[c]; 246501a2673eSMatthew G. Knepley ++coneSizeNew; 246601a2673eSMatthew G. Knepley } 2467e6ccafaeSMatthew G Knepley } 2468e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2469e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 247001a2673eSMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, coneONew);CHKERRQ(ierr); 2471e6ccafaeSMatthew G Knepley } 2472e6ccafaeSMatthew G Knepley } 247301a2673eSMatthew G. Knepley ierr = PetscFree2(coneNew,coneONew);CHKERRQ(ierr); 2474e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2475e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2476e6ccafaeSMatthew G Knepley /* Build coordinates */ 2477e6ccafaeSMatthew G Knepley { 2478e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 2479e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 2480e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 2481285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2482e6ccafaeSMatthew G Knepley 2483e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2484e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2485e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2486285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2487285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2488285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2489e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2490e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2491e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2492e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2493e6ccafaeSMatthew G Knepley PetscInt dof; 2494e6ccafaeSMatthew G Knepley 2495e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2496e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2497285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2498e6ccafaeSMatthew G Knepley } 2499e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2500e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2501e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2502e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 25032eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2504e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2505e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2506e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2507e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2508e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2509e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2510e6ccafaeSMatthew G Knepley 2511e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2512e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2513e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2514e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2515e6ccafaeSMatthew 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); 2516efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2517e6ccafaeSMatthew G Knepley } 2518e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2519e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2520e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2521e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2522e6ccafaeSMatthew G Knepley } 2523efa14ee0SMatthew G Knepley /* Cleanup */ 2524e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2525e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2526e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2527e6ccafaeSMatthew G Knepley } 2528efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2529e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2530e6ccafaeSMatthew G Knepley } 2531e6ccafaeSMatthew G Knepley 2532e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2533e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh" 2534d0fa310fSMatthew G. Knepley /*@ 2535e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 2536e6ccafaeSMatthew G Knepley 2537e6ccafaeSMatthew G Knepley Input Parameters: 2538e6ccafaeSMatthew G Knepley + dm - The original mesh 2539830e53efSMatthew G. Knepley . vertexLabel - The DMLabel marking vertices contained in the surface 2540830e53efSMatthew G. Knepley - value - The label value to use 2541e6ccafaeSMatthew G Knepley 2542e6ccafaeSMatthew G Knepley Output Parameter: 2543e6ccafaeSMatthew G Knepley . subdm - The surface mesh 2544e6ccafaeSMatthew G Knepley 2545e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2546e6ccafaeSMatthew G Knepley 2547e6ccafaeSMatthew G Knepley Level: developer 2548e6ccafaeSMatthew G Knepley 2549e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue() 2550830e53efSMatthew G. Knepley @*/ 255153156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm) 2552e6ccafaeSMatthew G Knepley { 2553e6ccafaeSMatthew G Knepley PetscInt dim, depth; 2554e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2555e6ccafaeSMatthew G Knepley 2556e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2557e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2558766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 2559e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2560e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 256182f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2562e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2563e6ccafaeSMatthew G Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2564e6ccafaeSMatthew G Knepley if (depth == dim) { 2565830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2566e6ccafaeSMatthew G Knepley } else { 2567830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2568e6ccafaeSMatthew G Knepley } 2569e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2570e6ccafaeSMatthew G Knepley } 2571e6ccafaeSMatthew G Knepley 2572e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2573aca35d17SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal" 2574aca35d17SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 2575aca35d17SMatthew G. Knepley { 2576aca35d17SMatthew G. Knepley PetscInt subPoint; 2577aca35d17SMatthew G. Knepley PetscErrorCode ierr; 2578aca35d17SMatthew G. Knepley 2579aca35d17SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 2580aca35d17SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 2581aca35d17SMatthew G. Knepley } 2582aca35d17SMatthew G. Knepley 2583aca35d17SMatthew G. Knepley #undef __FUNCT__ 2584766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated" 258527c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 2586766ab985SMatthew G. Knepley { 2587766ab985SMatthew G. Knepley MPI_Comm comm; 2588766ab985SMatthew G. Knepley DMLabel subpointMap; 2589766ab985SMatthew G. Knepley IS subvertexIS; 2590766ab985SMatthew G. Knepley const PetscInt *subVertices; 2591fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 2592766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 259387feddfdSMatthew G. Knepley PetscInt cMax, c, f; 2594766ab985SMatthew G. Knepley PetscErrorCode ierr; 2595766ab985SMatthew G. Knepley 2596766ab985SMatthew G. Knepley PetscFunctionBegin; 2597766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 2598766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2599766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2600766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2601766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 260227c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 2603766ab985SMatthew G. Knepley /* Setup chart */ 2604766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2605766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2606766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2607766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2608766ab985SMatthew G. Knepley /* Set cone sizes */ 2609766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 2610766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 2611766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 2612766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2613766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2614766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2615766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2616766ab985SMatthew G. Knepley } 2617766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2618766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2619766ab985SMatthew G. Knepley } 2620766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2621766ab985SMatthew G. Knepley /* Create face cones */ 2622766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 262387feddfdSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2624766ab985SMatthew G. Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2625766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2626766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 2627766ab985SMatthew G. Knepley const PetscInt subcell = c; 262887feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 262987feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 2630766ab985SMatthew G. Knepley 263187feddfdSMatthew G. Knepley if (cell < cMax) continue; 263287feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 263387feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 263487feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 263587feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 263687feddfdSMatthew G. Knepley } 263787feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 263887feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 263987feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 264027234c99SMatthew G. Knepley /* Not true in parallel 264127234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 264287feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 264387feddfdSMatthew G. Knepley PetscInt negsubcell; 2644766ab985SMatthew G. Knepley 264587feddfdSMatthew G. Knepley if (cells[p] >= cMax) continue; 264687feddfdSMatthew G. Knepley /* I know this is a crap search */ 264787feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 264887feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 2649766ab985SMatthew G. Knepley } 265087feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 265187feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 2652766ab985SMatthew G. Knepley } 265387feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 265487feddfdSMatthew G. Knepley ++newFacePoint; 2655766ab985SMatthew G. Knepley } 2656766ab985SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2657766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2658766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2659766ab985SMatthew G. Knepley /* Build coordinates */ 2660766ab985SMatthew G. Knepley { 2661766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2662766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2663766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2664285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2665766ab985SMatthew G. Knepley 2666766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2667766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2668766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2669285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2670285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2671285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2672766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2673766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2674766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2675766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2676766ab985SMatthew G. Knepley PetscInt dof; 2677766ab985SMatthew G. Knepley 2678766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2679766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2680285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2681766ab985SMatthew G. Knepley } 2682766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2683766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2684766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2685766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 26862eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2687766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2688766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2689766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2690766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2691766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2692766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 2693766ab985SMatthew G. Knepley 2694766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2695766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2696766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2697766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2698766ab985SMatthew 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); 2699766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2700766ab985SMatthew G. Knepley } 2701766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2702766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2703766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2704766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2705766ab985SMatthew G. Knepley } 2706aca35d17SMatthew G. Knepley /* Build SF */ 2707aca35d17SMatthew G. Knepley CHKMEMQ; 2708aca35d17SMatthew G. Knepley { 2709aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 2710aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 2711bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 2712aca35d17SMatthew G. Knepley const PetscInt *localPoints; 2713bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 271449c26ae4SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 2715bdcf2095SMatthew G. Knepley PetscMPIInt rank; 2716aca35d17SMatthew G. Knepley 2717bdcf2095SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 2718aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 2719aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 2720aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2721aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 2722aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 2723aca35d17SMatthew G. Knepley if (numRoots >= 0) { 2724aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 2725bdcf2095SMatthew G. Knepley ierr = PetscMalloc2(pEnd-pStart,PetscSFNode,&newLocalPoints,numRoots,PetscSFNode,&newOwners);CHKERRQ(ierr); 2726bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 2727bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 2728bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 2729bdcf2095SMatthew G. Knepley } 27309e0823b2SMatthew G. Knepley /* Set subleaves */ 2731aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2732aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 2733bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2734aca35d17SMatthew G. Knepley 2735aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 2736bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 2737bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 2738bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 2739bdcf2095SMatthew G. Knepley ++numSubLeaves; 2740aca35d17SMatthew G. Knepley } 27419e0823b2SMatthew G. Knepley /* Must put in owned subpoints */ 27429e0823b2SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 27439e0823b2SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 27449e0823b2SMatthew G. Knepley 27459e0823b2SMatthew G. Knepley if (subPoint < 0) { 27469e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = -3; 27479e0823b2SMatthew G. Knepley newOwners[p-pStart].index = -3; 27489e0823b2SMatthew G. Knepley } else { 27499e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = rank; 27509e0823b2SMatthew G. Knepley newOwners[p-pStart].index = subPoint; 27519e0823b2SMatthew G. Knepley } 2752bdcf2095SMatthew G. Knepley } 2753bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2754bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2755bdcf2095SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2756bdcf2095SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2757aca35d17SMatthew G. Knepley ierr = PetscMalloc(numSubLeaves * sizeof(PetscInt), &slocalPoints);CHKERRQ(ierr); 2758aca35d17SMatthew G. Knepley ierr = PetscMalloc(numSubLeaves * sizeof(PetscSFNode), &sremotePoints);CHKERRQ(ierr); 275949c26ae4SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 2760bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 2761bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2762aca35d17SMatthew G. Knepley 2763aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 276449c26ae4SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 2765aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 2766bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 2767bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 2768bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 2769bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 2770aca35d17SMatthew G. Knepley ++sl; 2771aca35d17SMatthew G. Knepley } 2772bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 277349c26ae4SMatthew G. Knepley if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 277449c26ae4SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 2775aca35d17SMatthew G. Knepley } 2776aca35d17SMatthew G. Knepley } 2777aca35d17SMatthew G. Knepley CHKMEMQ; 2778766ab985SMatthew G. Knepley /* Cleanup */ 2779766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2780766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2781766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 2782766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2783766ab985SMatthew G. Knepley } 2784766ab985SMatthew G. Knepley 2785766ab985SMatthew G. Knepley #undef __FUNCT__ 2786766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated" 2787b3154360SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char label[], PetscInt value, DM subdm) 2788766ab985SMatthew G. Knepley { 2789766ab985SMatthew G. Knepley MPI_Comm comm; 2790766ab985SMatthew G. Knepley DMLabel subpointMap; 2791766ab985SMatthew G. Knepley IS *subpointIS; 2792766ab985SMatthew G. Knepley const PetscInt **subpoints; 2793766ab985SMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew; 2794766ab985SMatthew G. Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2795766ab985SMatthew G. Knepley PetscErrorCode ierr; 2796766ab985SMatthew G. Knepley 2797766ab985SMatthew G. Knepley PetscFunctionBegin; 2798766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2799766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2800766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2801766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2802766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 2803b3154360SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr); 2804766ab985SMatthew G. Knepley /* Setup chart */ 2805766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2806766ab985SMatthew G. Knepley ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr); 2807766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2808766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2809766ab985SMatthew G. Knepley totSubPoints += numSubPoints[d]; 2810766ab985SMatthew G. Knepley } 2811766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2812766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2813766ab985SMatthew G. Knepley /* Set cone sizes */ 2814766ab985SMatthew G. Knepley firstSubPoint[dim] = 0; 2815766ab985SMatthew G. Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2816766ab985SMatthew G. Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2817766ab985SMatthew G. Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2818766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2819766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2820766ab985SMatthew G. Knepley ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2821766ab985SMatthew G. Knepley } 2822766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2823766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2824766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2825766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2826766ab985SMatthew G. Knepley const PetscInt *cone; 2827766ab985SMatthew G. Knepley PetscInt coneSize, coneSizeNew, c, val; 2828766ab985SMatthew G. Knepley 2829766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2830766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2831766ab985SMatthew G. Knepley if (d == dim) { 2832766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2833766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2834766ab985SMatthew G. Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2835766ab985SMatthew G. Knepley if (val >= 0) coneSizeNew++; 2836766ab985SMatthew G. Knepley } 2837766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2838766ab985SMatthew G. Knepley } 2839766ab985SMatthew G. Knepley } 2840766ab985SMatthew G. Knepley } 2841766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2842766ab985SMatthew G. Knepley /* Set cones */ 2843766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2844766ab985SMatthew G. Knepley ierr = PetscMalloc(maxConeSize * sizeof(PetscInt), &coneNew);CHKERRQ(ierr); 2845766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2846766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2847766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2848766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2849766ab985SMatthew G. Knepley const PetscInt *cone; 2850766ab985SMatthew G. Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2851766ab985SMatthew G. Knepley 2852766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2853766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2854766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2855766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2856766ab985SMatthew G. Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 2857766ab985SMatthew G. Knepley if (subc >= 0) coneNew[coneSizeNew++] = firstSubPoint[d-1] + subc; 2858766ab985SMatthew G. Knepley } 2859766ab985SMatthew G. Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2860766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 2861766ab985SMatthew G. Knepley } 2862766ab985SMatthew G. Knepley } 2863766ab985SMatthew G. Knepley ierr = PetscFree(coneNew);CHKERRQ(ierr); 2864766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2865766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2866766ab985SMatthew G. Knepley /* Build coordinates */ 2867766ab985SMatthew G. Knepley { 2868766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2869766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2870766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2871285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2872766ab985SMatthew G. Knepley 2873766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2874766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2875766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2876285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2877285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2878285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2879766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2880766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2881766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 2882766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2883766ab985SMatthew G. Knepley PetscInt dof; 2884766ab985SMatthew G. Knepley 2885766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2886766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2887285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2888766ab985SMatthew G. Knepley } 2889766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2890766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2891766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2892766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 28932eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2894766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2895766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2896766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2897766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 2898766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2899766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 2900766ab985SMatthew G. Knepley 2901766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2902766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2903766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2904766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2905766ab985SMatthew 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); 2906766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2907766ab985SMatthew G. Knepley } 2908766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2909766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2910766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2911766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2912766ab985SMatthew G. Knepley } 2913766ab985SMatthew G. Knepley /* Cleanup */ 2914766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2915766ab985SMatthew G. Knepley ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2916766ab985SMatthew G. Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2917766ab985SMatthew G. Knepley } 2918766ab985SMatthew G. Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2919766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2920766ab985SMatthew G. Knepley } 2921766ab985SMatthew G. Knepley 2922766ab985SMatthew G. Knepley #undef __FUNCT__ 2923766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh" 2924766ab985SMatthew G. Knepley /* 292527c04023SMatthew 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. 2926766ab985SMatthew G. Knepley 2927766ab985SMatthew G. Knepley Input Parameters: 2928766ab985SMatthew G. Knepley + dm - The original mesh 292927c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 293027c04023SMatthew G. Knepley . label - A label name, or PETSC_NULL 293127c04023SMatthew G. Knepley - value - A label value 2932766ab985SMatthew G. Knepley 2933766ab985SMatthew G. Knepley Output Parameter: 2934766ab985SMatthew G. Knepley . subdm - The surface mesh 2935766ab985SMatthew G. Knepley 2936766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2937766ab985SMatthew G. Knepley 2938766ab985SMatthew G. Knepley Level: developer 2939766ab985SMatthew G. Knepley 2940766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 2941766ab985SMatthew G. Knepley */ 294227c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 2943766ab985SMatthew G. Knepley { 2944766ab985SMatthew G. Knepley PetscInt dim, depth; 2945766ab985SMatthew G. Knepley PetscErrorCode ierr; 2946766ab985SMatthew G. Knepley 2947766ab985SMatthew G. Knepley PetscFunctionBegin; 2948766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 294927c04023SMatthew G. Knepley PetscValidPointer(subdm, 5); 2950766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2951766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2952766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2953766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2954766ab985SMatthew G. Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2955766ab985SMatthew G. Knepley if (depth == dim) { 2956b3154360SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr); 2957766ab985SMatthew G. Knepley } else { 295827c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 2959e6ccafaeSMatthew G Knepley } 2960e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2961e6ccafaeSMatthew G Knepley } 2962e6ccafaeSMatthew G Knepley 2963e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2964e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap" 296564beef6dSMatthew G. Knepley /*@ 296664beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 296764beef6dSMatthew G. Knepley 296864beef6dSMatthew G. Knepley Input Parameter: 296964beef6dSMatthew G. Knepley . dm - The submesh DM 297064beef6dSMatthew G. Knepley 297164beef6dSMatthew G. Knepley Output Parameter: 297264beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 297364beef6dSMatthew G. Knepley 297464beef6dSMatthew G. Knepley Level: developer 297564beef6dSMatthew G. Knepley 297664beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 297764beef6dSMatthew G. Knepley @*/ 2978e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 2979e6ccafaeSMatthew G Knepley { 2980e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 2981e6ccafaeSMatthew G Knepley 2982e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2983e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2984e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 2985e6ccafaeSMatthew G Knepley *subpointMap = mesh->subpointMap; 2986e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2987e6ccafaeSMatthew G Knepley } 2988e6ccafaeSMatthew G Knepley 2989e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2990e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap" 2991e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */ 2992e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 2993e6ccafaeSMatthew G Knepley { 2994e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 2995285d324eSMatthew G. Knepley DMLabel tmp; 2996e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2997e6ccafaeSMatthew G Knepley 2998e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2999e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3000285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 3001e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 3002285d324eSMatthew G. Knepley ++mesh->subpointMap->refct; 3003285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 3004e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3005e6ccafaeSMatthew G Knepley } 3006e6ccafaeSMatthew G Knepley 3007e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3008e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS" 300964beef6dSMatthew G. Knepley /*@ 3010e6ccafaeSMatthew G Knepley DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 3011e6ccafaeSMatthew G Knepley 3012e6ccafaeSMatthew G Knepley Input Parameter: 3013e6ccafaeSMatthew G Knepley . dm - The submesh DM 3014e6ccafaeSMatthew G Knepley 3015e6ccafaeSMatthew G Knepley Output Parameter: 30160298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 3017e6ccafaeSMatthew G Knepley 3018e6ccafaeSMatthew G Knepley Note: This is IS is guaranteed to be sorted by the construction of the submesh 301964beef6dSMatthew G. Knepley 302064beef6dSMatthew G. Knepley Level: developer 302164beef6dSMatthew G. Knepley 302264beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 302364beef6dSMatthew G. Knepley @*/ 3024e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 3025e6ccafaeSMatthew G Knepley { 302682f516ccSBarry Smith MPI_Comm comm; 3027e6ccafaeSMatthew G Knepley DMLabel subpointMap; 3028e6ccafaeSMatthew G Knepley IS is; 3029e6ccafaeSMatthew G Knepley const PetscInt *opoints; 3030e6ccafaeSMatthew G Knepley PetscInt *points, *depths; 3031e6ccafaeSMatthew G Knepley PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 3032e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3033e6ccafaeSMatthew G Knepley 3034e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3035e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3036e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 303782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 30380298fd71SBarry Smith *subpointIS = NULL; 3039e6ccafaeSMatthew G Knepley ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 3040e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3041fed694aaSMatthew G. Knepley if (subpointMap && depth >= 0) { 3042e6ccafaeSMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3043e6ccafaeSMatthew G Knepley if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 3044e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3045e6ccafaeSMatthew G Knepley depths[0] = depth; 3046e6ccafaeSMatthew G Knepley depths[1] = 0; 3047e6ccafaeSMatthew G Knepley for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 3048e6ccafaeSMatthew G Knepley ierr = PetscMalloc(pEnd * sizeof(PetscInt), &points);CHKERRQ(ierr); 3049e6ccafaeSMatthew G Knepley for(d = 0, off = 0; d <= depth; ++d) { 3050e6ccafaeSMatthew G Knepley const PetscInt dep = depths[d]; 3051e6ccafaeSMatthew G Knepley 3052e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 3053e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 30541e21b6fdSMatthew G Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 3055e6ccafaeSMatthew 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); 3056e6ccafaeSMatthew G Knepley } else { 30571e21b6fdSMatthew G Knepley if (!n) { 30581e21b6fdSMatthew G Knepley if (d == 0) { 30591e21b6fdSMatthew G Knepley /* Missing cells */ 30601e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 30611e21b6fdSMatthew G Knepley } else { 30621e21b6fdSMatthew G Knepley /* Missing faces */ 30631e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 30641e21b6fdSMatthew G Knepley } 30651e21b6fdSMatthew G Knepley } 3066e6ccafaeSMatthew G Knepley } 3067e6ccafaeSMatthew G Knepley if (n) { 3068e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 3069e6ccafaeSMatthew G Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 3070e6ccafaeSMatthew G Knepley for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 3071e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 3072e6ccafaeSMatthew G Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 3073e6ccafaeSMatthew G Knepley } 3074e6ccafaeSMatthew G Knepley } 3075e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3076e6ccafaeSMatthew G Knepley if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 3077fed694aaSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 3078e6ccafaeSMatthew G Knepley } 3079e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3080e6ccafaeSMatthew G Knepley } 3081