134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 20c312b8eSJed Brown #include <petscsf.h> 3e6ccafaeSMatthew G Knepley 4e6ccafaeSMatthew G Knepley #undef __FUNCT__ 5cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces" 6cd0c2139SMatthew G Knepley /*@ 7cd0c2139SMatthew G Knepley DMPlexMarkBoundaryFaces - Mark all faces on the boundary 8cd0c2139SMatthew G Knepley 9cd0c2139SMatthew G Knepley Not Collective 10cd0c2139SMatthew G Knepley 11cd0c2139SMatthew G Knepley Input Parameter: 12cd0c2139SMatthew G Knepley . dm - The original DM 13cd0c2139SMatthew G Knepley 14cd0c2139SMatthew G Knepley Output Parameter: 15cd0c2139SMatthew G Knepley . label - The DMLabel marking boundary faces with value 1 16cd0c2139SMatthew G Knepley 17cd0c2139SMatthew G Knepley Level: developer 18cd0c2139SMatthew G Knepley 19cd0c2139SMatthew G Knepley .seealso: DMLabelCreate(), DMPlexCreateLabel() 2009f723d9SJed Brown @*/ 21cd0c2139SMatthew G Knepley PetscErrorCode DMPlexMarkBoundaryFaces(DM dm, DMLabel label) 22cd0c2139SMatthew G Knepley { 23cd0c2139SMatthew G Knepley PetscInt fStart, fEnd, f; 24cd0c2139SMatthew G Knepley PetscErrorCode ierr; 25cd0c2139SMatthew G Knepley 26cd0c2139SMatthew G Knepley PetscFunctionBegin; 27cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 28cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 29cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 30cd0c2139SMatthew G Knepley PetscInt supportSize; 31cd0c2139SMatthew G Knepley 32cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 33cd0c2139SMatthew G Knepley if (supportSize == 1) { 34cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, f, 1);CHKERRQ(ierr); 35cd0c2139SMatthew G Knepley } 36cd0c2139SMatthew G Knepley } 37cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 38cd0c2139SMatthew G Knepley } 39cd0c2139SMatthew G Knepley 40cd0c2139SMatthew G Knepley #undef __FUNCT__ 412be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelComplete" 422be2b188SMatthew G Knepley /*@ 432be2b188SMatthew G Knepley DMPlexLabelComplete - Starting with a label marking points on a surface, we add the transitive closure to the surface 442be2b188SMatthew G Knepley 452be2b188SMatthew G Knepley Input Parameters: 462be2b188SMatthew G Knepley + dm - The DM 472be2b188SMatthew G Knepley - label - A DMLabel marking the surface points 482be2b188SMatthew G Knepley 492be2b188SMatthew G Knepley Output Parameter: 502be2b188SMatthew G Knepley . label - A DMLabel marking all surface points in the transitive closure 512be2b188SMatthew G Knepley 522be2b188SMatthew G Knepley Level: developer 532be2b188SMatthew G Knepley 542be2b188SMatthew G Knepley .seealso: DMPlexLabelCohesiveComplete() 552be2b188SMatthew G Knepley @*/ 562be2b188SMatthew G Knepley PetscErrorCode DMPlexLabelComplete(DM dm, DMLabel label) 572be2b188SMatthew G Knepley { 582be2b188SMatthew G Knepley IS valueIS; 592be2b188SMatthew G Knepley const PetscInt *values; 602be2b188SMatthew G Knepley PetscInt numValues, v; 612be2b188SMatthew G Knepley PetscErrorCode ierr; 622be2b188SMatthew G Knepley 632be2b188SMatthew G Knepley PetscFunctionBegin; 642be2b188SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 652be2b188SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 662be2b188SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 672be2b188SMatthew G Knepley for (v = 0; v < numValues; ++v) { 682be2b188SMatthew G Knepley IS pointIS; 692be2b188SMatthew G Knepley const PetscInt *points; 702be2b188SMatthew G Knepley PetscInt numPoints, p; 712be2b188SMatthew G Knepley 722be2b188SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 732be2b188SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 742be2b188SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 752be2b188SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 762be2b188SMatthew G Knepley PetscInt *closure = NULL; 772be2b188SMatthew G Knepley PetscInt closureSize, c; 782be2b188SMatthew G Knepley 792be2b188SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 802be2b188SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 812be2b188SMatthew G Knepley ierr = DMLabelSetValue(label, closure[c], values[v]);CHKERRQ(ierr); 822be2b188SMatthew G Knepley } 832be2b188SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 842be2b188SMatthew G Knepley } 852be2b188SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 862be2b188SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 872be2b188SMatthew G Knepley } 882be2b188SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 892be2b188SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 902be2b188SMatthew G Knepley PetscFunctionReturn(0); 912be2b188SMatthew G Knepley } 922be2b188SMatthew G Knepley 932be2b188SMatthew G Knepley #undef __FUNCT__ 94cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoint_Internal" 95cd0c2139SMatthew G Knepley PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthEnd[], PetscInt depthShift[]) 96cd0c2139SMatthew G Knepley { 97cd0c2139SMatthew G Knepley if (depth < 0) return p; 98cd0c2139SMatthew G Knepley /* Cells */ if (p < depthEnd[depth]) return p; 99cd0c2139SMatthew G Knepley /* Vertices */ if (p < depthEnd[0]) return p + depthShift[depth]; 100cd0c2139SMatthew G Knepley /* Faces */ if (p < depthEnd[depth-1]) return p + depthShift[depth] + depthShift[0]; 101cd0c2139SMatthew G Knepley /* Edges */ return p + depthShift[depth] + depthShift[0] + depthShift[depth-1]; 102cd0c2139SMatthew G Knepley } 103cd0c2139SMatthew G Knepley 104cd0c2139SMatthew G Knepley #undef __FUNCT__ 105cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSizes_Internal" 106cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew) 107cd0c2139SMatthew G Knepley { 108cd0c2139SMatthew G Knepley PetscInt *depthEnd; 109cd0c2139SMatthew G Knepley PetscInt depth = 0, d, pStart, pEnd, p; 110cd0c2139SMatthew G Knepley PetscErrorCode ierr; 111cd0c2139SMatthew G Knepley 112cd0c2139SMatthew G Knepley PetscFunctionBegin; 113cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 114cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 115cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 116cd0c2139SMatthew G Knepley /* Step 1: Expand chart */ 117cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 118cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 119cd0c2139SMatthew G Knepley pEnd += depthShift[d]; 120cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 121cd0c2139SMatthew G Knepley } 122cd0c2139SMatthew G Knepley ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr); 123cd0c2139SMatthew G Knepley /* Step 2: Set cone and support sizes */ 124cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 125cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 126cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 127cd0c2139SMatthew G Knepley PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthEnd, depthShift); 128cd0c2139SMatthew G Knepley PetscInt size; 129cd0c2139SMatthew G Knepley 130cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 131cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr); 132cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 133cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr); 134cd0c2139SMatthew G Knepley } 135cd0c2139SMatthew G Knepley } 136cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 137cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 138cd0c2139SMatthew G Knepley } 139cd0c2139SMatthew G Knepley 140cd0c2139SMatthew G Knepley #undef __FUNCT__ 141cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoints_Internal" 142cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew) 143cd0c2139SMatthew G Knepley { 144cd0c2139SMatthew G Knepley PetscInt *depthEnd, *newpoints; 145cd0c2139SMatthew G Knepley PetscInt depth = 0, d, maxConeSize, maxSupportSize, pStart, pEnd, p; 146cd0c2139SMatthew G Knepley PetscErrorCode ierr; 147cd0c2139SMatthew G Knepley 148cd0c2139SMatthew G Knepley PetscFunctionBegin; 149cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 150cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 151cd0c2139SMatthew G Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 152cd0c2139SMatthew G Knepley ierr = PetscMalloc2(depth+1,PetscInt,&depthEnd,PetscMax(maxConeSize, maxSupportSize),PetscInt,&newpoints);CHKERRQ(ierr); 153cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 154cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 155cd0c2139SMatthew G Knepley } 156cd0c2139SMatthew G Knepley /* Step 5: Set cones and supports */ 157cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 158cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 159cd0c2139SMatthew G Knepley const PetscInt *points = NULL, *orientations = NULL; 160cd0c2139SMatthew G Knepley PetscInt size, i, newp = DMPlexShiftPoint_Internal(p, depth, depthEnd, depthShift); 161cd0c2139SMatthew G Knepley 162cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 163cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr); 164cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr); 165cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 166cd0c2139SMatthew G Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthEnd, depthShift); 167cd0c2139SMatthew G Knepley } 168cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr); 169cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr); 170cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 171cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr); 172cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 173cd0c2139SMatthew G Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthEnd, depthShift); 174cd0c2139SMatthew G Knepley } 175cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr); 176cd0c2139SMatthew G Knepley } 177cd0c2139SMatthew G Knepley ierr = PetscFree2(depthEnd,newpoints);CHKERRQ(ierr); 178cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 179cd0c2139SMatthew G Knepley } 180cd0c2139SMatthew G Knepley 181cd0c2139SMatthew G Knepley #undef __FUNCT__ 182cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftCoordinates_Internal" 183cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew) 184cd0c2139SMatthew G Knepley { 185cd0c2139SMatthew G Knepley PetscSection coordSection, newCoordSection; 186cd0c2139SMatthew G Knepley Vec coordinates, newCoordinates; 187cd0c2139SMatthew G Knepley PetscScalar *coords, *newCoords; 188cd0c2139SMatthew G Knepley PetscInt *depthEnd, coordSize; 189cd0c2139SMatthew G Knepley PetscInt dim, depth = 0, d, vStart, vEnd, vStartNew, vEndNew, v; 190cd0c2139SMatthew G Knepley PetscErrorCode ierr; 191cd0c2139SMatthew G Knepley 192cd0c2139SMatthew G Knepley PetscFunctionBegin; 193cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 194cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 195cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 196cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 197cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 198cd0c2139SMatthew G Knepley } 199cd0c2139SMatthew G Knepley /* Step 8: Convert coordinates */ 200cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 201cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr); 202cd0c2139SMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 203cd0c2139SMatthew G Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr); 204cd0c2139SMatthew G Knepley ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr); 205cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr); 206cd0c2139SMatthew G Knepley ierr = PetscSectionSetChart(newCoordSection, vStartNew, vEndNew);CHKERRQ(ierr); 207cd0c2139SMatthew G Knepley for (v = vStartNew; v < vEndNew; ++v) { 208cd0c2139SMatthew G Knepley ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr); 209cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr); 210cd0c2139SMatthew G Knepley } 211cd0c2139SMatthew G Knepley ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr); 212cd0c2139SMatthew G Knepley ierr = DMPlexSetCoordinateSection(dmNew, newCoordSection);CHKERRQ(ierr); 213cd0c2139SMatthew G Knepley ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr); 214cd0c2139SMatthew G Knepley ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr); 215cd0c2139SMatthew G Knepley ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr); 216cd0c2139SMatthew G Knepley ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 217cd0c2139SMatthew G Knepley ierr = VecSetFromOptions(newCoordinates);CHKERRQ(ierr); 218cd0c2139SMatthew G Knepley ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr); 219cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 220cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 221cd0c2139SMatthew G Knepley ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr); 222cd0c2139SMatthew G Knepley for (v = vStart; v < vEnd; ++v) { 223cd0c2139SMatthew G Knepley PetscInt dof, off, noff, d; 224cd0c2139SMatthew G Knepley 225cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 226cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 227cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthEnd, depthShift), &noff);CHKERRQ(ierr); 228cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) { 229cd0c2139SMatthew G Knepley newCoords[noff+d] = coords[off+d]; 230cd0c2139SMatthew G Knepley } 231cd0c2139SMatthew G Knepley } 232cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 233cd0c2139SMatthew G Knepley ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr); 234cd0c2139SMatthew G Knepley ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 235cd0c2139SMatthew G Knepley ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr); 236cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 237cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 238cd0c2139SMatthew G Knepley } 239cd0c2139SMatthew G Knepley 240cd0c2139SMatthew G Knepley #undef __FUNCT__ 241cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal" 242cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew) 243cd0c2139SMatthew G Knepley { 244cd0c2139SMatthew G Knepley PetscInt *depthEnd; 245cd0c2139SMatthew G Knepley PetscInt depth = 0, d; 246cd0c2139SMatthew G Knepley PetscSF sfPoint, sfPointNew; 247cd0c2139SMatthew G Knepley const PetscSFNode *remotePoints; 248cd0c2139SMatthew G Knepley PetscSFNode *gremotePoints; 249cd0c2139SMatthew G Knepley const PetscInt *localPoints; 250cd0c2139SMatthew G Knepley PetscInt *glocalPoints, *newLocation, *newRemoteLocation; 251cd0c2139SMatthew G Knepley PetscInt numRoots, numLeaves, l, pStart, pEnd, totShift = 0; 252cd0c2139SMatthew G Knepley PetscErrorCode ierr; 253cd0c2139SMatthew G Knepley 254cd0c2139SMatthew G Knepley PetscFunctionBegin; 255cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 256cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 257cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 258cd0c2139SMatthew G Knepley totShift += depthShift[d]; 259cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 260cd0c2139SMatthew G Knepley } 261cd0c2139SMatthew G Knepley /* Step 9: Convert pointSF */ 262cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 263cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr); 264cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 265cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 266cd0c2139SMatthew G Knepley if (numRoots >= 0) { 267cd0c2139SMatthew G Knepley ierr = PetscMalloc2(numRoots,PetscInt,&newLocation,pEnd-pStart,PetscInt,&newRemoteLocation);CHKERRQ(ierr); 268cd0c2139SMatthew G Knepley for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthEnd, depthShift); 269cd0c2139SMatthew G Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 270cd0c2139SMatthew G Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 271cd0c2139SMatthew G Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscInt), &glocalPoints);CHKERRQ(ierr); 272cd0c2139SMatthew G Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscSFNode), &gremotePoints);CHKERRQ(ierr); 273cd0c2139SMatthew G Knepley for (l = 0; l < numLeaves; ++l) { 274cd0c2139SMatthew G Knepley glocalPoints[l] = DMPlexShiftPoint_Internal(localPoints[l], depth, depthEnd, depthShift); 275cd0c2139SMatthew G Knepley gremotePoints[l].rank = remotePoints[l].rank; 276cd0c2139SMatthew G Knepley gremotePoints[l].index = newRemoteLocation[localPoints[l]]; 277cd0c2139SMatthew G Knepley } 278cd0c2139SMatthew G Knepley ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr); 279cd0c2139SMatthew G Knepley ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 280cd0c2139SMatthew G Knepley } 281cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 282cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 283cd0c2139SMatthew G Knepley } 284cd0c2139SMatthew G Knepley 285cd0c2139SMatthew G Knepley #undef __FUNCT__ 286cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal" 287cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew) 288cd0c2139SMatthew G Knepley { 289cd0c2139SMatthew G Knepley PetscSF sfPoint; 290cd0c2139SMatthew G Knepley DMLabel vtkLabel, ghostLabel; 291cd0c2139SMatthew G Knepley PetscInt *depthEnd; 292cd0c2139SMatthew G Knepley const PetscSFNode *leafRemote; 293cd0c2139SMatthew G Knepley const PetscInt *leafLocal; 294cd0c2139SMatthew G Knepley PetscInt depth = 0, d, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f; 295cd0c2139SMatthew G Knepley PetscMPIInt rank; 296cd0c2139SMatthew G Knepley PetscErrorCode ierr; 297cd0c2139SMatthew G Knepley 298cd0c2139SMatthew G Knepley PetscFunctionBegin; 299cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 300cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 301cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 302cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 303cd0c2139SMatthew G Knepley } 304cd0c2139SMatthew G Knepley /* Step 10: Convert labels */ 305cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 306cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 307cd0c2139SMatthew G Knepley DMLabel label, newlabel; 308cd0c2139SMatthew G Knepley const char *lname; 309cd0c2139SMatthew G Knepley PetscBool isDepth; 310cd0c2139SMatthew G Knepley IS valueIS; 311cd0c2139SMatthew G Knepley const PetscInt *values; 312cd0c2139SMatthew G Knepley PetscInt numValues, val; 313cd0c2139SMatthew G Knepley 314cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr); 315cd0c2139SMatthew G Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 316cd0c2139SMatthew G Knepley if (isDepth) continue; 317cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, lname);CHKERRQ(ierr); 318cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr); 319cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr); 320cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 321cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 322cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 323cd0c2139SMatthew G Knepley for (val = 0; val < numValues; ++val) { 324cd0c2139SMatthew G Knepley IS pointIS; 325cd0c2139SMatthew G Knepley const PetscInt *points; 326cd0c2139SMatthew G Knepley PetscInt numPoints, p; 327cd0c2139SMatthew G Knepley 328cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 329cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 330cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 331cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 332cd0c2139SMatthew G Knepley const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthEnd, depthShift); 333cd0c2139SMatthew G Knepley 334cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr); 335cd0c2139SMatthew G Knepley } 336cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 337cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 338cd0c2139SMatthew G Knepley } 339cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 340cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 341cd0c2139SMatthew G Knepley } 342cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 343cd0c2139SMatthew G Knepley /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */ 344cd0c2139SMatthew G Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 345cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 346cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 347cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr); 348cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "vtk");CHKERRQ(ierr); 349cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "ghost");CHKERRQ(ierr); 350cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr); 351cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr); 352cd0c2139SMatthew G Knepley for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { 353cd0c2139SMatthew G Knepley for (; c < leafLocal[l] && c < cEnd; ++c) { 354cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 355cd0c2139SMatthew G Knepley } 356cd0c2139SMatthew G Knepley if (leafLocal[l] >= cEnd) break; 357cd0c2139SMatthew G Knepley if (leafRemote[l].rank == rank) { 358cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 359cd0c2139SMatthew G Knepley } else { 360cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr); 361cd0c2139SMatthew G Knepley } 362cd0c2139SMatthew G Knepley } 363cd0c2139SMatthew G Knepley for (; c < cEnd; ++c) { 364cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 365cd0c2139SMatthew G Knepley } 366cd0c2139SMatthew G Knepley if (0) { 367cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 368cd0c2139SMatthew G Knepley ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 369cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 370cd0c2139SMatthew G Knepley } 371cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr); 372cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 373cd0c2139SMatthew G Knepley PetscInt numCells; 374cd0c2139SMatthew G Knepley 375cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr); 376cd0c2139SMatthew G Knepley if (numCells < 2) { 377cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr); 378cd0c2139SMatthew G Knepley } else { 379cd0c2139SMatthew G Knepley const PetscInt *cells = NULL; 380cd0c2139SMatthew G Knepley PetscInt vA, vB; 381cd0c2139SMatthew G Knepley 382cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr); 383cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr); 384cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr); 385cd0c2139SMatthew G Knepley if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);} 386cd0c2139SMatthew G Knepley } 387cd0c2139SMatthew G Knepley } 388cd0c2139SMatthew G Knepley if (0) { 389cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 390cd0c2139SMatthew G Knepley ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 391cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 392cd0c2139SMatthew G Knepley } 393cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 394cd0c2139SMatthew G Knepley } 395cd0c2139SMatthew G Knepley 396cd0c2139SMatthew G Knepley #undef __FUNCT__ 397cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal" 398cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm) 399cd0c2139SMatthew G Knepley { 400cd0c2139SMatthew G Knepley IS valueIS; 401cd0c2139SMatthew G Knepley const PetscInt *values; 402cd0c2139SMatthew G Knepley PetscInt *depthShift; 403cd0c2139SMatthew G Knepley PetscInt depth = 0, numFS, fs, ghostCell, cEnd, c; 404cd0c2139SMatthew G Knepley PetscErrorCode ierr; 405cd0c2139SMatthew G Knepley 406cd0c2139SMatthew G Knepley PetscFunctionBegin; 407cd0c2139SMatthew G Knepley /* Count ghost cells */ 408cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 409cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr); 410cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 411cd0c2139SMatthew G Knepley 412cd0c2139SMatthew G Knepley *numGhostCells = 0; 413cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 414cd0c2139SMatthew G Knepley PetscInt numBdFaces; 415cd0c2139SMatthew G Knepley 416cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[fs], &numBdFaces);CHKERRQ(ierr); 417cd0c2139SMatthew G Knepley 418cd0c2139SMatthew G Knepley *numGhostCells += numBdFaces; 419cd0c2139SMatthew G Knepley } 420cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 421cd0c2139SMatthew G Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthShift);CHKERRQ(ierr); 422cd0c2139SMatthew G Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 423cd0c2139SMatthew G Knepley if (depth >= 0) depthShift[depth] = *numGhostCells; 424cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 425cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 426cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 427cd0c2139SMatthew G Knepley for (c = cEnd; c < cEnd + *numGhostCells; ++c) { 428cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr); 429cd0c2139SMatthew G Knepley } 430cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 431cd0c2139SMatthew G Knepley IS faceIS; 432cd0c2139SMatthew G Knepley const PetscInt *faces; 433cd0c2139SMatthew G Knepley PetscInt numFaces, f; 434cd0c2139SMatthew G Knepley 435cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 436cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 437cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 438cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 439cd0c2139SMatthew G Knepley PetscInt size; 440cd0c2139SMatthew G Knepley 441cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr); 442cd0c2139SMatthew G Knepley if (size != 1) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "DM has boundary face %d with %d support cells", faces[f], size); 443cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(gdm, faces[f] + *numGhostCells, 2);CHKERRQ(ierr); 444cd0c2139SMatthew G Knepley } 445cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 446cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 447cd0c2139SMatthew G Knepley } 448cd0c2139SMatthew G Knepley /* Step 4: Setup ghosted DM */ 449cd0c2139SMatthew G Knepley ierr = DMSetUp(gdm);CHKERRQ(ierr); 450cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 451cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 452cd0c2139SMatthew G Knepley ghostCell = cEnd; 453cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 454cd0c2139SMatthew G Knepley IS faceIS; 455cd0c2139SMatthew G Knepley const PetscInt *faces; 456cd0c2139SMatthew G Knepley PetscInt numFaces, f; 457cd0c2139SMatthew G Knepley 458cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 459cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 460cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 461cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f, ++ghostCell) { 462cd0c2139SMatthew G Knepley PetscInt newFace = faces[f] + *numGhostCells; 463cd0c2139SMatthew G Knepley 464cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr); 465cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr); 466cd0c2139SMatthew G Knepley } 467cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 468cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 469cd0c2139SMatthew G Knepley } 470cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 471cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 472cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 473cd0c2139SMatthew G Knepley ierr = DMPlexStratify(gdm);CHKERRQ(ierr); 474cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 475cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 476cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 477cd0c2139SMatthew G Knepley ierr = PetscFree(depthShift);CHKERRQ(ierr); 478cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 479cd0c2139SMatthew G Knepley } 480cd0c2139SMatthew G Knepley 481cd0c2139SMatthew G Knepley #undef __FUNCT__ 482cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells" 483cd0c2139SMatthew G Knepley /*@C 484cd0c2139SMatthew G Knepley DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face 485cd0c2139SMatthew G Knepley 486cd0c2139SMatthew G Knepley Collective on dm 487cd0c2139SMatthew G Knepley 488cd0c2139SMatthew G Knepley Input Parameters: 489cd0c2139SMatthew G Knepley + dm - The original DM 490cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL 491cd0c2139SMatthew G Knepley 492cd0c2139SMatthew G Knepley Output Parameters: 493cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM 494cd0c2139SMatthew G Knepley - dmGhosted - The new DM 495cd0c2139SMatthew G Knepley 496cd0c2139SMatthew G Knepley Note: If no label exists of that name, one will be created marking all boundary faces 497cd0c2139SMatthew G Knepley 498cd0c2139SMatthew G Knepley Level: developer 499cd0c2139SMatthew G Knepley 500cd0c2139SMatthew G Knepley .seealso: DMCreate() 501cd0c2139SMatthew G Knepley */ 502cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted) 503cd0c2139SMatthew G Knepley { 504cd0c2139SMatthew G Knepley DM gdm; 505cd0c2139SMatthew G Knepley DMLabel label; 506cd0c2139SMatthew G Knepley const char *name = labelName ? labelName : "Face Sets"; 507cd0c2139SMatthew G Knepley PetscInt dim; 508cd0c2139SMatthew G Knepley PetscErrorCode ierr; 509cd0c2139SMatthew G Knepley 510cd0c2139SMatthew G Knepley PetscFunctionBegin; 511cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 512cd0c2139SMatthew G Knepley PetscValidPointer(numGhostCells, 3); 513cd0c2139SMatthew G Knepley PetscValidPointer(dmGhosted, 4); 514cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr); 515cd0c2139SMatthew G Knepley ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr); 516cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 517cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(gdm, dim);CHKERRQ(ierr); 518cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 519cd0c2139SMatthew G Knepley if (!label) { 520cd0c2139SMatthew G Knepley /* Get label for boundary faces */ 521cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr); 522cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 523cd0c2139SMatthew G Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 524cd0c2139SMatthew G Knepley } 525cd0c2139SMatthew G Knepley ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr); 526cd0c2139SMatthew G Knepley ierr = DMSetFromOptions(gdm);CHKERRQ(ierr); 527cd0c2139SMatthew G Knepley *dmGhosted = gdm; 528cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 529cd0c2139SMatthew G Knepley } 530cd0c2139SMatthew G Knepley 531cd0c2139SMatthew G Knepley #undef __FUNCT__ 532cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal" 533*607ab7a9SMatthew G. Knepley /* 534*607ab7a9SMatthew G. Knepley We are adding two kinds of points here: 535*607ab7a9SMatthew G. Knepley Replicated: Copies of points which exist in the mesh, such as vertices identified across a fault 536*607ab7a9SMatthew G. Knepley Hybrid: Entirely new points, such as cohesive cells 537*607ab7a9SMatthew G. Knepley */ 538cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm) 539cd0c2139SMatthew G Knepley { 540cd0c2139SMatthew G Knepley MPI_Comm comm; 541*607ab7a9SMatthew G. Knepley IS valueIS; 542*607ab7a9SMatthew G. Knepley PetscInt numSP = 0; /* The number of depths for which we have replicated points */ 543*607ab7a9SMatthew G. Knepley const PetscInt *values; /* List of depths for which we have replicated points */ 544*607ab7a9SMatthew G. Knepley IS *pointIS; 545*607ab7a9SMatthew G. Knepley PetscInt *numSplitPoints; /* The number of replicated points at each depth */ 546*607ab7a9SMatthew G. Knepley PetscInt *numHybridPoints; /* The number of hybrid points at each depth */ 547*607ab7a9SMatthew G. Knepley const PetscInt **splitPoints; /* Replicated points for each depth */ 548cd0c2139SMatthew G Knepley PetscSection coordSection; 549cd0c2139SMatthew G Knepley Vec coordinates; 550cd0c2139SMatthew G Knepley PetscScalar *coords; 551*607ab7a9SMatthew G. Knepley PetscInt depths[4]; /* Depths in the order that plex points are numbered */ 552*607ab7a9SMatthew G. Knepley PetscInt *depthShift; /* Number of replicated+hybrid points at each depth */ 553*607ab7a9SMatthew G. Knepley PetscInt *depthOffset; /* Prefix sums of depthShift */ 554*607ab7a9SMatthew G. Knepley PetscInt *pMaxNew; /* The first replicated point at each depth in the new mesh, hybrids come after this */ 555*607ab7a9SMatthew G. Knepley PetscInt *coneNew, *coneONew, *supportNew; 556*607ab7a9SMatthew G. Knepley PetscInt shift = 100, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, numLabels, vStart, vEnd, pEnd, p, v; 557cd0c2139SMatthew G Knepley PetscErrorCode ierr; 558cd0c2139SMatthew G Knepley 559cd0c2139SMatthew G Knepley PetscFunctionBegin; 560cd0c2139SMatthew G Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 561cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 562*607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 563fd4b9f15SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 564*607ab7a9SMatthew G. Knepley depths[0] = depth; 565*607ab7a9SMatthew G. Knepley depths[1] = 0; 566*607ab7a9SMatthew G. Knepley depths[2] = depth-1; 567*607ab7a9SMatthew G. Knepley depths[3] = 1; 568cd0c2139SMatthew G Knepley /* Count split points and add cohesive cells */ 569*607ab7a9SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 570*607ab7a9SMatthew G. Knepley ierr = PetscMalloc6(depth+1,PetscInt,&depthShift,depth+1,PetscInt,&depthOffset,depth+1,PetscInt,&pMaxNew,maxConeSize*3,PetscInt,&coneNew,maxConeSize*3,PetscInt,&coneONew,maxSupportSize,PetscInt,&supportNew);CHKERRQ(ierr); 571*607ab7a9SMatthew G. Knepley ierr = PetscMalloc4(depth+1,IS,&pointIS,depth+1,PetscInt,&numSplitPoints,depth+1,PetscInt,&numHybridPoints,depth+1,const PetscInt*,&splitPoints);CHKERRQ(ierr); 572*607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 573*607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthOffset, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 574*607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 575*607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 576*607ab7a9SMatthew G. Knepley numSplitPoints[d] = 0; 577*607ab7a9SMatthew G. Knepley numHybridPoints[d] = 0; 578*607ab7a9SMatthew G. Knepley splitPoints[d] = NULL; 579*607ab7a9SMatthew G. Knepley pointIS[d] = NULL; 580*607ab7a9SMatthew G. Knepley } 581cd0c2139SMatthew G Knepley if (label) { 582cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 583cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 584cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 585cd0c2139SMatthew G Knepley } 586cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 587cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 588cd0c2139SMatthew G Knepley 589cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 590*607ab7a9SMatthew G. Knepley /* TAKE OUT*/ ierr = DMLabelGetStratumSize(label, dep, &depthShift[dep]);CHKERRQ(ierr); 591cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pointIS[dep]);CHKERRQ(ierr); 592cd0c2139SMatthew G Knepley if (pointIS[dep]) { 593cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 594cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 595cd0c2139SMatthew G Knepley } 596cd0c2139SMatthew G Knepley } 597*607ab7a9SMatthew G. Knepley /* Calculate number of hybrid points */ 598*607ab7a9SMatthew 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 */ 599*607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) depthShift[d] = numSplitPoints[d] + numHybridPoints[d]; 600*607ab7a9SMatthew G. Knepley /* TAKE THIS OUT */ if (depth > 2) depthShift[2] = numSplitPoints[2]; 601*607ab7a9SMatthew G. Knepley for (d = 1; d <= depth; ++d) depthOffset[depths[d]] = depthOffset[depths[d-1]] + depthShift[depths[d-1]]; 602*607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) pMaxNew[d] += depthOffset[d]; 603cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 604cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 605cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 606cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 607cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 608cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + oldp; 609cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 610cd0c2139SMatthew G Knepley const PetscInt *support; 611cd0c2139SMatthew G Knepley PetscInt coneSize, supportSize, q, e; 612cd0c2139SMatthew G Knepley 613cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 614cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 615cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 616cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 617cd0c2139SMatthew G Knepley if (dep == depth-1) { 618cd0c2139SMatthew G Knepley const PetscInt ccell = pMaxNew[depth] + p; 619cd0c2139SMatthew G Knepley /* Add cohesive cells, they are prisms */ 620cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, ccell, 2 + coneSize);CHKERRQ(ierr); 621cd0c2139SMatthew G Knepley } else if (dep == 0) { 622cd0c2139SMatthew G Knepley const PetscInt cedge = pMaxNew[1] + (depthShift[1] - depthShift[0]) + p; 623cd0c2139SMatthew G Knepley 624cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 625cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 626cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 627cd0c2139SMatthew G Knepley PetscInt val; 628cd0c2139SMatthew G Knepley 629cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 630cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) ++q; 631cd0c2139SMatthew G Knepley } 632cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, newp, q+1);CHKERRQ(ierr); 633cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 634cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 635cd0c2139SMatthew G Knepley PetscInt val; 636cd0c2139SMatthew G Knepley 637cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 638cd0c2139SMatthew G Knepley if ((val == 1) || (val == -(shift + 1))) ++q; 639cd0c2139SMatthew G Knepley } 640cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, q+1);CHKERRQ(ierr); 641cd0c2139SMatthew G Knepley /* Add cohesive edges */ 642cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, cedge, 2);CHKERRQ(ierr); 643cd0c2139SMatthew G Knepley /* Punt for now on support, you loop over closure, extract faces, check which ones are in the label */ 644cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 645cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 646cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 647cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 648cd0c2139SMatthew G Knepley PetscInt val; 649cd0c2139SMatthew G Knepley 650cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 651cd0c2139SMatthew G Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++q; 652cd0c2139SMatthew G Knepley } 653cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, newp, q);CHKERRQ(ierr); 654cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 655cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 656cd0c2139SMatthew G Knepley PetscInt val; 657cd0c2139SMatthew G Knepley 658cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 659cd0c2139SMatthew G Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++q; 660cd0c2139SMatthew G Knepley } 661cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, q);CHKERRQ(ierr); 662cd0c2139SMatthew G Knepley } 663cd0c2139SMatthew G Knepley } 664cd0c2139SMatthew G Knepley } 665cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 666cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 667cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 668cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 669cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 670cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 671cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 672cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + oldp; 673cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 674cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 675cd0c2139SMatthew G Knepley PetscInt coneSize, supportSize, q, v, e, s; 676cd0c2139SMatthew G Knepley 677cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 678cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 679cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 680cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 681cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 682cd0c2139SMatthew G Knepley if (dep == depth-1) { 683cd0c2139SMatthew G Knepley const PetscInt ccell = pMaxNew[depth] + p; 684cd0c2139SMatthew G Knepley const PetscInt *supportF; 685cd0c2139SMatthew G Knepley 686cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 687cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 688cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 689cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 690cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 691cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 692cd0c2139SMatthew G Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dim-2], splitPoints[dim-2], &v);CHKERRQ(ierr); 693cd0c2139SMatthew G Knepley 694cd0c2139SMatthew G Knepley coneNew[2+q] = pMaxNew[dim-2] + v; 695cd0c2139SMatthew G Knepley } 696cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 697cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 698e537020bSMatthew G. Knepley /* Face support */ 699cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 700cd0c2139SMatthew G Knepley PetscInt val; 701cd0c2139SMatthew G Knepley 702cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 703cd0c2139SMatthew G Knepley if (val < 0) { 704cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 705cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(sdm, newp, s, ccell);CHKERRQ(ierr); 706cd0c2139SMatthew G Knepley } else { 707cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 708cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, ccell);CHKERRQ(ierr); 709e537020bSMatthew G. Knepley /* Get orientation for cohesive face */ 710e537020bSMatthew G. Knepley { 711e537020bSMatthew G. Knepley const PetscInt *ncone, *nconeO; 712e537020bSMatthew G. Knepley PetscInt nconeSize, nc; 713e537020bSMatthew G. Knepley 714e537020bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 715e537020bSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 716e537020bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 717e537020bSMatthew G. Knepley for (nc = 0; nc < nconeSize; ++nc) { 718e537020bSMatthew G. Knepley if (ncone[nc] == oldp) { 719e537020bSMatthew G. Knepley coneONew[0] = nconeO[nc]; 720e537020bSMatthew G. Knepley break; 721cd0c2139SMatthew G Knepley } 722cd0c2139SMatthew G Knepley } 723e537020bSMatthew 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]); 724e537020bSMatthew G. Knepley } 725e537020bSMatthew G. Knepley } 726e537020bSMatthew G. Knepley } 727e537020bSMatthew G. Knepley /* Cohesive cell: Old and new split face, then new cohesive edges */ 728fd4b9f15SMatthew G. Knepley coneNew[0] = newp; /* Extracted negative side orientation above */ 729e537020bSMatthew G. Knepley coneNew[1] = splitp; coneONew[1] = coneONew[0]; 730fd4b9f15SMatthew G. Knepley if (dim > 2) { 731fd4b9f15SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl; 732fd4b9f15SMatthew G. Knepley 733fd4b9f15SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, oldp, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 734fd4b9f15SMatthew G. Knepley for (cl = 0, q = 0; cl < closureSize*2; cl += 2) { 735fd4b9f15SMatthew G. Knepley const PetscInt clp = closure[cl]; 736fd4b9f15SMatthew G. Knepley 737fd4b9f15SMatthew G. Knepley if ((clp >= vStart) && (clp < vEnd)) { 738fd4b9f15SMatthew G. Knepley ierr = PetscFindInt(clp, numSplitPoints[0], splitPoints[0], &v);CHKERRQ(ierr); 739fd4b9f15SMatthew G. Knepley coneNew[2+q] = pMaxNew[1] + (depthShift[1] - depthShift[0]) + v; 740fd4b9f15SMatthew G. Knepley coneONew[2+q] = 0; 741fd4b9f15SMatthew G. Knepley ++q; 742fd4b9f15SMatthew G. Knepley } 743fd4b9f15SMatthew G. Knepley } 744fd4b9f15SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, oldp, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 745fd4b9f15SMatthew G. Knepley if (q != coneSize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid number of split face vertices %d should be %d", q, coneSize); 746fd4b9f15SMatthew G. Knepley } else { 747e537020bSMatthew G. Knepley for (q = 0; q < coneSize; ++q) { 748e537020bSMatthew G. Knepley coneNew[2+q] = (pMaxNew[1] - pMaxNew[dim-2]) + (depthShift[1] - depthShift[0]) + coneNew[2+q]; 749e537020bSMatthew G. Knepley coneONew[2+q] = 0; 750e537020bSMatthew G. Knepley } 751fd4b9f15SMatthew G. Knepley } 752e537020bSMatthew G. Knepley ierr = DMPlexSetCone(sdm, ccell, coneNew);CHKERRQ(ierr); 753e537020bSMatthew G. Knepley ierr = DMPlexSetConeOrientation(sdm, ccell, coneONew);CHKERRQ(ierr); 754cd0c2139SMatthew G Knepley } else if (dep == 0) { 755cd0c2139SMatthew G Knepley const PetscInt cedge = pMaxNew[1] + (depthShift[1] - depthShift[0]) + p; 756cd0c2139SMatthew G Knepley 757cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 758cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 759cd0c2139SMatthew G Knepley PetscInt val; 760cd0c2139SMatthew G Knepley 761cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 762cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 763cd0c2139SMatthew G Knepley supportNew[q++] = depthOffset[1] + support[e]; 764cd0c2139SMatthew G Knepley } 765cd0c2139SMatthew G Knepley } 766cd0c2139SMatthew G Knepley supportNew[q] = cedge; 767cd0c2139SMatthew G Knepley 768cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 769cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 770cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 771cd0c2139SMatthew G Knepley PetscInt val, edge; 772cd0c2139SMatthew G Knepley 773cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 774cd0c2139SMatthew G Knepley if (val == 1) { 775cd0c2139SMatthew G Knepley ierr = PetscFindInt(support[e], numSplitPoints[1], splitPoints[1], &edge);CHKERRQ(ierr); 776cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 777cd0c2139SMatthew G Knepley supportNew[q++] = pMaxNew[1] + edge; 778cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 779cd0c2139SMatthew G Knepley supportNew[q++] = depthOffset[1] + support[e]; 780cd0c2139SMatthew G Knepley } 781cd0c2139SMatthew G Knepley } 782cd0c2139SMatthew G Knepley supportNew[q] = cedge; 783cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 784cd0c2139SMatthew G Knepley /* Cohesive edge: Old and new split vertex, punting on support */ 785cd0c2139SMatthew G Knepley coneNew[0] = newp; 786cd0c2139SMatthew G Knepley coneNew[1] = splitp; 787cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, cedge, coneNew);CHKERRQ(ierr); 788cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 789cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 790cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 791cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 792cd0c2139SMatthew G Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dim-3], splitPoints[dim-3], &v);CHKERRQ(ierr); 793cd0c2139SMatthew G Knepley 794cd0c2139SMatthew G Knepley coneNew[q] = pMaxNew[dim-3] + v; 795cd0c2139SMatthew G Knepley } 796cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 797cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 798cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 799cd0c2139SMatthew G Knepley PetscInt val; 800cd0c2139SMatthew G Knepley 801cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 802cd0c2139SMatthew G Knepley if ((val == dim-1) || (val == (shift + dim-1))) { 803cd0c2139SMatthew G Knepley supportNew[q++] = depthOffset[dim-1] + support[e]; 804cd0c2139SMatthew G Knepley } 805cd0c2139SMatthew G Knepley } 806cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 807cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 808cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 809cd0c2139SMatthew G Knepley PetscInt val, face; 810cd0c2139SMatthew G Knepley 811cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 812cd0c2139SMatthew G Knepley if (val == dim-1) { 813cd0c2139SMatthew G Knepley ierr = PetscFindInt(support[e], numSplitPoints[dim-1], splitPoints[dim-1], &face);CHKERRQ(ierr); 814cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 815cd0c2139SMatthew G Knepley supportNew[q++] = pMaxNew[dim-1] + face; 816cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 817cd0c2139SMatthew G Knepley supportNew[q++] = depthOffset[dim-1] + support[e]; 818cd0c2139SMatthew G Knepley } 819cd0c2139SMatthew G Knepley } 820cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 821cd0c2139SMatthew G Knepley } 822cd0c2139SMatthew G Knepley } 823cd0c2139SMatthew G Knepley } 824cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 825cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 826cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 827cd0c2139SMatthew G Knepley IS pIS; 828cd0c2139SMatthew G Knepley PetscInt numPoints; 829cd0c2139SMatthew G Knepley const PetscInt *points; 830cd0c2139SMatthew G Knepley 831cd0c2139SMatthew G Knepley if (dep >= 0) continue; 832cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 833cd0c2139SMatthew G Knepley if (!pIS) continue; 834cd0c2139SMatthew G Knepley dep = -dep - shift; 835cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 836cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 837cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 838cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 839cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + oldp; 840cd0c2139SMatthew G Knepley const PetscInt *cone; 841cd0c2139SMatthew G Knepley PetscInt coneSize, c; 842cd0c2139SMatthew G Knepley PetscBool replaced = PETSC_FALSE; 843cd0c2139SMatthew G Knepley 844cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 845cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 846cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 847cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 848cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 849cd0c2139SMatthew G Knepley const PetscInt coldp = cone[c] - depthOffset[dep-1]; 850cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 851cd0c2139SMatthew G Knepley 852cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 853cd0c2139SMatthew G Knepley if (val == dep-1) { 854cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 855cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 856cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 857cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 858cd0c2139SMatthew G Knepley replaced = PETSC_TRUE; 859cd0c2139SMatthew G Knepley } 860cd0c2139SMatthew G Knepley } 8614a189a86SMatthew G. Knepley /* Cells with only a vertex or edge on the submesh have no replacement */ 8624a189a86SMatthew G. Knepley /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 863cd0c2139SMatthew G Knepley } 864cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 865cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 866cd0c2139SMatthew G Knepley } 867cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 868cd0c2139SMatthew G Knepley ierr = DMPlexStratify(sdm);CHKERRQ(ierr); 869cd0c2139SMatthew G Knepley /* Step 8: Coordinates */ 870cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 871cd0c2139SMatthew G Knepley ierr = DMPlexGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 872cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 873cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 874cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 875cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[0] + splitPoints[0][v]; 876cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 877cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 878cd0c2139SMatthew G Knepley 879cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 880cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 881cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 882cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 883cd0c2139SMatthew G Knepley } 884cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 885cd0c2139SMatthew G Knepley /* Step 9: SF, if I can figure this out we can split the mesh in parallel */ 886cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 887cd0c2139SMatthew G Knepley /* Step 10: Labels */ 888cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 889cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 890cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 891cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 892cd0c2139SMatthew G Knepley const PetscInt newp = depthOffset[dep] + splitPoints[dep][p]; 893cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 894cd0c2139SMatthew G Knepley PetscInt l; 895cd0c2139SMatthew G Knepley 896cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 897cd0c2139SMatthew G Knepley DMLabel mlabel; 898cd0c2139SMatthew G Knepley const char *lname; 899cd0c2139SMatthew G Knepley PetscInt val; 9009a356370SMatthew G. Knepley PetscBool isDepth; 901cd0c2139SMatthew G Knepley 902cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 9039a356370SMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 9049a356370SMatthew G. Knepley if (isDepth) continue; 905cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 906cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 907cd0c2139SMatthew G Knepley if (val >= 0) { 908cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 9099a356370SMatthew G. Knepley #if 0 9109a356370SMatthew G. Knepley /* Do not put cohesive edges into the label */ 911cd0c2139SMatthew G Knepley if (dep == 0) { 912cd0c2139SMatthew G Knepley const PetscInt cedge = pMaxNew[1] + (depthShift[1] - depthShift[0]) + p; 913cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr); 914cd0c2139SMatthew G Knepley } 9159a356370SMatthew G. Knepley #endif 916cd0c2139SMatthew G Knepley } 917cd0c2139SMatthew G Knepley } 918cd0c2139SMatthew G Knepley } 919cd0c2139SMatthew G Knepley } 920cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 921cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 922cd0c2139SMatthew G Knepley 923cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 924cd0c2139SMatthew G Knepley if (pointIS[dep]) {ierr = ISRestoreIndices(pointIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 925cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS[dep]);CHKERRQ(ierr); 926cd0c2139SMatthew G Knepley } 927cd0c2139SMatthew G Knepley if (label) { 928cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 929cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 930cd0c2139SMatthew G Knepley } 931f17f3550SMatthew G. Knepley ierr = DMPlexGetChart(sdm, NULL, &pEnd);CHKERRQ(ierr); 9320e49e2e2SMatthew G. Knepley if (depth > 0) pMaxNew[0] += depthShift[0]; /* Account for shadow vertices */ 933f17f3550SMatthew G. Knepley if (depth > 1) pMaxNew[1] = pEnd - depthShift[0]; /* There is a hybrid edge for every shadow vertex */ 934f17f3550SMatthew G. Knepley if (depth > 2) pMaxNew[2] = -1; /* There are no hybrid faces */ 9350e49e2e2SMatthew 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); 9360e49e2e2SMatthew G. Knepley ierr = PetscFree6(depthShift, depthOffset, pMaxNew, coneNew, coneONew, supportNew);CHKERRQ(ierr); 937*607ab7a9SMatthew G. Knepley ierr = PetscFree4(pointIS, numSplitPoints, numHybridPoints, splitPoints);CHKERRQ(ierr); 938cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 939cd0c2139SMatthew G Knepley } 940cd0c2139SMatthew G Knepley 941cd0c2139SMatthew G Knepley #undef __FUNCT__ 942cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells" 943cd0c2139SMatthew G Knepley /*@C 944cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 945cd0c2139SMatthew G Knepley 946cd0c2139SMatthew G Knepley Collective on dm 947cd0c2139SMatthew G Knepley 948cd0c2139SMatthew G Knepley Input Parameters: 949cd0c2139SMatthew G Knepley + dm - The original DM 950cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces (this could be auto-generated) 951cd0c2139SMatthew G Knepley 952cd0c2139SMatthew G Knepley Output Parameters: 953cd0c2139SMatthew G Knepley - dmSplit - The new DM 954cd0c2139SMatthew G Knepley 955cd0c2139SMatthew G Knepley Level: developer 956cd0c2139SMatthew G Knepley 9572be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 958cd0c2139SMatthew G Knepley @*/ 959cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 960cd0c2139SMatthew G Knepley { 961cd0c2139SMatthew G Knepley DM sdm; 962cd0c2139SMatthew G Knepley PetscInt dim; 963cd0c2139SMatthew G Knepley PetscErrorCode ierr; 964cd0c2139SMatthew G Knepley 965cd0c2139SMatthew G Knepley PetscFunctionBegin; 966cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 967cd0c2139SMatthew G Knepley PetscValidPointer(dmSplit, 4); 968cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 969cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 970cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 971cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(sdm, dim);CHKERRQ(ierr); 972cd0c2139SMatthew G Knepley switch (dim) { 973cd0c2139SMatthew G Knepley case 2: 974cd0c2139SMatthew G Knepley case 3: 975cd0c2139SMatthew G Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 976cd0c2139SMatthew G Knepley break; 977cd0c2139SMatthew G Knepley default: 978cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 979cd0c2139SMatthew G Knepley } 980cd0c2139SMatthew G Knepley *dmSplit = sdm; 981cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 982cd0c2139SMatthew G Knepley } 983cd0c2139SMatthew G Knepley 984cd0c2139SMatthew G Knepley #undef __FUNCT__ 9852be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete" 986cd0c2139SMatthew G Knepley /*@ 9872be2b188SMatthew G Knepley DMPlexLabelCohesiveComplete - Starting with a label marking vertices on an internal surface, we add all other mesh pieces 988cd0c2139SMatthew G Knepley to complete the surface 989cd0c2139SMatthew G Knepley 990cd0c2139SMatthew G Knepley Input Parameters: 991cd0c2139SMatthew G Knepley + dm - The DM 99247946fd8SMatthew G. Knepley . label - A DMLabel marking the surface vertices 993bb55d314SMatthew G. Knepley . flip - Flag to flip the submesh normal and replace points on the other side 99447946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL 995cd0c2139SMatthew G Knepley 996cd0c2139SMatthew G Knepley Output Parameter: 997cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 998cd0c2139SMatthew G Knepley 999cd0c2139SMatthew G Knepley Level: developer 1000cd0c2139SMatthew G Knepley 10012be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 1002cd0c2139SMatthew G Knepley @*/ 1003bb55d314SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, PetscBool flip, DM subdm) 1004cd0c2139SMatthew G Knepley { 1005d90583fdSMatthew G. Knepley DMLabel depthLabel; 100647946fd8SMatthew G. Knepley IS dimIS, subpointIS; 100747946fd8SMatthew G. Knepley const PetscInt *points, *subpoints; 1008bb55d314SMatthew G. Knepley const PetscInt rev = flip ? -1 : 1; 100947946fd8SMatthew G. Knepley PetscInt shift = 100, dim, dep, cStart, cEnd, numPoints, numSubpoints, p, val; 1010cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1011cd0c2139SMatthew G Knepley 1012cd0c2139SMatthew G Knepley PetscFunctionBegin; 1013d90583fdSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 1014cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 101547946fd8SMatthew G. Knepley if (subdm) { 101647946fd8SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 101747946fd8SMatthew G. Knepley if (subpointIS) { 101847946fd8SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 101947946fd8SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 102047946fd8SMatthew G. Knepley } 102147946fd8SMatthew G. Knepley } 1022cd0c2139SMatthew G Knepley /* Cell orientation for face gives the side of the fault */ 1023cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 1024cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1025cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1026cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1027cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1028cd0c2139SMatthew G Knepley const PetscInt *support; 1029cd0c2139SMatthew G Knepley PetscInt supportSize, s; 1030cd0c2139SMatthew G Knepley 1031cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1032cd0c2139SMatthew G Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 1033cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1034cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1035cd0c2139SMatthew G Knepley const PetscInt *cone, *ornt; 1036cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1037cd0c2139SMatthew G Knepley PetscBool pos = PETSC_TRUE; 1038cd0c2139SMatthew G Knepley 1039cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1040cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1041cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 1042cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1043cd0c2139SMatthew G Knepley if (cone[c] == points[p]) { 104447946fd8SMatthew G. Knepley PetscInt o = ornt[c]; 104547946fd8SMatthew G. Knepley 104647946fd8SMatthew G. Knepley if (subdm) { 104747946fd8SMatthew G. Knepley const PetscInt *subcone, *subornt; 104847946fd8SMatthew G. Knepley PetscInt subpoint, subface, subconeSize, sc; 104947946fd8SMatthew G. Knepley 105047946fd8SMatthew G. Knepley ierr = PetscFindInt(support[s], numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 105147946fd8SMatthew G. Knepley ierr = PetscFindInt(points[p], numSubpoints, subpoints, &subface);CHKERRQ(ierr); 105247946fd8SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 105347946fd8SMatthew G. Knepley ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 105447946fd8SMatthew G. Knepley ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 105547946fd8SMatthew G. Knepley for (sc = 0; sc < subconeSize; ++sc) { 105647946fd8SMatthew G. Knepley if (subcone[sc] == subface) { 105747946fd8SMatthew G. Knepley o = subornt[0]; 105847946fd8SMatthew G. Knepley break; 105947946fd8SMatthew G. Knepley } 106047946fd8SMatthew G. Knepley } 106147946fd8SMatthew 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); 106247946fd8SMatthew G. Knepley } 106347946fd8SMatthew G. Knepley if (o >= 0) { 1064bb55d314SMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr); 1065ffaa4bbcSMatthew G. Knepley pos = rev > 0 ? PETSC_TRUE : PETSC_FALSE; 1066cd0c2139SMatthew G Knepley } else { 1067bb55d314SMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr); 1068ffaa4bbcSMatthew G. Knepley pos = rev > 0 ? PETSC_FALSE : PETSC_TRUE; 1069cd0c2139SMatthew G Knepley } 1070cd0c2139SMatthew G Knepley break; 1071cd0c2139SMatthew G Knepley } 1072cd0c2139SMatthew G Knepley } 1073cd0c2139SMatthew 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]); 1074cd0c2139SMatthew G Knepley /* Put faces touching the fault in the label */ 1075cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1076cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 1077cd0c2139SMatthew G Knepley 1078cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1079cd0c2139SMatthew G Knepley if (val == -1) { 1080cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 1081cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 1082cd0c2139SMatthew G Knepley 1083cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1084cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1085cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 1086cd0c2139SMatthew G Knepley 1087cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1088cd0c2139SMatthew G Knepley if ((val >= 0) && (val < dim-1)) { 1089cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1090cd0c2139SMatthew G Knepley break; 1091cd0c2139SMatthew G Knepley } 1092cd0c2139SMatthew G Knepley } 1093cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1094cd0c2139SMatthew G Knepley } 1095cd0c2139SMatthew G Knepley } 1096cd0c2139SMatthew G Knepley } 1097cd0c2139SMatthew G Knepley } 109847946fd8SMatthew G. Knepley if (subdm) { 109947946fd8SMatthew G. Knepley if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 110047946fd8SMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 110147946fd8SMatthew G. Knepley } 1102cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1103cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1104cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1105cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1106cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 1107cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1108cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1109cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1110cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1111cd0c2139SMatthew G Knepley PetscInt *star = NULL; 1112cd0c2139SMatthew G Knepley PetscInt starSize, s; 1113cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1114cd0c2139SMatthew G Knepley 1115cd0c2139SMatthew G Knepley /* First mark cells connected to the fault */ 1116cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1117cd0c2139SMatthew G Knepley while (again) { 1118cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1119cd0c2139SMatthew G Knepley again = 0; 1120cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1121cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1122cd0c2139SMatthew G Knepley const PetscInt *cone; 1123cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1124cd0c2139SMatthew G Knepley 1125cd0c2139SMatthew G Knepley if ((point < cStart) || (point >= cEnd)) continue; 1126cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1127cd0c2139SMatthew G Knepley if (val != -1) continue; 1128cd0c2139SMatthew G Knepley again = 2; 1129cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1130cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1131cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1132cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1133cd0c2139SMatthew G Knepley if (val != -1) { 1134cd0c2139SMatthew 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); 1135cd0c2139SMatthew G Knepley if (val > 0) { 1136cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dim);CHKERRQ(ierr); 1137cd0c2139SMatthew G Knepley } else { 1138cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dim));CHKERRQ(ierr); 1139cd0c2139SMatthew G Knepley } 1140cd0c2139SMatthew G Knepley again = 1; 1141cd0c2139SMatthew G Knepley break; 1142cd0c2139SMatthew G Knepley } 1143cd0c2139SMatthew G Knepley } 1144cd0c2139SMatthew G Knepley } 1145cd0c2139SMatthew G Knepley } 1146cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1147cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1148cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1149cd0c2139SMatthew G Knepley 1150cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1151cd0c2139SMatthew G Knepley if (val == -1) { 1152cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1153cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1154cd0c2139SMatthew G Knepley PetscBool marked = PETSC_FALSE; 1155cd0c2139SMatthew G Knepley 1156cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1157cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1158cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1159cd0c2139SMatthew G Knepley 1160cd0c2139SMatthew G Knepley if ((spoint < cStart) || (spoint >= cEnd)) continue; 1161cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1162cd0c2139SMatthew 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); 1163d90583fdSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1164cd0c2139SMatthew G Knepley if (val > 0) { 1165cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1166cd0c2139SMatthew G Knepley } else { 1167cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1168cd0c2139SMatthew G Knepley } 1169cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1170cd0c2139SMatthew G Knepley break; 1171cd0c2139SMatthew G Knepley } 1172cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1173cd0c2139SMatthew G Knepley if (!marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1174cd0c2139SMatthew G Knepley } 1175cd0c2139SMatthew G Knepley } 1176cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1177cd0c2139SMatthew G Knepley } 1178cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1179cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1180cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1181cd0c2139SMatthew G Knepley } 1182cd0c2139SMatthew G Knepley 1183cd0c2139SMatthew G Knepley #undef __FUNCT__ 1184efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated" 1185efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 1186efa14ee0SMatthew G Knepley 1187efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 1188efa14ee0SMatthew G Knepley */ 1189830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1190efa14ee0SMatthew G Knepley { 1191fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 1192efa14ee0SMatthew G Knepley const PetscInt *subvertices; 119377d178adSMatthew G. Knepley PetscInt *pStart, *pEnd, *pMax, pSize; 1194efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1195efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1196efa14ee0SMatthew G Knepley 1197efa14ee0SMatthew G Knepley PetscFunctionBegin; 1198efa14ee0SMatthew G Knepley *numFaces = 0; 1199efa14ee0SMatthew G Knepley *nFV = 0; 1200efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1201efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 120277d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 120377d178adSMatthew G. Knepley ierr = PetscMalloc3(pSize,PetscInt,&pStart,pSize,PetscInt,&pEnd,pSize,PetscInt,&pMax);CHKERRQ(ierr); 1204d92e47f8SMatthew 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); 1205efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 1206efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1207efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1208efa14ee0SMatthew G Knepley } 1209efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1210fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1211efa14ee0SMatthew G Knepley if (subvertexIS) { 1212efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1213efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1214efa14ee0SMatthew G Knepley } 1215efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1216efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 12170298fd71SBarry Smith PetscInt *star = NULL; 1218efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 1219efa14ee0SMatthew G Knepley 1220efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1221efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1222efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1223efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1224efa14ee0SMatthew G Knepley } 1225efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 1226efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 12270298fd71SBarry Smith PetscInt *closure = NULL; 1228efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 1229efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 1230efa14ee0SMatthew G Knepley 1231efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 123265560c7fSMatthew G Knepley if (cellLoc == 2) continue; 123382f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1234efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1235efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1236efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1237efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1238efa14ee0SMatthew G Knepley 1239efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1240efa14ee0SMatthew G Knepley ++numCorners; 1241efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1242830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 1243efa14ee0SMatthew G Knepley } 1244efa14ee0SMatthew G Knepley } 124518ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 124682f516ccSBarry 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); 1247efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 1248007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 1249007baee2SMatthew G. Knepley PetscInt numCells, nc; 1250007baee2SMatthew G. Knepley 1251efa14ee0SMatthew G Knepley ++(*numFaces); 1252efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 1253efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 1254efa14ee0SMatthew G Knepley } 1255007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1256007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 1257007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 1258007baee2SMatthew G. Knepley } 1259007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1260efa14ee0SMatthew G Knepley } 1261efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1262efa14ee0SMatthew G Knepley } 1263efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1264efa14ee0SMatthew G Knepley } 1265efa14ee0SMatthew G Knepley if (subvertexIS) { 1266efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1267efa14ee0SMatthew G Knepley } 1268efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1269efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1270efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1271efa14ee0SMatthew G Knepley } 1272efa14ee0SMatthew G Knepley 1273efa14ee0SMatthew G Knepley #undef __FUNCT__ 1274efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated" 1275830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 1276efa14ee0SMatthew G Knepley { 1277efa14ee0SMatthew G Knepley IS subvertexIS; 1278efa14ee0SMatthew G Knepley const PetscInt *subvertices; 1279efa14ee0SMatthew G Knepley PetscInt *pStart, *pEnd, *pMax; 1280efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 1281efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1282efa14ee0SMatthew G Knepley 1283efa14ee0SMatthew G Knepley PetscFunctionBegin; 1284efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1285efa14ee0SMatthew G Knepley ierr = PetscMalloc3(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd,dim+1,PetscInt,&pMax);CHKERRQ(ierr); 12860298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1287efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 1288efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1289efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1290efa14ee0SMatthew G Knepley } 1291efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1292830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 1293efa14ee0SMatthew G Knepley if (subvertexIS) { 1294efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1295efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1296efa14ee0SMatthew G Knepley } 1297efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1298efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 12990298fd71SBarry Smith PetscInt *star = NULL; 1300efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 1301efa14ee0SMatthew G Knepley 1302efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1303efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1304efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1305efa14ee0SMatthew G Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 1306efa14ee0SMatthew G Knepley } 1307efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 1308efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 13090298fd71SBarry Smith PetscInt *closure = NULL; 1310efa14ee0SMatthew G Knepley PetscInt closureSize, c; 1311efa14ee0SMatthew G Knepley PetscInt faceLoc; 1312efa14ee0SMatthew G Knepley 1313efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 1314efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 131582f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 1316efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1317efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1318efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1319efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1320efa14ee0SMatthew G Knepley 1321efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1322efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1323830e53efSMatthew G. Knepley if (vertexLoc != value) break; 1324efa14ee0SMatthew G Knepley } 1325efa14ee0SMatthew G Knepley } 1326efa14ee0SMatthew G Knepley if (c == closureSize*2) { 1327efa14ee0SMatthew G Knepley const PetscInt *support; 1328efa14ee0SMatthew G Knepley PetscInt supportSize, s; 1329efa14ee0SMatthew G Knepley 1330efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1331efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1332efa14ee0SMatthew G Knepley 1333efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 1334efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1335efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1336efa14ee0SMatthew G Knepley break; 1337efa14ee0SMatthew G Knepley } 1338efa14ee0SMatthew G Knepley } 1339efa14ee0SMatthew G Knepley } 1340efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 1341efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 1342efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1343efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1344efa14ee0SMatthew G Knepley } 1345efa14ee0SMatthew G Knepley } 1346efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1347efa14ee0SMatthew G Knepley } 1348efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1349efa14ee0SMatthew G Knepley } 1350efa14ee0SMatthew G Knepley if (subvertexIS) { 1351efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1352efa14ee0SMatthew G Knepley } 1353efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1354efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1355efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1356efa14ee0SMatthew G Knepley } 1357efa14ee0SMatthew G Knepley 1358efa14ee0SMatthew G Knepley #undef __FUNCT__ 1359766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated" 136027c04023SMatthew 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) 1361766ab985SMatthew G. Knepley { 136227c04023SMatthew G. Knepley DMLabel label = NULL; 1363766ab985SMatthew G. Knepley const PetscInt *cone; 136427234c99SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize; 1365766ab985SMatthew G. Knepley PetscErrorCode ierr; 1366766ab985SMatthew G. Knepley 1367812bfc34SJed Brown PetscFunctionBegin; 1368c0ed958bSJed Brown *numFaces = 0; 1369c0ed958bSJed Brown *nFV = 0; 1370b6d5cb33SJed Brown if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1371fed694aaSMatthew G. Knepley *subCells = NULL; 1372766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1373766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1374766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1375766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 137627c04023SMatthew G. Knepley if (label) { 137727c04023SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 137827c04023SMatthew G. Knepley PetscInt val; 137927c04023SMatthew G. Knepley 138027c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 138127c04023SMatthew G. Knepley if (val == value) { 138227c04023SMatthew G. Knepley ++(*numFaces); 138327c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 138427c04023SMatthew G. Knepley } 138527c04023SMatthew G. Knepley } 138627c04023SMatthew G. Knepley } else { 1387766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 138827c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 138927c04023SMatthew G. Knepley } 1390766ab985SMatthew G. Knepley *nFV = hasLagrange ? coneSize/3 : coneSize/2; 1391766ab985SMatthew G. Knepley ierr = PetscMalloc(*numFaces *2 * sizeof(PetscInt), subCells);CHKERRQ(ierr); 1392766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1393766ab985SMatthew G. Knepley const PetscInt *cells; 1394766ab985SMatthew G. Knepley PetscInt numCells; 1395766ab985SMatthew G. Knepley 139627c04023SMatthew G. Knepley if (label) { 139727c04023SMatthew G. Knepley PetscInt val; 139827c04023SMatthew G. Knepley 139927c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 140027c04023SMatthew G. Knepley if (val != value) continue; 140127c04023SMatthew G. Knepley } 1402766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1403766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 1404766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 1405766ab985SMatthew G. Knepley } 1406766ab985SMatthew G. Knepley /* Negative face */ 1407766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 140827234c99SMatthew G. Knepley /* Not true in parallel 140927234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 1410766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 1411766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 141227234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 1413766ab985SMatthew G. Knepley } 1414766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 1415766ab985SMatthew G. Knepley /* Positive face is not included */ 1416766ab985SMatthew G. Knepley } 1417766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1418766ab985SMatthew G. Knepley } 1419766ab985SMatthew G. Knepley 1420766ab985SMatthew G. Knepley #undef __FUNCT__ 1421766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated" 142227c04023SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, PetscBool hasLagrange, const char labelname[], PetscInt value, DMLabel subpointMap, DM subdm) 1423766ab985SMatthew G. Knepley { 142427c04023SMatthew G. Knepley DMLabel label = NULL; 1425766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 1426766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 1427766ab985SMatthew G. Knepley PetscErrorCode ierr; 1428766ab985SMatthew G. Knepley 1429812bfc34SJed Brown PetscFunctionBegin; 143027c04023SMatthew G. Knepley if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1431766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1432766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1433766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1434766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 1435766ab985SMatthew G. Knepley ierr = PetscMalloc2(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd);CHKERRQ(ierr); 1436766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 1437766ab985SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1438766ab985SMatthew G. Knepley } 1439766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1440766ab985SMatthew G. Knepley const PetscInt *cone; 1441766ab985SMatthew G. Knepley PetscInt *closure = NULL; 1442766ab985SMatthew G. Knepley PetscInt coneSize, closureSize, cl; 1443766ab985SMatthew G. Knepley 144427c04023SMatthew G. Knepley if (label) { 144527c04023SMatthew G. Knepley PetscInt val; 144627c04023SMatthew G. Knepley 144727c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 144827c04023SMatthew G. Knepley if (val != value) continue; 144927c04023SMatthew G. Knepley } 1450766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 1451766ab985SMatthew G. Knepley if (hasLagrange) { 1452766ab985SMatthew G. Knepley if (coneSize != 3) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 1453766ab985SMatthew G. Knepley } else { 1454766ab985SMatthew G. Knepley if (coneSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 1455766ab985SMatthew G. Knepley } 1456766ab985SMatthew G. Knepley /* Negative face */ 1457766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1458766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1459766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1460766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 1461766ab985SMatthew G. Knepley 1462766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 1463766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1464766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1465766ab985SMatthew G. Knepley break; 1466766ab985SMatthew G. Knepley } 1467766ab985SMatthew G. Knepley } 1468766ab985SMatthew G. Knepley } 1469766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1470766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 1471766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 1472766ab985SMatthew G. Knepley const PetscInt *support; 1473766ab985SMatthew G. Knepley PetscInt supportSize, s; 1474766ab985SMatthew G. Knepley 1475766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 1476766ab985SMatthew G. Knepley if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); 1477766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 1478766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 1479766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1480766ab985SMatthew G. Knepley } 1481766ab985SMatthew G. Knepley } 1482766ab985SMatthew G. Knepley } 1483766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 1484766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1485766ab985SMatthew G. Knepley } 1486766ab985SMatthew G. Knepley 1487766ab985SMatthew G. Knepley #undef __FUNCT__ 1488e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation" 1489e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 1490e6ccafaeSMatthew G Knepley { 149182f516ccSBarry Smith MPI_Comm comm; 1492e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 1493e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 1494e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 1495e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1496e6ccafaeSMatthew G Knepley 149782f516ccSBarry Smith PetscFunctionBegin; 149882f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1499e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &cellDim);CHKERRQ(ierr); 1500e6ccafaeSMatthew G Knepley if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 1501e6ccafaeSMatthew G Knepley 1502ddeab2a6SMatthew G. Knepley if (cellDim == 1 && numCorners == 2) { 1503ddeab2a6SMatthew G. Knepley /* Triangle */ 1504e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 1505e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1506ddeab2a6SMatthew G. Knepley } else if (cellDim == 2 && numCorners == 3) { 1507ddeab2a6SMatthew G. Knepley /* Triangle */ 1508ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 1509ddeab2a6SMatthew G. Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1510ddeab2a6SMatthew G. Knepley } else if (cellDim == 3 && numCorners == 4) { 1511ddeab2a6SMatthew G. Knepley /* Tetrahedron */ 1512ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 1513ddeab2a6SMatthew G. Knepley posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1514e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 1515e6ccafaeSMatthew G Knepley /* Quadratic line */ 1516e6ccafaeSMatthew G Knepley faceSize = 1; 1517e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1518e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 1519e6ccafaeSMatthew G Knepley /* Quads */ 1520e6ccafaeSMatthew G Knepley faceSize = 2; 1521e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 1522e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1523e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 1524e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1525e6ccafaeSMatthew G Knepley } else { 1526e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 1527e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 1528e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 1529e6ccafaeSMatthew G Knepley } 1530e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 1531e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 1532e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 1533e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 1534e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 1535e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1536e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 1537e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 1538e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 1539e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 1540e6ccafaeSMatthew G Knepley }; 1541e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 1542e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 1543e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 1544e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 1545e6ccafaeSMatthew G Knepley }; 1546e6ccafaeSMatthew G Knepley 1547e6ccafaeSMatthew G Knepley faceSize = faceSizeTri; 1548e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 1549e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 1550e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 1551e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 1552e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1553e6ccafaeSMatthew G Knepley 1554e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 1555e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 1556e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 1557e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 1558e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 1559e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1560e6ccafaeSMatthew G Knepley break; 1561e6ccafaeSMatthew G Knepley } 1562e6ccafaeSMatthew G Knepley } 1563e6ccafaeSMatthew G Knepley } 1564e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1565e6ccafaeSMatthew G Knepley break; 1566e6ccafaeSMatthew G Knepley } 1567e6ccafaeSMatthew G Knepley } 1568e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 1569e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1570e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1571e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 1572e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 1573e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 1574e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 1575e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 1576e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1577e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 1578e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 1579e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 1580e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 1581e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 1582e6ccafaeSMatthew G Knepley }; 1583e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 1584e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 1585e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 1586e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 1587e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 1588e6ccafaeSMatthew G Knepley }; 1589e6ccafaeSMatthew G Knepley 1590e6ccafaeSMatthew G Knepley faceSize = faceSizeQuad; 1591e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 1592e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 1593e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 1594e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 1595e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1596e6ccafaeSMatthew G Knepley 1597e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 1598e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 1599e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 1600e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 1601e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 1602e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1603e6ccafaeSMatthew G Knepley break; 1604e6ccafaeSMatthew G Knepley } 1605e6ccafaeSMatthew G Knepley } 1606e6ccafaeSMatthew G Knepley } 1607e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1608e6ccafaeSMatthew G Knepley break; 1609e6ccafaeSMatthew G Knepley } 1610e6ccafaeSMatthew G Knepley } 1611e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 1612e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1613e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1614e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 1615e6ccafaeSMatthew G Knepley /* Hexes 1616e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 1617e6ccafaeSMatthew G Knepley pointing up at the second. 1618e6ccafaeSMatthew G Knepley 1619e6ccafaeSMatthew G Knepley 7---6 1620e6ccafaeSMatthew G Knepley /| /| 1621e6ccafaeSMatthew G Knepley 4---5 | 1622ddeab2a6SMatthew G. Knepley | 1-|-2 1623e6ccafaeSMatthew G Knepley |/ |/ 1624ddeab2a6SMatthew G. Knepley 0---3 1625e6ccafaeSMatthew G Knepley 1626e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 1627e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 1628e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 1629e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1630e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 1631e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 1632e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 1633ddeab2a6SMatthew G. Knepley 0, 3, 4, 5, /* front */ 1634ddeab2a6SMatthew G. Knepley 2, 3, 5, 6, /* right */ 1635ddeab2a6SMatthew G. Knepley 1, 2, 6, 7, /* back */ 1636ddeab2a6SMatthew G. Knepley 0, 1, 4, 7, /* left */ 1637e6ccafaeSMatthew G Knepley }; 1638e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 1639ddeab2a6SMatthew G. Knepley 1, 2, 3, 0, /* bottom */ 1640e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 1641ddeab2a6SMatthew G. Knepley 0, 3, 5, 4, /* front */ 1642ddeab2a6SMatthew G. Knepley 3, 2, 6, 5, /* right */ 1643ddeab2a6SMatthew G. Knepley 2, 1, 7, 6, /* back */ 1644ddeab2a6SMatthew G. Knepley 1, 0, 4, 7, /* left */ 1645e6ccafaeSMatthew G Knepley }; 1646e6ccafaeSMatthew G Knepley 1647e6ccafaeSMatthew G Knepley faceSize = faceSizeHex; 1648e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 1649e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 1650e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 1651e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 1652e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1653e6ccafaeSMatthew G Knepley 1654e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 1655e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 1656e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 1657e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 1658e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 1659e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 1660e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 1661e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1662e6ccafaeSMatthew G Knepley break; 1663e6ccafaeSMatthew G Knepley } 1664e6ccafaeSMatthew G Knepley } 1665e6ccafaeSMatthew G Knepley } 1666e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1667e6ccafaeSMatthew G Knepley break; 1668e6ccafaeSMatthew G Knepley } 1669e6ccafaeSMatthew G Knepley } 1670e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 1671e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1672e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1673e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 1674e6ccafaeSMatthew G Knepley /* Quadratic tet */ 1675e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 1676e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 1677e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 1678e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1679e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 1680e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 1681e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 1682e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 1683e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 1684e6ccafaeSMatthew G Knepley }; 1685e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 1686e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 1687e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 1688e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 1689e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 1690e6ccafaeSMatthew G Knepley }; 1691e6ccafaeSMatthew G Knepley 1692e6ccafaeSMatthew G Knepley faceSize = faceSizeTet; 1693e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 1694e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 1695e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 1696e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 1697e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1698e6ccafaeSMatthew G Knepley 1699e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 1700e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 1701e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 1702e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 1703e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 1704e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 1705e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 1706e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1707e6ccafaeSMatthew G Knepley break; 1708e6ccafaeSMatthew G Knepley } 1709e6ccafaeSMatthew G Knepley } 1710e6ccafaeSMatthew G Knepley } 1711e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1712e6ccafaeSMatthew G Knepley break; 1713e6ccafaeSMatthew G Knepley } 1714e6ccafaeSMatthew G Knepley } 1715e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 1716e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1717e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1718e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 1719e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 1720e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 1721e6ccafaeSMatthew G Knepley pointing up at the second. 1722e6ccafaeSMatthew G Knepley 1723e6ccafaeSMatthew G Knepley 7---6 1724e6ccafaeSMatthew G Knepley /| /| 1725e6ccafaeSMatthew G Knepley 4---5 | 1726e6ccafaeSMatthew G Knepley | 3-|-2 1727e6ccafaeSMatthew G Knepley |/ |/ 1728e6ccafaeSMatthew G Knepley 0---1 1729e6ccafaeSMatthew G Knepley 1730e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 1731e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 1732e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 1733e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1734e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 1735e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 1736e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 1737e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 1738e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 1739e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 1740e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 1741e6ccafaeSMatthew G Knepley }; 1742e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 1743e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 1744e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 1745e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 1746e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 1747e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 1748e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 1749e6ccafaeSMatthew G Knepley }; 1750e6ccafaeSMatthew G Knepley 1751e6ccafaeSMatthew G Knepley faceSize = faceSizeQuadHex; 1752e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 1753e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 1754e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 1755e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 1756e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1757e6ccafaeSMatthew G Knepley 1758e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 1759e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 1760e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 1761e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 1762e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 1763e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 1764e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 1765e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1766e6ccafaeSMatthew G Knepley break; 1767e6ccafaeSMatthew G Knepley } 1768e6ccafaeSMatthew G Knepley } 1769e6ccafaeSMatthew G Knepley } 1770e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1771e6ccafaeSMatthew G Knepley break; 1772e6ccafaeSMatthew G Knepley } 1773e6ccafaeSMatthew G Knepley } 1774e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 1775e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1776e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1777e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 1778e6ccafaeSMatthew G Knepley if (!posOrient) { 1779e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 1780e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 1781e6ccafaeSMatthew G Knepley } else { 1782e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 1783e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 1784e6ccafaeSMatthew G Knepley } 1785e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 1786e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1787e6ccafaeSMatthew G Knepley } 1788e6ccafaeSMatthew G Knepley 1789e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1790e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace" 1791e6ccafaeSMatthew G Knepley /* 1792e6ccafaeSMatthew G Knepley Given a cell and a face, as a set of vertices, 1793e6ccafaeSMatthew G Knepley return the oriented face, as a set of vertices, in faceVertices 1794e6ccafaeSMatthew G Knepley The orientation is such that the face normal points out of the cell 1795e6ccafaeSMatthew G Knepley */ 1796e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 1797e6ccafaeSMatthew G Knepley { 17980298fd71SBarry Smith const PetscInt *cone = NULL; 1799e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 1800e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 1801e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1802e6ccafaeSMatthew G Knepley 1803e6ccafaeSMatthew G Knepley PetscFunctionBegin; 1804e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 1805e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 1806e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 1807e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1808e6ccafaeSMatthew G Knepley 1809e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 1810e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 1811e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 1812e6ccafaeSMatthew G Knepley } 1813e6ccafaeSMatthew G Knepley } 1814e6ccafaeSMatthew G Knepley if (found) { 1815e6ccafaeSMatthew G Knepley indices[v2] = v; 1816e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 1817e6ccafaeSMatthew G Knepley ++v2; 1818e6ccafaeSMatthew G Knepley } else { 1819e6ccafaeSMatthew G Knepley oppositeVertex = v; 1820e6ccafaeSMatthew G Knepley } 1821e6ccafaeSMatthew G Knepley } 1822e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 1823e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1824e6ccafaeSMatthew G Knepley } 1825e6ccafaeSMatthew G Knepley 1826e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1827cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal" 1828e6ccafaeSMatthew G Knepley /* 1829cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 1830e6ccafaeSMatthew G Knepley 1831e6ccafaeSMatthew G Knepley Not collective 1832e6ccafaeSMatthew G Knepley 1833e6ccafaeSMatthew G Knepley Input Parameters: 1834e6ccafaeSMatthew G Knepley + dm - The DMPlex 1835e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 1836e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 1837e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 1838e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 1839e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 1840e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 1841e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 1842e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 1843e6ccafaeSMatthew G Knepley 1844e6ccafaeSMatthew G Knepley Output Parameters: 1845e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 1846e6ccafaeSMatthew G Knepley 1847e6ccafaeSMatthew G Knepley Level: developer 1848e6ccafaeSMatthew G Knepley */ 1849cd0c2139SMatthew 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) 1850e6ccafaeSMatthew G Knepley { 185182f516ccSBarry Smith MPI_Comm comm; 1852e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 1853e6ccafaeSMatthew G Knepley const PetscInt *faces; 1854e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 1855e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1856e6ccafaeSMatthew G Knepley 1857e6ccafaeSMatthew G Knepley PetscFunctionBegin; 185882f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1859e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 1860e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 1861e6ccafaeSMatthew G Knepley #if 0 1862e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 1863e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 1864e6ccafaeSMatthew G Knepley #else 1865e6ccafaeSMatthew G Knepley { 1866e6ccafaeSMatthew G Knepley PetscInt f; 1867e6ccafaeSMatthew G Knepley 1868e6ccafaeSMatthew G Knepley numFaces = 0; 1869e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 1870e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 1871e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 1872e6ccafaeSMatthew G Knepley 1873e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 1874e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 1875e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 1876e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 1877e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 1878e6ccafaeSMatthew G Knepley PetscInt v; 1879e6ccafaeSMatthew G Knepley 1880e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 1881e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 1882e6ccafaeSMatthew G Knepley } 1883e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 1884e6ccafaeSMatthew G Knepley } 1885e6ccafaeSMatthew G Knepley if (d == dof) { 1886e6ccafaeSMatthew G Knepley numFaces = 1; 1887e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 1888e6ccafaeSMatthew G Knepley } 1889e6ccafaeSMatthew G Knepley } 1890e6ccafaeSMatthew G Knepley } 1891e6ccafaeSMatthew G Knepley #endif 1892e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 1893e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 1894e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 1895766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 1896e6ccafaeSMatthew G Knepley } else { 1897e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 1898e6ccafaeSMatthew G Knepley PetscBool posOriented; 1899e6ccafaeSMatthew G Knepley 1900e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 1901e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 1902e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 1903e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 1904e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 1905e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 1906e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 1907e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 1908e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 1909e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 1910e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 1911e6ccafaeSMatthew G Knepley break; 1912e6ccafaeSMatthew G Knepley } 1913e6ccafaeSMatthew G Knepley } 1914e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 1915e6ccafaeSMatthew G Knepley } 1916e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 1917e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 1918e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 1919e6ccafaeSMatthew G Knepley ++(*newFacePoint); 1920e6ccafaeSMatthew G Knepley } 1921ef07cca7SMatthew G. Knepley #if 0 1922e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 1923ef07cca7SMatthew G. Knepley #else 1924ef07cca7SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 1925ef07cca7SMatthew G. Knepley #endif 1926e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1927e6ccafaeSMatthew G Knepley } 1928e6ccafaeSMatthew G Knepley 1929e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1930e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated" 1931830e53efSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, const char vertexLabelName[], PetscInt value, DM subdm) 1932e6ccafaeSMatthew G Knepley { 193382f516ccSBarry Smith MPI_Comm comm; 1934efa14ee0SMatthew G Knepley DMLabel vertexLabel, subpointMap; 1935efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 1936efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 1937efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 1938fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 1939efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 1940e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1941e6ccafaeSMatthew G Knepley 1942e6ccafaeSMatthew G Knepley PetscFunctionBegin; 194382f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1944efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 1945efa14ee0SMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 1946efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 1947efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 1948fed694aaSMatthew G. Knepley if (vertexLabelName) { 1949efa14ee0SMatthew G Knepley ierr = DMPlexGetLabel(dm, vertexLabelName, &vertexLabel);CHKERRQ(ierr); 1950830e53efSMatthew G. Knepley ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr); 1951fed694aaSMatthew G. Knepley } 1952efa14ee0SMatthew G Knepley /* Setup chart */ 1953efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 1954efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 1955efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 1956efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 1957e6ccafaeSMatthew G Knepley /* Set cone sizes */ 1958e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 1959efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 1960e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 1961efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 1962efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 1963efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 1964efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 1965e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 1966e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 1967e6ccafaeSMatthew G Knepley } 1968e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 1969e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 1970e6ccafaeSMatthew G Knepley } 1971e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 1972e6ccafaeSMatthew G Knepley /* Create face cones */ 1973efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 19740298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 1975efa14ee0SMatthew G Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 1976e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 1977e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 1978efa14ee0SMatthew G Knepley const PetscInt subcell = c; 19790298fd71SBarry Smith PetscInt *closure = NULL; 1980efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 1981e6ccafaeSMatthew G Knepley 1982e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1983efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1984efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1985e6ccafaeSMatthew G Knepley PetscInt subVertex; 1986e6ccafaeSMatthew G Knepley 1987efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 1988efa14ee0SMatthew G Knepley ++numCorners; 1989efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 1990efa14ee0SMatthew G Knepley if (subVertex >= 0) { 1991efa14ee0SMatthew G Knepley closure[faceSize] = point; 199265560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 1993e6ccafaeSMatthew G Knepley ++faceSize; 1994e6ccafaeSMatthew G Knepley } 1995e6ccafaeSMatthew G Knepley } 1996e6ccafaeSMatthew G Knepley } 1997efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 1998efa14ee0SMatthew G Knepley if (faceSize == nFV) { 1999cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 2000e6ccafaeSMatthew G Knepley } 200165560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2002e6ccafaeSMatthew G Knepley } 2003efa14ee0SMatthew G Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2004e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2005e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2006e6ccafaeSMatthew G Knepley /* Build coordinates */ 2007efa14ee0SMatthew G Knepley { 2008efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 2009efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 2010efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 2011285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2012efa14ee0SMatthew G Knepley 2013e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2014e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2015e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2016285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2017285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2018285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2019efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2020efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2021efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2022efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2023efa14ee0SMatthew G Knepley PetscInt dof; 2024efa14ee0SMatthew G Knepley 2025efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2026efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2027285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2028e6ccafaeSMatthew G Knepley } 2029e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2030e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2031e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2032e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2033e6ccafaeSMatthew G Knepley ierr = VecSetFromOptions(subCoordinates);CHKERRQ(ierr); 2034830e53efSMatthew G. Knepley if (coordSize) { 2035e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2036e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2037efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2038efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2039efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2040efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2041e6ccafaeSMatthew G Knepley 2042e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2043e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2044efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2045efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2046efa14ee0SMatthew 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); 2047e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2048e6ccafaeSMatthew G Knepley } 2049e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2050e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 20513b399e24SMatthew G. Knepley } 2052e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2053e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2054e6ccafaeSMatthew G Knepley } 2055efa14ee0SMatthew G Knepley /* Cleanup */ 2056efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2057efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2058efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2059efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2060e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2061e6ccafaeSMatthew G Knepley } 2062e6ccafaeSMatthew G Knepley 2063e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2064e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated" 2065830e53efSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, const char vertexLabelName[], PetscInt value, DM subdm) 2066e6ccafaeSMatthew G Knepley { 206782f516ccSBarry Smith MPI_Comm comm; 2068e6ccafaeSMatthew G Knepley DMLabel subpointMap, vertexLabel; 2069efa14ee0SMatthew G Knepley IS *subpointIS; 2070efa14ee0SMatthew G Knepley const PetscInt **subpoints; 207101a2673eSMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *coneONew; 2072efa14ee0SMatthew G Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2073e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2074e6ccafaeSMatthew G Knepley 2075e6ccafaeSMatthew G Knepley PetscFunctionBegin; 207682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2077efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2078e6ccafaeSMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2079efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2080efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 2081fed694aaSMatthew G. Knepley if (vertexLabelName) { 2082e6ccafaeSMatthew G Knepley ierr = DMPlexGetLabel(dm, vertexLabelName, &vertexLabel);CHKERRQ(ierr); 2083830e53efSMatthew G. Knepley ierr = DMPlexMarkSubmesh_Interpolated(dm, vertexLabel, value, subpointMap, subdm);CHKERRQ(ierr); 2084fed694aaSMatthew G. Knepley } 2085efa14ee0SMatthew G Knepley /* Setup chart */ 2086efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2087efa14ee0SMatthew G Knepley ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr); 2088e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2089e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2090e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 2091e6ccafaeSMatthew G Knepley } 2092e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2093e6ccafaeSMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2094e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2095e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 2096e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2097e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2098e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2099e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2100e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2101e6ccafaeSMatthew G Knepley ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2102e6ccafaeSMatthew G Knepley } 2103e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2104e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2105e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2106e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2107e6ccafaeSMatthew G Knepley const PetscInt *cone; 2108e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 2109e6ccafaeSMatthew G Knepley 2110e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2111e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2112e6ccafaeSMatthew G Knepley if (d == dim) { 2113e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2114e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2115e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2116e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 2117e6ccafaeSMatthew G Knepley } 2118e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2119e6ccafaeSMatthew G Knepley } 2120e6ccafaeSMatthew G Knepley } 2121e6ccafaeSMatthew G Knepley } 2122e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2123e6ccafaeSMatthew G Knepley /* Set cones */ 21240298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 212501a2673eSMatthew G. Knepley ierr = PetscMalloc2(maxConeSize,PetscInt,&coneNew,maxConeSize,PetscInt,&coneONew);CHKERRQ(ierr); 2126e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2127e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2128e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2129e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 21300e49e2e2SMatthew G. Knepley const PetscInt *cone, *ornt; 2131e6ccafaeSMatthew G Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2132e6ccafaeSMatthew G Knepley 2133e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2134e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2135e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 21360e49e2e2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2137e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2138e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 213901a2673eSMatthew G. Knepley if (subc >= 0) { 214001a2673eSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 214101a2673eSMatthew G. Knepley coneONew[coneSizeNew] = ornt[c]; 214201a2673eSMatthew G. Knepley ++coneSizeNew; 214301a2673eSMatthew G. Knepley } 2144e6ccafaeSMatthew G Knepley } 2145e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2146e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 214701a2673eSMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, coneONew);CHKERRQ(ierr); 2148e6ccafaeSMatthew G Knepley } 2149e6ccafaeSMatthew G Knepley } 215001a2673eSMatthew G. Knepley ierr = PetscFree2(coneNew,coneONew);CHKERRQ(ierr); 2151e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2152e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2153e6ccafaeSMatthew G Knepley /* Build coordinates */ 2154e6ccafaeSMatthew G Knepley { 2155e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 2156e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 2157e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 2158285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2159e6ccafaeSMatthew G Knepley 2160e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2161e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2162e6ccafaeSMatthew G Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2163285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2164285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2165285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2166e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2167e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2168e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2169e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2170e6ccafaeSMatthew G Knepley PetscInt dof; 2171e6ccafaeSMatthew G Knepley 2172e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2173e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2174285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2175e6ccafaeSMatthew G Knepley } 2176e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2177e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2178e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2179e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2180e6ccafaeSMatthew G Knepley ierr = VecSetFromOptions(subCoordinates);CHKERRQ(ierr); 2181e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2182e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2183e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2184e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2185e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2186e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2187e6ccafaeSMatthew G Knepley 2188e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2189e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2190e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2191e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2192e6ccafaeSMatthew 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); 2193efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2194e6ccafaeSMatthew G Knepley } 2195e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2196e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2197e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2198e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2199e6ccafaeSMatthew G Knepley } 2200efa14ee0SMatthew G Knepley /* Cleanup */ 2201e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2202e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2203e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2204e6ccafaeSMatthew G Knepley } 2205efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2206e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2207e6ccafaeSMatthew G Knepley } 2208e6ccafaeSMatthew G Knepley 2209e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2210e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh" 2211830e53efSMatthew G. Knepley /*@C 2212e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 2213e6ccafaeSMatthew G Knepley 2214e6ccafaeSMatthew G Knepley Input Parameters: 2215e6ccafaeSMatthew G Knepley + dm - The original mesh 2216830e53efSMatthew G. Knepley . vertexLabel - The DMLabel marking vertices contained in the surface 2217830e53efSMatthew G. Knepley - value - The label value to use 2218e6ccafaeSMatthew G Knepley 2219e6ccafaeSMatthew G Knepley Output Parameter: 2220e6ccafaeSMatthew G Knepley . subdm - The surface mesh 2221e6ccafaeSMatthew G Knepley 2222e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2223e6ccafaeSMatthew G Knepley 2224e6ccafaeSMatthew G Knepley Level: developer 2225e6ccafaeSMatthew G Knepley 2226e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue() 2227830e53efSMatthew G. Knepley @*/ 2228830e53efSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, const char vertexLabel[], PetscInt value, DM *subdm) 2229e6ccafaeSMatthew G Knepley { 2230e6ccafaeSMatthew G Knepley PetscInt dim, depth; 2231e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2232e6ccafaeSMatthew G Knepley 2233e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2234e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2235766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 2236e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2237e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 223882f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2239e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2240e6ccafaeSMatthew G Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2241e6ccafaeSMatthew G Knepley if (depth == dim) { 2242830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2243e6ccafaeSMatthew G Knepley } else { 2244830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2245e6ccafaeSMatthew G Knepley } 2246e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2247e6ccafaeSMatthew G Knepley } 2248e6ccafaeSMatthew G Knepley 2249e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2250aca35d17SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal" 2251aca35d17SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 2252aca35d17SMatthew G. Knepley { 2253aca35d17SMatthew G. Knepley PetscInt subPoint; 2254aca35d17SMatthew G. Knepley PetscErrorCode ierr; 2255aca35d17SMatthew G. Knepley 2256aca35d17SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 2257aca35d17SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 2258aca35d17SMatthew G. Knepley } 2259aca35d17SMatthew G. Knepley 2260aca35d17SMatthew G. Knepley #undef __FUNCT__ 2261766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated" 226227c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 2263766ab985SMatthew G. Knepley { 2264766ab985SMatthew G. Knepley MPI_Comm comm; 2265766ab985SMatthew G. Knepley DMLabel subpointMap; 2266766ab985SMatthew G. Knepley IS subvertexIS; 2267766ab985SMatthew G. Knepley const PetscInt *subVertices; 2268fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 2269766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 227087feddfdSMatthew G. Knepley PetscInt cMax, c, f; 2271766ab985SMatthew G. Knepley PetscErrorCode ierr; 2272766ab985SMatthew G. Knepley 2273766ab985SMatthew G. Knepley PetscFunctionBegin; 2274766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 2275766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2276766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2277766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2278766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 227927c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 2280766ab985SMatthew G. Knepley /* Setup chart */ 2281766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2282766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2283766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2284766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2285766ab985SMatthew G. Knepley /* Set cone sizes */ 2286766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 2287766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 2288766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 2289766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2290766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2291766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2292766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2293766ab985SMatthew G. Knepley } 2294766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2295766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2296766ab985SMatthew G. Knepley } 2297766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2298766ab985SMatthew G. Knepley /* Create face cones */ 2299766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 230087feddfdSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2301766ab985SMatthew G. Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2302766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2303766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 2304766ab985SMatthew G. Knepley const PetscInt subcell = c; 230587feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 230687feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 2307766ab985SMatthew G. Knepley 230887feddfdSMatthew G. Knepley if (cell < cMax) continue; 230987feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 231087feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 231187feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 231287feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 231387feddfdSMatthew G. Knepley } 231487feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 231587feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 231687feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 231727234c99SMatthew G. Knepley /* Not true in parallel 231827234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 231987feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 232087feddfdSMatthew G. Knepley PetscInt negsubcell; 2321766ab985SMatthew G. Knepley 232287feddfdSMatthew G. Knepley if (cells[p] >= cMax) continue; 232387feddfdSMatthew G. Knepley /* I know this is a crap search */ 232487feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 232587feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 2326766ab985SMatthew G. Knepley } 232787feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 232887feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 2329766ab985SMatthew G. Knepley } 233087feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 233187feddfdSMatthew G. Knepley ++newFacePoint; 2332766ab985SMatthew G. Knepley } 2333766ab985SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2334766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2335766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2336766ab985SMatthew G. Knepley /* Build coordinates */ 2337766ab985SMatthew G. Knepley { 2338766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2339766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2340766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2341285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2342766ab985SMatthew G. Knepley 2343766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2344766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2345766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2346285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2347285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2348285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2349766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2350766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2351766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2352766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2353766ab985SMatthew G. Knepley PetscInt dof; 2354766ab985SMatthew G. Knepley 2355766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2356766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2357285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2358766ab985SMatthew G. Knepley } 2359766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2360766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2361766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2362766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2363766ab985SMatthew G. Knepley ierr = VecSetFromOptions(subCoordinates);CHKERRQ(ierr); 2364766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2365766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2366766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2367766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2368766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2369766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 2370766ab985SMatthew G. Knepley 2371766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2372766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2373766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2374766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2375766ab985SMatthew 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); 2376766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2377766ab985SMatthew G. Knepley } 2378766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2379766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2380766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2381766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2382766ab985SMatthew G. Knepley } 2383aca35d17SMatthew G. Knepley /* Build SF */ 2384aca35d17SMatthew G. Knepley CHKMEMQ; 2385aca35d17SMatthew G. Knepley { 2386aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 2387aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 2388bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 2389aca35d17SMatthew G. Knepley const PetscInt *localPoints; 2390bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 239149c26ae4SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 2392bdcf2095SMatthew G. Knepley PetscMPIInt rank; 2393aca35d17SMatthew G. Knepley 2394bdcf2095SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 2395aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 2396aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 2397aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2398aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 2399aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 2400aca35d17SMatthew G. Knepley if (numRoots >= 0) { 2401aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 2402bdcf2095SMatthew G. Knepley ierr = PetscMalloc2(pEnd-pStart,PetscSFNode,&newLocalPoints,numRoots,PetscSFNode,&newOwners);CHKERRQ(ierr); 2403bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 2404bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 2405bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 2406bdcf2095SMatthew G. Knepley } 24079e0823b2SMatthew G. Knepley /* Set subleaves */ 2408aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2409aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 2410bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2411aca35d17SMatthew G. Knepley 2412aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 2413bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 2414bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 2415bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 2416bdcf2095SMatthew G. Knepley ++numSubLeaves; 2417aca35d17SMatthew G. Knepley } 24189e0823b2SMatthew G. Knepley /* Must put in owned subpoints */ 24199e0823b2SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 24209e0823b2SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 24219e0823b2SMatthew G. Knepley 24229e0823b2SMatthew G. Knepley if (subPoint < 0) { 24239e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = -3; 24249e0823b2SMatthew G. Knepley newOwners[p-pStart].index = -3; 24259e0823b2SMatthew G. Knepley } else { 24269e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = rank; 24279e0823b2SMatthew G. Knepley newOwners[p-pStart].index = subPoint; 24289e0823b2SMatthew G. Knepley } 2429bdcf2095SMatthew G. Knepley } 2430bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2431bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2432bdcf2095SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2433bdcf2095SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2434aca35d17SMatthew G. Knepley ierr = PetscMalloc(numSubLeaves * sizeof(PetscInt), &slocalPoints);CHKERRQ(ierr); 2435aca35d17SMatthew G. Knepley ierr = PetscMalloc(numSubLeaves * sizeof(PetscSFNode), &sremotePoints);CHKERRQ(ierr); 243649c26ae4SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 2437bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 2438bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2439aca35d17SMatthew G. Knepley 2440aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 244149c26ae4SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 2442aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 2443bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 2444bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 2445bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 2446bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 2447aca35d17SMatthew G. Knepley ++sl; 2448aca35d17SMatthew G. Knepley } 2449bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 245049c26ae4SMatthew G. Knepley if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 245149c26ae4SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 2452aca35d17SMatthew G. Knepley } 2453aca35d17SMatthew G. Knepley } 2454aca35d17SMatthew G. Knepley CHKMEMQ; 2455766ab985SMatthew G. Knepley /* Cleanup */ 2456766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2457766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2458766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 2459766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2460766ab985SMatthew G. Knepley } 2461766ab985SMatthew G. Knepley 2462766ab985SMatthew G. Knepley #undef __FUNCT__ 2463766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated" 246427c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 2465766ab985SMatthew G. Knepley { 2466766ab985SMatthew G. Knepley MPI_Comm comm; 2467766ab985SMatthew G. Knepley DMLabel subpointMap; 2468766ab985SMatthew G. Knepley IS *subpointIS; 2469766ab985SMatthew G. Knepley const PetscInt **subpoints; 2470766ab985SMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew; 2471766ab985SMatthew G. Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2472766ab985SMatthew G. Knepley PetscErrorCode ierr; 2473766ab985SMatthew G. Knepley 2474766ab985SMatthew G. Knepley PetscFunctionBegin; 2475766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2476766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2477766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2478766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2479766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 248027c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, hasLagrange, label, value, subpointMap, subdm);CHKERRQ(ierr); 2481766ab985SMatthew G. Knepley /* Setup chart */ 2482766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2483766ab985SMatthew G. Knepley ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr); 2484766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2485766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2486766ab985SMatthew G. Knepley totSubPoints += numSubPoints[d]; 2487766ab985SMatthew G. Knepley } 2488766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2489766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2490766ab985SMatthew G. Knepley /* Set cone sizes */ 2491766ab985SMatthew G. Knepley firstSubPoint[dim] = 0; 2492766ab985SMatthew G. Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2493766ab985SMatthew G. Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2494766ab985SMatthew G. Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2495766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2496766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2497766ab985SMatthew G. Knepley ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2498766ab985SMatthew G. Knepley } 2499766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2500766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2501766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2502766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2503766ab985SMatthew G. Knepley const PetscInt *cone; 2504766ab985SMatthew G. Knepley PetscInt coneSize, coneSizeNew, c, val; 2505766ab985SMatthew G. Knepley 2506766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2507766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2508766ab985SMatthew G. Knepley if (d == dim) { 2509766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2510766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2511766ab985SMatthew G. Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2512766ab985SMatthew G. Knepley if (val >= 0) coneSizeNew++; 2513766ab985SMatthew G. Knepley } 2514766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2515766ab985SMatthew G. Knepley } 2516766ab985SMatthew G. Knepley } 2517766ab985SMatthew G. Knepley } 2518766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2519766ab985SMatthew G. Knepley /* Set cones */ 2520766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2521766ab985SMatthew G. Knepley ierr = PetscMalloc(maxConeSize * sizeof(PetscInt), &coneNew);CHKERRQ(ierr); 2522766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2523766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2524766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2525766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2526766ab985SMatthew G. Knepley const PetscInt *cone; 2527766ab985SMatthew G. Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2528766ab985SMatthew G. Knepley 2529766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2530766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2531766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2532766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2533766ab985SMatthew G. Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 2534766ab985SMatthew G. Knepley if (subc >= 0) coneNew[coneSizeNew++] = firstSubPoint[d-1] + subc; 2535766ab985SMatthew G. Knepley } 2536766ab985SMatthew G. Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2537766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 2538766ab985SMatthew G. Knepley } 2539766ab985SMatthew G. Knepley } 2540766ab985SMatthew G. Knepley ierr = PetscFree(coneNew);CHKERRQ(ierr); 2541766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2542766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2543766ab985SMatthew G. Knepley /* Build coordinates */ 2544766ab985SMatthew G. Knepley { 2545766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2546766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2547766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2548285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2549766ab985SMatthew G. Knepley 2550766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2551766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2552766ab985SMatthew G. Knepley ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2553285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2554285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2555285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2556766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2557766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2558766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 2559766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2560766ab985SMatthew G. Knepley PetscInt dof; 2561766ab985SMatthew G. Knepley 2562766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2563766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2564285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2565766ab985SMatthew G. Knepley } 2566766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2567766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2568766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2569766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2570766ab985SMatthew G. Knepley ierr = VecSetFromOptions(subCoordinates);CHKERRQ(ierr); 2571766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2572766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2573766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2574766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 2575766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2576766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 2577766ab985SMatthew G. Knepley 2578766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2579766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2580766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2581766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2582766ab985SMatthew 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); 2583766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2584766ab985SMatthew G. Knepley } 2585766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2586766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2587766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2588766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2589766ab985SMatthew G. Knepley } 2590766ab985SMatthew G. Knepley /* Cleanup */ 2591766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2592766ab985SMatthew G. Knepley ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2593766ab985SMatthew G. Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2594766ab985SMatthew G. Knepley } 2595766ab985SMatthew G. Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2596766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2597766ab985SMatthew G. Knepley } 2598766ab985SMatthew G. Knepley 2599766ab985SMatthew G. Knepley #undef __FUNCT__ 2600766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh" 2601766ab985SMatthew G. Knepley /* 260227c04023SMatthew 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. 2603766ab985SMatthew G. Knepley 2604766ab985SMatthew G. Knepley Input Parameters: 2605766ab985SMatthew G. Knepley + dm - The original mesh 260627c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 260727c04023SMatthew G. Knepley . label - A label name, or PETSC_NULL 260827c04023SMatthew G. Knepley - value - A label value 2609766ab985SMatthew G. Knepley 2610766ab985SMatthew G. Knepley Output Parameter: 2611766ab985SMatthew G. Knepley . subdm - The surface mesh 2612766ab985SMatthew G. Knepley 2613766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2614766ab985SMatthew G. Knepley 2615766ab985SMatthew G. Knepley Level: developer 2616766ab985SMatthew G. Knepley 2617766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 2618766ab985SMatthew G. Knepley */ 261927c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 2620766ab985SMatthew G. Knepley { 2621766ab985SMatthew G. Knepley PetscInt dim, depth; 2622766ab985SMatthew G. Knepley PetscErrorCode ierr; 2623766ab985SMatthew G. Knepley 2624766ab985SMatthew G. Knepley PetscFunctionBegin; 2625766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 262627c04023SMatthew G. Knepley PetscValidPointer(subdm, 5); 2627766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2628766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2629766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2630766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2631766ab985SMatthew G. Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2632766ab985SMatthew G. Knepley if (depth == dim) { 263327c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 2634766ab985SMatthew G. Knepley } else { 263527c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 2636e6ccafaeSMatthew G Knepley } 2637e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2638e6ccafaeSMatthew G Knepley } 2639e6ccafaeSMatthew G Knepley 2640e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2641e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap" 264264beef6dSMatthew G. Knepley /*@ 264364beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 264464beef6dSMatthew G. Knepley 264564beef6dSMatthew G. Knepley Input Parameter: 264664beef6dSMatthew G. Knepley . dm - The submesh DM 264764beef6dSMatthew G. Knepley 264864beef6dSMatthew G. Knepley Output Parameter: 264964beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 265064beef6dSMatthew G. Knepley 265164beef6dSMatthew G. Knepley Level: developer 265264beef6dSMatthew G. Knepley 265364beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 265464beef6dSMatthew G. Knepley @*/ 2655e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 2656e6ccafaeSMatthew G Knepley { 2657e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 2658e6ccafaeSMatthew G Knepley 2659e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2660e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2661e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 2662e6ccafaeSMatthew G Knepley *subpointMap = mesh->subpointMap; 2663e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2664e6ccafaeSMatthew G Knepley } 2665e6ccafaeSMatthew G Knepley 2666e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2667e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap" 2668e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */ 2669e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 2670e6ccafaeSMatthew G Knepley { 2671e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 2672285d324eSMatthew G. Knepley DMLabel tmp; 2673e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2674e6ccafaeSMatthew G Knepley 2675e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2676e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2677285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 2678e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 2679285d324eSMatthew G. Knepley ++mesh->subpointMap->refct; 2680285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 2681e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2682e6ccafaeSMatthew G Knepley } 2683e6ccafaeSMatthew G Knepley 2684e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2685e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS" 268664beef6dSMatthew G. Knepley /*@ 2687e6ccafaeSMatthew G Knepley DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 2688e6ccafaeSMatthew G Knepley 2689e6ccafaeSMatthew G Knepley Input Parameter: 2690e6ccafaeSMatthew G Knepley . dm - The submesh DM 2691e6ccafaeSMatthew G Knepley 2692e6ccafaeSMatthew G Knepley Output Parameter: 26930298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 2694e6ccafaeSMatthew G Knepley 2695e6ccafaeSMatthew G Knepley Note: This is IS is guaranteed to be sorted by the construction of the submesh 269664beef6dSMatthew G. Knepley 269764beef6dSMatthew G. Knepley Level: developer 269864beef6dSMatthew G. Knepley 269964beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 270064beef6dSMatthew G. Knepley @*/ 2701e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 2702e6ccafaeSMatthew G Knepley { 270382f516ccSBarry Smith MPI_Comm comm; 2704e6ccafaeSMatthew G Knepley DMLabel subpointMap; 2705e6ccafaeSMatthew G Knepley IS is; 2706e6ccafaeSMatthew G Knepley const PetscInt *opoints; 2707e6ccafaeSMatthew G Knepley PetscInt *points, *depths; 2708e6ccafaeSMatthew G Knepley PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 2709e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2710e6ccafaeSMatthew G Knepley 2711e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2712e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2713e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 271482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 27150298fd71SBarry Smith *subpointIS = NULL; 2716e6ccafaeSMatthew G Knepley ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 2717e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2718fed694aaSMatthew G. Knepley if (subpointMap && depth >= 0) { 2719e6ccafaeSMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2720e6ccafaeSMatthew G Knepley if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 2721e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 2722e6ccafaeSMatthew G Knepley depths[0] = depth; 2723e6ccafaeSMatthew G Knepley depths[1] = 0; 2724e6ccafaeSMatthew G Knepley for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 2725e6ccafaeSMatthew G Knepley ierr = PetscMalloc(pEnd * sizeof(PetscInt), &points);CHKERRQ(ierr); 2726e6ccafaeSMatthew G Knepley for(d = 0, off = 0; d <= depth; ++d) { 2727e6ccafaeSMatthew G Knepley const PetscInt dep = depths[d]; 2728e6ccafaeSMatthew G Knepley 2729e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 2730e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 27311e21b6fdSMatthew G Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 2732e6ccafaeSMatthew 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); 2733e6ccafaeSMatthew G Knepley } else { 27341e21b6fdSMatthew G Knepley if (!n) { 27351e21b6fdSMatthew G Knepley if (d == 0) { 27361e21b6fdSMatthew G Knepley /* Missing cells */ 27371e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 27381e21b6fdSMatthew G Knepley } else { 27391e21b6fdSMatthew G Knepley /* Missing faces */ 27401e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 27411e21b6fdSMatthew G Knepley } 27421e21b6fdSMatthew G Knepley } 2743e6ccafaeSMatthew G Knepley } 2744e6ccafaeSMatthew G Knepley if (n) { 2745e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 2746e6ccafaeSMatthew G Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 2747e6ccafaeSMatthew G Knepley for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 2748e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 2749e6ccafaeSMatthew G Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 2750e6ccafaeSMatthew G Knepley } 2751e6ccafaeSMatthew G Knepley } 2752e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 2753e6ccafaeSMatthew G Knepley if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 2754fed694aaSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 2755e6ccafaeSMatthew G Knepley } 2756e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2757e6ccafaeSMatthew G Knepley } 2758