134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 20c312b8eSJed Brown #include <petscsf.h> 3e6ccafaeSMatthew G Knepley 4e6ccafaeSMatthew G Knepley #undef __FUNCT__ 5*30560a7bSMatthew G. Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces_Internal" 6*30560a7bSMatthew G. Knepley PetscErrorCode DMPlexMarkBoundaryFaces_Internal(DM dm, PetscInt cellHeight, DMLabel label) 7*30560a7bSMatthew G. Knepley { 8*30560a7bSMatthew G. Knepley PetscInt fStart, fEnd, f; 9*30560a7bSMatthew G. Knepley PetscErrorCode ierr; 10*30560a7bSMatthew G. Knepley 11*30560a7bSMatthew G. Knepley PetscFunctionBegin; 12*30560a7bSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 13*30560a7bSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight+1, &fStart, &fEnd);CHKERRQ(ierr); 14*30560a7bSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 15*30560a7bSMatthew G. Knepley PetscInt supportSize; 16*30560a7bSMatthew G. Knepley 17*30560a7bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 18*30560a7bSMatthew G. Knepley if (supportSize == 1) {ierr = DMLabelSetValue(label, f, 1);CHKERRQ(ierr);} 19*30560a7bSMatthew G. Knepley } 20*30560a7bSMatthew G. Knepley PetscFunctionReturn(0); 21*30560a7bSMatthew G. Knepley } 22*30560a7bSMatthew G. Knepley 23*30560a7bSMatthew G. Knepley #undef __FUNCT__ 24cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces" 25cd0c2139SMatthew G Knepley /*@ 26cd0c2139SMatthew G Knepley DMPlexMarkBoundaryFaces - Mark all faces on the boundary 27cd0c2139SMatthew G Knepley 28cd0c2139SMatthew G Knepley Not Collective 29cd0c2139SMatthew G Knepley 30cd0c2139SMatthew G Knepley Input Parameter: 31cd0c2139SMatthew G Knepley . dm - The original DM 32cd0c2139SMatthew G Knepley 33cd0c2139SMatthew G Knepley Output Parameter: 34cd0c2139SMatthew G Knepley . label - The DMLabel marking boundary faces with value 1 35cd0c2139SMatthew G Knepley 36cd0c2139SMatthew G Knepley Level: developer 37cd0c2139SMatthew G Knepley 38cd0c2139SMatthew G Knepley .seealso: DMLabelCreate(), DMPlexCreateLabel() 3909f723d9SJed Brown @*/ 40cd0c2139SMatthew G Knepley PetscErrorCode DMPlexMarkBoundaryFaces(DM dm, DMLabel label) 41cd0c2139SMatthew G Knepley { 42cd0c2139SMatthew G Knepley PetscErrorCode ierr; 43cd0c2139SMatthew G Knepley 44cd0c2139SMatthew G Knepley PetscFunctionBegin; 45*30560a7bSMatthew G. Knepley ierr = DMPlexMarkBoundaryFaces_Internal(dm, 1, label);CHKERRQ(ierr); 46cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 47cd0c2139SMatthew G Knepley } 48cd0c2139SMatthew G Knepley 49cd0c2139SMatthew G Knepley #undef __FUNCT__ 502be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelComplete" 512be2b188SMatthew G Knepley /*@ 522be2b188SMatthew G Knepley DMPlexLabelComplete - Starting with a label marking points on a surface, we add the transitive closure to the surface 532be2b188SMatthew G Knepley 542be2b188SMatthew G Knepley Input Parameters: 552be2b188SMatthew G Knepley + dm - The DM 562be2b188SMatthew G Knepley - label - A DMLabel marking the surface points 572be2b188SMatthew G Knepley 582be2b188SMatthew G Knepley Output Parameter: 592be2b188SMatthew G Knepley . label - A DMLabel marking all surface points in the transitive closure 602be2b188SMatthew G Knepley 612be2b188SMatthew G Knepley Level: developer 622be2b188SMatthew G Knepley 632be2b188SMatthew G Knepley .seealso: DMPlexLabelCohesiveComplete() 642be2b188SMatthew G Knepley @*/ 652be2b188SMatthew G Knepley PetscErrorCode DMPlexLabelComplete(DM dm, DMLabel label) 662be2b188SMatthew G Knepley { 672be2b188SMatthew G Knepley IS valueIS; 682be2b188SMatthew G Knepley const PetscInt *values; 692be2b188SMatthew G Knepley PetscInt numValues, v; 702be2b188SMatthew G Knepley PetscErrorCode ierr; 712be2b188SMatthew G Knepley 722be2b188SMatthew G Knepley PetscFunctionBegin; 732be2b188SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 742be2b188SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 752be2b188SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 762be2b188SMatthew G Knepley for (v = 0; v < numValues; ++v) { 772be2b188SMatthew G Knepley IS pointIS; 782be2b188SMatthew G Knepley const PetscInt *points; 792be2b188SMatthew G Knepley PetscInt numPoints, p; 802be2b188SMatthew G Knepley 812be2b188SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 822be2b188SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 832be2b188SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 842be2b188SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 852be2b188SMatthew G Knepley PetscInt *closure = NULL; 862be2b188SMatthew G Knepley PetscInt closureSize, c; 872be2b188SMatthew G Knepley 882be2b188SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 892be2b188SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 902be2b188SMatthew G Knepley ierr = DMLabelSetValue(label, closure[c], values[v]);CHKERRQ(ierr); 912be2b188SMatthew G Knepley } 922be2b188SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 932be2b188SMatthew G Knepley } 942be2b188SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 952be2b188SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 962be2b188SMatthew G Knepley } 972be2b188SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 982be2b188SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 992be2b188SMatthew G Knepley PetscFunctionReturn(0); 1002be2b188SMatthew G Knepley } 1012be2b188SMatthew G Knepley 1022be2b188SMatthew G Knepley #undef __FUNCT__ 1036cf0e42fSMatthew G. Knepley #define __FUNCT__ "DMPlexLabelAddCells" 1046cf0e42fSMatthew G. Knepley /*@ 1056cf0e42fSMatthew G. Knepley DMPlexLabelAddCells - Starting with a label marking faces on a surface, we add a cell for each face 1066cf0e42fSMatthew G. Knepley 1076cf0e42fSMatthew G. Knepley Input Parameters: 1086cf0e42fSMatthew G. Knepley + dm - The DM 1096cf0e42fSMatthew G. Knepley - label - A DMLabel marking the surface points 1106cf0e42fSMatthew G. Knepley 1116cf0e42fSMatthew G. Knepley Output Parameter: 1126cf0e42fSMatthew G. Knepley . label - A DMLabel incorporating cells 1136cf0e42fSMatthew G. Knepley 1146cf0e42fSMatthew G. Knepley Level: developer 1156cf0e42fSMatthew G. Knepley 1166cf0e42fSMatthew G. Knepley Note: The cells allow FEM boundary conditions to be applied using the cell geometry 1176cf0e42fSMatthew G. Knepley 1186cf0e42fSMatthew G. Knepley .seealso: DMPlexLabelComplete(), DMPlexLabelCohesiveComplete() 1196cf0e42fSMatthew G. Knepley @*/ 1206cf0e42fSMatthew G. Knepley PetscErrorCode DMPlexLabelAddCells(DM dm, DMLabel label) 1216cf0e42fSMatthew G. Knepley { 1226cf0e42fSMatthew G. Knepley IS valueIS; 1236cf0e42fSMatthew G. Knepley const PetscInt *values; 1246cf0e42fSMatthew G. Knepley PetscInt numValues, v, cStart, cEnd; 1256cf0e42fSMatthew G. Knepley PetscErrorCode ierr; 1266cf0e42fSMatthew G. Knepley 1276cf0e42fSMatthew G. Knepley PetscFunctionBegin; 1286cf0e42fSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1296cf0e42fSMatthew G. Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 1306cf0e42fSMatthew G. Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 1316cf0e42fSMatthew G. Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 1326cf0e42fSMatthew G. Knepley for (v = 0; v < numValues; ++v) { 1336cf0e42fSMatthew G. Knepley IS pointIS; 1346cf0e42fSMatthew G. Knepley const PetscInt *points; 1356cf0e42fSMatthew G. Knepley PetscInt numPoints, p; 1366cf0e42fSMatthew G. Knepley 1376cf0e42fSMatthew G. Knepley ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 1386cf0e42fSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 1396cf0e42fSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 1406cf0e42fSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1416cf0e42fSMatthew G. Knepley PetscInt *closure = NULL; 1426cf0e42fSMatthew G. Knepley PetscInt closureSize, point; 1436cf0e42fSMatthew G. Knepley 1446cf0e42fSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 1456cf0e42fSMatthew G. Knepley point = closure[(closureSize-1)*2]; 1466cf0e42fSMatthew G. Knepley if ((point >= cStart) && (point < cEnd)) {ierr = DMLabelSetValue(label, point, values[v]);CHKERRQ(ierr);} 1476cf0e42fSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 1486cf0e42fSMatthew G. Knepley } 1496cf0e42fSMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 1506cf0e42fSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 1516cf0e42fSMatthew G. Knepley } 1526cf0e42fSMatthew G. Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1536cf0e42fSMatthew G. Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1546cf0e42fSMatthew G. Knepley PetscFunctionReturn(0); 1556cf0e42fSMatthew G. Knepley } 1566cf0e42fSMatthew G. Knepley 1576cf0e42fSMatthew G. Knepley #undef __FUNCT__ 158cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoint_Internal" 159a6ae58d1SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthMax[], PetscInt depthEnd[], PetscInt depthShift[]) 160cd0c2139SMatthew G Knepley { 161cd0c2139SMatthew G Knepley if (depth < 0) return p; 162a6ae58d1SMatthew G. Knepley /* Normal Cells */ if (p < depthMax[depth]) return p; 163a6ae58d1SMatthew G. Knepley /* Hybrid Cells+Normal Vertices */ if (p < depthMax[0]) return p + depthShift[depth]; 164a6ae58d1SMatthew G. Knepley /* Hybrid Vertices+Normal Faces */ if (depth < 2 || p < depthMax[depth-1]) return p + depthShift[depth] + depthShift[0]; 165a6ae58d1SMatthew G. Knepley /* Hybrid Faces+Normal Edges */ if (depth < 3 || p < depthMax[depth-2]) return p + depthShift[depth] + depthShift[0] + depthShift[depth-1]; 166a6ae58d1SMatthew G. Knepley /* Hybrid Edges */ return p + depthShift[depth] + depthShift[0] + depthShift[depth-1] + depthShift[depth-2]; 167cd0c2139SMatthew G Knepley } 168cd0c2139SMatthew G Knepley 169cd0c2139SMatthew G Knepley #undef __FUNCT__ 170cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSizes_Internal" 171cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew) 172cd0c2139SMatthew G Knepley { 173a6ae58d1SMatthew G. Knepley PetscInt *depthMax, *depthEnd; 174cd0c2139SMatthew G Knepley PetscInt depth = 0, d, pStart, pEnd, p; 175cd0c2139SMatthew G Knepley PetscErrorCode ierr; 176cd0c2139SMatthew G Knepley 177cd0c2139SMatthew G Knepley PetscFunctionBegin; 178cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 179cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 1802203a8e9SMatthew G. Knepley ierr = PetscMalloc2(depth+1,&depthMax,depth+1,&depthEnd);CHKERRQ(ierr); 181cd0c2139SMatthew G Knepley /* Step 1: Expand chart */ 182cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 183a6ae58d1SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &depthMax[depth], depth > 0 ? &depthMax[depth-1] : NULL, &depthMax[1], &depthMax[0]);CHKERRQ(ierr); 184cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 185cd0c2139SMatthew G Knepley pEnd += depthShift[d]; 186cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 187a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 188cd0c2139SMatthew G Knepley } 189cd0c2139SMatthew G Knepley ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr); 190cd0c2139SMatthew G Knepley /* Step 2: Set cone and support sizes */ 191cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 192cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 193cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 194a6ae58d1SMatthew G. Knepley PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthMax, depthEnd, depthShift); 195cd0c2139SMatthew G Knepley PetscInt size; 196cd0c2139SMatthew G Knepley 197cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 198cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr); 199cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 200cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr); 201cd0c2139SMatthew G Knepley } 202cd0c2139SMatthew G Knepley } 203a6ae58d1SMatthew G. Knepley ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr); 204cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 205cd0c2139SMatthew G Knepley } 206cd0c2139SMatthew G Knepley 207cd0c2139SMatthew G Knepley #undef __FUNCT__ 208cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoints_Internal" 209cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew) 210cd0c2139SMatthew G Knepley { 211a6ae58d1SMatthew G. Knepley PetscInt *depthEnd, *depthMax, *newpoints; 212dcbb62e8SMatthew G. Knepley PetscInt depth = 0, d, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, pStart, pEnd, p; 213cd0c2139SMatthew G Knepley PetscErrorCode ierr; 214cd0c2139SMatthew G Knepley 215cd0c2139SMatthew G Knepley PetscFunctionBegin; 216cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 217cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 218cd0c2139SMatthew G Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 219dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dmNew, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 2202203a8e9SMatthew G. Knepley ierr = PetscMalloc3(depth+1,&depthEnd,depth+1,&depthMax,PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),&newpoints);CHKERRQ(ierr); 221a6ae58d1SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &depthMax[depth], depth > 0 ? &depthMax[depth-1] : NULL, &depthMax[1], &depthMax[0]);CHKERRQ(ierr); 222cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 223cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 224a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 225cd0c2139SMatthew G Knepley } 226cd0c2139SMatthew G Knepley /* Step 5: Set cones and supports */ 227cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 228cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 229cd0c2139SMatthew G Knepley const PetscInt *points = NULL, *orientations = NULL; 230a6ae58d1SMatthew G. Knepley PetscInt size,sizeNew, i, newp = DMPlexShiftPoint_Internal(p, depth, depthMax, depthEnd, depthShift); 231cd0c2139SMatthew G Knepley 232cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 233cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr); 234cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr); 235cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 236a6ae58d1SMatthew G. Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthMax, depthEnd, depthShift); 237cd0c2139SMatthew G Knepley } 238cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr); 239cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr); 240cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 241dcbb62e8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmNew, newp, &sizeNew);CHKERRQ(ierr); 242cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr); 243cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 244a6ae58d1SMatthew G. Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthMax, depthEnd, depthShift); 245cd0c2139SMatthew G Knepley } 246dcbb62e8SMatthew G. Knepley for (i = size; i < sizeNew; ++i) newpoints[i] = 0; 247cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr); 248cd0c2139SMatthew G Knepley } 249a6ae58d1SMatthew G. Knepley ierr = PetscFree3(depthEnd,depthMax,newpoints);CHKERRQ(ierr); 250cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 251cd0c2139SMatthew G Knepley } 252cd0c2139SMatthew G Knepley 253cd0c2139SMatthew G Knepley #undef __FUNCT__ 254cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftCoordinates_Internal" 255cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew) 256cd0c2139SMatthew G Knepley { 257cd0c2139SMatthew G Knepley PetscSection coordSection, newCoordSection; 258cd0c2139SMatthew G Knepley Vec coordinates, newCoordinates; 259cd0c2139SMatthew G Knepley PetscScalar *coords, *newCoords; 260cd0c2139SMatthew G Knepley PetscInt *depthEnd, coordSize; 261cd0c2139SMatthew G Knepley PetscInt dim, depth = 0, d, vStart, vEnd, vStartNew, vEndNew, v; 262cd0c2139SMatthew G Knepley PetscErrorCode ierr; 263cd0c2139SMatthew G Knepley 264cd0c2139SMatthew G Knepley PetscFunctionBegin; 265cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 266cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 267785e854fSJed Brown ierr = PetscMalloc1((depth+1), &depthEnd);CHKERRQ(ierr); 268cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 269cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 270cd0c2139SMatthew G Knepley } 271cd0c2139SMatthew G Knepley /* Step 8: Convert coordinates */ 272cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 273cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr); 27469d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 275cd0c2139SMatthew G Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr); 276cd0c2139SMatthew G Knepley ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr); 277cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr); 278cd0c2139SMatthew G Knepley ierr = PetscSectionSetChart(newCoordSection, vStartNew, vEndNew);CHKERRQ(ierr); 279cd0c2139SMatthew G Knepley for (v = vStartNew; v < vEndNew; ++v) { 280cd0c2139SMatthew G Knepley ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr); 281cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr); 282cd0c2139SMatthew G Knepley } 283cd0c2139SMatthew G Knepley ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr); 28469d8a9ceSMatthew G. Knepley ierr = DMSetCoordinateSection(dmNew, newCoordSection);CHKERRQ(ierr); 285cd0c2139SMatthew G Knepley ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr); 286cd0c2139SMatthew G Knepley ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr); 287cd0c2139SMatthew G Knepley ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr); 288cd0c2139SMatthew G Knepley ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2892eb5907fSJed Brown ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr); 290cd0c2139SMatthew G Knepley ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr); 291cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 292cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 293cd0c2139SMatthew G Knepley ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr); 294cd0c2139SMatthew G Knepley for (v = vStart; v < vEnd; ++v) { 295cd0c2139SMatthew G Knepley PetscInt dof, off, noff, d; 296cd0c2139SMatthew G Knepley 297cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 298cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 299a6ae58d1SMatthew G. Knepley ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthEnd, depthEnd, depthShift), &noff);CHKERRQ(ierr); 300cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) { 301cd0c2139SMatthew G Knepley newCoords[noff+d] = coords[off+d]; 302cd0c2139SMatthew G Knepley } 303cd0c2139SMatthew G Knepley } 304cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 305cd0c2139SMatthew G Knepley ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr); 306cd0c2139SMatthew G Knepley ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 307cd0c2139SMatthew G Knepley ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr); 308cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 309cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 310cd0c2139SMatthew G Knepley } 311cd0c2139SMatthew G Knepley 312cd0c2139SMatthew G Knepley #undef __FUNCT__ 313cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal" 314cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew) 315cd0c2139SMatthew G Knepley { 316a6ae58d1SMatthew G. Knepley PetscInt *depthMax, *depthEnd; 317cd0c2139SMatthew G Knepley PetscInt depth = 0, d; 318cd0c2139SMatthew G Knepley PetscSF sfPoint, sfPointNew; 319cd0c2139SMatthew G Knepley const PetscSFNode *remotePoints; 320cd0c2139SMatthew G Knepley PetscSFNode *gremotePoints; 321cd0c2139SMatthew G Knepley const PetscInt *localPoints; 322cd0c2139SMatthew G Knepley PetscInt *glocalPoints, *newLocation, *newRemoteLocation; 323cd0c2139SMatthew G Knepley PetscInt numRoots, numLeaves, l, pStart, pEnd, totShift = 0; 324cd0c2139SMatthew G Knepley PetscErrorCode ierr; 325cd0c2139SMatthew G Knepley 326cd0c2139SMatthew G Knepley PetscFunctionBegin; 327cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3282203a8e9SMatthew G. Knepley ierr = PetscMalloc2(depth+1,&depthMax,depth+1,&depthEnd);CHKERRQ(ierr); 329a6ae58d1SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &depthMax[depth] : NULL, depth>1 ? &depthMax[depth-1] : NULL, depth>2 ? &depthMax[1] : NULL, depth >= 0 ? &depthMax[0] : NULL);CHKERRQ(ierr); 330cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 331cd0c2139SMatthew G Knepley totShift += depthShift[d]; 332cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 333a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 334cd0c2139SMatthew G Knepley } 335cd0c2139SMatthew G Knepley /* Step 9: Convert pointSF */ 336cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 337cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr); 338cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 339cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 340cd0c2139SMatthew G Knepley if (numRoots >= 0) { 341dcca6d9dSJed Brown ierr = PetscMalloc2(numRoots,&newLocation,pEnd-pStart,&newRemoteLocation);CHKERRQ(ierr); 342a6ae58d1SMatthew G. Knepley for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthMax, depthEnd, depthShift); 343cd0c2139SMatthew G Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 344cd0c2139SMatthew G Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 345785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &glocalPoints);CHKERRQ(ierr); 346785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &gremotePoints);CHKERRQ(ierr); 347cd0c2139SMatthew G Knepley for (l = 0; l < numLeaves; ++l) { 348a6ae58d1SMatthew G. Knepley glocalPoints[l] = DMPlexShiftPoint_Internal(localPoints[l], depth, depthMax, depthEnd, depthShift); 349cd0c2139SMatthew G Knepley gremotePoints[l].rank = remotePoints[l].rank; 350cd0c2139SMatthew G Knepley gremotePoints[l].index = newRemoteLocation[localPoints[l]]; 351cd0c2139SMatthew G Knepley } 352cd0c2139SMatthew G Knepley ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr); 353cd0c2139SMatthew G Knepley ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 354cd0c2139SMatthew G Knepley } 355a6ae58d1SMatthew G. Knepley ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr); 356cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 357cd0c2139SMatthew G Knepley } 358cd0c2139SMatthew G Knepley 359cd0c2139SMatthew G Knepley #undef __FUNCT__ 360cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal" 361cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew) 362cd0c2139SMatthew G Knepley { 363cd0c2139SMatthew G Knepley PetscSF sfPoint; 364cd0c2139SMatthew G Knepley DMLabel vtkLabel, ghostLabel; 365a6ae58d1SMatthew G. Knepley PetscInt *depthMax, *depthEnd; 366cd0c2139SMatthew G Knepley const PetscSFNode *leafRemote; 367cd0c2139SMatthew G Knepley const PetscInt *leafLocal; 368cd0c2139SMatthew G Knepley PetscInt depth = 0, d, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f; 369cd0c2139SMatthew G Knepley PetscMPIInt rank; 370cd0c2139SMatthew G Knepley PetscErrorCode ierr; 371cd0c2139SMatthew G Knepley 372cd0c2139SMatthew G Knepley PetscFunctionBegin; 373cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3742203a8e9SMatthew G. Knepley ierr = PetscMalloc2(depth+1,&depthMax,depth+1,&depthEnd);CHKERRQ(ierr); 375a6ae58d1SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &depthMax[depth] : NULL, depth>1 ? &depthMax[depth-1] : NULL, depth>2 ? &depthMax[1] : NULL, depth >= 0 ? &depthMax[0] : NULL);CHKERRQ(ierr); 376cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 377cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 378a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 379cd0c2139SMatthew G Knepley } 380cd0c2139SMatthew G Knepley /* Step 10: Convert labels */ 381cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 382cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 383cd0c2139SMatthew G Knepley DMLabel label, newlabel; 384cd0c2139SMatthew G Knepley const char *lname; 385cd0c2139SMatthew G Knepley PetscBool isDepth; 386cd0c2139SMatthew G Knepley IS valueIS; 387cd0c2139SMatthew G Knepley const PetscInt *values; 388cd0c2139SMatthew G Knepley PetscInt numValues, val; 389cd0c2139SMatthew G Knepley 390cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr); 391cd0c2139SMatthew G Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 392cd0c2139SMatthew G Knepley if (isDepth) continue; 393cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, lname);CHKERRQ(ierr); 394cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr); 395cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr); 396cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 397cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 398cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 399cd0c2139SMatthew G Knepley for (val = 0; val < numValues; ++val) { 400cd0c2139SMatthew G Knepley IS pointIS; 401cd0c2139SMatthew G Knepley const PetscInt *points; 402cd0c2139SMatthew G Knepley PetscInt numPoints, p; 403cd0c2139SMatthew G Knepley 404cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 405cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 406cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 407cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 408a6ae58d1SMatthew G. Knepley const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthMax, depthEnd, depthShift); 409cd0c2139SMatthew G Knepley 410cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr); 411cd0c2139SMatthew G Knepley } 412cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 413cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 414cd0c2139SMatthew G Knepley } 415cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 416cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 417cd0c2139SMatthew G Knepley } 418a6ae58d1SMatthew G. Knepley ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr); 419cd0c2139SMatthew G Knepley /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */ 420cd0c2139SMatthew G Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 421cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 422cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 423cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr); 424cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "vtk");CHKERRQ(ierr); 425cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "ghost");CHKERRQ(ierr); 426cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr); 427cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr); 428cd0c2139SMatthew G Knepley for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { 429cd0c2139SMatthew G Knepley for (; c < leafLocal[l] && c < cEnd; ++c) { 430cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 431cd0c2139SMatthew G Knepley } 432cd0c2139SMatthew G Knepley if (leafLocal[l] >= cEnd) break; 433cd0c2139SMatthew G Knepley if (leafRemote[l].rank == rank) { 434cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 435cd0c2139SMatthew G Knepley } else { 436cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr); 437cd0c2139SMatthew G Knepley } 438cd0c2139SMatthew G Knepley } 439cd0c2139SMatthew G Knepley for (; c < cEnd; ++c) { 440cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 441cd0c2139SMatthew G Knepley } 442cd0c2139SMatthew G Knepley if (0) { 443cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 444cd0c2139SMatthew G Knepley ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 445cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 446cd0c2139SMatthew G Knepley } 447cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr); 448cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 449cd0c2139SMatthew G Knepley PetscInt numCells; 450cd0c2139SMatthew G Knepley 451cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr); 452cd0c2139SMatthew G Knepley if (numCells < 2) { 453cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr); 454cd0c2139SMatthew G Knepley } else { 455cd0c2139SMatthew G Knepley const PetscInt *cells = NULL; 456cd0c2139SMatthew G Knepley PetscInt vA, vB; 457cd0c2139SMatthew G Knepley 458cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr); 459cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr); 460cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr); 461cd0c2139SMatthew G Knepley if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);} 462cd0c2139SMatthew G Knepley } 463cd0c2139SMatthew G Knepley } 464cd0c2139SMatthew G Knepley if (0) { 465cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 466cd0c2139SMatthew G Knepley ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 467cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 468cd0c2139SMatthew G Knepley } 469cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 470cd0c2139SMatthew G Knepley } 471cd0c2139SMatthew G Knepley 472cd0c2139SMatthew G Knepley #undef __FUNCT__ 473cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal" 474cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm) 475cd0c2139SMatthew G Knepley { 476cd0c2139SMatthew G Knepley IS valueIS; 477cd0c2139SMatthew G Knepley const PetscInt *values; 478cd0c2139SMatthew G Knepley PetscInt *depthShift; 47946c796b9SMatthew G. Knepley PetscInt depth = 0, numFS, fs, fStart, fEnd, ghostCell, cEnd, c; 480cd0c2139SMatthew G Knepley PetscErrorCode ierr; 481cd0c2139SMatthew G Knepley 482cd0c2139SMatthew G Knepley PetscFunctionBegin; 48346c796b9SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 484cd0c2139SMatthew G Knepley /* Count ghost cells */ 485cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 486cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr); 487cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 488cd0c2139SMatthew G Knepley *numGhostCells = 0; 489cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 49046c796b9SMatthew G. Knepley IS faceIS; 49146c796b9SMatthew G. Knepley const PetscInt *faces; 49246c796b9SMatthew G. Knepley PetscInt numFaces, f, numBdFaces = 0; 493cd0c2139SMatthew G Knepley 49446c796b9SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 49546c796b9SMatthew G. Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 49646c796b9SMatthew G. Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 49746c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 49846c796b9SMatthew G. Knepley if ((faces[f] >= fStart) && (faces[f] < fEnd)) ++numBdFaces; 49946c796b9SMatthew G. Knepley } 500cd0c2139SMatthew G Knepley *numGhostCells += numBdFaces; 50146c796b9SMatthew G. Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 502cd0c2139SMatthew G Knepley } 503cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 504785e854fSJed Brown ierr = PetscMalloc1((depth+1), &depthShift);CHKERRQ(ierr); 505cd0c2139SMatthew G Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 506cd0c2139SMatthew G Knepley if (depth >= 0) depthShift[depth] = *numGhostCells; 507cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 508cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 509cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 510cd0c2139SMatthew G Knepley for (c = cEnd; c < cEnd + *numGhostCells; ++c) { 511cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr); 512cd0c2139SMatthew G Knepley } 513cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 514cd0c2139SMatthew G Knepley IS faceIS; 515cd0c2139SMatthew G Knepley const PetscInt *faces; 516cd0c2139SMatthew G Knepley PetscInt numFaces, f; 517cd0c2139SMatthew G Knepley 518cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 519cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 520cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 521cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 522cd0c2139SMatthew G Knepley PetscInt size; 523cd0c2139SMatthew G Knepley 52446c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 525cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr); 526cd0c2139SMatthew 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); 527cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(gdm, faces[f] + *numGhostCells, 2);CHKERRQ(ierr); 528cd0c2139SMatthew G Knepley } 529cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 530cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 531cd0c2139SMatthew G Knepley } 532cd0c2139SMatthew G Knepley /* Step 4: Setup ghosted DM */ 533cd0c2139SMatthew G Knepley ierr = DMSetUp(gdm);CHKERRQ(ierr); 534cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 535cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 536cd0c2139SMatthew G Knepley ghostCell = cEnd; 537cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 538cd0c2139SMatthew G Knepley IS faceIS; 539cd0c2139SMatthew G Knepley const PetscInt *faces; 540cd0c2139SMatthew G Knepley PetscInt numFaces, f; 541cd0c2139SMatthew G Knepley 542cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 543cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 544cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 54546c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 546cd0c2139SMatthew G Knepley PetscInt newFace = faces[f] + *numGhostCells; 547cd0c2139SMatthew G Knepley 54846c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 549cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr); 550cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr); 55146c796b9SMatthew G. Knepley ++ghostCell; 552cd0c2139SMatthew G Knepley } 553cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 554cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 555cd0c2139SMatthew G Knepley } 556cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 557cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 558cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 559cd0c2139SMatthew G Knepley ierr = DMPlexStratify(gdm);CHKERRQ(ierr); 560cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 561cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 562cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 563cd0c2139SMatthew G Knepley ierr = PetscFree(depthShift);CHKERRQ(ierr); 564cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 565cd0c2139SMatthew G Knepley } 566cd0c2139SMatthew G Knepley 567cd0c2139SMatthew G Knepley #undef __FUNCT__ 568cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells" 569cd0c2139SMatthew G Knepley /*@C 570cd0c2139SMatthew G Knepley DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face 571cd0c2139SMatthew G Knepley 572cd0c2139SMatthew G Knepley Collective on dm 573cd0c2139SMatthew G Knepley 574cd0c2139SMatthew G Knepley Input Parameters: 575cd0c2139SMatthew G Knepley + dm - The original DM 576cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL 577cd0c2139SMatthew G Knepley 578cd0c2139SMatthew G Knepley Output Parameters: 579cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM 580cd0c2139SMatthew G Knepley - dmGhosted - The new DM 581cd0c2139SMatthew G Knepley 582cd0c2139SMatthew G Knepley Note: If no label exists of that name, one will be created marking all boundary faces 583cd0c2139SMatthew G Knepley 584cd0c2139SMatthew G Knepley Level: developer 585cd0c2139SMatthew G Knepley 586cd0c2139SMatthew G Knepley .seealso: DMCreate() 58731266bc0SMatthew G. Knepley @*/ 588cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted) 589cd0c2139SMatthew G Knepley { 590cd0c2139SMatthew G Knepley DM gdm; 591cd0c2139SMatthew G Knepley DMLabel label; 592cd0c2139SMatthew G Knepley const char *name = labelName ? labelName : "Face Sets"; 593cd0c2139SMatthew G Knepley PetscInt dim; 594a42b08eeSMatthew G. Knepley PetscBool flag; 595cd0c2139SMatthew G Knepley PetscErrorCode ierr; 596cd0c2139SMatthew G Knepley 597cd0c2139SMatthew G Knepley PetscFunctionBegin; 598cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 599cd0c2139SMatthew G Knepley PetscValidPointer(numGhostCells, 3); 600cd0c2139SMatthew G Knepley PetscValidPointer(dmGhosted, 4); 601cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr); 602cd0c2139SMatthew G Knepley ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr); 603cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 604cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(gdm, dim);CHKERRQ(ierr); 605a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseCone(dm, &flag);CHKERRQ(ierr); 606a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseCone(gdm, flag);CHKERRQ(ierr); 607a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseClosure(dm, &flag);CHKERRQ(ierr); 608a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseClosure(gdm, flag);CHKERRQ(ierr); 609cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 610cd0c2139SMatthew G Knepley if (!label) { 611cd0c2139SMatthew G Knepley /* Get label for boundary faces */ 612cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr); 613cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 614cd0c2139SMatthew G Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 615cd0c2139SMatthew G Knepley } 616cd0c2139SMatthew G Knepley ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr); 617cd0c2139SMatthew G Knepley *dmGhosted = gdm; 618cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 619cd0c2139SMatthew G Knepley } 620cd0c2139SMatthew G Knepley 621cd0c2139SMatthew G Knepley #undef __FUNCT__ 622cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal" 623607ab7a9SMatthew G. Knepley /* 624faedd622SMatthew G. Knepley We are adding three kinds of points here: 625607ab7a9SMatthew G. Knepley Replicated: Copies of points which exist in the mesh, such as vertices identified across a fault 626faedd622SMatthew G. Knepley Non-replicated: Points which exist on the fault, but are not replicated 627607ab7a9SMatthew G. Knepley Hybrid: Entirely new points, such as cohesive cells 628a6ae58d1SMatthew G. Knepley 629a6ae58d1SMatthew G. Knepley When creating subsequent cohesive cells, we shift the old hybrid cells to the end of the numbering at 630a6ae58d1SMatthew G. Knepley each depth so that the new split/hybrid points can be inserted as a block. 631607ab7a9SMatthew G. Knepley */ 632cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm) 633cd0c2139SMatthew G Knepley { 634cd0c2139SMatthew G Knepley MPI_Comm comm; 635607ab7a9SMatthew G. Knepley IS valueIS; 636607ab7a9SMatthew G. Knepley PetscInt numSP = 0; /* The number of depths for which we have replicated points */ 637607ab7a9SMatthew G. Knepley const PetscInt *values; /* List of depths for which we have replicated points */ 63818c5995bSMatthew G. Knepley IS *splitIS; 63918c5995bSMatthew G. Knepley IS *unsplitIS; 640607ab7a9SMatthew G. Knepley PetscInt *numSplitPoints; /* The number of replicated points at each depth */ 64118c5995bSMatthew G. Knepley PetscInt *numUnsplitPoints; /* The number of non-replicated points at each depth which still give rise to hybrid points */ 64236dbac82SMatthew G. Knepley PetscInt *numHybridPoints; /* The number of new hybrid points at each depth */ 64336dbac82SMatthew G. Knepley PetscInt *numHybridPointsOld; /* The number of existing hybrid points at each depth */ 644607ab7a9SMatthew G. Knepley const PetscInt **splitPoints; /* Replicated points for each depth */ 64518c5995bSMatthew G. Knepley const PetscInt **unsplitPoints; /* Non-replicated points for each depth */ 646cd0c2139SMatthew G Knepley PetscSection coordSection; 647cd0c2139SMatthew G Knepley Vec coordinates; 648cd0c2139SMatthew G Knepley PetscScalar *coords; 649607ab7a9SMatthew G. Knepley PetscInt depths[4]; /* Depths in the order that plex points are numbered */ 650a6ae58d1SMatthew G. Knepley PetscInt *depthMax; /* The first hybrid point at each depth in the original mesh */ 651a6ae58d1SMatthew G. Knepley PetscInt *depthEnd; /* The point limit at each depth in the original mesh */ 652607ab7a9SMatthew G. Knepley PetscInt *depthShift; /* Number of replicated+hybrid points at each depth */ 653607ab7a9SMatthew G. Knepley PetscInt *depthOffset; /* Prefix sums of depthShift */ 654607ab7a9SMatthew G. Knepley PetscInt *pMaxNew; /* The first replicated point at each depth in the new mesh, hybrids come after this */ 655607ab7a9SMatthew G. Knepley PetscInt *coneNew, *coneONew, *supportNew; 65618c5995bSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v; 657cd0c2139SMatthew G Knepley PetscErrorCode ierr; 658cd0c2139SMatthew G Knepley 659cd0c2139SMatthew G Knepley PetscFunctionBegin; 660cd0c2139SMatthew G Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 661cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 662607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 663fd4b9f15SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 664607ab7a9SMatthew G. Knepley depths[0] = depth; 665607ab7a9SMatthew G. Knepley depths[1] = 0; 666607ab7a9SMatthew G. Knepley depths[2] = depth-1; 667607ab7a9SMatthew G. Knepley depths[3] = 1; 668cd0c2139SMatthew G Knepley /* Count split points and add cohesive cells */ 669607ab7a9SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 6702203a8e9SMatthew G. Knepley ierr = PetscMalloc6(depth+1,&depthMax,depth+1,&depthEnd,depth+1,&depthShift,depth+1,&depthOffset,depth+1,&pMaxNew,depth+1,&numHybridPointsOld);CHKERRQ(ierr); 671dcca6d9dSJed Brown ierr = PetscMalloc7(depth+1,&splitIS,depth+1,&unsplitIS,depth+1,&numSplitPoints,depth+1,&numUnsplitPoints,depth+1,&numHybridPoints,depth+1,&splitPoints,depth+1,&unsplitPoints);CHKERRQ(ierr); 672607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 673607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthOffset, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 674a6ae58d1SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &depthMax[depth] : NULL, depth>1 ? &depthMax[depth-1] : NULL, depth>2 ? &depthMax[1] : NULL, depth >= 0 ? &depthMax[0] : NULL);CHKERRQ(ierr); 675607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 676607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 677a6ae58d1SMatthew G. Knepley depthEnd[d] = pMaxNew[d]; 678a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 679607ab7a9SMatthew G. Knepley numSplitPoints[d] = 0; 68018c5995bSMatthew G. Knepley numUnsplitPoints[d] = 0; 681607ab7a9SMatthew G. Knepley numHybridPoints[d] = 0; 682a6ae58d1SMatthew G. Knepley numHybridPointsOld[d] = depthMax[d] < 0 ? 0 : depthEnd[d] - depthMax[d]; 683607ab7a9SMatthew G. Knepley splitPoints[d] = NULL; 68418c5995bSMatthew G. Knepley unsplitPoints[d] = NULL; 68518c5995bSMatthew G. Knepley splitIS[d] = NULL; 68618c5995bSMatthew G. Knepley unsplitIS[d] = NULL; 687607ab7a9SMatthew G. Knepley } 688cd0c2139SMatthew G Knepley if (label) { 689cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 690cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 691cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 692cd0c2139SMatthew G Knepley } 693cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 694cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 695cd0c2139SMatthew G Knepley 696cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 69718c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr); 69818c5995bSMatthew G. Knepley if (splitIS[dep]) { 69918c5995bSMatthew G. Knepley ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 70018c5995bSMatthew G. Knepley ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 70118c5995bSMatthew G. Knepley } 70218c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr); 70318c5995bSMatthew G. Knepley if (unsplitIS[dep]) { 70418c5995bSMatthew G. Knepley ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr); 70518c5995bSMatthew G. Knepley ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr); 706cd0c2139SMatthew G Knepley } 707cd0c2139SMatthew G Knepley } 708607ab7a9SMatthew G. Knepley /* Calculate number of hybrid points */ 70918c5995bSMatthew G. Knepley for (d = 1; d <= depth; ++d) numHybridPoints[d] = numSplitPoints[d-1] + numUnsplitPoints[d-1]; /* There is a hybrid cell/face/edge for every split face/edge/vertex */ 710607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) depthShift[d] = numSplitPoints[d] + numHybridPoints[d]; 711607ab7a9SMatthew G. Knepley for (d = 1; d <= depth; ++d) depthOffset[depths[d]] = depthOffset[depths[d-1]] + depthShift[depths[d-1]]; 712a6ae58d1SMatthew G. Knepley for (d = 0; d <= depth; ++d) pMaxNew[d] += depthOffset[d] - numHybridPointsOld[d]; 713cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 714cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 715cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 716cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 717cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 718a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 7194c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 720cd0c2139SMatthew G Knepley const PetscInt *support; 7214c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, qf, qn, qp, e; 722cd0c2139SMatthew G Knepley 723cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 724cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 725cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 726cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 727cd0c2139SMatthew G Knepley if (dep == depth-1) { 7284c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 7294c367dbcSMatthew G. Knepley 730cd0c2139SMatthew G Knepley /* Add cohesive cells, they are prisms */ 7314c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr); 732cd0c2139SMatthew G Knepley } else if (dep == 0) { 7334c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 734cd0c2139SMatthew G Knepley 735cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 7364c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 737cd0c2139SMatthew G Knepley PetscInt val; 738cd0c2139SMatthew G Knepley 739cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 7404c367dbcSMatthew G. Knepley if (val == 1) ++qf; 7414c367dbcSMatthew G. Knepley if ((val == 1) || (val == (shift + 1))) ++qn; 7424c367dbcSMatthew G. Knepley if ((val == 1) || (val == -(shift + 1))) ++qp; 743cd0c2139SMatthew G Knepley } 7444c367dbcSMatthew G. Knepley /* Split old vertex: Edges into original vertex and new cohesive edge */ 7454c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 7464c367dbcSMatthew G. Knepley /* Split new vertex: Edges into split vertex and new cohesive edge */ 7474c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 7484c367dbcSMatthew G. Knepley /* Add hybrid edge */ 7494c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 7504c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 751cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 7524c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 7534c367dbcSMatthew G. Knepley 754cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 7554c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 756cd0c2139SMatthew G Knepley PetscInt val; 757cd0c2139SMatthew G Knepley 758cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 7594c367dbcSMatthew G. Knepley if (val == dim-1) ++qf; 7604c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 7614c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 762cd0c2139SMatthew G Knepley } 7634c367dbcSMatthew G. Knepley /* Split old edge: Faces into original edge and cohesive face (positive side?) */ 7644c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 7654c367dbcSMatthew G. Knepley /* Split new edge: Faces into split edge and cohesive face (negative side?) */ 7664c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 7674c367dbcSMatthew G. Knepley /* Add hybrid face */ 7684c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 7694c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 770cd0c2139SMatthew G Knepley } 771cd0c2139SMatthew G Knepley } 772cd0c2139SMatthew G Knepley } 77318c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 77418c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 77518c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 776a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 77718c5995bSMatthew G. Knepley const PetscInt *support; 778da1dd7e4SMatthew G. Knepley PetscInt coneSize, supportSize, qf, e, s; 77918c5995bSMatthew G. Knepley 78018c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 78118c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 78239254ff6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 78318c5995bSMatthew G. Knepley if (dep == 0) { 78418c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 78518c5995bSMatthew G. Knepley 78639254ff6SMatthew G. Knepley /* Unsplit vertex: Edges into original vertex, split edges, and new cohesive edge twice */ 78739254ff6SMatthew G. Knepley for (s = 0, qf = 0; s < supportSize; ++s, ++qf) { 78839254ff6SMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 78939254ff6SMatthew G. Knepley if (e >= 0) ++qf; 79039254ff6SMatthew G. Knepley } 79139254ff6SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 79218c5995bSMatthew G. Knepley /* Add hybrid edge */ 79318c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 794e1757548SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 795e1757548SMatthew G. Knepley PetscInt val; 796e1757548SMatthew G. Knepley 797e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 798e1757548SMatthew G. Knepley /* Split and unsplit edges produce hybrid faces */ 799da1dd7e4SMatthew G. Knepley if (val == 1) ++qf; 800da1dd7e4SMatthew G. Knepley if (val == (shift2 + 1)) ++qf; 801e1757548SMatthew G. Knepley } 802e1757548SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 80318c5995bSMatthew G. Knepley } else if (dep == dim-2) { 80418c5995bSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 805cd0c2139SMatthew G Knepley PetscInt val; 806cd0c2139SMatthew G Knepley 807da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 808cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 809da1dd7e4SMatthew G. Knepley if (val == dim-1) qf += 2; 810da1dd7e4SMatthew G. Knepley else ++qf; 811cd0c2139SMatthew G Knepley } 81218c5995bSMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */ 813da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 81418c5995bSMatthew G. Knepley /* Add hybrid face */ 815da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 816da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 817da1dd7e4SMatthew G. Knepley if (val == dim-1) ++qf; 818da1dd7e4SMatthew G. Knepley } 81918c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 820da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 821cd0c2139SMatthew G Knepley } 822cd0c2139SMatthew G Knepley } 823cd0c2139SMatthew G Knepley } 824cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 825cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 826cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 827dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 828dcca6d9dSJed Brown ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),&supportNew);CHKERRQ(ierr); 829cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 830cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 831cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 832cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 833a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 8344c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 835cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 8364c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, q, qf, qn, qp, v, e, s; 837cd0c2139SMatthew G Knepley 838cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 839cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 840cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 841cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 842cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 843cd0c2139SMatthew G Knepley if (dep == depth-1) { 84496a07cd0SMatthew G. Knepley PetscBool hasUnsplit = PETSC_FALSE; 8454c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 846cd0c2139SMatthew G Knepley const PetscInt *supportF; 847cd0c2139SMatthew G Knepley 848cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 849cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 850cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 851cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 852cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 853cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 8544c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 85518c5995bSMatthew G. Knepley if (v < 0) { 85618c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 85718c5995bSMatthew G. Knepley if (v < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate point %d in split or unsplit points of depth %d", cone[q], dep-1); 858a6ae58d1SMatthew G. Knepley coneNew[2+q] = DMPlexShiftPoint_Internal(cone[q], depth, depthMax, depthEnd, depthShift) /*cone[q] + depthOffset[dep-1]*/; 85996a07cd0SMatthew G. Knepley hasUnsplit = PETSC_TRUE; 86018c5995bSMatthew G. Knepley } else { 8614c367dbcSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep-1]; 862163235baSMatthew G. Knepley if (dep > 1) { 863163235baSMatthew G. Knepley const PetscInt *econe; 864163235baSMatthew G. Knepley PetscInt econeSize, r, vs, vu; 865163235baSMatthew G. Knepley 866163235baSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[q], &econeSize);CHKERRQ(ierr); 867163235baSMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[q], &econe);CHKERRQ(ierr); 868163235baSMatthew G. Knepley for (r = 0; r < econeSize; ++r) { 869163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numSplitPoints[dep-2], splitPoints[dep-2], &vs);CHKERRQ(ierr); 870163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numUnsplitPoints[dep-2], unsplitPoints[dep-2], &vu);CHKERRQ(ierr); 871163235baSMatthew G. Knepley if (vs >= 0) continue; 872163235baSMatthew G. Knepley if (vu < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate point %d in split or unsplit points of depth %d", econe[r], dep-2); 873163235baSMatthew G. Knepley hasUnsplit = PETSC_TRUE; 874163235baSMatthew G. Knepley } 875163235baSMatthew G. Knepley } 876cd0c2139SMatthew G Knepley } 877cd0c2139SMatthew G Knepley } 878cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 879cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 880e537020bSMatthew G. Knepley /* Face support */ 881cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 882cd0c2139SMatthew G Knepley PetscInt val; 883cd0c2139SMatthew G Knepley 884cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 885cd0c2139SMatthew G Knepley if (val < 0) { 886cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 8874c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr); 888cd0c2139SMatthew G Knepley } else { 889cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 8904c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr); 891e537020bSMatthew G. Knepley /* Get orientation for cohesive face */ 892e537020bSMatthew G. Knepley { 893e537020bSMatthew G. Knepley const PetscInt *ncone, *nconeO; 894e537020bSMatthew G. Knepley PetscInt nconeSize, nc; 895e537020bSMatthew G. Knepley 896e537020bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 897e537020bSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 898e537020bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 899e537020bSMatthew G. Knepley for (nc = 0; nc < nconeSize; ++nc) { 900e537020bSMatthew G. Knepley if (ncone[nc] == oldp) { 901e537020bSMatthew G. Knepley coneONew[0] = nconeO[nc]; 902e537020bSMatthew G. Knepley break; 903cd0c2139SMatthew G Knepley } 904cd0c2139SMatthew G Knepley } 905e537020bSMatthew 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]); 906e537020bSMatthew G. Knepley } 907e537020bSMatthew G. Knepley } 908e537020bSMatthew G. Knepley } 9094c367dbcSMatthew G. Knepley /* Cohesive cell: Old and new split face, then new cohesive faces */ 910fd4b9f15SMatthew G. Knepley coneNew[0] = newp; /* Extracted negative side orientation above */ 9114c367dbcSMatthew G. Knepley coneNew[1] = splitp; 9124c367dbcSMatthew G. Knepley coneONew[1] = coneONew[0]; 913e537020bSMatthew G. Knepley for (q = 0; q < coneSize; ++q) { 91418c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 91518c5995bSMatthew G. Knepley if (v < 0) { 91618c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 91718c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 91818c5995bSMatthew G. Knepley coneONew[2+q] = 0; 91918c5995bSMatthew G. Knepley } else { 92018c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep]; 92118c5995bSMatthew G. Knepley } 922e537020bSMatthew G. Knepley coneONew[2+q] = 0; 923e537020bSMatthew G. Knepley } 9244c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr); 9254c367dbcSMatthew G. Knepley ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr); 92696a07cd0SMatthew G. Knepley /* Label the hybrid cells on the boundary of the split */ 92796a07cd0SMatthew G. Knepley if (hasUnsplit) {ierr = DMLabelSetValue(label, -hybcell, dim);CHKERRQ(ierr);} 928cd0c2139SMatthew G Knepley } else if (dep == 0) { 9294c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 930cd0c2139SMatthew G Knepley 931cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 9324c367dbcSMatthew G. Knepley for (e = 0, qn = 0; e < supportSize; ++e) { 933cd0c2139SMatthew G Knepley PetscInt val; 934cd0c2139SMatthew G Knepley 935cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 936cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 937a6ae58d1SMatthew G. Knepley supportNew[qn++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 938cd0c2139SMatthew G Knepley } 939cd0c2139SMatthew G Knepley } 9404c367dbcSMatthew G. Knepley supportNew[qn] = hybedge; 941cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 942cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 9434c367dbcSMatthew G. Knepley for (e = 0, qp = 0; e < supportSize; ++e) { 944cd0c2139SMatthew G Knepley PetscInt val, edge; 945cd0c2139SMatthew G Knepley 946cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 947cd0c2139SMatthew G Knepley if (val == 1) { 9484c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 949cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 9504c367dbcSMatthew G. Knepley supportNew[qp++] = edge + pMaxNew[dep+1]; 951cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 952a6ae58d1SMatthew G. Knepley supportNew[qp++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 953cd0c2139SMatthew G Knepley } 954cd0c2139SMatthew G Knepley } 9554c367dbcSMatthew G. Knepley supportNew[qp] = hybedge; 956cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 9574c367dbcSMatthew G. Knepley /* Hybrid edge: Old and new split vertex */ 958cd0c2139SMatthew G Knepley coneNew[0] = newp; 959cd0c2139SMatthew G Knepley coneNew[1] = splitp; 9604c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 9614c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 9624c367dbcSMatthew G. Knepley PetscInt val, edge; 9634c367dbcSMatthew G. Knepley 9644c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 9654c367dbcSMatthew G. Knepley if (val == 1) { 9664c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 9674c367dbcSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 9684c367dbcSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 9694c367dbcSMatthew G. Knepley } 9704c367dbcSMatthew G. Knepley } 9714c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 972cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 9734c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 9744c367dbcSMatthew G. Knepley 975cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 976cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 977cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 9784c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 979e1757548SMatthew G. Knepley if (v < 0) { 980e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 981e1757548SMatthew G. Knepley if (v < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate point %d in split or unsplit points of depth %d", cone[q], dep-1); 982a6ae58d1SMatthew G. Knepley coneNew[q] = DMPlexShiftPoint_Internal(cone[q], depth, depthMax, depthEnd, depthShift) /*cone[q] + depthOffset[dep-1]*/; 983e1757548SMatthew G. Knepley } else { 9844c367dbcSMatthew G. Knepley coneNew[q] = v + pMaxNew[dep-1]; 985cd0c2139SMatthew G Knepley } 986e1757548SMatthew G. Knepley } 987cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 988cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 989cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 990cd0c2139SMatthew G Knepley PetscInt val; 991cd0c2139SMatthew G Knepley 992cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 9934c367dbcSMatthew G. Knepley if (val == dim-1) { 994a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 9954c367dbcSMatthew G. Knepley } else if (val == (shift + dim-1)) { 996a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 997cd0c2139SMatthew G Knepley } 998cd0c2139SMatthew G Knepley } 999b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1000cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1001cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 1002cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 1003cd0c2139SMatthew G Knepley PetscInt val, face; 1004cd0c2139SMatthew G Knepley 1005cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1006cd0c2139SMatthew G Knepley if (val == dim-1) { 10074c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1008cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 10094c367dbcSMatthew G. Knepley supportNew[q++] = face + pMaxNew[dep+1]; 1010cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 1011a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 1012cd0c2139SMatthew G Knepley } 1013cd0c2139SMatthew G Knepley } 1014b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1015cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 10164c367dbcSMatthew G. Knepley /* Hybrid face */ 10174c367dbcSMatthew G. Knepley coneNew[0] = newp; 10184c367dbcSMatthew G. Knepley coneNew[1] = splitp; 10194c367dbcSMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 10204c367dbcSMatthew G. Knepley PetscInt vertex; 10214c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr); 1022e1757548SMatthew G. Knepley if (vertex < 0) { 1023e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr); 1024e1757548SMatthew G. Knepley if (vertex < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate point %d in split or unsplit points of depth %d", cone[v], dep-1); 1025e1757548SMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1026e1757548SMatthew G. Knepley } else { 10274c367dbcSMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep]; 10284c367dbcSMatthew G. Knepley } 1029e1757548SMatthew G. Knepley } 10304c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 10314c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 10324c367dbcSMatthew G. Knepley PetscInt val, face; 10334c367dbcSMatthew G. Knepley 10344c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 10354c367dbcSMatthew G. Knepley if (val == dim-1) { 10364c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 10374c367dbcSMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 10384c367dbcSMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 10394c367dbcSMatthew G. Knepley } 10404c367dbcSMatthew G. Knepley } 10414c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1042cd0c2139SMatthew G Knepley } 1043cd0c2139SMatthew G Knepley } 1044cd0c2139SMatthew G Knepley } 104518c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 104618c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 104718c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 1048a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 104918c5995bSMatthew G. Knepley const PetscInt *cone, *support, *ornt; 1050e1757548SMatthew G. Knepley PetscInt coneSize, supportSize, supportSizeNew, q, qf, e, f, s; 105118c5995bSMatthew G. Knepley 105218c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 105318c5995bSMatthew G. Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 105418c5995bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 105518c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 105618c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 105718c5995bSMatthew G. Knepley if (dep == 0) { 105818c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 105918c5995bSMatthew G. Knepley 106018c5995bSMatthew G. Knepley /* Unsplit vertex */ 106118c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 106218c5995bSMatthew G. Knepley for (s = 0, q = 0; s < supportSize; ++s) { 1063a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[s], depth, depthMax, depthEnd, depthShift) /*support[s] + depthOffset[dep+1]*/; 106418c5995bSMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 106518c5995bSMatthew G. Knepley if (e >= 0) { 106618c5995bSMatthew G. Knepley supportNew[q++] = e + pMaxNew[dep+1]; 106718c5995bSMatthew G. Knepley } 106818c5995bSMatthew G. Knepley } 106918c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 107018c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 107118c5995bSMatthew G. Knepley if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp); 107218c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 107318c5995bSMatthew G. Knepley /* Hybrid edge */ 107418c5995bSMatthew G. Knepley coneNew[0] = newp; 107518c5995bSMatthew G. Knepley coneNew[1] = newp; 107618c5995bSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 107718c5995bSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 107818c5995bSMatthew G. Knepley PetscInt val, edge; 107918c5995bSMatthew G. Knepley 108018c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 108118c5995bSMatthew G. Knepley if (val == 1) { 108218c5995bSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 108318c5995bSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 108418c5995bSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1085e1757548SMatthew G. Knepley } else if (val == (shift2 + 1)) { 1086e1757548SMatthew G. Knepley ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr); 1087e1757548SMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]); 1088e1757548SMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1]; 108918c5995bSMatthew G. Knepley } 109018c5995bSMatthew G. Knepley } 109118c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1092e1757548SMatthew G. Knepley } else if (dep == dim-2) { 1093e1757548SMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 1094e1757548SMatthew G. Knepley 1095da1dd7e4SMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and hybrid face twice */ 1096e1757548SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1097e1757548SMatthew G. Knepley PetscInt val, face; 1098e1757548SMatthew G. Knepley 1099e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1100e1757548SMatthew G. Knepley if (val == dim-1) { 1101e1757548SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1102e1757548SMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]); 1103a6ae58d1SMatthew G. Knepley supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthMax, depthEnd, depthShift) /*support[f] + depthOffset[dep+1]*/; 1104e1757548SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+1]; 1105e1757548SMatthew G. Knepley } else { 1106a6ae58d1SMatthew G. Knepley supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthMax, depthEnd, depthShift) /*support[f] + depthOffset[dep+1]*/; 1107e1757548SMatthew G. Knepley } 1108e1757548SMatthew G. Knepley } 1109e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1110e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1111da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 1112da1dd7e4SMatthew G. Knepley if (qf != supportSizeNew) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Support size for unsplit edge %d is %d != %d\n", newp, qf, supportSizeNew); 1113e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1114e1757548SMatthew G. Knepley /* Add hybrid face */ 1115e1757548SMatthew G. Knepley coneNew[0] = newp; 1116212cc919SMatthew G. Knepley coneNew[1] = newp; 1117e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[0], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1118e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[0]); 1119212cc919SMatthew G. Knepley coneNew[2] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1120e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1121e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]); 1122e1757548SMatthew G. Knepley coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1123e1757548SMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 1124da1dd7e4SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1125da1dd7e4SMatthew G. Knepley PetscInt val, face; 1126da1dd7e4SMatthew G. Knepley 1127da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1128da1dd7e4SMatthew G. Knepley if (val == dim-1) { 1129da1dd7e4SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1130da1dd7e4SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1131da1dd7e4SMatthew G. Knepley } 1132da1dd7e4SMatthew G. Knepley } 1133da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, hybface, &supportSizeNew);CHKERRQ(ierr); 1134da1dd7e4SMatthew G. Knepley if (qf != supportSizeNew) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Support size for hybrid face %d is %d != %d\n", hybface, qf, supportSizeNew); 1135e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1136cd0c2139SMatthew G Knepley } 1137cd0c2139SMatthew G Knepley } 1138cd0c2139SMatthew G Knepley } 1139cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 1140cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1141cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 1142cd0c2139SMatthew G Knepley IS pIS; 1143cd0c2139SMatthew G Knepley PetscInt numPoints; 1144cd0c2139SMatthew G Knepley const PetscInt *points; 1145cd0c2139SMatthew G Knepley 1146cd0c2139SMatthew G Knepley if (dep >= 0) continue; 1147cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 1148cd0c2139SMatthew G Knepley if (!pIS) continue; 1149cd0c2139SMatthew G Knepley dep = -dep - shift; 1150cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 1151cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 1152cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1153cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 1154a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*depthOffset[dep] + oldp*/; 1155cd0c2139SMatthew G Knepley const PetscInt *cone; 1156cd0c2139SMatthew G Knepley PetscInt coneSize, c; 115750cf782dSMatthew G. Knepley /* PetscBool replaced = PETSC_FALSE; */ 1158cd0c2139SMatthew G Knepley 1159cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 1160cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 1161cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 1162cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 1163cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1164cd0c2139SMatthew G Knepley const PetscInt coldp = cone[c] - depthOffset[dep-1]; 1165cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 1166cd0c2139SMatthew G Knepley 1167cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 1168cd0c2139SMatthew G Knepley if (val == dep-1) { 1169cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 1170cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 1171cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 1172cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 117350cf782dSMatthew G. Knepley /* replaced = PETSC_TRUE; */ 1174cd0c2139SMatthew G Knepley } 1175cd0c2139SMatthew G Knepley } 11764a189a86SMatthew G. Knepley /* Cells with only a vertex or edge on the submesh have no replacement */ 11774a189a86SMatthew G. Knepley /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 1178cd0c2139SMatthew G Knepley } 1179cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 1180cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 1181cd0c2139SMatthew G Knepley } 1182cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 1183cd0c2139SMatthew G Knepley ierr = DMPlexStratify(sdm);CHKERRQ(ierr); 1184cd0c2139SMatthew G Knepley /* Step 8: Coordinates */ 1185cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 118669d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 1187cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 1188cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 1189cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 1190a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[0][v], depth, depthMax, depthEnd, depthShift) /*depthOffset[0] + splitPoints[0][v]*/; 1191cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 1192cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 1193cd0c2139SMatthew G Knepley 1194cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 1195cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 1196cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 1197cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 1198cd0c2139SMatthew G Knepley } 1199cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 1200cd0c2139SMatthew G Knepley /* Step 9: SF, if I can figure this out we can split the mesh in parallel */ 1201cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1202cd0c2139SMatthew G Knepley /* Step 10: Labels */ 1203cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1204cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 1205cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1206cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 1207a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[dep][p], depth, depthMax, depthEnd, depthShift) /*depthOffset[dep] + splitPoints[dep][p]*/; 1208cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 1209cd0c2139SMatthew G Knepley PetscInt l; 1210cd0c2139SMatthew G Knepley 1211cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 1212cd0c2139SMatthew G Knepley DMLabel mlabel; 1213cd0c2139SMatthew G Knepley const char *lname; 1214cd0c2139SMatthew G Knepley PetscInt val; 12159a356370SMatthew G. Knepley PetscBool isDepth; 1216cd0c2139SMatthew G Knepley 1217cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 12189a356370SMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 12199a356370SMatthew G. Knepley if (isDepth) continue; 1220cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 1221cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 1222cd0c2139SMatthew G Knepley if (val >= 0) { 1223cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 12249a356370SMatthew G. Knepley #if 0 12259a356370SMatthew G. Knepley /* Do not put cohesive edges into the label */ 1226cd0c2139SMatthew G Knepley if (dep == 0) { 12274c367dbcSMatthew G. Knepley const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1228cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr); 12294c367dbcSMatthew G. Knepley } else if (dep == dim-2) { 12304c367dbcSMatthew G. Knepley const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 12314c367dbcSMatthew G. Knepley ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr); 1232cd0c2139SMatthew G Knepley } 12334c367dbcSMatthew G. Knepley /* Do not put cohesive faces into the label */ 12349a356370SMatthew G. Knepley #endif 1235cd0c2139SMatthew G Knepley } 1236cd0c2139SMatthew G Knepley } 1237cd0c2139SMatthew G Knepley } 1238cd0c2139SMatthew G Knepley } 1239cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1240cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 1241cd0c2139SMatthew G Knepley 1242cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 124318c5995bSMatthew G. Knepley if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 124418c5995bSMatthew G. Knepley ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr); 124518c5995bSMatthew G. Knepley if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);} 124618c5995bSMatthew G. Knepley ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr); 1247cd0c2139SMatthew G Knepley } 1248cd0c2139SMatthew G Knepley if (label) { 1249cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1250cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1251cd0c2139SMatthew G Knepley } 12520d4d4d06SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 12530d4d4d06SMatthew G. Knepley ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr); 125436dbac82SMatthew G. Knepley pMaxNew[d] = pEnd - numHybridPoints[d] - numHybridPointsOld[d]; 12550d4d4d06SMatthew G. Knepley } 12560e49e2e2SMatthew 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); 1257dcbb62e8SMatthew G. Knepley ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr); 1258a6ae58d1SMatthew G. Knepley ierr = PetscFree6(depthMax, depthEnd, depthShift, depthOffset, pMaxNew, numHybridPointsOld);CHKERRQ(ierr); 125918c5995bSMatthew G. Knepley ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr); 1260cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1261cd0c2139SMatthew G Knepley } 1262cd0c2139SMatthew G Knepley 1263cd0c2139SMatthew G Knepley #undef __FUNCT__ 1264cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells" 1265cd0c2139SMatthew G Knepley /*@C 1266cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 1267cd0c2139SMatthew G Knepley 1268cd0c2139SMatthew G Knepley Collective on dm 1269cd0c2139SMatthew G Knepley 1270cd0c2139SMatthew G Knepley Input Parameters: 1271cd0c2139SMatthew G Knepley + dm - The original DM 127253156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated) 1273cd0c2139SMatthew G Knepley 1274cd0c2139SMatthew G Knepley Output Parameters: 1275cd0c2139SMatthew G Knepley - dmSplit - The new DM 1276cd0c2139SMatthew G Knepley 1277cd0c2139SMatthew G Knepley Level: developer 1278cd0c2139SMatthew G Knepley 12792be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 1280cd0c2139SMatthew G Knepley @*/ 1281cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 1282cd0c2139SMatthew G Knepley { 1283cd0c2139SMatthew G Knepley DM sdm; 1284cd0c2139SMatthew G Knepley PetscInt dim; 1285cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1286cd0c2139SMatthew G Knepley 1287cd0c2139SMatthew G Knepley PetscFunctionBegin; 1288cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 128953156dfcSMatthew G. Knepley PetscValidPointer(dmSplit, 3); 1290cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 1291cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 1292cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1293cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(sdm, dim);CHKERRQ(ierr); 1294cd0c2139SMatthew G Knepley switch (dim) { 1295cd0c2139SMatthew G Knepley case 2: 1296cd0c2139SMatthew G Knepley case 3: 1297cd0c2139SMatthew G Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 1298cd0c2139SMatthew G Knepley break; 1299cd0c2139SMatthew G Knepley default: 1300cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 1301cd0c2139SMatthew G Knepley } 1302cd0c2139SMatthew G Knepley *dmSplit = sdm; 1303cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1304cd0c2139SMatthew G Knepley } 1305cd0c2139SMatthew G Knepley 1306cd0c2139SMatthew G Knepley #undef __FUNCT__ 13070f66a230SMatthew G. Knepley #define __FUNCT__ "GetSurfaceSide_Static" 13080f66a230SMatthew G. Knepley /* Returns the side of the surface for a given cell with a face on the surface */ 13090f66a230SMatthew G. Knepley static PetscErrorCode GetSurfaceSide_Static(DM dm, DM subdm, PetscInt numSubpoints, const PetscInt *subpoints, PetscInt cell, PetscInt face, PetscBool *pos) 13100f66a230SMatthew G. Knepley { 13110f66a230SMatthew G. Knepley const PetscInt *cone, *ornt; 13120f66a230SMatthew G. Knepley PetscInt dim, coneSize, c; 13130f66a230SMatthew G. Knepley PetscErrorCode ierr; 13140f66a230SMatthew G. Knepley 13150f66a230SMatthew G. Knepley PetscFunctionBegin; 13160f66a230SMatthew G. Knepley *pos = PETSC_TRUE; 13170f66a230SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 13180f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 13190f66a230SMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 13200f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, cell, &ornt);CHKERRQ(ierr); 13210f66a230SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 13220f66a230SMatthew G. Knepley if (cone[c] == face) { 13230f66a230SMatthew G. Knepley PetscInt o = ornt[c]; 13240f66a230SMatthew G. Knepley 13250f66a230SMatthew G. Knepley if (subdm) { 13260f66a230SMatthew G. Knepley const PetscInt *subcone, *subornt; 13270f66a230SMatthew G. Knepley PetscInt subpoint, subface, subconeSize, sc; 13280f66a230SMatthew G. Knepley 13290f66a230SMatthew G. Knepley ierr = PetscFindInt(cell, numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 13300f66a230SMatthew G. Knepley ierr = PetscFindInt(face, numSubpoints, subpoints, &subface);CHKERRQ(ierr); 13310f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 13320f66a230SMatthew G. Knepley ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 13330f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 13340f66a230SMatthew G. Knepley for (sc = 0; sc < subconeSize; ++sc) { 13350f66a230SMatthew G. Knepley if (subcone[sc] == subface) { 13360f66a230SMatthew G. Knepley o = subornt[0]; 13370f66a230SMatthew G. Knepley break; 13380f66a230SMatthew G. Knepley } 13390f66a230SMatthew G. Knepley } 13400f66a230SMatthew G. Knepley if (sc >= subconeSize) SETERRQ4(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find subpoint %d (%d) in cone for subpoint %d (%d)", subface, face, subpoint, cell); 13410f66a230SMatthew G. Knepley } 13420f66a230SMatthew G. Knepley if (o >= 0) *pos = PETSC_TRUE; 13430f66a230SMatthew G. Knepley else *pos = PETSC_FALSE; 13440f66a230SMatthew G. Knepley break; 13450f66a230SMatthew G. Knepley } 13460f66a230SMatthew G. Knepley } 13470f66a230SMatthew G. Knepley if (c == coneSize) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Cell %d in split face %d support does not have it in the cone", cell, face); 13480f66a230SMatthew G. Knepley PetscFunctionReturn(0); 13490f66a230SMatthew G. Knepley } 13500f66a230SMatthew G. Knepley 13510f66a230SMatthew G. Knepley #undef __FUNCT__ 13522be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete" 1353cd0c2139SMatthew G Knepley /*@ 13540f66a230SMatthew G. Knepley DMPlexLabelCohesiveComplete - Starting with a label marking points on an internal surface, we add all other mesh pieces 1355cd0c2139SMatthew G Knepley to complete the surface 1356cd0c2139SMatthew G Knepley 1357cd0c2139SMatthew G Knepley Input Parameters: 1358cd0c2139SMatthew G Knepley + dm - The DM 13590f66a230SMatthew G. Knepley . label - A DMLabel marking the surface 13600f66a230SMatthew G. Knepley . blabel - A DMLabel marking the vertices on the boundary which will not be duplicated, or NULL to find them automatically 1361bb55d314SMatthew G. Knepley . flip - Flag to flip the submesh normal and replace points on the other side 136247946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL 1363cd0c2139SMatthew G Knepley 1364cd0c2139SMatthew G Knepley Output Parameter: 1365cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 1366cd0c2139SMatthew G Knepley 13670f66a230SMatthew G. Knepley Note: The vertices in blabel are called "unsplit" in the terminology from hybrid cell creation. 13680f66a230SMatthew G. Knepley 1369cd0c2139SMatthew G Knepley Level: developer 1370cd0c2139SMatthew G Knepley 13712be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 1372cd0c2139SMatthew G Knepley @*/ 13730f66a230SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, DMLabel blabel, PetscBool flip, DM subdm) 1374cd0c2139SMatthew G Knepley { 1375d90583fdSMatthew G. Knepley DMLabel depthLabel; 137618c5995bSMatthew G. Knepley IS dimIS, subpointIS, facePosIS, faceNegIS; 137747946fd8SMatthew G. Knepley const PetscInt *points, *subpoints; 1378bb55d314SMatthew G. Knepley const PetscInt rev = flip ? -1 : 1; 13790f66a230SMatthew G. Knepley PetscInt shift = 100, shift2 = 200, dim, dep, cStart, cEnd, fStart, fEnd, vStart, vEnd, numPoints, numSubpoints, p, val; 1380cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1381cd0c2139SMatthew G Knepley 1382cd0c2139SMatthew G Knepley PetscFunctionBegin; 1383d90583fdSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 1384cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 138547946fd8SMatthew G. Knepley if (subdm) { 138647946fd8SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 138747946fd8SMatthew G. Knepley if (subpointIS) { 138847946fd8SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 138947946fd8SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 139047946fd8SMatthew G. Knepley } 139147946fd8SMatthew G. Knepley } 1392d7c8f101SMatthew G. Knepley /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */ 1393cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 1394cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1395cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1396cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1397d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */ 1398cd0c2139SMatthew G Knepley const PetscInt *support; 1399cd0c2139SMatthew G Knepley PetscInt supportSize, s; 1400cd0c2139SMatthew G Knepley 1401cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1402cd0c2139SMatthew G Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 1403cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1404cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 14050f66a230SMatthew G. Knepley const PetscInt *cone; 1406cd0c2139SMatthew G Knepley PetscInt coneSize, c; 14070f66a230SMatthew G. Knepley PetscBool pos; 1408cd0c2139SMatthew G Knepley 14090f66a230SMatthew G. Knepley ierr = GetSurfaceSide_Static(dm, subdm, numSubpoints, subpoints, support[s], points[p], &pos);CHKERRQ(ierr); 14100f66a230SMatthew G. Knepley if (pos) {ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr);} 14110f66a230SMatthew G. Knepley else {ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);} 14120f66a230SMatthew G. Knepley if (rev < 0) pos = !pos ? PETSC_TRUE : PETSC_FALSE; 14130f66a230SMatthew G. Knepley /* Put faces touching the fault in the label */ 1414cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1415cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1416cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1417cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 1418cd0c2139SMatthew G Knepley 1419cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1420cd0c2139SMatthew G Knepley if (val == -1) { 1421cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 1422cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 1423cd0c2139SMatthew G Knepley 1424cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1425cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1426cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 1427cd0c2139SMatthew G Knepley 1428cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1429cd0c2139SMatthew G Knepley if ((val >= 0) && (val < dim-1)) { 1430cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1431cd0c2139SMatthew G Knepley break; 1432cd0c2139SMatthew G Knepley } 1433cd0c2139SMatthew G Knepley } 1434cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1435cd0c2139SMatthew G Knepley } 1436cd0c2139SMatthew G Knepley } 1437cd0c2139SMatthew G Knepley } 1438cd0c2139SMatthew G Knepley } 14390f66a230SMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 14400f66a230SMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 14410f66a230SMatthew G. Knepley /* Add in halo faces, and cells in the support */ 14420f66a230SMatthew G. Knepley if (blabel && subdm) { 14430f66a230SMatthew G. Knepley DMLabel bdlabel; 14440f66a230SMatthew G. Knepley 14450f66a230SMatthew G. Knepley ierr = DMPlexGetLabel(subdm, "boundary", &bdlabel);CHKERRQ(ierr); 14460f66a230SMatthew G. Knepley ierr = DMLabelGetStratumIS(bdlabel, 1, &dimIS);CHKERRQ(ierr); 14470f66a230SMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 14480f66a230SMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 14490f66a230SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault boundary vertices */ 14500f66a230SMatthew G. Knepley PetscInt *star = NULL; 14510f66a230SMatthew G. Knepley PetscInt starSize, s; 14520f66a230SMatthew G. Knepley 14530f66a230SMatthew G. Knepley if ((points[p] < vStart) || (points[p] >= vEnd)) continue; 14540f66a230SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 14550f66a230SMatthew G. Knepley for (s = 0; s < starSize*2; s += 2) { 14560f66a230SMatthew G. Knepley const PetscInt point = star[s]; 14570f66a230SMatthew G. Knepley PetscBool inHalo = PETSC_TRUE; 14580f66a230SMatthew G. Knepley PetscInt *closure = NULL; 14590f66a230SMatthew G. Knepley PetscInt closureSize, cl, val, bval; 14600f66a230SMatthew G. Knepley 14610f66a230SMatthew G. Knepley if ((point < fStart) || (point >= fEnd)) continue; 14620f66a230SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 14630f66a230SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 14640f66a230SMatthew G. Knepley const PetscInt clp = closure[cl]; 14650f66a230SMatthew G. Knepley 14660f66a230SMatthew G. Knepley if ((clp < vStart) || (clp >= vEnd)) continue; 14670f66a230SMatthew G. Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 14680f66a230SMatthew G. Knepley if (!((val == 0) || (bval == 0))) {inHalo = PETSC_FALSE; break;} 14690f66a230SMatthew G. Knepley } 14700f66a230SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 14710f66a230SMatthew G. Knepley if (inHalo) { 14720f66a230SMatthew G. Knepley const PetscInt *support; 14730f66a230SMatthew G. Knepley PetscInt supportSize, s; 14740f66a230SMatthew G. Knepley PetscBool pos; 14750f66a230SMatthew G. Knepley 14760f66a230SMatthew G. Knepley /* Set face to positive side, it will be split below */ 14770f66a230SMatthew G. Knepley ierr = DMLabelSetValue(label, point, rev*(shift+dim-1));CHKERRQ(ierr); 14780f66a230SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 14790f66a230SMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 14800f66a230SMatthew G. Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Halo face %d has supportSize %d != 2", point, supportSize); 14810f66a230SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 14820f66a230SMatthew G. Knepley ierr = GetSurfaceSide_Static(dm, subdm, numSubpoints, subpoints, support[s], point, &pos);CHKERRQ(ierr); 14830f66a230SMatthew G. Knepley if (pos) {ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr);} 14840f66a230SMatthew G. Knepley else {ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);} 14850f66a230SMatthew G. Knepley } 14860f66a230SMatthew G. Knepley } 14870f66a230SMatthew G. Knepley } 14880f66a230SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 14890f66a230SMatthew G. Knepley } 14900f66a230SMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 14910f66a230SMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 14920f66a230SMatthew G. Knepley } 149347946fd8SMatthew G. Knepley if (subdm) { 149447946fd8SMatthew G. Knepley if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 149547946fd8SMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 149647946fd8SMatthew G. Knepley } 1497cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1498cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 14990f66a230SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 15000f66a230SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 1501cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 1502cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1503cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1504cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1505d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */ 1506cd0c2139SMatthew G Knepley PetscInt *star = NULL; 1507cd0c2139SMatthew G Knepley PetscInt starSize, s; 1508cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1509cd0c2139SMatthew G Knepley 1510d4622b2cSMatthew G. Knepley /* All points connected to the fault are inside a cell, so at the top level we will only check cells */ 1511cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1512cd0c2139SMatthew G Knepley while (again) { 1513cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1514cd0c2139SMatthew G Knepley again = 0; 1515cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1516cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1517cd0c2139SMatthew G Knepley const PetscInt *cone; 1518cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1519cd0c2139SMatthew G Knepley 1520cd0c2139SMatthew G Knepley if ((point < cStart) || (point >= cEnd)) continue; 1521cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1522cd0c2139SMatthew G Knepley if (val != -1) continue; 1523d4622b2cSMatthew G. Knepley again = again == 1 ? 1 : 2; 1524cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1525cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1526cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1527cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1528cd0c2139SMatthew G Knepley if (val != -1) { 1529d7c8f101SMatthew G. Knepley const PetscInt *ccone; 1530166d9d0cSMatthew G. Knepley PetscInt cconeSize, cc, side; 1531d7c8f101SMatthew G. Knepley 1532cd0c2139SMatthew 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); 153337a6de01SMatthew G. Knepley if (val > 0) side = 1; 153437a6de01SMatthew G. Knepley else side = -1; 153537a6de01SMatthew G. Knepley ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr); 1536d7c8f101SMatthew G. Knepley /* Mark cell faces which touch the fault */ 1537d7c8f101SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr); 1538d7c8f101SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr); 1539d7c8f101SMatthew G. Knepley for (cc = 0; cc < cconeSize; ++cc) { 1540d7c8f101SMatthew G. Knepley PetscInt *closure = NULL; 1541d7c8f101SMatthew G. Knepley PetscInt closureSize, cl; 1542d7c8f101SMatthew G. Knepley 1543166d9d0cSMatthew G. Knepley ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr); 1544166d9d0cSMatthew G. Knepley if (val != -1) continue; 1545d7c8f101SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1546d4622b2cSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1547d7c8f101SMatthew G. Knepley const PetscInt clp = closure[cl]; 1548d7c8f101SMatthew G. Knepley 1549d7c8f101SMatthew G. Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1550d7c8f101SMatthew G. Knepley if (val == -1) continue; 1551d7c8f101SMatthew G. Knepley ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr); 155237a6de01SMatthew G. Knepley break; 155337a6de01SMatthew G. Knepley } 1554d7c8f101SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1555cd0c2139SMatthew G Knepley } 1556cd0c2139SMatthew G Knepley again = 1; 1557cd0c2139SMatthew G Knepley break; 1558cd0c2139SMatthew G Knepley } 1559cd0c2139SMatthew G Knepley } 1560cd0c2139SMatthew G Knepley } 1561cd0c2139SMatthew G Knepley } 1562cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1563cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1564cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1565cd0c2139SMatthew G Knepley 1566cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1567cd0c2139SMatthew G Knepley if (val == -1) { 1568cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1569cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1570cd0c2139SMatthew G Knepley PetscBool marked = PETSC_FALSE; 1571cd0c2139SMatthew G Knepley 1572cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1573cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1574cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1575cd0c2139SMatthew G Knepley 1576cd0c2139SMatthew G Knepley if ((spoint < cStart) || (spoint >= cEnd)) continue; 1577cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1578cd0c2139SMatthew 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); 1579d90583fdSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1580cd0c2139SMatthew G Knepley if (val > 0) { 1581cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1582cd0c2139SMatthew G Knepley } else { 1583cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1584cd0c2139SMatthew G Knepley } 1585cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1586cd0c2139SMatthew G Knepley break; 1587cd0c2139SMatthew G Knepley } 1588cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1589cd0c2139SMatthew G Knepley if (!marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1590cd0c2139SMatthew G Knepley } 1591cd0c2139SMatthew G Knepley } 1592cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1593cd0c2139SMatthew G Knepley } 1594cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1595cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 159618c5995bSMatthew G. Knepley /* If any faces touching the fault divide cells on either side, split them */ 159718c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift+dim-1, &facePosIS);CHKERRQ(ierr); 159818c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr); 159918c5995bSMatthew G. Knepley ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr); 160018c5995bSMatthew G. Knepley ierr = ISDestroy(&facePosIS);CHKERRQ(ierr); 160118c5995bSMatthew G. Knepley ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr); 160218c5995bSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 160318c5995bSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 160418c5995bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 160518c5995bSMatthew G. Knepley const PetscInt point = points[p]; 160618c5995bSMatthew G. Knepley const PetscInt *support; 160718c5995bSMatthew G. Knepley PetscInt supportSize, valA, valB; 160818c5995bSMatthew G. Knepley 160918c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 161018c5995bSMatthew G. Knepley if (supportSize != 2) continue; 161118c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 161218c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr); 161318c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr); 161418c5995bSMatthew G. Knepley if ((valA == -1) || (valB == -1)) continue; 161518c5995bSMatthew G. Knepley if (valA*valB > 0) continue; 161618c5995bSMatthew G. Knepley /* Split the face */ 161718c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr); 161818c5995bSMatthew G. Knepley ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr); 161918c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr); 1620e1757548SMatthew G. Knepley /* Label its closure: 1621e1757548SMatthew G. Knepley unmarked: label as unsplit 1622e1757548SMatthew G. Knepley incident: relabel as split 1623e1757548SMatthew G. Knepley split: do nothing 1624e1757548SMatthew G. Knepley */ 162518c5995bSMatthew G. Knepley { 162618c5995bSMatthew G. Knepley PetscInt *closure = NULL; 162718c5995bSMatthew G. Knepley PetscInt closureSize, cl; 162818c5995bSMatthew G. Knepley 162918c5995bSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 163018c5995bSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 163118c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr); 16328771c1d3SMatthew G. Knepley if (valA == -1) { /* Mark as unsplit */ 163318c5995bSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 163418c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr); 16358771c1d3SMatthew G. Knepley } else if (((valA >= shift) && (valA < shift2)) || ((valA <= -shift) && (valA > -shift2))) { 1636e1757548SMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 1637e1757548SMatthew G. Knepley ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr); 1638e1757548SMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr); 1639e1757548SMatthew G. Knepley } 164018c5995bSMatthew G. Knepley } 164118c5995bSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 164218c5995bSMatthew G. Knepley } 164318c5995bSMatthew G. Knepley } 164418c5995bSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 164518c5995bSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1646cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1647cd0c2139SMatthew G Knepley } 1648cd0c2139SMatthew G Knepley 1649cd0c2139SMatthew G Knepley #undef __FUNCT__ 16503cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh" 16513cf72582SMatthew G. Knepley /*@C 16523cf72582SMatthew G. Knepley DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface 16533cf72582SMatthew G. Knepley 16543cf72582SMatthew G. Knepley Collective on dm 16553cf72582SMatthew G. Knepley 16563cf72582SMatthew G. Knepley Input Parameters: 16573cf72582SMatthew G. Knepley + dm - The original DM 16583cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices 16593cf72582SMatthew G. Knepley 16603cf72582SMatthew G. Knepley Output Parameters: 16613cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface 16623cf72582SMatthew G. Knepley - dmHybrid - The new DM 16633cf72582SMatthew G. Knepley 16643cf72582SMatthew G. Knepley Level: developer 16653cf72582SMatthew G. Knepley 16663cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate() 16673cf72582SMatthew G. Knepley @*/ 16683cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid) 16693cf72582SMatthew G. Knepley { 16703cf72582SMatthew G. Knepley DM idm; 16713cf72582SMatthew G. Knepley DMLabel subpointMap, hlabel; 16723cf72582SMatthew G. Knepley PetscInt dim; 16733cf72582SMatthew G. Knepley PetscErrorCode ierr; 16743cf72582SMatthew G. Knepley 16753cf72582SMatthew G. Knepley PetscFunctionBegin; 16763cf72582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 16773cf72582SMatthew G. Knepley if (hybridLabel) PetscValidPointer(hybridLabel, 3); 16783cf72582SMatthew G. Knepley PetscValidPointer(dmHybrid, 4); 16793cf72582SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 16803cf72582SMatthew G. Knepley ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr); 16813cf72582SMatthew G. Knepley ierr = DMPlexOrient(idm);CHKERRQ(ierr); 16823cf72582SMatthew G. Knepley ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr); 16833cf72582SMatthew G. Knepley ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr); 16843cf72582SMatthew G. Knepley ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr); 16850f66a230SMatthew G. Knepley ierr = DMPlexLabelCohesiveComplete(dm, hlabel, NULL, PETSC_FALSE, idm);CHKERRQ(ierr); 16863cf72582SMatthew G. Knepley ierr = DMDestroy(&idm);CHKERRQ(ierr); 16873cf72582SMatthew G. Knepley ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr); 16883cf72582SMatthew G. Knepley if (hybridLabel) *hybridLabel = hlabel; 168953aa2e23SMatthew G. Knepley else {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);} 1690e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1691e6ccafaeSMatthew G Knepley } 1692e6ccafaeSMatthew G Knepley 1693e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1694efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated" 1695efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 1696efa14ee0SMatthew G Knepley 1697efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 1698efa14ee0SMatthew G Knepley */ 1699830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1700efa14ee0SMatthew G Knepley { 1701fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 1702efa14ee0SMatthew G Knepley const PetscInt *subvertices; 170377d178adSMatthew G. Knepley PetscInt *pStart, *pEnd, *pMax, pSize; 1704efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1705efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1706efa14ee0SMatthew G Knepley 1707efa14ee0SMatthew G Knepley PetscFunctionBegin; 1708efa14ee0SMatthew G Knepley *numFaces = 0; 1709efa14ee0SMatthew G Knepley *nFV = 0; 1710efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1711efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 171277d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1713dcca6d9dSJed Brown ierr = PetscMalloc3(pSize,&pStart,pSize,&pEnd,pSize,&pMax);CHKERRQ(ierr); 1714d92e47f8SMatthew 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); 1715efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 1716efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1717efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1718efa14ee0SMatthew G Knepley } 1719efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1720fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1721efa14ee0SMatthew G Knepley if (subvertexIS) { 1722efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1723efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1724efa14ee0SMatthew G Knepley } 1725efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1726efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 17270298fd71SBarry Smith PetscInt *star = NULL; 1728efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 1729efa14ee0SMatthew G Knepley 1730efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1731efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1732efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1733efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1734efa14ee0SMatthew G Knepley } 1735efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 1736efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 17370298fd71SBarry Smith PetscInt *closure = NULL; 1738efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 1739efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 1740efa14ee0SMatthew G Knepley 1741efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 174265560c7fSMatthew G Knepley if (cellLoc == 2) continue; 174382f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1744efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1745efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1746efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1747efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1748efa14ee0SMatthew G Knepley 1749efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1750efa14ee0SMatthew G Knepley ++numCorners; 1751efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1752830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 1753efa14ee0SMatthew G Knepley } 1754efa14ee0SMatthew G Knepley } 175518ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 175682f516ccSBarry 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); 1757efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 1758007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 1759007baee2SMatthew G. Knepley PetscInt numCells, nc; 1760007baee2SMatthew G. Knepley 1761efa14ee0SMatthew G Knepley ++(*numFaces); 1762efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 1763efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 1764efa14ee0SMatthew G Knepley } 1765007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1766007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 1767007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 1768007baee2SMatthew G. Knepley } 1769007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1770efa14ee0SMatthew G Knepley } 1771efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1772efa14ee0SMatthew G Knepley } 1773efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1774efa14ee0SMatthew G Knepley } 1775efa14ee0SMatthew G Knepley if (subvertexIS) { 1776efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1777efa14ee0SMatthew G Knepley } 1778efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1779efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1780efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1781efa14ee0SMatthew G Knepley } 1782efa14ee0SMatthew G Knepley 1783efa14ee0SMatthew G Knepley #undef __FUNCT__ 1784efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated" 1785830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 1786efa14ee0SMatthew G Knepley { 1787efa14ee0SMatthew G Knepley IS subvertexIS; 1788efa14ee0SMatthew G Knepley const PetscInt *subvertices; 1789efa14ee0SMatthew G Knepley PetscInt *pStart, *pEnd, *pMax; 1790efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 1791efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1792efa14ee0SMatthew G Knepley 1793efa14ee0SMatthew G Knepley PetscFunctionBegin; 1794efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1795dcca6d9dSJed Brown ierr = PetscMalloc3(dim+1,&pStart,dim+1,&pEnd,dim+1,&pMax);CHKERRQ(ierr); 17960298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1797efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 1798efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1799efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1800efa14ee0SMatthew G Knepley } 1801efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1802830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 1803efa14ee0SMatthew G Knepley if (subvertexIS) { 1804efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1805efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1806efa14ee0SMatthew G Knepley } 1807efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1808efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 18090298fd71SBarry Smith PetscInt *star = NULL; 1810efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 1811efa14ee0SMatthew G Knepley 1812efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1813efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1814efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1815efa14ee0SMatthew G Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 1816efa14ee0SMatthew G Knepley } 1817efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 1818efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 18190298fd71SBarry Smith PetscInt *closure = NULL; 1820efa14ee0SMatthew G Knepley PetscInt closureSize, c; 1821efa14ee0SMatthew G Knepley PetscInt faceLoc; 1822efa14ee0SMatthew G Knepley 1823efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 1824efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 182582f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 1826efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1827efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1828efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1829efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1830efa14ee0SMatthew G Knepley 1831efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1832efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1833830e53efSMatthew G. Knepley if (vertexLoc != value) break; 1834efa14ee0SMatthew G Knepley } 1835efa14ee0SMatthew G Knepley } 1836efa14ee0SMatthew G Knepley if (c == closureSize*2) { 1837efa14ee0SMatthew G Knepley const PetscInt *support; 1838efa14ee0SMatthew G Knepley PetscInt supportSize, s; 1839efa14ee0SMatthew G Knepley 1840efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1841efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1842efa14ee0SMatthew G Knepley 1843efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 1844efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1845efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1846efa14ee0SMatthew G Knepley break; 1847efa14ee0SMatthew G Knepley } 1848efa14ee0SMatthew G Knepley } 1849efa14ee0SMatthew G Knepley } 1850efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 1851efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 1852efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1853efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1854efa14ee0SMatthew G Knepley } 1855efa14ee0SMatthew G Knepley } 1856efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1857efa14ee0SMatthew G Knepley } 1858efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1859efa14ee0SMatthew G Knepley } 1860efa14ee0SMatthew G Knepley if (subvertexIS) { 1861efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1862efa14ee0SMatthew G Knepley } 1863efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1864efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1865efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1866efa14ee0SMatthew G Knepley } 1867efa14ee0SMatthew G Knepley 1868efa14ee0SMatthew G Knepley #undef __FUNCT__ 1869766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated" 187027c04023SMatthew 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) 1871766ab985SMatthew G. Knepley { 187227c04023SMatthew G. Knepley DMLabel label = NULL; 1873766ab985SMatthew G. Knepley const PetscInt *cone; 187427234c99SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize; 1875766ab985SMatthew G. Knepley PetscErrorCode ierr; 1876766ab985SMatthew G. Knepley 1877812bfc34SJed Brown PetscFunctionBegin; 1878c0ed958bSJed Brown *numFaces = 0; 1879c0ed958bSJed Brown *nFV = 0; 1880b6d5cb33SJed Brown if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1881fed694aaSMatthew G. Knepley *subCells = NULL; 1882766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1883766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1884766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1885766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 188627c04023SMatthew G. Knepley if (label) { 188727c04023SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 188827c04023SMatthew G. Knepley PetscInt val; 188927c04023SMatthew G. Knepley 189027c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 189127c04023SMatthew G. Knepley if (val == value) { 189227c04023SMatthew G. Knepley ++(*numFaces); 189327c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 189427c04023SMatthew G. Knepley } 189527c04023SMatthew G. Knepley } 189627c04023SMatthew G. Knepley } else { 1897766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 189827c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 189927c04023SMatthew G. Knepley } 1900766ab985SMatthew G. Knepley *nFV = hasLagrange ? coneSize/3 : coneSize/2; 1901785e854fSJed Brown ierr = PetscMalloc1(*numFaces *2, subCells);CHKERRQ(ierr); 1902766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1903766ab985SMatthew G. Knepley const PetscInt *cells; 1904766ab985SMatthew G. Knepley PetscInt numCells; 1905766ab985SMatthew G. Knepley 190627c04023SMatthew G. Knepley if (label) { 190727c04023SMatthew G. Knepley PetscInt val; 190827c04023SMatthew G. Knepley 190927c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 191027c04023SMatthew G. Knepley if (val != value) continue; 191127c04023SMatthew G. Knepley } 1912766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1913766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 1914766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 1915766ab985SMatthew G. Knepley } 1916766ab985SMatthew G. Knepley /* Negative face */ 1917766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 191827234c99SMatthew G. Knepley /* Not true in parallel 191927234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 1920766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 1921766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 192227234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 1923766ab985SMatthew G. Knepley } 1924766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 1925766ab985SMatthew G. Knepley /* Positive face is not included */ 1926766ab985SMatthew G. Knepley } 1927766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1928766ab985SMatthew G. Knepley } 1929766ab985SMatthew G. Knepley 1930766ab985SMatthew G. Knepley #undef __FUNCT__ 1931766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated" 1932b3154360SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DMLabel subpointMap, DM subdm) 1933766ab985SMatthew G. Knepley { 193427c04023SMatthew G. Knepley DMLabel label = NULL; 1935766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 1936766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 1937766ab985SMatthew G. Knepley PetscErrorCode ierr; 1938766ab985SMatthew G. Knepley 1939812bfc34SJed Brown PetscFunctionBegin; 194027c04023SMatthew G. Knepley if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1941766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1942766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1943766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1944766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 1945dcca6d9dSJed Brown ierr = PetscMalloc2(dim+1,&pStart,dim+1,&pEnd);CHKERRQ(ierr); 1946b3154360SMatthew G. Knepley for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);} 1947766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1948766ab985SMatthew G. Knepley const PetscInt *cone; 1949766ab985SMatthew G. Knepley PetscInt *closure = NULL; 1950b3154360SMatthew G. Knepley PetscInt fconeSize, coneSize, closureSize, cl, val; 1951766ab985SMatthew G. Knepley 195227c04023SMatthew G. Knepley if (label) { 195327c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 195427c04023SMatthew G. Knepley if (val != value) continue; 195527c04023SMatthew G. Knepley } 1956766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 1957766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1958b3154360SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr); 1959b3154360SMatthew G. Knepley if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 1960b3154360SMatthew G. Knepley /* Negative face */ 1961766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1962766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1963766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 1964766ab985SMatthew G. Knepley 1965766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 1966766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1967766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1968766ab985SMatthew G. Knepley break; 1969766ab985SMatthew G. Knepley } 1970766ab985SMatthew G. Knepley } 1971766ab985SMatthew G. Knepley } 1972766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1973766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 1974766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 1975766ab985SMatthew G. Knepley const PetscInt *support; 1976766ab985SMatthew G. Knepley PetscInt supportSize, s; 1977766ab985SMatthew G. Knepley 1978766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 1979711de394SMatthew G. Knepley /* if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); */ 1980766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 1981766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 1982766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1983766ab985SMatthew G. Knepley } 1984766ab985SMatthew G. Knepley } 1985766ab985SMatthew G. Knepley } 1986766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 1987766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1988766ab985SMatthew G. Knepley } 1989766ab985SMatthew G. Knepley 1990766ab985SMatthew G. Knepley #undef __FUNCT__ 1991e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation" 1992e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 1993e6ccafaeSMatthew G Knepley { 199482f516ccSBarry Smith MPI_Comm comm; 1995e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 1996e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 1997e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 1998e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1999e6ccafaeSMatthew G Knepley 200082f516ccSBarry Smith PetscFunctionBegin; 200182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2002e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &cellDim);CHKERRQ(ierr); 2003e6ccafaeSMatthew G Knepley if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 2004e6ccafaeSMatthew G Knepley 2005ddeab2a6SMatthew G. Knepley if (cellDim == 1 && numCorners == 2) { 2006ddeab2a6SMatthew G. Knepley /* Triangle */ 2007e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 2008e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2009ddeab2a6SMatthew G. Knepley } else if (cellDim == 2 && numCorners == 3) { 2010ddeab2a6SMatthew G. Knepley /* Triangle */ 2011ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2012ddeab2a6SMatthew G. Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2013ddeab2a6SMatthew G. Knepley } else if (cellDim == 3 && numCorners == 4) { 2014ddeab2a6SMatthew G. Knepley /* Tetrahedron */ 2015ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2016ddeab2a6SMatthew G. Knepley posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2017e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 2018e6ccafaeSMatthew G Knepley /* Quadratic line */ 2019e6ccafaeSMatthew G Knepley faceSize = 1; 2020e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2021e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 2022e6ccafaeSMatthew G Knepley /* Quads */ 2023e6ccafaeSMatthew G Knepley faceSize = 2; 2024e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 2025e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2026e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 2027e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2028e6ccafaeSMatthew G Knepley } else { 2029e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 2030e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 2031e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 2032e6ccafaeSMatthew G Knepley } 2033e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 2034e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 2035e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2036e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 2037e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2038e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2039e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 2040e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2041e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2042e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 2043e6ccafaeSMatthew G Knepley }; 2044e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 2045e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2046e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2047e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 2048e6ccafaeSMatthew G Knepley }; 2049e6ccafaeSMatthew G Knepley 2050e6ccafaeSMatthew G Knepley faceSize = faceSizeTri; 2051e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 2052e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 2053e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 2054e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 2055e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2056e6ccafaeSMatthew G Knepley 2057e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 2058e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 2059e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 2060e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 2061e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 2062e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2063e6ccafaeSMatthew G Knepley break; 2064e6ccafaeSMatthew G Knepley } 2065e6ccafaeSMatthew G Knepley } 2066e6ccafaeSMatthew G Knepley } 2067e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2068e6ccafaeSMatthew G Knepley break; 2069e6ccafaeSMatthew G Knepley } 2070e6ccafaeSMatthew G Knepley } 2071e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 2072e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2073e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2074e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 2075e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 2076e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2077e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 2078e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2079e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2080e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 2081e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2082e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2083e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2084e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 2085e6ccafaeSMatthew G Knepley }; 2086e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 2087e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2088e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2089e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2090e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 2091e6ccafaeSMatthew G Knepley }; 2092e6ccafaeSMatthew G Knepley 2093e6ccafaeSMatthew G Knepley faceSize = faceSizeQuad; 2094e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 2095e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 2096e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 2097e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 2098e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2099e6ccafaeSMatthew G Knepley 2100e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 2101e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 2102e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 2103e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 2104e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 2105e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2106e6ccafaeSMatthew G Knepley break; 2107e6ccafaeSMatthew G Knepley } 2108e6ccafaeSMatthew G Knepley } 2109e6ccafaeSMatthew G Knepley } 2110e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2111e6ccafaeSMatthew G Knepley break; 2112e6ccafaeSMatthew G Knepley } 2113e6ccafaeSMatthew G Knepley } 2114e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 2115e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2116e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2117e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 2118e6ccafaeSMatthew G Knepley /* Hexes 2119e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2120e6ccafaeSMatthew G Knepley pointing up at the second. 2121e6ccafaeSMatthew G Knepley 2122e6ccafaeSMatthew G Knepley 7---6 2123e6ccafaeSMatthew G Knepley /| /| 2124e6ccafaeSMatthew G Knepley 4---5 | 2125ddeab2a6SMatthew G. Knepley | 1-|-2 2126e6ccafaeSMatthew G Knepley |/ |/ 2127ddeab2a6SMatthew G. Knepley 0---3 2128e6ccafaeSMatthew G Knepley 2129e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2130e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 2131e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 2132e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2133e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 2134e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 2135e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2136ddeab2a6SMatthew G. Knepley 0, 3, 4, 5, /* front */ 2137ddeab2a6SMatthew G. Knepley 2, 3, 5, 6, /* right */ 2138ddeab2a6SMatthew G. Knepley 1, 2, 6, 7, /* back */ 2139ddeab2a6SMatthew G. Knepley 0, 1, 4, 7, /* left */ 2140e6ccafaeSMatthew G Knepley }; 2141e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 2142ddeab2a6SMatthew G. Knepley 1, 2, 3, 0, /* bottom */ 2143e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2144ddeab2a6SMatthew G. Knepley 0, 3, 5, 4, /* front */ 2145ddeab2a6SMatthew G. Knepley 3, 2, 6, 5, /* right */ 2146ddeab2a6SMatthew G. Knepley 2, 1, 7, 6, /* back */ 2147ddeab2a6SMatthew G. Knepley 1, 0, 4, 7, /* left */ 2148e6ccafaeSMatthew G Knepley }; 2149e6ccafaeSMatthew G Knepley 2150e6ccafaeSMatthew G Knepley faceSize = faceSizeHex; 2151e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 2152e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 2153e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2154e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 2155e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2156e6ccafaeSMatthew G Knepley 2157e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 2158e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 2159e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 2160e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 2161e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 2162e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 2163e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 2164e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2165e6ccafaeSMatthew G Knepley break; 2166e6ccafaeSMatthew G Knepley } 2167e6ccafaeSMatthew G Knepley } 2168e6ccafaeSMatthew G Knepley } 2169e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2170e6ccafaeSMatthew G Knepley break; 2171e6ccafaeSMatthew G Knepley } 2172e6ccafaeSMatthew G Knepley } 2173e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2174e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2175e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2176e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 2177e6ccafaeSMatthew G Knepley /* Quadratic tet */ 2178e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 2179e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 2180e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 2181e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2182e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 2183e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2184e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 2185e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 2186e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 2187e6ccafaeSMatthew G Knepley }; 2188e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 2189e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2190e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 2191e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 2192e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 2193e6ccafaeSMatthew G Knepley }; 2194e6ccafaeSMatthew G Knepley 2195e6ccafaeSMatthew G Knepley faceSize = faceSizeTet; 2196e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 2197e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 2198e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 2199e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 2200e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2201e6ccafaeSMatthew G Knepley 2202e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 2203e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 2204e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 2205e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 2206e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 2207e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 2208e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 2209e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2210e6ccafaeSMatthew G Knepley break; 2211e6ccafaeSMatthew G Knepley } 2212e6ccafaeSMatthew G Knepley } 2213e6ccafaeSMatthew G Knepley } 2214e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2215e6ccafaeSMatthew G Knepley break; 2216e6ccafaeSMatthew G Knepley } 2217e6ccafaeSMatthew G Knepley } 2218e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 2219e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2220e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2221e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 2222e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 2223e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2224e6ccafaeSMatthew G Knepley pointing up at the second. 2225e6ccafaeSMatthew G Knepley 2226e6ccafaeSMatthew G Knepley 7---6 2227e6ccafaeSMatthew G Knepley /| /| 2228e6ccafaeSMatthew G Knepley 4---5 | 2229e6ccafaeSMatthew G Knepley | 3-|-2 2230e6ccafaeSMatthew G Knepley |/ |/ 2231e6ccafaeSMatthew G Knepley 0---1 2232e6ccafaeSMatthew G Knepley 2233e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2234e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 2235e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 2236e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2237e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 2238e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 2239e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2240e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 2241e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 2242e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 2243e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 2244e6ccafaeSMatthew G Knepley }; 2245e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 2246e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 2247e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2248e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 2249e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 2250e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 2251e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 2252e6ccafaeSMatthew G Knepley }; 2253e6ccafaeSMatthew G Knepley 2254e6ccafaeSMatthew G Knepley faceSize = faceSizeQuadHex; 2255e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 2256e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 2257e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2258e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 2259e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2260e6ccafaeSMatthew G Knepley 2261e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 2262e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 2263e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 2264e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 2265e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 2266e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 2267e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 2268e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2269e6ccafaeSMatthew G Knepley break; 2270e6ccafaeSMatthew G Knepley } 2271e6ccafaeSMatthew G Knepley } 2272e6ccafaeSMatthew G Knepley } 2273e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2274e6ccafaeSMatthew G Knepley break; 2275e6ccafaeSMatthew G Knepley } 2276e6ccafaeSMatthew G Knepley } 2277e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2278e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2279e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2280e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 2281e6ccafaeSMatthew G Knepley if (!posOrient) { 2282e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 2283e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 2284e6ccafaeSMatthew G Knepley } else { 2285e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 2286e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 2287e6ccafaeSMatthew G Knepley } 2288e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 2289e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2290e6ccafaeSMatthew G Knepley } 2291e6ccafaeSMatthew G Knepley 2292e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2293e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace" 2294e6ccafaeSMatthew G Knepley /* 2295e6ccafaeSMatthew G Knepley Given a cell and a face, as a set of vertices, 2296e6ccafaeSMatthew G Knepley return the oriented face, as a set of vertices, in faceVertices 2297e6ccafaeSMatthew G Knepley The orientation is such that the face normal points out of the cell 2298e6ccafaeSMatthew G Knepley */ 2299e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2300e6ccafaeSMatthew G Knepley { 23010298fd71SBarry Smith const PetscInt *cone = NULL; 2302e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 2303e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 2304e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2305e6ccafaeSMatthew G Knepley 2306e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2307e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 2308e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 2309e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 2310e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2311e6ccafaeSMatthew G Knepley 2312e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 2313e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 2314e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 2315e6ccafaeSMatthew G Knepley } 2316e6ccafaeSMatthew G Knepley } 2317e6ccafaeSMatthew G Knepley if (found) { 2318e6ccafaeSMatthew G Knepley indices[v2] = v; 2319e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 2320e6ccafaeSMatthew G Knepley ++v2; 2321e6ccafaeSMatthew G Knepley } else { 2322e6ccafaeSMatthew G Knepley oppositeVertex = v; 2323e6ccafaeSMatthew G Knepley } 2324e6ccafaeSMatthew G Knepley } 2325e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 2326e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2327e6ccafaeSMatthew G Knepley } 2328e6ccafaeSMatthew G Knepley 2329e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2330cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal" 2331e6ccafaeSMatthew G Knepley /* 2332cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 2333e6ccafaeSMatthew G Knepley 2334e6ccafaeSMatthew G Knepley Not collective 2335e6ccafaeSMatthew G Knepley 2336e6ccafaeSMatthew G Knepley Input Parameters: 2337e6ccafaeSMatthew G Knepley + dm - The DMPlex 2338e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 2339e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 2340e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 2341e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 2342e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 2343e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 2344e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 2345e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 2346e6ccafaeSMatthew G Knepley 2347e6ccafaeSMatthew G Knepley Output Parameters: 2348e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 2349e6ccafaeSMatthew G Knepley 2350e6ccafaeSMatthew G Knepley Level: developer 2351e6ccafaeSMatthew G Knepley */ 2352cd0c2139SMatthew 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) 2353e6ccafaeSMatthew G Knepley { 235482f516ccSBarry Smith MPI_Comm comm; 2355e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 2356e6ccafaeSMatthew G Knepley const PetscInt *faces; 2357e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 2358e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2359e6ccafaeSMatthew G Knepley 2360e6ccafaeSMatthew G Knepley PetscFunctionBegin; 236182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2362e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 2363e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 2364e6ccafaeSMatthew G Knepley #if 0 2365e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 2366e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2367e6ccafaeSMatthew G Knepley #else 2368e6ccafaeSMatthew G Knepley { 2369e6ccafaeSMatthew G Knepley PetscInt f; 2370e6ccafaeSMatthew G Knepley 2371e6ccafaeSMatthew G Knepley numFaces = 0; 2372e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2373e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 2374e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 2375e6ccafaeSMatthew G Knepley 2376e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 2377e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 2378e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 2379e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 2380e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 2381e6ccafaeSMatthew G Knepley PetscInt v; 2382e6ccafaeSMatthew G Knepley 2383e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2384e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 2385e6ccafaeSMatthew G Knepley } 2386e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 2387e6ccafaeSMatthew G Knepley } 2388e6ccafaeSMatthew G Knepley if (d == dof) { 2389e6ccafaeSMatthew G Knepley numFaces = 1; 2390e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 2391e6ccafaeSMatthew G Knepley } 2392e6ccafaeSMatthew G Knepley } 2393e6ccafaeSMatthew G Knepley } 2394e6ccafaeSMatthew G Knepley #endif 2395e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 2396e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 2397e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 2398766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 2399e6ccafaeSMatthew G Knepley } else { 2400e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 2401e6ccafaeSMatthew G Knepley PetscBool posOriented; 2402e6ccafaeSMatthew G Knepley 2403e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2404e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 2405e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 2406e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 2407e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 2408e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 2409e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2410e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 2411e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 2412e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 2413e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 2414e6ccafaeSMatthew G Knepley break; 2415e6ccafaeSMatthew G Knepley } 2416e6ccafaeSMatthew G Knepley } 2417e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 2418e6ccafaeSMatthew G Knepley } 2419e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 2420e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 2421e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2422e6ccafaeSMatthew G Knepley ++(*newFacePoint); 2423e6ccafaeSMatthew G Knepley } 2424ef07cca7SMatthew G. Knepley #if 0 2425e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2426ef07cca7SMatthew G. Knepley #else 2427ef07cca7SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2428ef07cca7SMatthew G. Knepley #endif 2429e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2430e6ccafaeSMatthew G Knepley } 2431e6ccafaeSMatthew G Knepley 2432e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2433e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated" 243453156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2435e6ccafaeSMatthew G Knepley { 243682f516ccSBarry Smith MPI_Comm comm; 243753156dfcSMatthew G. Knepley DMLabel subpointMap; 2438efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 2439efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 2440efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 2441fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 2442efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 2443e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2444e6ccafaeSMatthew G Knepley 2445e6ccafaeSMatthew G Knepley PetscFunctionBegin; 244682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2447efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2448efa14ee0SMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2449efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2450efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 245153156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);} 2452efa14ee0SMatthew G Knepley /* Setup chart */ 2453efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2454efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2455efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2456efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2457e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2458e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 2459efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 2460e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 2461efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2462efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2463efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 2464efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2465e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2466e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2467e6ccafaeSMatthew G Knepley } 2468e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2469e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2470e6ccafaeSMatthew G Knepley } 2471e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2472e6ccafaeSMatthew G Knepley /* Create face cones */ 2473efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 24740298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2475efa14ee0SMatthew G Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2476e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2477e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 2478efa14ee0SMatthew G Knepley const PetscInt subcell = c; 24790298fd71SBarry Smith PetscInt *closure = NULL; 2480efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 2481e6ccafaeSMatthew G Knepley 2482e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2483efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2484efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 2485e6ccafaeSMatthew G Knepley PetscInt subVertex; 2486e6ccafaeSMatthew G Knepley 2487efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 2488efa14ee0SMatthew G Knepley ++numCorners; 2489efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 2490efa14ee0SMatthew G Knepley if (subVertex >= 0) { 2491efa14ee0SMatthew G Knepley closure[faceSize] = point; 249265560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 2493e6ccafaeSMatthew G Knepley ++faceSize; 2494e6ccafaeSMatthew G Knepley } 2495e6ccafaeSMatthew G Knepley } 2496e6ccafaeSMatthew G Knepley } 2497efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 2498efa14ee0SMatthew G Knepley if (faceSize == nFV) { 2499cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 2500e6ccafaeSMatthew G Knepley } 250165560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2502e6ccafaeSMatthew G Knepley } 2503efa14ee0SMatthew G Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2504e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2505e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2506e6ccafaeSMatthew G Knepley /* Build coordinates */ 2507efa14ee0SMatthew G Knepley { 2508efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 2509efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 2510efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 2511285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2512efa14ee0SMatthew G Knepley 251369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2514e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 251569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2516285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2517285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2518285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2519efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2520efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2521efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2522efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2523efa14ee0SMatthew G Knepley PetscInt dof; 2524efa14ee0SMatthew G Knepley 2525efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2526efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2527285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2528e6ccafaeSMatthew G Knepley } 2529e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2530e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2531e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2532e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 25332eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2534830e53efSMatthew G. Knepley if (coordSize) { 2535e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2536e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2537efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2538efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2539efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2540efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2541e6ccafaeSMatthew G Knepley 2542e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2543e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2544efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2545efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2546efa14ee0SMatthew 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); 2547e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2548e6ccafaeSMatthew G Knepley } 2549e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2550e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 25513b399e24SMatthew G. Knepley } 2552e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2553e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2554e6ccafaeSMatthew G Knepley } 2555efa14ee0SMatthew G Knepley /* Cleanup */ 2556efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2557efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2558efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2559efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2560e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2561e6ccafaeSMatthew G Knepley } 2562e6ccafaeSMatthew G Knepley 2563e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2564e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated" 256553156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2566e6ccafaeSMatthew G Knepley { 256782f516ccSBarry Smith MPI_Comm comm; 256853156dfcSMatthew G. Knepley DMLabel subpointMap; 2569efa14ee0SMatthew G Knepley IS *subpointIS; 2570efa14ee0SMatthew G Knepley const PetscInt **subpoints; 257101a2673eSMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *coneONew; 2572efa14ee0SMatthew G Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2573e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2574e6ccafaeSMatthew G Knepley 2575e6ccafaeSMatthew G Knepley PetscFunctionBegin; 257682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2577efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2578e6ccafaeSMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2579efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2580efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 258153156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Interpolated(dm, vertexLabel, value, subpointMap, subdm);CHKERRQ(ierr);} 2582efa14ee0SMatthew G Knepley /* Setup chart */ 2583efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2584dcca6d9dSJed Brown ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr); 2585e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2586e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2587e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 2588e6ccafaeSMatthew G Knepley } 2589e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2590e6ccafaeSMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2591e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2592e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 2593e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2594e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2595e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2596e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2597e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 25980ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2599e6ccafaeSMatthew G Knepley } 2600e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2601e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2602e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2603e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2604e6ccafaeSMatthew G Knepley const PetscInt *cone; 2605e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 2606e6ccafaeSMatthew G Knepley 2607e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2608e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2609e6ccafaeSMatthew G Knepley if (d == dim) { 2610e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2611e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2612e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2613e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 2614e6ccafaeSMatthew G Knepley } 2615e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2616e6ccafaeSMatthew G Knepley } 2617e6ccafaeSMatthew G Knepley } 2618e6ccafaeSMatthew G Knepley } 2619e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2620e6ccafaeSMatthew G Knepley /* Set cones */ 26210298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2622dcca6d9dSJed Brown ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&coneONew);CHKERRQ(ierr); 2623e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2624e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2625e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2626e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 26270e49e2e2SMatthew G. Knepley const PetscInt *cone, *ornt; 2628e6ccafaeSMatthew G Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2629e6ccafaeSMatthew G Knepley 2630e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2631e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2632e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 26330e49e2e2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2634e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2635e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 263601a2673eSMatthew G. Knepley if (subc >= 0) { 263701a2673eSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 263801a2673eSMatthew G. Knepley coneONew[coneSizeNew] = ornt[c]; 263901a2673eSMatthew G. Knepley ++coneSizeNew; 264001a2673eSMatthew G. Knepley } 2641e6ccafaeSMatthew G Knepley } 2642e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2643e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 264401a2673eSMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, coneONew);CHKERRQ(ierr); 2645e6ccafaeSMatthew G Knepley } 2646e6ccafaeSMatthew G Knepley } 264701a2673eSMatthew G. Knepley ierr = PetscFree2(coneNew,coneONew);CHKERRQ(ierr); 2648e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2649e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2650e6ccafaeSMatthew G Knepley /* Build coordinates */ 2651e6ccafaeSMatthew G Knepley { 2652e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 2653e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 2654e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 2655285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2656e6ccafaeSMatthew G Knepley 265769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2658e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 265969d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2660285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2661285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2662285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2663e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2664e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2665e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2666e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2667e6ccafaeSMatthew G Knepley PetscInt dof; 2668e6ccafaeSMatthew G Knepley 2669e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2670e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2671285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2672e6ccafaeSMatthew G Knepley } 2673e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2674e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2675e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2676e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 26772eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2678e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2679e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2680e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2681e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2682e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2683e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2684e6ccafaeSMatthew G Knepley 2685e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2686e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2687e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2688e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2689e6ccafaeSMatthew 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); 2690efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2691e6ccafaeSMatthew G Knepley } 2692e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2693e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2694e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2695e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2696e6ccafaeSMatthew G Knepley } 2697efa14ee0SMatthew G Knepley /* Cleanup */ 2698e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 26990ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2700e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2701e6ccafaeSMatthew G Knepley } 2702efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2703e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2704e6ccafaeSMatthew G Knepley } 2705e6ccafaeSMatthew G Knepley 2706e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2707e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh" 2708d0fa310fSMatthew G. Knepley /*@ 2709e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 2710e6ccafaeSMatthew G Knepley 2711e6ccafaeSMatthew G Knepley Input Parameters: 2712e6ccafaeSMatthew G Knepley + dm - The original mesh 2713830e53efSMatthew G. Knepley . vertexLabel - The DMLabel marking vertices contained in the surface 2714830e53efSMatthew G. Knepley - value - The label value to use 2715e6ccafaeSMatthew G Knepley 2716e6ccafaeSMatthew G Knepley Output Parameter: 2717e6ccafaeSMatthew G Knepley . subdm - The surface mesh 2718e6ccafaeSMatthew G Knepley 2719e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2720e6ccafaeSMatthew G Knepley 2721e6ccafaeSMatthew G Knepley Level: developer 2722e6ccafaeSMatthew G Knepley 2723e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue() 2724830e53efSMatthew G. Knepley @*/ 272553156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm) 2726e6ccafaeSMatthew G Knepley { 2727e6ccafaeSMatthew G Knepley PetscInt dim, depth; 2728e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2729e6ccafaeSMatthew G Knepley 2730e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2731e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2732766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 2733e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2734e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 273582f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2736e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2737e6ccafaeSMatthew G Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2738e6ccafaeSMatthew G Knepley if (depth == dim) { 2739830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2740e6ccafaeSMatthew G Knepley } else { 2741830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2742e6ccafaeSMatthew G Knepley } 2743e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2744e6ccafaeSMatthew G Knepley } 2745e6ccafaeSMatthew G Knepley 2746e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2747aca35d17SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal" 2748aca35d17SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 2749aca35d17SMatthew G. Knepley { 2750aca35d17SMatthew G. Knepley PetscInt subPoint; 2751aca35d17SMatthew G. Knepley PetscErrorCode ierr; 2752aca35d17SMatthew G. Knepley 2753aca35d17SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 2754aca35d17SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 2755aca35d17SMatthew G. Knepley } 2756aca35d17SMatthew G. Knepley 2757aca35d17SMatthew G. Knepley #undef __FUNCT__ 2758766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated" 275927c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 2760766ab985SMatthew G. Knepley { 2761766ab985SMatthew G. Knepley MPI_Comm comm; 2762766ab985SMatthew G. Knepley DMLabel subpointMap; 2763766ab985SMatthew G. Knepley IS subvertexIS; 2764766ab985SMatthew G. Knepley const PetscInt *subVertices; 2765fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 2766766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 276787feddfdSMatthew G. Knepley PetscInt cMax, c, f; 2768766ab985SMatthew G. Knepley PetscErrorCode ierr; 2769766ab985SMatthew G. Knepley 2770766ab985SMatthew G. Knepley PetscFunctionBegin; 2771766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 2772766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2773766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2774766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2775766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 277627c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 2777766ab985SMatthew G. Knepley /* Setup chart */ 2778766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2779766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2780766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2781766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2782766ab985SMatthew G. Knepley /* Set cone sizes */ 2783766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 2784766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 2785766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 2786766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2787766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2788766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2789766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2790766ab985SMatthew G. Knepley } 2791766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2792766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2793766ab985SMatthew G. Knepley } 2794766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2795766ab985SMatthew G. Knepley /* Create face cones */ 2796766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 279787feddfdSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2798766ab985SMatthew G. Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2799766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2800766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 2801766ab985SMatthew G. Knepley const PetscInt subcell = c; 280287feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 280387feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 2804766ab985SMatthew G. Knepley 280587feddfdSMatthew G. Knepley if (cell < cMax) continue; 280687feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 280787feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 280887feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 280987feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 281087feddfdSMatthew G. Knepley } 281187feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 281287feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 281387feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 281427234c99SMatthew G. Knepley /* Not true in parallel 281527234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 281687feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 281787feddfdSMatthew G. Knepley PetscInt negsubcell; 2818766ab985SMatthew G. Knepley 281987feddfdSMatthew G. Knepley if (cells[p] >= cMax) continue; 282087feddfdSMatthew G. Knepley /* I know this is a crap search */ 282187feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 282287feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 2823766ab985SMatthew G. Knepley } 282487feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 282587feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 2826766ab985SMatthew G. Knepley } 282787feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 282887feddfdSMatthew G. Knepley ++newFacePoint; 2829766ab985SMatthew G. Knepley } 2830766ab985SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2831766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2832766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2833766ab985SMatthew G. Knepley /* Build coordinates */ 2834766ab985SMatthew G. Knepley { 2835766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2836766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2837766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2838285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2839766ab985SMatthew G. Knepley 284069d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2841766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 284269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2843285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2844285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2845285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2846766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2847766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2848766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2849766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2850766ab985SMatthew G. Knepley PetscInt dof; 2851766ab985SMatthew G. Knepley 2852766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2853766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2854285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2855766ab985SMatthew G. Knepley } 2856766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2857766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2858766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2859766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 28602eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2861766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2862766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2863766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2864766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2865766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2866766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 2867766ab985SMatthew G. Knepley 2868766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2869766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2870766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2871766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2872766ab985SMatthew 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); 2873766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2874766ab985SMatthew G. Knepley } 2875766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2876766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2877766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2878766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2879766ab985SMatthew G. Knepley } 2880aca35d17SMatthew G. Knepley /* Build SF */ 2881aca35d17SMatthew G. Knepley CHKMEMQ; 2882aca35d17SMatthew G. Knepley { 2883aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 2884aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 2885bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 2886aca35d17SMatthew G. Knepley const PetscInt *localPoints; 2887bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 288849c26ae4SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 2889bdcf2095SMatthew G. Knepley PetscMPIInt rank; 2890aca35d17SMatthew G. Knepley 2891bdcf2095SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 2892aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 2893aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 2894aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2895aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 2896aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 2897aca35d17SMatthew G. Knepley if (numRoots >= 0) { 2898aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 2899dcca6d9dSJed Brown ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 2900bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 2901bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 2902bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 2903bdcf2095SMatthew G. Knepley } 29049e0823b2SMatthew G. Knepley /* Set subleaves */ 2905aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2906aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 2907bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2908aca35d17SMatthew G. Knepley 2909aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 2910bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 2911bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 2912bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 2913bdcf2095SMatthew G. Knepley ++numSubLeaves; 2914aca35d17SMatthew G. Knepley } 29159e0823b2SMatthew G. Knepley /* Must put in owned subpoints */ 29169e0823b2SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 29179e0823b2SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 29189e0823b2SMatthew G. Knepley 29199e0823b2SMatthew G. Knepley if (subPoint < 0) { 29209e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = -3; 29219e0823b2SMatthew G. Knepley newOwners[p-pStart].index = -3; 29229e0823b2SMatthew G. Knepley } else { 29239e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = rank; 29249e0823b2SMatthew G. Knepley newOwners[p-pStart].index = subPoint; 29259e0823b2SMatthew G. Knepley } 2926bdcf2095SMatthew G. Knepley } 2927bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2928bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2929bdcf2095SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2930bdcf2095SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2931785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &slocalPoints);CHKERRQ(ierr); 2932785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &sremotePoints);CHKERRQ(ierr); 293349c26ae4SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 2934bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 2935bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2936aca35d17SMatthew G. Knepley 2937aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 293849c26ae4SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 2939aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 2940bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 2941bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 2942bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 2943bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 2944aca35d17SMatthew G. Knepley ++sl; 2945aca35d17SMatthew G. Knepley } 2946bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 294749c26ae4SMatthew G. Knepley if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 294849c26ae4SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 2949aca35d17SMatthew G. Knepley } 2950aca35d17SMatthew G. Knepley } 2951aca35d17SMatthew G. Knepley CHKMEMQ; 2952766ab985SMatthew G. Knepley /* Cleanup */ 2953766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2954766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2955766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 2956766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2957766ab985SMatthew G. Knepley } 2958766ab985SMatthew G. Knepley 2959766ab985SMatthew G. Knepley #undef __FUNCT__ 2960766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated" 2961b3154360SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char label[], PetscInt value, DM subdm) 2962766ab985SMatthew G. Knepley { 2963766ab985SMatthew G. Knepley MPI_Comm comm; 2964766ab985SMatthew G. Knepley DMLabel subpointMap; 2965766ab985SMatthew G. Knepley IS *subpointIS; 2966766ab985SMatthew G. Knepley const PetscInt **subpoints; 2967b1a8e46aSMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *orntNew; 2968766ab985SMatthew G. Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2969766ab985SMatthew G. Knepley PetscErrorCode ierr; 2970766ab985SMatthew G. Knepley 2971766ab985SMatthew G. Knepley PetscFunctionBegin; 2972766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2973766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2974766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2975766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2976766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 2977b3154360SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr); 2978766ab985SMatthew G. Knepley /* Setup chart */ 2979766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2980dcca6d9dSJed Brown ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr); 2981766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2982766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2983766ab985SMatthew G. Knepley totSubPoints += numSubPoints[d]; 2984766ab985SMatthew G. Knepley } 2985766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2986766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2987766ab985SMatthew G. Knepley /* Set cone sizes */ 2988766ab985SMatthew G. Knepley firstSubPoint[dim] = 0; 2989766ab985SMatthew G. Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2990766ab985SMatthew G. Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2991766ab985SMatthew G. Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2992766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2993766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2994b643afeaSMatthew G. Knepley if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2995766ab985SMatthew G. Knepley } 2996766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2997766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2998766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2999766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 3000766ab985SMatthew G. Knepley const PetscInt *cone; 3001766ab985SMatthew G. Knepley PetscInt coneSize, coneSizeNew, c, val; 3002766ab985SMatthew G. Knepley 3003766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 3004766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 3005766ab985SMatthew G. Knepley if (d == dim) { 3006766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 3007766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 3008766ab985SMatthew G. Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 3009766ab985SMatthew G. Knepley if (val >= 0) coneSizeNew++; 3010766ab985SMatthew G. Knepley } 3011766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 3012766ab985SMatthew G. Knepley } 3013766ab985SMatthew G. Knepley } 3014766ab985SMatthew G. Knepley } 3015766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 3016766ab985SMatthew G. Knepley /* Set cones */ 3017766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 3018dcca6d9dSJed Brown ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&orntNew);CHKERRQ(ierr); 3019766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 3020766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 3021766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 3022766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 3023b1a8e46aSMatthew G. Knepley const PetscInt *cone, *ornt; 3024766ab985SMatthew G. Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 3025766ab985SMatthew G. Knepley 3026766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 3027766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 3028766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 3029b1a8e46aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 3030766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 3031766ab985SMatthew G. Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 3032b1a8e46aSMatthew G. Knepley if (subc >= 0) { 3033b1a8e46aSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 3034b1a8e46aSMatthew G. Knepley orntNew[coneSizeNew++] = ornt[c]; 3035b1a8e46aSMatthew G. Knepley } 3036766ab985SMatthew G. Knepley } 3037766ab985SMatthew G. Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 3038766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 3039b1a8e46aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, orntNew);CHKERRQ(ierr); 3040766ab985SMatthew G. Knepley } 3041766ab985SMatthew G. Knepley } 3042b1a8e46aSMatthew G. Knepley ierr = PetscFree2(coneNew,orntNew);CHKERRQ(ierr); 3043766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 3044766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 3045766ab985SMatthew G. Knepley /* Build coordinates */ 3046766ab985SMatthew G. Knepley { 3047766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 3048766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 3049766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 3050285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 3051766ab985SMatthew G. Knepley 305269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3053766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 305469d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 3055285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 3056285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 3057285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 3058766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 3059766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 3060766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 3061766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 3062766ab985SMatthew G. Knepley PetscInt dof; 3063766ab985SMatthew G. Knepley 3064766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3065766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 3066285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 3067766ab985SMatthew G. Knepley } 3068766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 3069766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 3070766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 3071766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 30722eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 3073766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 3074766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3075766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 3076766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 3077766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 3078766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 3079766ab985SMatthew G. Knepley 3080766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3081766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 3082766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 3083766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 3084766ab985SMatthew 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); 3085766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 3086766ab985SMatthew G. Knepley } 3087766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3088766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3089766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 3090766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 3091766ab985SMatthew G. Knepley } 3092c80a7578SMatthew G. Knepley /* Build SF: We need this complexity because subpoints might not be selected on the owning process */ 3093c80a7578SMatthew G. Knepley { 3094c80a7578SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 3095251556f3SMatthew G. Knepley IS subpIS; 3096c80a7578SMatthew G. Knepley const PetscSFNode *remotePoints; 3097c80a7578SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 3098c80a7578SMatthew G. Knepley const PetscInt *localPoints, *subpoints; 3099c80a7578SMatthew G. Knepley PetscInt *slocalPoints; 3100f033dbf2SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubpoints = 0, numSubroots, numSubleaves = 0, l, sl, ll, pStart, pEnd, p; 3101c80a7578SMatthew G. Knepley PetscMPIInt rank; 3102c80a7578SMatthew G. Knepley 3103c80a7578SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 3104c80a7578SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 3105c80a7578SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 3106c80a7578SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3107c80a7578SMatthew G. Knepley ierr = DMPlexGetChart(subdm, NULL, &numSubroots);CHKERRQ(ierr); 3108251556f3SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpIS);CHKERRQ(ierr); 3109251556f3SMatthew G. Knepley if (subpIS) { 3110251556f3SMatthew G. Knepley ierr = ISGetIndices(subpIS, &subpoints);CHKERRQ(ierr); 3111251556f3SMatthew G. Knepley ierr = ISGetLocalSize(subpIS, &numSubpoints);CHKERRQ(ierr); 3112f033dbf2SMatthew G. Knepley } 3113c80a7578SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 3114c80a7578SMatthew G. Knepley if (numRoots >= 0) { 311582db75e7SMatthew G. Knepley ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 3116c80a7578SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 3117c80a7578SMatthew G. Knepley newLocalPoints[p].rank = -2; 3118c80a7578SMatthew G. Knepley newLocalPoints[p].index = -2; 3119c80a7578SMatthew G. Knepley } 3120c80a7578SMatthew G. Knepley /* Set subleaves */ 3121c80a7578SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 3122c80a7578SMatthew G. Knepley const PetscInt point = localPoints[l]; 3123c80a7578SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 3124c80a7578SMatthew G. Knepley 3125c80a7578SMatthew G. Knepley if (subpoint < 0) continue; 3126c80a7578SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 3127c80a7578SMatthew G. Knepley newLocalPoints[point-pStart].index = subpoint; 3128c80a7578SMatthew G. Knepley ++numSubleaves; 3129c80a7578SMatthew G. Knepley } 3130c80a7578SMatthew G. Knepley /* Must put in owned subpoints */ 3131c80a7578SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 3132c80a7578SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(p, 0, numSubpoints, subpoints); 3133c80a7578SMatthew G. Knepley 3134c80a7578SMatthew G. Knepley if (subpoint < 0) { 3135c80a7578SMatthew G. Knepley newOwners[p-pStart].rank = -3; 3136c80a7578SMatthew G. Knepley newOwners[p-pStart].index = -3; 3137c80a7578SMatthew G. Knepley } else { 3138c80a7578SMatthew G. Knepley newOwners[p-pStart].rank = rank; 3139c80a7578SMatthew G. Knepley newOwners[p-pStart].index = subpoint; 3140c80a7578SMatthew G. Knepley } 3141c80a7578SMatthew G. Knepley } 3142c80a7578SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3143c80a7578SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3144c80a7578SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3145c80a7578SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3146c80a7578SMatthew G. Knepley ierr = PetscMalloc(numSubleaves * sizeof(PetscInt), &slocalPoints);CHKERRQ(ierr); 3147c80a7578SMatthew G. Knepley ierr = PetscMalloc(numSubleaves * sizeof(PetscSFNode), &sremotePoints);CHKERRQ(ierr); 3148c80a7578SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 3149c80a7578SMatthew G. Knepley const PetscInt point = localPoints[l]; 3150c80a7578SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 3151c80a7578SMatthew G. Knepley 3152c80a7578SMatthew G. Knepley if (subpoint < 0) continue; 3153c80a7578SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 3154c80a7578SMatthew G. Knepley slocalPoints[sl] = subpoint; 3155c80a7578SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 3156c80a7578SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 3157c80a7578SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 3158c80a7578SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 3159c80a7578SMatthew G. Knepley ++sl; 3160c80a7578SMatthew G. Knepley } 3161c80a7578SMatthew G. Knepley if (sl + ll != numSubleaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubleaves); 3162c80a7578SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 3163c80a7578SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubroots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 3164c80a7578SMatthew G. Knepley } 3165251556f3SMatthew G. Knepley if (subpIS) { 3166251556f3SMatthew G. Knepley ierr = ISRestoreIndices(subpIS, &subpoints);CHKERRQ(ierr); 3167251556f3SMatthew G. Knepley ierr = ISDestroy(&subpIS);CHKERRQ(ierr); 3168251556f3SMatthew G. Knepley } 3169c80a7578SMatthew G. Knepley } 3170766ab985SMatthew G. Knepley /* Cleanup */ 3171766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 3172b643afeaSMatthew G. Knepley if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 3173766ab985SMatthew G. Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 3174766ab985SMatthew G. Knepley } 3175766ab985SMatthew G. Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 3176766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3177766ab985SMatthew G. Knepley } 3178766ab985SMatthew G. Knepley 3179766ab985SMatthew G. Knepley #undef __FUNCT__ 3180766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh" 3181766ab985SMatthew G. Knepley /* 318227c04023SMatthew 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. 3183766ab985SMatthew G. Knepley 3184766ab985SMatthew G. Knepley Input Parameters: 3185766ab985SMatthew G. Knepley + dm - The original mesh 318627c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 31877afc1a8bSJed Brown . label - A label name, or NULL 318827c04023SMatthew G. Knepley - value - A label value 3189766ab985SMatthew G. Knepley 3190766ab985SMatthew G. Knepley Output Parameter: 3191766ab985SMatthew G. Knepley . subdm - The surface mesh 3192766ab985SMatthew G. Knepley 3193766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3194766ab985SMatthew G. Knepley 3195766ab985SMatthew G. Knepley Level: developer 3196766ab985SMatthew G. Knepley 3197766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 3198766ab985SMatthew G. Knepley */ 319927c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 3200766ab985SMatthew G. Knepley { 3201766ab985SMatthew G. Knepley PetscInt dim, depth; 3202766ab985SMatthew G. Knepley PetscErrorCode ierr; 3203766ab985SMatthew G. Knepley 3204766ab985SMatthew G. Knepley PetscFunctionBegin; 3205766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 320627c04023SMatthew G. Knepley PetscValidPointer(subdm, 5); 3207766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 3208766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3209766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 3210766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3211766ab985SMatthew G. Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 3212766ab985SMatthew G. Knepley if (depth == dim) { 3213b3154360SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr); 3214766ab985SMatthew G. Knepley } else { 321527c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 3216e6ccafaeSMatthew G Knepley } 3217e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3218e6ccafaeSMatthew G Knepley } 3219e6ccafaeSMatthew G Knepley 3220e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3221e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap" 322264beef6dSMatthew G. Knepley /*@ 322364beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 322464beef6dSMatthew G. Knepley 322564beef6dSMatthew G. Knepley Input Parameter: 322664beef6dSMatthew G. Knepley . dm - The submesh DM 322764beef6dSMatthew G. Knepley 322864beef6dSMatthew G. Knepley Output Parameter: 322964beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 323064beef6dSMatthew G. Knepley 323164beef6dSMatthew G. Knepley Level: developer 323264beef6dSMatthew G. Knepley 323364beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 323464beef6dSMatthew G. Knepley @*/ 3235e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 3236e6ccafaeSMatthew G Knepley { 3237e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3238e6ccafaeSMatthew G Knepley 3239e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3240e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3241e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 3242e6ccafaeSMatthew G Knepley *subpointMap = mesh->subpointMap; 3243e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3244e6ccafaeSMatthew G Knepley } 3245e6ccafaeSMatthew G Knepley 3246e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3247e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap" 3248e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */ 3249e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 3250e6ccafaeSMatthew G Knepley { 3251e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 3252285d324eSMatthew G. Knepley DMLabel tmp; 3253e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3254e6ccafaeSMatthew G Knepley 3255e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3256e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3257285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 3258e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 3259285d324eSMatthew G. Knepley ++mesh->subpointMap->refct; 3260285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 3261e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3262e6ccafaeSMatthew G Knepley } 3263e6ccafaeSMatthew G Knepley 3264e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3265e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS" 326664beef6dSMatthew G. Knepley /*@ 3267e6ccafaeSMatthew G Knepley DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 3268e6ccafaeSMatthew G Knepley 3269e6ccafaeSMatthew G Knepley Input Parameter: 3270e6ccafaeSMatthew G Knepley . dm - The submesh DM 3271e6ccafaeSMatthew G Knepley 3272e6ccafaeSMatthew G Knepley Output Parameter: 32730298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 3274e6ccafaeSMatthew G Knepley 3275e6ccafaeSMatthew G Knepley Note: This is IS is guaranteed to be sorted by the construction of the submesh 327664beef6dSMatthew G. Knepley 327764beef6dSMatthew G. Knepley Level: developer 327864beef6dSMatthew G. Knepley 327964beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 328064beef6dSMatthew G. Knepley @*/ 3281e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 3282e6ccafaeSMatthew G Knepley { 328382f516ccSBarry Smith MPI_Comm comm; 3284e6ccafaeSMatthew G Knepley DMLabel subpointMap; 3285e6ccafaeSMatthew G Knepley IS is; 3286e6ccafaeSMatthew G Knepley const PetscInt *opoints; 3287e6ccafaeSMatthew G Knepley PetscInt *points, *depths; 3288e6ccafaeSMatthew G Knepley PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 3289e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3290e6ccafaeSMatthew G Knepley 3291e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3292e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3293e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 329482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 32950298fd71SBarry Smith *subpointIS = NULL; 3296e6ccafaeSMatthew G Knepley ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 3297e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3298fed694aaSMatthew G. Knepley if (subpointMap && depth >= 0) { 3299e6ccafaeSMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3300e6ccafaeSMatthew G Knepley if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 3301e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3302e6ccafaeSMatthew G Knepley depths[0] = depth; 3303e6ccafaeSMatthew G Knepley depths[1] = 0; 3304e6ccafaeSMatthew G Knepley for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 3305785e854fSJed Brown ierr = PetscMalloc1(pEnd, &points);CHKERRQ(ierr); 3306e6ccafaeSMatthew G Knepley for(d = 0, off = 0; d <= depth; ++d) { 3307e6ccafaeSMatthew G Knepley const PetscInt dep = depths[d]; 3308e6ccafaeSMatthew G Knepley 3309e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 3310e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 33111e21b6fdSMatthew G Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 3312e6ccafaeSMatthew 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); 3313e6ccafaeSMatthew G Knepley } else { 33141e21b6fdSMatthew G Knepley if (!n) { 33151e21b6fdSMatthew G Knepley if (d == 0) { 33161e21b6fdSMatthew G Knepley /* Missing cells */ 33171e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 33181e21b6fdSMatthew G Knepley } else { 33191e21b6fdSMatthew G Knepley /* Missing faces */ 33201e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 33211e21b6fdSMatthew G Knepley } 33221e21b6fdSMatthew G Knepley } 3323e6ccafaeSMatthew G Knepley } 3324e6ccafaeSMatthew G Knepley if (n) { 3325e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 3326e6ccafaeSMatthew G Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 3327e6ccafaeSMatthew G Knepley for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 3328e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 3329e6ccafaeSMatthew G Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 3330e6ccafaeSMatthew G Knepley } 3331e6ccafaeSMatthew G Knepley } 3332e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3333e6ccafaeSMatthew G Knepley if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 3334fed694aaSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 3335e6ccafaeSMatthew G Knepley } 3336e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3337e6ccafaeSMatthew G Knepley } 3338