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; 145*dcbb62e8SMatthew G. Knepley PetscInt depth = 0, d, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, pStart, pEnd, p; 146cd0c2139SMatthew G Knepley PetscErrorCode ierr; 147cd0c2139SMatthew G Knepley 148cd0c2139SMatthew G Knepley PetscFunctionBegin; 149cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 150cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 151cd0c2139SMatthew G Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 152*dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dmNew, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 153*dcbb62e8SMatthew G. Knepley ierr = PetscMalloc2(depth+1,PetscInt,&depthEnd,PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),PetscInt,&newpoints);CHKERRQ(ierr); 154cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 155cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 156cd0c2139SMatthew G Knepley } 157cd0c2139SMatthew G Knepley /* Step 5: Set cones and supports */ 158cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 159cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 160cd0c2139SMatthew G Knepley const PetscInt *points = NULL, *orientations = NULL; 161*dcbb62e8SMatthew G. Knepley PetscInt size,sizeNew, i, newp = DMPlexShiftPoint_Internal(p, depth, depthEnd, depthShift); 162cd0c2139SMatthew G Knepley 163cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 164cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr); 165cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr); 166cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 167cd0c2139SMatthew G Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthEnd, depthShift); 168cd0c2139SMatthew G Knepley } 169cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr); 170cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr); 171cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 172*dcbb62e8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmNew, newp, &sizeNew);CHKERRQ(ierr); 173cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr); 174cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 175cd0c2139SMatthew G Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthEnd, depthShift); 176cd0c2139SMatthew G Knepley } 177*dcbb62e8SMatthew G. Knepley for (i = size; i < sizeNew; ++i) newpoints[i] = 0; 178cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr); 179cd0c2139SMatthew G Knepley } 180cd0c2139SMatthew G Knepley ierr = PetscFree2(depthEnd,newpoints);CHKERRQ(ierr); 181cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 182cd0c2139SMatthew G Knepley } 183cd0c2139SMatthew G Knepley 184cd0c2139SMatthew G Knepley #undef __FUNCT__ 185cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftCoordinates_Internal" 186cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew) 187cd0c2139SMatthew G Knepley { 188cd0c2139SMatthew G Knepley PetscSection coordSection, newCoordSection; 189cd0c2139SMatthew G Knepley Vec coordinates, newCoordinates; 190cd0c2139SMatthew G Knepley PetscScalar *coords, *newCoords; 191cd0c2139SMatthew G Knepley PetscInt *depthEnd, coordSize; 192cd0c2139SMatthew G Knepley PetscInt dim, depth = 0, d, vStart, vEnd, vStartNew, vEndNew, v; 193cd0c2139SMatthew G Knepley PetscErrorCode ierr; 194cd0c2139SMatthew G Knepley 195cd0c2139SMatthew G Knepley PetscFunctionBegin; 196cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 197cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 198cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 199cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 200cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 201cd0c2139SMatthew G Knepley } 202cd0c2139SMatthew G Knepley /* Step 8: Convert coordinates */ 203cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 204cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr); 205cd0c2139SMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 206cd0c2139SMatthew G Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr); 207cd0c2139SMatthew G Knepley ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr); 208cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr); 209cd0c2139SMatthew G Knepley ierr = PetscSectionSetChart(newCoordSection, vStartNew, vEndNew);CHKERRQ(ierr); 210cd0c2139SMatthew G Knepley for (v = vStartNew; v < vEndNew; ++v) { 211cd0c2139SMatthew G Knepley ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr); 212cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr); 213cd0c2139SMatthew G Knepley } 214cd0c2139SMatthew G Knepley ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr); 215cd0c2139SMatthew G Knepley ierr = DMPlexSetCoordinateSection(dmNew, newCoordSection);CHKERRQ(ierr); 216cd0c2139SMatthew G Knepley ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr); 217cd0c2139SMatthew G Knepley ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr); 218cd0c2139SMatthew G Knepley ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr); 219cd0c2139SMatthew G Knepley ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2202eb5907fSJed Brown ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr); 221cd0c2139SMatthew G Knepley ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr); 222cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 223cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 224cd0c2139SMatthew G Knepley ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr); 225cd0c2139SMatthew G Knepley for (v = vStart; v < vEnd; ++v) { 226cd0c2139SMatthew G Knepley PetscInt dof, off, noff, d; 227cd0c2139SMatthew G Knepley 228cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 229cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 230cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthEnd, depthShift), &noff);CHKERRQ(ierr); 231cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) { 232cd0c2139SMatthew G Knepley newCoords[noff+d] = coords[off+d]; 233cd0c2139SMatthew G Knepley } 234cd0c2139SMatthew G Knepley } 235cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 236cd0c2139SMatthew G Knepley ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr); 237cd0c2139SMatthew G Knepley ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 238cd0c2139SMatthew G Knepley ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr); 239cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 240cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 241cd0c2139SMatthew G Knepley } 242cd0c2139SMatthew G Knepley 243cd0c2139SMatthew G Knepley #undef __FUNCT__ 244cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal" 245cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew) 246cd0c2139SMatthew G Knepley { 247cd0c2139SMatthew G Knepley PetscInt *depthEnd; 248cd0c2139SMatthew G Knepley PetscInt depth = 0, d; 249cd0c2139SMatthew G Knepley PetscSF sfPoint, sfPointNew; 250cd0c2139SMatthew G Knepley const PetscSFNode *remotePoints; 251cd0c2139SMatthew G Knepley PetscSFNode *gremotePoints; 252cd0c2139SMatthew G Knepley const PetscInt *localPoints; 253cd0c2139SMatthew G Knepley PetscInt *glocalPoints, *newLocation, *newRemoteLocation; 254cd0c2139SMatthew G Knepley PetscInt numRoots, numLeaves, l, pStart, pEnd, totShift = 0; 255cd0c2139SMatthew G Knepley PetscErrorCode ierr; 256cd0c2139SMatthew G Knepley 257cd0c2139SMatthew G Knepley PetscFunctionBegin; 258cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 259cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 260cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 261cd0c2139SMatthew G Knepley totShift += depthShift[d]; 262cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 263cd0c2139SMatthew G Knepley } 264cd0c2139SMatthew G Knepley /* Step 9: Convert pointSF */ 265cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 266cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr); 267cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 268cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 269cd0c2139SMatthew G Knepley if (numRoots >= 0) { 270cd0c2139SMatthew G Knepley ierr = PetscMalloc2(numRoots,PetscInt,&newLocation,pEnd-pStart,PetscInt,&newRemoteLocation);CHKERRQ(ierr); 271cd0c2139SMatthew G Knepley for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthEnd, depthShift); 272cd0c2139SMatthew G Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 273cd0c2139SMatthew G Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 274cd0c2139SMatthew G Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscInt), &glocalPoints);CHKERRQ(ierr); 275cd0c2139SMatthew G Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscSFNode), &gremotePoints);CHKERRQ(ierr); 276cd0c2139SMatthew G Knepley for (l = 0; l < numLeaves; ++l) { 277cd0c2139SMatthew G Knepley glocalPoints[l] = DMPlexShiftPoint_Internal(localPoints[l], depth, depthEnd, depthShift); 278cd0c2139SMatthew G Knepley gremotePoints[l].rank = remotePoints[l].rank; 279cd0c2139SMatthew G Knepley gremotePoints[l].index = newRemoteLocation[localPoints[l]]; 280cd0c2139SMatthew G Knepley } 281cd0c2139SMatthew G Knepley ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr); 282cd0c2139SMatthew G Knepley ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 283cd0c2139SMatthew G Knepley } 284cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 285cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 286cd0c2139SMatthew G Knepley } 287cd0c2139SMatthew G Knepley 288cd0c2139SMatthew G Knepley #undef __FUNCT__ 289cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal" 290cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew) 291cd0c2139SMatthew G Knepley { 292cd0c2139SMatthew G Knepley PetscSF sfPoint; 293cd0c2139SMatthew G Knepley DMLabel vtkLabel, ghostLabel; 294cd0c2139SMatthew G Knepley PetscInt *depthEnd; 295cd0c2139SMatthew G Knepley const PetscSFNode *leafRemote; 296cd0c2139SMatthew G Knepley const PetscInt *leafLocal; 297cd0c2139SMatthew G Knepley PetscInt depth = 0, d, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f; 298cd0c2139SMatthew G Knepley PetscMPIInt rank; 299cd0c2139SMatthew G Knepley PetscErrorCode ierr; 300cd0c2139SMatthew G Knepley 301cd0c2139SMatthew G Knepley PetscFunctionBegin; 302cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 303cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 304cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 305cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 306cd0c2139SMatthew G Knepley } 307cd0c2139SMatthew G Knepley /* Step 10: Convert labels */ 308cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 309cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 310cd0c2139SMatthew G Knepley DMLabel label, newlabel; 311cd0c2139SMatthew G Knepley const char *lname; 312cd0c2139SMatthew G Knepley PetscBool isDepth; 313cd0c2139SMatthew G Knepley IS valueIS; 314cd0c2139SMatthew G Knepley const PetscInt *values; 315cd0c2139SMatthew G Knepley PetscInt numValues, val; 316cd0c2139SMatthew G Knepley 317cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr); 318cd0c2139SMatthew G Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 319cd0c2139SMatthew G Knepley if (isDepth) continue; 320cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, lname);CHKERRQ(ierr); 321cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr); 322cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr); 323cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 324cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 325cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 326cd0c2139SMatthew G Knepley for (val = 0; val < numValues; ++val) { 327cd0c2139SMatthew G Knepley IS pointIS; 328cd0c2139SMatthew G Knepley const PetscInt *points; 329cd0c2139SMatthew G Knepley PetscInt numPoints, p; 330cd0c2139SMatthew G Knepley 331cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 332cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 333cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 334cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 335cd0c2139SMatthew G Knepley const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthEnd, depthShift); 336cd0c2139SMatthew G Knepley 337cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr); 338cd0c2139SMatthew G Knepley } 339cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 340cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 341cd0c2139SMatthew G Knepley } 342cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 343cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 344cd0c2139SMatthew G Knepley } 345cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 346cd0c2139SMatthew G Knepley /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */ 347cd0c2139SMatthew G Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 348cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 349cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 350cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr); 351cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "vtk");CHKERRQ(ierr); 352cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "ghost");CHKERRQ(ierr); 353cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr); 354cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr); 355cd0c2139SMatthew G Knepley for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { 356cd0c2139SMatthew G Knepley for (; c < leafLocal[l] && c < cEnd; ++c) { 357cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 358cd0c2139SMatthew G Knepley } 359cd0c2139SMatthew G Knepley if (leafLocal[l] >= cEnd) break; 360cd0c2139SMatthew G Knepley if (leafRemote[l].rank == rank) { 361cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 362cd0c2139SMatthew G Knepley } else { 363cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr); 364cd0c2139SMatthew G Knepley } 365cd0c2139SMatthew G Knepley } 366cd0c2139SMatthew G Knepley for (; c < cEnd; ++c) { 367cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 368cd0c2139SMatthew G Knepley } 369cd0c2139SMatthew G Knepley if (0) { 370cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 371cd0c2139SMatthew G Knepley ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 372cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 373cd0c2139SMatthew G Knepley } 374cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr); 375cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 376cd0c2139SMatthew G Knepley PetscInt numCells; 377cd0c2139SMatthew G Knepley 378cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr); 379cd0c2139SMatthew G Knepley if (numCells < 2) { 380cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr); 381cd0c2139SMatthew G Knepley } else { 382cd0c2139SMatthew G Knepley const PetscInt *cells = NULL; 383cd0c2139SMatthew G Knepley PetscInt vA, vB; 384cd0c2139SMatthew G Knepley 385cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr); 386cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr); 387cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr); 388cd0c2139SMatthew G Knepley if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);} 389cd0c2139SMatthew G Knepley } 390cd0c2139SMatthew G Knepley } 391cd0c2139SMatthew G Knepley if (0) { 392cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 393cd0c2139SMatthew G Knepley ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 394cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 395cd0c2139SMatthew G Knepley } 396cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 397cd0c2139SMatthew G Knepley } 398cd0c2139SMatthew G Knepley 399cd0c2139SMatthew G Knepley #undef __FUNCT__ 400cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal" 401cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm) 402cd0c2139SMatthew G Knepley { 403cd0c2139SMatthew G Knepley IS valueIS; 404cd0c2139SMatthew G Knepley const PetscInt *values; 405cd0c2139SMatthew G Knepley PetscInt *depthShift; 406cd0c2139SMatthew G Knepley PetscInt depth = 0, numFS, fs, ghostCell, cEnd, c; 407cd0c2139SMatthew G Knepley PetscErrorCode ierr; 408cd0c2139SMatthew G Knepley 409cd0c2139SMatthew G Knepley PetscFunctionBegin; 410cd0c2139SMatthew G Knepley /* Count ghost cells */ 411cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 412cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr); 413cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 414cd0c2139SMatthew G Knepley 415cd0c2139SMatthew G Knepley *numGhostCells = 0; 416cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 417cd0c2139SMatthew G Knepley PetscInt numBdFaces; 418cd0c2139SMatthew G Knepley 419cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[fs], &numBdFaces);CHKERRQ(ierr); 420cd0c2139SMatthew G Knepley 421cd0c2139SMatthew G Knepley *numGhostCells += numBdFaces; 422cd0c2139SMatthew G Knepley } 423cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 424cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthShift);CHKERRQ(ierr); 425cd0c2139SMatthew G Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 426cd0c2139SMatthew G Knepley if (depth >= 0) depthShift[depth] = *numGhostCells; 427cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 428cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 429cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 430cd0c2139SMatthew G Knepley for (c = cEnd; c < cEnd + *numGhostCells; ++c) { 431cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr); 432cd0c2139SMatthew G Knepley } 433cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 434cd0c2139SMatthew G Knepley IS faceIS; 435cd0c2139SMatthew G Knepley const PetscInt *faces; 436cd0c2139SMatthew G Knepley PetscInt numFaces, f; 437cd0c2139SMatthew G Knepley 438cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 439cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 440cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 441cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 442cd0c2139SMatthew G Knepley PetscInt size; 443cd0c2139SMatthew G Knepley 444cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr); 445cd0c2139SMatthew G Knepley if (size != 1) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "DM has boundary face %d with %d support cells", faces[f], size); 446cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(gdm, faces[f] + *numGhostCells, 2);CHKERRQ(ierr); 447cd0c2139SMatthew G Knepley } 448cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 449cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 450cd0c2139SMatthew G Knepley } 451cd0c2139SMatthew G Knepley /* Step 4: Setup ghosted DM */ 452cd0c2139SMatthew G Knepley ierr = DMSetUp(gdm);CHKERRQ(ierr); 453cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 454cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 455cd0c2139SMatthew G Knepley ghostCell = cEnd; 456cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 457cd0c2139SMatthew G Knepley IS faceIS; 458cd0c2139SMatthew G Knepley const PetscInt *faces; 459cd0c2139SMatthew G Knepley PetscInt numFaces, f; 460cd0c2139SMatthew G Knepley 461cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 462cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 463cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 464cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f, ++ghostCell) { 465cd0c2139SMatthew G Knepley PetscInt newFace = faces[f] + *numGhostCells; 466cd0c2139SMatthew G Knepley 467cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr); 468cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr); 469cd0c2139SMatthew G Knepley } 470cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 471cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 472cd0c2139SMatthew G Knepley } 473cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 474cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 475cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 476cd0c2139SMatthew G Knepley ierr = DMPlexStratify(gdm);CHKERRQ(ierr); 477cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 478cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 479cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 480cd0c2139SMatthew G Knepley ierr = PetscFree(depthShift);CHKERRQ(ierr); 481cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 482cd0c2139SMatthew G Knepley } 483cd0c2139SMatthew G Knepley 484cd0c2139SMatthew G Knepley #undef __FUNCT__ 485cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells" 486cd0c2139SMatthew G Knepley /*@C 487cd0c2139SMatthew G Knepley DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face 488cd0c2139SMatthew G Knepley 489cd0c2139SMatthew G Knepley Collective on dm 490cd0c2139SMatthew G Knepley 491cd0c2139SMatthew G Knepley Input Parameters: 492cd0c2139SMatthew G Knepley + dm - The original DM 493cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL 494cd0c2139SMatthew G Knepley 495cd0c2139SMatthew G Knepley Output Parameters: 496cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM 497cd0c2139SMatthew G Knepley - dmGhosted - The new DM 498cd0c2139SMatthew G Knepley 499cd0c2139SMatthew G Knepley Note: If no label exists of that name, one will be created marking all boundary faces 500cd0c2139SMatthew G Knepley 501cd0c2139SMatthew G Knepley Level: developer 502cd0c2139SMatthew G Knepley 503cd0c2139SMatthew G Knepley .seealso: DMCreate() 504cd0c2139SMatthew G Knepley */ 505cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted) 506cd0c2139SMatthew G Knepley { 507cd0c2139SMatthew G Knepley DM gdm; 508cd0c2139SMatthew G Knepley DMLabel label; 509cd0c2139SMatthew G Knepley const char *name = labelName ? labelName : "Face Sets"; 510cd0c2139SMatthew G Knepley PetscInt dim; 511cd0c2139SMatthew G Knepley PetscErrorCode ierr; 512cd0c2139SMatthew G Knepley 513cd0c2139SMatthew G Knepley PetscFunctionBegin; 514cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 515cd0c2139SMatthew G Knepley PetscValidPointer(numGhostCells, 3); 516cd0c2139SMatthew G Knepley PetscValidPointer(dmGhosted, 4); 517cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr); 518cd0c2139SMatthew G Knepley ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr); 519cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 520cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(gdm, dim);CHKERRQ(ierr); 521cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 522cd0c2139SMatthew G Knepley if (!label) { 523cd0c2139SMatthew G Knepley /* Get label for boundary faces */ 524cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr); 525cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 526cd0c2139SMatthew G Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 527cd0c2139SMatthew G Knepley } 528cd0c2139SMatthew G Knepley ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr); 529cd0c2139SMatthew G Knepley ierr = DMSetFromOptions(gdm);CHKERRQ(ierr); 530cd0c2139SMatthew G Knepley *dmGhosted = gdm; 531cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 532cd0c2139SMatthew G Knepley } 533cd0c2139SMatthew G Knepley 534cd0c2139SMatthew G Knepley #undef __FUNCT__ 535cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal" 536607ab7a9SMatthew G. Knepley /* 537607ab7a9SMatthew G. Knepley We are adding two kinds of points here: 538607ab7a9SMatthew G. Knepley Replicated: Copies of points which exist in the mesh, such as vertices identified across a fault 539607ab7a9SMatthew G. Knepley Hybrid: Entirely new points, such as cohesive cells 540607ab7a9SMatthew G. Knepley */ 541cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm) 542cd0c2139SMatthew G Knepley { 543cd0c2139SMatthew G Knepley MPI_Comm comm; 544607ab7a9SMatthew G. Knepley IS valueIS; 545607ab7a9SMatthew G. Knepley PetscInt numSP = 0; /* The number of depths for which we have replicated points */ 546607ab7a9SMatthew G. Knepley const PetscInt *values; /* List of depths for which we have replicated points */ 547607ab7a9SMatthew G. Knepley IS *pointIS; 548607ab7a9SMatthew G. Knepley PetscInt *numSplitPoints; /* The number of replicated points at each depth */ 549607ab7a9SMatthew G. Knepley PetscInt *numHybridPoints; /* The number of hybrid points at each depth */ 550607ab7a9SMatthew G. Knepley const PetscInt **splitPoints; /* Replicated points for each depth */ 551cd0c2139SMatthew G Knepley PetscSection coordSection; 552cd0c2139SMatthew G Knepley Vec coordinates; 553cd0c2139SMatthew G Knepley PetscScalar *coords; 554607ab7a9SMatthew G. Knepley PetscInt depths[4]; /* Depths in the order that plex points are numbered */ 555607ab7a9SMatthew G. Knepley PetscInt *depthShift; /* Number of replicated+hybrid points at each depth */ 556607ab7a9SMatthew G. Knepley PetscInt *depthOffset; /* Prefix sums of depthShift */ 557607ab7a9SMatthew G. Knepley PetscInt *pMaxNew; /* The first replicated point at each depth in the new mesh, hybrids come after this */ 558607ab7a9SMatthew G. Knepley PetscInt *coneNew, *coneONew, *supportNew; 559*dcbb62e8SMatthew G. Knepley PetscInt shift = 100, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v; 560cd0c2139SMatthew G Knepley PetscErrorCode ierr; 561cd0c2139SMatthew G Knepley 562cd0c2139SMatthew G Knepley PetscFunctionBegin; 563cd0c2139SMatthew G Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 564cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 565607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 566fd4b9f15SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 567607ab7a9SMatthew G. Knepley depths[0] = depth; 568607ab7a9SMatthew G. Knepley depths[1] = 0; 569607ab7a9SMatthew G. Knepley depths[2] = depth-1; 570607ab7a9SMatthew G. Knepley depths[3] = 1; 571cd0c2139SMatthew G Knepley /* Count split points and add cohesive cells */ 572607ab7a9SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 573*dcbb62e8SMatthew G. Knepley ierr = PetscMalloc3(depth+1,PetscInt,&depthShift,depth+1,PetscInt,&depthOffset,depth+1,PetscInt,&pMaxNew);CHKERRQ(ierr); 574607ab7a9SMatthew G. Knepley ierr = PetscMalloc4(depth+1,IS,&pointIS,depth+1,PetscInt,&numSplitPoints,depth+1,PetscInt,&numHybridPoints,depth+1,const PetscInt*,&splitPoints);CHKERRQ(ierr); 575607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 576607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthOffset, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 577607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 578607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 579607ab7a9SMatthew G. Knepley numSplitPoints[d] = 0; 580607ab7a9SMatthew G. Knepley numHybridPoints[d] = 0; 581607ab7a9SMatthew G. Knepley splitPoints[d] = NULL; 582607ab7a9SMatthew G. Knepley pointIS[d] = NULL; 583607ab7a9SMatthew G. Knepley } 584cd0c2139SMatthew G Knepley if (label) { 585cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 586cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 587cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 588cd0c2139SMatthew G Knepley } 589cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 590cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 591cd0c2139SMatthew G Knepley 592cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 593cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pointIS[dep]);CHKERRQ(ierr); 594cd0c2139SMatthew G Knepley if (pointIS[dep]) { 595cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 596cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 597cd0c2139SMatthew G Knepley } 598cd0c2139SMatthew G Knepley } 599607ab7a9SMatthew G. Knepley /* Calculate number of hybrid points */ 600607ab7a9SMatthew G. Knepley for (d = 1; d <= depth; ++d) numHybridPoints[d] = numSplitPoints[d-1]; /* There is a hybrid cell/face/edge for every split face/edge/vertex */ 601607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) depthShift[d] = numSplitPoints[d] + numHybridPoints[d]; 602607ab7a9SMatthew G. Knepley for (d = 1; d <= depth; ++d) depthOffset[depths[d]] = depthOffset[depths[d-1]] + depthShift[depths[d-1]]; 603607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) pMaxNew[d] += depthOffset[d]; 604cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 605cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 606cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 607cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 608cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 6094c367dbcSMatthew G. Knepley const PetscInt newp = oldp + depthOffset[dep]; 6104c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 611cd0c2139SMatthew G Knepley const PetscInt *support; 6124c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, qf, qn, qp, e; 613cd0c2139SMatthew G Knepley 614cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 615cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 616cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 617cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 618cd0c2139SMatthew G Knepley if (dep == depth-1) { 6194c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 6204c367dbcSMatthew G. Knepley 621cd0c2139SMatthew G Knepley /* Add cohesive cells, they are prisms */ 6224c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr); 623cd0c2139SMatthew G Knepley } else if (dep == 0) { 6244c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 625cd0c2139SMatthew G Knepley 626cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 6274c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 628cd0c2139SMatthew G Knepley PetscInt val; 629cd0c2139SMatthew G Knepley 630cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 6314c367dbcSMatthew G. Knepley if (val == 1) ++qf; 6324c367dbcSMatthew G. Knepley if ((val == 1) || (val == (shift + 1))) ++qn; 6334c367dbcSMatthew G. Knepley if ((val == 1) || (val == -(shift + 1))) ++qp; 634cd0c2139SMatthew G Knepley } 6354c367dbcSMatthew G. Knepley /* Split old vertex: Edges into original vertex and new cohesive edge */ 6364c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 6374c367dbcSMatthew G. Knepley /* Split new vertex: Edges into split vertex and new cohesive edge */ 6384c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 6394c367dbcSMatthew G. Knepley /* Add hybrid edge */ 6404c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 6414c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 642cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 6434c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 6444c367dbcSMatthew G. Knepley 645cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 6464c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 647cd0c2139SMatthew G Knepley PetscInt val; 648cd0c2139SMatthew G Knepley 649cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 6504c367dbcSMatthew G. Knepley if (val == dim-1) ++qf; 6514c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 6524c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 653cd0c2139SMatthew G Knepley } 6544c367dbcSMatthew G. Knepley /* Split old edge: Faces into original edge and cohesive face (positive side?) */ 6554c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 6564c367dbcSMatthew G. Knepley /* Split new edge: Faces into split edge and cohesive face (negative side?) */ 6574c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 6584c367dbcSMatthew G. Knepley /* Add hybrid face */ 6594c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 6604c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 661cd0c2139SMatthew G Knepley } 662cd0c2139SMatthew G Knepley } 663cd0c2139SMatthew G Knepley } 664cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 665cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 666cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 667*dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 668*dcbb62e8SMatthew G. Knepley ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,PetscInt,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,PetscInt,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),PetscInt,&supportNew);CHKERRQ(ierr); 669cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 670cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 671cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 672cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 6734c367dbcSMatthew G. Knepley const PetscInt newp = oldp + depthOffset[dep]; 6744c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 675cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 6764c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, q, qf, qn, qp, v, e, s; 677cd0c2139SMatthew G Knepley 678cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 679cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 680cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 681cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 682cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 683cd0c2139SMatthew G Knepley if (dep == depth-1) { 6844c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 685cd0c2139SMatthew G Knepley const PetscInt *supportF; 686cd0c2139SMatthew G Knepley 687cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 688cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 689cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 690cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 691cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 692cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 6934c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 694cd0c2139SMatthew G Knepley 6954c367dbcSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep-1]; 696cd0c2139SMatthew G Knepley } 697cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 698cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 699e537020bSMatthew G. Knepley /* Face support */ 700cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 701cd0c2139SMatthew G Knepley PetscInt val; 702cd0c2139SMatthew G Knepley 703cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 704cd0c2139SMatthew G Knepley if (val < 0) { 705cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 7064c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr); 707cd0c2139SMatthew G Knepley } else { 708cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 7094c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr); 710e537020bSMatthew G. Knepley /* Get orientation for cohesive face */ 711e537020bSMatthew G. Knepley { 712e537020bSMatthew G. Knepley const PetscInt *ncone, *nconeO; 713e537020bSMatthew G. Knepley PetscInt nconeSize, nc; 714e537020bSMatthew G. Knepley 715e537020bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 716e537020bSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 717e537020bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 718e537020bSMatthew G. Knepley for (nc = 0; nc < nconeSize; ++nc) { 719e537020bSMatthew G. Knepley if (ncone[nc] == oldp) { 720e537020bSMatthew G. Knepley coneONew[0] = nconeO[nc]; 721e537020bSMatthew G. Knepley break; 722cd0c2139SMatthew G Knepley } 723cd0c2139SMatthew G Knepley } 724e537020bSMatthew G. Knepley if (nc >= nconeSize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate face %d in neighboring cell %d", oldp, support[s]); 725e537020bSMatthew G. Knepley } 726e537020bSMatthew G. Knepley } 727e537020bSMatthew G. Knepley } 7284c367dbcSMatthew G. Knepley /* Cohesive cell: Old and new split face, then new cohesive faces */ 729fd4b9f15SMatthew G. Knepley coneNew[0] = newp; /* Extracted negative side orientation above */ 7304c367dbcSMatthew G. Knepley coneNew[1] = splitp; 7314c367dbcSMatthew G. Knepley coneONew[1] = coneONew[0]; 732e537020bSMatthew G. Knepley for (q = 0; q < coneSize; ++q) { 7334c367dbcSMatthew G. Knepley coneNew[2+q] += (pMaxNew[dep] - pMaxNew[dep-1]) + numSplitPoints[dep]; 734e537020bSMatthew G. Knepley coneONew[2+q] = 0; 735e537020bSMatthew G. Knepley } 7364c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr); 7374c367dbcSMatthew G. Knepley ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr); 738cd0c2139SMatthew G Knepley } else if (dep == 0) { 7394c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 740cd0c2139SMatthew G Knepley 741cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 7424c367dbcSMatthew G. Knepley for (e = 0, qn = 0; e < supportSize; ++e) { 743cd0c2139SMatthew G Knepley PetscInt val; 744cd0c2139SMatthew G Knepley 745cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 746cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 7474c367dbcSMatthew G. Knepley supportNew[qn++] = support[e] + depthOffset[dep+1]; 748cd0c2139SMatthew G Knepley } 749cd0c2139SMatthew G Knepley } 7504c367dbcSMatthew G. Knepley supportNew[qn] = hybedge; 751cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 752cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 7534c367dbcSMatthew G. Knepley for (e = 0, qp = 0; e < supportSize; ++e) { 754cd0c2139SMatthew G Knepley PetscInt val, edge; 755cd0c2139SMatthew G Knepley 756cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 757cd0c2139SMatthew G Knepley if (val == 1) { 7584c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 759cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 7604c367dbcSMatthew G. Knepley supportNew[qp++] = edge + pMaxNew[dep+1]; 761cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 7624c367dbcSMatthew G. Knepley supportNew[qp++] = support[e] + depthOffset[dep+1]; 763cd0c2139SMatthew G Knepley } 764cd0c2139SMatthew G Knepley } 7654c367dbcSMatthew G. Knepley supportNew[qp] = hybedge; 766cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 7674c367dbcSMatthew G. Knepley /* Hybrid edge: Old and new split vertex */ 768cd0c2139SMatthew G Knepley coneNew[0] = newp; 769cd0c2139SMatthew G Knepley coneNew[1] = splitp; 7704c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 7714c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 7724c367dbcSMatthew G. Knepley PetscInt val, edge; 7734c367dbcSMatthew G. Knepley 7744c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 7754c367dbcSMatthew G. Knepley if (val == 1) { 7764c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 7774c367dbcSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 7784c367dbcSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 7794c367dbcSMatthew G. Knepley } 7804c367dbcSMatthew G. Knepley } 7814c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 782cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 7834c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 7844c367dbcSMatthew G. Knepley 785cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 786cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 787cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 7884c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 789cd0c2139SMatthew G Knepley 7904c367dbcSMatthew G. Knepley coneNew[q] = v + pMaxNew[dep-1]; 791cd0c2139SMatthew G Knepley } 792cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 793cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 794cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 795cd0c2139SMatthew G Knepley PetscInt val; 796cd0c2139SMatthew G Knepley 797cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 7984c367dbcSMatthew G. Knepley if (val == dim-1) { 7994c367dbcSMatthew G. Knepley supportNew[q++] = support[e] + depthOffset[dep+1]; 8004c367dbcSMatthew G. Knepley } else if (val == (shift + dim-1)) { 8014c367dbcSMatthew G. Knepley supportNew[q++] = support[e] + depthOffset[dep+1]; 802cd0c2139SMatthew G Knepley } 803cd0c2139SMatthew G Knepley } 804b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 805cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 806cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 807cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 808cd0c2139SMatthew G Knepley PetscInt val, face; 809cd0c2139SMatthew G Knepley 810cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 811cd0c2139SMatthew G Knepley if (val == dim-1) { 8124c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 813cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 8144c367dbcSMatthew G. Knepley supportNew[q++] = face + pMaxNew[dep+1]; 815cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 8164c367dbcSMatthew G. Knepley supportNew[q++] = support[e] + depthOffset[dep+1]; 817cd0c2139SMatthew G Knepley } 818cd0c2139SMatthew G Knepley } 819b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 820cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 8214c367dbcSMatthew G. Knepley /* Hybrid face */ 8224c367dbcSMatthew G. Knepley coneNew[0] = newp; 8234c367dbcSMatthew G. Knepley coneNew[1] = splitp; 8244c367dbcSMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 8254c367dbcSMatthew G. Knepley PetscInt vertex; 8264c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr); 8274c367dbcSMatthew G. Knepley if (vertex < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not a split vertex", support[e]); 8284c367dbcSMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep]; 8294c367dbcSMatthew G. Knepley } 8304c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 8314c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 8324c367dbcSMatthew G. Knepley PetscInt val, face; 8334c367dbcSMatthew G. Knepley 8344c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 8354c367dbcSMatthew G. Knepley if (val == dim-1) { 8364c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 8374c367dbcSMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 8384c367dbcSMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 8394c367dbcSMatthew G. Knepley } 8404c367dbcSMatthew G. Knepley } 8414c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 842cd0c2139SMatthew G Knepley } 843cd0c2139SMatthew G Knepley } 844cd0c2139SMatthew G Knepley } 845cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 846cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 847cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 848cd0c2139SMatthew G Knepley IS pIS; 849cd0c2139SMatthew G Knepley PetscInt numPoints; 850cd0c2139SMatthew G Knepley const PetscInt *points; 851cd0c2139SMatthew G Knepley 852cd0c2139SMatthew G Knepley if (dep >= 0) continue; 853cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 854cd0c2139SMatthew G Knepley if (!pIS) continue; 855cd0c2139SMatthew G Knepley dep = -dep - shift; 856cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 857cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 858cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 859cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 860cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + oldp; 861cd0c2139SMatthew G Knepley const PetscInt *cone; 862cd0c2139SMatthew G Knepley PetscInt coneSize, c; 86350cf782dSMatthew G. Knepley /* PetscBool replaced = PETSC_FALSE; */ 864cd0c2139SMatthew G Knepley 865cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 866cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 867cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 868cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 869cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 870cd0c2139SMatthew G Knepley const PetscInt coldp = cone[c] - depthOffset[dep-1]; 871cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 872cd0c2139SMatthew G Knepley 873cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 874cd0c2139SMatthew G Knepley if (val == dep-1) { 875cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 876cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 877cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 878cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 87950cf782dSMatthew G. Knepley /* replaced = PETSC_TRUE; */ 880cd0c2139SMatthew G Knepley } 881cd0c2139SMatthew G Knepley } 8824a189a86SMatthew G. Knepley /* Cells with only a vertex or edge on the submesh have no replacement */ 8834a189a86SMatthew G. Knepley /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 884cd0c2139SMatthew G Knepley } 885cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 886cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 887cd0c2139SMatthew G Knepley } 888cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 889cd0c2139SMatthew G Knepley ierr = DMPlexStratify(sdm);CHKERRQ(ierr); 890cd0c2139SMatthew G Knepley /* Step 8: Coordinates */ 891cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 892cd0c2139SMatthew G Knepley ierr = DMPlexGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 893cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 894cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 895cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 896cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[0] + splitPoints[0][v]; 897cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 898cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 899cd0c2139SMatthew G Knepley 900cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 901cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 902cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 903cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 904cd0c2139SMatthew G Knepley } 905cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 906cd0c2139SMatthew G Knepley /* Step 9: SF, if I can figure this out we can split the mesh in parallel */ 907cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 908cd0c2139SMatthew G Knepley /* Step 10: Labels */ 909cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 910cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 911cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 912cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 913cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + splitPoints[dep][p]; 914cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 915cd0c2139SMatthew G Knepley PetscInt l; 916cd0c2139SMatthew G Knepley 917cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 918cd0c2139SMatthew G Knepley DMLabel mlabel; 919cd0c2139SMatthew G Knepley const char *lname; 920cd0c2139SMatthew G Knepley PetscInt val; 9219a356370SMatthew G. Knepley PetscBool isDepth; 922cd0c2139SMatthew G Knepley 923cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 9249a356370SMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 9259a356370SMatthew G. Knepley if (isDepth) continue; 926cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 927cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 928cd0c2139SMatthew G Knepley if (val >= 0) { 929cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 9309a356370SMatthew G. Knepley #if 0 9319a356370SMatthew G. Knepley /* Do not put cohesive edges into the label */ 932cd0c2139SMatthew G Knepley if (dep == 0) { 9334c367dbcSMatthew G. Knepley const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 934cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr); 9354c367dbcSMatthew G. Knepley } else if (dep == dim-2) { 9364c367dbcSMatthew G. Knepley const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 9374c367dbcSMatthew G. Knepley ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr); 938cd0c2139SMatthew G Knepley } 9394c367dbcSMatthew G. Knepley /* Do not put cohesive faces into the label */ 9409a356370SMatthew G. Knepley #endif 941cd0c2139SMatthew G Knepley } 942cd0c2139SMatthew G Knepley } 943cd0c2139SMatthew G Knepley } 944cd0c2139SMatthew G Knepley } 945cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 946cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 947cd0c2139SMatthew G Knepley 948cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 949cd0c2139SMatthew G Knepley if (pointIS[dep]) {ierr = ISRestoreIndices(pointIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 950cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS[dep]);CHKERRQ(ierr); 951cd0c2139SMatthew G Knepley } 952cd0c2139SMatthew G Knepley if (label) { 953cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 954cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 955cd0c2139SMatthew G Knepley } 9560d4d4d06SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 9570d4d4d06SMatthew G. Knepley ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr); 9580d4d4d06SMatthew G. Knepley pMaxNew[d] = pEnd - numHybridPoints[d]; 9590d4d4d06SMatthew G. Knepley } 9600e49e2e2SMatthew G. Knepley ierr = DMPlexSetHybridBounds(sdm, depth >= 0 ? pMaxNew[depth] : PETSC_DETERMINE, depth>1 ? pMaxNew[depth-1] : PETSC_DETERMINE, depth>2 ? pMaxNew[1] : PETSC_DETERMINE, depth >= 0 ? pMaxNew[0] : PETSC_DETERMINE);CHKERRQ(ierr); 961*dcbb62e8SMatthew G. Knepley ierr = PetscFree3(depthShift, depthOffset, pMaxNew);CHKERRQ(ierr); 962*dcbb62e8SMatthew G. Knepley ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr); 963607ab7a9SMatthew G. Knepley ierr = PetscFree4(pointIS, numSplitPoints, numHybridPoints, splitPoints);CHKERRQ(ierr); 964cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 965cd0c2139SMatthew G Knepley } 966cd0c2139SMatthew G Knepley 967cd0c2139SMatthew G Knepley #undef __FUNCT__ 968cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells" 969cd0c2139SMatthew G Knepley /*@C 970cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 971cd0c2139SMatthew G Knepley 972cd0c2139SMatthew G Knepley Collective on dm 973cd0c2139SMatthew G Knepley 974cd0c2139SMatthew G Knepley Input Parameters: 975cd0c2139SMatthew G Knepley + dm - The original DM 97653156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated) 977cd0c2139SMatthew G Knepley 978cd0c2139SMatthew G Knepley Output Parameters: 979cd0c2139SMatthew G Knepley - dmSplit - The new DM 980cd0c2139SMatthew G Knepley 981cd0c2139SMatthew G Knepley Level: developer 982cd0c2139SMatthew G Knepley 9832be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 984cd0c2139SMatthew G Knepley @*/ 985cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 986cd0c2139SMatthew G Knepley { 987cd0c2139SMatthew G Knepley DM sdm; 988cd0c2139SMatthew G Knepley PetscInt dim; 989cd0c2139SMatthew G Knepley PetscErrorCode ierr; 990cd0c2139SMatthew G Knepley 991cd0c2139SMatthew G Knepley PetscFunctionBegin; 992cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 99353156dfcSMatthew G. Knepley PetscValidPointer(dmSplit, 3); 994cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 995cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 996cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 997cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(sdm, dim);CHKERRQ(ierr); 998cd0c2139SMatthew G Knepley switch (dim) { 999cd0c2139SMatthew G Knepley case 2: 1000cd0c2139SMatthew G Knepley case 3: 1001cd0c2139SMatthew G Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 1002cd0c2139SMatthew G Knepley break; 1003cd0c2139SMatthew G Knepley default: 1004cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 1005cd0c2139SMatthew G Knepley } 1006cd0c2139SMatthew G Knepley *dmSplit = sdm; 1007cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1008cd0c2139SMatthew G Knepley } 1009cd0c2139SMatthew G Knepley 1010cd0c2139SMatthew G Knepley #undef __FUNCT__ 10112be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete" 1012cd0c2139SMatthew G Knepley /*@ 10132be2b188SMatthew G Knepley DMPlexLabelCohesiveComplete - Starting with a label marking vertices on an internal surface, we add all other mesh pieces 1014cd0c2139SMatthew G Knepley to complete the surface 1015cd0c2139SMatthew G Knepley 1016cd0c2139SMatthew G Knepley Input Parameters: 1017cd0c2139SMatthew G Knepley + dm - The DM 101847946fd8SMatthew G. Knepley . label - A DMLabel marking the surface vertices 1019bb55d314SMatthew G. Knepley . flip - Flag to flip the submesh normal and replace points on the other side 102047946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL 1021cd0c2139SMatthew G Knepley 1022cd0c2139SMatthew G Knepley Output Parameter: 1023cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 1024cd0c2139SMatthew G Knepley 1025cd0c2139SMatthew G Knepley Level: developer 1026cd0c2139SMatthew G Knepley 10272be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 1028cd0c2139SMatthew G Knepley @*/ 1029bb55d314SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, PetscBool flip, DM subdm) 1030cd0c2139SMatthew G Knepley { 1031d90583fdSMatthew G. Knepley DMLabel depthLabel; 103247946fd8SMatthew G. Knepley IS dimIS, subpointIS; 103347946fd8SMatthew G. Knepley const PetscInt *points, *subpoints; 1034bb55d314SMatthew G. Knepley const PetscInt rev = flip ? -1 : 1; 103547946fd8SMatthew G. Knepley PetscInt shift = 100, dim, dep, cStart, cEnd, numPoints, numSubpoints, p, val; 1036cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1037cd0c2139SMatthew G Knepley 1038cd0c2139SMatthew G Knepley PetscFunctionBegin; 1039d90583fdSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 1040cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 104147946fd8SMatthew G. Knepley if (subdm) { 104247946fd8SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 104347946fd8SMatthew G. Knepley if (subpointIS) { 104447946fd8SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 104547946fd8SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 104647946fd8SMatthew G. Knepley } 104747946fd8SMatthew G. Knepley } 1048d7c8f101SMatthew G. Knepley /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */ 1049cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 1050cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1051cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1052cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1053d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */ 1054cd0c2139SMatthew G Knepley const PetscInt *support; 1055cd0c2139SMatthew G Knepley PetscInt supportSize, s; 1056cd0c2139SMatthew G Knepley 1057cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1058cd0c2139SMatthew G Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 1059cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1060cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1061cd0c2139SMatthew G Knepley const PetscInt *cone, *ornt; 1062cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1063cd0c2139SMatthew G Knepley PetscBool pos = PETSC_TRUE; 1064cd0c2139SMatthew G Knepley 1065cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1066cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1067cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 1068cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1069cd0c2139SMatthew G Knepley if (cone[c] == points[p]) { 107047946fd8SMatthew G. Knepley PetscInt o = ornt[c]; 107147946fd8SMatthew G. Knepley 107247946fd8SMatthew G. Knepley if (subdm) { 107347946fd8SMatthew G. Knepley const PetscInt *subcone, *subornt; 107447946fd8SMatthew G. Knepley PetscInt subpoint, subface, subconeSize, sc; 107547946fd8SMatthew G. Knepley 107647946fd8SMatthew G. Knepley ierr = PetscFindInt(support[s], numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 107747946fd8SMatthew G. Knepley ierr = PetscFindInt(points[p], numSubpoints, subpoints, &subface);CHKERRQ(ierr); 107847946fd8SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 107947946fd8SMatthew G. Knepley ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 108047946fd8SMatthew G. Knepley ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 108147946fd8SMatthew G. Knepley for (sc = 0; sc < subconeSize; ++sc) { 108247946fd8SMatthew G. Knepley if (subcone[sc] == subface) { 108347946fd8SMatthew G. Knepley o = subornt[0]; 108447946fd8SMatthew G. Knepley break; 108547946fd8SMatthew G. Knepley } 108647946fd8SMatthew G. Knepley } 108747946fd8SMatthew G. Knepley if (sc >= subconeSize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find point %d in cone for subpoint %d", points[p], subpoint); 108847946fd8SMatthew G. Knepley } 108947946fd8SMatthew G. Knepley if (o >= 0) { 1090bb55d314SMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr); 1091ffaa4bbcSMatthew G. Knepley pos = rev > 0 ? PETSC_TRUE : PETSC_FALSE; 1092cd0c2139SMatthew G Knepley } else { 1093bb55d314SMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr); 1094ffaa4bbcSMatthew G. Knepley pos = rev > 0 ? PETSC_FALSE : PETSC_TRUE; 1095cd0c2139SMatthew G Knepley } 1096cd0c2139SMatthew G Knepley break; 1097cd0c2139SMatthew G Knepley } 1098cd0c2139SMatthew G Knepley } 1099cd0c2139SMatthew 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]); 1100cd0c2139SMatthew G Knepley /* Put faces touching the fault in the label */ 1101cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1102cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 1103cd0c2139SMatthew G Knepley 1104cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1105cd0c2139SMatthew G Knepley if (val == -1) { 1106cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 1107cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 1108cd0c2139SMatthew G Knepley 1109cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1110cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1111cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 1112cd0c2139SMatthew G Knepley 1113cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1114cd0c2139SMatthew G Knepley if ((val >= 0) && (val < dim-1)) { 1115cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1116cd0c2139SMatthew G Knepley break; 1117cd0c2139SMatthew G Knepley } 1118cd0c2139SMatthew G Knepley } 1119cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1120cd0c2139SMatthew G Knepley } 1121cd0c2139SMatthew G Knepley } 1122cd0c2139SMatthew G Knepley } 1123cd0c2139SMatthew G Knepley } 112447946fd8SMatthew G. Knepley if (subdm) { 112547946fd8SMatthew G. Knepley if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 112647946fd8SMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 112747946fd8SMatthew G. Knepley } 1128cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1129cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1130cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1131cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1132cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 1133cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1134cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1135cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1136d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */ 1137cd0c2139SMatthew G Knepley PetscInt *star = NULL; 1138cd0c2139SMatthew G Knepley PetscInt starSize, s; 1139cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1140cd0c2139SMatthew G Knepley 1141d4622b2cSMatthew G. Knepley /* All points connected to the fault are inside a cell, so at the top level we will only check cells */ 1142cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1143cd0c2139SMatthew G Knepley while (again) { 1144cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1145cd0c2139SMatthew G Knepley again = 0; 1146cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1147cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1148cd0c2139SMatthew G Knepley const PetscInt *cone; 1149cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1150cd0c2139SMatthew G Knepley 1151cd0c2139SMatthew G Knepley if ((point < cStart) || (point >= cEnd)) continue; 1152cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1153cd0c2139SMatthew G Knepley if (val != -1) continue; 1154d4622b2cSMatthew G. Knepley again = again == 1 ? 1 : 2; 1155cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1156cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1157cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1158cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1159cd0c2139SMatthew G Knepley if (val != -1) { 1160d7c8f101SMatthew G. Knepley const PetscInt *ccone; 1161d7c8f101SMatthew G. Knepley PetscInt cconeSize, cc, side, st; 1162d7c8f101SMatthew G. Knepley 1163cd0c2139SMatthew 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); 116437a6de01SMatthew G. Knepley if (val > 0) side = 1; 116537a6de01SMatthew G. Knepley else side = -1; 116637a6de01SMatthew G. Knepley ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr); 1167d7c8f101SMatthew G. Knepley /* Mark cell faces which touch the fault */ 1168d7c8f101SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr); 1169d7c8f101SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr); 1170d7c8f101SMatthew G. Knepley for (cc = 0; cc < cconeSize; ++cc) { 1171d7c8f101SMatthew G. Knepley PetscInt *closure = NULL; 1172d7c8f101SMatthew G. Knepley PetscInt closureSize, cl; 1173d7c8f101SMatthew G. Knepley 1174d7c8f101SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1175d4622b2cSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1176d7c8f101SMatthew G. Knepley const PetscInt clp = closure[cl]; 1177d7c8f101SMatthew G. Knepley 1178d7c8f101SMatthew G. Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1179d7c8f101SMatthew G. Knepley if (val == -1) continue; 1180d7c8f101SMatthew G. Knepley ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr); 118137a6de01SMatthew G. Knepley break; 118237a6de01SMatthew G. Knepley } 1183d7c8f101SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 118437a6de01SMatthew G. Knepley } 1185cd0c2139SMatthew G Knepley again = 1; 1186cd0c2139SMatthew G Knepley break; 1187cd0c2139SMatthew G Knepley } 1188cd0c2139SMatthew G Knepley } 1189cd0c2139SMatthew G Knepley } 1190cd0c2139SMatthew G Knepley } 1191cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1192cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1193cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1194cd0c2139SMatthew G Knepley 1195cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1196cd0c2139SMatthew G Knepley if (val == -1) { 1197cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1198cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1199cd0c2139SMatthew G Knepley PetscBool marked = PETSC_FALSE; 1200cd0c2139SMatthew G Knepley 1201cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1202cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1203cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1204cd0c2139SMatthew G Knepley 1205cd0c2139SMatthew G Knepley if ((spoint < cStart) || (spoint >= cEnd)) continue; 1206cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1207cd0c2139SMatthew 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); 1208d90583fdSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1209cd0c2139SMatthew G Knepley if (val > 0) { 1210cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1211cd0c2139SMatthew G Knepley } else { 1212cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1213cd0c2139SMatthew G Knepley } 1214cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1215cd0c2139SMatthew G Knepley break; 1216cd0c2139SMatthew G Knepley } 1217cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1218cd0c2139SMatthew G Knepley if (!marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1219cd0c2139SMatthew G Knepley } 1220cd0c2139SMatthew G Knepley } 1221cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1222cd0c2139SMatthew G Knepley } 1223cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1224cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1225cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1226cd0c2139SMatthew G Knepley } 1227cd0c2139SMatthew G Knepley 1228cd0c2139SMatthew G Knepley #undef __FUNCT__ 12293cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh" 12303cf72582SMatthew G. Knepley /*@C 12313cf72582SMatthew G. Knepley DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface 12323cf72582SMatthew G. Knepley 12333cf72582SMatthew G. Knepley Collective on dm 12343cf72582SMatthew G. Knepley 12353cf72582SMatthew G. Knepley Input Parameters: 12363cf72582SMatthew G. Knepley + dm - The original DM 12373cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices 12383cf72582SMatthew G. Knepley 12393cf72582SMatthew G. Knepley Output Parameters: 12403cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface 12413cf72582SMatthew G. Knepley - dmHybrid - The new DM 12423cf72582SMatthew G. Knepley 12433cf72582SMatthew G. Knepley Level: developer 12443cf72582SMatthew G. Knepley 12453cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate() 12463cf72582SMatthew G. Knepley @*/ 12473cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid) 12483cf72582SMatthew G. Knepley { 12493cf72582SMatthew G. Knepley DM idm; 12503cf72582SMatthew G. Knepley DMLabel subpointMap, hlabel; 12513cf72582SMatthew G. Knepley PetscInt dim; 12523cf72582SMatthew G. Knepley PetscErrorCode ierr; 12533cf72582SMatthew G. Knepley 12543cf72582SMatthew G. Knepley PetscFunctionBegin; 12553cf72582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 12563cf72582SMatthew G. Knepley if (hybridLabel) PetscValidPointer(hybridLabel, 3); 12573cf72582SMatthew G. Knepley PetscValidPointer(dmHybrid, 4); 12583cf72582SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 12593cf72582SMatthew G. Knepley ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr); 12603cf72582SMatthew G. Knepley ierr = DMPlexOrient(idm);CHKERRQ(ierr); 12613cf72582SMatthew G. Knepley ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr); 12623cf72582SMatthew G. Knepley ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr); 12633cf72582SMatthew G. Knepley ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr); 12643cf72582SMatthew G. Knepley ierr = DMPlexLabelCohesiveComplete(dm, hlabel, PETSC_FALSE, idm);CHKERRQ(ierr); 12653cf72582SMatthew G. Knepley ierr = DMDestroy(&idm);CHKERRQ(ierr); 12663cf72582SMatthew G. Knepley ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr); 12673cf72582SMatthew G. Knepley if (hybridLabel) *hybridLabel = hlabel; 126853aa2e23SMatthew G. Knepley else {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);} 12693cf72582SMatthew G. Knepley PetscFunctionReturn(0); 12703cf72582SMatthew G. Knepley } 12713cf72582SMatthew G. Knepley 12723cf72582SMatthew G. Knepley #undef __FUNCT__ 1273efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated" 1274efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 1275efa14ee0SMatthew G Knepley 1276efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 1277efa14ee0SMatthew G Knepley */ 1278830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1279efa14ee0SMatthew G Knepley { 1280fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 1281efa14ee0SMatthew G Knepley const PetscInt *subvertices; 128277d178adSMatthew G. Knepley PetscInt *pStart, *pEnd, *pMax, pSize; 1283efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1284efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1285efa14ee0SMatthew G Knepley 1286efa14ee0SMatthew G Knepley PetscFunctionBegin; 1287efa14ee0SMatthew G Knepley *numFaces = 0; 1288efa14ee0SMatthew G Knepley *nFV = 0; 1289efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1290efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 129177d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 129277d178adSMatthew G. Knepley ierr = PetscMalloc3(pSize,PetscInt,&pStart,pSize,PetscInt,&pEnd,pSize,PetscInt,&pMax);CHKERRQ(ierr); 1293d92e47f8SMatthew 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); 1294efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 1295efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1296efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1297efa14ee0SMatthew G Knepley } 1298efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1299fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1300efa14ee0SMatthew G Knepley if (subvertexIS) { 1301efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1302efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1303efa14ee0SMatthew G Knepley } 1304efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1305efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 13060298fd71SBarry Smith PetscInt *star = NULL; 1307efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 1308efa14ee0SMatthew G Knepley 1309efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1310efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1311efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1312efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1313efa14ee0SMatthew G Knepley } 1314efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 1315efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 13160298fd71SBarry Smith PetscInt *closure = NULL; 1317efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 1318efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 1319efa14ee0SMatthew G Knepley 1320efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 132165560c7fSMatthew G Knepley if (cellLoc == 2) continue; 132282f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1323efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1324efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1325efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1326efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1327efa14ee0SMatthew G Knepley 1328efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1329efa14ee0SMatthew G Knepley ++numCorners; 1330efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1331830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 1332efa14ee0SMatthew G Knepley } 1333efa14ee0SMatthew G Knepley } 133418ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 133582f516ccSBarry 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); 1336efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 1337007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 1338007baee2SMatthew G. Knepley PetscInt numCells, nc; 1339007baee2SMatthew G. Knepley 1340efa14ee0SMatthew G Knepley ++(*numFaces); 1341efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 1342efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 1343efa14ee0SMatthew G Knepley } 1344007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1345007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 1346007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 1347007baee2SMatthew G. Knepley } 1348007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1349efa14ee0SMatthew G Knepley } 1350efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1351efa14ee0SMatthew G Knepley } 1352efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1353efa14ee0SMatthew G Knepley } 1354efa14ee0SMatthew G Knepley if (subvertexIS) { 1355efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1356efa14ee0SMatthew G Knepley } 1357efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1358efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1359efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1360efa14ee0SMatthew G Knepley } 1361efa14ee0SMatthew G Knepley 1362efa14ee0SMatthew G Knepley #undef __FUNCT__ 1363efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated" 1364830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 1365efa14ee0SMatthew G Knepley { 1366efa14ee0SMatthew G Knepley IS subvertexIS; 1367efa14ee0SMatthew G Knepley const PetscInt *subvertices; 1368efa14ee0SMatthew G Knepley PetscInt *pStart, *pEnd, *pMax; 1369efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 1370efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1371efa14ee0SMatthew G Knepley 1372efa14ee0SMatthew G Knepley PetscFunctionBegin; 1373efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1374efa14ee0SMatthew G Knepley ierr = PetscMalloc3(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd,dim+1,PetscInt,&pMax);CHKERRQ(ierr); 13750298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1376efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 1377efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1378efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1379efa14ee0SMatthew G Knepley } 1380efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1381830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 1382efa14ee0SMatthew G Knepley if (subvertexIS) { 1383efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1384efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1385efa14ee0SMatthew G Knepley } 1386efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1387efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 13880298fd71SBarry Smith PetscInt *star = NULL; 1389efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 1390efa14ee0SMatthew G Knepley 1391efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1392efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1393efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1394efa14ee0SMatthew G Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 1395efa14ee0SMatthew G Knepley } 1396efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 1397efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 13980298fd71SBarry Smith PetscInt *closure = NULL; 1399efa14ee0SMatthew G Knepley PetscInt closureSize, c; 1400efa14ee0SMatthew G Knepley PetscInt faceLoc; 1401efa14ee0SMatthew G Knepley 1402efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 1403efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 140482f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 1405efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1406efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1407efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1408efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1409efa14ee0SMatthew G Knepley 1410efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1411efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1412830e53efSMatthew G. Knepley if (vertexLoc != value) break; 1413efa14ee0SMatthew G Knepley } 1414efa14ee0SMatthew G Knepley } 1415efa14ee0SMatthew G Knepley if (c == closureSize*2) { 1416efa14ee0SMatthew G Knepley const PetscInt *support; 1417efa14ee0SMatthew G Knepley PetscInt supportSize, s; 1418efa14ee0SMatthew G Knepley 1419efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1420efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1421efa14ee0SMatthew G Knepley 1422efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 1423efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1424efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1425efa14ee0SMatthew G Knepley break; 1426efa14ee0SMatthew G Knepley } 1427efa14ee0SMatthew G Knepley } 1428efa14ee0SMatthew G Knepley } 1429efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 1430efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 1431efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1432efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1433efa14ee0SMatthew G Knepley } 1434efa14ee0SMatthew G Knepley } 1435efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1436efa14ee0SMatthew G Knepley } 1437efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1438efa14ee0SMatthew G Knepley } 1439efa14ee0SMatthew G Knepley if (subvertexIS) { 1440efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1441efa14ee0SMatthew G Knepley } 1442efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1443efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1444efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1445efa14ee0SMatthew G Knepley } 1446efa14ee0SMatthew G Knepley 1447efa14ee0SMatthew G Knepley #undef __FUNCT__ 1448766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated" 144927c04023SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char labelname[], PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, PetscInt *subCells[], DM subdm) 1450766ab985SMatthew G. Knepley { 145127c04023SMatthew G. Knepley DMLabel label = NULL; 1452766ab985SMatthew G. Knepley const PetscInt *cone; 145327234c99SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize; 1454766ab985SMatthew G. Knepley PetscErrorCode ierr; 1455766ab985SMatthew G. Knepley 1456812bfc34SJed Brown PetscFunctionBegin; 1457c0ed958bSJed Brown *numFaces = 0; 1458c0ed958bSJed Brown *nFV = 0; 1459b6d5cb33SJed Brown if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1460fed694aaSMatthew G. Knepley *subCells = NULL; 1461766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1462766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1463766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1464766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 146527c04023SMatthew G. Knepley if (label) { 146627c04023SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 146727c04023SMatthew G. Knepley PetscInt val; 146827c04023SMatthew G. Knepley 146927c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 147027c04023SMatthew G. Knepley if (val == value) { 147127c04023SMatthew G. Knepley ++(*numFaces); 147227c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 147327c04023SMatthew G. Knepley } 147427c04023SMatthew G. Knepley } 147527c04023SMatthew G. Knepley } else { 1476766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 147727c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 147827c04023SMatthew G. Knepley } 1479766ab985SMatthew G. Knepley *nFV = hasLagrange ? coneSize/3 : coneSize/2; 1480766ab985SMatthew G. Knepley ierr = PetscMalloc(*numFaces *2 * sizeof(PetscInt), subCells);CHKERRQ(ierr); 1481766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1482766ab985SMatthew G. Knepley const PetscInt *cells; 1483766ab985SMatthew G. Knepley PetscInt numCells; 1484766ab985SMatthew G. Knepley 148527c04023SMatthew G. Knepley if (label) { 148627c04023SMatthew G. Knepley PetscInt val; 148727c04023SMatthew G. Knepley 148827c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 148927c04023SMatthew G. Knepley if (val != value) continue; 149027c04023SMatthew G. Knepley } 1491766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1492766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 1493766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 1494766ab985SMatthew G. Knepley } 1495766ab985SMatthew G. Knepley /* Negative face */ 1496766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 149727234c99SMatthew G. Knepley /* Not true in parallel 149827234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 1499766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 1500766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 150127234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 1502766ab985SMatthew G. Knepley } 1503766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 1504766ab985SMatthew G. Knepley /* Positive face is not included */ 1505766ab985SMatthew G. Knepley } 1506766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1507766ab985SMatthew G. Knepley } 1508766ab985SMatthew G. Knepley 1509766ab985SMatthew G. Knepley #undef __FUNCT__ 1510766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated" 151127c04023SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, PetscBool hasLagrange, const char labelname[], PetscInt value, DMLabel subpointMap, DM subdm) 1512766ab985SMatthew G. Knepley { 151327c04023SMatthew G. Knepley DMLabel label = NULL; 1514766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 1515766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 1516766ab985SMatthew G. Knepley PetscErrorCode ierr; 1517766ab985SMatthew G. Knepley 1518812bfc34SJed Brown PetscFunctionBegin; 151927c04023SMatthew G. Knepley if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1520766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1521766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1522766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1523766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 1524766ab985SMatthew G. Knepley ierr = PetscMalloc2(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd);CHKERRQ(ierr); 1525766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 1526766ab985SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1527766ab985SMatthew G. Knepley } 1528766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1529766ab985SMatthew G. Knepley const PetscInt *cone; 1530766ab985SMatthew G. Knepley PetscInt *closure = NULL; 1531766ab985SMatthew G. Knepley PetscInt coneSize, closureSize, cl; 1532766ab985SMatthew G. Knepley 153327c04023SMatthew G. Knepley if (label) { 153427c04023SMatthew G. Knepley PetscInt val; 153527c04023SMatthew G. Knepley 153627c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 153727c04023SMatthew G. Knepley if (val != value) continue; 153827c04023SMatthew G. Knepley } 1539766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 1540766ab985SMatthew G. Knepley if (hasLagrange) { 1541766ab985SMatthew G. Knepley if (coneSize != 3) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 1542766ab985SMatthew G. Knepley } else { 1543766ab985SMatthew G. Knepley if (coneSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 1544766ab985SMatthew G. Knepley } 1545766ab985SMatthew G. Knepley /* Negative face */ 1546766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1547766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1548766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1549766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 1550766ab985SMatthew G. Knepley 1551766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 1552766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1553766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1554766ab985SMatthew G. Knepley break; 1555766ab985SMatthew G. Knepley } 1556766ab985SMatthew G. Knepley } 1557766ab985SMatthew G. Knepley } 1558766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1559766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 1560766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 1561766ab985SMatthew G. Knepley const PetscInt *support; 1562766ab985SMatthew G. Knepley PetscInt supportSize, s; 1563766ab985SMatthew G. Knepley 1564766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 1565766ab985SMatthew G. Knepley if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); 1566766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 1567766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 1568766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1569766ab985SMatthew G. Knepley } 1570766ab985SMatthew G. Knepley } 1571766ab985SMatthew G. Knepley } 1572766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 1573766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1574766ab985SMatthew G. Knepley } 1575766ab985SMatthew G. Knepley 1576766ab985SMatthew G. Knepley #undef __FUNCT__ 1577e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation" 1578e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 1579e6ccafaeSMatthew G Knepley { 158082f516ccSBarry Smith MPI_Comm comm; 1581e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 1582e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 1583e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 1584e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1585e6ccafaeSMatthew G Knepley 158682f516ccSBarry Smith PetscFunctionBegin; 158782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1588e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &cellDim);CHKERRQ(ierr); 1589e6ccafaeSMatthew G Knepley if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 1590e6ccafaeSMatthew G Knepley 1591ddeab2a6SMatthew G. Knepley if (cellDim == 1 && numCorners == 2) { 1592ddeab2a6SMatthew G. Knepley /* Triangle */ 1593e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 1594e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1595ddeab2a6SMatthew G. Knepley } else if (cellDim == 2 && numCorners == 3) { 1596ddeab2a6SMatthew G. Knepley /* Triangle */ 1597ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 1598ddeab2a6SMatthew G. Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1599ddeab2a6SMatthew G. Knepley } else if (cellDim == 3 && numCorners == 4) { 1600ddeab2a6SMatthew G. Knepley /* Tetrahedron */ 1601ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 1602ddeab2a6SMatthew G. Knepley posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1603e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 1604e6ccafaeSMatthew G Knepley /* Quadratic line */ 1605e6ccafaeSMatthew G Knepley faceSize = 1; 1606e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1607e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 1608e6ccafaeSMatthew G Knepley /* Quads */ 1609e6ccafaeSMatthew G Knepley faceSize = 2; 1610e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 1611e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1612e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 1613e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1614e6ccafaeSMatthew G Knepley } else { 1615e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 1616e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 1617e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 1618e6ccafaeSMatthew G Knepley } 1619e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 1620e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 1621e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 1622e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 1623e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 1624e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1625e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 1626e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 1627e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 1628e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 1629e6ccafaeSMatthew G Knepley }; 1630e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 1631e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 1632e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 1633e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 1634e6ccafaeSMatthew G Knepley }; 1635e6ccafaeSMatthew G Knepley 1636e6ccafaeSMatthew G Knepley faceSize = faceSizeTri; 1637e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 1638e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 1639e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 1640e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 1641e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1642e6ccafaeSMatthew G Knepley 1643e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 1644e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 1645e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 1646e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 1647e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 1648e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1649e6ccafaeSMatthew G Knepley break; 1650e6ccafaeSMatthew G Knepley } 1651e6ccafaeSMatthew G Knepley } 1652e6ccafaeSMatthew G Knepley } 1653e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1654e6ccafaeSMatthew G Knepley break; 1655e6ccafaeSMatthew G Knepley } 1656e6ccafaeSMatthew G Knepley } 1657e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 1658e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1659e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1660e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 1661e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 1662e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 1663e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 1664e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 1665e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1666e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 1667e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 1668e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 1669e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 1670e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 1671e6ccafaeSMatthew G Knepley }; 1672e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 1673e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 1674e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 1675e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 1676e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 1677e6ccafaeSMatthew G Knepley }; 1678e6ccafaeSMatthew G Knepley 1679e6ccafaeSMatthew G Knepley faceSize = faceSizeQuad; 1680e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 1681e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 1682e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 1683e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 1684e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1685e6ccafaeSMatthew G Knepley 1686e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 1687e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 1688e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 1689e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 1690e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 1691e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1692e6ccafaeSMatthew G Knepley break; 1693e6ccafaeSMatthew G Knepley } 1694e6ccafaeSMatthew G Knepley } 1695e6ccafaeSMatthew G Knepley } 1696e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1697e6ccafaeSMatthew G Knepley break; 1698e6ccafaeSMatthew G Knepley } 1699e6ccafaeSMatthew G Knepley } 1700e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 1701e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1702e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1703e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 1704e6ccafaeSMatthew G Knepley /* Hexes 1705e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 1706e6ccafaeSMatthew G Knepley pointing up at the second. 1707e6ccafaeSMatthew G Knepley 1708e6ccafaeSMatthew G Knepley 7---6 1709e6ccafaeSMatthew G Knepley /| /| 1710e6ccafaeSMatthew G Knepley 4---5 | 1711ddeab2a6SMatthew G. Knepley | 1-|-2 1712e6ccafaeSMatthew G Knepley |/ |/ 1713ddeab2a6SMatthew G. Knepley 0---3 1714e6ccafaeSMatthew G Knepley 1715e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 1716e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 1717e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 1718e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1719e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 1720e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 1721e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 1722ddeab2a6SMatthew G. Knepley 0, 3, 4, 5, /* front */ 1723ddeab2a6SMatthew G. Knepley 2, 3, 5, 6, /* right */ 1724ddeab2a6SMatthew G. Knepley 1, 2, 6, 7, /* back */ 1725ddeab2a6SMatthew G. Knepley 0, 1, 4, 7, /* left */ 1726e6ccafaeSMatthew G Knepley }; 1727e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 1728ddeab2a6SMatthew G. Knepley 1, 2, 3, 0, /* bottom */ 1729e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 1730ddeab2a6SMatthew G. Knepley 0, 3, 5, 4, /* front */ 1731ddeab2a6SMatthew G. Knepley 3, 2, 6, 5, /* right */ 1732ddeab2a6SMatthew G. Knepley 2, 1, 7, 6, /* back */ 1733ddeab2a6SMatthew G. Knepley 1, 0, 4, 7, /* left */ 1734e6ccafaeSMatthew G Knepley }; 1735e6ccafaeSMatthew G Knepley 1736e6ccafaeSMatthew G Knepley faceSize = faceSizeHex; 1737e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 1738e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 1739e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 1740e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 1741e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1742e6ccafaeSMatthew G Knepley 1743e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 1744e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 1745e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 1746e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 1747e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 1748e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 1749e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 1750e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1751e6ccafaeSMatthew G Knepley break; 1752e6ccafaeSMatthew G Knepley } 1753e6ccafaeSMatthew G Knepley } 1754e6ccafaeSMatthew G Knepley } 1755e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1756e6ccafaeSMatthew G Knepley break; 1757e6ccafaeSMatthew G Knepley } 1758e6ccafaeSMatthew G Knepley } 1759e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 1760e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1761e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1762e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 1763e6ccafaeSMatthew G Knepley /* Quadratic tet */ 1764e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 1765e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 1766e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 1767e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1768e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 1769e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 1770e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 1771e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 1772e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 1773e6ccafaeSMatthew G Knepley }; 1774e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 1775e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 1776e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 1777e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 1778e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 1779e6ccafaeSMatthew G Knepley }; 1780e6ccafaeSMatthew G Knepley 1781e6ccafaeSMatthew G Knepley faceSize = faceSizeTet; 1782e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 1783e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 1784e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 1785e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 1786e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1787e6ccafaeSMatthew G Knepley 1788e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 1789e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 1790e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 1791e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 1792e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 1793e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 1794e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 1795e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1796e6ccafaeSMatthew G Knepley break; 1797e6ccafaeSMatthew G Knepley } 1798e6ccafaeSMatthew G Knepley } 1799e6ccafaeSMatthew G Knepley } 1800e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1801e6ccafaeSMatthew G Knepley break; 1802e6ccafaeSMatthew G Knepley } 1803e6ccafaeSMatthew G Knepley } 1804e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 1805e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1806e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1807e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 1808e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 1809e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 1810e6ccafaeSMatthew G Knepley pointing up at the second. 1811e6ccafaeSMatthew G Knepley 1812e6ccafaeSMatthew G Knepley 7---6 1813e6ccafaeSMatthew G Knepley /| /| 1814e6ccafaeSMatthew G Knepley 4---5 | 1815e6ccafaeSMatthew G Knepley | 3-|-2 1816e6ccafaeSMatthew G Knepley |/ |/ 1817e6ccafaeSMatthew G Knepley 0---1 1818e6ccafaeSMatthew G Knepley 1819e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 1820e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 1821e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 1822e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1823e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 1824e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 1825e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 1826e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 1827e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 1828e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 1829e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 1830e6ccafaeSMatthew G Knepley }; 1831e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 1832e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 1833e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 1834e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 1835e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 1836e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 1837e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 1838e6ccafaeSMatthew G Knepley }; 1839e6ccafaeSMatthew G Knepley 1840e6ccafaeSMatthew G Knepley faceSize = faceSizeQuadHex; 1841e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 1842e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 1843e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 1844e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 1845e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1846e6ccafaeSMatthew G Knepley 1847e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 1848e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 1849e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 1850e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 1851e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 1852e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 1853e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 1854e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1855e6ccafaeSMatthew G Knepley break; 1856e6ccafaeSMatthew G Knepley } 1857e6ccafaeSMatthew G Knepley } 1858e6ccafaeSMatthew G Knepley } 1859e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1860e6ccafaeSMatthew G Knepley break; 1861e6ccafaeSMatthew G Knepley } 1862e6ccafaeSMatthew G Knepley } 1863e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 1864e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1865e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1866e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 1867e6ccafaeSMatthew G Knepley if (!posOrient) { 1868e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 1869e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 1870e6ccafaeSMatthew G Knepley } else { 1871e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 1872e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 1873e6ccafaeSMatthew G Knepley } 1874e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 1875e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1876e6ccafaeSMatthew G Knepley } 1877e6ccafaeSMatthew G Knepley 1878e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1879e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace" 1880e6ccafaeSMatthew G Knepley /* 1881e6ccafaeSMatthew G Knepley Given a cell and a face, as a set of vertices, 1882e6ccafaeSMatthew G Knepley return the oriented face, as a set of vertices, in faceVertices 1883e6ccafaeSMatthew G Knepley The orientation is such that the face normal points out of the cell 1884e6ccafaeSMatthew G Knepley */ 1885e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 1886e6ccafaeSMatthew G Knepley { 18870298fd71SBarry Smith const PetscInt *cone = NULL; 1888e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 1889e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 1890e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1891e6ccafaeSMatthew G Knepley 1892e6ccafaeSMatthew G Knepley PetscFunctionBegin; 1893e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 1894e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 1895e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 1896e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1897e6ccafaeSMatthew G Knepley 1898e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 1899e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 1900e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 1901e6ccafaeSMatthew G Knepley } 1902e6ccafaeSMatthew G Knepley } 1903e6ccafaeSMatthew G Knepley if (found) { 1904e6ccafaeSMatthew G Knepley indices[v2] = v; 1905e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 1906e6ccafaeSMatthew G Knepley ++v2; 1907e6ccafaeSMatthew G Knepley } else { 1908e6ccafaeSMatthew G Knepley oppositeVertex = v; 1909e6ccafaeSMatthew G Knepley } 1910e6ccafaeSMatthew G Knepley } 1911e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 1912e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1913e6ccafaeSMatthew G Knepley } 1914e6ccafaeSMatthew G Knepley 1915e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1916cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal" 1917e6ccafaeSMatthew G Knepley /* 1918cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 1919e6ccafaeSMatthew G Knepley 1920e6ccafaeSMatthew G Knepley Not collective 1921e6ccafaeSMatthew G Knepley 1922e6ccafaeSMatthew G Knepley Input Parameters: 1923e6ccafaeSMatthew G Knepley + dm - The DMPlex 1924e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 1925e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 1926e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 1927e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 1928e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 1929e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 1930e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 1931e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 1932e6ccafaeSMatthew G Knepley 1933e6ccafaeSMatthew G Knepley Output Parameters: 1934e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 1935e6ccafaeSMatthew G Knepley 1936e6ccafaeSMatthew G Knepley Level: developer 1937e6ccafaeSMatthew G Knepley */ 1938cd0c2139SMatthew 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) 1939e6ccafaeSMatthew G Knepley { 194082f516ccSBarry Smith MPI_Comm comm; 1941e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 1942e6ccafaeSMatthew G Knepley const PetscInt *faces; 1943e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 1944e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1945e6ccafaeSMatthew G Knepley 1946e6ccafaeSMatthew G Knepley PetscFunctionBegin; 194782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1948e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 1949e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 1950e6ccafaeSMatthew G Knepley #if 0 1951e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 1952e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 1953e6ccafaeSMatthew G Knepley #else 1954e6ccafaeSMatthew G Knepley { 1955e6ccafaeSMatthew G Knepley PetscInt f; 1956e6ccafaeSMatthew G Knepley 1957e6ccafaeSMatthew G Knepley numFaces = 0; 1958e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 1959e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 1960e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 1961e6ccafaeSMatthew G Knepley 1962e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 1963e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 1964e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 1965e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 1966e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 1967e6ccafaeSMatthew G Knepley PetscInt v; 1968e6ccafaeSMatthew G Knepley 1969e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 1970e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 1971e6ccafaeSMatthew G Knepley } 1972e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 1973e6ccafaeSMatthew G Knepley } 1974e6ccafaeSMatthew G Knepley if (d == dof) { 1975e6ccafaeSMatthew G Knepley numFaces = 1; 1976e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 1977e6ccafaeSMatthew G Knepley } 1978e6ccafaeSMatthew G Knepley } 1979e6ccafaeSMatthew G Knepley } 1980e6ccafaeSMatthew G Knepley #endif 1981e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 1982e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 1983e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 1984766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 1985e6ccafaeSMatthew G Knepley } else { 1986e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 1987e6ccafaeSMatthew G Knepley PetscBool posOriented; 1988e6ccafaeSMatthew G Knepley 1989e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 1990e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 1991e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 1992e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 1993e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 1994e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 1995e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 1996e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 1997e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 1998e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 1999e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 2000e6ccafaeSMatthew G Knepley break; 2001e6ccafaeSMatthew G Knepley } 2002e6ccafaeSMatthew G Knepley } 2003e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 2004e6ccafaeSMatthew G Knepley } 2005e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 2006e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 2007e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2008e6ccafaeSMatthew G Knepley ++(*newFacePoint); 2009e6ccafaeSMatthew G Knepley } 2010ef07cca7SMatthew G. Knepley #if 0 2011e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2012ef07cca7SMatthew G. Knepley #else 2013ef07cca7SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2014ef07cca7SMatthew G. Knepley #endif 2015e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2016e6ccafaeSMatthew G Knepley } 2017e6ccafaeSMatthew G Knepley 2018e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2019e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated" 202053156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2021e6ccafaeSMatthew G Knepley { 202282f516ccSBarry Smith MPI_Comm comm; 202353156dfcSMatthew G. Knepley DMLabel subpointMap; 2024efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 2025efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 2026efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 2027fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 2028efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 2029e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2030e6ccafaeSMatthew G Knepley 2031e6ccafaeSMatthew G Knepley PetscFunctionBegin; 203282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2033efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2034efa14ee0SMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2035efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2036efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 203753156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);} 2038efa14ee0SMatthew G Knepley /* Setup chart */ 2039efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2040efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2041efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2042efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2043e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2044e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 2045efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 2046e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 2047efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2048efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2049efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 2050efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2051e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2052e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2053e6ccafaeSMatthew G Knepley } 2054e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2055e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2056e6ccafaeSMatthew G Knepley } 2057e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2058e6ccafaeSMatthew G Knepley /* Create face cones */ 2059efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 20600298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2061efa14ee0SMatthew G Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2062e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2063e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 2064efa14ee0SMatthew G Knepley const PetscInt subcell = c; 20650298fd71SBarry Smith PetscInt *closure = NULL; 2066efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 2067e6ccafaeSMatthew G Knepley 2068e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2069efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2070efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 2071e6ccafaeSMatthew G Knepley PetscInt subVertex; 2072e6ccafaeSMatthew G Knepley 2073efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 2074efa14ee0SMatthew G Knepley ++numCorners; 2075efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 2076efa14ee0SMatthew G Knepley if (subVertex >= 0) { 2077efa14ee0SMatthew G Knepley closure[faceSize] = point; 207865560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 2079e6ccafaeSMatthew G Knepley ++faceSize; 2080e6ccafaeSMatthew G Knepley } 2081e6ccafaeSMatthew G Knepley } 2082e6ccafaeSMatthew G Knepley } 2083efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 2084efa14ee0SMatthew G Knepley if (faceSize == nFV) { 2085cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 2086e6ccafaeSMatthew G Knepley } 208765560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2088e6ccafaeSMatthew G Knepley } 2089efa14ee0SMatthew G Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2090e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2091e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2092e6ccafaeSMatthew G Knepley /* Build coordinates */ 2093efa14ee0SMatthew G Knepley { 2094efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 2095efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 2096efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 2097285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2098efa14ee0SMatthew G Knepley 2099e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2100e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2101e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2102285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2103285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2104285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2105efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2106efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2107efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2108efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2109efa14ee0SMatthew G Knepley PetscInt dof; 2110efa14ee0SMatthew G Knepley 2111efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2112efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2113285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2114e6ccafaeSMatthew G Knepley } 2115e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2116e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2117e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2118e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 21192eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2120830e53efSMatthew G. Knepley if (coordSize) { 2121e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2122e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2123efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2124efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2125efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2126efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2127e6ccafaeSMatthew G Knepley 2128e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2129e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2130efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2131efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2132efa14ee0SMatthew 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); 2133e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2134e6ccafaeSMatthew G Knepley } 2135e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2136e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 21373b399e24SMatthew G. Knepley } 2138e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2139e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2140e6ccafaeSMatthew G Knepley } 2141efa14ee0SMatthew G Knepley /* Cleanup */ 2142efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2143efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2144efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2145efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2146e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2147e6ccafaeSMatthew G Knepley } 2148e6ccafaeSMatthew G Knepley 2149e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2150e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated" 215153156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2152e6ccafaeSMatthew G Knepley { 215382f516ccSBarry Smith MPI_Comm comm; 215453156dfcSMatthew G. Knepley DMLabel subpointMap; 2155efa14ee0SMatthew G Knepley IS *subpointIS; 2156efa14ee0SMatthew G Knepley const PetscInt **subpoints; 215701a2673eSMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *coneONew; 2158efa14ee0SMatthew G Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2159e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2160e6ccafaeSMatthew G Knepley 2161e6ccafaeSMatthew G Knepley PetscFunctionBegin; 216282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2163efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2164e6ccafaeSMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2165efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2166efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 216753156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Interpolated(dm, vertexLabel, value, subpointMap, subdm);CHKERRQ(ierr);} 2168efa14ee0SMatthew G Knepley /* Setup chart */ 2169efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2170efa14ee0SMatthew G Knepley ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr); 2171e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2172e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2173e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 2174e6ccafaeSMatthew G Knepley } 2175e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2176e6ccafaeSMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2177e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2178e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 2179e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2180e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2181e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2182e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2183e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2184e6ccafaeSMatthew G Knepley ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2185e6ccafaeSMatthew G Knepley } 2186e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2187e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2188e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2189e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2190e6ccafaeSMatthew G Knepley const PetscInt *cone; 2191e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 2192e6ccafaeSMatthew G Knepley 2193e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2194e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2195e6ccafaeSMatthew G Knepley if (d == dim) { 2196e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2197e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2198e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2199e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 2200e6ccafaeSMatthew G Knepley } 2201e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2202e6ccafaeSMatthew G Knepley } 2203e6ccafaeSMatthew G Knepley } 2204e6ccafaeSMatthew G Knepley } 2205e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2206e6ccafaeSMatthew G Knepley /* Set cones */ 22070298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 220801a2673eSMatthew G. Knepley ierr = PetscMalloc2(maxConeSize,PetscInt,&coneNew,maxConeSize,PetscInt,&coneONew);CHKERRQ(ierr); 2209e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2210e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2211e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2212e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 22130e49e2e2SMatthew G. Knepley const PetscInt *cone, *ornt; 2214e6ccafaeSMatthew G Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2215e6ccafaeSMatthew G Knepley 2216e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2217e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2218e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 22190e49e2e2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2220e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2221e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 222201a2673eSMatthew G. Knepley if (subc >= 0) { 222301a2673eSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 222401a2673eSMatthew G. Knepley coneONew[coneSizeNew] = ornt[c]; 222501a2673eSMatthew G. Knepley ++coneSizeNew; 222601a2673eSMatthew G. Knepley } 2227e6ccafaeSMatthew G Knepley } 2228e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2229e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 223001a2673eSMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, coneONew);CHKERRQ(ierr); 2231e6ccafaeSMatthew G Knepley } 2232e6ccafaeSMatthew G Knepley } 223301a2673eSMatthew G. Knepley ierr = PetscFree2(coneNew,coneONew);CHKERRQ(ierr); 2234e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2235e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2236e6ccafaeSMatthew G Knepley /* Build coordinates */ 2237e6ccafaeSMatthew G Knepley { 2238e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 2239e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 2240e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 2241285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2242e6ccafaeSMatthew G Knepley 2243e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2244e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2245e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2246285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2247285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2248285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2249e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2250e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2251e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2252e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2253e6ccafaeSMatthew G Knepley PetscInt dof; 2254e6ccafaeSMatthew G Knepley 2255e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2256e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2257285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2258e6ccafaeSMatthew G Knepley } 2259e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2260e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2261e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2262e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 22632eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2264e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2265e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2266e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2267e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2268e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2269e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2270e6ccafaeSMatthew G Knepley 2271e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2272e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2273e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2274e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2275e6ccafaeSMatthew 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); 2276efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2277e6ccafaeSMatthew G Knepley } 2278e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2279e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2280e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2281e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2282e6ccafaeSMatthew G Knepley } 2283efa14ee0SMatthew G Knepley /* Cleanup */ 2284e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2285e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2286e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2287e6ccafaeSMatthew G Knepley } 2288efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2289e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2290e6ccafaeSMatthew G Knepley } 2291e6ccafaeSMatthew G Knepley 2292e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2293e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh" 2294d0fa310fSMatthew G. Knepley /*@ 2295e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 2296e6ccafaeSMatthew G Knepley 2297e6ccafaeSMatthew G Knepley Input Parameters: 2298e6ccafaeSMatthew G Knepley + dm - The original mesh 2299830e53efSMatthew G. Knepley . vertexLabel - The DMLabel marking vertices contained in the surface 2300830e53efSMatthew G. Knepley - value - The label value to use 2301e6ccafaeSMatthew G Knepley 2302e6ccafaeSMatthew G Knepley Output Parameter: 2303e6ccafaeSMatthew G Knepley . subdm - The surface mesh 2304e6ccafaeSMatthew G Knepley 2305e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2306e6ccafaeSMatthew G Knepley 2307e6ccafaeSMatthew G Knepley Level: developer 2308e6ccafaeSMatthew G Knepley 2309e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue() 2310830e53efSMatthew G. Knepley @*/ 231153156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm) 2312e6ccafaeSMatthew G Knepley { 2313e6ccafaeSMatthew G Knepley PetscInt dim, depth; 2314e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2315e6ccafaeSMatthew G Knepley 2316e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2317e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2318766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 2319e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2320e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 232182f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2322e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2323e6ccafaeSMatthew G Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2324e6ccafaeSMatthew G Knepley if (depth == dim) { 2325830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2326e6ccafaeSMatthew G Knepley } else { 2327830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2328e6ccafaeSMatthew G Knepley } 2329e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2330e6ccafaeSMatthew G Knepley } 2331e6ccafaeSMatthew G Knepley 2332e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2333aca35d17SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal" 2334aca35d17SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 2335aca35d17SMatthew G. Knepley { 2336aca35d17SMatthew G. Knepley PetscInt subPoint; 2337aca35d17SMatthew G. Knepley PetscErrorCode ierr; 2338aca35d17SMatthew G. Knepley 2339aca35d17SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 2340aca35d17SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 2341aca35d17SMatthew G. Knepley } 2342aca35d17SMatthew G. Knepley 2343aca35d17SMatthew G. Knepley #undef __FUNCT__ 2344766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated" 234527c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 2346766ab985SMatthew G. Knepley { 2347766ab985SMatthew G. Knepley MPI_Comm comm; 2348766ab985SMatthew G. Knepley DMLabel subpointMap; 2349766ab985SMatthew G. Knepley IS subvertexIS; 2350766ab985SMatthew G. Knepley const PetscInt *subVertices; 2351fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 2352766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 235387feddfdSMatthew G. Knepley PetscInt cMax, c, f; 2354766ab985SMatthew G. Knepley PetscErrorCode ierr; 2355766ab985SMatthew G. Knepley 2356766ab985SMatthew G. Knepley PetscFunctionBegin; 2357766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 2358766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2359766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2360766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2361766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 236227c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 2363766ab985SMatthew G. Knepley /* Setup chart */ 2364766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2365766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2366766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2367766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2368766ab985SMatthew G. Knepley /* Set cone sizes */ 2369766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 2370766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 2371766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 2372766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2373766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2374766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2375766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2376766ab985SMatthew G. Knepley } 2377766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2378766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2379766ab985SMatthew G. Knepley } 2380766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2381766ab985SMatthew G. Knepley /* Create face cones */ 2382766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 238387feddfdSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2384766ab985SMatthew G. Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2385766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2386766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 2387766ab985SMatthew G. Knepley const PetscInt subcell = c; 238887feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 238987feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 2390766ab985SMatthew G. Knepley 239187feddfdSMatthew G. Knepley if (cell < cMax) continue; 239287feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 239387feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 239487feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 239587feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 239687feddfdSMatthew G. Knepley } 239787feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 239887feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 239987feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 240027234c99SMatthew G. Knepley /* Not true in parallel 240127234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 240287feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 240387feddfdSMatthew G. Knepley PetscInt negsubcell; 2404766ab985SMatthew G. Knepley 240587feddfdSMatthew G. Knepley if (cells[p] >= cMax) continue; 240687feddfdSMatthew G. Knepley /* I know this is a crap search */ 240787feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 240887feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 2409766ab985SMatthew G. Knepley } 241087feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 241187feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 2412766ab985SMatthew G. Knepley } 241387feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 241487feddfdSMatthew G. Knepley ++newFacePoint; 2415766ab985SMatthew G. Knepley } 2416766ab985SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2417766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2418766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2419766ab985SMatthew G. Knepley /* Build coordinates */ 2420766ab985SMatthew G. Knepley { 2421766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2422766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2423766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2424285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2425766ab985SMatthew G. Knepley 2426766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2427766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2428766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2429285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2430285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2431285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2432766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2433766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2434766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2435766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2436766ab985SMatthew G. Knepley PetscInt dof; 2437766ab985SMatthew G. Knepley 2438766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2439766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2440285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2441766ab985SMatthew G. Knepley } 2442766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2443766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2444766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2445766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 24462eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2447766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2448766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2449766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2450766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2451766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2452766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 2453766ab985SMatthew G. Knepley 2454766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2455766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2456766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2457766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2458766ab985SMatthew 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); 2459766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2460766ab985SMatthew G. Knepley } 2461766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2462766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2463766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2464766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2465766ab985SMatthew G. Knepley } 2466aca35d17SMatthew G. Knepley /* Build SF */ 2467aca35d17SMatthew G. Knepley CHKMEMQ; 2468aca35d17SMatthew G. Knepley { 2469aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 2470aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 2471bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 2472aca35d17SMatthew G. Knepley const PetscInt *localPoints; 2473bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 247449c26ae4SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 2475bdcf2095SMatthew G. Knepley PetscMPIInt rank; 2476aca35d17SMatthew G. Knepley 2477bdcf2095SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 2478aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 2479aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 2480aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2481aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 2482aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 2483aca35d17SMatthew G. Knepley if (numRoots >= 0) { 2484aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 2485bdcf2095SMatthew G. Knepley ierr = PetscMalloc2(pEnd-pStart,PetscSFNode,&newLocalPoints,numRoots,PetscSFNode,&newOwners);CHKERRQ(ierr); 2486bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 2487bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 2488bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 2489bdcf2095SMatthew G. Knepley } 24909e0823b2SMatthew G. Knepley /* Set subleaves */ 2491aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2492aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 2493bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2494aca35d17SMatthew G. Knepley 2495aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 2496bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 2497bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 2498bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 2499bdcf2095SMatthew G. Knepley ++numSubLeaves; 2500aca35d17SMatthew G. Knepley } 25019e0823b2SMatthew G. Knepley /* Must put in owned subpoints */ 25029e0823b2SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 25039e0823b2SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 25049e0823b2SMatthew G. Knepley 25059e0823b2SMatthew G. Knepley if (subPoint < 0) { 25069e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = -3; 25079e0823b2SMatthew G. Knepley newOwners[p-pStart].index = -3; 25089e0823b2SMatthew G. Knepley } else { 25099e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = rank; 25109e0823b2SMatthew G. Knepley newOwners[p-pStart].index = subPoint; 25119e0823b2SMatthew G. Knepley } 2512bdcf2095SMatthew G. Knepley } 2513bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2514bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2515bdcf2095SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2516bdcf2095SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2517aca35d17SMatthew G. Knepley ierr = PetscMalloc(numSubLeaves * sizeof(PetscInt), &slocalPoints);CHKERRQ(ierr); 2518aca35d17SMatthew G. Knepley ierr = PetscMalloc(numSubLeaves * sizeof(PetscSFNode), &sremotePoints);CHKERRQ(ierr); 251949c26ae4SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 2520bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 2521bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2522aca35d17SMatthew G. Knepley 2523aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 252449c26ae4SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 2525aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 2526bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 2527bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 2528bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 2529bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 2530aca35d17SMatthew G. Knepley ++sl; 2531aca35d17SMatthew G. Knepley } 2532bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 253349c26ae4SMatthew G. Knepley if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 253449c26ae4SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 2535aca35d17SMatthew G. Knepley } 2536aca35d17SMatthew G. Knepley } 2537aca35d17SMatthew G. Knepley CHKMEMQ; 2538766ab985SMatthew G. Knepley /* Cleanup */ 2539766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2540766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2541766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 2542766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2543766ab985SMatthew G. Knepley } 2544766ab985SMatthew G. Knepley 2545766ab985SMatthew G. Knepley #undef __FUNCT__ 2546766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated" 254727c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 2548766ab985SMatthew G. Knepley { 2549766ab985SMatthew G. Knepley MPI_Comm comm; 2550766ab985SMatthew G. Knepley DMLabel subpointMap; 2551766ab985SMatthew G. Knepley IS *subpointIS; 2552766ab985SMatthew G. Knepley const PetscInt **subpoints; 2553766ab985SMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew; 2554766ab985SMatthew G. Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2555766ab985SMatthew G. Knepley PetscErrorCode ierr; 2556766ab985SMatthew G. Knepley 2557766ab985SMatthew G. Knepley PetscFunctionBegin; 2558766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2559766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2560766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2561766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2562766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 256327c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, hasLagrange, label, value, subpointMap, subdm);CHKERRQ(ierr); 2564766ab985SMatthew G. Knepley /* Setup chart */ 2565766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2566766ab985SMatthew G. Knepley ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr); 2567766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2568766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2569766ab985SMatthew G. Knepley totSubPoints += numSubPoints[d]; 2570766ab985SMatthew G. Knepley } 2571766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2572766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2573766ab985SMatthew G. Knepley /* Set cone sizes */ 2574766ab985SMatthew G. Knepley firstSubPoint[dim] = 0; 2575766ab985SMatthew G. Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2576766ab985SMatthew G. Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2577766ab985SMatthew G. Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2578766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2579766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2580766ab985SMatthew G. Knepley ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2581766ab985SMatthew G. Knepley } 2582766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2583766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2584766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2585766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2586766ab985SMatthew G. Knepley const PetscInt *cone; 2587766ab985SMatthew G. Knepley PetscInt coneSize, coneSizeNew, c, val; 2588766ab985SMatthew G. Knepley 2589766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2590766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2591766ab985SMatthew G. Knepley if (d == dim) { 2592766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2593766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2594766ab985SMatthew G. Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2595766ab985SMatthew G. Knepley if (val >= 0) coneSizeNew++; 2596766ab985SMatthew G. Knepley } 2597766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2598766ab985SMatthew G. Knepley } 2599766ab985SMatthew G. Knepley } 2600766ab985SMatthew G. Knepley } 2601766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2602766ab985SMatthew G. Knepley /* Set cones */ 2603766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2604766ab985SMatthew G. Knepley ierr = PetscMalloc(maxConeSize * sizeof(PetscInt), &coneNew);CHKERRQ(ierr); 2605766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2606766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2607766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2608766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2609766ab985SMatthew G. Knepley const PetscInt *cone; 2610766ab985SMatthew G. Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2611766ab985SMatthew G. Knepley 2612766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2613766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2614766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2615766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2616766ab985SMatthew G. Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 2617766ab985SMatthew G. Knepley if (subc >= 0) coneNew[coneSizeNew++] = firstSubPoint[d-1] + subc; 2618766ab985SMatthew G. Knepley } 2619766ab985SMatthew G. Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2620766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 2621766ab985SMatthew G. Knepley } 2622766ab985SMatthew G. Knepley } 2623766ab985SMatthew G. Knepley ierr = PetscFree(coneNew);CHKERRQ(ierr); 2624766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2625766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2626766ab985SMatthew G. Knepley /* Build coordinates */ 2627766ab985SMatthew G. Knepley { 2628766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2629766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2630766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2631285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2632766ab985SMatthew G. Knepley 2633766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2634766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2635766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2636285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2637285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2638285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2639766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2640766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2641766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 2642766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2643766ab985SMatthew G. Knepley PetscInt dof; 2644766ab985SMatthew G. Knepley 2645766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2646766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2647285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2648766ab985SMatthew G. Knepley } 2649766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2650766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2651766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2652766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 26532eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2654766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2655766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2656766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2657766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 2658766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2659766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 2660766ab985SMatthew G. Knepley 2661766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2662766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2663766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2664766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2665766ab985SMatthew 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); 2666766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2667766ab985SMatthew G. Knepley } 2668766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2669766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2670766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2671766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2672766ab985SMatthew G. Knepley } 2673766ab985SMatthew G. Knepley /* Cleanup */ 2674766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2675766ab985SMatthew G. Knepley ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2676766ab985SMatthew G. Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2677766ab985SMatthew G. Knepley } 2678766ab985SMatthew G. Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2679766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2680766ab985SMatthew G. Knepley } 2681766ab985SMatthew G. Knepley 2682766ab985SMatthew G. Knepley #undef __FUNCT__ 2683766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh" 2684766ab985SMatthew G. Knepley /* 268527c04023SMatthew G. Knepley DMPlexCreateCohesiveSubmesh - Extract from a mesh with cohesive cells the hypersurface defined by one face of the cells. Optionally, a Label an be given to restrict the cells. 2686766ab985SMatthew G. Knepley 2687766ab985SMatthew G. Knepley Input Parameters: 2688766ab985SMatthew G. Knepley + dm - The original mesh 268927c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 269027c04023SMatthew G. Knepley . label - A label name, or PETSC_NULL 269127c04023SMatthew G. Knepley - value - A label value 2692766ab985SMatthew G. Knepley 2693766ab985SMatthew G. Knepley Output Parameter: 2694766ab985SMatthew G. Knepley . subdm - The surface mesh 2695766ab985SMatthew G. Knepley 2696766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2697766ab985SMatthew G. Knepley 2698766ab985SMatthew G. Knepley Level: developer 2699766ab985SMatthew G. Knepley 2700766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 2701766ab985SMatthew G. Knepley */ 270227c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 2703766ab985SMatthew G. Knepley { 2704766ab985SMatthew G. Knepley PetscInt dim, depth; 2705766ab985SMatthew G. Knepley PetscErrorCode ierr; 2706766ab985SMatthew G. Knepley 2707766ab985SMatthew G. Knepley PetscFunctionBegin; 2708766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 270927c04023SMatthew G. Knepley PetscValidPointer(subdm, 5); 2710766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2711766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2712766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2713766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2714766ab985SMatthew G. Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2715766ab985SMatthew G. Knepley if (depth == dim) { 271627c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 2717766ab985SMatthew G. Knepley } else { 271827c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 2719e6ccafaeSMatthew G Knepley } 2720e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2721e6ccafaeSMatthew G Knepley } 2722e6ccafaeSMatthew G Knepley 2723e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2724e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap" 272564beef6dSMatthew G. Knepley /*@ 272664beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 272764beef6dSMatthew G. Knepley 272864beef6dSMatthew G. Knepley Input Parameter: 272964beef6dSMatthew G. Knepley . dm - The submesh DM 273064beef6dSMatthew G. Knepley 273164beef6dSMatthew G. Knepley Output Parameter: 273264beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 273364beef6dSMatthew G. Knepley 273464beef6dSMatthew G. Knepley Level: developer 273564beef6dSMatthew G. Knepley 273664beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 273764beef6dSMatthew G. Knepley @*/ 2738e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 2739e6ccafaeSMatthew G Knepley { 2740e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 2741e6ccafaeSMatthew G Knepley 2742e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2743e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2744e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 2745e6ccafaeSMatthew G Knepley *subpointMap = mesh->subpointMap; 2746e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2747e6ccafaeSMatthew G Knepley } 2748e6ccafaeSMatthew G Knepley 2749e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2750e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap" 2751e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */ 2752e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 2753e6ccafaeSMatthew G Knepley { 2754e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 2755285d324eSMatthew G. Knepley DMLabel tmp; 2756e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2757e6ccafaeSMatthew G Knepley 2758e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2759e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2760285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 2761e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 2762285d324eSMatthew G. Knepley ++mesh->subpointMap->refct; 2763285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 2764e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2765e6ccafaeSMatthew G Knepley } 2766e6ccafaeSMatthew G Knepley 2767e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2768e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS" 276964beef6dSMatthew G. Knepley /*@ 2770e6ccafaeSMatthew G Knepley DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 2771e6ccafaeSMatthew G Knepley 2772e6ccafaeSMatthew G Knepley Input Parameter: 2773e6ccafaeSMatthew G Knepley . dm - The submesh DM 2774e6ccafaeSMatthew G Knepley 2775e6ccafaeSMatthew G Knepley Output Parameter: 27760298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 2777e6ccafaeSMatthew G Knepley 2778e6ccafaeSMatthew G Knepley Note: This is IS is guaranteed to be sorted by the construction of the submesh 277964beef6dSMatthew G. Knepley 278064beef6dSMatthew G. Knepley Level: developer 278164beef6dSMatthew G. Knepley 278264beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 278364beef6dSMatthew G. Knepley @*/ 2784e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 2785e6ccafaeSMatthew G Knepley { 278682f516ccSBarry Smith MPI_Comm comm; 2787e6ccafaeSMatthew G Knepley DMLabel subpointMap; 2788e6ccafaeSMatthew G Knepley IS is; 2789e6ccafaeSMatthew G Knepley const PetscInt *opoints; 2790e6ccafaeSMatthew G Knepley PetscInt *points, *depths; 2791e6ccafaeSMatthew G Knepley PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 2792e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2793e6ccafaeSMatthew G Knepley 2794e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2795e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2796e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 279782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 27980298fd71SBarry Smith *subpointIS = NULL; 2799e6ccafaeSMatthew G Knepley ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 2800e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2801fed694aaSMatthew G. Knepley if (subpointMap && depth >= 0) { 2802e6ccafaeSMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2803e6ccafaeSMatthew G Knepley if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 2804e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 2805e6ccafaeSMatthew G Knepley depths[0] = depth; 2806e6ccafaeSMatthew G Knepley depths[1] = 0; 2807e6ccafaeSMatthew G Knepley for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 2808e6ccafaeSMatthew G Knepley ierr = PetscMalloc(pEnd * sizeof(PetscInt), &points);CHKERRQ(ierr); 2809e6ccafaeSMatthew G Knepley for(d = 0, off = 0; d <= depth; ++d) { 2810e6ccafaeSMatthew G Knepley const PetscInt dep = depths[d]; 2811e6ccafaeSMatthew G Knepley 2812e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 2813e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 28141e21b6fdSMatthew G Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 2815e6ccafaeSMatthew 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); 2816e6ccafaeSMatthew G Knepley } else { 28171e21b6fdSMatthew G Knepley if (!n) { 28181e21b6fdSMatthew G Knepley if (d == 0) { 28191e21b6fdSMatthew G Knepley /* Missing cells */ 28201e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 28211e21b6fdSMatthew G Knepley } else { 28221e21b6fdSMatthew G Knepley /* Missing faces */ 28231e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 28241e21b6fdSMatthew G Knepley } 28251e21b6fdSMatthew G Knepley } 2826e6ccafaeSMatthew G Knepley } 2827e6ccafaeSMatthew G Knepley if (n) { 2828e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 2829e6ccafaeSMatthew G Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 2830e6ccafaeSMatthew G Knepley for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 2831e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 2832e6ccafaeSMatthew G Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 2833e6ccafaeSMatthew G Knepley } 2834e6ccafaeSMatthew G Knepley } 2835e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 2836e6ccafaeSMatthew G Knepley if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 2837fed694aaSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 2838e6ccafaeSMatthew G Knepley } 2839e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2840e6ccafaeSMatthew G Knepley } 2841