134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 20c312b8eSJed Brown #include <petscsf.h> 3e6ccafaeSMatthew G Knepley 4e6ccafaeSMatthew G Knepley #undef __FUNCT__ 5cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces" 6cd0c2139SMatthew G Knepley /*@ 7cd0c2139SMatthew G Knepley DMPlexMarkBoundaryFaces - Mark all faces on the boundary 8cd0c2139SMatthew G Knepley 9cd0c2139SMatthew G Knepley Not Collective 10cd0c2139SMatthew G Knepley 11cd0c2139SMatthew G Knepley Input Parameter: 12cd0c2139SMatthew G Knepley . dm - The original DM 13cd0c2139SMatthew G Knepley 14cd0c2139SMatthew G Knepley Output Parameter: 15cd0c2139SMatthew G Knepley . label - The DMLabel marking boundary faces with value 1 16cd0c2139SMatthew G Knepley 17cd0c2139SMatthew G Knepley Level: developer 18cd0c2139SMatthew G Knepley 19cd0c2139SMatthew G Knepley .seealso: DMLabelCreate(), DMPlexCreateLabel() 2009f723d9SJed Brown @*/ 21cd0c2139SMatthew G Knepley PetscErrorCode DMPlexMarkBoundaryFaces(DM dm, DMLabel label) 22cd0c2139SMatthew G Knepley { 23cd0c2139SMatthew G Knepley PetscInt fStart, fEnd, f; 24cd0c2139SMatthew G Knepley PetscErrorCode ierr; 25cd0c2139SMatthew G Knepley 26cd0c2139SMatthew G Knepley PetscFunctionBegin; 27cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 28cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 29cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 30cd0c2139SMatthew G Knepley PetscInt supportSize; 31cd0c2139SMatthew G Knepley 32cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 33cd0c2139SMatthew G Knepley if (supportSize == 1) { 34cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, f, 1);CHKERRQ(ierr); 35cd0c2139SMatthew G Knepley } 36cd0c2139SMatthew G Knepley } 37cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 38cd0c2139SMatthew G Knepley } 39cd0c2139SMatthew G Knepley 40cd0c2139SMatthew G Knepley #undef __FUNCT__ 412be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelComplete" 422be2b188SMatthew G Knepley /*@ 432be2b188SMatthew G Knepley DMPlexLabelComplete - Starting with a label marking points on a surface, we add the transitive closure to the surface 442be2b188SMatthew G Knepley 452be2b188SMatthew G Knepley Input Parameters: 462be2b188SMatthew G Knepley + dm - The DM 472be2b188SMatthew G Knepley - label - A DMLabel marking the surface points 482be2b188SMatthew G Knepley 492be2b188SMatthew G Knepley Output Parameter: 502be2b188SMatthew G Knepley . label - A DMLabel marking all surface points in the transitive closure 512be2b188SMatthew G Knepley 522be2b188SMatthew G Knepley Level: developer 532be2b188SMatthew G Knepley 542be2b188SMatthew G Knepley .seealso: DMPlexLabelCohesiveComplete() 552be2b188SMatthew G Knepley @*/ 562be2b188SMatthew G Knepley PetscErrorCode DMPlexLabelComplete(DM dm, DMLabel label) 572be2b188SMatthew G Knepley { 582be2b188SMatthew G Knepley IS valueIS; 592be2b188SMatthew G Knepley const PetscInt *values; 602be2b188SMatthew G Knepley PetscInt numValues, v; 612be2b188SMatthew G Knepley PetscErrorCode ierr; 622be2b188SMatthew G Knepley 632be2b188SMatthew G Knepley PetscFunctionBegin; 642be2b188SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 652be2b188SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 662be2b188SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 672be2b188SMatthew G Knepley for (v = 0; v < numValues; ++v) { 682be2b188SMatthew G Knepley IS pointIS; 692be2b188SMatthew G Knepley const PetscInt *points; 702be2b188SMatthew G Knepley PetscInt numPoints, p; 712be2b188SMatthew G Knepley 722be2b188SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 732be2b188SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 742be2b188SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 752be2b188SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 762be2b188SMatthew G Knepley PetscInt *closure = NULL; 772be2b188SMatthew G Knepley PetscInt closureSize, c; 782be2b188SMatthew G Knepley 792be2b188SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 802be2b188SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 812be2b188SMatthew G Knepley ierr = DMLabelSetValue(label, closure[c], values[v]);CHKERRQ(ierr); 822be2b188SMatthew G Knepley } 832be2b188SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 842be2b188SMatthew G Knepley } 852be2b188SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 862be2b188SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 872be2b188SMatthew G Knepley } 882be2b188SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 892be2b188SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 902be2b188SMatthew G Knepley PetscFunctionReturn(0); 912be2b188SMatthew G Knepley } 922be2b188SMatthew G Knepley 932be2b188SMatthew G Knepley #undef __FUNCT__ 94cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoint_Internal" 95cd0c2139SMatthew G Knepley PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthEnd[], PetscInt depthShift[]) 96cd0c2139SMatthew G Knepley { 97cd0c2139SMatthew G Knepley if (depth < 0) return p; 98cd0c2139SMatthew G Knepley /* Cells */ if (p < depthEnd[depth]) return p; 99cd0c2139SMatthew G Knepley /* Vertices */ if (p < depthEnd[0]) return p + depthShift[depth]; 100cd0c2139SMatthew G Knepley /* Faces */ if (p < depthEnd[depth-1]) return p + depthShift[depth] + depthShift[0]; 101cd0c2139SMatthew G Knepley /* Edges */ return p + depthShift[depth] + depthShift[0] + depthShift[depth-1]; 102cd0c2139SMatthew G Knepley } 103cd0c2139SMatthew G Knepley 104cd0c2139SMatthew G Knepley #undef __FUNCT__ 105cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSizes_Internal" 106cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew) 107cd0c2139SMatthew G Knepley { 108cd0c2139SMatthew G Knepley PetscInt *depthEnd; 109cd0c2139SMatthew G Knepley PetscInt depth = 0, d, pStart, pEnd, p; 110cd0c2139SMatthew G Knepley PetscErrorCode ierr; 111cd0c2139SMatthew G Knepley 112cd0c2139SMatthew G Knepley PetscFunctionBegin; 113cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 114cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 115cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 116cd0c2139SMatthew G Knepley /* Step 1: Expand chart */ 117cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 118cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 119cd0c2139SMatthew G Knepley pEnd += depthShift[d]; 120cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 121cd0c2139SMatthew G Knepley } 122cd0c2139SMatthew G Knepley ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr); 123cd0c2139SMatthew G Knepley /* Step 2: Set cone and support sizes */ 124cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 125cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 126cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 127cd0c2139SMatthew G Knepley PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthEnd, depthShift); 128cd0c2139SMatthew G Knepley PetscInt size; 129cd0c2139SMatthew G Knepley 130cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 131cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr); 132cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 133cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr); 134cd0c2139SMatthew G Knepley } 135cd0c2139SMatthew G Knepley } 136cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 137cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 138cd0c2139SMatthew G Knepley } 139cd0c2139SMatthew G Knepley 140cd0c2139SMatthew G Knepley #undef __FUNCT__ 141cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoints_Internal" 142cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew) 143cd0c2139SMatthew G Knepley { 144cd0c2139SMatthew G Knepley PetscInt *depthEnd, *newpoints; 145cd0c2139SMatthew G Knepley PetscInt depth = 0, d, maxConeSize, maxSupportSize, pStart, pEnd, p; 146cd0c2139SMatthew G Knepley PetscErrorCode ierr; 147cd0c2139SMatthew G Knepley 148cd0c2139SMatthew G Knepley PetscFunctionBegin; 149cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 150cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 151cd0c2139SMatthew G Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 152cd0c2139SMatthew G Knepley ierr = PetscMalloc2(depth+1,PetscInt,&depthEnd,PetscMax(maxConeSize, maxSupportSize),PetscInt,&newpoints);CHKERRQ(ierr); 153cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 154cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 155cd0c2139SMatthew G Knepley } 156cd0c2139SMatthew G Knepley /* Step 5: Set cones and supports */ 157cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 158cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 159cd0c2139SMatthew G Knepley const PetscInt *points = NULL, *orientations = NULL; 160cd0c2139SMatthew G Knepley PetscInt size, i, newp = DMPlexShiftPoint_Internal(p, depth, depthEnd, depthShift); 161cd0c2139SMatthew G Knepley 162cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 163cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr); 164cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr); 165cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 166cd0c2139SMatthew G Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthEnd, depthShift); 167cd0c2139SMatthew G Knepley } 168cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr); 169cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr); 170cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 171cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr); 172cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 173cd0c2139SMatthew G Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthEnd, depthShift); 174cd0c2139SMatthew G Knepley } 175cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr); 176cd0c2139SMatthew G Knepley } 177cd0c2139SMatthew G Knepley ierr = PetscFree2(depthEnd,newpoints);CHKERRQ(ierr); 178cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 179cd0c2139SMatthew G Knepley } 180cd0c2139SMatthew G Knepley 181cd0c2139SMatthew G Knepley #undef __FUNCT__ 182cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftCoordinates_Internal" 183cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew) 184cd0c2139SMatthew G Knepley { 185cd0c2139SMatthew G Knepley PetscSection coordSection, newCoordSection; 186cd0c2139SMatthew G Knepley Vec coordinates, newCoordinates; 187cd0c2139SMatthew G Knepley PetscScalar *coords, *newCoords; 188cd0c2139SMatthew G Knepley PetscInt *depthEnd, coordSize; 189cd0c2139SMatthew G Knepley PetscInt dim, depth = 0, d, vStart, vEnd, vStartNew, vEndNew, v; 190cd0c2139SMatthew G Knepley PetscErrorCode ierr; 191cd0c2139SMatthew G Knepley 192cd0c2139SMatthew G Knepley PetscFunctionBegin; 193cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 194cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 195cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 196cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 197cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 198cd0c2139SMatthew G Knepley } 199cd0c2139SMatthew G Knepley /* Step 8: Convert coordinates */ 200cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 201cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr); 202cd0c2139SMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 203cd0c2139SMatthew G Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr); 204cd0c2139SMatthew G Knepley ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr); 205cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr); 206cd0c2139SMatthew G Knepley ierr = PetscSectionSetChart(newCoordSection, vStartNew, vEndNew);CHKERRQ(ierr); 207cd0c2139SMatthew G Knepley for (v = vStartNew; v < vEndNew; ++v) { 208cd0c2139SMatthew G Knepley ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr); 209cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr); 210cd0c2139SMatthew G Knepley } 211cd0c2139SMatthew G Knepley ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr); 212cd0c2139SMatthew G Knepley ierr = DMPlexSetCoordinateSection(dmNew, newCoordSection);CHKERRQ(ierr); 213cd0c2139SMatthew G Knepley ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr); 214cd0c2139SMatthew G Knepley ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr); 215cd0c2139SMatthew G Knepley ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr); 216cd0c2139SMatthew G Knepley ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 217*2eb5907fSJed Brown ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr); 218cd0c2139SMatthew G Knepley ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr); 219cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 220cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 221cd0c2139SMatthew G Knepley ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr); 222cd0c2139SMatthew G Knepley for (v = vStart; v < vEnd; ++v) { 223cd0c2139SMatthew G Knepley PetscInt dof, off, noff, d; 224cd0c2139SMatthew G Knepley 225cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 226cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 227cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthEnd, depthShift), &noff);CHKERRQ(ierr); 228cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) { 229cd0c2139SMatthew G Knepley newCoords[noff+d] = coords[off+d]; 230cd0c2139SMatthew G Knepley } 231cd0c2139SMatthew G Knepley } 232cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 233cd0c2139SMatthew G Knepley ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr); 234cd0c2139SMatthew G Knepley ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 235cd0c2139SMatthew G Knepley ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr); 236cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 237cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 238cd0c2139SMatthew G Knepley } 239cd0c2139SMatthew G Knepley 240cd0c2139SMatthew G Knepley #undef __FUNCT__ 241cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal" 242cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew) 243cd0c2139SMatthew G Knepley { 244cd0c2139SMatthew G Knepley PetscInt *depthEnd; 245cd0c2139SMatthew G Knepley PetscInt depth = 0, d; 246cd0c2139SMatthew G Knepley PetscSF sfPoint, sfPointNew; 247cd0c2139SMatthew G Knepley const PetscSFNode *remotePoints; 248cd0c2139SMatthew G Knepley PetscSFNode *gremotePoints; 249cd0c2139SMatthew G Knepley const PetscInt *localPoints; 250cd0c2139SMatthew G Knepley PetscInt *glocalPoints, *newLocation, *newRemoteLocation; 251cd0c2139SMatthew G Knepley PetscInt numRoots, numLeaves, l, pStart, pEnd, totShift = 0; 252cd0c2139SMatthew G Knepley PetscErrorCode ierr; 253cd0c2139SMatthew G Knepley 254cd0c2139SMatthew G Knepley PetscFunctionBegin; 255cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 256cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 257cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 258cd0c2139SMatthew G Knepley totShift += depthShift[d]; 259cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 260cd0c2139SMatthew G Knepley } 261cd0c2139SMatthew G Knepley /* Step 9: Convert pointSF */ 262cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 263cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr); 264cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 265cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 266cd0c2139SMatthew G Knepley if (numRoots >= 0) { 267cd0c2139SMatthew G Knepley ierr = PetscMalloc2(numRoots,PetscInt,&newLocation,pEnd-pStart,PetscInt,&newRemoteLocation);CHKERRQ(ierr); 268cd0c2139SMatthew G Knepley for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthEnd, depthShift); 269cd0c2139SMatthew G Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 270cd0c2139SMatthew G Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 271cd0c2139SMatthew G Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscInt), &glocalPoints);CHKERRQ(ierr); 272cd0c2139SMatthew G Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscSFNode), &gremotePoints);CHKERRQ(ierr); 273cd0c2139SMatthew G Knepley for (l = 0; l < numLeaves; ++l) { 274cd0c2139SMatthew G Knepley glocalPoints[l] = DMPlexShiftPoint_Internal(localPoints[l], depth, depthEnd, depthShift); 275cd0c2139SMatthew G Knepley gremotePoints[l].rank = remotePoints[l].rank; 276cd0c2139SMatthew G Knepley gremotePoints[l].index = newRemoteLocation[localPoints[l]]; 277cd0c2139SMatthew G Knepley } 278cd0c2139SMatthew G Knepley ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr); 279cd0c2139SMatthew G Knepley ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 280cd0c2139SMatthew G Knepley } 281cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 282cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 283cd0c2139SMatthew G Knepley } 284cd0c2139SMatthew G Knepley 285cd0c2139SMatthew G Knepley #undef __FUNCT__ 286cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal" 287cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew) 288cd0c2139SMatthew G Knepley { 289cd0c2139SMatthew G Knepley PetscSF sfPoint; 290cd0c2139SMatthew G Knepley DMLabel vtkLabel, ghostLabel; 291cd0c2139SMatthew G Knepley PetscInt *depthEnd; 292cd0c2139SMatthew G Knepley const PetscSFNode *leafRemote; 293cd0c2139SMatthew G Knepley const PetscInt *leafLocal; 294cd0c2139SMatthew G Knepley PetscInt depth = 0, d, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f; 295cd0c2139SMatthew G Knepley PetscMPIInt rank; 296cd0c2139SMatthew G Knepley PetscErrorCode ierr; 297cd0c2139SMatthew G Knepley 298cd0c2139SMatthew G Knepley PetscFunctionBegin; 299cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 300cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 301cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 302cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 303cd0c2139SMatthew G Knepley } 304cd0c2139SMatthew G Knepley /* Step 10: Convert labels */ 305cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 306cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 307cd0c2139SMatthew G Knepley DMLabel label, newlabel; 308cd0c2139SMatthew G Knepley const char *lname; 309cd0c2139SMatthew G Knepley PetscBool isDepth; 310cd0c2139SMatthew G Knepley IS valueIS; 311cd0c2139SMatthew G Knepley const PetscInt *values; 312cd0c2139SMatthew G Knepley PetscInt numValues, val; 313cd0c2139SMatthew G Knepley 314cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr); 315cd0c2139SMatthew G Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 316cd0c2139SMatthew G Knepley if (isDepth) continue; 317cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, lname);CHKERRQ(ierr); 318cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr); 319cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr); 320cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 321cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 322cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 323cd0c2139SMatthew G Knepley for (val = 0; val < numValues; ++val) { 324cd0c2139SMatthew G Knepley IS pointIS; 325cd0c2139SMatthew G Knepley const PetscInt *points; 326cd0c2139SMatthew G Knepley PetscInt numPoints, p; 327cd0c2139SMatthew G Knepley 328cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 329cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 330cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 331cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 332cd0c2139SMatthew G Knepley const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthEnd, depthShift); 333cd0c2139SMatthew G Knepley 334cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr); 335cd0c2139SMatthew G Knepley } 336cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 337cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 338cd0c2139SMatthew G Knepley } 339cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 340cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 341cd0c2139SMatthew G Knepley } 342cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 343cd0c2139SMatthew G Knepley /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */ 344cd0c2139SMatthew G Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 345cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 346cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 347cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr); 348cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "vtk");CHKERRQ(ierr); 349cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "ghost");CHKERRQ(ierr); 350cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr); 351cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr); 352cd0c2139SMatthew G Knepley for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { 353cd0c2139SMatthew G Knepley for (; c < leafLocal[l] && c < cEnd; ++c) { 354cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 355cd0c2139SMatthew G Knepley } 356cd0c2139SMatthew G Knepley if (leafLocal[l] >= cEnd) break; 357cd0c2139SMatthew G Knepley if (leafRemote[l].rank == rank) { 358cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 359cd0c2139SMatthew G Knepley } else { 360cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr); 361cd0c2139SMatthew G Knepley } 362cd0c2139SMatthew G Knepley } 363cd0c2139SMatthew G Knepley for (; c < cEnd; ++c) { 364cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 365cd0c2139SMatthew G Knepley } 366cd0c2139SMatthew G Knepley if (0) { 367cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 368cd0c2139SMatthew G Knepley ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 369cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 370cd0c2139SMatthew G Knepley } 371cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr); 372cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 373cd0c2139SMatthew G Knepley PetscInt numCells; 374cd0c2139SMatthew G Knepley 375cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr); 376cd0c2139SMatthew G Knepley if (numCells < 2) { 377cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr); 378cd0c2139SMatthew G Knepley } else { 379cd0c2139SMatthew G Knepley const PetscInt *cells = NULL; 380cd0c2139SMatthew G Knepley PetscInt vA, vB; 381cd0c2139SMatthew G Knepley 382cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr); 383cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr); 384cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr); 385cd0c2139SMatthew G Knepley if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);} 386cd0c2139SMatthew G Knepley } 387cd0c2139SMatthew G Knepley } 388cd0c2139SMatthew G Knepley if (0) { 389cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 390cd0c2139SMatthew G Knepley ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 391cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 392cd0c2139SMatthew G Knepley } 393cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 394cd0c2139SMatthew G Knepley } 395cd0c2139SMatthew G Knepley 396cd0c2139SMatthew G Knepley #undef __FUNCT__ 397cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal" 398cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm) 399cd0c2139SMatthew G Knepley { 400cd0c2139SMatthew G Knepley IS valueIS; 401cd0c2139SMatthew G Knepley const PetscInt *values; 402cd0c2139SMatthew G Knepley PetscInt *depthShift; 403cd0c2139SMatthew G Knepley PetscInt depth = 0, numFS, fs, ghostCell, cEnd, c; 404cd0c2139SMatthew G Knepley PetscErrorCode ierr; 405cd0c2139SMatthew G Knepley 406cd0c2139SMatthew G Knepley PetscFunctionBegin; 407cd0c2139SMatthew G Knepley /* Count ghost cells */ 408cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 409cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr); 410cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 411cd0c2139SMatthew G Knepley 412cd0c2139SMatthew G Knepley *numGhostCells = 0; 413cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 414cd0c2139SMatthew G Knepley PetscInt numBdFaces; 415cd0c2139SMatthew G Knepley 416cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[fs], &numBdFaces);CHKERRQ(ierr); 417cd0c2139SMatthew G Knepley 418cd0c2139SMatthew G Knepley *numGhostCells += numBdFaces; 419cd0c2139SMatthew G Knepley } 420cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 421cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthShift);CHKERRQ(ierr); 422cd0c2139SMatthew G Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 423cd0c2139SMatthew G Knepley if (depth >= 0) depthShift[depth] = *numGhostCells; 424cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 425cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 426cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 427cd0c2139SMatthew G Knepley for (c = cEnd; c < cEnd + *numGhostCells; ++c) { 428cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr); 429cd0c2139SMatthew G Knepley } 430cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 431cd0c2139SMatthew G Knepley IS faceIS; 432cd0c2139SMatthew G Knepley const PetscInt *faces; 433cd0c2139SMatthew G Knepley PetscInt numFaces, f; 434cd0c2139SMatthew G Knepley 435cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 436cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 437cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 438cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 439cd0c2139SMatthew G Knepley PetscInt size; 440cd0c2139SMatthew G Knepley 441cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr); 442cd0c2139SMatthew G Knepley if (size != 1) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "DM has boundary face %d with %d support cells", faces[f], size); 443cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(gdm, faces[f] + *numGhostCells, 2);CHKERRQ(ierr); 444cd0c2139SMatthew G Knepley } 445cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 446cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 447cd0c2139SMatthew G Knepley } 448cd0c2139SMatthew G Knepley /* Step 4: Setup ghosted DM */ 449cd0c2139SMatthew G Knepley ierr = DMSetUp(gdm);CHKERRQ(ierr); 450cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 451cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 452cd0c2139SMatthew G Knepley ghostCell = cEnd; 453cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 454cd0c2139SMatthew G Knepley IS faceIS; 455cd0c2139SMatthew G Knepley const PetscInt *faces; 456cd0c2139SMatthew G Knepley PetscInt numFaces, f; 457cd0c2139SMatthew G Knepley 458cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 459cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 460cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 461cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f, ++ghostCell) { 462cd0c2139SMatthew G Knepley PetscInt newFace = faces[f] + *numGhostCells; 463cd0c2139SMatthew G Knepley 464cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr); 465cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr); 466cd0c2139SMatthew G Knepley } 467cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 468cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 469cd0c2139SMatthew G Knepley } 470cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 471cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 472cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 473cd0c2139SMatthew G Knepley ierr = DMPlexStratify(gdm);CHKERRQ(ierr); 474cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 475cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 476cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 477cd0c2139SMatthew G Knepley ierr = PetscFree(depthShift);CHKERRQ(ierr); 478cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 479cd0c2139SMatthew G Knepley } 480cd0c2139SMatthew G Knepley 481cd0c2139SMatthew G Knepley #undef __FUNCT__ 482cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells" 483cd0c2139SMatthew G Knepley /*@C 484cd0c2139SMatthew G Knepley DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face 485cd0c2139SMatthew G Knepley 486cd0c2139SMatthew G Knepley Collective on dm 487cd0c2139SMatthew G Knepley 488cd0c2139SMatthew G Knepley Input Parameters: 489cd0c2139SMatthew G Knepley + dm - The original DM 490cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL 491cd0c2139SMatthew G Knepley 492cd0c2139SMatthew G Knepley Output Parameters: 493cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM 494cd0c2139SMatthew G Knepley - dmGhosted - The new DM 495cd0c2139SMatthew G Knepley 496cd0c2139SMatthew G Knepley Note: If no label exists of that name, one will be created marking all boundary faces 497cd0c2139SMatthew G Knepley 498cd0c2139SMatthew G Knepley Level: developer 499cd0c2139SMatthew G Knepley 500cd0c2139SMatthew G Knepley .seealso: DMCreate() 501cd0c2139SMatthew G Knepley */ 502cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted) 503cd0c2139SMatthew G Knepley { 504cd0c2139SMatthew G Knepley DM gdm; 505cd0c2139SMatthew G Knepley DMLabel label; 506cd0c2139SMatthew G Knepley const char *name = labelName ? labelName : "Face Sets"; 507cd0c2139SMatthew G Knepley PetscInt dim; 508cd0c2139SMatthew G Knepley PetscErrorCode ierr; 509cd0c2139SMatthew G Knepley 510cd0c2139SMatthew G Knepley PetscFunctionBegin; 511cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 512cd0c2139SMatthew G Knepley PetscValidPointer(numGhostCells, 3); 513cd0c2139SMatthew G Knepley PetscValidPointer(dmGhosted, 4); 514cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr); 515cd0c2139SMatthew G Knepley ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr); 516cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 517cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(gdm, dim);CHKERRQ(ierr); 518cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 519cd0c2139SMatthew G Knepley if (!label) { 520cd0c2139SMatthew G Knepley /* Get label for boundary faces */ 521cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr); 522cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 523cd0c2139SMatthew G Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 524cd0c2139SMatthew G Knepley } 525cd0c2139SMatthew G Knepley ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr); 526cd0c2139SMatthew G Knepley ierr = DMSetFromOptions(gdm);CHKERRQ(ierr); 527cd0c2139SMatthew G Knepley *dmGhosted = gdm; 528cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 529cd0c2139SMatthew G Knepley } 530cd0c2139SMatthew G Knepley 531cd0c2139SMatthew G Knepley #undef __FUNCT__ 532cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal" 533cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm) 534cd0c2139SMatthew G Knepley { 535cd0c2139SMatthew G Knepley MPI_Comm comm; 536cd0c2139SMatthew G Knepley IS valueIS, *pointIS; 537cd0c2139SMatthew G Knepley const PetscInt *values, **splitPoints; 538cd0c2139SMatthew G Knepley PetscSection coordSection; 539cd0c2139SMatthew G Knepley Vec coordinates; 540cd0c2139SMatthew G Knepley PetscScalar *coords; 5410e49e2e2SMatthew G. Knepley PetscInt *depthShift, *depthOffset, *pMaxNew, *numSplitPoints, *coneNew, *coneONew, *supportNew; 542fd4b9f15SMatthew G. Knepley PetscInt shift = 100, depth = 0, dep, dim, d, numSP = 0, sp, maxConeSize, maxSupportSize, numLabels, vStart, vEnd, pEnd, p, v; 543cd0c2139SMatthew G Knepley PetscErrorCode ierr; 544cd0c2139SMatthew G Knepley 545cd0c2139SMatthew G Knepley PetscFunctionBegin; 546cd0c2139SMatthew G Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 547cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 548fd4b9f15SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 549cd0c2139SMatthew G Knepley /* Count split points and add cohesive cells */ 550cd0c2139SMatthew G Knepley if (label) { 551cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 552cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 553cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 554cd0c2139SMatthew G Knepley } 555cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 556cd0c2139SMatthew G Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 5570e49e2e2SMatthew G. Knepley ierr = PetscMalloc6(depth+1,PetscInt,&depthShift,depth+1,PetscInt,&depthOffset,depth+1,PetscInt,&pMaxNew,maxConeSize*3,PetscInt,&coneNew,maxConeSize*3,PetscInt,&coneONew,maxSupportSize,PetscInt,&supportNew);CHKERRQ(ierr); 558cd0c2139SMatthew G Knepley ierr = PetscMalloc3(depth+1,IS,&pointIS,depth+1,PetscInt,&numSplitPoints,depth+1,const PetscInt*,&splitPoints);CHKERRQ(ierr); 559cd0c2139SMatthew G Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 560cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 561cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 562cd0c2139SMatthew G Knepley numSplitPoints[d] = 0; 563cd0c2139SMatthew G Knepley splitPoints[d] = NULL; 564cd0c2139SMatthew G Knepley pointIS[d] = NULL; 565cd0c2139SMatthew G Knepley } 566cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 567cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 568cd0c2139SMatthew G Knepley 569cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 570cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumSize(label, dep, &depthShift[dep]);CHKERRQ(ierr); 571cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pointIS[dep]);CHKERRQ(ierr); 572cd0c2139SMatthew G Knepley if (pointIS[dep]) { 573cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 574cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 575cd0c2139SMatthew G Knepley } 576cd0c2139SMatthew G Knepley } 577cd0c2139SMatthew G Knepley if (depth >= 0) { 578cd0c2139SMatthew G Knepley /* Calculate number of additional points */ 579cd0c2139SMatthew G Knepley depthShift[depth] = depthShift[depth-1]; /* There is a cohesive cell for every split face */ 580cd0c2139SMatthew G Knepley depthShift[1] += depthShift[0]; /* There is a cohesive edge for every split vertex */ 581cd0c2139SMatthew G Knepley /* Calculate hybrid bound for each dimension */ 582cd0c2139SMatthew G Knepley pMaxNew[0] += depthShift[depth]; 583cd0c2139SMatthew G Knepley if (depth > 1) pMaxNew[dim-1] += depthShift[depth] + depthShift[0]; 584cd0c2139SMatthew G Knepley if (depth > 2) pMaxNew[1] += depthShift[depth] + depthShift[0] + depthShift[dim-1]; 585cd0c2139SMatthew G Knepley 586cd0c2139SMatthew G Knepley /* Calculate point offset for each dimension */ 587cd0c2139SMatthew G Knepley depthOffset[depth] = 0; 588cd0c2139SMatthew G Knepley depthOffset[0] = depthOffset[depth] + depthShift[depth]; 589cd0c2139SMatthew G Knepley if (depth > 1) depthOffset[dim-1] = depthOffset[0] + depthShift[0]; 590cd0c2139SMatthew G Knepley if (depth > 2) depthOffset[1] = depthOffset[dim-1] + depthShift[dim-1]; 591cd0c2139SMatthew G Knepley } 592cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 593cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 594cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 595cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 596cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 597cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + oldp; 598cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 599cd0c2139SMatthew G Knepley const PetscInt *support; 600cd0c2139SMatthew G Knepley PetscInt coneSize, supportSize, q, e; 601cd0c2139SMatthew G Knepley 602cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 603cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 604cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 605cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 606cd0c2139SMatthew G Knepley if (dep == depth-1) { 607cd0c2139SMatthew G Knepley const PetscInt ccell = pMaxNew[depth] + p; 608cd0c2139SMatthew G Knepley /* Add cohesive cells, they are prisms */ 609cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, ccell, 2 + coneSize);CHKERRQ(ierr); 610cd0c2139SMatthew G Knepley } else if (dep == 0) { 611cd0c2139SMatthew G Knepley const PetscInt cedge = pMaxNew[1] + (depthShift[1] - depthShift[0]) + p; 612cd0c2139SMatthew G Knepley 613cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 614cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 615cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 616cd0c2139SMatthew G Knepley PetscInt val; 617cd0c2139SMatthew G Knepley 618cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 619cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) ++q; 620cd0c2139SMatthew G Knepley } 621cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, newp, q+1);CHKERRQ(ierr); 622cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 623cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 624cd0c2139SMatthew G Knepley PetscInt val; 625cd0c2139SMatthew G Knepley 626cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 627cd0c2139SMatthew G Knepley if ((val == 1) || (val == -(shift + 1))) ++q; 628cd0c2139SMatthew G Knepley } 629cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, q+1);CHKERRQ(ierr); 630cd0c2139SMatthew G Knepley /* Add cohesive edges */ 631cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, cedge, 2);CHKERRQ(ierr); 632cd0c2139SMatthew G Knepley /* Punt for now on support, you loop over closure, extract faces, check which ones are in the label */ 633cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 634cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 635cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 636cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 637cd0c2139SMatthew G Knepley PetscInt val; 638cd0c2139SMatthew G Knepley 639cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 640cd0c2139SMatthew G Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++q; 641cd0c2139SMatthew G Knepley } 642cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, newp, q);CHKERRQ(ierr); 643cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 644cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 645cd0c2139SMatthew G Knepley PetscInt val; 646cd0c2139SMatthew G Knepley 647cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 648cd0c2139SMatthew G Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++q; 649cd0c2139SMatthew G Knepley } 650cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, q);CHKERRQ(ierr); 651cd0c2139SMatthew G Knepley } 652cd0c2139SMatthew G Knepley } 653cd0c2139SMatthew G Knepley } 654cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 655cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 656cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 657cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 658cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 659cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 660cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 661cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + oldp; 662cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 663cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 664cd0c2139SMatthew G Knepley PetscInt coneSize, supportSize, q, v, e, s; 665cd0c2139SMatthew G Knepley 666cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 667cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 668cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 669cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 670cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 671cd0c2139SMatthew G Knepley if (dep == depth-1) { 672cd0c2139SMatthew G Knepley const PetscInt ccell = pMaxNew[depth] + p; 673cd0c2139SMatthew G Knepley const PetscInt *supportF; 674cd0c2139SMatthew G Knepley 675cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 676cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 677cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 678cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 679cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 680cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 681cd0c2139SMatthew G Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dim-2], splitPoints[dim-2], &v);CHKERRQ(ierr); 682cd0c2139SMatthew G Knepley 683cd0c2139SMatthew G Knepley coneNew[2+q] = pMaxNew[dim-2] + v; 684cd0c2139SMatthew G Knepley } 685cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 686cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 687e537020bSMatthew G. Knepley /* Face support */ 688cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 689cd0c2139SMatthew G Knepley PetscInt val; 690cd0c2139SMatthew G Knepley 691cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 692cd0c2139SMatthew G Knepley if (val < 0) { 693cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 694cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(sdm, newp, s, ccell);CHKERRQ(ierr); 695cd0c2139SMatthew G Knepley } else { 696cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 697cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, ccell);CHKERRQ(ierr); 698e537020bSMatthew G. Knepley /* Get orientation for cohesive face */ 699e537020bSMatthew G. Knepley { 700e537020bSMatthew G. Knepley const PetscInt *ncone, *nconeO; 701e537020bSMatthew G. Knepley PetscInt nconeSize, nc; 702e537020bSMatthew G. Knepley 703e537020bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 704e537020bSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 705e537020bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 706e537020bSMatthew G. Knepley for (nc = 0; nc < nconeSize; ++nc) { 707e537020bSMatthew G. Knepley if (ncone[nc] == oldp) { 708e537020bSMatthew G. Knepley coneONew[0] = nconeO[nc]; 709e537020bSMatthew G. Knepley break; 710cd0c2139SMatthew G Knepley } 711cd0c2139SMatthew G Knepley } 712e537020bSMatthew 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]); 713e537020bSMatthew G. Knepley } 714e537020bSMatthew G. Knepley } 715e537020bSMatthew G. Knepley } 716e537020bSMatthew G. Knepley /* Cohesive cell: Old and new split face, then new cohesive edges */ 717fd4b9f15SMatthew G. Knepley coneNew[0] = newp; /* Extracted negative side orientation above */ 718e537020bSMatthew G. Knepley coneNew[1] = splitp; coneONew[1] = coneONew[0]; 719fd4b9f15SMatthew G. Knepley if (dim > 2) { 720fd4b9f15SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl; 721fd4b9f15SMatthew G. Knepley 722fd4b9f15SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, oldp, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 723fd4b9f15SMatthew G. Knepley for (cl = 0, q = 0; cl < closureSize*2; cl += 2) { 724fd4b9f15SMatthew G. Knepley const PetscInt clp = closure[cl]; 725fd4b9f15SMatthew G. Knepley 726fd4b9f15SMatthew G. Knepley if ((clp >= vStart) && (clp < vEnd)) { 727fd4b9f15SMatthew G. Knepley ierr = PetscFindInt(clp, numSplitPoints[0], splitPoints[0], &v);CHKERRQ(ierr); 728fd4b9f15SMatthew G. Knepley coneNew[2+q] = pMaxNew[1] + (depthShift[1] - depthShift[0]) + v; 729fd4b9f15SMatthew G. Knepley coneONew[2+q] = 0; 730fd4b9f15SMatthew G. Knepley ++q; 731fd4b9f15SMatthew G. Knepley } 732fd4b9f15SMatthew G. Knepley } 733fd4b9f15SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, oldp, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 734fd4b9f15SMatthew G. Knepley if (q != coneSize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid number of split face vertices %d should be %d", q, coneSize); 735fd4b9f15SMatthew G. Knepley } else { 736e537020bSMatthew G. Knepley for (q = 0; q < coneSize; ++q) { 737e537020bSMatthew G. Knepley coneNew[2+q] = (pMaxNew[1] - pMaxNew[dim-2]) + (depthShift[1] - depthShift[0]) + coneNew[2+q]; 738e537020bSMatthew G. Knepley coneONew[2+q] = 0; 739e537020bSMatthew G. Knepley } 740fd4b9f15SMatthew G. Knepley } 741e537020bSMatthew G. Knepley ierr = DMPlexSetCone(sdm, ccell, coneNew);CHKERRQ(ierr); 742e537020bSMatthew G. Knepley ierr = DMPlexSetConeOrientation(sdm, ccell, coneONew);CHKERRQ(ierr); 743cd0c2139SMatthew G Knepley } else if (dep == 0) { 744cd0c2139SMatthew G Knepley const PetscInt cedge = pMaxNew[1] + (depthShift[1] - depthShift[0]) + p; 745cd0c2139SMatthew G Knepley 746cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 747cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 748cd0c2139SMatthew G Knepley PetscInt val; 749cd0c2139SMatthew G Knepley 750cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 751cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 752cd0c2139SMatthew G Knepley supportNew[q++] = depthOffset[1] + support[e]; 753cd0c2139SMatthew G Knepley } 754cd0c2139SMatthew G Knepley } 755cd0c2139SMatthew G Knepley supportNew[q] = cedge; 756cd0c2139SMatthew G Knepley 757cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 758cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 759cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 760cd0c2139SMatthew G Knepley PetscInt val, edge; 761cd0c2139SMatthew G Knepley 762cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 763cd0c2139SMatthew G Knepley if (val == 1) { 764cd0c2139SMatthew G Knepley ierr = PetscFindInt(support[e], numSplitPoints[1], splitPoints[1], &edge);CHKERRQ(ierr); 765cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 766cd0c2139SMatthew G Knepley supportNew[q++] = pMaxNew[1] + edge; 767cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 768cd0c2139SMatthew G Knepley supportNew[q++] = depthOffset[1] + support[e]; 769cd0c2139SMatthew G Knepley } 770cd0c2139SMatthew G Knepley } 771cd0c2139SMatthew G Knepley supportNew[q] = cedge; 772cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 773cd0c2139SMatthew G Knepley /* Cohesive edge: Old and new split vertex, punting on support */ 774cd0c2139SMatthew G Knepley coneNew[0] = newp; 775cd0c2139SMatthew G Knepley coneNew[1] = splitp; 776cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, cedge, coneNew);CHKERRQ(ierr); 777cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 778cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 779cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 780cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 781cd0c2139SMatthew G Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dim-3], splitPoints[dim-3], &v);CHKERRQ(ierr); 782cd0c2139SMatthew G Knepley 783cd0c2139SMatthew G Knepley coneNew[q] = pMaxNew[dim-3] + v; 784cd0c2139SMatthew G Knepley } 785cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 786cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 787cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 788cd0c2139SMatthew G Knepley PetscInt val; 789cd0c2139SMatthew G Knepley 790cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 791cd0c2139SMatthew G Knepley if ((val == dim-1) || (val == (shift + dim-1))) { 792cd0c2139SMatthew G Knepley supportNew[q++] = depthOffset[dim-1] + support[e]; 793cd0c2139SMatthew G Knepley } 794cd0c2139SMatthew G Knepley } 795cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 796cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 797cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 798cd0c2139SMatthew G Knepley PetscInt val, face; 799cd0c2139SMatthew G Knepley 800cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 801cd0c2139SMatthew G Knepley if (val == dim-1) { 802cd0c2139SMatthew G Knepley ierr = PetscFindInt(support[e], numSplitPoints[dim-1], splitPoints[dim-1], &face);CHKERRQ(ierr); 803cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 804cd0c2139SMatthew G Knepley supportNew[q++] = pMaxNew[dim-1] + face; 805cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 806cd0c2139SMatthew G Knepley supportNew[q++] = depthOffset[dim-1] + support[e]; 807cd0c2139SMatthew G Knepley } 808cd0c2139SMatthew G Knepley } 809cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 810cd0c2139SMatthew G Knepley } 811cd0c2139SMatthew G Knepley } 812cd0c2139SMatthew G Knepley } 813cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 814cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 815cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 816cd0c2139SMatthew G Knepley IS pIS; 817cd0c2139SMatthew G Knepley PetscInt numPoints; 818cd0c2139SMatthew G Knepley const PetscInt *points; 819cd0c2139SMatthew G Knepley 820cd0c2139SMatthew G Knepley if (dep >= 0) continue; 821cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 822cd0c2139SMatthew G Knepley if (!pIS) continue; 823cd0c2139SMatthew G Knepley dep = -dep - shift; 824cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 825cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 826cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 827cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 828cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + oldp; 829cd0c2139SMatthew G Knepley const PetscInt *cone; 830cd0c2139SMatthew G Knepley PetscInt coneSize, c; 83150cf782dSMatthew G. Knepley /* PetscBool replaced = PETSC_FALSE; */ 832cd0c2139SMatthew G Knepley 833cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 834cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 835cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 836cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 837cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 838cd0c2139SMatthew G Knepley const PetscInt coldp = cone[c] - depthOffset[dep-1]; 839cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 840cd0c2139SMatthew G Knepley 841cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 842cd0c2139SMatthew G Knepley if (val == dep-1) { 843cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 844cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 845cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 846cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 84750cf782dSMatthew G. Knepley /* replaced = PETSC_TRUE; */ 848cd0c2139SMatthew G Knepley } 849cd0c2139SMatthew G Knepley } 8504a189a86SMatthew G. Knepley /* Cells with only a vertex or edge on the submesh have no replacement */ 8514a189a86SMatthew G. Knepley /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 852cd0c2139SMatthew G Knepley } 853cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 854cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 855cd0c2139SMatthew G Knepley } 856cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 857cd0c2139SMatthew G Knepley ierr = DMPlexStratify(sdm);CHKERRQ(ierr); 858cd0c2139SMatthew G Knepley /* Step 8: Coordinates */ 859cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 860cd0c2139SMatthew G Knepley ierr = DMPlexGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 861cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 862cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 863cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 864cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[0] + splitPoints[0][v]; 865cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 866cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 867cd0c2139SMatthew G Knepley 868cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 869cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 870cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 871cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 872cd0c2139SMatthew G Knepley } 873cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 874cd0c2139SMatthew G Knepley /* Step 9: SF, if I can figure this out we can split the mesh in parallel */ 875cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 876cd0c2139SMatthew G Knepley /* Step 10: Labels */ 877cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 878cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 879cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 880cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 881cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + splitPoints[dep][p]; 882cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 883cd0c2139SMatthew G Knepley PetscInt l; 884cd0c2139SMatthew G Knepley 885cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 886cd0c2139SMatthew G Knepley DMLabel mlabel; 887cd0c2139SMatthew G Knepley const char *lname; 888cd0c2139SMatthew G Knepley PetscInt val; 8899a356370SMatthew G. Knepley PetscBool isDepth; 890cd0c2139SMatthew G Knepley 891cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 8929a356370SMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 8939a356370SMatthew G. Knepley if (isDepth) continue; 894cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 895cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 896cd0c2139SMatthew G Knepley if (val >= 0) { 897cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 8989a356370SMatthew G. Knepley #if 0 8999a356370SMatthew G. Knepley /* Do not put cohesive edges into the label */ 900cd0c2139SMatthew G Knepley if (dep == 0) { 901cd0c2139SMatthew G Knepley const PetscInt cedge = pMaxNew[1] + (depthShift[1] - depthShift[0]) + p; 902cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr); 903cd0c2139SMatthew G Knepley } 9049a356370SMatthew G. Knepley #endif 905cd0c2139SMatthew G Knepley } 906cd0c2139SMatthew G Knepley } 907cd0c2139SMatthew G Knepley } 908cd0c2139SMatthew G Knepley } 909cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 910cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 911cd0c2139SMatthew G Knepley 912cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 913cd0c2139SMatthew G Knepley if (pointIS[dep]) {ierr = ISRestoreIndices(pointIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 914cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS[dep]);CHKERRQ(ierr); 915cd0c2139SMatthew G Knepley } 916cd0c2139SMatthew G Knepley if (label) { 917cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 918cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 919cd0c2139SMatthew G Knepley } 920f17f3550SMatthew G. Knepley ierr = DMPlexGetChart(sdm, NULL, &pEnd);CHKERRQ(ierr); 9210e49e2e2SMatthew G. Knepley if (depth > 0) pMaxNew[0] += depthShift[0]; /* Account for shadow vertices */ 922f17f3550SMatthew G. Knepley if (depth > 1) pMaxNew[1] = pEnd - depthShift[0]; /* There is a hybrid edge for every shadow vertex */ 923f17f3550SMatthew G. Knepley if (depth > 2) pMaxNew[2] = -1; /* There are no hybrid faces */ 9240e49e2e2SMatthew 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); 9250e49e2e2SMatthew G. Knepley ierr = PetscFree6(depthShift, depthOffset, pMaxNew, coneNew, coneONew, supportNew);CHKERRQ(ierr); 926cd0c2139SMatthew G Knepley ierr = PetscFree3(pointIS, numSplitPoints, splitPoints);CHKERRQ(ierr); 927cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 928cd0c2139SMatthew G Knepley } 929cd0c2139SMatthew G Knepley 930cd0c2139SMatthew G Knepley #undef __FUNCT__ 931cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells" 932cd0c2139SMatthew G Knepley /*@C 933cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 934cd0c2139SMatthew G Knepley 935cd0c2139SMatthew G Knepley Collective on dm 936cd0c2139SMatthew G Knepley 937cd0c2139SMatthew G Knepley Input Parameters: 938cd0c2139SMatthew G Knepley + dm - The original DM 939cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces (this could be auto-generated) 940cd0c2139SMatthew G Knepley 941cd0c2139SMatthew G Knepley Output Parameters: 942cd0c2139SMatthew G Knepley - dmSplit - The new DM 943cd0c2139SMatthew G Knepley 944cd0c2139SMatthew G Knepley Level: developer 945cd0c2139SMatthew G Knepley 9462be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 947cd0c2139SMatthew G Knepley @*/ 948cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 949cd0c2139SMatthew G Knepley { 950cd0c2139SMatthew G Knepley DM sdm; 951cd0c2139SMatthew G Knepley PetscInt dim; 952cd0c2139SMatthew G Knepley PetscErrorCode ierr; 953cd0c2139SMatthew G Knepley 954cd0c2139SMatthew G Knepley PetscFunctionBegin; 955cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 956cd0c2139SMatthew G Knepley PetscValidPointer(dmSplit, 4); 957cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 958cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 959cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 960cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(sdm, dim);CHKERRQ(ierr); 961cd0c2139SMatthew G Knepley switch (dim) { 962cd0c2139SMatthew G Knepley case 2: 963cd0c2139SMatthew G Knepley case 3: 964cd0c2139SMatthew G Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 965cd0c2139SMatthew G Knepley break; 966cd0c2139SMatthew G Knepley default: 967cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 968cd0c2139SMatthew G Knepley } 969cd0c2139SMatthew G Knepley *dmSplit = sdm; 970cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 971cd0c2139SMatthew G Knepley } 972cd0c2139SMatthew G Knepley 973cd0c2139SMatthew G Knepley #undef __FUNCT__ 9742be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete" 975cd0c2139SMatthew G Knepley /*@ 9762be2b188SMatthew G Knepley DMPlexLabelCohesiveComplete - Starting with a label marking vertices on an internal surface, we add all other mesh pieces 977cd0c2139SMatthew G Knepley to complete the surface 978cd0c2139SMatthew G Knepley 979cd0c2139SMatthew G Knepley Input Parameters: 980cd0c2139SMatthew G Knepley + dm - The DM 98147946fd8SMatthew G. Knepley . label - A DMLabel marking the surface vertices 982bb55d314SMatthew G. Knepley . flip - Flag to flip the submesh normal and replace points on the other side 98347946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL 984cd0c2139SMatthew G Knepley 985cd0c2139SMatthew G Knepley Output Parameter: 986cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 987cd0c2139SMatthew G Knepley 988cd0c2139SMatthew G Knepley Level: developer 989cd0c2139SMatthew G Knepley 9902be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 991cd0c2139SMatthew G Knepley @*/ 992bb55d314SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, PetscBool flip, DM subdm) 993cd0c2139SMatthew G Knepley { 994d90583fdSMatthew G. Knepley DMLabel depthLabel; 99547946fd8SMatthew G. Knepley IS dimIS, subpointIS; 99647946fd8SMatthew G. Knepley const PetscInt *points, *subpoints; 997bb55d314SMatthew G. Knepley const PetscInt rev = flip ? -1 : 1; 99847946fd8SMatthew G. Knepley PetscInt shift = 100, dim, dep, cStart, cEnd, numPoints, numSubpoints, p, val; 999cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1000cd0c2139SMatthew G Knepley 1001cd0c2139SMatthew G Knepley PetscFunctionBegin; 1002d90583fdSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 1003cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 100447946fd8SMatthew G. Knepley if (subdm) { 100547946fd8SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 100647946fd8SMatthew G. Knepley if (subpointIS) { 100747946fd8SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 100847946fd8SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 100947946fd8SMatthew G. Knepley } 101047946fd8SMatthew G. Knepley } 1011cd0c2139SMatthew G Knepley /* Cell orientation for face gives the side of the fault */ 1012cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 1013cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1014cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1015cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1016cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1017cd0c2139SMatthew G Knepley const PetscInt *support; 1018cd0c2139SMatthew G Knepley PetscInt supportSize, s; 1019cd0c2139SMatthew G Knepley 1020cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1021cd0c2139SMatthew G Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 1022cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1023cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1024cd0c2139SMatthew G Knepley const PetscInt *cone, *ornt; 1025cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1026cd0c2139SMatthew G Knepley PetscBool pos = PETSC_TRUE; 1027cd0c2139SMatthew G Knepley 1028cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1029cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1030cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 1031cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1032cd0c2139SMatthew G Knepley if (cone[c] == points[p]) { 103347946fd8SMatthew G. Knepley PetscInt o = ornt[c]; 103447946fd8SMatthew G. Knepley 103547946fd8SMatthew G. Knepley if (subdm) { 103647946fd8SMatthew G. Knepley const PetscInt *subcone, *subornt; 103747946fd8SMatthew G. Knepley PetscInt subpoint, subface, subconeSize, sc; 103847946fd8SMatthew G. Knepley 103947946fd8SMatthew G. Knepley ierr = PetscFindInt(support[s], numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 104047946fd8SMatthew G. Knepley ierr = PetscFindInt(points[p], numSubpoints, subpoints, &subface);CHKERRQ(ierr); 104147946fd8SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 104247946fd8SMatthew G. Knepley ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 104347946fd8SMatthew G. Knepley ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 104447946fd8SMatthew G. Knepley for (sc = 0; sc < subconeSize; ++sc) { 104547946fd8SMatthew G. Knepley if (subcone[sc] == subface) { 104647946fd8SMatthew G. Knepley o = subornt[0]; 104747946fd8SMatthew G. Knepley break; 104847946fd8SMatthew G. Knepley } 104947946fd8SMatthew G. Knepley } 105047946fd8SMatthew 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); 105147946fd8SMatthew G. Knepley } 105247946fd8SMatthew G. Knepley if (o >= 0) { 1053bb55d314SMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr); 1054ffaa4bbcSMatthew G. Knepley pos = rev > 0 ? PETSC_TRUE : PETSC_FALSE; 1055cd0c2139SMatthew G Knepley } else { 1056bb55d314SMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr); 1057ffaa4bbcSMatthew G. Knepley pos = rev > 0 ? PETSC_FALSE : PETSC_TRUE; 1058cd0c2139SMatthew G Knepley } 1059cd0c2139SMatthew G Knepley break; 1060cd0c2139SMatthew G Knepley } 1061cd0c2139SMatthew G Knepley } 1062cd0c2139SMatthew 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]); 1063cd0c2139SMatthew G Knepley /* Put faces touching the fault in the label */ 1064cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1065cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 1066cd0c2139SMatthew G Knepley 1067cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1068cd0c2139SMatthew G Knepley if (val == -1) { 1069cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 1070cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 1071cd0c2139SMatthew G Knepley 1072cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1073cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1074cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 1075cd0c2139SMatthew G Knepley 1076cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1077cd0c2139SMatthew G Knepley if ((val >= 0) && (val < dim-1)) { 1078cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1079cd0c2139SMatthew G Knepley break; 1080cd0c2139SMatthew G Knepley } 1081cd0c2139SMatthew G Knepley } 1082cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1083cd0c2139SMatthew G Knepley } 1084cd0c2139SMatthew G Knepley } 1085cd0c2139SMatthew G Knepley } 1086cd0c2139SMatthew G Knepley } 108747946fd8SMatthew G. Knepley if (subdm) { 108847946fd8SMatthew G. Knepley if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 108947946fd8SMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 109047946fd8SMatthew G. Knepley } 1091cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1092cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1093cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1094cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1095cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 1096cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1097cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1098cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1099cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1100cd0c2139SMatthew G Knepley PetscInt *star = NULL; 1101cd0c2139SMatthew G Knepley PetscInt starSize, s; 1102cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1103cd0c2139SMatthew G Knepley 1104cd0c2139SMatthew G Knepley /* First mark cells connected to the fault */ 1105cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1106cd0c2139SMatthew G Knepley while (again) { 1107cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1108cd0c2139SMatthew G Knepley again = 0; 1109cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1110cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1111cd0c2139SMatthew G Knepley const PetscInt *cone; 1112cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1113cd0c2139SMatthew G Knepley 1114cd0c2139SMatthew G Knepley if ((point < cStart) || (point >= cEnd)) continue; 1115cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1116cd0c2139SMatthew G Knepley if (val != -1) continue; 1117cd0c2139SMatthew G Knepley again = 2; 1118cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1119cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1120cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1121cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1122cd0c2139SMatthew G Knepley if (val != -1) { 1123cd0c2139SMatthew 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); 1124cd0c2139SMatthew G Knepley if (val > 0) { 1125cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dim);CHKERRQ(ierr); 1126cd0c2139SMatthew G Knepley } else { 1127cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dim));CHKERRQ(ierr); 1128cd0c2139SMatthew G Knepley } 1129cd0c2139SMatthew G Knepley again = 1; 1130cd0c2139SMatthew G Knepley break; 1131cd0c2139SMatthew G Knepley } 1132cd0c2139SMatthew G Knepley } 1133cd0c2139SMatthew G Knepley } 1134cd0c2139SMatthew G Knepley } 1135cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1136cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1137cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1138cd0c2139SMatthew G Knepley 1139cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1140cd0c2139SMatthew G Knepley if (val == -1) { 1141cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1142cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1143cd0c2139SMatthew G Knepley PetscBool marked = PETSC_FALSE; 1144cd0c2139SMatthew G Knepley 1145cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1146cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1147cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1148cd0c2139SMatthew G Knepley 1149cd0c2139SMatthew G Knepley if ((spoint < cStart) || (spoint >= cEnd)) continue; 1150cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1151cd0c2139SMatthew 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); 1152d90583fdSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1153cd0c2139SMatthew G Knepley if (val > 0) { 1154cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1155cd0c2139SMatthew G Knepley } else { 1156cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1157cd0c2139SMatthew G Knepley } 1158cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1159cd0c2139SMatthew G Knepley break; 1160cd0c2139SMatthew G Knepley } 1161cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1162cd0c2139SMatthew G Knepley if (!marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1163cd0c2139SMatthew G Knepley } 1164cd0c2139SMatthew G Knepley } 1165cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1166cd0c2139SMatthew G Knepley } 1167cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1168cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1169cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1170cd0c2139SMatthew G Knepley } 1171cd0c2139SMatthew G Knepley 1172cd0c2139SMatthew G Knepley #undef __FUNCT__ 1173efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated" 1174efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 1175efa14ee0SMatthew G Knepley 1176efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 1177efa14ee0SMatthew G Knepley */ 1178830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1179efa14ee0SMatthew G Knepley { 1180fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 1181efa14ee0SMatthew G Knepley const PetscInt *subvertices; 118277d178adSMatthew G. Knepley PetscInt *pStart, *pEnd, *pMax, pSize; 1183efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1184efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1185efa14ee0SMatthew G Knepley 1186efa14ee0SMatthew G Knepley PetscFunctionBegin; 1187efa14ee0SMatthew G Knepley *numFaces = 0; 1188efa14ee0SMatthew G Knepley *nFV = 0; 1189efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1190efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 119177d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 119277d178adSMatthew G. Knepley ierr = PetscMalloc3(pSize,PetscInt,&pStart,pSize,PetscInt,&pEnd,pSize,PetscInt,&pMax);CHKERRQ(ierr); 1193d92e47f8SMatthew 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); 1194efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 1195efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1196efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1197efa14ee0SMatthew G Knepley } 1198efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1199fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1200efa14ee0SMatthew G Knepley if (subvertexIS) { 1201efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1202efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1203efa14ee0SMatthew G Knepley } 1204efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1205efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 12060298fd71SBarry Smith PetscInt *star = NULL; 1207efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 1208efa14ee0SMatthew G Knepley 1209efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1210efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1211efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1212efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1213efa14ee0SMatthew G Knepley } 1214efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 1215efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 12160298fd71SBarry Smith PetscInt *closure = NULL; 1217efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 1218efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 1219efa14ee0SMatthew G Knepley 1220efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 122165560c7fSMatthew G Knepley if (cellLoc == 2) continue; 122282f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1223efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1224efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1225efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1226efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1227efa14ee0SMatthew G Knepley 1228efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1229efa14ee0SMatthew G Knepley ++numCorners; 1230efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1231830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 1232efa14ee0SMatthew G Knepley } 1233efa14ee0SMatthew G Knepley } 123418ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 123582f516ccSBarry 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); 1236efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 1237007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 1238007baee2SMatthew G. Knepley PetscInt numCells, nc; 1239007baee2SMatthew G. Knepley 1240efa14ee0SMatthew G Knepley ++(*numFaces); 1241efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 1242efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 1243efa14ee0SMatthew G Knepley } 1244007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1245007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 1246007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 1247007baee2SMatthew G. Knepley } 1248007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1249efa14ee0SMatthew G Knepley } 1250efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1251efa14ee0SMatthew G Knepley } 1252efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1253efa14ee0SMatthew G Knepley } 1254efa14ee0SMatthew G Knepley if (subvertexIS) { 1255efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1256efa14ee0SMatthew G Knepley } 1257efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1258efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1259efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1260efa14ee0SMatthew G Knepley } 1261efa14ee0SMatthew G Knepley 1262efa14ee0SMatthew G Knepley #undef __FUNCT__ 1263efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated" 1264830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 1265efa14ee0SMatthew G Knepley { 1266efa14ee0SMatthew G Knepley IS subvertexIS; 1267efa14ee0SMatthew G Knepley const PetscInt *subvertices; 1268efa14ee0SMatthew G Knepley PetscInt *pStart, *pEnd, *pMax; 1269efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 1270efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1271efa14ee0SMatthew G Knepley 1272efa14ee0SMatthew G Knepley PetscFunctionBegin; 1273efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1274efa14ee0SMatthew G Knepley ierr = PetscMalloc3(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd,dim+1,PetscInt,&pMax);CHKERRQ(ierr); 12750298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1276efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 1277efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1278efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1279efa14ee0SMatthew G Knepley } 1280efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1281830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 1282efa14ee0SMatthew G Knepley if (subvertexIS) { 1283efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1284efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1285efa14ee0SMatthew G Knepley } 1286efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1287efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 12880298fd71SBarry Smith PetscInt *star = NULL; 1289efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 1290efa14ee0SMatthew G Knepley 1291efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1292efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1293efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1294efa14ee0SMatthew G Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 1295efa14ee0SMatthew G Knepley } 1296efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 1297efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 12980298fd71SBarry Smith PetscInt *closure = NULL; 1299efa14ee0SMatthew G Knepley PetscInt closureSize, c; 1300efa14ee0SMatthew G Knepley PetscInt faceLoc; 1301efa14ee0SMatthew G Knepley 1302efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 1303efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 130482f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 1305efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1306efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1307efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1308efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1309efa14ee0SMatthew G Knepley 1310efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1311efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1312830e53efSMatthew G. Knepley if (vertexLoc != value) break; 1313efa14ee0SMatthew G Knepley } 1314efa14ee0SMatthew G Knepley } 1315efa14ee0SMatthew G Knepley if (c == closureSize*2) { 1316efa14ee0SMatthew G Knepley const PetscInt *support; 1317efa14ee0SMatthew G Knepley PetscInt supportSize, s; 1318efa14ee0SMatthew G Knepley 1319efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1320efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1321efa14ee0SMatthew G Knepley 1322efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 1323efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1324efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1325efa14ee0SMatthew G Knepley break; 1326efa14ee0SMatthew G Knepley } 1327efa14ee0SMatthew G Knepley } 1328efa14ee0SMatthew G Knepley } 1329efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 1330efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 1331efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1332efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1333efa14ee0SMatthew G Knepley } 1334efa14ee0SMatthew G Knepley } 1335efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1336efa14ee0SMatthew G Knepley } 1337efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1338efa14ee0SMatthew G Knepley } 1339efa14ee0SMatthew G Knepley if (subvertexIS) { 1340efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1341efa14ee0SMatthew G Knepley } 1342efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1343efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1344efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1345efa14ee0SMatthew G Knepley } 1346efa14ee0SMatthew G Knepley 1347efa14ee0SMatthew G Knepley #undef __FUNCT__ 1348766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated" 134927c04023SMatthew 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) 1350766ab985SMatthew G. Knepley { 135127c04023SMatthew G. Knepley DMLabel label = NULL; 1352766ab985SMatthew G. Knepley const PetscInt *cone; 135327234c99SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize; 1354766ab985SMatthew G. Knepley PetscErrorCode ierr; 1355766ab985SMatthew G. Knepley 1356812bfc34SJed Brown PetscFunctionBegin; 1357c0ed958bSJed Brown *numFaces = 0; 1358c0ed958bSJed Brown *nFV = 0; 1359b6d5cb33SJed Brown if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1360fed694aaSMatthew G. Knepley *subCells = NULL; 1361766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1362766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1363766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1364766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 136527c04023SMatthew G. Knepley if (label) { 136627c04023SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 136727c04023SMatthew G. Knepley PetscInt val; 136827c04023SMatthew G. Knepley 136927c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 137027c04023SMatthew G. Knepley if (val == value) { 137127c04023SMatthew G. Knepley ++(*numFaces); 137227c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 137327c04023SMatthew G. Knepley } 137427c04023SMatthew G. Knepley } 137527c04023SMatthew G. Knepley } else { 1376766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 137727c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 137827c04023SMatthew G. Knepley } 1379766ab985SMatthew G. Knepley *nFV = hasLagrange ? coneSize/3 : coneSize/2; 1380766ab985SMatthew G. Knepley ierr = PetscMalloc(*numFaces *2 * sizeof(PetscInt), subCells);CHKERRQ(ierr); 1381766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1382766ab985SMatthew G. Knepley const PetscInt *cells; 1383766ab985SMatthew G. Knepley PetscInt numCells; 1384766ab985SMatthew G. Knepley 138527c04023SMatthew G. Knepley if (label) { 138627c04023SMatthew G. Knepley PetscInt val; 138727c04023SMatthew G. Knepley 138827c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 138927c04023SMatthew G. Knepley if (val != value) continue; 139027c04023SMatthew G. Knepley } 1391766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1392766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 1393766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 1394766ab985SMatthew G. Knepley } 1395766ab985SMatthew G. Knepley /* Negative face */ 1396766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 139727234c99SMatthew G. Knepley /* Not true in parallel 139827234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 1399766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 1400766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 140127234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 1402766ab985SMatthew G. Knepley } 1403766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 1404766ab985SMatthew G. Knepley /* Positive face is not included */ 1405766ab985SMatthew G. Knepley } 1406766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1407766ab985SMatthew G. Knepley } 1408766ab985SMatthew G. Knepley 1409766ab985SMatthew G. Knepley #undef __FUNCT__ 1410766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated" 141127c04023SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, PetscBool hasLagrange, const char labelname[], PetscInt value, DMLabel subpointMap, DM subdm) 1412766ab985SMatthew G. Knepley { 141327c04023SMatthew G. Knepley DMLabel label = NULL; 1414766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 1415766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 1416766ab985SMatthew G. Knepley PetscErrorCode ierr; 1417766ab985SMatthew G. Knepley 1418812bfc34SJed Brown PetscFunctionBegin; 141927c04023SMatthew G. Knepley if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1420766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1421766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1422766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1423766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 1424766ab985SMatthew G. Knepley ierr = PetscMalloc2(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd);CHKERRQ(ierr); 1425766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 1426766ab985SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1427766ab985SMatthew G. Knepley } 1428766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1429766ab985SMatthew G. Knepley const PetscInt *cone; 1430766ab985SMatthew G. Knepley PetscInt *closure = NULL; 1431766ab985SMatthew G. Knepley PetscInt coneSize, closureSize, cl; 1432766ab985SMatthew G. Knepley 143327c04023SMatthew G. Knepley if (label) { 143427c04023SMatthew G. Knepley PetscInt val; 143527c04023SMatthew G. Knepley 143627c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 143727c04023SMatthew G. Knepley if (val != value) continue; 143827c04023SMatthew G. Knepley } 1439766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 1440766ab985SMatthew G. Knepley if (hasLagrange) { 1441766ab985SMatthew G. Knepley if (coneSize != 3) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 1442766ab985SMatthew G. Knepley } else { 1443766ab985SMatthew G. Knepley if (coneSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 1444766ab985SMatthew G. Knepley } 1445766ab985SMatthew G. Knepley /* Negative face */ 1446766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1447766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1448766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1449766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 1450766ab985SMatthew G. Knepley 1451766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 1452766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1453766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1454766ab985SMatthew G. Knepley break; 1455766ab985SMatthew G. Knepley } 1456766ab985SMatthew G. Knepley } 1457766ab985SMatthew G. Knepley } 1458766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1459766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 1460766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 1461766ab985SMatthew G. Knepley const PetscInt *support; 1462766ab985SMatthew G. Knepley PetscInt supportSize, s; 1463766ab985SMatthew G. Knepley 1464766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 1465766ab985SMatthew G. Knepley if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); 1466766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 1467766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 1468766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1469766ab985SMatthew G. Knepley } 1470766ab985SMatthew G. Knepley } 1471766ab985SMatthew G. Knepley } 1472766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 1473766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1474766ab985SMatthew G. Knepley } 1475766ab985SMatthew G. Knepley 1476766ab985SMatthew G. Knepley #undef __FUNCT__ 1477e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation" 1478e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 1479e6ccafaeSMatthew G Knepley { 148082f516ccSBarry Smith MPI_Comm comm; 1481e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 1482e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 1483e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 1484e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1485e6ccafaeSMatthew G Knepley 148682f516ccSBarry Smith PetscFunctionBegin; 148782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1488e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &cellDim);CHKERRQ(ierr); 1489e6ccafaeSMatthew G Knepley if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 1490e6ccafaeSMatthew G Knepley 1491ddeab2a6SMatthew G. Knepley if (cellDim == 1 && numCorners == 2) { 1492ddeab2a6SMatthew G. Knepley /* Triangle */ 1493e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 1494e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1495ddeab2a6SMatthew G. Knepley } else if (cellDim == 2 && numCorners == 3) { 1496ddeab2a6SMatthew G. Knepley /* Triangle */ 1497ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 1498ddeab2a6SMatthew G. Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1499ddeab2a6SMatthew G. Knepley } else if (cellDim == 3 && numCorners == 4) { 1500ddeab2a6SMatthew G. Knepley /* Tetrahedron */ 1501ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 1502ddeab2a6SMatthew G. Knepley posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1503e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 1504e6ccafaeSMatthew G Knepley /* Quadratic line */ 1505e6ccafaeSMatthew G Knepley faceSize = 1; 1506e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1507e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 1508e6ccafaeSMatthew G Knepley /* Quads */ 1509e6ccafaeSMatthew G Knepley faceSize = 2; 1510e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 1511e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1512e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 1513e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1514e6ccafaeSMatthew G Knepley } else { 1515e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 1516e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 1517e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 1518e6ccafaeSMatthew G Knepley } 1519e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 1520e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 1521e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 1522e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 1523e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 1524e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1525e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 1526e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 1527e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 1528e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 1529e6ccafaeSMatthew G Knepley }; 1530e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 1531e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 1532e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 1533e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 1534e6ccafaeSMatthew G Knepley }; 1535e6ccafaeSMatthew G Knepley 1536e6ccafaeSMatthew G Knepley faceSize = faceSizeTri; 1537e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 1538e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 1539e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 1540e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 1541e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1542e6ccafaeSMatthew G Knepley 1543e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 1544e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 1545e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 1546e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 1547e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 1548e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1549e6ccafaeSMatthew G Knepley break; 1550e6ccafaeSMatthew G Knepley } 1551e6ccafaeSMatthew G Knepley } 1552e6ccafaeSMatthew G Knepley } 1553e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1554e6ccafaeSMatthew G Knepley break; 1555e6ccafaeSMatthew G Knepley } 1556e6ccafaeSMatthew G Knepley } 1557e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 1558e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1559e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1560e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 1561e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 1562e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 1563e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 1564e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 1565e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1566e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 1567e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 1568e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 1569e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 1570e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 1571e6ccafaeSMatthew G Knepley }; 1572e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 1573e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 1574e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 1575e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 1576e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 1577e6ccafaeSMatthew G Knepley }; 1578e6ccafaeSMatthew G Knepley 1579e6ccafaeSMatthew G Knepley faceSize = faceSizeQuad; 1580e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 1581e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 1582e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 1583e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 1584e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1585e6ccafaeSMatthew G Knepley 1586e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 1587e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 1588e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 1589e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 1590e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 1591e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1592e6ccafaeSMatthew G Knepley break; 1593e6ccafaeSMatthew G Knepley } 1594e6ccafaeSMatthew G Knepley } 1595e6ccafaeSMatthew G Knepley } 1596e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1597e6ccafaeSMatthew G Knepley break; 1598e6ccafaeSMatthew G Knepley } 1599e6ccafaeSMatthew G Knepley } 1600e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 1601e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1602e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1603e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 1604e6ccafaeSMatthew G Knepley /* Hexes 1605e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 1606e6ccafaeSMatthew G Knepley pointing up at the second. 1607e6ccafaeSMatthew G Knepley 1608e6ccafaeSMatthew G Knepley 7---6 1609e6ccafaeSMatthew G Knepley /| /| 1610e6ccafaeSMatthew G Knepley 4---5 | 1611ddeab2a6SMatthew G. Knepley | 1-|-2 1612e6ccafaeSMatthew G Knepley |/ |/ 1613ddeab2a6SMatthew G. Knepley 0---3 1614e6ccafaeSMatthew G Knepley 1615e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 1616e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 1617e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 1618e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1619e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 1620e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 1621e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 1622ddeab2a6SMatthew G. Knepley 0, 3, 4, 5, /* front */ 1623ddeab2a6SMatthew G. Knepley 2, 3, 5, 6, /* right */ 1624ddeab2a6SMatthew G. Knepley 1, 2, 6, 7, /* back */ 1625ddeab2a6SMatthew G. Knepley 0, 1, 4, 7, /* left */ 1626e6ccafaeSMatthew G Knepley }; 1627e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 1628ddeab2a6SMatthew G. Knepley 1, 2, 3, 0, /* bottom */ 1629e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 1630ddeab2a6SMatthew G. Knepley 0, 3, 5, 4, /* front */ 1631ddeab2a6SMatthew G. Knepley 3, 2, 6, 5, /* right */ 1632ddeab2a6SMatthew G. Knepley 2, 1, 7, 6, /* back */ 1633ddeab2a6SMatthew G. Knepley 1, 0, 4, 7, /* left */ 1634e6ccafaeSMatthew G Knepley }; 1635e6ccafaeSMatthew G Knepley 1636e6ccafaeSMatthew G Knepley faceSize = faceSizeHex; 1637e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 1638e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 1639e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 1640e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 1641e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1642e6ccafaeSMatthew G Knepley 1643e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 1644e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 1645e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 1646e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 1647e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 1648e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 1649e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 1650e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1651e6ccafaeSMatthew G Knepley break; 1652e6ccafaeSMatthew G Knepley } 1653e6ccafaeSMatthew G Knepley } 1654e6ccafaeSMatthew G Knepley } 1655e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1656e6ccafaeSMatthew G Knepley break; 1657e6ccafaeSMatthew G Knepley } 1658e6ccafaeSMatthew G Knepley } 1659e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 1660e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1661e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1662e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 1663e6ccafaeSMatthew G Knepley /* Quadratic tet */ 1664e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 1665e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 1666e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 1667e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1668e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 1669e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 1670e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 1671e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 1672e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 1673e6ccafaeSMatthew G Knepley }; 1674e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 1675e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 1676e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 1677e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 1678e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 1679e6ccafaeSMatthew G Knepley }; 1680e6ccafaeSMatthew G Knepley 1681e6ccafaeSMatthew G Knepley faceSize = faceSizeTet; 1682e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 1683e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 1684e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 1685e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 1686e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1687e6ccafaeSMatthew G Knepley 1688e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 1689e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 1690e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 1691e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 1692e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 1693e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 1694e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 1695e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1696e6ccafaeSMatthew G Knepley break; 1697e6ccafaeSMatthew G Knepley } 1698e6ccafaeSMatthew G Knepley } 1699e6ccafaeSMatthew G Knepley } 1700e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1701e6ccafaeSMatthew G Knepley break; 1702e6ccafaeSMatthew G Knepley } 1703e6ccafaeSMatthew G Knepley } 1704e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 1705e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1706e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1707e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 1708e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 1709e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 1710e6ccafaeSMatthew G Knepley pointing up at the second. 1711e6ccafaeSMatthew G Knepley 1712e6ccafaeSMatthew G Knepley 7---6 1713e6ccafaeSMatthew G Knepley /| /| 1714e6ccafaeSMatthew G Knepley 4---5 | 1715e6ccafaeSMatthew G Knepley | 3-|-2 1716e6ccafaeSMatthew G Knepley |/ |/ 1717e6ccafaeSMatthew G Knepley 0---1 1718e6ccafaeSMatthew G Knepley 1719e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 1720e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 1721e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 1722e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1723e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 1724e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 1725e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 1726e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 1727e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 1728e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 1729e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 1730e6ccafaeSMatthew G Knepley }; 1731e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 1732e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 1733e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 1734e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 1735e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 1736e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 1737e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 1738e6ccafaeSMatthew G Knepley }; 1739e6ccafaeSMatthew G Knepley 1740e6ccafaeSMatthew G Knepley faceSize = faceSizeQuadHex; 1741e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 1742e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 1743e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 1744e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 1745e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1746e6ccafaeSMatthew G Knepley 1747e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 1748e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 1749e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 1750e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 1751e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 1752e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 1753e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 1754e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1755e6ccafaeSMatthew G Knepley break; 1756e6ccafaeSMatthew G Knepley } 1757e6ccafaeSMatthew G Knepley } 1758e6ccafaeSMatthew G Knepley } 1759e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1760e6ccafaeSMatthew G Knepley break; 1761e6ccafaeSMatthew G Knepley } 1762e6ccafaeSMatthew G Knepley } 1763e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 1764e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1765e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1766e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 1767e6ccafaeSMatthew G Knepley if (!posOrient) { 1768e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 1769e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 1770e6ccafaeSMatthew G Knepley } else { 1771e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 1772e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 1773e6ccafaeSMatthew G Knepley } 1774e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 1775e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1776e6ccafaeSMatthew G Knepley } 1777e6ccafaeSMatthew G Knepley 1778e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1779e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace" 1780e6ccafaeSMatthew G Knepley /* 1781e6ccafaeSMatthew G Knepley Given a cell and a face, as a set of vertices, 1782e6ccafaeSMatthew G Knepley return the oriented face, as a set of vertices, in faceVertices 1783e6ccafaeSMatthew G Knepley The orientation is such that the face normal points out of the cell 1784e6ccafaeSMatthew G Knepley */ 1785e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 1786e6ccafaeSMatthew G Knepley { 17870298fd71SBarry Smith const PetscInt *cone = NULL; 1788e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 1789e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 1790e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1791e6ccafaeSMatthew G Knepley 1792e6ccafaeSMatthew G Knepley PetscFunctionBegin; 1793e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 1794e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 1795e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 1796e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1797e6ccafaeSMatthew G Knepley 1798e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 1799e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 1800e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 1801e6ccafaeSMatthew G Knepley } 1802e6ccafaeSMatthew G Knepley } 1803e6ccafaeSMatthew G Knepley if (found) { 1804e6ccafaeSMatthew G Knepley indices[v2] = v; 1805e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 1806e6ccafaeSMatthew G Knepley ++v2; 1807e6ccafaeSMatthew G Knepley } else { 1808e6ccafaeSMatthew G Knepley oppositeVertex = v; 1809e6ccafaeSMatthew G Knepley } 1810e6ccafaeSMatthew G Knepley } 1811e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 1812e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1813e6ccafaeSMatthew G Knepley } 1814e6ccafaeSMatthew G Knepley 1815e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1816cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal" 1817e6ccafaeSMatthew G Knepley /* 1818cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 1819e6ccafaeSMatthew G Knepley 1820e6ccafaeSMatthew G Knepley Not collective 1821e6ccafaeSMatthew G Knepley 1822e6ccafaeSMatthew G Knepley Input Parameters: 1823e6ccafaeSMatthew G Knepley + dm - The DMPlex 1824e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 1825e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 1826e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 1827e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 1828e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 1829e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 1830e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 1831e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 1832e6ccafaeSMatthew G Knepley 1833e6ccafaeSMatthew G Knepley Output Parameters: 1834e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 1835e6ccafaeSMatthew G Knepley 1836e6ccafaeSMatthew G Knepley Level: developer 1837e6ccafaeSMatthew G Knepley */ 1838cd0c2139SMatthew 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) 1839e6ccafaeSMatthew G Knepley { 184082f516ccSBarry Smith MPI_Comm comm; 1841e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 1842e6ccafaeSMatthew G Knepley const PetscInt *faces; 1843e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 1844e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1845e6ccafaeSMatthew G Knepley 1846e6ccafaeSMatthew G Knepley PetscFunctionBegin; 184782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1848e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 1849e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 1850e6ccafaeSMatthew G Knepley #if 0 1851e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 1852e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 1853e6ccafaeSMatthew G Knepley #else 1854e6ccafaeSMatthew G Knepley { 1855e6ccafaeSMatthew G Knepley PetscInt f; 1856e6ccafaeSMatthew G Knepley 1857e6ccafaeSMatthew G Knepley numFaces = 0; 1858e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 1859e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 1860e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 1861e6ccafaeSMatthew G Knepley 1862e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 1863e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 1864e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 1865e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 1866e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 1867e6ccafaeSMatthew G Knepley PetscInt v; 1868e6ccafaeSMatthew G Knepley 1869e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 1870e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 1871e6ccafaeSMatthew G Knepley } 1872e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 1873e6ccafaeSMatthew G Knepley } 1874e6ccafaeSMatthew G Knepley if (d == dof) { 1875e6ccafaeSMatthew G Knepley numFaces = 1; 1876e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 1877e6ccafaeSMatthew G Knepley } 1878e6ccafaeSMatthew G Knepley } 1879e6ccafaeSMatthew G Knepley } 1880e6ccafaeSMatthew G Knepley #endif 1881e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 1882e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 1883e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 1884766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 1885e6ccafaeSMatthew G Knepley } else { 1886e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 1887e6ccafaeSMatthew G Knepley PetscBool posOriented; 1888e6ccafaeSMatthew G Knepley 1889e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 1890e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 1891e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 1892e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 1893e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 1894e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 1895e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 1896e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 1897e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 1898e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 1899e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 1900e6ccafaeSMatthew G Knepley break; 1901e6ccafaeSMatthew G Knepley } 1902e6ccafaeSMatthew G Knepley } 1903e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 1904e6ccafaeSMatthew G Knepley } 1905e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 1906e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 1907e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 1908e6ccafaeSMatthew G Knepley ++(*newFacePoint); 1909e6ccafaeSMatthew G Knepley } 1910ef07cca7SMatthew G. Knepley #if 0 1911e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 1912ef07cca7SMatthew G. Knepley #else 1913ef07cca7SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 1914ef07cca7SMatthew G. Knepley #endif 1915e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1916e6ccafaeSMatthew G Knepley } 1917e6ccafaeSMatthew G Knepley 1918e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1919e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated" 1920830e53efSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, const char vertexLabelName[], PetscInt value, DM subdm) 1921e6ccafaeSMatthew G Knepley { 192282f516ccSBarry Smith MPI_Comm comm; 1923efa14ee0SMatthew G Knepley DMLabel vertexLabel, subpointMap; 1924efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 1925efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 1926efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 1927fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 1928efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 1929e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1930e6ccafaeSMatthew G Knepley 1931e6ccafaeSMatthew G Knepley PetscFunctionBegin; 193282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1933efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 1934efa14ee0SMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 1935efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 1936efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 1937fed694aaSMatthew G. Knepley if (vertexLabelName) { 1938efa14ee0SMatthew G Knepley ierr = DMPlexGetLabel(dm, vertexLabelName, &vertexLabel);CHKERRQ(ierr); 1939830e53efSMatthew G. Knepley ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr); 1940fed694aaSMatthew G. Knepley } 1941efa14ee0SMatthew G Knepley /* Setup chart */ 1942efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 1943efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 1944efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 1945efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 1946e6ccafaeSMatthew G Knepley /* Set cone sizes */ 1947e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 1948efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 1949e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 1950efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 1951efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 1952efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 1953efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 1954e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 1955e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 1956e6ccafaeSMatthew G Knepley } 1957e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 1958e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 1959e6ccafaeSMatthew G Knepley } 1960e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 1961e6ccafaeSMatthew G Knepley /* Create face cones */ 1962efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 19630298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 1964efa14ee0SMatthew G Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 1965e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 1966e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 1967efa14ee0SMatthew G Knepley const PetscInt subcell = c; 19680298fd71SBarry Smith PetscInt *closure = NULL; 1969efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 1970e6ccafaeSMatthew G Knepley 1971e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1972efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1973efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1974e6ccafaeSMatthew G Knepley PetscInt subVertex; 1975e6ccafaeSMatthew G Knepley 1976efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 1977efa14ee0SMatthew G Knepley ++numCorners; 1978efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 1979efa14ee0SMatthew G Knepley if (subVertex >= 0) { 1980efa14ee0SMatthew G Knepley closure[faceSize] = point; 198165560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 1982e6ccafaeSMatthew G Knepley ++faceSize; 1983e6ccafaeSMatthew G Knepley } 1984e6ccafaeSMatthew G Knepley } 1985e6ccafaeSMatthew G Knepley } 1986efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 1987efa14ee0SMatthew G Knepley if (faceSize == nFV) { 1988cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 1989e6ccafaeSMatthew G Knepley } 199065560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1991e6ccafaeSMatthew G Knepley } 1992efa14ee0SMatthew G Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 1993e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 1994e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 1995e6ccafaeSMatthew G Knepley /* Build coordinates */ 1996efa14ee0SMatthew G Knepley { 1997efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 1998efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 1999efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 2000285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2001efa14ee0SMatthew G Knepley 2002e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2003e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2004e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2005285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2006285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2007285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2008efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2009efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2010efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2011efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2012efa14ee0SMatthew G Knepley PetscInt dof; 2013efa14ee0SMatthew G Knepley 2014efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2015efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2016285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2017e6ccafaeSMatthew G Knepley } 2018e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2019e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2020e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2021e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2022*2eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2023830e53efSMatthew G. Knepley if (coordSize) { 2024e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2025e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2026efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2027efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2028efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2029efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2030e6ccafaeSMatthew G Knepley 2031e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2032e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2033efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2034efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2035efa14ee0SMatthew 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); 2036e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2037e6ccafaeSMatthew G Knepley } 2038e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2039e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 20403b399e24SMatthew G. Knepley } 2041e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2042e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2043e6ccafaeSMatthew G Knepley } 2044efa14ee0SMatthew G Knepley /* Cleanup */ 2045efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2046efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2047efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2048efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2049e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2050e6ccafaeSMatthew G Knepley } 2051e6ccafaeSMatthew G Knepley 2052e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2053e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated" 2054830e53efSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, const char vertexLabelName[], PetscInt value, DM subdm) 2055e6ccafaeSMatthew G Knepley { 205682f516ccSBarry Smith MPI_Comm comm; 2057e6ccafaeSMatthew G Knepley DMLabel subpointMap, vertexLabel; 2058efa14ee0SMatthew G Knepley IS *subpointIS; 2059efa14ee0SMatthew G Knepley const PetscInt **subpoints; 206001a2673eSMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *coneONew; 2061efa14ee0SMatthew G Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2062e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2063e6ccafaeSMatthew G Knepley 2064e6ccafaeSMatthew G Knepley PetscFunctionBegin; 206582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2066efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2067e6ccafaeSMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2068efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2069efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 2070fed694aaSMatthew G. Knepley if (vertexLabelName) { 2071e6ccafaeSMatthew G Knepley ierr = DMPlexGetLabel(dm, vertexLabelName, &vertexLabel);CHKERRQ(ierr); 2072830e53efSMatthew G. Knepley ierr = DMPlexMarkSubmesh_Interpolated(dm, vertexLabel, value, subpointMap, subdm);CHKERRQ(ierr); 2073fed694aaSMatthew G. Knepley } 2074efa14ee0SMatthew G Knepley /* Setup chart */ 2075efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2076efa14ee0SMatthew G Knepley ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr); 2077e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2078e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2079e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 2080e6ccafaeSMatthew G Knepley } 2081e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2082e6ccafaeSMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2083e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2084e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 2085e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2086e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2087e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2088e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2089e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2090e6ccafaeSMatthew G Knepley ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2091e6ccafaeSMatthew G Knepley } 2092e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2093e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2094e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2095e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2096e6ccafaeSMatthew G Knepley const PetscInt *cone; 2097e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 2098e6ccafaeSMatthew G Knepley 2099e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2100e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2101e6ccafaeSMatthew G Knepley if (d == dim) { 2102e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2103e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2104e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2105e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 2106e6ccafaeSMatthew G Knepley } 2107e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2108e6ccafaeSMatthew G Knepley } 2109e6ccafaeSMatthew G Knepley } 2110e6ccafaeSMatthew G Knepley } 2111e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2112e6ccafaeSMatthew G Knepley /* Set cones */ 21130298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 211401a2673eSMatthew G. Knepley ierr = PetscMalloc2(maxConeSize,PetscInt,&coneNew,maxConeSize,PetscInt,&coneONew);CHKERRQ(ierr); 2115e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2116e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2117e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2118e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 21190e49e2e2SMatthew G. Knepley const PetscInt *cone, *ornt; 2120e6ccafaeSMatthew G Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2121e6ccafaeSMatthew G Knepley 2122e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2123e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2124e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 21250e49e2e2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2126e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2127e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 212801a2673eSMatthew G. Knepley if (subc >= 0) { 212901a2673eSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 213001a2673eSMatthew G. Knepley coneONew[coneSizeNew] = ornt[c]; 213101a2673eSMatthew G. Knepley ++coneSizeNew; 213201a2673eSMatthew G. Knepley } 2133e6ccafaeSMatthew G Knepley } 2134e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2135e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 213601a2673eSMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, coneONew);CHKERRQ(ierr); 2137e6ccafaeSMatthew G Knepley } 2138e6ccafaeSMatthew G Knepley } 213901a2673eSMatthew G. Knepley ierr = PetscFree2(coneNew,coneONew);CHKERRQ(ierr); 2140e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2141e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2142e6ccafaeSMatthew G Knepley /* Build coordinates */ 2143e6ccafaeSMatthew G Knepley { 2144e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 2145e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 2146e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 2147285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2148e6ccafaeSMatthew G Knepley 2149e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2150e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2151e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2152285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2153285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2154285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2155e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2156e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2157e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2158e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2159e6ccafaeSMatthew G Knepley PetscInt dof; 2160e6ccafaeSMatthew G Knepley 2161e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2162e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2163285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2164e6ccafaeSMatthew G Knepley } 2165e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2166e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2167e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2168e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2169*2eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2170e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2171e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2172e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2173e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2174e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2175e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2176e6ccafaeSMatthew G Knepley 2177e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2178e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2179e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2180e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2181e6ccafaeSMatthew 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); 2182efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2183e6ccafaeSMatthew G Knepley } 2184e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2185e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2186e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2187e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2188e6ccafaeSMatthew G Knepley } 2189efa14ee0SMatthew G Knepley /* Cleanup */ 2190e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2191e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2192e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2193e6ccafaeSMatthew G Knepley } 2194efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2195e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2196e6ccafaeSMatthew G Knepley } 2197e6ccafaeSMatthew G Knepley 2198e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2199e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh" 2200830e53efSMatthew G. Knepley /*@C 2201e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 2202e6ccafaeSMatthew G Knepley 2203e6ccafaeSMatthew G Knepley Input Parameters: 2204e6ccafaeSMatthew G Knepley + dm - The original mesh 2205830e53efSMatthew G. Knepley . vertexLabel - The DMLabel marking vertices contained in the surface 2206830e53efSMatthew G. Knepley - value - The label value to use 2207e6ccafaeSMatthew G Knepley 2208e6ccafaeSMatthew G Knepley Output Parameter: 2209e6ccafaeSMatthew G Knepley . subdm - The surface mesh 2210e6ccafaeSMatthew G Knepley 2211e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2212e6ccafaeSMatthew G Knepley 2213e6ccafaeSMatthew G Knepley Level: developer 2214e6ccafaeSMatthew G Knepley 2215e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue() 2216830e53efSMatthew G. Knepley @*/ 2217830e53efSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, const char vertexLabel[], PetscInt value, DM *subdm) 2218e6ccafaeSMatthew G Knepley { 2219e6ccafaeSMatthew G Knepley PetscInt dim, depth; 2220e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2221e6ccafaeSMatthew G Knepley 2222e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2223e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2224766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 2225e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2226e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 222782f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2228e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2229e6ccafaeSMatthew G Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2230e6ccafaeSMatthew G Knepley if (depth == dim) { 2231830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2232e6ccafaeSMatthew G Knepley } else { 2233830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2234e6ccafaeSMatthew G Knepley } 2235e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2236e6ccafaeSMatthew G Knepley } 2237e6ccafaeSMatthew G Knepley 2238e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2239aca35d17SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal" 2240aca35d17SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 2241aca35d17SMatthew G. Knepley { 2242aca35d17SMatthew G. Knepley PetscInt subPoint; 2243aca35d17SMatthew G. Knepley PetscErrorCode ierr; 2244aca35d17SMatthew G. Knepley 2245aca35d17SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 2246aca35d17SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 2247aca35d17SMatthew G. Knepley } 2248aca35d17SMatthew G. Knepley 2249aca35d17SMatthew G. Knepley #undef __FUNCT__ 2250766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated" 225127c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 2252766ab985SMatthew G. Knepley { 2253766ab985SMatthew G. Knepley MPI_Comm comm; 2254766ab985SMatthew G. Knepley DMLabel subpointMap; 2255766ab985SMatthew G. Knepley IS subvertexIS; 2256766ab985SMatthew G. Knepley const PetscInt *subVertices; 2257fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 2258766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 225987feddfdSMatthew G. Knepley PetscInt cMax, c, f; 2260766ab985SMatthew G. Knepley PetscErrorCode ierr; 2261766ab985SMatthew G. Knepley 2262766ab985SMatthew G. Knepley PetscFunctionBegin; 2263766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 2264766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2265766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2266766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2267766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 226827c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 2269766ab985SMatthew G. Knepley /* Setup chart */ 2270766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2271766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2272766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2273766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2274766ab985SMatthew G. Knepley /* Set cone sizes */ 2275766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 2276766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 2277766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 2278766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2279766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2280766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2281766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2282766ab985SMatthew G. Knepley } 2283766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2284766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2285766ab985SMatthew G. Knepley } 2286766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2287766ab985SMatthew G. Knepley /* Create face cones */ 2288766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 228987feddfdSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2290766ab985SMatthew G. Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2291766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2292766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 2293766ab985SMatthew G. Knepley const PetscInt subcell = c; 229487feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 229587feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 2296766ab985SMatthew G. Knepley 229787feddfdSMatthew G. Knepley if (cell < cMax) continue; 229887feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 229987feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 230087feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 230187feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 230287feddfdSMatthew G. Knepley } 230387feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 230487feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 230587feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 230627234c99SMatthew G. Knepley /* Not true in parallel 230727234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 230887feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 230987feddfdSMatthew G. Knepley PetscInt negsubcell; 2310766ab985SMatthew G. Knepley 231187feddfdSMatthew G. Knepley if (cells[p] >= cMax) continue; 231287feddfdSMatthew G. Knepley /* I know this is a crap search */ 231387feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 231487feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 2315766ab985SMatthew G. Knepley } 231687feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 231787feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 2318766ab985SMatthew G. Knepley } 231987feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 232087feddfdSMatthew G. Knepley ++newFacePoint; 2321766ab985SMatthew G. Knepley } 2322766ab985SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2323766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2324766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2325766ab985SMatthew G. Knepley /* Build coordinates */ 2326766ab985SMatthew G. Knepley { 2327766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2328766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2329766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2330285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2331766ab985SMatthew G. Knepley 2332766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2333766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2334766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2335285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2336285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2337285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2338766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2339766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2340766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2341766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2342766ab985SMatthew G. Knepley PetscInt dof; 2343766ab985SMatthew G. Knepley 2344766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2345766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2346285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2347766ab985SMatthew G. Knepley } 2348766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2349766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2350766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2351766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2352*2eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2353766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2354766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2355766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2356766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2357766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2358766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 2359766ab985SMatthew G. Knepley 2360766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2361766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2362766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2363766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2364766ab985SMatthew 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); 2365766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2366766ab985SMatthew G. Knepley } 2367766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2368766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2369766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2370766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2371766ab985SMatthew G. Knepley } 2372aca35d17SMatthew G. Knepley /* Build SF */ 2373aca35d17SMatthew G. Knepley CHKMEMQ; 2374aca35d17SMatthew G. Knepley { 2375aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 2376aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 2377bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 2378aca35d17SMatthew G. Knepley const PetscInt *localPoints; 2379bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 238049c26ae4SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 2381bdcf2095SMatthew G. Knepley PetscMPIInt rank; 2382aca35d17SMatthew G. Knepley 2383bdcf2095SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 2384aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 2385aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 2386aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2387aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 2388aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 2389aca35d17SMatthew G. Knepley if (numRoots >= 0) { 2390aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 2391bdcf2095SMatthew G. Knepley ierr = PetscMalloc2(pEnd-pStart,PetscSFNode,&newLocalPoints,numRoots,PetscSFNode,&newOwners);CHKERRQ(ierr); 2392bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 2393bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 2394bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 2395bdcf2095SMatthew G. Knepley } 23969e0823b2SMatthew G. Knepley /* Set subleaves */ 2397aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2398aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 2399bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2400aca35d17SMatthew G. Knepley 2401aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 2402bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 2403bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 2404bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 2405bdcf2095SMatthew G. Knepley ++numSubLeaves; 2406aca35d17SMatthew G. Knepley } 24079e0823b2SMatthew G. Knepley /* Must put in owned subpoints */ 24089e0823b2SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 24099e0823b2SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 24109e0823b2SMatthew G. Knepley 24119e0823b2SMatthew G. Knepley if (subPoint < 0) { 24129e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = -3; 24139e0823b2SMatthew G. Knepley newOwners[p-pStart].index = -3; 24149e0823b2SMatthew G. Knepley } else { 24159e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = rank; 24169e0823b2SMatthew G. Knepley newOwners[p-pStart].index = subPoint; 24179e0823b2SMatthew G. Knepley } 2418bdcf2095SMatthew G. Knepley } 2419bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2420bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2421bdcf2095SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2422bdcf2095SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2423aca35d17SMatthew G. Knepley ierr = PetscMalloc(numSubLeaves * sizeof(PetscInt), &slocalPoints);CHKERRQ(ierr); 2424aca35d17SMatthew G. Knepley ierr = PetscMalloc(numSubLeaves * sizeof(PetscSFNode), &sremotePoints);CHKERRQ(ierr); 242549c26ae4SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 2426bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 2427bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2428aca35d17SMatthew G. Knepley 2429aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 243049c26ae4SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 2431aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 2432bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 2433bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 2434bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 2435bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 2436aca35d17SMatthew G. Knepley ++sl; 2437aca35d17SMatthew G. Knepley } 2438bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 243949c26ae4SMatthew G. Knepley if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 244049c26ae4SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 2441aca35d17SMatthew G. Knepley } 2442aca35d17SMatthew G. Knepley } 2443aca35d17SMatthew G. Knepley CHKMEMQ; 2444766ab985SMatthew G. Knepley /* Cleanup */ 2445766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2446766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2447766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 2448766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2449766ab985SMatthew G. Knepley } 2450766ab985SMatthew G. Knepley 2451766ab985SMatthew G. Knepley #undef __FUNCT__ 2452766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated" 245327c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 2454766ab985SMatthew G. Knepley { 2455766ab985SMatthew G. Knepley MPI_Comm comm; 2456766ab985SMatthew G. Knepley DMLabel subpointMap; 2457766ab985SMatthew G. Knepley IS *subpointIS; 2458766ab985SMatthew G. Knepley const PetscInt **subpoints; 2459766ab985SMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew; 2460766ab985SMatthew G. Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2461766ab985SMatthew G. Knepley PetscErrorCode ierr; 2462766ab985SMatthew G. Knepley 2463766ab985SMatthew G. Knepley PetscFunctionBegin; 2464766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2465766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2466766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2467766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2468766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 246927c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, hasLagrange, label, value, subpointMap, subdm);CHKERRQ(ierr); 2470766ab985SMatthew G. Knepley /* Setup chart */ 2471766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2472766ab985SMatthew G. Knepley ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr); 2473766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2474766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2475766ab985SMatthew G. Knepley totSubPoints += numSubPoints[d]; 2476766ab985SMatthew G. Knepley } 2477766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2478766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2479766ab985SMatthew G. Knepley /* Set cone sizes */ 2480766ab985SMatthew G. Knepley firstSubPoint[dim] = 0; 2481766ab985SMatthew G. Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2482766ab985SMatthew G. Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2483766ab985SMatthew G. Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2484766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2485766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2486766ab985SMatthew G. Knepley ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2487766ab985SMatthew G. Knepley } 2488766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2489766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2490766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2491766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2492766ab985SMatthew G. Knepley const PetscInt *cone; 2493766ab985SMatthew G. Knepley PetscInt coneSize, coneSizeNew, c, val; 2494766ab985SMatthew G. Knepley 2495766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2496766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2497766ab985SMatthew G. Knepley if (d == dim) { 2498766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2499766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2500766ab985SMatthew G. Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2501766ab985SMatthew G. Knepley if (val >= 0) coneSizeNew++; 2502766ab985SMatthew G. Knepley } 2503766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2504766ab985SMatthew G. Knepley } 2505766ab985SMatthew G. Knepley } 2506766ab985SMatthew G. Knepley } 2507766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2508766ab985SMatthew G. Knepley /* Set cones */ 2509766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2510766ab985SMatthew G. Knepley ierr = PetscMalloc(maxConeSize * sizeof(PetscInt), &coneNew);CHKERRQ(ierr); 2511766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2512766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2513766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2514766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2515766ab985SMatthew G. Knepley const PetscInt *cone; 2516766ab985SMatthew G. Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2517766ab985SMatthew G. Knepley 2518766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2519766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2520766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2521766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2522766ab985SMatthew G. Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 2523766ab985SMatthew G. Knepley if (subc >= 0) coneNew[coneSizeNew++] = firstSubPoint[d-1] + subc; 2524766ab985SMatthew G. Knepley } 2525766ab985SMatthew G. Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2526766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 2527766ab985SMatthew G. Knepley } 2528766ab985SMatthew G. Knepley } 2529766ab985SMatthew G. Knepley ierr = PetscFree(coneNew);CHKERRQ(ierr); 2530766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2531766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2532766ab985SMatthew G. Knepley /* Build coordinates */ 2533766ab985SMatthew G. Knepley { 2534766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2535766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2536766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2537285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2538766ab985SMatthew G. Knepley 2539766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2540766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2541766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2542285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2543285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2544285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2545766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2546766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2547766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 2548766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2549766ab985SMatthew G. Knepley PetscInt dof; 2550766ab985SMatthew G. Knepley 2551766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2552766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2553285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2554766ab985SMatthew G. Knepley } 2555766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2556766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2557766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2558766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2559*2eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2560766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2561766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2562766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2563766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 2564766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2565766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 2566766ab985SMatthew G. Knepley 2567766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2568766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2569766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2570766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2571766ab985SMatthew 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); 2572766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2573766ab985SMatthew G. Knepley } 2574766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2575766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2576766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2577766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2578766ab985SMatthew G. Knepley } 2579766ab985SMatthew G. Knepley /* Cleanup */ 2580766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2581766ab985SMatthew G. Knepley ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2582766ab985SMatthew G. Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2583766ab985SMatthew G. Knepley } 2584766ab985SMatthew G. Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2585766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2586766ab985SMatthew G. Knepley } 2587766ab985SMatthew G. Knepley 2588766ab985SMatthew G. Knepley #undef __FUNCT__ 2589766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh" 2590766ab985SMatthew G. Knepley /* 259127c04023SMatthew 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. 2592766ab985SMatthew G. Knepley 2593766ab985SMatthew G. Knepley Input Parameters: 2594766ab985SMatthew G. Knepley + dm - The original mesh 259527c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 259627c04023SMatthew G. Knepley . label - A label name, or PETSC_NULL 259727c04023SMatthew G. Knepley - value - A label value 2598766ab985SMatthew G. Knepley 2599766ab985SMatthew G. Knepley Output Parameter: 2600766ab985SMatthew G. Knepley . subdm - The surface mesh 2601766ab985SMatthew G. Knepley 2602766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2603766ab985SMatthew G. Knepley 2604766ab985SMatthew G. Knepley Level: developer 2605766ab985SMatthew G. Knepley 2606766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 2607766ab985SMatthew G. Knepley */ 260827c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 2609766ab985SMatthew G. Knepley { 2610766ab985SMatthew G. Knepley PetscInt dim, depth; 2611766ab985SMatthew G. Knepley PetscErrorCode ierr; 2612766ab985SMatthew G. Knepley 2613766ab985SMatthew G. Knepley PetscFunctionBegin; 2614766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 261527c04023SMatthew G. Knepley PetscValidPointer(subdm, 5); 2616766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2617766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2618766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2619766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2620766ab985SMatthew G. Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2621766ab985SMatthew G. Knepley if (depth == dim) { 262227c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 2623766ab985SMatthew G. Knepley } else { 262427c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 2625e6ccafaeSMatthew G Knepley } 2626e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2627e6ccafaeSMatthew G Knepley } 2628e6ccafaeSMatthew G Knepley 2629e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2630e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap" 263164beef6dSMatthew G. Knepley /*@ 263264beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 263364beef6dSMatthew G. Knepley 263464beef6dSMatthew G. Knepley Input Parameter: 263564beef6dSMatthew G. Knepley . dm - The submesh DM 263664beef6dSMatthew G. Knepley 263764beef6dSMatthew G. Knepley Output Parameter: 263864beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 263964beef6dSMatthew G. Knepley 264064beef6dSMatthew G. Knepley Level: developer 264164beef6dSMatthew G. Knepley 264264beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 264364beef6dSMatthew G. Knepley @*/ 2644e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 2645e6ccafaeSMatthew G Knepley { 2646e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 2647e6ccafaeSMatthew G Knepley 2648e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2649e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2650e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 2651e6ccafaeSMatthew G Knepley *subpointMap = mesh->subpointMap; 2652e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2653e6ccafaeSMatthew G Knepley } 2654e6ccafaeSMatthew G Knepley 2655e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2656e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap" 2657e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */ 2658e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 2659e6ccafaeSMatthew G Knepley { 2660e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 2661285d324eSMatthew G. Knepley DMLabel tmp; 2662e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2663e6ccafaeSMatthew G Knepley 2664e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2665e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2666285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 2667e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 2668285d324eSMatthew G. Knepley ++mesh->subpointMap->refct; 2669285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 2670e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2671e6ccafaeSMatthew G Knepley } 2672e6ccafaeSMatthew G Knepley 2673e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2674e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS" 267564beef6dSMatthew G. Knepley /*@ 2676e6ccafaeSMatthew G Knepley DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 2677e6ccafaeSMatthew G Knepley 2678e6ccafaeSMatthew G Knepley Input Parameter: 2679e6ccafaeSMatthew G Knepley . dm - The submesh DM 2680e6ccafaeSMatthew G Knepley 2681e6ccafaeSMatthew G Knepley Output Parameter: 26820298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 2683e6ccafaeSMatthew G Knepley 2684e6ccafaeSMatthew G Knepley Note: This is IS is guaranteed to be sorted by the construction of the submesh 268564beef6dSMatthew G. Knepley 268664beef6dSMatthew G. Knepley Level: developer 268764beef6dSMatthew G. Knepley 268864beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 268964beef6dSMatthew G. Knepley @*/ 2690e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 2691e6ccafaeSMatthew G Knepley { 269282f516ccSBarry Smith MPI_Comm comm; 2693e6ccafaeSMatthew G Knepley DMLabel subpointMap; 2694e6ccafaeSMatthew G Knepley IS is; 2695e6ccafaeSMatthew G Knepley const PetscInt *opoints; 2696e6ccafaeSMatthew G Knepley PetscInt *points, *depths; 2697e6ccafaeSMatthew G Knepley PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 2698e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2699e6ccafaeSMatthew G Knepley 2700e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2701e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2702e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 270382f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 27040298fd71SBarry Smith *subpointIS = NULL; 2705e6ccafaeSMatthew G Knepley ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 2706e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2707fed694aaSMatthew G. Knepley if (subpointMap && depth >= 0) { 2708e6ccafaeSMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2709e6ccafaeSMatthew G Knepley if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 2710e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 2711e6ccafaeSMatthew G Knepley depths[0] = depth; 2712e6ccafaeSMatthew G Knepley depths[1] = 0; 2713e6ccafaeSMatthew G Knepley for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 2714e6ccafaeSMatthew G Knepley ierr = PetscMalloc(pEnd * sizeof(PetscInt), &points);CHKERRQ(ierr); 2715e6ccafaeSMatthew G Knepley for(d = 0, off = 0; d <= depth; ++d) { 2716e6ccafaeSMatthew G Knepley const PetscInt dep = depths[d]; 2717e6ccafaeSMatthew G Knepley 2718e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 2719e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 27201e21b6fdSMatthew G Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 2721e6ccafaeSMatthew 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); 2722e6ccafaeSMatthew G Knepley } else { 27231e21b6fdSMatthew G Knepley if (!n) { 27241e21b6fdSMatthew G Knepley if (d == 0) { 27251e21b6fdSMatthew G Knepley /* Missing cells */ 27261e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 27271e21b6fdSMatthew G Knepley } else { 27281e21b6fdSMatthew G Knepley /* Missing faces */ 27291e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 27301e21b6fdSMatthew G Knepley } 27311e21b6fdSMatthew G Knepley } 2732e6ccafaeSMatthew G Knepley } 2733e6ccafaeSMatthew G Knepley if (n) { 2734e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 2735e6ccafaeSMatthew G Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 2736e6ccafaeSMatthew G Knepley for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 2737e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 2738e6ccafaeSMatthew G Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 2739e6ccafaeSMatthew G Knepley } 2740e6ccafaeSMatthew G Knepley } 2741e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 2742e6ccafaeSMatthew G Knepley if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 2743fed694aaSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 2744e6ccafaeSMatthew G Knepley } 2745e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2746e6ccafaeSMatthew G Knepley } 2747