134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 20c312b8eSJed Brown #include <petscsf.h> 3e6ccafaeSMatthew G Knepley 4e6ccafaeSMatthew G Knepley #undef __FUNCT__ 5cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces" 6cd0c2139SMatthew G Knepley /*@ 7cd0c2139SMatthew G Knepley DMPlexMarkBoundaryFaces - Mark all faces on the boundary 8cd0c2139SMatthew G Knepley 9cd0c2139SMatthew G Knepley Not Collective 10cd0c2139SMatthew G Knepley 11cd0c2139SMatthew G Knepley Input Parameter: 12cd0c2139SMatthew G Knepley . dm - The original DM 13cd0c2139SMatthew G Knepley 14cd0c2139SMatthew G Knepley Output Parameter: 15cd0c2139SMatthew G Knepley . label - The DMLabel marking boundary faces with value 1 16cd0c2139SMatthew G Knepley 17cd0c2139SMatthew G Knepley Level: developer 18cd0c2139SMatthew G Knepley 19cd0c2139SMatthew G Knepley .seealso: DMLabelCreate(), DMPlexCreateLabel() 2009f723d9SJed Brown @*/ 21cd0c2139SMatthew G Knepley PetscErrorCode DMPlexMarkBoundaryFaces(DM dm, DMLabel label) 22cd0c2139SMatthew G Knepley { 23cd0c2139SMatthew G Knepley PetscInt fStart, fEnd, f; 24cd0c2139SMatthew G Knepley PetscErrorCode ierr; 25cd0c2139SMatthew G Knepley 26cd0c2139SMatthew G Knepley PetscFunctionBegin; 27cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 28cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 29cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 30cd0c2139SMatthew G Knepley PetscInt supportSize; 31cd0c2139SMatthew G Knepley 32cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 33cd0c2139SMatthew G Knepley if (supportSize == 1) { 34cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, f, 1);CHKERRQ(ierr); 35cd0c2139SMatthew G Knepley } 36cd0c2139SMatthew G Knepley } 37cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 38cd0c2139SMatthew G Knepley } 39cd0c2139SMatthew G Knepley 40cd0c2139SMatthew G Knepley #undef __FUNCT__ 412be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelComplete" 422be2b188SMatthew G Knepley /*@ 432be2b188SMatthew G Knepley DMPlexLabelComplete - Starting with a label marking points on a surface, we add the transitive closure to the surface 442be2b188SMatthew G Knepley 452be2b188SMatthew G Knepley Input Parameters: 462be2b188SMatthew G Knepley + dm - The DM 472be2b188SMatthew G Knepley - label - A DMLabel marking the surface points 482be2b188SMatthew G Knepley 492be2b188SMatthew G Knepley Output Parameter: 502be2b188SMatthew G Knepley . label - A DMLabel marking all surface points in the transitive closure 512be2b188SMatthew G Knepley 522be2b188SMatthew G Knepley Level: developer 532be2b188SMatthew G Knepley 542be2b188SMatthew G Knepley .seealso: DMPlexLabelCohesiveComplete() 552be2b188SMatthew G Knepley @*/ 562be2b188SMatthew G Knepley PetscErrorCode DMPlexLabelComplete(DM dm, DMLabel label) 572be2b188SMatthew G Knepley { 582be2b188SMatthew G Knepley IS valueIS; 592be2b188SMatthew G Knepley const PetscInt *values; 602be2b188SMatthew G Knepley PetscInt numValues, v; 612be2b188SMatthew G Knepley PetscErrorCode ierr; 622be2b188SMatthew G Knepley 632be2b188SMatthew G Knepley PetscFunctionBegin; 642be2b188SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 652be2b188SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 662be2b188SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 672be2b188SMatthew G Knepley for (v = 0; v < numValues; ++v) { 682be2b188SMatthew G Knepley IS pointIS; 692be2b188SMatthew G Knepley const PetscInt *points; 702be2b188SMatthew G Knepley PetscInt numPoints, p; 712be2b188SMatthew G Knepley 722be2b188SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 732be2b188SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 742be2b188SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 752be2b188SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 762be2b188SMatthew G Knepley PetscInt *closure = NULL; 772be2b188SMatthew G Knepley PetscInt closureSize, c; 782be2b188SMatthew G Knepley 792be2b188SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 802be2b188SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 812be2b188SMatthew G Knepley ierr = DMLabelSetValue(label, closure[c], values[v]);CHKERRQ(ierr); 822be2b188SMatthew G Knepley } 832be2b188SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 842be2b188SMatthew G Knepley } 852be2b188SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 862be2b188SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 872be2b188SMatthew G Knepley } 882be2b188SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 892be2b188SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 902be2b188SMatthew G Knepley PetscFunctionReturn(0); 912be2b188SMatthew G Knepley } 922be2b188SMatthew G Knepley 932be2b188SMatthew G Knepley #undef __FUNCT__ 94cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoint_Internal" 95cd0c2139SMatthew G Knepley PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthEnd[], PetscInt depthShift[]) 96cd0c2139SMatthew G Knepley { 97cd0c2139SMatthew G Knepley if (depth < 0) return p; 98cd0c2139SMatthew G Knepley /* Cells */ if (p < depthEnd[depth]) return p; 99cd0c2139SMatthew G Knepley /* Vertices */ if (p < depthEnd[0]) return p + depthShift[depth]; 100cd0c2139SMatthew G Knepley /* Faces */ if (p < depthEnd[depth-1]) return p + depthShift[depth] + depthShift[0]; 101cd0c2139SMatthew G Knepley /* Edges */ return p + depthShift[depth] + depthShift[0] + depthShift[depth-1]; 102cd0c2139SMatthew G Knepley } 103cd0c2139SMatthew G Knepley 104cd0c2139SMatthew G Knepley #undef __FUNCT__ 105cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSizes_Internal" 106cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew) 107cd0c2139SMatthew G Knepley { 108cd0c2139SMatthew G Knepley PetscInt *depthEnd; 109cd0c2139SMatthew G Knepley PetscInt depth = 0, d, pStart, pEnd, p; 110cd0c2139SMatthew G Knepley PetscErrorCode ierr; 111cd0c2139SMatthew G Knepley 112cd0c2139SMatthew G Knepley PetscFunctionBegin; 113cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 114cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 115cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 116cd0c2139SMatthew G Knepley /* Step 1: Expand chart */ 117cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 118cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 119cd0c2139SMatthew G Knepley pEnd += depthShift[d]; 120cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 121cd0c2139SMatthew G Knepley } 122cd0c2139SMatthew G Knepley ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr); 123cd0c2139SMatthew G Knepley /* Step 2: Set cone and support sizes */ 124cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 125cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 126cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 127cd0c2139SMatthew G Knepley PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthEnd, depthShift); 128cd0c2139SMatthew G Knepley PetscInt size; 129cd0c2139SMatthew G Knepley 130cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 131cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr); 132cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 133cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr); 134cd0c2139SMatthew G Knepley } 135cd0c2139SMatthew G Knepley } 136cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 137cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 138cd0c2139SMatthew G Knepley } 139cd0c2139SMatthew G Knepley 140cd0c2139SMatthew G Knepley #undef __FUNCT__ 141cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoints_Internal" 142cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew) 143cd0c2139SMatthew G Knepley { 144cd0c2139SMatthew G Knepley PetscInt *depthEnd, *newpoints; 145dcbb62e8SMatthew G. Knepley PetscInt depth = 0, d, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, pStart, pEnd, p; 146cd0c2139SMatthew G Knepley PetscErrorCode ierr; 147cd0c2139SMatthew G Knepley 148cd0c2139SMatthew G Knepley PetscFunctionBegin; 149cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 150cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 151cd0c2139SMatthew G Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 152dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dmNew, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 153dcbb62e8SMatthew G. Knepley ierr = PetscMalloc2(depth+1,PetscInt,&depthEnd,PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),PetscInt,&newpoints);CHKERRQ(ierr); 154cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 155cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 156cd0c2139SMatthew G Knepley } 157cd0c2139SMatthew G Knepley /* Step 5: Set cones and supports */ 158cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 159cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 160cd0c2139SMatthew G Knepley const PetscInt *points = NULL, *orientations = NULL; 161dcbb62e8SMatthew G. Knepley PetscInt size,sizeNew, i, newp = DMPlexShiftPoint_Internal(p, depth, depthEnd, depthShift); 162cd0c2139SMatthew G Knepley 163cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 164cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr); 165cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr); 166cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 167cd0c2139SMatthew G Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthEnd, depthShift); 168cd0c2139SMatthew G Knepley } 169cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr); 170cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr); 171cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 172dcbb62e8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmNew, newp, &sizeNew);CHKERRQ(ierr); 173cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr); 174cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 175cd0c2139SMatthew G Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthEnd, depthShift); 176cd0c2139SMatthew G Knepley } 177dcbb62e8SMatthew G. Knepley for (i = size; i < sizeNew; ++i) newpoints[i] = 0; 178cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr); 179cd0c2139SMatthew G Knepley } 180cd0c2139SMatthew G Knepley ierr = PetscFree2(depthEnd,newpoints);CHKERRQ(ierr); 181cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 182cd0c2139SMatthew G Knepley } 183cd0c2139SMatthew G Knepley 184cd0c2139SMatthew G Knepley #undef __FUNCT__ 185cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftCoordinates_Internal" 186cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew) 187cd0c2139SMatthew G Knepley { 188cd0c2139SMatthew G Knepley PetscSection coordSection, newCoordSection; 189cd0c2139SMatthew G Knepley Vec coordinates, newCoordinates; 190cd0c2139SMatthew G Knepley PetscScalar *coords, *newCoords; 191cd0c2139SMatthew G Knepley PetscInt *depthEnd, coordSize; 192cd0c2139SMatthew G Knepley PetscInt dim, depth = 0, d, vStart, vEnd, vStartNew, vEndNew, v; 193cd0c2139SMatthew G Knepley PetscErrorCode ierr; 194cd0c2139SMatthew G Knepley 195cd0c2139SMatthew G Knepley PetscFunctionBegin; 196cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 197cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 198cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 199cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 200cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 201cd0c2139SMatthew G Knepley } 202cd0c2139SMatthew G Knepley /* Step 8: Convert coordinates */ 203cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 204cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr); 205cd0c2139SMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 206cd0c2139SMatthew G Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr); 207cd0c2139SMatthew G Knepley ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr); 208cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr); 209cd0c2139SMatthew G Knepley ierr = PetscSectionSetChart(newCoordSection, vStartNew, vEndNew);CHKERRQ(ierr); 210cd0c2139SMatthew G Knepley for (v = vStartNew; v < vEndNew; ++v) { 211cd0c2139SMatthew G Knepley ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr); 212cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr); 213cd0c2139SMatthew G Knepley } 214cd0c2139SMatthew G Knepley ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr); 215cd0c2139SMatthew G Knepley ierr = DMPlexSetCoordinateSection(dmNew, newCoordSection);CHKERRQ(ierr); 216cd0c2139SMatthew G Knepley ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr); 217cd0c2139SMatthew G Knepley ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr); 218cd0c2139SMatthew G Knepley ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr); 219cd0c2139SMatthew G Knepley ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2202eb5907fSJed Brown ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr); 221cd0c2139SMatthew G Knepley ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr); 222cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 223cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 224cd0c2139SMatthew G Knepley ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr); 225cd0c2139SMatthew G Knepley for (v = vStart; v < vEnd; ++v) { 226cd0c2139SMatthew G Knepley PetscInt dof, off, noff, d; 227cd0c2139SMatthew G Knepley 228cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 229cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 230cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthEnd, depthShift), &noff);CHKERRQ(ierr); 231cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) { 232cd0c2139SMatthew G Knepley newCoords[noff+d] = coords[off+d]; 233cd0c2139SMatthew G Knepley } 234cd0c2139SMatthew G Knepley } 235cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 236cd0c2139SMatthew G Knepley ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr); 237cd0c2139SMatthew G Knepley ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 238cd0c2139SMatthew G Knepley ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr); 239cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 240cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 241cd0c2139SMatthew G Knepley } 242cd0c2139SMatthew G Knepley 243cd0c2139SMatthew G Knepley #undef __FUNCT__ 244cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal" 245cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew) 246cd0c2139SMatthew G Knepley { 247cd0c2139SMatthew G Knepley PetscInt *depthEnd; 248cd0c2139SMatthew G Knepley PetscInt depth = 0, d; 249cd0c2139SMatthew G Knepley PetscSF sfPoint, sfPointNew; 250cd0c2139SMatthew G Knepley const PetscSFNode *remotePoints; 251cd0c2139SMatthew G Knepley PetscSFNode *gremotePoints; 252cd0c2139SMatthew G Knepley const PetscInt *localPoints; 253cd0c2139SMatthew G Knepley PetscInt *glocalPoints, *newLocation, *newRemoteLocation; 254cd0c2139SMatthew G Knepley PetscInt numRoots, numLeaves, l, pStart, pEnd, totShift = 0; 255cd0c2139SMatthew G Knepley PetscErrorCode ierr; 256cd0c2139SMatthew G Knepley 257cd0c2139SMatthew G Knepley PetscFunctionBegin; 258cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 259cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 260cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 261cd0c2139SMatthew G Knepley totShift += depthShift[d]; 262cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 263cd0c2139SMatthew G Knepley } 264cd0c2139SMatthew G Knepley /* Step 9: Convert pointSF */ 265cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 266cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr); 267cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 268cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 269cd0c2139SMatthew G Knepley if (numRoots >= 0) { 270cd0c2139SMatthew G Knepley ierr = PetscMalloc2(numRoots,PetscInt,&newLocation,pEnd-pStart,PetscInt,&newRemoteLocation);CHKERRQ(ierr); 271cd0c2139SMatthew G Knepley for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthEnd, depthShift); 272cd0c2139SMatthew G Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 273cd0c2139SMatthew G Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 274cd0c2139SMatthew G Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscInt), &glocalPoints);CHKERRQ(ierr); 275cd0c2139SMatthew G Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscSFNode), &gremotePoints);CHKERRQ(ierr); 276cd0c2139SMatthew G Knepley for (l = 0; l < numLeaves; ++l) { 277cd0c2139SMatthew G Knepley glocalPoints[l] = DMPlexShiftPoint_Internal(localPoints[l], depth, depthEnd, depthShift); 278cd0c2139SMatthew G Knepley gremotePoints[l].rank = remotePoints[l].rank; 279cd0c2139SMatthew G Knepley gremotePoints[l].index = newRemoteLocation[localPoints[l]]; 280cd0c2139SMatthew G Knepley } 281cd0c2139SMatthew G Knepley ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr); 282cd0c2139SMatthew G Knepley ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 283cd0c2139SMatthew G Knepley } 284cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 285cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 286cd0c2139SMatthew G Knepley } 287cd0c2139SMatthew G Knepley 288cd0c2139SMatthew G Knepley #undef __FUNCT__ 289cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal" 290cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew) 291cd0c2139SMatthew G Knepley { 292cd0c2139SMatthew G Knepley PetscSF sfPoint; 293cd0c2139SMatthew G Knepley DMLabel vtkLabel, ghostLabel; 294cd0c2139SMatthew G Knepley PetscInt *depthEnd; 295cd0c2139SMatthew G Knepley const PetscSFNode *leafRemote; 296cd0c2139SMatthew G Knepley const PetscInt *leafLocal; 297cd0c2139SMatthew G Knepley PetscInt depth = 0, d, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f; 298cd0c2139SMatthew G Knepley PetscMPIInt rank; 299cd0c2139SMatthew G Knepley PetscErrorCode ierr; 300cd0c2139SMatthew G Knepley 301cd0c2139SMatthew G Knepley PetscFunctionBegin; 302cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 303cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 304cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 305cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 306cd0c2139SMatthew G Knepley } 307cd0c2139SMatthew G Knepley /* Step 10: Convert labels */ 308cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 309cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 310cd0c2139SMatthew G Knepley DMLabel label, newlabel; 311cd0c2139SMatthew G Knepley const char *lname; 312cd0c2139SMatthew G Knepley PetscBool isDepth; 313cd0c2139SMatthew G Knepley IS valueIS; 314cd0c2139SMatthew G Knepley const PetscInt *values; 315cd0c2139SMatthew G Knepley PetscInt numValues, val; 316cd0c2139SMatthew G Knepley 317cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr); 318cd0c2139SMatthew G Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 319cd0c2139SMatthew G Knepley if (isDepth) continue; 320cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, lname);CHKERRQ(ierr); 321cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr); 322cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr); 323cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 324cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 325cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 326cd0c2139SMatthew G Knepley for (val = 0; val < numValues; ++val) { 327cd0c2139SMatthew G Knepley IS pointIS; 328cd0c2139SMatthew G Knepley const PetscInt *points; 329cd0c2139SMatthew G Knepley PetscInt numPoints, p; 330cd0c2139SMatthew G Knepley 331cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 332cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 333cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 334cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 335cd0c2139SMatthew G Knepley const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthEnd, depthShift); 336cd0c2139SMatthew G Knepley 337cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr); 338cd0c2139SMatthew G Knepley } 339cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 340cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 341cd0c2139SMatthew G Knepley } 342cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 343cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 344cd0c2139SMatthew G Knepley } 345cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 346cd0c2139SMatthew G Knepley /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */ 347cd0c2139SMatthew G Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 348cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 349cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 350cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr); 351cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "vtk");CHKERRQ(ierr); 352cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "ghost");CHKERRQ(ierr); 353cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr); 354cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr); 355cd0c2139SMatthew G Knepley for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { 356cd0c2139SMatthew G Knepley for (; c < leafLocal[l] && c < cEnd; ++c) { 357cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 358cd0c2139SMatthew G Knepley } 359cd0c2139SMatthew G Knepley if (leafLocal[l] >= cEnd) break; 360cd0c2139SMatthew G Knepley if (leafRemote[l].rank == rank) { 361cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 362cd0c2139SMatthew G Knepley } else { 363cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr); 364cd0c2139SMatthew G Knepley } 365cd0c2139SMatthew G Knepley } 366cd0c2139SMatthew G Knepley for (; c < cEnd; ++c) { 367cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 368cd0c2139SMatthew G Knepley } 369cd0c2139SMatthew G Knepley if (0) { 370cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 371cd0c2139SMatthew G Knepley ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 372cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 373cd0c2139SMatthew G Knepley } 374cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr); 375cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 376cd0c2139SMatthew G Knepley PetscInt numCells; 377cd0c2139SMatthew G Knepley 378cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr); 379cd0c2139SMatthew G Knepley if (numCells < 2) { 380cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr); 381cd0c2139SMatthew G Knepley } else { 382cd0c2139SMatthew G Knepley const PetscInt *cells = NULL; 383cd0c2139SMatthew G Knepley PetscInt vA, vB; 384cd0c2139SMatthew G Knepley 385cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr); 386cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr); 387cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr); 388cd0c2139SMatthew G Knepley if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);} 389cd0c2139SMatthew G Knepley } 390cd0c2139SMatthew G Knepley } 391cd0c2139SMatthew G Knepley if (0) { 392cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 393cd0c2139SMatthew G Knepley ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 394cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 395cd0c2139SMatthew G Knepley } 396cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 397cd0c2139SMatthew G Knepley } 398cd0c2139SMatthew G Knepley 399cd0c2139SMatthew G Knepley #undef __FUNCT__ 400cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal" 401cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm) 402cd0c2139SMatthew G Knepley { 403cd0c2139SMatthew G Knepley IS valueIS; 404cd0c2139SMatthew G Knepley const PetscInt *values; 405cd0c2139SMatthew G Knepley PetscInt *depthShift; 406cd0c2139SMatthew G Knepley PetscInt depth = 0, numFS, fs, ghostCell, cEnd, c; 407cd0c2139SMatthew G Knepley PetscErrorCode ierr; 408cd0c2139SMatthew G Knepley 409cd0c2139SMatthew G Knepley PetscFunctionBegin; 410cd0c2139SMatthew G Knepley /* Count ghost cells */ 411cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 412cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr); 413cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 414cd0c2139SMatthew G Knepley 415cd0c2139SMatthew G Knepley *numGhostCells = 0; 416cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 417cd0c2139SMatthew G Knepley PetscInt numBdFaces; 418cd0c2139SMatthew G Knepley 419cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[fs], &numBdFaces);CHKERRQ(ierr); 420cd0c2139SMatthew G Knepley 421cd0c2139SMatthew G Knepley *numGhostCells += numBdFaces; 422cd0c2139SMatthew G Knepley } 423cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 424cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthShift);CHKERRQ(ierr); 425cd0c2139SMatthew G Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 426cd0c2139SMatthew G Knepley if (depth >= 0) depthShift[depth] = *numGhostCells; 427cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 428cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 429cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 430cd0c2139SMatthew G Knepley for (c = cEnd; c < cEnd + *numGhostCells; ++c) { 431cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr); 432cd0c2139SMatthew G Knepley } 433cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 434cd0c2139SMatthew G Knepley IS faceIS; 435cd0c2139SMatthew G Knepley const PetscInt *faces; 436cd0c2139SMatthew G Knepley PetscInt numFaces, f; 437cd0c2139SMatthew G Knepley 438cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 439cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 440cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 441cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 442cd0c2139SMatthew G Knepley PetscInt size; 443cd0c2139SMatthew G Knepley 444cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr); 445cd0c2139SMatthew G Knepley if (size != 1) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "DM has boundary face %d with %d support cells", faces[f], size); 446cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(gdm, faces[f] + *numGhostCells, 2);CHKERRQ(ierr); 447cd0c2139SMatthew G Knepley } 448cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 449cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 450cd0c2139SMatthew G Knepley } 451cd0c2139SMatthew G Knepley /* Step 4: Setup ghosted DM */ 452cd0c2139SMatthew G Knepley ierr = DMSetUp(gdm);CHKERRQ(ierr); 453cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 454cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 455cd0c2139SMatthew G Knepley ghostCell = cEnd; 456cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 457cd0c2139SMatthew G Knepley IS faceIS; 458cd0c2139SMatthew G Knepley const PetscInt *faces; 459cd0c2139SMatthew G Knepley PetscInt numFaces, f; 460cd0c2139SMatthew G Knepley 461cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 462cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 463cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 464cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f, ++ghostCell) { 465cd0c2139SMatthew G Knepley PetscInt newFace = faces[f] + *numGhostCells; 466cd0c2139SMatthew G Knepley 467cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr); 468cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr); 469cd0c2139SMatthew G Knepley } 470cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 471cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 472cd0c2139SMatthew G Knepley } 473cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 474cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 475cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 476cd0c2139SMatthew G Knepley ierr = DMPlexStratify(gdm);CHKERRQ(ierr); 477cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 478cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 479cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 480cd0c2139SMatthew G Knepley ierr = PetscFree(depthShift);CHKERRQ(ierr); 481cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 482cd0c2139SMatthew G Knepley } 483cd0c2139SMatthew G Knepley 484cd0c2139SMatthew G Knepley #undef __FUNCT__ 485cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells" 486cd0c2139SMatthew G Knepley /*@C 487cd0c2139SMatthew G Knepley DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face 488cd0c2139SMatthew G Knepley 489cd0c2139SMatthew G Knepley Collective on dm 490cd0c2139SMatthew G Knepley 491cd0c2139SMatthew G Knepley Input Parameters: 492cd0c2139SMatthew G Knepley + dm - The original DM 493cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL 494cd0c2139SMatthew G Knepley 495cd0c2139SMatthew G Knepley Output Parameters: 496cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM 497cd0c2139SMatthew G Knepley - dmGhosted - The new DM 498cd0c2139SMatthew G Knepley 499cd0c2139SMatthew G Knepley Note: If no label exists of that name, one will be created marking all boundary faces 500cd0c2139SMatthew G Knepley 501cd0c2139SMatthew G Knepley Level: developer 502cd0c2139SMatthew G Knepley 503cd0c2139SMatthew G Knepley .seealso: DMCreate() 504cd0c2139SMatthew G Knepley */ 505cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted) 506cd0c2139SMatthew G Knepley { 507cd0c2139SMatthew G Knepley DM gdm; 508cd0c2139SMatthew G Knepley DMLabel label; 509cd0c2139SMatthew G Knepley const char *name = labelName ? labelName : "Face Sets"; 510cd0c2139SMatthew G Knepley PetscInt dim; 511cd0c2139SMatthew G Knepley PetscErrorCode ierr; 512cd0c2139SMatthew G Knepley 513cd0c2139SMatthew G Knepley PetscFunctionBegin; 514cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 515cd0c2139SMatthew G Knepley PetscValidPointer(numGhostCells, 3); 516cd0c2139SMatthew G Knepley PetscValidPointer(dmGhosted, 4); 517cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr); 518cd0c2139SMatthew G Knepley ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr); 519cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 520cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(gdm, dim);CHKERRQ(ierr); 521cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 522cd0c2139SMatthew G Knepley if (!label) { 523cd0c2139SMatthew G Knepley /* Get label for boundary faces */ 524cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr); 525cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 526cd0c2139SMatthew G Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 527cd0c2139SMatthew G Knepley } 528cd0c2139SMatthew G Knepley ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr); 529cd0c2139SMatthew G Knepley ierr = DMSetFromOptions(gdm);CHKERRQ(ierr); 530cd0c2139SMatthew G Knepley *dmGhosted = gdm; 531cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 532cd0c2139SMatthew G Knepley } 533cd0c2139SMatthew G Knepley 534cd0c2139SMatthew G Knepley #undef __FUNCT__ 535cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal" 536607ab7a9SMatthew G. Knepley /* 537607ab7a9SMatthew G. Knepley We are adding two kinds of points here: 538607ab7a9SMatthew G. Knepley Replicated: Copies of points which exist in the mesh, such as vertices identified across a fault 539607ab7a9SMatthew G. Knepley Hybrid: Entirely new points, such as cohesive cells 540607ab7a9SMatthew G. Knepley */ 541cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm) 542cd0c2139SMatthew G Knepley { 543cd0c2139SMatthew G Knepley MPI_Comm comm; 544607ab7a9SMatthew G. Knepley IS valueIS; 545607ab7a9SMatthew G. Knepley PetscInt numSP = 0; /* The number of depths for which we have replicated points */ 546607ab7a9SMatthew G. Knepley const PetscInt *values; /* List of depths for which we have replicated points */ 547*18c5995bSMatthew G. Knepley IS *splitIS; 548*18c5995bSMatthew G. Knepley IS *unsplitIS; 549607ab7a9SMatthew G. Knepley PetscInt *numSplitPoints; /* The number of replicated points at each depth */ 550*18c5995bSMatthew G. Knepley PetscInt *numUnsplitPoints; /* The number of non-replicated points at each depth which still give rise to hybrid points */ 551607ab7a9SMatthew G. Knepley PetscInt *numHybridPoints; /* The number of hybrid points at each depth */ 552607ab7a9SMatthew G. Knepley const PetscInt **splitPoints; /* Replicated points for each depth */ 553*18c5995bSMatthew G. Knepley const PetscInt **unsplitPoints; /* Non-replicated points for each depth */ 554cd0c2139SMatthew G Knepley PetscSection coordSection; 555cd0c2139SMatthew G Knepley Vec coordinates; 556cd0c2139SMatthew G Knepley PetscScalar *coords; 557607ab7a9SMatthew G. Knepley PetscInt depths[4]; /* Depths in the order that plex points are numbered */ 558607ab7a9SMatthew G. Knepley PetscInt *depthShift; /* Number of replicated+hybrid points at each depth */ 559607ab7a9SMatthew G. Knepley PetscInt *depthOffset; /* Prefix sums of depthShift */ 560607ab7a9SMatthew G. Knepley PetscInt *pMaxNew; /* The first replicated point at each depth in the new mesh, hybrids come after this */ 561607ab7a9SMatthew G. Knepley PetscInt *coneNew, *coneONew, *supportNew; 562*18c5995bSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v; 563cd0c2139SMatthew G Knepley PetscErrorCode ierr; 564cd0c2139SMatthew G Knepley 565cd0c2139SMatthew G Knepley PetscFunctionBegin; 566cd0c2139SMatthew G Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 567cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 568607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 569fd4b9f15SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 570607ab7a9SMatthew G. Knepley depths[0] = depth; 571607ab7a9SMatthew G. Knepley depths[1] = 0; 572607ab7a9SMatthew G. Knepley depths[2] = depth-1; 573607ab7a9SMatthew G. Knepley depths[3] = 1; 574cd0c2139SMatthew G Knepley /* Count split points and add cohesive cells */ 575607ab7a9SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 576dcbb62e8SMatthew G. Knepley ierr = PetscMalloc3(depth+1,PetscInt,&depthShift,depth+1,PetscInt,&depthOffset,depth+1,PetscInt,&pMaxNew);CHKERRQ(ierr); 577*18c5995bSMatthew 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); 578607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 579607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthOffset, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 580607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 581607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 582607ab7a9SMatthew G. Knepley numSplitPoints[d] = 0; 583*18c5995bSMatthew G. Knepley numUnsplitPoints[d] = 0; 584607ab7a9SMatthew G. Knepley numHybridPoints[d] = 0; 585607ab7a9SMatthew G. Knepley splitPoints[d] = NULL; 586*18c5995bSMatthew G. Knepley unsplitPoints[d] = NULL; 587*18c5995bSMatthew G. Knepley splitIS[d] = NULL; 588*18c5995bSMatthew G. Knepley unsplitIS[d] = NULL; 589607ab7a9SMatthew G. Knepley } 590cd0c2139SMatthew G Knepley if (label) { 591cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 592cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 593cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 594cd0c2139SMatthew G Knepley } 595cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 596cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 597cd0c2139SMatthew G Knepley 598cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 599*18c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr); 600*18c5995bSMatthew G. Knepley if (splitIS[dep]) { 601*18c5995bSMatthew G. Knepley ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 602*18c5995bSMatthew G. Knepley ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 603*18c5995bSMatthew G. Knepley } 604*18c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr); 605*18c5995bSMatthew G. Knepley if (unsplitIS[dep]) { 606*18c5995bSMatthew G. Knepley ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr); 607*18c5995bSMatthew G. Knepley ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr); 608cd0c2139SMatthew G Knepley } 609cd0c2139SMatthew G Knepley } 610607ab7a9SMatthew G. Knepley /* Calculate number of hybrid points */ 611*18c5995bSMatthew 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 */ 612607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) depthShift[d] = numSplitPoints[d] + numHybridPoints[d]; 613607ab7a9SMatthew G. Knepley for (d = 1; d <= depth; ++d) depthOffset[depths[d]] = depthOffset[depths[d-1]] + depthShift[depths[d-1]]; 614607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) pMaxNew[d] += depthOffset[d]; 615cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 616cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 617cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 618cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 619cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 6204c367dbcSMatthew G. Knepley const PetscInt newp = oldp + depthOffset[dep]; 6214c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 622cd0c2139SMatthew G Knepley const PetscInt *support; 6234c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, qf, qn, qp, e; 624cd0c2139SMatthew G Knepley 625cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 626cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 627cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 628cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 629cd0c2139SMatthew G Knepley if (dep == depth-1) { 6304c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 6314c367dbcSMatthew G. Knepley 632cd0c2139SMatthew G Knepley /* Add cohesive cells, they are prisms */ 6334c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr); 634cd0c2139SMatthew G Knepley } else if (dep == 0) { 6354c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 636cd0c2139SMatthew G Knepley 637cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 6384c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 639cd0c2139SMatthew G Knepley PetscInt val; 640cd0c2139SMatthew G Knepley 641cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 6424c367dbcSMatthew G. Knepley if (val == 1) ++qf; 6434c367dbcSMatthew G. Knepley if ((val == 1) || (val == (shift + 1))) ++qn; 6444c367dbcSMatthew G. Knepley if ((val == 1) || (val == -(shift + 1))) ++qp; 645cd0c2139SMatthew G Knepley } 6464c367dbcSMatthew G. Knepley /* Split old vertex: Edges into original vertex and new cohesive edge */ 6474c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 6484c367dbcSMatthew G. Knepley /* Split new vertex: Edges into split vertex and new cohesive edge */ 6494c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 6504c367dbcSMatthew G. Knepley /* Add hybrid edge */ 6514c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 6524c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 653cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 6544c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 6554c367dbcSMatthew G. Knepley 656cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 6574c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 658cd0c2139SMatthew G Knepley PetscInt val; 659cd0c2139SMatthew G Knepley 660cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 6614c367dbcSMatthew G. Knepley if (val == dim-1) ++qf; 6624c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 6634c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 664cd0c2139SMatthew G Knepley } 6654c367dbcSMatthew G. Knepley /* Split old edge: Faces into original edge and cohesive face (positive side?) */ 6664c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 6674c367dbcSMatthew G. Knepley /* Split new edge: Faces into split edge and cohesive face (negative side?) */ 6684c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 6694c367dbcSMatthew G. Knepley /* Add hybrid face */ 6704c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 6714c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 672cd0c2139SMatthew G Knepley } 673cd0c2139SMatthew G Knepley } 674cd0c2139SMatthew G Knepley } 675*18c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 676*18c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 677*18c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 678*18c5995bSMatthew G. Knepley const PetscInt newp = oldp + depthOffset[dep]; 679*18c5995bSMatthew G. Knepley const PetscInt *support; 680*18c5995bSMatthew G. Knepley PetscInt coneSize, supportSize, qf, qn, qp, e; 681*18c5995bSMatthew G. Knepley 682*18c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 683*18c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 684*18c5995bSMatthew G. Knepley if (dep == 0) { 685*18c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 686*18c5995bSMatthew G. Knepley 687*18c5995bSMatthew G. Knepley /* Unsplit vertex: Edges into original vertex, split edge, and new cohesive edge twice */ 688*18c5995bSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, supportSize+3);CHKERRQ(ierr); 689*18c5995bSMatthew G. Knepley /* Add hybrid edge */ 690*18c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 691*18c5995bSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, 1);CHKERRQ(ierr); 692*18c5995bSMatthew G. Knepley } else if (dep == dim-2) { 693*18c5995bSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 694*18c5995bSMatthew G. Knepley 695*18c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 696*18c5995bSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 697*18c5995bSMatthew G. Knepley PetscInt val; 698*18c5995bSMatthew G. Knepley 699*18c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 700*18c5995bSMatthew G. Knepley if (val == dim-1) ++qf; 701*18c5995bSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 702*18c5995bSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 703*18c5995bSMatthew G. Knepley } 704*18c5995bSMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */ 705*18c5995bSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, supportSize+3);CHKERRQ(ierr); 706*18c5995bSMatthew G. Knepley /* Add hybrid face */ 707*18c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 708*18c5995bSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, 1);CHKERRQ(ierr); 709*18c5995bSMatthew G. Knepley } 710*18c5995bSMatthew G. Knepley } 711*18c5995bSMatthew G. Knepley } 712cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 713cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 714cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 715dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 716dcbb62e8SMatthew G. Knepley ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,PetscInt,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,PetscInt,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),PetscInt,&supportNew);CHKERRQ(ierr); 717cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 718cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 719cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 720cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 7214c367dbcSMatthew G. Knepley const PetscInt newp = oldp + depthOffset[dep]; 7224c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 723cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 7244c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, q, qf, qn, qp, v, e, s; 725cd0c2139SMatthew G Knepley 726cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 727cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 728cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 729cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 730cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 731cd0c2139SMatthew G Knepley if (dep == depth-1) { 7324c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 733cd0c2139SMatthew G Knepley const PetscInt *supportF; 734cd0c2139SMatthew G Knepley 735cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 736cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 737cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 738cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 739cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 740cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 7414c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 742*18c5995bSMatthew G. Knepley if (v < 0) { 743*18c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 744*18c5995bSMatthew 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); 745*18c5995bSMatthew G. Knepley coneNew[2+q] = cone[q] + depthOffset[dep-1]; 746*18c5995bSMatthew G. Knepley } else { 7474c367dbcSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep-1]; 748cd0c2139SMatthew G Knepley } 749*18c5995bSMatthew G. Knepley } 750cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 751cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 752e537020bSMatthew G. Knepley /* Face support */ 753cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 754cd0c2139SMatthew G Knepley PetscInt val; 755cd0c2139SMatthew G Knepley 756cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 757cd0c2139SMatthew G Knepley if (val < 0) { 758cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 7594c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr); 760cd0c2139SMatthew G Knepley } else { 761cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 7624c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr); 763e537020bSMatthew G. Knepley /* Get orientation for cohesive face */ 764e537020bSMatthew G. Knepley { 765e537020bSMatthew G. Knepley const PetscInt *ncone, *nconeO; 766e537020bSMatthew G. Knepley PetscInt nconeSize, nc; 767e537020bSMatthew G. Knepley 768e537020bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 769e537020bSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 770e537020bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 771e537020bSMatthew G. Knepley for (nc = 0; nc < nconeSize; ++nc) { 772e537020bSMatthew G. Knepley if (ncone[nc] == oldp) { 773e537020bSMatthew G. Knepley coneONew[0] = nconeO[nc]; 774e537020bSMatthew G. Knepley break; 775cd0c2139SMatthew G Knepley } 776cd0c2139SMatthew G Knepley } 777e537020bSMatthew 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]); 778e537020bSMatthew G. Knepley } 779e537020bSMatthew G. Knepley } 780e537020bSMatthew G. Knepley } 7814c367dbcSMatthew G. Knepley /* Cohesive cell: Old and new split face, then new cohesive faces */ 782fd4b9f15SMatthew G. Knepley coneNew[0] = newp; /* Extracted negative side orientation above */ 7834c367dbcSMatthew G. Knepley coneNew[1] = splitp; 7844c367dbcSMatthew G. Knepley coneONew[1] = coneONew[0]; 785e537020bSMatthew G. Knepley for (q = 0; q < coneSize; ++q) { 786*18c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 787*18c5995bSMatthew G. Knepley if (v < 0) { 788*18c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 789*18c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 790*18c5995bSMatthew G. Knepley coneONew[2+q] = 0; 791*18c5995bSMatthew G. Knepley } else { 792*18c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep]; 793*18c5995bSMatthew G. Knepley } 794e537020bSMatthew G. Knepley coneONew[2+q] = 0; 795e537020bSMatthew G. Knepley } 7964c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr); 7974c367dbcSMatthew G. Knepley ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr); 798cd0c2139SMatthew G Knepley } else if (dep == 0) { 7994c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 800cd0c2139SMatthew G Knepley 801cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 8024c367dbcSMatthew G. Knepley for (e = 0, qn = 0; e < supportSize; ++e) { 803cd0c2139SMatthew G Knepley PetscInt val; 804cd0c2139SMatthew G Knepley 805cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 806cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 8074c367dbcSMatthew G. Knepley supportNew[qn++] = support[e] + depthOffset[dep+1]; 808cd0c2139SMatthew G Knepley } 809cd0c2139SMatthew G Knepley } 8104c367dbcSMatthew G. Knepley supportNew[qn] = hybedge; 811cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 812cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 8134c367dbcSMatthew G. Knepley for (e = 0, qp = 0; e < supportSize; ++e) { 814cd0c2139SMatthew G Knepley PetscInt val, edge; 815cd0c2139SMatthew G Knepley 816cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 817cd0c2139SMatthew G Knepley if (val == 1) { 8184c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 819cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 8204c367dbcSMatthew G. Knepley supportNew[qp++] = edge + pMaxNew[dep+1]; 821cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 8224c367dbcSMatthew G. Knepley supportNew[qp++] = support[e] + depthOffset[dep+1]; 823cd0c2139SMatthew G Knepley } 824cd0c2139SMatthew G Knepley } 8254c367dbcSMatthew G. Knepley supportNew[qp] = hybedge; 826cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 8274c367dbcSMatthew G. Knepley /* Hybrid edge: Old and new split vertex */ 828cd0c2139SMatthew G Knepley coneNew[0] = newp; 829cd0c2139SMatthew G Knepley coneNew[1] = splitp; 8304c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 8314c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 8324c367dbcSMatthew G. Knepley PetscInt val, edge; 8334c367dbcSMatthew G. Knepley 8344c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 8354c367dbcSMatthew G. Knepley if (val == 1) { 8364c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 8374c367dbcSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 8384c367dbcSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 8394c367dbcSMatthew G. Knepley } 8404c367dbcSMatthew G. Knepley } 8414c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 842cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 8434c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 8444c367dbcSMatthew G. Knepley 845cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 846cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 847cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 8484c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 849cd0c2139SMatthew G Knepley 8504c367dbcSMatthew G. Knepley coneNew[q] = v + pMaxNew[dep-1]; 851cd0c2139SMatthew G Knepley } 852cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 853cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 854cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 855cd0c2139SMatthew G Knepley PetscInt val; 856cd0c2139SMatthew G Knepley 857cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 8584c367dbcSMatthew G. Knepley if (val == dim-1) { 8594c367dbcSMatthew G. Knepley supportNew[q++] = support[e] + depthOffset[dep+1]; 8604c367dbcSMatthew G. Knepley } else if (val == (shift + dim-1)) { 8614c367dbcSMatthew G. Knepley supportNew[q++] = support[e] + depthOffset[dep+1]; 862cd0c2139SMatthew G Knepley } 863cd0c2139SMatthew G Knepley } 864b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 865cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 866cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 867cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 868cd0c2139SMatthew G Knepley PetscInt val, face; 869cd0c2139SMatthew G Knepley 870cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 871cd0c2139SMatthew G Knepley if (val == dim-1) { 8724c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 873cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 8744c367dbcSMatthew G. Knepley supportNew[q++] = face + pMaxNew[dep+1]; 875cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 8764c367dbcSMatthew G. Knepley supportNew[q++] = support[e] + depthOffset[dep+1]; 877cd0c2139SMatthew G Knepley } 878cd0c2139SMatthew G Knepley } 879b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 880cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 8814c367dbcSMatthew G. Knepley /* Hybrid face */ 8824c367dbcSMatthew G. Knepley coneNew[0] = newp; 8834c367dbcSMatthew G. Knepley coneNew[1] = splitp; 8844c367dbcSMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 8854c367dbcSMatthew G. Knepley PetscInt vertex; 8864c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr); 8874c367dbcSMatthew G. Knepley if (vertex < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not a split vertex", support[e]); 8884c367dbcSMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep]; 8894c367dbcSMatthew G. Knepley } 8904c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 8914c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 8924c367dbcSMatthew G. Knepley PetscInt val, face; 8934c367dbcSMatthew G. Knepley 8944c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 8954c367dbcSMatthew G. Knepley if (val == dim-1) { 8964c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 8974c367dbcSMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 8984c367dbcSMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 8994c367dbcSMatthew G. Knepley } 9004c367dbcSMatthew G. Knepley } 9014c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 902cd0c2139SMatthew G Knepley } 903cd0c2139SMatthew G Knepley } 904cd0c2139SMatthew G Knepley } 905*18c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 906*18c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 907*18c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 908*18c5995bSMatthew G. Knepley const PetscInt newp = oldp + depthOffset[dep]; 909*18c5995bSMatthew G. Knepley const PetscInt *cone, *support, *ornt; 910*18c5995bSMatthew G. Knepley PetscInt coneSize, supportSize, supportSizeNew, q, qf, qn, qp, v, e, s; 911*18c5995bSMatthew G. Knepley 912*18c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 913*18c5995bSMatthew G. Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 914*18c5995bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 915*18c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 916*18c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 917*18c5995bSMatthew G. Knepley if (dep == 0) { 918*18c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 919*18c5995bSMatthew G. Knepley 920*18c5995bSMatthew G. Knepley /* Unsplit vertex */ 921*18c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 922*18c5995bSMatthew G. Knepley for (s = 0, q = 0; s < supportSize; ++s) { 923*18c5995bSMatthew G. Knepley supportNew[q++] = support[s] + depthOffset[dep+1]; 924*18c5995bSMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 925*18c5995bSMatthew G. Knepley if (e >= 0) { 926*18c5995bSMatthew G. Knepley supportNew[q++] = e + pMaxNew[dep+1]; 927*18c5995bSMatthew G. Knepley } 928*18c5995bSMatthew G. Knepley } 929*18c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 930*18c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 931*18c5995bSMatthew G. Knepley if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp); 932*18c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 933*18c5995bSMatthew G. Knepley /* Hybrid edge */ 934*18c5995bSMatthew G. Knepley coneNew[0] = newp; 935*18c5995bSMatthew G. Knepley coneNew[1] = newp; 936*18c5995bSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 937*18c5995bSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 938*18c5995bSMatthew G. Knepley PetscInt val, edge; 939*18c5995bSMatthew G. Knepley 940*18c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 941*18c5995bSMatthew G. Knepley if (val == 1) { 942*18c5995bSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 943*18c5995bSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 944*18c5995bSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 945*18c5995bSMatthew G. Knepley } 946*18c5995bSMatthew G. Knepley } 947*18c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 948*18c5995bSMatthew G. Knepley } 949*18c5995bSMatthew G. Knepley } 950*18c5995bSMatthew G. Knepley } 951cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 952cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 953cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 954cd0c2139SMatthew G Knepley IS pIS; 955cd0c2139SMatthew G Knepley PetscInt numPoints; 956cd0c2139SMatthew G Knepley const PetscInt *points; 957cd0c2139SMatthew G Knepley 958cd0c2139SMatthew G Knepley if (dep >= 0) continue; 959cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 960cd0c2139SMatthew G Knepley if (!pIS) continue; 961cd0c2139SMatthew G Knepley dep = -dep - shift; 962cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 963cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 964cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 965cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 966cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + oldp; 967cd0c2139SMatthew G Knepley const PetscInt *cone; 968cd0c2139SMatthew G Knepley PetscInt coneSize, c; 96950cf782dSMatthew G. Knepley /* PetscBool replaced = PETSC_FALSE; */ 970cd0c2139SMatthew G Knepley 971cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 972cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 973cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 974cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 975cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 976cd0c2139SMatthew G Knepley const PetscInt coldp = cone[c] - depthOffset[dep-1]; 977cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 978cd0c2139SMatthew G Knepley 979cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 980cd0c2139SMatthew G Knepley if (val == dep-1) { 981cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 982cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 983cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 984cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 98550cf782dSMatthew G. Knepley /* replaced = PETSC_TRUE; */ 986cd0c2139SMatthew G Knepley } 987cd0c2139SMatthew G Knepley } 9884a189a86SMatthew G. Knepley /* Cells with only a vertex or edge on the submesh have no replacement */ 9894a189a86SMatthew G. Knepley /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 990cd0c2139SMatthew G Knepley } 991cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 992cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 993cd0c2139SMatthew G Knepley } 994cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 995cd0c2139SMatthew G Knepley ierr = DMPlexStratify(sdm);CHKERRQ(ierr); 996cd0c2139SMatthew G Knepley /* Step 8: Coordinates */ 997cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 998cd0c2139SMatthew G Knepley ierr = DMPlexGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 999cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 1000cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 1001cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 1002cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[0] + splitPoints[0][v]; 1003cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 1004cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 1005cd0c2139SMatthew G Knepley 1006cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 1007cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 1008cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 1009cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 1010cd0c2139SMatthew G Knepley } 1011cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 1012cd0c2139SMatthew G Knepley /* Step 9: SF, if I can figure this out we can split the mesh in parallel */ 1013cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1014cd0c2139SMatthew G Knepley /* Step 10: Labels */ 1015cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1016cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 1017cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1018cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 1019cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + splitPoints[dep][p]; 1020cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 1021cd0c2139SMatthew G Knepley PetscInt l; 1022cd0c2139SMatthew G Knepley 1023cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 1024cd0c2139SMatthew G Knepley DMLabel mlabel; 1025cd0c2139SMatthew G Knepley const char *lname; 1026cd0c2139SMatthew G Knepley PetscInt val; 10279a356370SMatthew G. Knepley PetscBool isDepth; 1028cd0c2139SMatthew G Knepley 1029cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 10309a356370SMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 10319a356370SMatthew G. Knepley if (isDepth) continue; 1032cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 1033cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 1034cd0c2139SMatthew G Knepley if (val >= 0) { 1035cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 10369a356370SMatthew G. Knepley #if 0 10379a356370SMatthew G. Knepley /* Do not put cohesive edges into the label */ 1038cd0c2139SMatthew G Knepley if (dep == 0) { 10394c367dbcSMatthew G. Knepley const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1040cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr); 10414c367dbcSMatthew G. Knepley } else if (dep == dim-2) { 10424c367dbcSMatthew G. Knepley const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 10434c367dbcSMatthew G. Knepley ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr); 1044cd0c2139SMatthew G Knepley } 10454c367dbcSMatthew G. Knepley /* Do not put cohesive faces into the label */ 10469a356370SMatthew G. Knepley #endif 1047cd0c2139SMatthew G Knepley } 1048cd0c2139SMatthew G Knepley } 1049cd0c2139SMatthew G Knepley } 1050cd0c2139SMatthew G Knepley } 1051cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1052cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 1053cd0c2139SMatthew G Knepley 1054cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 1055*18c5995bSMatthew G. Knepley if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 1056*18c5995bSMatthew G. Knepley ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr); 1057*18c5995bSMatthew G. Knepley if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);} 1058*18c5995bSMatthew G. Knepley ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr); 1059cd0c2139SMatthew G Knepley } 1060cd0c2139SMatthew G Knepley if (label) { 1061cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1062cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1063cd0c2139SMatthew G Knepley } 10640d4d4d06SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 10650d4d4d06SMatthew G. Knepley ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr); 10660d4d4d06SMatthew G. Knepley pMaxNew[d] = pEnd - numHybridPoints[d]; 10670d4d4d06SMatthew G. Knepley } 10680e49e2e2SMatthew 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); 1069dcbb62e8SMatthew G. Knepley ierr = PetscFree3(depthShift, depthOffset, pMaxNew);CHKERRQ(ierr); 1070dcbb62e8SMatthew G. Knepley ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr); 1071*18c5995bSMatthew G. Knepley ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr); 1072cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1073cd0c2139SMatthew G Knepley } 1074cd0c2139SMatthew G Knepley 1075cd0c2139SMatthew G Knepley #undef __FUNCT__ 1076cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells" 1077cd0c2139SMatthew G Knepley /*@C 1078cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 1079cd0c2139SMatthew G Knepley 1080cd0c2139SMatthew G Knepley Collective on dm 1081cd0c2139SMatthew G Knepley 1082cd0c2139SMatthew G Knepley Input Parameters: 1083cd0c2139SMatthew G Knepley + dm - The original DM 108453156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated) 1085cd0c2139SMatthew G Knepley 1086cd0c2139SMatthew G Knepley Output Parameters: 1087cd0c2139SMatthew G Knepley - dmSplit - The new DM 1088cd0c2139SMatthew G Knepley 1089cd0c2139SMatthew G Knepley Level: developer 1090cd0c2139SMatthew G Knepley 10912be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 1092cd0c2139SMatthew G Knepley @*/ 1093cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 1094cd0c2139SMatthew G Knepley { 1095cd0c2139SMatthew G Knepley DM sdm; 1096cd0c2139SMatthew G Knepley PetscInt dim; 1097cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1098cd0c2139SMatthew G Knepley 1099cd0c2139SMatthew G Knepley PetscFunctionBegin; 1100cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 110153156dfcSMatthew G. Knepley PetscValidPointer(dmSplit, 3); 1102cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 1103cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 1104cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1105cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(sdm, dim);CHKERRQ(ierr); 1106cd0c2139SMatthew G Knepley switch (dim) { 1107cd0c2139SMatthew G Knepley case 2: 1108cd0c2139SMatthew G Knepley case 3: 1109cd0c2139SMatthew G Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 1110cd0c2139SMatthew G Knepley break; 1111cd0c2139SMatthew G Knepley default: 1112cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 1113cd0c2139SMatthew G Knepley } 1114cd0c2139SMatthew G Knepley *dmSplit = sdm; 1115cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1116cd0c2139SMatthew G Knepley } 1117cd0c2139SMatthew G Knepley 1118cd0c2139SMatthew G Knepley #undef __FUNCT__ 11192be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete" 1120cd0c2139SMatthew G Knepley /*@ 11212be2b188SMatthew G Knepley DMPlexLabelCohesiveComplete - Starting with a label marking vertices on an internal surface, we add all other mesh pieces 1122cd0c2139SMatthew G Knepley to complete the surface 1123cd0c2139SMatthew G Knepley 1124cd0c2139SMatthew G Knepley Input Parameters: 1125cd0c2139SMatthew G Knepley + dm - The DM 112647946fd8SMatthew G. Knepley . label - A DMLabel marking the surface vertices 1127bb55d314SMatthew G. Knepley . flip - Flag to flip the submesh normal and replace points on the other side 112847946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL 1129cd0c2139SMatthew G Knepley 1130cd0c2139SMatthew G Knepley Output Parameter: 1131cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 1132cd0c2139SMatthew G Knepley 1133cd0c2139SMatthew G Knepley Level: developer 1134cd0c2139SMatthew G Knepley 11352be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 1136cd0c2139SMatthew G Knepley @*/ 1137bb55d314SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, PetscBool flip, DM subdm) 1138cd0c2139SMatthew G Knepley { 1139d90583fdSMatthew G. Knepley DMLabel depthLabel; 1140*18c5995bSMatthew G. Knepley IS dimIS, subpointIS, facePosIS, faceNegIS; 114147946fd8SMatthew G. Knepley const PetscInt *points, *subpoints; 1142bb55d314SMatthew G. Knepley const PetscInt rev = flip ? -1 : 1; 1143*18c5995bSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, dim, dep, cStart, cEnd, numPoints, numSubpoints, p, val; 1144cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1145cd0c2139SMatthew G Knepley 1146cd0c2139SMatthew G Knepley PetscFunctionBegin; 1147d90583fdSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 1148cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 114947946fd8SMatthew G. Knepley if (subdm) { 115047946fd8SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 115147946fd8SMatthew G. Knepley if (subpointIS) { 115247946fd8SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 115347946fd8SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 115447946fd8SMatthew G. Knepley } 115547946fd8SMatthew G. Knepley } 1156d7c8f101SMatthew G. Knepley /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */ 1157cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 1158cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1159cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1160cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1161d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */ 1162cd0c2139SMatthew G Knepley const PetscInt *support; 1163cd0c2139SMatthew G Knepley PetscInt supportSize, s; 1164cd0c2139SMatthew G Knepley 1165cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1166cd0c2139SMatthew G Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 1167cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1168cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1169cd0c2139SMatthew G Knepley const PetscInt *cone, *ornt; 1170cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1171cd0c2139SMatthew G Knepley PetscBool pos = PETSC_TRUE; 1172cd0c2139SMatthew G Knepley 1173cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1174cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1175cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 1176cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1177cd0c2139SMatthew G Knepley if (cone[c] == points[p]) { 117847946fd8SMatthew G. Knepley PetscInt o = ornt[c]; 117947946fd8SMatthew G. Knepley 118047946fd8SMatthew G. Knepley if (subdm) { 118147946fd8SMatthew G. Knepley const PetscInt *subcone, *subornt; 118247946fd8SMatthew G. Knepley PetscInt subpoint, subface, subconeSize, sc; 118347946fd8SMatthew G. Knepley 118447946fd8SMatthew G. Knepley ierr = PetscFindInt(support[s], numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 118547946fd8SMatthew G. Knepley ierr = PetscFindInt(points[p], numSubpoints, subpoints, &subface);CHKERRQ(ierr); 118647946fd8SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 118747946fd8SMatthew G. Knepley ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 118847946fd8SMatthew G. Knepley ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 118947946fd8SMatthew G. Knepley for (sc = 0; sc < subconeSize; ++sc) { 119047946fd8SMatthew G. Knepley if (subcone[sc] == subface) { 119147946fd8SMatthew G. Knepley o = subornt[0]; 119247946fd8SMatthew G. Knepley break; 119347946fd8SMatthew G. Knepley } 119447946fd8SMatthew G. Knepley } 119547946fd8SMatthew 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); 119647946fd8SMatthew G. Knepley } 119747946fd8SMatthew G. Knepley if (o >= 0) { 1198bb55d314SMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr); 1199ffaa4bbcSMatthew G. Knepley pos = rev > 0 ? PETSC_TRUE : PETSC_FALSE; 1200cd0c2139SMatthew G Knepley } else { 1201bb55d314SMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr); 1202ffaa4bbcSMatthew G. Knepley pos = rev > 0 ? PETSC_FALSE : PETSC_TRUE; 1203cd0c2139SMatthew G Knepley } 1204cd0c2139SMatthew G Knepley break; 1205cd0c2139SMatthew G Knepley } 1206cd0c2139SMatthew G Knepley } 1207cd0c2139SMatthew 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]); 1208cd0c2139SMatthew G Knepley /* Put faces touching the fault in the label */ 1209cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1210cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 1211cd0c2139SMatthew G Knepley 1212cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1213cd0c2139SMatthew G Knepley if (val == -1) { 1214cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 1215cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 1216cd0c2139SMatthew G Knepley 1217cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1218cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1219cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 1220cd0c2139SMatthew G Knepley 1221cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1222cd0c2139SMatthew G Knepley if ((val >= 0) && (val < dim-1)) { 1223cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1224cd0c2139SMatthew G Knepley break; 1225cd0c2139SMatthew G Knepley } 1226cd0c2139SMatthew G Knepley } 1227cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1228cd0c2139SMatthew G Knepley } 1229cd0c2139SMatthew G Knepley } 1230cd0c2139SMatthew G Knepley } 1231cd0c2139SMatthew G Knepley } 123247946fd8SMatthew G. Knepley if (subdm) { 123347946fd8SMatthew G. Knepley if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 123447946fd8SMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 123547946fd8SMatthew G. Knepley } 1236cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1237cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1238cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1239cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1240cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 1241cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1242cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1243cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1244d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */ 1245cd0c2139SMatthew G Knepley PetscInt *star = NULL; 1246cd0c2139SMatthew G Knepley PetscInt starSize, s; 1247cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1248cd0c2139SMatthew G Knepley 1249d4622b2cSMatthew G. Knepley /* All points connected to the fault are inside a cell, so at the top level we will only check cells */ 1250cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1251cd0c2139SMatthew G Knepley while (again) { 1252cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1253cd0c2139SMatthew G Knepley again = 0; 1254cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1255cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1256cd0c2139SMatthew G Knepley const PetscInt *cone; 1257cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1258cd0c2139SMatthew G Knepley 1259cd0c2139SMatthew G Knepley if ((point < cStart) || (point >= cEnd)) continue; 1260cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1261cd0c2139SMatthew G Knepley if (val != -1) continue; 1262d4622b2cSMatthew G. Knepley again = again == 1 ? 1 : 2; 1263cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1264cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1265cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1266cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1267cd0c2139SMatthew G Knepley if (val != -1) { 1268d7c8f101SMatthew G. Knepley const PetscInt *ccone; 1269166d9d0cSMatthew G. Knepley PetscInt cconeSize, cc, side; 1270d7c8f101SMatthew G. Knepley 1271cd0c2139SMatthew 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); 127237a6de01SMatthew G. Knepley if (val > 0) side = 1; 127337a6de01SMatthew G. Knepley else side = -1; 127437a6de01SMatthew G. Knepley ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr); 1275d7c8f101SMatthew G. Knepley /* Mark cell faces which touch the fault */ 1276d7c8f101SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr); 1277d7c8f101SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr); 1278d7c8f101SMatthew G. Knepley for (cc = 0; cc < cconeSize; ++cc) { 1279d7c8f101SMatthew G. Knepley PetscInt *closure = NULL; 1280d7c8f101SMatthew G. Knepley PetscInt closureSize, cl; 1281d7c8f101SMatthew G. Knepley 1282166d9d0cSMatthew G. Knepley ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr); 1283166d9d0cSMatthew G. Knepley if (val != -1) continue; 1284d7c8f101SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1285d4622b2cSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1286d7c8f101SMatthew G. Knepley const PetscInt clp = closure[cl]; 1287d7c8f101SMatthew G. Knepley 1288d7c8f101SMatthew G. Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1289d7c8f101SMatthew G. Knepley if (val == -1) continue; 1290d7c8f101SMatthew G. Knepley ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr); 129137a6de01SMatthew G. Knepley break; 129237a6de01SMatthew G. Knepley } 1293d7c8f101SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 129437a6de01SMatthew G. Knepley } 1295cd0c2139SMatthew G Knepley again = 1; 1296cd0c2139SMatthew G Knepley break; 1297cd0c2139SMatthew G Knepley } 1298cd0c2139SMatthew G Knepley } 1299cd0c2139SMatthew G Knepley } 1300cd0c2139SMatthew G Knepley } 1301cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1302cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1303cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1304cd0c2139SMatthew G Knepley 1305cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1306cd0c2139SMatthew G Knepley if (val == -1) { 1307cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1308cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1309cd0c2139SMatthew G Knepley PetscBool marked = PETSC_FALSE; 1310cd0c2139SMatthew G Knepley 1311cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1312cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1313cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1314cd0c2139SMatthew G Knepley 1315cd0c2139SMatthew G Knepley if ((spoint < cStart) || (spoint >= cEnd)) continue; 1316cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1317cd0c2139SMatthew 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); 1318d90583fdSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1319cd0c2139SMatthew G Knepley if (val > 0) { 1320cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1321cd0c2139SMatthew G Knepley } else { 1322cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1323cd0c2139SMatthew G Knepley } 1324cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1325cd0c2139SMatthew G Knepley break; 1326cd0c2139SMatthew G Knepley } 1327cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1328cd0c2139SMatthew G Knepley if (!marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1329cd0c2139SMatthew G Knepley } 1330cd0c2139SMatthew G Knepley } 1331cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1332cd0c2139SMatthew G Knepley } 1333cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1334cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1335*18c5995bSMatthew G. Knepley /* If any faces touching the fault divide cells on either side, split them */ 1336*18c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift+dim-1, &facePosIS);CHKERRQ(ierr); 1337*18c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr); 1338*18c5995bSMatthew G. Knepley ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr); 1339*18c5995bSMatthew G. Knepley ierr = ISDestroy(&facePosIS);CHKERRQ(ierr); 1340*18c5995bSMatthew G. Knepley ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr); 1341*18c5995bSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1342*18c5995bSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1343*18c5995bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1344*18c5995bSMatthew G. Knepley const PetscInt point = points[p]; 1345*18c5995bSMatthew G. Knepley const PetscInt *support; 1346*18c5995bSMatthew G. Knepley PetscInt supportSize, valA, valB; 1347*18c5995bSMatthew G. Knepley 1348*18c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 1349*18c5995bSMatthew G. Knepley if (supportSize != 2) continue; 1350*18c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 1351*18c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr); 1352*18c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr); 1353*18c5995bSMatthew G. Knepley if ((valA == -1) || (valB == -1)) continue; 1354*18c5995bSMatthew G. Knepley if (valA*valB > 0) continue; 1355*18c5995bSMatthew G. Knepley /* Split the face */ 1356*18c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr); 1357*18c5995bSMatthew G. Knepley ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr); 1358*18c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr); 1359*18c5995bSMatthew G. Knepley /* Label its closure as unsplit */ 1360*18c5995bSMatthew G. Knepley { 1361*18c5995bSMatthew G. Knepley PetscInt *closure = NULL; 1362*18c5995bSMatthew G. Knepley PetscInt closureSize, cl; 1363*18c5995bSMatthew G. Knepley 1364*18c5995bSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1365*18c5995bSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1366*18c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr); 1367*18c5995bSMatthew G. Knepley if (valA != -1) continue; 1368*18c5995bSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 1369*18c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr); 1370*18c5995bSMatthew G. Knepley } 1371*18c5995bSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1372*18c5995bSMatthew G. Knepley } 1373*18c5995bSMatthew G. Knepley } 1374*18c5995bSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1375*18c5995bSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1376cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1377cd0c2139SMatthew G Knepley } 1378cd0c2139SMatthew G Knepley 1379cd0c2139SMatthew G Knepley #undef __FUNCT__ 13803cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh" 13813cf72582SMatthew G. Knepley /*@C 13823cf72582SMatthew G. Knepley DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface 13833cf72582SMatthew G. Knepley 13843cf72582SMatthew G. Knepley Collective on dm 13853cf72582SMatthew G. Knepley 13863cf72582SMatthew G. Knepley Input Parameters: 13873cf72582SMatthew G. Knepley + dm - The original DM 13883cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices 13893cf72582SMatthew G. Knepley 13903cf72582SMatthew G. Knepley Output Parameters: 13913cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface 13923cf72582SMatthew G. Knepley - dmHybrid - The new DM 13933cf72582SMatthew G. Knepley 13943cf72582SMatthew G. Knepley Level: developer 13953cf72582SMatthew G. Knepley 13963cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate() 13973cf72582SMatthew G. Knepley @*/ 13983cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid) 13993cf72582SMatthew G. Knepley { 14003cf72582SMatthew G. Knepley DM idm; 14013cf72582SMatthew G. Knepley DMLabel subpointMap, hlabel; 14023cf72582SMatthew G. Knepley PetscInt dim; 14033cf72582SMatthew G. Knepley PetscErrorCode ierr; 14043cf72582SMatthew G. Knepley 14053cf72582SMatthew G. Knepley PetscFunctionBegin; 14063cf72582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 14073cf72582SMatthew G. Knepley if (hybridLabel) PetscValidPointer(hybridLabel, 3); 14083cf72582SMatthew G. Knepley PetscValidPointer(dmHybrid, 4); 14093cf72582SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 14103cf72582SMatthew G. Knepley ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr); 14113cf72582SMatthew G. Knepley ierr = DMPlexOrient(idm);CHKERRQ(ierr); 14123cf72582SMatthew G. Knepley ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr); 14133cf72582SMatthew G. Knepley ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr); 14143cf72582SMatthew G. Knepley ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr); 14153cf72582SMatthew G. Knepley ierr = DMPlexLabelCohesiveComplete(dm, hlabel, PETSC_FALSE, idm);CHKERRQ(ierr); 14163cf72582SMatthew G. Knepley ierr = DMDestroy(&idm);CHKERRQ(ierr); 14173cf72582SMatthew G. Knepley ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr); 14183cf72582SMatthew G. Knepley if (hybridLabel) *hybridLabel = hlabel; 141953aa2e23SMatthew G. Knepley else {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);} 14203cf72582SMatthew G. Knepley PetscFunctionReturn(0); 14213cf72582SMatthew G. Knepley } 14223cf72582SMatthew G. Knepley 14233cf72582SMatthew G. Knepley #undef __FUNCT__ 1424efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated" 1425efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 1426efa14ee0SMatthew G Knepley 1427efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 1428efa14ee0SMatthew G Knepley */ 1429830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1430efa14ee0SMatthew G Knepley { 1431fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 1432efa14ee0SMatthew G Knepley const PetscInt *subvertices; 143377d178adSMatthew G. Knepley PetscInt *pStart, *pEnd, *pMax, pSize; 1434efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1435efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1436efa14ee0SMatthew G Knepley 1437efa14ee0SMatthew G Knepley PetscFunctionBegin; 1438efa14ee0SMatthew G Knepley *numFaces = 0; 1439efa14ee0SMatthew G Knepley *nFV = 0; 1440efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1441efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 144277d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 144377d178adSMatthew G. Knepley ierr = PetscMalloc3(pSize,PetscInt,&pStart,pSize,PetscInt,&pEnd,pSize,PetscInt,&pMax);CHKERRQ(ierr); 1444d92e47f8SMatthew 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); 1445efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 1446efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1447efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1448efa14ee0SMatthew G Knepley } 1449efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1450fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1451efa14ee0SMatthew G Knepley if (subvertexIS) { 1452efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1453efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1454efa14ee0SMatthew G Knepley } 1455efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1456efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 14570298fd71SBarry Smith PetscInt *star = NULL; 1458efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 1459efa14ee0SMatthew G Knepley 1460efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1461efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1462efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1463efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1464efa14ee0SMatthew G Knepley } 1465efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 1466efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 14670298fd71SBarry Smith PetscInt *closure = NULL; 1468efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 1469efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 1470efa14ee0SMatthew G Knepley 1471efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 147265560c7fSMatthew G Knepley if (cellLoc == 2) continue; 147382f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1474efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1475efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1476efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1477efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1478efa14ee0SMatthew G Knepley 1479efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1480efa14ee0SMatthew G Knepley ++numCorners; 1481efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1482830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 1483efa14ee0SMatthew G Knepley } 1484efa14ee0SMatthew G Knepley } 148518ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 148682f516ccSBarry 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); 1487efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 1488007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 1489007baee2SMatthew G. Knepley PetscInt numCells, nc; 1490007baee2SMatthew G. Knepley 1491efa14ee0SMatthew G Knepley ++(*numFaces); 1492efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 1493efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 1494efa14ee0SMatthew G Knepley } 1495007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1496007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 1497007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 1498007baee2SMatthew G. Knepley } 1499007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1500efa14ee0SMatthew G Knepley } 1501efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1502efa14ee0SMatthew G Knepley } 1503efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1504efa14ee0SMatthew G Knepley } 1505efa14ee0SMatthew G Knepley if (subvertexIS) { 1506efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1507efa14ee0SMatthew G Knepley } 1508efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1509efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1510efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1511efa14ee0SMatthew G Knepley } 1512efa14ee0SMatthew G Knepley 1513efa14ee0SMatthew G Knepley #undef __FUNCT__ 1514efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated" 1515830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 1516efa14ee0SMatthew G Knepley { 1517efa14ee0SMatthew G Knepley IS subvertexIS; 1518efa14ee0SMatthew G Knepley const PetscInt *subvertices; 1519efa14ee0SMatthew G Knepley PetscInt *pStart, *pEnd, *pMax; 1520efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 1521efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1522efa14ee0SMatthew G Knepley 1523efa14ee0SMatthew G Knepley PetscFunctionBegin; 1524efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1525efa14ee0SMatthew G Knepley ierr = PetscMalloc3(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd,dim+1,PetscInt,&pMax);CHKERRQ(ierr); 15260298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1527efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 1528efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1529efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1530efa14ee0SMatthew G Knepley } 1531efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1532830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 1533efa14ee0SMatthew G Knepley if (subvertexIS) { 1534efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1535efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1536efa14ee0SMatthew G Knepley } 1537efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1538efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 15390298fd71SBarry Smith PetscInt *star = NULL; 1540efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 1541efa14ee0SMatthew G Knepley 1542efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1543efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1544efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1545efa14ee0SMatthew G Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 1546efa14ee0SMatthew G Knepley } 1547efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 1548efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 15490298fd71SBarry Smith PetscInt *closure = NULL; 1550efa14ee0SMatthew G Knepley PetscInt closureSize, c; 1551efa14ee0SMatthew G Knepley PetscInt faceLoc; 1552efa14ee0SMatthew G Knepley 1553efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 1554efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 155582f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 1556efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1557efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1558efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1559efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1560efa14ee0SMatthew G Knepley 1561efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1562efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1563830e53efSMatthew G. Knepley if (vertexLoc != value) break; 1564efa14ee0SMatthew G Knepley } 1565efa14ee0SMatthew G Knepley } 1566efa14ee0SMatthew G Knepley if (c == closureSize*2) { 1567efa14ee0SMatthew G Knepley const PetscInt *support; 1568efa14ee0SMatthew G Knepley PetscInt supportSize, s; 1569efa14ee0SMatthew G Knepley 1570efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1571efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1572efa14ee0SMatthew G Knepley 1573efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 1574efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1575efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1576efa14ee0SMatthew G Knepley break; 1577efa14ee0SMatthew G Knepley } 1578efa14ee0SMatthew G Knepley } 1579efa14ee0SMatthew G Knepley } 1580efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 1581efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 1582efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1583efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1584efa14ee0SMatthew G Knepley } 1585efa14ee0SMatthew G Knepley } 1586efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1587efa14ee0SMatthew G Knepley } 1588efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1589efa14ee0SMatthew G Knepley } 1590efa14ee0SMatthew G Knepley if (subvertexIS) { 1591efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1592efa14ee0SMatthew G Knepley } 1593efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1594efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1595efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1596efa14ee0SMatthew G Knepley } 1597efa14ee0SMatthew G Knepley 1598efa14ee0SMatthew G Knepley #undef __FUNCT__ 1599766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated" 160027c04023SMatthew 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) 1601766ab985SMatthew G. Knepley { 160227c04023SMatthew G. Knepley DMLabel label = NULL; 1603766ab985SMatthew G. Knepley const PetscInt *cone; 160427234c99SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize; 1605766ab985SMatthew G. Knepley PetscErrorCode ierr; 1606766ab985SMatthew G. Knepley 1607812bfc34SJed Brown PetscFunctionBegin; 1608c0ed958bSJed Brown *numFaces = 0; 1609c0ed958bSJed Brown *nFV = 0; 1610b6d5cb33SJed Brown if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1611fed694aaSMatthew G. Knepley *subCells = NULL; 1612766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1613766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1614766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1615766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 161627c04023SMatthew G. Knepley if (label) { 161727c04023SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 161827c04023SMatthew G. Knepley PetscInt val; 161927c04023SMatthew G. Knepley 162027c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 162127c04023SMatthew G. Knepley if (val == value) { 162227c04023SMatthew G. Knepley ++(*numFaces); 162327c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 162427c04023SMatthew G. Knepley } 162527c04023SMatthew G. Knepley } 162627c04023SMatthew G. Knepley } else { 1627766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 162827c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 162927c04023SMatthew G. Knepley } 1630766ab985SMatthew G. Knepley *nFV = hasLagrange ? coneSize/3 : coneSize/2; 1631766ab985SMatthew G. Knepley ierr = PetscMalloc(*numFaces *2 * sizeof(PetscInt), subCells);CHKERRQ(ierr); 1632766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1633766ab985SMatthew G. Knepley const PetscInt *cells; 1634766ab985SMatthew G. Knepley PetscInt numCells; 1635766ab985SMatthew G. Knepley 163627c04023SMatthew G. Knepley if (label) { 163727c04023SMatthew G. Knepley PetscInt val; 163827c04023SMatthew G. Knepley 163927c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 164027c04023SMatthew G. Knepley if (val != value) continue; 164127c04023SMatthew G. Knepley } 1642766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1643766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 1644766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 1645766ab985SMatthew G. Knepley } 1646766ab985SMatthew G. Knepley /* Negative face */ 1647766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 164827234c99SMatthew G. Knepley /* Not true in parallel 164927234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 1650766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 1651766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 165227234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 1653766ab985SMatthew G. Knepley } 1654766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 1655766ab985SMatthew G. Knepley /* Positive face is not included */ 1656766ab985SMatthew G. Knepley } 1657766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1658766ab985SMatthew G. Knepley } 1659766ab985SMatthew G. Knepley 1660766ab985SMatthew G. Knepley #undef __FUNCT__ 1661766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated" 166227c04023SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, PetscBool hasLagrange, const char labelname[], PetscInt value, DMLabel subpointMap, DM subdm) 1663766ab985SMatthew G. Knepley { 166427c04023SMatthew G. Knepley DMLabel label = NULL; 1665766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 1666766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 1667766ab985SMatthew G. Knepley PetscErrorCode ierr; 1668766ab985SMatthew G. Knepley 1669812bfc34SJed Brown PetscFunctionBegin; 167027c04023SMatthew G. Knepley if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1671766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1672766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1673766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1674766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 1675766ab985SMatthew G. Knepley ierr = PetscMalloc2(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd);CHKERRQ(ierr); 1676766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 1677766ab985SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1678766ab985SMatthew G. Knepley } 1679766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1680766ab985SMatthew G. Knepley const PetscInt *cone; 1681766ab985SMatthew G. Knepley PetscInt *closure = NULL; 1682766ab985SMatthew G. Knepley PetscInt coneSize, closureSize, cl; 1683766ab985SMatthew G. Knepley 168427c04023SMatthew G. Knepley if (label) { 168527c04023SMatthew G. Knepley PetscInt val; 168627c04023SMatthew G. Knepley 168727c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 168827c04023SMatthew G. Knepley if (val != value) continue; 168927c04023SMatthew G. Knepley } 1690766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 1691766ab985SMatthew G. Knepley if (hasLagrange) { 1692766ab985SMatthew G. Knepley if (coneSize != 3) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 1693766ab985SMatthew G. Knepley } else { 1694766ab985SMatthew G. Knepley if (coneSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 1695766ab985SMatthew G. Knepley } 1696766ab985SMatthew G. Knepley /* Negative face */ 1697766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1698766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1699766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1700766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 1701766ab985SMatthew G. Knepley 1702766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 1703766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1704766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1705766ab985SMatthew G. Knepley break; 1706766ab985SMatthew G. Knepley } 1707766ab985SMatthew G. Knepley } 1708766ab985SMatthew G. Knepley } 1709766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1710766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 1711766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 1712766ab985SMatthew G. Knepley const PetscInt *support; 1713766ab985SMatthew G. Knepley PetscInt supportSize, s; 1714766ab985SMatthew G. Knepley 1715766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 1716766ab985SMatthew G. Knepley if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); 1717766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 1718766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 1719766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1720766ab985SMatthew G. Knepley } 1721766ab985SMatthew G. Knepley } 1722766ab985SMatthew G. Knepley } 1723766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 1724766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1725766ab985SMatthew G. Knepley } 1726766ab985SMatthew G. Knepley 1727766ab985SMatthew G. Knepley #undef __FUNCT__ 1728e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation" 1729e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 1730e6ccafaeSMatthew G Knepley { 173182f516ccSBarry Smith MPI_Comm comm; 1732e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 1733e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 1734e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 1735e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1736e6ccafaeSMatthew G Knepley 173782f516ccSBarry Smith PetscFunctionBegin; 173882f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1739e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &cellDim);CHKERRQ(ierr); 1740e6ccafaeSMatthew G Knepley if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 1741e6ccafaeSMatthew G Knepley 1742ddeab2a6SMatthew G. Knepley if (cellDim == 1 && numCorners == 2) { 1743ddeab2a6SMatthew G. Knepley /* Triangle */ 1744e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 1745e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1746ddeab2a6SMatthew G. Knepley } else if (cellDim == 2 && numCorners == 3) { 1747ddeab2a6SMatthew G. Knepley /* Triangle */ 1748ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 1749ddeab2a6SMatthew G. Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1750ddeab2a6SMatthew G. Knepley } else if (cellDim == 3 && numCorners == 4) { 1751ddeab2a6SMatthew G. Knepley /* Tetrahedron */ 1752ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 1753ddeab2a6SMatthew G. Knepley posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1754e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 1755e6ccafaeSMatthew G Knepley /* Quadratic line */ 1756e6ccafaeSMatthew G Knepley faceSize = 1; 1757e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1758e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 1759e6ccafaeSMatthew G Knepley /* Quads */ 1760e6ccafaeSMatthew G Knepley faceSize = 2; 1761e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 1762e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1763e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 1764e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1765e6ccafaeSMatthew G Knepley } else { 1766e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 1767e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 1768e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 1769e6ccafaeSMatthew G Knepley } 1770e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 1771e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 1772e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 1773e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 1774e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 1775e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1776e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 1777e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 1778e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 1779e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 1780e6ccafaeSMatthew G Knepley }; 1781e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 1782e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 1783e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 1784e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 1785e6ccafaeSMatthew G Knepley }; 1786e6ccafaeSMatthew G Knepley 1787e6ccafaeSMatthew G Knepley faceSize = faceSizeTri; 1788e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 1789e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 1790e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 1791e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 1792e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1793e6ccafaeSMatthew G Knepley 1794e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 1795e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 1796e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 1797e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 1798e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 1799e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1800e6ccafaeSMatthew G Knepley break; 1801e6ccafaeSMatthew G Knepley } 1802e6ccafaeSMatthew G Knepley } 1803e6ccafaeSMatthew G Knepley } 1804e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1805e6ccafaeSMatthew G Knepley break; 1806e6ccafaeSMatthew G Knepley } 1807e6ccafaeSMatthew G Knepley } 1808e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 1809e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1810e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1811e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 1812e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 1813e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 1814e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 1815e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 1816e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1817e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 1818e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 1819e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 1820e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 1821e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 1822e6ccafaeSMatthew G Knepley }; 1823e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 1824e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 1825e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 1826e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 1827e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 1828e6ccafaeSMatthew G Knepley }; 1829e6ccafaeSMatthew G Knepley 1830e6ccafaeSMatthew G Knepley faceSize = faceSizeQuad; 1831e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 1832e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 1833e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 1834e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 1835e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1836e6ccafaeSMatthew G Knepley 1837e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 1838e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 1839e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 1840e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 1841e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 1842e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1843e6ccafaeSMatthew G Knepley break; 1844e6ccafaeSMatthew G Knepley } 1845e6ccafaeSMatthew G Knepley } 1846e6ccafaeSMatthew G Knepley } 1847e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1848e6ccafaeSMatthew G Knepley break; 1849e6ccafaeSMatthew G Knepley } 1850e6ccafaeSMatthew G Knepley } 1851e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 1852e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1853e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1854e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 1855e6ccafaeSMatthew G Knepley /* Hexes 1856e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 1857e6ccafaeSMatthew G Knepley pointing up at the second. 1858e6ccafaeSMatthew G Knepley 1859e6ccafaeSMatthew G Knepley 7---6 1860e6ccafaeSMatthew G Knepley /| /| 1861e6ccafaeSMatthew G Knepley 4---5 | 1862ddeab2a6SMatthew G. Knepley | 1-|-2 1863e6ccafaeSMatthew G Knepley |/ |/ 1864ddeab2a6SMatthew G. Knepley 0---3 1865e6ccafaeSMatthew G Knepley 1866e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 1867e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 1868e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 1869e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1870e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 1871e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 1872e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 1873ddeab2a6SMatthew G. Knepley 0, 3, 4, 5, /* front */ 1874ddeab2a6SMatthew G. Knepley 2, 3, 5, 6, /* right */ 1875ddeab2a6SMatthew G. Knepley 1, 2, 6, 7, /* back */ 1876ddeab2a6SMatthew G. Knepley 0, 1, 4, 7, /* left */ 1877e6ccafaeSMatthew G Knepley }; 1878e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 1879ddeab2a6SMatthew G. Knepley 1, 2, 3, 0, /* bottom */ 1880e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 1881ddeab2a6SMatthew G. Knepley 0, 3, 5, 4, /* front */ 1882ddeab2a6SMatthew G. Knepley 3, 2, 6, 5, /* right */ 1883ddeab2a6SMatthew G. Knepley 2, 1, 7, 6, /* back */ 1884ddeab2a6SMatthew G. Knepley 1, 0, 4, 7, /* left */ 1885e6ccafaeSMatthew G Knepley }; 1886e6ccafaeSMatthew G Knepley 1887e6ccafaeSMatthew G Knepley faceSize = faceSizeHex; 1888e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 1889e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 1890e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 1891e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 1892e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1893e6ccafaeSMatthew G Knepley 1894e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 1895e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 1896e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 1897e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 1898e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 1899e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 1900e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 1901e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1902e6ccafaeSMatthew G Knepley break; 1903e6ccafaeSMatthew G Knepley } 1904e6ccafaeSMatthew G Knepley } 1905e6ccafaeSMatthew G Knepley } 1906e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1907e6ccafaeSMatthew G Knepley break; 1908e6ccafaeSMatthew G Knepley } 1909e6ccafaeSMatthew G Knepley } 1910e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 1911e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1912e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1913e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 1914e6ccafaeSMatthew G Knepley /* Quadratic tet */ 1915e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 1916e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 1917e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 1918e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1919e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 1920e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 1921e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 1922e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 1923e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 1924e6ccafaeSMatthew G Knepley }; 1925e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 1926e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 1927e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 1928e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 1929e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 1930e6ccafaeSMatthew G Knepley }; 1931e6ccafaeSMatthew G Knepley 1932e6ccafaeSMatthew G Knepley faceSize = faceSizeTet; 1933e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 1934e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 1935e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 1936e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 1937e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1938e6ccafaeSMatthew G Knepley 1939e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 1940e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 1941e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 1942e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 1943e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 1944e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 1945e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 1946e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1947e6ccafaeSMatthew G Knepley break; 1948e6ccafaeSMatthew G Knepley } 1949e6ccafaeSMatthew G Knepley } 1950e6ccafaeSMatthew G Knepley } 1951e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1952e6ccafaeSMatthew G Knepley break; 1953e6ccafaeSMatthew G Knepley } 1954e6ccafaeSMatthew G Knepley } 1955e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 1956e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1957e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1958e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 1959e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 1960e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 1961e6ccafaeSMatthew G Knepley pointing up at the second. 1962e6ccafaeSMatthew G Knepley 1963e6ccafaeSMatthew G Knepley 7---6 1964e6ccafaeSMatthew G Knepley /| /| 1965e6ccafaeSMatthew G Knepley 4---5 | 1966e6ccafaeSMatthew G Knepley | 3-|-2 1967e6ccafaeSMatthew G Knepley |/ |/ 1968e6ccafaeSMatthew G Knepley 0---1 1969e6ccafaeSMatthew G Knepley 1970e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 1971e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 1972e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 1973e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1974e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 1975e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 1976e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 1977e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 1978e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 1979e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 1980e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 1981e6ccafaeSMatthew G Knepley }; 1982e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 1983e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 1984e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 1985e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 1986e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 1987e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 1988e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 1989e6ccafaeSMatthew G Knepley }; 1990e6ccafaeSMatthew G Knepley 1991e6ccafaeSMatthew G Knepley faceSize = faceSizeQuadHex; 1992e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 1993e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 1994e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 1995e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 1996e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1997e6ccafaeSMatthew G Knepley 1998e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 1999e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 2000e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 2001e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 2002e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 2003e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 2004e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 2005e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2006e6ccafaeSMatthew G Knepley break; 2007e6ccafaeSMatthew G Knepley } 2008e6ccafaeSMatthew G Knepley } 2009e6ccafaeSMatthew G Knepley } 2010e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2011e6ccafaeSMatthew G Knepley break; 2012e6ccafaeSMatthew G Knepley } 2013e6ccafaeSMatthew G Knepley } 2014e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2015e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2016e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2017e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 2018e6ccafaeSMatthew G Knepley if (!posOrient) { 2019e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 2020e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 2021e6ccafaeSMatthew G Knepley } else { 2022e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 2023e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 2024e6ccafaeSMatthew G Knepley } 2025e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 2026e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2027e6ccafaeSMatthew G Knepley } 2028e6ccafaeSMatthew G Knepley 2029e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2030e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace" 2031e6ccafaeSMatthew G Knepley /* 2032e6ccafaeSMatthew G Knepley Given a cell and a face, as a set of vertices, 2033e6ccafaeSMatthew G Knepley return the oriented face, as a set of vertices, in faceVertices 2034e6ccafaeSMatthew G Knepley The orientation is such that the face normal points out of the cell 2035e6ccafaeSMatthew G Knepley */ 2036e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2037e6ccafaeSMatthew G Knepley { 20380298fd71SBarry Smith const PetscInt *cone = NULL; 2039e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 2040e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 2041e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2042e6ccafaeSMatthew G Knepley 2043e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2044e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 2045e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 2046e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 2047e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2048e6ccafaeSMatthew G Knepley 2049e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 2050e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 2051e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 2052e6ccafaeSMatthew G Knepley } 2053e6ccafaeSMatthew G Knepley } 2054e6ccafaeSMatthew G Knepley if (found) { 2055e6ccafaeSMatthew G Knepley indices[v2] = v; 2056e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 2057e6ccafaeSMatthew G Knepley ++v2; 2058e6ccafaeSMatthew G Knepley } else { 2059e6ccafaeSMatthew G Knepley oppositeVertex = v; 2060e6ccafaeSMatthew G Knepley } 2061e6ccafaeSMatthew G Knepley } 2062e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 2063e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2064e6ccafaeSMatthew G Knepley } 2065e6ccafaeSMatthew G Knepley 2066e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2067cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal" 2068e6ccafaeSMatthew G Knepley /* 2069cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 2070e6ccafaeSMatthew G Knepley 2071e6ccafaeSMatthew G Knepley Not collective 2072e6ccafaeSMatthew G Knepley 2073e6ccafaeSMatthew G Knepley Input Parameters: 2074e6ccafaeSMatthew G Knepley + dm - The DMPlex 2075e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 2076e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 2077e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 2078e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 2079e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 2080e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 2081e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 2082e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 2083e6ccafaeSMatthew G Knepley 2084e6ccafaeSMatthew G Knepley Output Parameters: 2085e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 2086e6ccafaeSMatthew G Knepley 2087e6ccafaeSMatthew G Knepley Level: developer 2088e6ccafaeSMatthew G Knepley */ 2089cd0c2139SMatthew 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) 2090e6ccafaeSMatthew G Knepley { 209182f516ccSBarry Smith MPI_Comm comm; 2092e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 2093e6ccafaeSMatthew G Knepley const PetscInt *faces; 2094e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 2095e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2096e6ccafaeSMatthew G Knepley 2097e6ccafaeSMatthew G Knepley PetscFunctionBegin; 209882f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2099e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 2100e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 2101e6ccafaeSMatthew G Knepley #if 0 2102e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 2103e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2104e6ccafaeSMatthew G Knepley #else 2105e6ccafaeSMatthew G Knepley { 2106e6ccafaeSMatthew G Knepley PetscInt f; 2107e6ccafaeSMatthew G Knepley 2108e6ccafaeSMatthew G Knepley numFaces = 0; 2109e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2110e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 2111e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 2112e6ccafaeSMatthew G Knepley 2113e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 2114e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 2115e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 2116e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 2117e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 2118e6ccafaeSMatthew G Knepley PetscInt v; 2119e6ccafaeSMatthew G Knepley 2120e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2121e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 2122e6ccafaeSMatthew G Knepley } 2123e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 2124e6ccafaeSMatthew G Knepley } 2125e6ccafaeSMatthew G Knepley if (d == dof) { 2126e6ccafaeSMatthew G Knepley numFaces = 1; 2127e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 2128e6ccafaeSMatthew G Knepley } 2129e6ccafaeSMatthew G Knepley } 2130e6ccafaeSMatthew G Knepley } 2131e6ccafaeSMatthew G Knepley #endif 2132e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 2133e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 2134e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 2135766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 2136e6ccafaeSMatthew G Knepley } else { 2137e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 2138e6ccafaeSMatthew G Knepley PetscBool posOriented; 2139e6ccafaeSMatthew G Knepley 2140e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2141e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 2142e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 2143e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 2144e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 2145e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 2146e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2147e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 2148e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 2149e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 2150e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 2151e6ccafaeSMatthew G Knepley break; 2152e6ccafaeSMatthew G Knepley } 2153e6ccafaeSMatthew G Knepley } 2154e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 2155e6ccafaeSMatthew G Knepley } 2156e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 2157e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 2158e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2159e6ccafaeSMatthew G Knepley ++(*newFacePoint); 2160e6ccafaeSMatthew G Knepley } 2161ef07cca7SMatthew G. Knepley #if 0 2162e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2163ef07cca7SMatthew G. Knepley #else 2164ef07cca7SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2165ef07cca7SMatthew G. Knepley #endif 2166e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2167e6ccafaeSMatthew G Knepley } 2168e6ccafaeSMatthew G Knepley 2169e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2170e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated" 217153156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2172e6ccafaeSMatthew G Knepley { 217382f516ccSBarry Smith MPI_Comm comm; 217453156dfcSMatthew G. Knepley DMLabel subpointMap; 2175efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 2176efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 2177efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 2178fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 2179efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 2180e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2181e6ccafaeSMatthew G Knepley 2182e6ccafaeSMatthew G Knepley PetscFunctionBegin; 218382f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2184efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2185efa14ee0SMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2186efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2187efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 218853156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);} 2189efa14ee0SMatthew G Knepley /* Setup chart */ 2190efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2191efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2192efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2193efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2194e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2195e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 2196efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 2197e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 2198efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2199efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2200efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 2201efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2202e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2203e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2204e6ccafaeSMatthew G Knepley } 2205e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2206e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2207e6ccafaeSMatthew G Knepley } 2208e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2209e6ccafaeSMatthew G Knepley /* Create face cones */ 2210efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 22110298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2212efa14ee0SMatthew G Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2213e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2214e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 2215efa14ee0SMatthew G Knepley const PetscInt subcell = c; 22160298fd71SBarry Smith PetscInt *closure = NULL; 2217efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 2218e6ccafaeSMatthew G Knepley 2219e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2220efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2221efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 2222e6ccafaeSMatthew G Knepley PetscInt subVertex; 2223e6ccafaeSMatthew G Knepley 2224efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 2225efa14ee0SMatthew G Knepley ++numCorners; 2226efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 2227efa14ee0SMatthew G Knepley if (subVertex >= 0) { 2228efa14ee0SMatthew G Knepley closure[faceSize] = point; 222965560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 2230e6ccafaeSMatthew G Knepley ++faceSize; 2231e6ccafaeSMatthew G Knepley } 2232e6ccafaeSMatthew G Knepley } 2233e6ccafaeSMatthew G Knepley } 2234efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 2235efa14ee0SMatthew G Knepley if (faceSize == nFV) { 2236cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 2237e6ccafaeSMatthew G Knepley } 223865560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2239e6ccafaeSMatthew G Knepley } 2240efa14ee0SMatthew G Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2241e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2242e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2243e6ccafaeSMatthew G Knepley /* Build coordinates */ 2244efa14ee0SMatthew G Knepley { 2245efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 2246efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 2247efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 2248285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2249efa14ee0SMatthew G Knepley 2250e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2251e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2252e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2253285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2254285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2255285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2256efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2257efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2258efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2259efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2260efa14ee0SMatthew G Knepley PetscInt dof; 2261efa14ee0SMatthew G Knepley 2262efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2263efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2264285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2265e6ccafaeSMatthew G Knepley } 2266e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2267e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2268e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2269e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 22702eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2271830e53efSMatthew G. Knepley if (coordSize) { 2272e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2273e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2274efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2275efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2276efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2277efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2278e6ccafaeSMatthew G Knepley 2279e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2280e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2281efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2282efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2283efa14ee0SMatthew 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); 2284e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2285e6ccafaeSMatthew G Knepley } 2286e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2287e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 22883b399e24SMatthew G. Knepley } 2289e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2290e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2291e6ccafaeSMatthew G Knepley } 2292efa14ee0SMatthew G Knepley /* Cleanup */ 2293efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2294efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2295efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2296efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2297e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2298e6ccafaeSMatthew G Knepley } 2299e6ccafaeSMatthew G Knepley 2300e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2301e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated" 230253156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2303e6ccafaeSMatthew G Knepley { 230482f516ccSBarry Smith MPI_Comm comm; 230553156dfcSMatthew G. Knepley DMLabel subpointMap; 2306efa14ee0SMatthew G Knepley IS *subpointIS; 2307efa14ee0SMatthew G Knepley const PetscInt **subpoints; 230801a2673eSMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *coneONew; 2309efa14ee0SMatthew G Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2310e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2311e6ccafaeSMatthew G Knepley 2312e6ccafaeSMatthew G Knepley PetscFunctionBegin; 231382f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2314efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2315e6ccafaeSMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2316efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2317efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 231853156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Interpolated(dm, vertexLabel, value, subpointMap, subdm);CHKERRQ(ierr);} 2319efa14ee0SMatthew G Knepley /* Setup chart */ 2320efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2321efa14ee0SMatthew G Knepley ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr); 2322e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2323e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2324e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 2325e6ccafaeSMatthew G Knepley } 2326e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2327e6ccafaeSMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2328e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2329e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 2330e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2331e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2332e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2333e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2334e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2335e6ccafaeSMatthew G Knepley ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2336e6ccafaeSMatthew G Knepley } 2337e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2338e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2339e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2340e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2341e6ccafaeSMatthew G Knepley const PetscInt *cone; 2342e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 2343e6ccafaeSMatthew G Knepley 2344e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2345e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2346e6ccafaeSMatthew G Knepley if (d == dim) { 2347e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2348e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2349e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2350e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 2351e6ccafaeSMatthew G Knepley } 2352e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2353e6ccafaeSMatthew G Knepley } 2354e6ccafaeSMatthew G Knepley } 2355e6ccafaeSMatthew G Knepley } 2356e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2357e6ccafaeSMatthew G Knepley /* Set cones */ 23580298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 235901a2673eSMatthew G. Knepley ierr = PetscMalloc2(maxConeSize,PetscInt,&coneNew,maxConeSize,PetscInt,&coneONew);CHKERRQ(ierr); 2360e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2361e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2362e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2363e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 23640e49e2e2SMatthew G. Knepley const PetscInt *cone, *ornt; 2365e6ccafaeSMatthew G Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2366e6ccafaeSMatthew G Knepley 2367e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2368e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2369e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 23700e49e2e2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2371e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2372e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 237301a2673eSMatthew G. Knepley if (subc >= 0) { 237401a2673eSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 237501a2673eSMatthew G. Knepley coneONew[coneSizeNew] = ornt[c]; 237601a2673eSMatthew G. Knepley ++coneSizeNew; 237701a2673eSMatthew G. Knepley } 2378e6ccafaeSMatthew G Knepley } 2379e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2380e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 238101a2673eSMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, coneONew);CHKERRQ(ierr); 2382e6ccafaeSMatthew G Knepley } 2383e6ccafaeSMatthew G Knepley } 238401a2673eSMatthew G. Knepley ierr = PetscFree2(coneNew,coneONew);CHKERRQ(ierr); 2385e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2386e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2387e6ccafaeSMatthew G Knepley /* Build coordinates */ 2388e6ccafaeSMatthew G Knepley { 2389e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 2390e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 2391e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 2392285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2393e6ccafaeSMatthew G Knepley 2394e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2395e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2396e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2397285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2398285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2399285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2400e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2401e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2402e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2403e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2404e6ccafaeSMatthew G Knepley PetscInt dof; 2405e6ccafaeSMatthew G Knepley 2406e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2407e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2408285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2409e6ccafaeSMatthew G Knepley } 2410e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2411e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2412e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2413e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 24142eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2415e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2416e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2417e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2418e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2419e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2420e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2421e6ccafaeSMatthew G Knepley 2422e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2423e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2424e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2425e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2426e6ccafaeSMatthew 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); 2427efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2428e6ccafaeSMatthew G Knepley } 2429e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2430e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2431e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2432e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2433e6ccafaeSMatthew G Knepley } 2434efa14ee0SMatthew G Knepley /* Cleanup */ 2435e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2436e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2437e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2438e6ccafaeSMatthew G Knepley } 2439efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2440e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2441e6ccafaeSMatthew G Knepley } 2442e6ccafaeSMatthew G Knepley 2443e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2444e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh" 2445d0fa310fSMatthew G. Knepley /*@ 2446e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 2447e6ccafaeSMatthew G Knepley 2448e6ccafaeSMatthew G Knepley Input Parameters: 2449e6ccafaeSMatthew G Knepley + dm - The original mesh 2450830e53efSMatthew G. Knepley . vertexLabel - The DMLabel marking vertices contained in the surface 2451830e53efSMatthew G. Knepley - value - The label value to use 2452e6ccafaeSMatthew G Knepley 2453e6ccafaeSMatthew G Knepley Output Parameter: 2454e6ccafaeSMatthew G Knepley . subdm - The surface mesh 2455e6ccafaeSMatthew G Knepley 2456e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2457e6ccafaeSMatthew G Knepley 2458e6ccafaeSMatthew G Knepley Level: developer 2459e6ccafaeSMatthew G Knepley 2460e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue() 2461830e53efSMatthew G. Knepley @*/ 246253156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm) 2463e6ccafaeSMatthew G Knepley { 2464e6ccafaeSMatthew G Knepley PetscInt dim, depth; 2465e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2466e6ccafaeSMatthew G Knepley 2467e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2468e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2469766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 2470e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2471e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 247282f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2473e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2474e6ccafaeSMatthew G Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2475e6ccafaeSMatthew G Knepley if (depth == dim) { 2476830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2477e6ccafaeSMatthew G Knepley } else { 2478830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2479e6ccafaeSMatthew G Knepley } 2480e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2481e6ccafaeSMatthew G Knepley } 2482e6ccafaeSMatthew G Knepley 2483e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2484aca35d17SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal" 2485aca35d17SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 2486aca35d17SMatthew G. Knepley { 2487aca35d17SMatthew G. Knepley PetscInt subPoint; 2488aca35d17SMatthew G. Knepley PetscErrorCode ierr; 2489aca35d17SMatthew G. Knepley 2490aca35d17SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 2491aca35d17SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 2492aca35d17SMatthew G. Knepley } 2493aca35d17SMatthew G. Knepley 2494aca35d17SMatthew G. Knepley #undef __FUNCT__ 2495766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated" 249627c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 2497766ab985SMatthew G. Knepley { 2498766ab985SMatthew G. Knepley MPI_Comm comm; 2499766ab985SMatthew G. Knepley DMLabel subpointMap; 2500766ab985SMatthew G. Knepley IS subvertexIS; 2501766ab985SMatthew G. Knepley const PetscInt *subVertices; 2502fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 2503766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 250487feddfdSMatthew G. Knepley PetscInt cMax, c, f; 2505766ab985SMatthew G. Knepley PetscErrorCode ierr; 2506766ab985SMatthew G. Knepley 2507766ab985SMatthew G. Knepley PetscFunctionBegin; 2508766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 2509766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2510766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2511766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2512766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 251327c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 2514766ab985SMatthew G. Knepley /* Setup chart */ 2515766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2516766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2517766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2518766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2519766ab985SMatthew G. Knepley /* Set cone sizes */ 2520766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 2521766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 2522766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 2523766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2524766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2525766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2526766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2527766ab985SMatthew G. Knepley } 2528766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2529766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2530766ab985SMatthew G. Knepley } 2531766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2532766ab985SMatthew G. Knepley /* Create face cones */ 2533766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 253487feddfdSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2535766ab985SMatthew G. Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2536766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2537766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 2538766ab985SMatthew G. Knepley const PetscInt subcell = c; 253987feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 254087feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 2541766ab985SMatthew G. Knepley 254287feddfdSMatthew G. Knepley if (cell < cMax) continue; 254387feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 254487feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 254587feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 254687feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 254787feddfdSMatthew G. Knepley } 254887feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 254987feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 255087feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 255127234c99SMatthew G. Knepley /* Not true in parallel 255227234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 255387feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 255487feddfdSMatthew G. Knepley PetscInt negsubcell; 2555766ab985SMatthew G. Knepley 255687feddfdSMatthew G. Knepley if (cells[p] >= cMax) continue; 255787feddfdSMatthew G. Knepley /* I know this is a crap search */ 255887feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 255987feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 2560766ab985SMatthew G. Knepley } 256187feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 256287feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 2563766ab985SMatthew G. Knepley } 256487feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 256587feddfdSMatthew G. Knepley ++newFacePoint; 2566766ab985SMatthew G. Knepley } 2567766ab985SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2568766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2569766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2570766ab985SMatthew G. Knepley /* Build coordinates */ 2571766ab985SMatthew G. Knepley { 2572766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2573766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2574766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2575285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2576766ab985SMatthew G. Knepley 2577766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2578766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2579766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2580285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2581285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2582285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2583766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2584766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2585766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2586766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2587766ab985SMatthew G. Knepley PetscInt dof; 2588766ab985SMatthew G. Knepley 2589766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2590766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2591285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2592766ab985SMatthew G. Knepley } 2593766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2594766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2595766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2596766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 25972eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2598766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2599766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2600766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2601766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2602766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2603766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 2604766ab985SMatthew G. Knepley 2605766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2606766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2607766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2608766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2609766ab985SMatthew 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); 2610766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2611766ab985SMatthew G. Knepley } 2612766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2613766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2614766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2615766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2616766ab985SMatthew G. Knepley } 2617aca35d17SMatthew G. Knepley /* Build SF */ 2618aca35d17SMatthew G. Knepley CHKMEMQ; 2619aca35d17SMatthew G. Knepley { 2620aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 2621aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 2622bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 2623aca35d17SMatthew G. Knepley const PetscInt *localPoints; 2624bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 262549c26ae4SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 2626bdcf2095SMatthew G. Knepley PetscMPIInt rank; 2627aca35d17SMatthew G. Knepley 2628bdcf2095SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 2629aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 2630aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 2631aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2632aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 2633aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 2634aca35d17SMatthew G. Knepley if (numRoots >= 0) { 2635aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 2636bdcf2095SMatthew G. Knepley ierr = PetscMalloc2(pEnd-pStart,PetscSFNode,&newLocalPoints,numRoots,PetscSFNode,&newOwners);CHKERRQ(ierr); 2637bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 2638bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 2639bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 2640bdcf2095SMatthew G. Knepley } 26419e0823b2SMatthew G. Knepley /* Set subleaves */ 2642aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2643aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 2644bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2645aca35d17SMatthew G. Knepley 2646aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 2647bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 2648bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 2649bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 2650bdcf2095SMatthew G. Knepley ++numSubLeaves; 2651aca35d17SMatthew G. Knepley } 26529e0823b2SMatthew G. Knepley /* Must put in owned subpoints */ 26539e0823b2SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 26549e0823b2SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 26559e0823b2SMatthew G. Knepley 26569e0823b2SMatthew G. Knepley if (subPoint < 0) { 26579e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = -3; 26589e0823b2SMatthew G. Knepley newOwners[p-pStart].index = -3; 26599e0823b2SMatthew G. Knepley } else { 26609e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = rank; 26619e0823b2SMatthew G. Knepley newOwners[p-pStart].index = subPoint; 26629e0823b2SMatthew G. Knepley } 2663bdcf2095SMatthew G. Knepley } 2664bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2665bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2666bdcf2095SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2667bdcf2095SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2668aca35d17SMatthew G. Knepley ierr = PetscMalloc(numSubLeaves * sizeof(PetscInt), &slocalPoints);CHKERRQ(ierr); 2669aca35d17SMatthew G. Knepley ierr = PetscMalloc(numSubLeaves * sizeof(PetscSFNode), &sremotePoints);CHKERRQ(ierr); 267049c26ae4SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 2671bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 2672bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2673aca35d17SMatthew G. Knepley 2674aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 267549c26ae4SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 2676aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 2677bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 2678bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 2679bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 2680bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 2681aca35d17SMatthew G. Knepley ++sl; 2682aca35d17SMatthew G. Knepley } 2683bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 268449c26ae4SMatthew G. Knepley if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 268549c26ae4SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 2686aca35d17SMatthew G. Knepley } 2687aca35d17SMatthew G. Knepley } 2688aca35d17SMatthew G. Knepley CHKMEMQ; 2689766ab985SMatthew G. Knepley /* Cleanup */ 2690766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2691766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2692766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 2693766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2694766ab985SMatthew G. Knepley } 2695766ab985SMatthew G. Knepley 2696766ab985SMatthew G. Knepley #undef __FUNCT__ 2697766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated" 269827c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 2699766ab985SMatthew G. Knepley { 2700766ab985SMatthew G. Knepley MPI_Comm comm; 2701766ab985SMatthew G. Knepley DMLabel subpointMap; 2702766ab985SMatthew G. Knepley IS *subpointIS; 2703766ab985SMatthew G. Knepley const PetscInt **subpoints; 2704766ab985SMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew; 2705766ab985SMatthew G. Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2706766ab985SMatthew G. Knepley PetscErrorCode ierr; 2707766ab985SMatthew G. Knepley 2708766ab985SMatthew G. Knepley PetscFunctionBegin; 2709766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2710766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2711766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2712766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2713766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 271427c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, hasLagrange, label, value, subpointMap, subdm);CHKERRQ(ierr); 2715766ab985SMatthew G. Knepley /* Setup chart */ 2716766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2717766ab985SMatthew G. Knepley ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr); 2718766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2719766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2720766ab985SMatthew G. Knepley totSubPoints += numSubPoints[d]; 2721766ab985SMatthew G. Knepley } 2722766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2723766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2724766ab985SMatthew G. Knepley /* Set cone sizes */ 2725766ab985SMatthew G. Knepley firstSubPoint[dim] = 0; 2726766ab985SMatthew G. Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2727766ab985SMatthew G. Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2728766ab985SMatthew G. Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2729766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2730766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2731766ab985SMatthew G. Knepley ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2732766ab985SMatthew G. Knepley } 2733766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2734766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2735766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2736766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2737766ab985SMatthew G. Knepley const PetscInt *cone; 2738766ab985SMatthew G. Knepley PetscInt coneSize, coneSizeNew, c, val; 2739766ab985SMatthew G. Knepley 2740766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2741766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2742766ab985SMatthew G. Knepley if (d == dim) { 2743766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2744766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2745766ab985SMatthew G. Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2746766ab985SMatthew G. Knepley if (val >= 0) coneSizeNew++; 2747766ab985SMatthew G. Knepley } 2748766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2749766ab985SMatthew G. Knepley } 2750766ab985SMatthew G. Knepley } 2751766ab985SMatthew G. Knepley } 2752766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2753766ab985SMatthew G. Knepley /* Set cones */ 2754766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2755766ab985SMatthew G. Knepley ierr = PetscMalloc(maxConeSize * sizeof(PetscInt), &coneNew);CHKERRQ(ierr); 2756766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2757766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2758766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2759766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2760766ab985SMatthew G. Knepley const PetscInt *cone; 2761766ab985SMatthew G. Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2762766ab985SMatthew G. Knepley 2763766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2764766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2765766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2766766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2767766ab985SMatthew G. Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 2768766ab985SMatthew G. Knepley if (subc >= 0) coneNew[coneSizeNew++] = firstSubPoint[d-1] + subc; 2769766ab985SMatthew G. Knepley } 2770766ab985SMatthew G. Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2771766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 2772766ab985SMatthew G. Knepley } 2773766ab985SMatthew G. Knepley } 2774766ab985SMatthew G. Knepley ierr = PetscFree(coneNew);CHKERRQ(ierr); 2775766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2776766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2777766ab985SMatthew G. Knepley /* Build coordinates */ 2778766ab985SMatthew G. Knepley { 2779766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2780766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2781766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2782285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2783766ab985SMatthew G. Knepley 2784766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2785766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2786766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2787285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2788285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2789285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2790766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2791766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2792766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 2793766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2794766ab985SMatthew G. Knepley PetscInt dof; 2795766ab985SMatthew G. Knepley 2796766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2797766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2798285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2799766ab985SMatthew G. Knepley } 2800766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2801766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2802766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2803766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 28042eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2805766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2806766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2807766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2808766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 2809766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2810766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 2811766ab985SMatthew G. Knepley 2812766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2813766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2814766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2815766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2816766ab985SMatthew 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); 2817766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2818766ab985SMatthew G. Knepley } 2819766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2820766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2821766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2822766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2823766ab985SMatthew G. Knepley } 2824766ab985SMatthew G. Knepley /* Cleanup */ 2825766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2826766ab985SMatthew G. Knepley ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2827766ab985SMatthew G. Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2828766ab985SMatthew G. Knepley } 2829766ab985SMatthew G. Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2830766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2831766ab985SMatthew G. Knepley } 2832766ab985SMatthew G. Knepley 2833766ab985SMatthew G. Knepley #undef __FUNCT__ 2834766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh" 2835766ab985SMatthew G. Knepley /* 283627c04023SMatthew 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. 2837766ab985SMatthew G. Knepley 2838766ab985SMatthew G. Knepley Input Parameters: 2839766ab985SMatthew G. Knepley + dm - The original mesh 284027c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 284127c04023SMatthew G. Knepley . label - A label name, or PETSC_NULL 284227c04023SMatthew G. Knepley - value - A label value 2843766ab985SMatthew G. Knepley 2844766ab985SMatthew G. Knepley Output Parameter: 2845766ab985SMatthew G. Knepley . subdm - The surface mesh 2846766ab985SMatthew G. Knepley 2847766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2848766ab985SMatthew G. Knepley 2849766ab985SMatthew G. Knepley Level: developer 2850766ab985SMatthew G. Knepley 2851766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 2852766ab985SMatthew G. Knepley */ 285327c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 2854766ab985SMatthew G. Knepley { 2855766ab985SMatthew G. Knepley PetscInt dim, depth; 2856766ab985SMatthew G. Knepley PetscErrorCode ierr; 2857766ab985SMatthew G. Knepley 2858766ab985SMatthew G. Knepley PetscFunctionBegin; 2859766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 286027c04023SMatthew G. Knepley PetscValidPointer(subdm, 5); 2861766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2862766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2863766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2864766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2865766ab985SMatthew G. Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2866766ab985SMatthew G. Knepley if (depth == dim) { 286727c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 2868766ab985SMatthew G. Knepley } else { 286927c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 2870e6ccafaeSMatthew G Knepley } 2871e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2872e6ccafaeSMatthew G Knepley } 2873e6ccafaeSMatthew G Knepley 2874e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2875e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap" 287664beef6dSMatthew G. Knepley /*@ 287764beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 287864beef6dSMatthew G. Knepley 287964beef6dSMatthew G. Knepley Input Parameter: 288064beef6dSMatthew G. Knepley . dm - The submesh DM 288164beef6dSMatthew G. Knepley 288264beef6dSMatthew G. Knepley Output Parameter: 288364beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 288464beef6dSMatthew G. Knepley 288564beef6dSMatthew G. Knepley Level: developer 288664beef6dSMatthew G. Knepley 288764beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 288864beef6dSMatthew G. Knepley @*/ 2889e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 2890e6ccafaeSMatthew G Knepley { 2891e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 2892e6ccafaeSMatthew G Knepley 2893e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2894e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2895e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 2896e6ccafaeSMatthew G Knepley *subpointMap = mesh->subpointMap; 2897e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2898e6ccafaeSMatthew G Knepley } 2899e6ccafaeSMatthew G Knepley 2900e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2901e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap" 2902e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */ 2903e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 2904e6ccafaeSMatthew G Knepley { 2905e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 2906285d324eSMatthew G. Knepley DMLabel tmp; 2907e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2908e6ccafaeSMatthew G Knepley 2909e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2910e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2911285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 2912e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 2913285d324eSMatthew G. Knepley ++mesh->subpointMap->refct; 2914285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 2915e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2916e6ccafaeSMatthew G Knepley } 2917e6ccafaeSMatthew G Knepley 2918e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2919e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS" 292064beef6dSMatthew G. Knepley /*@ 2921e6ccafaeSMatthew G Knepley DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 2922e6ccafaeSMatthew G Knepley 2923e6ccafaeSMatthew G Knepley Input Parameter: 2924e6ccafaeSMatthew G Knepley . dm - The submesh DM 2925e6ccafaeSMatthew G Knepley 2926e6ccafaeSMatthew G Knepley Output Parameter: 29270298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 2928e6ccafaeSMatthew G Knepley 2929e6ccafaeSMatthew G Knepley Note: This is IS is guaranteed to be sorted by the construction of the submesh 293064beef6dSMatthew G. Knepley 293164beef6dSMatthew G. Knepley Level: developer 293264beef6dSMatthew G. Knepley 293364beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 293464beef6dSMatthew G. Knepley @*/ 2935e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 2936e6ccafaeSMatthew G Knepley { 293782f516ccSBarry Smith MPI_Comm comm; 2938e6ccafaeSMatthew G Knepley DMLabel subpointMap; 2939e6ccafaeSMatthew G Knepley IS is; 2940e6ccafaeSMatthew G Knepley const PetscInt *opoints; 2941e6ccafaeSMatthew G Knepley PetscInt *points, *depths; 2942e6ccafaeSMatthew G Knepley PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 2943e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2944e6ccafaeSMatthew G Knepley 2945e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2946e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2947e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 294882f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 29490298fd71SBarry Smith *subpointIS = NULL; 2950e6ccafaeSMatthew G Knepley ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 2951e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2952fed694aaSMatthew G. Knepley if (subpointMap && depth >= 0) { 2953e6ccafaeSMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2954e6ccafaeSMatthew G Knepley if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 2955e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 2956e6ccafaeSMatthew G Knepley depths[0] = depth; 2957e6ccafaeSMatthew G Knepley depths[1] = 0; 2958e6ccafaeSMatthew G Knepley for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 2959e6ccafaeSMatthew G Knepley ierr = PetscMalloc(pEnd * sizeof(PetscInt), &points);CHKERRQ(ierr); 2960e6ccafaeSMatthew G Knepley for(d = 0, off = 0; d <= depth; ++d) { 2961e6ccafaeSMatthew G Knepley const PetscInt dep = depths[d]; 2962e6ccafaeSMatthew G Knepley 2963e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 2964e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 29651e21b6fdSMatthew G Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 2966e6ccafaeSMatthew 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); 2967e6ccafaeSMatthew G Knepley } else { 29681e21b6fdSMatthew G Knepley if (!n) { 29691e21b6fdSMatthew G Knepley if (d == 0) { 29701e21b6fdSMatthew G Knepley /* Missing cells */ 29711e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 29721e21b6fdSMatthew G Knepley } else { 29731e21b6fdSMatthew G Knepley /* Missing faces */ 29741e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 29751e21b6fdSMatthew G Knepley } 29761e21b6fdSMatthew G Knepley } 2977e6ccafaeSMatthew G Knepley } 2978e6ccafaeSMatthew G Knepley if (n) { 2979e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 2980e6ccafaeSMatthew G Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 2981e6ccafaeSMatthew G Knepley for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 2982e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 2983e6ccafaeSMatthew G Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 2984e6ccafaeSMatthew G Knepley } 2985e6ccafaeSMatthew G Knepley } 2986e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 2987e6ccafaeSMatthew G Knepley if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 2988fed694aaSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 2989e6ccafaeSMatthew G Knepley } 2990e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2991e6ccafaeSMatthew G Knepley } 2992