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); 217cd0c2139SMatthew G Knepley ierr = VecSetFromOptions(newCoordinates);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; 541cd0c2139SMatthew G Knepley PetscInt *depthShift, *depthOffset, *pMaxNew, *numSplitPoints, *coneNew, *supportNew; 542cd0c2139SMatthew G Knepley PetscInt shift = 100, depth = 0, dep, dim, d, numSP = 0, sp, maxConeSize, maxSupportSize, numLabels, 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); 548cd0c2139SMatthew G Knepley /* Count split points and add cohesive cells */ 549cd0c2139SMatthew G Knepley if (label) { 550cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 551cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 552cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 553cd0c2139SMatthew G Knepley } 554cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 555cd0c2139SMatthew G Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 556cd0c2139SMatthew G Knepley ierr = PetscMalloc5(depth+1,PetscInt,&depthShift,depth+1,PetscInt,&depthOffset,depth+1,PetscInt,&pMaxNew,maxConeSize*3,PetscInt,&coneNew,maxSupportSize,PetscInt,&supportNew);CHKERRQ(ierr); 557cd0c2139SMatthew G Knepley ierr = PetscMalloc3(depth+1,IS,&pointIS,depth+1,PetscInt,&numSplitPoints,depth+1,const PetscInt*,&splitPoints);CHKERRQ(ierr); 558cd0c2139SMatthew G Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 559cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 560cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 561cd0c2139SMatthew G Knepley numSplitPoints[d] = 0; 562cd0c2139SMatthew G Knepley splitPoints[d] = NULL; 563cd0c2139SMatthew G Knepley pointIS[d] = NULL; 564cd0c2139SMatthew G Knepley } 565cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 566cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 567cd0c2139SMatthew G Knepley 568cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 569cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumSize(label, dep, &depthShift[dep]);CHKERRQ(ierr); 570cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pointIS[dep]);CHKERRQ(ierr); 571cd0c2139SMatthew G Knepley if (pointIS[dep]) { 572cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 573cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 574cd0c2139SMatthew G Knepley } 575cd0c2139SMatthew G Knepley } 576cd0c2139SMatthew G Knepley if (depth >= 0) { 577cd0c2139SMatthew G Knepley /* Calculate number of additional points */ 578cd0c2139SMatthew G Knepley depthShift[depth] = depthShift[depth-1]; /* There is a cohesive cell for every split face */ 579cd0c2139SMatthew G Knepley depthShift[1] += depthShift[0]; /* There is a cohesive edge for every split vertex */ 580cd0c2139SMatthew G Knepley /* Calculate hybrid bound for each dimension */ 581cd0c2139SMatthew G Knepley pMaxNew[0] += depthShift[depth]; 582cd0c2139SMatthew G Knepley if (depth > 1) pMaxNew[dim-1] += depthShift[depth] + depthShift[0]; 583cd0c2139SMatthew G Knepley if (depth > 2) pMaxNew[1] += depthShift[depth] + depthShift[0] + depthShift[dim-1]; 584cd0c2139SMatthew G Knepley 585cd0c2139SMatthew G Knepley /* Calculate point offset for each dimension */ 586cd0c2139SMatthew G Knepley depthOffset[depth] = 0; 587cd0c2139SMatthew G Knepley depthOffset[0] = depthOffset[depth] + depthShift[depth]; 588cd0c2139SMatthew G Knepley if (depth > 1) depthOffset[dim-1] = depthOffset[0] + depthShift[0]; 589cd0c2139SMatthew G Knepley if (depth > 2) depthOffset[1] = depthOffset[dim-1] + depthShift[dim-1]; 590cd0c2139SMatthew G Knepley } 591cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 592cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 593cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 594cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 595cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 596cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + oldp; 597cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 598cd0c2139SMatthew G Knepley const PetscInt *support; 599cd0c2139SMatthew G Knepley PetscInt coneSize, supportSize, q, e; 600cd0c2139SMatthew G Knepley 601cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 602cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 603cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 604cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 605cd0c2139SMatthew G Knepley if (dep == depth-1) { 606cd0c2139SMatthew G Knepley const PetscInt ccell = pMaxNew[depth] + p; 607cd0c2139SMatthew G Knepley /* Add cohesive cells, they are prisms */ 608cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, ccell, 2 + coneSize);CHKERRQ(ierr); 609cd0c2139SMatthew G Knepley } else if (dep == 0) { 610cd0c2139SMatthew G Knepley const PetscInt cedge = pMaxNew[1] + (depthShift[1] - depthShift[0]) + p; 611cd0c2139SMatthew G Knepley 612cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 613cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 614cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 615cd0c2139SMatthew G Knepley PetscInt val; 616cd0c2139SMatthew G Knepley 617cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 618cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) ++q; 619cd0c2139SMatthew G Knepley } 620cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, newp, q+1);CHKERRQ(ierr); 621cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 622cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 623cd0c2139SMatthew G Knepley PetscInt val; 624cd0c2139SMatthew G Knepley 625cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 626cd0c2139SMatthew G Knepley if ((val == 1) || (val == -(shift + 1))) ++q; 627cd0c2139SMatthew G Knepley } 628cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, q+1);CHKERRQ(ierr); 629cd0c2139SMatthew G Knepley /* Add cohesive edges */ 630cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, cedge, 2);CHKERRQ(ierr); 631cd0c2139SMatthew G Knepley /* Punt for now on support, you loop over closure, extract faces, check which ones are in the label */ 632cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 633cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 634cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 635cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 636cd0c2139SMatthew G Knepley PetscInt val; 637cd0c2139SMatthew G Knepley 638cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 639cd0c2139SMatthew G Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++q; 640cd0c2139SMatthew G Knepley } 641cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, newp, q);CHKERRQ(ierr); 642cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 643cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 644cd0c2139SMatthew G Knepley PetscInt val; 645cd0c2139SMatthew G Knepley 646cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 647cd0c2139SMatthew G Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++q; 648cd0c2139SMatthew G Knepley } 649cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, q);CHKERRQ(ierr); 650cd0c2139SMatthew G Knepley } 651cd0c2139SMatthew G Knepley } 652cd0c2139SMatthew G Knepley } 653cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 654cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 655cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 656cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 657cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 658cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 659cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 660cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + oldp; 661cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 662cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 663cd0c2139SMatthew G Knepley PetscInt coneSize, supportSize, q, v, e, s; 664cd0c2139SMatthew G Knepley 665cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 666cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 667cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 668cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 669cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 670cd0c2139SMatthew G Knepley if (dep == depth-1) { 671cd0c2139SMatthew G Knepley const PetscInt ccell = pMaxNew[depth] + p; 672cd0c2139SMatthew G Knepley const PetscInt *supportF; 673cd0c2139SMatthew G Knepley 674cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 675cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 676cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 677cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 678cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 679cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 680cd0c2139SMatthew G Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dim-2], splitPoints[dim-2], &v);CHKERRQ(ierr); 681cd0c2139SMatthew G Knepley 682cd0c2139SMatthew G Knepley coneNew[2+q] = pMaxNew[dim-2] + v; 683cd0c2139SMatthew G Knepley } 684cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 685cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 686cd0c2139SMatthew G Knepley /* Cohesive cell: Old and new split face, then new cohesive edges */ 687cd0c2139SMatthew G Knepley coneNew[0] = newp; 688cd0c2139SMatthew G Knepley coneNew[1] = splitp; 689cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 690cd0c2139SMatthew G Knepley coneNew[2+q] = (pMaxNew[1] - pMaxNew[dim-2]) + (depthShift[1] - depthShift[0]) + coneNew[2+q]; 691cd0c2139SMatthew G Knepley } 692cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, ccell, coneNew);CHKERRQ(ierr); 693cd0c2139SMatthew G Knepley 694cd0c2139SMatthew G Knepley 695cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 696cd0c2139SMatthew G Knepley PetscInt val; 697cd0c2139SMatthew G Knepley 698cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 699cd0c2139SMatthew G Knepley if (val < 0) { 700cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 701cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(sdm, newp, s, ccell);CHKERRQ(ierr); 702cd0c2139SMatthew G Knepley } else { 703cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 704cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, ccell);CHKERRQ(ierr); 705cd0c2139SMatthew G Knepley } 706cd0c2139SMatthew G Knepley } 707cd0c2139SMatthew G Knepley } else if (dep == 0) { 708cd0c2139SMatthew G Knepley const PetscInt cedge = pMaxNew[1] + (depthShift[1] - depthShift[0]) + p; 709cd0c2139SMatthew G Knepley 710cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 711cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 712cd0c2139SMatthew G Knepley PetscInt val; 713cd0c2139SMatthew G Knepley 714cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 715cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 716cd0c2139SMatthew G Knepley supportNew[q++] = depthOffset[1] + support[e]; 717cd0c2139SMatthew G Knepley } 718cd0c2139SMatthew G Knepley } 719cd0c2139SMatthew G Knepley supportNew[q] = cedge; 720cd0c2139SMatthew G Knepley 721cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 722cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 723cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 724cd0c2139SMatthew G Knepley PetscInt val, edge; 725cd0c2139SMatthew G Knepley 726cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 727cd0c2139SMatthew G Knepley if (val == 1) { 728cd0c2139SMatthew G Knepley ierr = PetscFindInt(support[e], numSplitPoints[1], splitPoints[1], &edge);CHKERRQ(ierr); 729cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 730cd0c2139SMatthew G Knepley supportNew[q++] = pMaxNew[1] + edge; 731cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 732cd0c2139SMatthew G Knepley supportNew[q++] = depthOffset[1] + support[e]; 733cd0c2139SMatthew G Knepley } 734cd0c2139SMatthew G Knepley } 735cd0c2139SMatthew G Knepley supportNew[q] = cedge; 736cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 737cd0c2139SMatthew G Knepley /* Cohesive edge: Old and new split vertex, punting on support */ 738cd0c2139SMatthew G Knepley coneNew[0] = newp; 739cd0c2139SMatthew G Knepley coneNew[1] = splitp; 740cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, cedge, coneNew);CHKERRQ(ierr); 741cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 742cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 743cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 744cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 745cd0c2139SMatthew G Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dim-3], splitPoints[dim-3], &v);CHKERRQ(ierr); 746cd0c2139SMatthew G Knepley 747cd0c2139SMatthew G Knepley coneNew[q] = pMaxNew[dim-3] + v; 748cd0c2139SMatthew G Knepley } 749cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 750cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 751cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 752cd0c2139SMatthew G Knepley PetscInt val; 753cd0c2139SMatthew G Knepley 754cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 755cd0c2139SMatthew G Knepley if ((val == dim-1) || (val == (shift + dim-1))) { 756cd0c2139SMatthew G Knepley supportNew[q++] = depthOffset[dim-1] + support[e]; 757cd0c2139SMatthew G Knepley } 758cd0c2139SMatthew G Knepley } 759cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 760cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 761cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 762cd0c2139SMatthew G Knepley PetscInt val, face; 763cd0c2139SMatthew G Knepley 764cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 765cd0c2139SMatthew G Knepley if (val == dim-1) { 766cd0c2139SMatthew G Knepley ierr = PetscFindInt(support[e], numSplitPoints[dim-1], splitPoints[dim-1], &face);CHKERRQ(ierr); 767cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 768cd0c2139SMatthew G Knepley supportNew[q++] = pMaxNew[dim-1] + face; 769cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 770cd0c2139SMatthew G Knepley supportNew[q++] = depthOffset[dim-1] + support[e]; 771cd0c2139SMatthew G Knepley } 772cd0c2139SMatthew G Knepley } 773cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 774cd0c2139SMatthew G Knepley } 775cd0c2139SMatthew G Knepley } 776cd0c2139SMatthew G Knepley } 777cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 778cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 779cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 780cd0c2139SMatthew G Knepley IS pIS; 781cd0c2139SMatthew G Knepley PetscInt numPoints; 782cd0c2139SMatthew G Knepley const PetscInt *points; 783cd0c2139SMatthew G Knepley 784cd0c2139SMatthew G Knepley if (dep >= 0) continue; 785cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 786cd0c2139SMatthew G Knepley if (!pIS) continue; 787cd0c2139SMatthew G Knepley dep = -dep - shift; 788cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 789cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 790cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 791cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 792cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + oldp; 793cd0c2139SMatthew G Knepley const PetscInt *cone; 794cd0c2139SMatthew G Knepley PetscInt coneSize, c; 795cd0c2139SMatthew G Knepley PetscBool replaced = PETSC_FALSE; 796cd0c2139SMatthew G Knepley 797cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 798cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 799cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 800cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 801cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 802cd0c2139SMatthew G Knepley const PetscInt coldp = cone[c] - depthOffset[dep-1]; 803cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 804cd0c2139SMatthew G Knepley 805cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 806cd0c2139SMatthew G Knepley if (val == dep-1) { 807cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 808cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 809cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 810cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 811cd0c2139SMatthew G Knepley replaced = PETSC_TRUE; 812cd0c2139SMatthew G Knepley } 813cd0c2139SMatthew G Knepley } 814cd0c2139SMatthew G Knepley if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); 815cd0c2139SMatthew G Knepley } 816cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 817cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 818cd0c2139SMatthew G Knepley } 819cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 820cd0c2139SMatthew G Knepley ierr = DMPlexStratify(sdm);CHKERRQ(ierr); 821cd0c2139SMatthew G Knepley /* Step 8: Coordinates */ 822cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 823cd0c2139SMatthew G Knepley ierr = DMPlexGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 824cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 825cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 826cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 827cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[0] + splitPoints[0][v]; 828cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 829cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 830cd0c2139SMatthew G Knepley 831cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 832cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 833cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 834cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 835cd0c2139SMatthew G Knepley } 836cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 837cd0c2139SMatthew G Knepley /* Step 9: SF, if I can figure this out we can split the mesh in parallel */ 838cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 839cd0c2139SMatthew G Knepley /* Step 10: Labels */ 840cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 841cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 842cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 843cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 844cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + splitPoints[dep][p]; 845cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 846cd0c2139SMatthew G Knepley PetscInt l; 847cd0c2139SMatthew G Knepley 848cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 849cd0c2139SMatthew G Knepley DMLabel mlabel; 850cd0c2139SMatthew G Knepley const char *lname; 851cd0c2139SMatthew G Knepley PetscInt val; 852cd0c2139SMatthew G Knepley 853cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 854cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 855cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 856cd0c2139SMatthew G Knepley if (val >= 0) { 857cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 858cd0c2139SMatthew G Knepley if (dep == 0) { 859cd0c2139SMatthew G Knepley const PetscInt cedge = pMaxNew[1] + (depthShift[1] - depthShift[0]) + p; 860cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr); 861cd0c2139SMatthew G Knepley } 862cd0c2139SMatthew G Knepley } 863cd0c2139SMatthew G Knepley } 864cd0c2139SMatthew G Knepley } 865cd0c2139SMatthew G Knepley } 866cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 867cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 868cd0c2139SMatthew G Knepley 869cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 870cd0c2139SMatthew G Knepley if (pointIS[dep]) {ierr = ISRestoreIndices(pointIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 871cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS[dep]);CHKERRQ(ierr); 872cd0c2139SMatthew G Knepley } 873cd0c2139SMatthew G Knepley if (label) { 874cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 875cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 876cd0c2139SMatthew G Knepley } 877cd0c2139SMatthew G Knepley ierr = PetscFree5(depthShift, depthOffset, pMaxNew, coneNew, supportNew);CHKERRQ(ierr); 878cd0c2139SMatthew G Knepley ierr = PetscFree3(pointIS, numSplitPoints, splitPoints);CHKERRQ(ierr); 879cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 880cd0c2139SMatthew G Knepley } 881cd0c2139SMatthew G Knepley 882cd0c2139SMatthew G Knepley #undef __FUNCT__ 883cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells" 884cd0c2139SMatthew G Knepley /*@C 885cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 886cd0c2139SMatthew G Knepley 887cd0c2139SMatthew G Knepley Collective on dm 888cd0c2139SMatthew G Knepley 889cd0c2139SMatthew G Knepley Input Parameters: 890cd0c2139SMatthew G Knepley + dm - The original DM 891cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces (this could be auto-generated) 892cd0c2139SMatthew G Knepley 893cd0c2139SMatthew G Knepley Output Parameters: 894cd0c2139SMatthew G Knepley - dmSplit - The new DM 895cd0c2139SMatthew G Knepley 896cd0c2139SMatthew G Knepley Level: developer 897cd0c2139SMatthew G Knepley 8982be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 899cd0c2139SMatthew G Knepley @*/ 900cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 901cd0c2139SMatthew G Knepley { 902cd0c2139SMatthew G Knepley DM sdm; 903cd0c2139SMatthew G Knepley PetscInt dim; 904cd0c2139SMatthew G Knepley PetscErrorCode ierr; 905cd0c2139SMatthew G Knepley 906cd0c2139SMatthew G Knepley PetscFunctionBegin; 907cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 908cd0c2139SMatthew G Knepley PetscValidPointer(dmSplit, 4); 909cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 910cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 911cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 912cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(sdm, dim);CHKERRQ(ierr); 913cd0c2139SMatthew G Knepley switch (dim) { 914cd0c2139SMatthew G Knepley case 2: 915cd0c2139SMatthew G Knepley case 3: 916cd0c2139SMatthew G Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 917cd0c2139SMatthew G Knepley break; 918cd0c2139SMatthew G Knepley default: 919cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 920cd0c2139SMatthew G Knepley } 921cd0c2139SMatthew G Knepley *dmSplit = sdm; 922cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 923cd0c2139SMatthew G Knepley } 924cd0c2139SMatthew G Knepley 925cd0c2139SMatthew G Knepley #undef __FUNCT__ 9262be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete" 927cd0c2139SMatthew G Knepley /*@ 9282be2b188SMatthew G Knepley DMPlexLabelCohesiveComplete - Starting with a label marking vertices on an internal surface, we add all other mesh pieces 929cd0c2139SMatthew G Knepley to complete the surface 930cd0c2139SMatthew G Knepley 931cd0c2139SMatthew G Knepley Input Parameters: 932cd0c2139SMatthew G Knepley + dm - The DM 933cd0c2139SMatthew G Knepley - label - A DMLabel marking the surface vertices 934cd0c2139SMatthew G Knepley 935cd0c2139SMatthew G Knepley Output Parameter: 936cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 937cd0c2139SMatthew G Knepley 938cd0c2139SMatthew G Knepley Level: developer 939cd0c2139SMatthew G Knepley 9402be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 941cd0c2139SMatthew G Knepley @*/ 9422be2b188SMatthew G Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label) 943cd0c2139SMatthew G Knepley { 944cd0c2139SMatthew G Knepley IS dimIS; 945cd0c2139SMatthew G Knepley const PetscInt *points; 946cd0c2139SMatthew G Knepley PetscInt shift = 100, dim, dep, cStart, cEnd, numPoints, p, val; 947cd0c2139SMatthew G Knepley PetscErrorCode ierr; 948cd0c2139SMatthew G Knepley 949cd0c2139SMatthew G Knepley PetscFunctionBegin; 950cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 951cd0c2139SMatthew G Knepley /* Cell orientation for face gives the side of the fault */ 952cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 953cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 954cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 955cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 956cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 957cd0c2139SMatthew G Knepley const PetscInt *support; 958cd0c2139SMatthew G Knepley PetscInt supportSize, s; 959cd0c2139SMatthew G Knepley 960cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 961cd0c2139SMatthew G Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 962cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 963cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 964cd0c2139SMatthew G Knepley const PetscInt *cone, *ornt; 965cd0c2139SMatthew G Knepley PetscInt coneSize, c; 966cd0c2139SMatthew G Knepley PetscBool pos = PETSC_TRUE; 967cd0c2139SMatthew G Knepley 968cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 969cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 970cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 971cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 972cd0c2139SMatthew G Knepley if (cone[c] == points[p]) { 973cd0c2139SMatthew G Knepley if (ornt[c] >= 0) { 974cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, support[s], shift+dim);CHKERRQ(ierr); 975cd0c2139SMatthew G Knepley } else { 976cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, support[s], -(shift+dim));CHKERRQ(ierr); 977cd0c2139SMatthew G Knepley pos = PETSC_FALSE; 978cd0c2139SMatthew G Knepley } 979cd0c2139SMatthew G Knepley break; 980cd0c2139SMatthew G Knepley } 981cd0c2139SMatthew G Knepley } 982cd0c2139SMatthew 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]); 983cd0c2139SMatthew G Knepley /* Put faces touching the fault in the label */ 984cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 985cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 986cd0c2139SMatthew G Knepley 987cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 988cd0c2139SMatthew G Knepley if (val == -1) { 989cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 990cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 991cd0c2139SMatthew G Knepley 992cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 993cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 994cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 995cd0c2139SMatthew G Knepley 996cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 997cd0c2139SMatthew G Knepley if ((val >= 0) && (val < dim-1)) { 998cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 999cd0c2139SMatthew G Knepley break; 1000cd0c2139SMatthew G Knepley } 1001cd0c2139SMatthew G Knepley } 1002cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1003cd0c2139SMatthew G Knepley } 1004cd0c2139SMatthew G Knepley } 1005cd0c2139SMatthew G Knepley } 1006cd0c2139SMatthew G Knepley } 1007cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1008cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1009cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1010cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1011cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 1012cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1013cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1014cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1015cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1016cd0c2139SMatthew G Knepley PetscInt *star = NULL; 1017cd0c2139SMatthew G Knepley PetscInt starSize, s; 1018cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1019cd0c2139SMatthew G Knepley 1020cd0c2139SMatthew G Knepley /* First mark cells connected to the fault */ 1021cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1022cd0c2139SMatthew G Knepley while (again) { 1023cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1024cd0c2139SMatthew G Knepley again = 0; 1025cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1026cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1027cd0c2139SMatthew G Knepley const PetscInt *cone; 1028cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1029cd0c2139SMatthew G Knepley 1030cd0c2139SMatthew G Knepley if ((point < cStart) || (point >= cEnd)) continue; 1031cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1032cd0c2139SMatthew G Knepley if (val != -1) continue; 1033cd0c2139SMatthew G Knepley again = 2; 1034cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1035cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1036cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1037cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1038cd0c2139SMatthew G Knepley if (val != -1) { 1039cd0c2139SMatthew 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); 1040cd0c2139SMatthew G Knepley if (val > 0) { 1041cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dim);CHKERRQ(ierr); 1042cd0c2139SMatthew G Knepley } else { 1043cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dim));CHKERRQ(ierr); 1044cd0c2139SMatthew G Knepley } 1045cd0c2139SMatthew G Knepley again = 1; 1046cd0c2139SMatthew G Knepley break; 1047cd0c2139SMatthew G Knepley } 1048cd0c2139SMatthew G Knepley } 1049cd0c2139SMatthew G Knepley } 1050cd0c2139SMatthew G Knepley } 1051cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1052cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1053cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1054cd0c2139SMatthew G Knepley 1055cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1056cd0c2139SMatthew G Knepley if (val == -1) { 1057cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1058cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1059cd0c2139SMatthew G Knepley PetscBool marked = PETSC_FALSE; 1060cd0c2139SMatthew G Knepley 1061cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1062cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1063cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1064cd0c2139SMatthew G Knepley 1065cd0c2139SMatthew G Knepley if ((spoint < cStart) || (spoint >= cEnd)) continue; 1066cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1067cd0c2139SMatthew 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); 1068cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelValue(dm, "depth", point, &dep);CHKERRQ(ierr); 1069cd0c2139SMatthew G Knepley if (val > 0) { 1070cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1071cd0c2139SMatthew G Knepley } else { 1072cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1073cd0c2139SMatthew G Knepley } 1074cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1075cd0c2139SMatthew G Knepley break; 1076cd0c2139SMatthew G Knepley } 1077cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1078cd0c2139SMatthew G Knepley if (!marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1079cd0c2139SMatthew G Knepley } 1080cd0c2139SMatthew G Knepley } 1081cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1082cd0c2139SMatthew G Knepley } 1083cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1084cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1085cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1086cd0c2139SMatthew G Knepley } 1087cd0c2139SMatthew G Knepley 1088cd0c2139SMatthew G Knepley #undef __FUNCT__ 1089efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated" 1090efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 1091efa14ee0SMatthew G Knepley 1092efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 1093efa14ee0SMatthew G Knepley */ 1094830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1095efa14ee0SMatthew G Knepley { 1096fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 1097efa14ee0SMatthew G Knepley const PetscInt *subvertices; 109877d178adSMatthew G. Knepley PetscInt *pStart, *pEnd, *pMax, pSize; 1099efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1100efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1101efa14ee0SMatthew G Knepley 1102efa14ee0SMatthew G Knepley PetscFunctionBegin; 1103efa14ee0SMatthew G Knepley *numFaces = 0; 1104efa14ee0SMatthew G Knepley *nFV = 0; 1105efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1106efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 110777d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 110877d178adSMatthew G. Knepley ierr = PetscMalloc3(pSize,PetscInt,&pStart,pSize,PetscInt,&pEnd,pSize,PetscInt,&pMax);CHKERRQ(ierr); 1109*d92e47f8SMatthew 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); 1110efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 1111efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1112efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1113efa14ee0SMatthew G Knepley } 1114efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1115fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1116efa14ee0SMatthew G Knepley if (subvertexIS) { 1117efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1118efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1119efa14ee0SMatthew G Knepley } 1120efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1121efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 11220298fd71SBarry Smith PetscInt *star = NULL; 1123efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 1124efa14ee0SMatthew G Knepley 1125efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1126efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1127efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1128efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1129efa14ee0SMatthew G Knepley } 1130efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 1131efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 11320298fd71SBarry Smith PetscInt *closure = NULL; 1133efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 1134efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 1135efa14ee0SMatthew G Knepley 1136efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 113765560c7fSMatthew G Knepley if (cellLoc == 2) continue; 113882f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1139efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1140efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1141efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1142efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1143efa14ee0SMatthew G Knepley 1144efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1145efa14ee0SMatthew G Knepley ++numCorners; 1146efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1147830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 1148efa14ee0SMatthew G Knepley } 1149efa14ee0SMatthew G Knepley } 115018ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 115182f516ccSBarry 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); 1152efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 1153007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 1154007baee2SMatthew G. Knepley PetscInt numCells, nc; 1155007baee2SMatthew G. Knepley 1156efa14ee0SMatthew G Knepley ++(*numFaces); 1157efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 1158efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 1159efa14ee0SMatthew G Knepley } 1160007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1161007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 1162007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 1163007baee2SMatthew G. Knepley } 1164007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1165efa14ee0SMatthew G Knepley } 1166efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1167efa14ee0SMatthew G Knepley } 1168efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1169efa14ee0SMatthew G Knepley } 1170efa14ee0SMatthew G Knepley if (subvertexIS) { 1171efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1172efa14ee0SMatthew G Knepley } 1173efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1174efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1175efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1176efa14ee0SMatthew G Knepley } 1177efa14ee0SMatthew G Knepley 1178efa14ee0SMatthew G Knepley #undef __FUNCT__ 1179efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated" 1180830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 1181efa14ee0SMatthew G Knepley { 1182efa14ee0SMatthew G Knepley IS subvertexIS; 1183efa14ee0SMatthew G Knepley const PetscInt *subvertices; 1184efa14ee0SMatthew G Knepley PetscInt *pStart, *pEnd, *pMax; 1185efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 1186efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1187efa14ee0SMatthew G Knepley 1188efa14ee0SMatthew G Knepley PetscFunctionBegin; 1189efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1190efa14ee0SMatthew G Knepley ierr = PetscMalloc3(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd,dim+1,PetscInt,&pMax);CHKERRQ(ierr); 11910298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1192efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 1193efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1194efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1195efa14ee0SMatthew G Knepley } 1196efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1197830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 1198efa14ee0SMatthew G Knepley if (subvertexIS) { 1199efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1200efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1201efa14ee0SMatthew G Knepley } 1202efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1203efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 12040298fd71SBarry Smith PetscInt *star = NULL; 1205efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 1206efa14ee0SMatthew G Knepley 1207efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1208efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1209efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1210efa14ee0SMatthew G Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 1211efa14ee0SMatthew G Knepley } 1212efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 1213efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 12140298fd71SBarry Smith PetscInt *closure = NULL; 1215efa14ee0SMatthew G Knepley PetscInt closureSize, c; 1216efa14ee0SMatthew G Knepley PetscInt faceLoc; 1217efa14ee0SMatthew G Knepley 1218efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 1219efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 122082f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 1221efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1222efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1223efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1224efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1225efa14ee0SMatthew G Knepley 1226efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1227efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1228830e53efSMatthew G. Knepley if (vertexLoc != value) break; 1229efa14ee0SMatthew G Knepley } 1230efa14ee0SMatthew G Knepley } 1231efa14ee0SMatthew G Knepley if (c == closureSize*2) { 1232efa14ee0SMatthew G Knepley const PetscInt *support; 1233efa14ee0SMatthew G Knepley PetscInt supportSize, s; 1234efa14ee0SMatthew G Knepley 1235efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1236efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1237efa14ee0SMatthew G Knepley 1238efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 1239efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1240efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1241efa14ee0SMatthew G Knepley break; 1242efa14ee0SMatthew G Knepley } 1243efa14ee0SMatthew G Knepley } 1244efa14ee0SMatthew G Knepley } 1245efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 1246efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 1247efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1248efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1249efa14ee0SMatthew G Knepley } 1250efa14ee0SMatthew G Knepley } 1251efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1252efa14ee0SMatthew G Knepley } 1253efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1254efa14ee0SMatthew G Knepley } 1255efa14ee0SMatthew G Knepley if (subvertexIS) { 1256efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1257efa14ee0SMatthew G Knepley } 1258efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1259efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1260efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1261efa14ee0SMatthew G Knepley } 1262efa14ee0SMatthew G Knepley 1263efa14ee0SMatthew G Knepley #undef __FUNCT__ 1264766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated" 1265766ab985SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, PetscInt *subCells[], DM subdm) 1266766ab985SMatthew G. Knepley { 1267766ab985SMatthew G. Knepley const PetscInt *cone; 126827234c99SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize; 1269766ab985SMatthew G. Knepley PetscErrorCode ierr; 1270766ab985SMatthew G. Knepley 1271812bfc34SJed Brown PetscFunctionBegin; 1272c0ed958bSJed Brown *numFaces = 0; 1273c0ed958bSJed Brown *nFV = 0; 1274fed694aaSMatthew G. Knepley *subCells = NULL; 1275766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1276766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1277766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1278766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 1279766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 1280766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 1281766ab985SMatthew G. Knepley *nFV = hasLagrange ? coneSize/3 : coneSize/2; 1282766ab985SMatthew G. Knepley ierr = PetscMalloc(*numFaces *2 * sizeof(PetscInt), subCells);CHKERRQ(ierr); 1283766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1284766ab985SMatthew G. Knepley const PetscInt *cells; 1285766ab985SMatthew G. Knepley PetscInt numCells; 1286766ab985SMatthew G. Knepley 1287766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1288766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 1289766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 1290766ab985SMatthew G. Knepley } 1291766ab985SMatthew G. Knepley /* Negative face */ 1292766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 129327234c99SMatthew G. Knepley /* Not true in parallel 129427234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 1295766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 1296766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 129727234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 1298766ab985SMatthew G. Knepley } 1299766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 1300766ab985SMatthew G. Knepley /* Positive face is not included */ 1301766ab985SMatthew G. Knepley } 1302766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1303766ab985SMatthew G. Knepley } 1304766ab985SMatthew G. Knepley 1305766ab985SMatthew G. Knepley #undef __FUNCT__ 1306766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated" 1307766ab985SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, PetscBool hasLagrange, DMLabel subpointMap, DM subdm) 1308766ab985SMatthew G. Knepley { 1309766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 1310766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 1311766ab985SMatthew G. Knepley PetscErrorCode ierr; 1312766ab985SMatthew G. Knepley 1313812bfc34SJed Brown PetscFunctionBegin; 1314766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1315766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1316766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1317766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 1318766ab985SMatthew G. Knepley ierr = PetscMalloc2(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd);CHKERRQ(ierr); 1319766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 1320766ab985SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1321766ab985SMatthew G. Knepley } 1322766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1323766ab985SMatthew G. Knepley const PetscInt *cone; 1324766ab985SMatthew G. Knepley PetscInt *closure = NULL; 1325766ab985SMatthew G. Knepley PetscInt coneSize, closureSize, cl; 1326766ab985SMatthew G. Knepley 1327766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 1328766ab985SMatthew G. Knepley if (hasLagrange) { 1329766ab985SMatthew G. Knepley if (coneSize != 3) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 1330766ab985SMatthew G. Knepley } else { 1331766ab985SMatthew G. Knepley if (coneSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 1332766ab985SMatthew G. Knepley } 1333766ab985SMatthew G. Knepley /* Negative face */ 1334766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1335766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1336766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1337766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 1338766ab985SMatthew G. Knepley 1339766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 1340766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1341766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1342766ab985SMatthew G. Knepley break; 1343766ab985SMatthew G. Knepley } 1344766ab985SMatthew G. Knepley } 1345766ab985SMatthew G. Knepley } 1346766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1347766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 1348766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 1349766ab985SMatthew G. Knepley const PetscInt *support; 1350766ab985SMatthew G. Knepley PetscInt supportSize, s; 1351766ab985SMatthew G. Knepley 1352766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 1353766ab985SMatthew G. Knepley if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); 1354766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 1355766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 1356766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1357766ab985SMatthew G. Knepley } 1358766ab985SMatthew G. Knepley } 1359766ab985SMatthew G. Knepley } 1360766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 1361766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1362766ab985SMatthew G. Knepley } 1363766ab985SMatthew G. Knepley 1364766ab985SMatthew G. Knepley #undef __FUNCT__ 1365e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation" 1366e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 1367e6ccafaeSMatthew G Knepley { 136882f516ccSBarry Smith MPI_Comm comm; 1369e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 1370e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 1371e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 1372e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1373e6ccafaeSMatthew G Knepley 137482f516ccSBarry Smith PetscFunctionBegin; 137582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1376e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &cellDim);CHKERRQ(ierr); 1377e6ccafaeSMatthew G Knepley if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 1378e6ccafaeSMatthew G Knepley 1379e6ccafaeSMatthew G Knepley if (cellDim == numCorners-1) { 1380e6ccafaeSMatthew G Knepley /* Simplices */ 1381e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 1382e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1383e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 1384e6ccafaeSMatthew G Knepley /* Quadratic line */ 1385e6ccafaeSMatthew G Knepley faceSize = 1; 1386e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1387e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 1388e6ccafaeSMatthew G Knepley /* Quads */ 1389e6ccafaeSMatthew G Knepley faceSize = 2; 1390e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 1391e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1392e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 1393e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1394e6ccafaeSMatthew G Knepley } else { 1395e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 1396e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 1397e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 1398e6ccafaeSMatthew G Knepley } 1399e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 1400e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 1401e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 1402e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 1403e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 1404e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1405e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 1406e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 1407e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 1408e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 1409e6ccafaeSMatthew G Knepley }; 1410e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 1411e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 1412e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 1413e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 1414e6ccafaeSMatthew G Knepley }; 1415e6ccafaeSMatthew G Knepley 1416e6ccafaeSMatthew G Knepley faceSize = faceSizeTri; 1417e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 1418e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 1419e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 1420e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 1421e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1422e6ccafaeSMatthew G Knepley 1423e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 1424e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 1425e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 1426e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 1427e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 1428e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1429e6ccafaeSMatthew G Knepley break; 1430e6ccafaeSMatthew G Knepley } 1431e6ccafaeSMatthew G Knepley } 1432e6ccafaeSMatthew G Knepley } 1433e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1434e6ccafaeSMatthew G Knepley break; 1435e6ccafaeSMatthew G Knepley } 1436e6ccafaeSMatthew G Knepley } 1437e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 1438e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1439e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1440e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 1441e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 1442e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 1443e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 1444e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 1445e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1446e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 1447e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 1448e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 1449e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 1450e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 1451e6ccafaeSMatthew G Knepley }; 1452e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 1453e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 1454e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 1455e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 1456e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 1457e6ccafaeSMatthew G Knepley }; 1458e6ccafaeSMatthew G Knepley 1459e6ccafaeSMatthew G Knepley faceSize = faceSizeQuad; 1460e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 1461e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 1462e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 1463e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 1464e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1465e6ccafaeSMatthew G Knepley 1466e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 1467e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 1468e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 1469e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 1470e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 1471e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1472e6ccafaeSMatthew G Knepley break; 1473e6ccafaeSMatthew G Knepley } 1474e6ccafaeSMatthew G Knepley } 1475e6ccafaeSMatthew G Knepley } 1476e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1477e6ccafaeSMatthew G Knepley break; 1478e6ccafaeSMatthew G Knepley } 1479e6ccafaeSMatthew G Knepley } 1480e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 1481e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1482e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1483e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 1484e6ccafaeSMatthew G Knepley /* Hexes 1485e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 1486e6ccafaeSMatthew G Knepley pointing up at the second. 1487e6ccafaeSMatthew G Knepley 1488e6ccafaeSMatthew G Knepley 7---6 1489e6ccafaeSMatthew G Knepley /| /| 1490e6ccafaeSMatthew G Knepley 4---5 | 1491e6ccafaeSMatthew G Knepley | 3-|-2 1492e6ccafaeSMatthew G Knepley |/ |/ 1493e6ccafaeSMatthew G Knepley 0---1 1494e6ccafaeSMatthew G Knepley 1495e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 1496e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 1497e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 1498e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1499e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 1500e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 1501e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 1502e6ccafaeSMatthew G Knepley 0, 1, 4, 5, /* front */ 1503e6ccafaeSMatthew G Knepley 1, 2, 5, 6, /* right */ 1504e6ccafaeSMatthew G Knepley 2, 3, 6, 7, /* back */ 1505e6ccafaeSMatthew G Knepley 0, 3, 4, 7, /* left */ 1506e6ccafaeSMatthew G Knepley }; 1507e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 1508e6ccafaeSMatthew G Knepley 3, 2, 1, 0, /* bottom */ 1509e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 1510e6ccafaeSMatthew G Knepley 0, 1, 5, 4, /* front */ 1511e6ccafaeSMatthew G Knepley 1, 2, 6, 5, /* right */ 1512e6ccafaeSMatthew G Knepley 2, 3, 7, 6, /* back */ 1513e6ccafaeSMatthew G Knepley 3, 0, 4, 7, /* left */ 1514e6ccafaeSMatthew G Knepley }; 1515e6ccafaeSMatthew G Knepley 1516e6ccafaeSMatthew G Knepley faceSize = faceSizeHex; 1517e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 1518e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 1519e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 1520e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 1521e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1522e6ccafaeSMatthew G Knepley 1523e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 1524e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 1525e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 1526e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 1527e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 1528e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 1529e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 1530e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1531e6ccafaeSMatthew G Knepley break; 1532e6ccafaeSMatthew G Knepley } 1533e6ccafaeSMatthew G Knepley } 1534e6ccafaeSMatthew G Knepley } 1535e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1536e6ccafaeSMatthew G Knepley break; 1537e6ccafaeSMatthew G Knepley } 1538e6ccafaeSMatthew G Knepley } 1539e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 1540e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1541e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1542e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 1543e6ccafaeSMatthew G Knepley /* Quadratic tet */ 1544e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 1545e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 1546e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 1547e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1548e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 1549e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 1550e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 1551e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 1552e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 1553e6ccafaeSMatthew G Knepley }; 1554e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 1555e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 1556e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 1557e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 1558e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 1559e6ccafaeSMatthew G Knepley }; 1560e6ccafaeSMatthew G Knepley 1561e6ccafaeSMatthew G Knepley faceSize = faceSizeTet; 1562e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 1563e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 1564e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 1565e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 1566e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1567e6ccafaeSMatthew G Knepley 1568e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 1569e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 1570e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 1571e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 1572e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 1573e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 1574e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 1575e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1576e6ccafaeSMatthew G Knepley break; 1577e6ccafaeSMatthew G Knepley } 1578e6ccafaeSMatthew G Knepley } 1579e6ccafaeSMatthew G Knepley } 1580e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1581e6ccafaeSMatthew G Knepley break; 1582e6ccafaeSMatthew G Knepley } 1583e6ccafaeSMatthew G Knepley } 1584e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 1585e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1586e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1587e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 1588e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 1589e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 1590e6ccafaeSMatthew G Knepley pointing up at the second. 1591e6ccafaeSMatthew G Knepley 1592e6ccafaeSMatthew G Knepley 7---6 1593e6ccafaeSMatthew G Knepley /| /| 1594e6ccafaeSMatthew G Knepley 4---5 | 1595e6ccafaeSMatthew G Knepley | 3-|-2 1596e6ccafaeSMatthew G Knepley |/ |/ 1597e6ccafaeSMatthew G Knepley 0---1 1598e6ccafaeSMatthew G Knepley 1599e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 1600e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 1601e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 1602e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1603e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 1604e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 1605e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 1606e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 1607e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 1608e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 1609e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 1610e6ccafaeSMatthew G Knepley }; 1611e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 1612e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 1613e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 1614e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 1615e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 1616e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 1617e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 1618e6ccafaeSMatthew G Knepley }; 1619e6ccafaeSMatthew G Knepley 1620e6ccafaeSMatthew G Knepley faceSize = faceSizeQuadHex; 1621e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 1622e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 1623e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 1624e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 1625e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1626e6ccafaeSMatthew G Knepley 1627e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 1628e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 1629e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 1630e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 1631e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 1632e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 1633e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 1634e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1635e6ccafaeSMatthew G Knepley break; 1636e6ccafaeSMatthew G Knepley } 1637e6ccafaeSMatthew G Knepley } 1638e6ccafaeSMatthew G Knepley } 1639e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1640e6ccafaeSMatthew G Knepley break; 1641e6ccafaeSMatthew G Knepley } 1642e6ccafaeSMatthew G Knepley } 1643e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 1644e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1645e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1646e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 1647e6ccafaeSMatthew G Knepley if (!posOrient) { 1648e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 1649e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 1650e6ccafaeSMatthew G Knepley } else { 1651e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 1652e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 1653e6ccafaeSMatthew G Knepley } 1654e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 1655e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1656e6ccafaeSMatthew G Knepley } 1657e6ccafaeSMatthew G Knepley 1658e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1659e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace" 1660e6ccafaeSMatthew G Knepley /* 1661e6ccafaeSMatthew G Knepley Given a cell and a face, as a set of vertices, 1662e6ccafaeSMatthew G Knepley return the oriented face, as a set of vertices, in faceVertices 1663e6ccafaeSMatthew G Knepley The orientation is such that the face normal points out of the cell 1664e6ccafaeSMatthew G Knepley */ 1665e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 1666e6ccafaeSMatthew G Knepley { 16670298fd71SBarry Smith const PetscInt *cone = NULL; 1668e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 1669e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 1670e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1671e6ccafaeSMatthew G Knepley 1672e6ccafaeSMatthew G Knepley PetscFunctionBegin; 1673e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 1674e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 1675e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 1676e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1677e6ccafaeSMatthew G Knepley 1678e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 1679e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 1680e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 1681e6ccafaeSMatthew G Knepley } 1682e6ccafaeSMatthew G Knepley } 1683e6ccafaeSMatthew G Knepley if (found) { 1684e6ccafaeSMatthew G Knepley indices[v2] = v; 1685e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 1686e6ccafaeSMatthew G Knepley ++v2; 1687e6ccafaeSMatthew G Knepley } else { 1688e6ccafaeSMatthew G Knepley oppositeVertex = v; 1689e6ccafaeSMatthew G Knepley } 1690e6ccafaeSMatthew G Knepley } 1691e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 1692e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1693e6ccafaeSMatthew G Knepley } 1694e6ccafaeSMatthew G Knepley 1695e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1696cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal" 1697e6ccafaeSMatthew G Knepley /* 1698cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 1699e6ccafaeSMatthew G Knepley 1700e6ccafaeSMatthew G Knepley Not collective 1701e6ccafaeSMatthew G Knepley 1702e6ccafaeSMatthew G Knepley Input Parameters: 1703e6ccafaeSMatthew G Knepley + dm - The DMPlex 1704e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 1705e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 1706e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 1707e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 1708e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 1709e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 1710e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 1711e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 1712e6ccafaeSMatthew G Knepley 1713e6ccafaeSMatthew G Knepley Output Parameters: 1714e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 1715e6ccafaeSMatthew G Knepley 1716e6ccafaeSMatthew G Knepley Level: developer 1717e6ccafaeSMatthew G Knepley */ 1718cd0c2139SMatthew 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) 1719e6ccafaeSMatthew G Knepley { 172082f516ccSBarry Smith MPI_Comm comm; 1721e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 1722e6ccafaeSMatthew G Knepley const PetscInt *faces; 1723e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 1724e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1725e6ccafaeSMatthew G Knepley 1726e6ccafaeSMatthew G Knepley PetscFunctionBegin; 172782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1728e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 1729e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 1730e6ccafaeSMatthew G Knepley #if 0 1731e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 1732e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 1733e6ccafaeSMatthew G Knepley #else 1734e6ccafaeSMatthew G Knepley { 1735e6ccafaeSMatthew G Knepley PetscInt f; 1736e6ccafaeSMatthew G Knepley 1737e6ccafaeSMatthew G Knepley numFaces = 0; 1738e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 1739e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 1740e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 1741e6ccafaeSMatthew G Knepley 1742e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 1743e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 1744e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 1745e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 1746e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 1747e6ccafaeSMatthew G Knepley PetscInt v; 1748e6ccafaeSMatthew G Knepley 1749e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 1750e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 1751e6ccafaeSMatthew G Knepley } 1752e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 1753e6ccafaeSMatthew G Knepley } 1754e6ccafaeSMatthew G Knepley if (d == dof) { 1755e6ccafaeSMatthew G Knepley numFaces = 1; 1756e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 1757e6ccafaeSMatthew G Knepley } 1758e6ccafaeSMatthew G Knepley } 1759e6ccafaeSMatthew G Knepley } 1760e6ccafaeSMatthew G Knepley #endif 1761e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 1762e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 1763e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 1764766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 1765e6ccafaeSMatthew G Knepley } else { 1766e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 1767e6ccafaeSMatthew G Knepley PetscBool posOriented; 1768e6ccafaeSMatthew G Knepley 1769e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 1770e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 1771e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 1772e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 1773e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 1774e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 1775e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 1776e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 1777e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 1778e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 1779e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 1780e6ccafaeSMatthew G Knepley break; 1781e6ccafaeSMatthew G Knepley } 1782e6ccafaeSMatthew G Knepley } 1783e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 1784e6ccafaeSMatthew G Knepley } 1785e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 1786e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 1787e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 1788e6ccafaeSMatthew G Knepley ++(*newFacePoint); 1789e6ccafaeSMatthew G Knepley } 1790ef07cca7SMatthew G. Knepley #if 0 1791e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 1792ef07cca7SMatthew G. Knepley #else 1793ef07cca7SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 1794ef07cca7SMatthew G. Knepley #endif 1795e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1796e6ccafaeSMatthew G Knepley } 1797e6ccafaeSMatthew G Knepley 1798e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1799e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated" 1800830e53efSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, const char vertexLabelName[], PetscInt value, DM subdm) 1801e6ccafaeSMatthew G Knepley { 180282f516ccSBarry Smith MPI_Comm comm; 1803efa14ee0SMatthew G Knepley DMLabel vertexLabel, subpointMap; 1804efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 1805efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 1806efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 1807fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 1808efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 1809e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1810e6ccafaeSMatthew G Knepley 1811e6ccafaeSMatthew G Knepley PetscFunctionBegin; 181282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1813efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 1814efa14ee0SMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 1815efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 1816efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 1817fed694aaSMatthew G. Knepley if (vertexLabelName) { 1818efa14ee0SMatthew G Knepley ierr = DMPlexGetLabel(dm, vertexLabelName, &vertexLabel);CHKERRQ(ierr); 1819830e53efSMatthew G. Knepley ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr); 1820fed694aaSMatthew G. Knepley } 1821efa14ee0SMatthew G Knepley /* Setup chart */ 1822efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 1823efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 1824efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 1825efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 1826e6ccafaeSMatthew G Knepley /* Set cone sizes */ 1827e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 1828efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 1829e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 1830efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 1831efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 1832efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 1833efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 1834e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 1835e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 1836e6ccafaeSMatthew G Knepley } 1837e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 1838e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 1839e6ccafaeSMatthew G Knepley } 1840e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 1841e6ccafaeSMatthew G Knepley /* Create face cones */ 1842efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 18430298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 1844efa14ee0SMatthew G Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 1845e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 1846e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 1847efa14ee0SMatthew G Knepley const PetscInt subcell = c; 18480298fd71SBarry Smith PetscInt *closure = NULL; 1849efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 1850e6ccafaeSMatthew G Knepley 1851e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1852efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1853efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1854e6ccafaeSMatthew G Knepley PetscInt subVertex; 1855e6ccafaeSMatthew G Knepley 1856efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 1857efa14ee0SMatthew G Knepley ++numCorners; 1858efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 1859efa14ee0SMatthew G Knepley if (subVertex >= 0) { 1860efa14ee0SMatthew G Knepley closure[faceSize] = point; 186165560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 1862e6ccafaeSMatthew G Knepley ++faceSize; 1863e6ccafaeSMatthew G Knepley } 1864e6ccafaeSMatthew G Knepley } 1865e6ccafaeSMatthew G Knepley } 1866efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 1867efa14ee0SMatthew G Knepley if (faceSize == nFV) { 1868cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 1869e6ccafaeSMatthew G Knepley } 187065560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1871e6ccafaeSMatthew G Knepley } 1872efa14ee0SMatthew G Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 1873e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 1874e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 1875e6ccafaeSMatthew G Knepley /* Build coordinates */ 1876efa14ee0SMatthew G Knepley { 1877efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 1878efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 1879efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 1880285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 1881efa14ee0SMatthew G Knepley 1882e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 1883e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 1884e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 1885285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 1886285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 1887285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 1888efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 1889efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 1890efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 1891efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 1892efa14ee0SMatthew G Knepley PetscInt dof; 1893efa14ee0SMatthew G Knepley 1894efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 1895efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 1896285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 1897e6ccafaeSMatthew G Knepley } 1898e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 1899e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 1900e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 1901e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 1902e6ccafaeSMatthew G Knepley ierr = VecSetFromOptions(subCoordinates);CHKERRQ(ierr); 1903830e53efSMatthew G. Knepley if (coordSize) { 1904e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 1905e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 1906efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 1907efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 1908efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 1909efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 1910e6ccafaeSMatthew G Knepley 1911e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 1912e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 1913efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 1914efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 1915efa14ee0SMatthew 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); 1916e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 1917e6ccafaeSMatthew G Knepley } 1918e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 1919e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 19203b399e24SMatthew G. Knepley } 1921e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 1922e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 1923e6ccafaeSMatthew G Knepley } 1924efa14ee0SMatthew G Knepley /* Cleanup */ 1925efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 1926efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1927efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 1928efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 1929e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1930e6ccafaeSMatthew G Knepley } 1931e6ccafaeSMatthew G Knepley 1932e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1933e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated" 1934830e53efSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, const char vertexLabelName[], PetscInt value, DM subdm) 1935e6ccafaeSMatthew G Knepley { 193682f516ccSBarry Smith MPI_Comm comm; 1937e6ccafaeSMatthew G Knepley DMLabel subpointMap, vertexLabel; 1938efa14ee0SMatthew G Knepley IS *subpointIS; 1939efa14ee0SMatthew G Knepley const PetscInt **subpoints; 1940efa14ee0SMatthew G Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew; 1941efa14ee0SMatthew G Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 1942e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1943e6ccafaeSMatthew G Knepley 1944e6ccafaeSMatthew G Knepley PetscFunctionBegin; 194582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1946efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 1947e6ccafaeSMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 1948efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 1949efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 1950fed694aaSMatthew G. Knepley if (vertexLabelName) { 1951e6ccafaeSMatthew G Knepley ierr = DMPlexGetLabel(dm, vertexLabelName, &vertexLabel);CHKERRQ(ierr); 1952830e53efSMatthew G. Knepley ierr = DMPlexMarkSubmesh_Interpolated(dm, vertexLabel, value, subpointMap, subdm);CHKERRQ(ierr); 1953fed694aaSMatthew G. Knepley } 1954efa14ee0SMatthew G Knepley /* Setup chart */ 1955efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1956efa14ee0SMatthew G Knepley ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr); 1957e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 1958e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 1959e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 1960e6ccafaeSMatthew G Knepley } 1961e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 1962e6ccafaeSMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 1963e6ccafaeSMatthew G Knepley /* Set cone sizes */ 1964e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 1965e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 1966e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 1967e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 1968e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 1969e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 1970e6ccafaeSMatthew G Knepley ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 1971e6ccafaeSMatthew G Knepley } 1972e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 1973e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 1974e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 1975e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 1976e6ccafaeSMatthew G Knepley const PetscInt *cone; 1977e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 1978e6ccafaeSMatthew G Knepley 1979e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1980e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 1981e6ccafaeSMatthew G Knepley if (d == dim) { 1982e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1983e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 1984e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 1985e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 1986e6ccafaeSMatthew G Knepley } 1987e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 1988e6ccafaeSMatthew G Knepley } 1989e6ccafaeSMatthew G Knepley } 1990e6ccafaeSMatthew G Knepley } 1991e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 1992e6ccafaeSMatthew G Knepley /* Set cones */ 19930298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 1994e6ccafaeSMatthew G Knepley ierr = PetscMalloc(maxConeSize * sizeof(PetscInt), &coneNew);CHKERRQ(ierr); 1995e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 1996e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 1997e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 1998e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 1999e6ccafaeSMatthew G Knepley const PetscInt *cone; 2000e6ccafaeSMatthew G Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2001e6ccafaeSMatthew G Knepley 2002e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2003e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2004e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2005e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2006e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 2007e6ccafaeSMatthew G Knepley if (subc >= 0) coneNew[coneSizeNew++] = firstSubPoint[d-1] + subc; 2008e6ccafaeSMatthew G Knepley } 2009e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2010e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 2011e6ccafaeSMatthew G Knepley } 2012e6ccafaeSMatthew G Knepley } 2013e6ccafaeSMatthew G Knepley ierr = PetscFree(coneNew);CHKERRQ(ierr); 2014e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2015e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2016e6ccafaeSMatthew G Knepley /* Build coordinates */ 2017e6ccafaeSMatthew G Knepley { 2018e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 2019e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 2020e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 2021285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2022e6ccafaeSMatthew G Knepley 2023e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2024e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2025e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2026285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2027285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2028285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2029e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2030e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2031e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2032e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2033e6ccafaeSMatthew G Knepley PetscInt dof; 2034e6ccafaeSMatthew G Knepley 2035e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2036e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2037285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2038e6ccafaeSMatthew G Knepley } 2039e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2040e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2041e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2042e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2043e6ccafaeSMatthew G Knepley ierr = VecSetFromOptions(subCoordinates);CHKERRQ(ierr); 2044e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2045e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2046e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2047e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2048e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2049e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2050e6ccafaeSMatthew G Knepley 2051e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2052e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2053e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2054e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2055e6ccafaeSMatthew 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); 2056efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2057e6ccafaeSMatthew G Knepley } 2058e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2059e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2060e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2061e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2062e6ccafaeSMatthew G Knepley } 2063efa14ee0SMatthew G Knepley /* Cleanup */ 2064e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2065e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2066e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2067e6ccafaeSMatthew G Knepley } 2068efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2069e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2070e6ccafaeSMatthew G Knepley } 2071e6ccafaeSMatthew G Knepley 2072e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2073e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh" 2074830e53efSMatthew G. Knepley /*@C 2075e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 2076e6ccafaeSMatthew G Knepley 2077e6ccafaeSMatthew G Knepley Input Parameters: 2078e6ccafaeSMatthew G Knepley + dm - The original mesh 2079830e53efSMatthew G. Knepley . vertexLabel - The DMLabel marking vertices contained in the surface 2080830e53efSMatthew G. Knepley - value - The label value to use 2081e6ccafaeSMatthew G Knepley 2082e6ccafaeSMatthew G Knepley Output Parameter: 2083e6ccafaeSMatthew G Knepley . subdm - The surface mesh 2084e6ccafaeSMatthew G Knepley 2085e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2086e6ccafaeSMatthew G Knepley 2087e6ccafaeSMatthew G Knepley Level: developer 2088e6ccafaeSMatthew G Knepley 2089e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue() 2090830e53efSMatthew G. Knepley @*/ 2091830e53efSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, const char vertexLabel[], PetscInt value, DM *subdm) 2092e6ccafaeSMatthew G Knepley { 2093e6ccafaeSMatthew G Knepley PetscInt dim, depth; 2094e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2095e6ccafaeSMatthew G Knepley 2096e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2097e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2098766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 2099e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2100e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 210182f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2102e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2103e6ccafaeSMatthew G Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2104e6ccafaeSMatthew G Knepley if (depth == dim) { 2105830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2106e6ccafaeSMatthew G Knepley } else { 2107830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2108e6ccafaeSMatthew G Knepley } 2109e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2110e6ccafaeSMatthew G Knepley } 2111e6ccafaeSMatthew G Knepley 2112e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2113aca35d17SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal" 2114aca35d17SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 2115aca35d17SMatthew G. Knepley { 2116aca35d17SMatthew G. Knepley PetscInt subPoint; 2117aca35d17SMatthew G. Knepley PetscErrorCode ierr; 2118aca35d17SMatthew G. Knepley 2119aca35d17SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 2120aca35d17SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 2121aca35d17SMatthew G. Knepley } 2122aca35d17SMatthew G. Knepley 2123aca35d17SMatthew G. Knepley #undef __FUNCT__ 2124766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated" 2125766ab985SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, DM subdm) 2126766ab985SMatthew G. Knepley { 2127766ab985SMatthew G. Knepley MPI_Comm comm; 2128766ab985SMatthew G. Knepley DMLabel subpointMap; 2129766ab985SMatthew G. Knepley IS subvertexIS; 2130766ab985SMatthew G. Knepley const PetscInt *subVertices; 2131fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 2132766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 213387feddfdSMatthew G. Knepley PetscInt cMax, c, f; 2134766ab985SMatthew G. Knepley PetscErrorCode ierr; 2135766ab985SMatthew G. Knepley 2136766ab985SMatthew G. Knepley PetscFunctionBegin; 2137766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 2138766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2139766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2140766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2141766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 2142766ab985SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 2143766ab985SMatthew G. Knepley /* Setup chart */ 2144766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2145766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2146766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2147766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2148766ab985SMatthew G. Knepley /* Set cone sizes */ 2149766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 2150766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 2151766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 2152766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2153766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2154766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2155766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2156766ab985SMatthew G. Knepley } 2157766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2158766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2159766ab985SMatthew G. Knepley } 2160766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2161766ab985SMatthew G. Knepley /* Create face cones */ 2162766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 216387feddfdSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2164766ab985SMatthew G. Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2165766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2166766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 2167766ab985SMatthew G. Knepley const PetscInt subcell = c; 216887feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 216987feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 2170766ab985SMatthew G. Knepley 217187feddfdSMatthew G. Knepley if (cell < cMax) continue; 217287feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 217387feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 217487feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 217587feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 217687feddfdSMatthew G. Knepley } 217787feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 217887feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 217987feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 218027234c99SMatthew G. Knepley /* Not true in parallel 218127234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 218287feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 218387feddfdSMatthew G. Knepley PetscInt negsubcell; 2184766ab985SMatthew G. Knepley 218587feddfdSMatthew G. Knepley if (cells[p] >= cMax) continue; 218687feddfdSMatthew G. Knepley /* I know this is a crap search */ 218787feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 218887feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 2189766ab985SMatthew G. Knepley } 219087feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 219187feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 2192766ab985SMatthew G. Knepley } 219387feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 219487feddfdSMatthew G. Knepley ++newFacePoint; 2195766ab985SMatthew G. Knepley } 2196766ab985SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2197766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2198766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2199766ab985SMatthew G. Knepley /* Build coordinates */ 2200766ab985SMatthew G. Knepley { 2201766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2202766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2203766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2204285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2205766ab985SMatthew G. Knepley 2206766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2207766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2208766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2209285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2210285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2211285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2212766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2213766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2214766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2215766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2216766ab985SMatthew G. Knepley PetscInt dof; 2217766ab985SMatthew G. Knepley 2218766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2219766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2220285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2221766ab985SMatthew G. Knepley } 2222766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2223766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2224766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2225766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2226766ab985SMatthew G. Knepley ierr = VecSetFromOptions(subCoordinates);CHKERRQ(ierr); 2227766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2228766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2229766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2230766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2231766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2232766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 2233766ab985SMatthew G. Knepley 2234766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2235766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2236766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2237766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2238766ab985SMatthew 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); 2239766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2240766ab985SMatthew G. Knepley } 2241766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2242766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2243766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2244766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2245766ab985SMatthew G. Knepley } 2246aca35d17SMatthew G. Knepley /* Build SF */ 2247aca35d17SMatthew G. Knepley CHKMEMQ; 2248aca35d17SMatthew G. Knepley { 2249aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 2250aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 2251bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 2252aca35d17SMatthew G. Knepley const PetscInt *localPoints; 2253bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 2254bdcf2095SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, pStart, pEnd, p, vStart, vEnd; 2255bdcf2095SMatthew G. Knepley PetscMPIInt rank; 2256aca35d17SMatthew G. Knepley 2257bdcf2095SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 2258aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 2259aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 2260aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2261aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 2262aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 2263aca35d17SMatthew G. Knepley if (numRoots >= 0) { 2264aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 2265bdcf2095SMatthew G. Knepley ierr = PetscMalloc2(pEnd-pStart,PetscSFNode,&newLocalPoints,numRoots,PetscSFNode,&newOwners);CHKERRQ(ierr); 2266bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 2267bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 2268bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 2269bdcf2095SMatthew G. Knepley } 2270aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2271aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 2272bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2273aca35d17SMatthew G. Knepley 2274aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 2275bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 2276bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 2277bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 2278bdcf2095SMatthew G. Knepley ++numSubLeaves; 2279aca35d17SMatthew G. Knepley } 2280bdcf2095SMatthew G. Knepley for (p = 0; p < numRoots; ++p) { 2281bdcf2095SMatthew G. Knepley newOwners[p].rank = -3; 2282bdcf2095SMatthew G. Knepley newOwners[p].index = -3; 2283bdcf2095SMatthew G. Knepley } 2284bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2285bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2286bdcf2095SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2287bdcf2095SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2288aca35d17SMatthew G. Knepley ierr = PetscMalloc(numSubLeaves * sizeof(PetscInt), &slocalPoints);CHKERRQ(ierr); 2289aca35d17SMatthew G. Knepley ierr = PetscMalloc(numSubLeaves * sizeof(PetscSFNode), &sremotePoints);CHKERRQ(ierr); 2290aca35d17SMatthew G. Knepley for (l = 0, sl = 0; l < numLeaves; ++l) { 2291bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 2292bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2293aca35d17SMatthew G. Knepley 2294aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 2295aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 2296bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 2297bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 2298bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 2299bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 2300aca35d17SMatthew G. Knepley ++sl; 2301aca35d17SMatthew G. Knepley } 2302bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 2303aca35d17SMatthew G. Knepley if (sl != numSubLeaves) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d != %d", sl, numSubLeaves); 2304aca35d17SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, numSubLeaves, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 2305aca35d17SMatthew G. Knepley } 2306aca35d17SMatthew G. Knepley } 2307aca35d17SMatthew G. Knepley CHKMEMQ; 2308766ab985SMatthew G. Knepley /* Cleanup */ 2309766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2310766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2311766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 2312766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2313766ab985SMatthew G. Knepley } 2314766ab985SMatthew G. Knepley 2315766ab985SMatthew G. Knepley #undef __FUNCT__ 2316766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated" 2317766ab985SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, PetscBool hasLagrange, DM subdm) 2318766ab985SMatthew G. Knepley { 2319766ab985SMatthew G. Knepley MPI_Comm comm; 2320766ab985SMatthew G. Knepley DMLabel subpointMap; 2321766ab985SMatthew G. Knepley IS *subpointIS; 2322766ab985SMatthew G. Knepley const PetscInt **subpoints; 2323766ab985SMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew; 2324766ab985SMatthew G. Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2325766ab985SMatthew G. Knepley PetscErrorCode ierr; 2326766ab985SMatthew G. Knepley 2327766ab985SMatthew G. Knepley PetscFunctionBegin; 2328766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2329766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2330766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2331766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2332766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 2333766ab985SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, hasLagrange, subpointMap, subdm);CHKERRQ(ierr); 2334766ab985SMatthew G. Knepley /* Setup chart */ 2335766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2336766ab985SMatthew G. Knepley ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr); 2337766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2338766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2339766ab985SMatthew G. Knepley totSubPoints += numSubPoints[d]; 2340766ab985SMatthew G. Knepley } 2341766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2342766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2343766ab985SMatthew G. Knepley /* Set cone sizes */ 2344766ab985SMatthew G. Knepley firstSubPoint[dim] = 0; 2345766ab985SMatthew G. Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2346766ab985SMatthew G. Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2347766ab985SMatthew G. Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2348766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2349766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2350766ab985SMatthew G. Knepley ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2351766ab985SMatthew G. Knepley } 2352766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2353766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2354766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2355766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2356766ab985SMatthew G. Knepley const PetscInt *cone; 2357766ab985SMatthew G. Knepley PetscInt coneSize, coneSizeNew, c, val; 2358766ab985SMatthew G. Knepley 2359766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2360766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2361766ab985SMatthew G. Knepley if (d == dim) { 2362766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2363766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2364766ab985SMatthew G. Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2365766ab985SMatthew G. Knepley if (val >= 0) coneSizeNew++; 2366766ab985SMatthew G. Knepley } 2367766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2368766ab985SMatthew G. Knepley } 2369766ab985SMatthew G. Knepley } 2370766ab985SMatthew G. Knepley } 2371766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2372766ab985SMatthew G. Knepley /* Set cones */ 2373766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2374766ab985SMatthew G. Knepley ierr = PetscMalloc(maxConeSize * sizeof(PetscInt), &coneNew);CHKERRQ(ierr); 2375766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2376766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2377766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2378766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2379766ab985SMatthew G. Knepley const PetscInt *cone; 2380766ab985SMatthew G. Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2381766ab985SMatthew G. Knepley 2382766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2383766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2384766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2385766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2386766ab985SMatthew G. Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 2387766ab985SMatthew G. Knepley if (subc >= 0) coneNew[coneSizeNew++] = firstSubPoint[d-1] + subc; 2388766ab985SMatthew G. Knepley } 2389766ab985SMatthew G. Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2390766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 2391766ab985SMatthew G. Knepley } 2392766ab985SMatthew G. Knepley } 2393766ab985SMatthew G. Knepley ierr = PetscFree(coneNew);CHKERRQ(ierr); 2394766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2395766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2396766ab985SMatthew G. Knepley /* Build coordinates */ 2397766ab985SMatthew G. Knepley { 2398766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2399766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2400766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2401285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2402766ab985SMatthew G. Knepley 2403766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2404766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2405766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2406285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2407285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2408285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2409766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2410766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2411766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 2412766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2413766ab985SMatthew G. Knepley PetscInt dof; 2414766ab985SMatthew G. Knepley 2415766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2416766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2417285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2418766ab985SMatthew G. Knepley } 2419766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2420766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2421766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2422766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2423766ab985SMatthew G. Knepley ierr = VecSetFromOptions(subCoordinates);CHKERRQ(ierr); 2424766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2425766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2426766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2427766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 2428766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2429766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 2430766ab985SMatthew G. Knepley 2431766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2432766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2433766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2434766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2435766ab985SMatthew 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); 2436766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2437766ab985SMatthew G. Knepley } 2438766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2439766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2440766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2441766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2442766ab985SMatthew G. Knepley } 2443766ab985SMatthew G. Knepley /* Cleanup */ 2444766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2445766ab985SMatthew G. Knepley ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2446766ab985SMatthew G. Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2447766ab985SMatthew G. Knepley } 2448766ab985SMatthew G. Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2449766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2450766ab985SMatthew G. Knepley } 2451766ab985SMatthew G. Knepley 2452766ab985SMatthew G. Knepley #undef __FUNCT__ 2453766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh" 2454766ab985SMatthew G. Knepley /* 2455766ab985SMatthew G. Knepley DMPlexCreateCohesiveSubmesh - Extract from a mesh with cohesive cells the hypersurface defined by one face of the cells. 2456766ab985SMatthew G. Knepley 2457766ab985SMatthew G. Knepley Input Parameters: 2458766ab985SMatthew G. Knepley + dm - The original mesh 2459766ab985SMatthew G. Knepley - hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 2460766ab985SMatthew G. Knepley 2461766ab985SMatthew G. Knepley Output Parameter: 2462766ab985SMatthew G. Knepley . subdm - The surface mesh 2463766ab985SMatthew G. Knepley 2464766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2465766ab985SMatthew G. Knepley 2466766ab985SMatthew G. Knepley Level: developer 2467766ab985SMatthew G. Knepley 2468766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 2469766ab985SMatthew G. Knepley */ 2470766ab985SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, DM *subdm) 2471766ab985SMatthew G. Knepley { 2472766ab985SMatthew G. Knepley PetscInt dim, depth; 2473766ab985SMatthew G. Knepley PetscErrorCode ierr; 2474766ab985SMatthew G. Knepley 2475766ab985SMatthew G. Knepley PetscFunctionBegin; 2476766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2477766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 2478766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2479766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2480766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2481766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2482766ab985SMatthew G. Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2483766ab985SMatthew G. Knepley if (depth == dim) { 2484766ab985SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, hasLagrange, *subdm);CHKERRQ(ierr); 2485766ab985SMatthew G. Knepley } else { 2486766ab985SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, *subdm);CHKERRQ(ierr); 2487e6ccafaeSMatthew G Knepley } 2488e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2489e6ccafaeSMatthew G Knepley } 2490e6ccafaeSMatthew G Knepley 2491e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2492e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap" 249364beef6dSMatthew G. Knepley /*@ 249464beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 249564beef6dSMatthew G. Knepley 249664beef6dSMatthew G. Knepley Input Parameter: 249764beef6dSMatthew G. Knepley . dm - The submesh DM 249864beef6dSMatthew G. Knepley 249964beef6dSMatthew G. Knepley Output Parameter: 250064beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 250164beef6dSMatthew G. Knepley 250264beef6dSMatthew G. Knepley Level: developer 250364beef6dSMatthew G. Knepley 250464beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 250564beef6dSMatthew G. Knepley @*/ 2506e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 2507e6ccafaeSMatthew G Knepley { 2508e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 2509e6ccafaeSMatthew G Knepley 2510e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2511e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2512e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 2513e6ccafaeSMatthew G Knepley *subpointMap = mesh->subpointMap; 2514e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2515e6ccafaeSMatthew G Knepley } 2516e6ccafaeSMatthew G Knepley 2517e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2518e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap" 2519e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */ 2520e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 2521e6ccafaeSMatthew G Knepley { 2522e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 2523285d324eSMatthew G. Knepley DMLabel tmp; 2524e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2525e6ccafaeSMatthew G Knepley 2526e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2527e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2528285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 2529e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 2530285d324eSMatthew G. Knepley ++mesh->subpointMap->refct; 2531285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 2532e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2533e6ccafaeSMatthew G Knepley } 2534e6ccafaeSMatthew G Knepley 2535e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2536e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS" 253764beef6dSMatthew G. Knepley /*@ 2538e6ccafaeSMatthew G Knepley DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 2539e6ccafaeSMatthew G Knepley 2540e6ccafaeSMatthew G Knepley Input Parameter: 2541e6ccafaeSMatthew G Knepley . dm - The submesh DM 2542e6ccafaeSMatthew G Knepley 2543e6ccafaeSMatthew G Knepley Output Parameter: 25440298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 2545e6ccafaeSMatthew G Knepley 2546e6ccafaeSMatthew G Knepley Note: This is IS is guaranteed to be sorted by the construction of the submesh 254764beef6dSMatthew G. Knepley 254864beef6dSMatthew G. Knepley Level: developer 254964beef6dSMatthew G. Knepley 255064beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 255164beef6dSMatthew G. Knepley @*/ 2552e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 2553e6ccafaeSMatthew G Knepley { 255482f516ccSBarry Smith MPI_Comm comm; 2555e6ccafaeSMatthew G Knepley DMLabel subpointMap; 2556e6ccafaeSMatthew G Knepley IS is; 2557e6ccafaeSMatthew G Knepley const PetscInt *opoints; 2558e6ccafaeSMatthew G Knepley PetscInt *points, *depths; 2559e6ccafaeSMatthew G Knepley PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 2560e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2561e6ccafaeSMatthew G Knepley 2562e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2563e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2564e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 256582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 25660298fd71SBarry Smith *subpointIS = NULL; 2567e6ccafaeSMatthew G Knepley ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 2568e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2569fed694aaSMatthew G. Knepley if (subpointMap && depth >= 0) { 2570e6ccafaeSMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2571e6ccafaeSMatthew G Knepley if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 2572e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 2573e6ccafaeSMatthew G Knepley depths[0] = depth; 2574e6ccafaeSMatthew G Knepley depths[1] = 0; 2575e6ccafaeSMatthew G Knepley for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 2576e6ccafaeSMatthew G Knepley ierr = PetscMalloc(pEnd * sizeof(PetscInt), &points);CHKERRQ(ierr); 2577e6ccafaeSMatthew G Knepley for(d = 0, off = 0; d <= depth; ++d) { 2578e6ccafaeSMatthew G Knepley const PetscInt dep = depths[d]; 2579e6ccafaeSMatthew G Knepley 2580e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 2581e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 25821e21b6fdSMatthew G Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 2583e6ccafaeSMatthew 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); 2584e6ccafaeSMatthew G Knepley } else { 25851e21b6fdSMatthew G Knepley if (!n) { 25861e21b6fdSMatthew G Knepley if (d == 0) { 25871e21b6fdSMatthew G Knepley /* Missing cells */ 25881e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 25891e21b6fdSMatthew G Knepley } else { 25901e21b6fdSMatthew G Knepley /* Missing faces */ 25911e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 25921e21b6fdSMatthew G Knepley } 25931e21b6fdSMatthew G Knepley } 2594e6ccafaeSMatthew G Knepley } 2595e6ccafaeSMatthew G Knepley if (n) { 2596e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 2597e6ccafaeSMatthew G Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 2598e6ccafaeSMatthew G Knepley for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 2599e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 2600e6ccafaeSMatthew G Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 2601e6ccafaeSMatthew G Knepley } 2602e6ccafaeSMatthew G Knepley } 2603e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 2604e6ccafaeSMatthew G Knepley if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 2605fed694aaSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 2606e6ccafaeSMatthew G Knepley } 2607e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2608e6ccafaeSMatthew G Knepley } 2609