134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 20c312b8eSJed Brown #include <petscsf.h> 3e6ccafaeSMatthew G Knepley 4e6ccafaeSMatthew G Knepley #undef __FUNCT__ 530560a7bSMatthew G. Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces_Internal" 630560a7bSMatthew G. Knepley PetscErrorCode DMPlexMarkBoundaryFaces_Internal(DM dm, PetscInt cellHeight, DMLabel label) 730560a7bSMatthew G. Knepley { 830560a7bSMatthew G. Knepley PetscInt fStart, fEnd, f; 930560a7bSMatthew G. Knepley PetscErrorCode ierr; 1030560a7bSMatthew G. Knepley 1130560a7bSMatthew G. Knepley PetscFunctionBegin; 1230560a7bSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1330560a7bSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight+1, &fStart, &fEnd);CHKERRQ(ierr); 1430560a7bSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 1530560a7bSMatthew G. Knepley PetscInt supportSize; 1630560a7bSMatthew G. Knepley 1730560a7bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 1830560a7bSMatthew G. Knepley if (supportSize == 1) {ierr = DMLabelSetValue(label, f, 1);CHKERRQ(ierr);} 1930560a7bSMatthew G. Knepley } 2030560a7bSMatthew G. Knepley PetscFunctionReturn(0); 2130560a7bSMatthew G. Knepley } 2230560a7bSMatthew G. Knepley 2330560a7bSMatthew 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; 4574e03af4SMatthew G. Knepley ierr = DMPlexMarkBoundaryFaces_Internal(dm, 0, 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; 265c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 266cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 267854ce69bSBarry Smith 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); 28446e270d4SMatthew G. Knepley ierr = DMSetCoordinateSection(dmNew, PETSC_DETERMINE, 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); 2894e90ef8eSMatthew G. Knepley ierr = VecSetBlockSize(newCoordinates, dim);CHKERRQ(ierr); 2902eb5907fSJed Brown ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr); 291cd0c2139SMatthew G Knepley ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr); 292cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 293cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 294cd0c2139SMatthew G Knepley ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr); 295cd0c2139SMatthew G Knepley for (v = vStart; v < vEnd; ++v) { 296cd0c2139SMatthew G Knepley PetscInt dof, off, noff, d; 297cd0c2139SMatthew G Knepley 298cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 299cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 300a6ae58d1SMatthew G. Knepley ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthEnd, depthEnd, depthShift), &noff);CHKERRQ(ierr); 301cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) { 302cd0c2139SMatthew G Knepley newCoords[noff+d] = coords[off+d]; 303cd0c2139SMatthew G Knepley } 304cd0c2139SMatthew G Knepley } 305cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 306cd0c2139SMatthew G Knepley ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr); 307cd0c2139SMatthew G Knepley ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 308cd0c2139SMatthew G Knepley ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr); 309cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 310cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 311cd0c2139SMatthew G Knepley } 312cd0c2139SMatthew G Knepley 313cd0c2139SMatthew G Knepley #undef __FUNCT__ 314cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal" 315cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew) 316cd0c2139SMatthew G Knepley { 317a6ae58d1SMatthew G. Knepley PetscInt *depthMax, *depthEnd; 318cd0c2139SMatthew G Knepley PetscInt depth = 0, d; 319cd0c2139SMatthew G Knepley PetscSF sfPoint, sfPointNew; 320cd0c2139SMatthew G Knepley const PetscSFNode *remotePoints; 321cd0c2139SMatthew G Knepley PetscSFNode *gremotePoints; 322cd0c2139SMatthew G Knepley const PetscInt *localPoints; 323cd0c2139SMatthew G Knepley PetscInt *glocalPoints, *newLocation, *newRemoteLocation; 324cd0c2139SMatthew G Knepley PetscInt numRoots, numLeaves, l, pStart, pEnd, totShift = 0; 325cd0c2139SMatthew G Knepley PetscErrorCode ierr; 326cd0c2139SMatthew G Knepley 327cd0c2139SMatthew G Knepley PetscFunctionBegin; 328cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3292203a8e9SMatthew G. Knepley ierr = PetscMalloc2(depth+1,&depthMax,depth+1,&depthEnd);CHKERRQ(ierr); 330a6ae58d1SMatthew 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); 331cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 332cd0c2139SMatthew G Knepley totShift += depthShift[d]; 333cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 334a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 335cd0c2139SMatthew G Knepley } 336cd0c2139SMatthew G Knepley /* Step 9: Convert pointSF */ 337cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 338cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr); 339cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 340cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 341cd0c2139SMatthew G Knepley if (numRoots >= 0) { 342dcca6d9dSJed Brown ierr = PetscMalloc2(numRoots,&newLocation,pEnd-pStart,&newRemoteLocation);CHKERRQ(ierr); 343a6ae58d1SMatthew G. Knepley for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthMax, depthEnd, depthShift); 344cd0c2139SMatthew G Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 345cd0c2139SMatthew G Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 346785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &glocalPoints);CHKERRQ(ierr); 347785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &gremotePoints);CHKERRQ(ierr); 348cd0c2139SMatthew G Knepley for (l = 0; l < numLeaves; ++l) { 349a6ae58d1SMatthew G. Knepley glocalPoints[l] = DMPlexShiftPoint_Internal(localPoints[l], depth, depthMax, depthEnd, depthShift); 350cd0c2139SMatthew G Knepley gremotePoints[l].rank = remotePoints[l].rank; 351cd0c2139SMatthew G Knepley gremotePoints[l].index = newRemoteLocation[localPoints[l]]; 352cd0c2139SMatthew G Knepley } 353cd0c2139SMatthew G Knepley ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr); 354cd0c2139SMatthew G Knepley ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 355cd0c2139SMatthew G Knepley } 356a6ae58d1SMatthew G. Knepley ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr); 357cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 358cd0c2139SMatthew G Knepley } 359cd0c2139SMatthew G Knepley 360cd0c2139SMatthew G Knepley #undef __FUNCT__ 361cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal" 362cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew) 363cd0c2139SMatthew G Knepley { 364cd0c2139SMatthew G Knepley PetscSF sfPoint; 365cd0c2139SMatthew G Knepley DMLabel vtkLabel, ghostLabel; 366a6ae58d1SMatthew G. Knepley PetscInt *depthMax, *depthEnd; 367cd0c2139SMatthew G Knepley const PetscSFNode *leafRemote; 368cd0c2139SMatthew G Knepley const PetscInt *leafLocal; 369cd0c2139SMatthew G Knepley PetscInt depth = 0, d, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f; 370cd0c2139SMatthew G Knepley PetscMPIInt rank; 371cd0c2139SMatthew G Knepley PetscErrorCode ierr; 372cd0c2139SMatthew G Knepley 373cd0c2139SMatthew G Knepley PetscFunctionBegin; 374cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3752203a8e9SMatthew G. Knepley ierr = PetscMalloc2(depth+1,&depthMax,depth+1,&depthEnd);CHKERRQ(ierr); 376a6ae58d1SMatthew 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); 377cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 378cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 379a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 380cd0c2139SMatthew G Knepley } 381cd0c2139SMatthew G Knepley /* Step 10: Convert labels */ 382cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 383cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 384cd0c2139SMatthew G Knepley DMLabel label, newlabel; 385cd0c2139SMatthew G Knepley const char *lname; 386cd0c2139SMatthew G Knepley PetscBool isDepth; 387cd0c2139SMatthew G Knepley IS valueIS; 388cd0c2139SMatthew G Knepley const PetscInt *values; 389cd0c2139SMatthew G Knepley PetscInt numValues, val; 390cd0c2139SMatthew G Knepley 391cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr); 392cd0c2139SMatthew G Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 393cd0c2139SMatthew G Knepley if (isDepth) continue; 394cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, lname);CHKERRQ(ierr); 395cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr); 396cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr); 397cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 398cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 399cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 400cd0c2139SMatthew G Knepley for (val = 0; val < numValues; ++val) { 401cd0c2139SMatthew G Knepley IS pointIS; 402cd0c2139SMatthew G Knepley const PetscInt *points; 403cd0c2139SMatthew G Knepley PetscInt numPoints, p; 404cd0c2139SMatthew G Knepley 405cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 406cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 407cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 408cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 409a6ae58d1SMatthew G. Knepley const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthMax, depthEnd, depthShift); 410cd0c2139SMatthew G Knepley 411cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr); 412cd0c2139SMatthew G Knepley } 413cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 414cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 415cd0c2139SMatthew G Knepley } 416cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 417cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 418cd0c2139SMatthew G Knepley } 419a6ae58d1SMatthew G. Knepley ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr); 420cd0c2139SMatthew G Knepley /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */ 421cd0c2139SMatthew G Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 422cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 423cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 424cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr); 425cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "vtk");CHKERRQ(ierr); 426cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "ghost");CHKERRQ(ierr); 427cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr); 428cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr); 429cd0c2139SMatthew G Knepley for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { 430cd0c2139SMatthew G Knepley for (; c < leafLocal[l] && c < cEnd; ++c) { 431cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 432cd0c2139SMatthew G Knepley } 433cd0c2139SMatthew G Knepley if (leafLocal[l] >= cEnd) break; 434cd0c2139SMatthew G Knepley if (leafRemote[l].rank == rank) { 435cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 436cd0c2139SMatthew G Knepley } else { 437cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr); 438cd0c2139SMatthew G Knepley } 439cd0c2139SMatthew G Knepley } 440cd0c2139SMatthew G Knepley for (; c < cEnd; ++c) { 441cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 442cd0c2139SMatthew G Knepley } 443cd0c2139SMatthew G Knepley if (0) { 444cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 445cd0c2139SMatthew G Knepley ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 446cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 447cd0c2139SMatthew G Knepley } 448cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr); 449cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 450cd0c2139SMatthew G Knepley PetscInt numCells; 451cd0c2139SMatthew G Knepley 452cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr); 453cd0c2139SMatthew G Knepley if (numCells < 2) { 454cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr); 455cd0c2139SMatthew G Knepley } else { 456cd0c2139SMatthew G Knepley const PetscInt *cells = NULL; 457cd0c2139SMatthew G Knepley PetscInt vA, vB; 458cd0c2139SMatthew G Knepley 459cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr); 460cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr); 461cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr); 462cd0c2139SMatthew G Knepley if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);} 463cd0c2139SMatthew G Knepley } 464cd0c2139SMatthew G Knepley } 465cd0c2139SMatthew G Knepley if (0) { 466cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 467cd0c2139SMatthew G Knepley ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 468cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 469cd0c2139SMatthew G Knepley } 470cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 471cd0c2139SMatthew G Knepley } 472cd0c2139SMatthew G Knepley 473cd0c2139SMatthew G Knepley #undef __FUNCT__ 474cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal" 475cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm) 476cd0c2139SMatthew G Knepley { 477da97024aSMatthew G. Knepley PetscSF sf; 478cd0c2139SMatthew G Knepley IS valueIS; 479da97024aSMatthew G. Knepley const PetscInt *values, *leaves; 480cd0c2139SMatthew G Knepley PetscInt *depthShift; 481da97024aSMatthew G. Knepley PetscInt depth = 0, nleaves, loc, Ng, numFS, fs, fStart, fEnd, ghostCell, cEnd, c; 482cd0c2139SMatthew G Knepley PetscErrorCode ierr; 483cd0c2139SMatthew G Knepley 484cd0c2139SMatthew G Knepley PetscFunctionBegin; 485da97024aSMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 486da97024aSMatthew G. Knepley ierr = PetscSFGetGraph(sf, NULL, &nleaves, &leaves, NULL);CHKERRQ(ierr); 487da97024aSMatthew G. Knepley nleaves = PetscMax(0, nleaves); 48846c796b9SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 489cd0c2139SMatthew G Knepley /* Count ghost cells */ 490cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 491cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr); 492cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 4934a6cfa73SMatthew G. Knepley Ng = 0; 494cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 49546c796b9SMatthew G. Knepley IS faceIS; 49646c796b9SMatthew G. Knepley const PetscInt *faces; 49746c796b9SMatthew G. Knepley PetscInt numFaces, f, numBdFaces = 0; 498cd0c2139SMatthew G Knepley 49946c796b9SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 50046c796b9SMatthew G. Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 50146c796b9SMatthew G. Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 50246c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 503da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 504da97024aSMatthew G. Knepley if (loc >= 0) continue; 50546c796b9SMatthew G. Knepley if ((faces[f] >= fStart) && (faces[f] < fEnd)) ++numBdFaces; 50646c796b9SMatthew G. Knepley } 5074a6cfa73SMatthew G. Knepley Ng += numBdFaces; 50846c796b9SMatthew G. Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 509cd0c2139SMatthew G Knepley } 510cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 511854ce69bSBarry Smith ierr = PetscMalloc1(depth+1, &depthShift);CHKERRQ(ierr); 512cd0c2139SMatthew G Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 5134a6cfa73SMatthew G. Knepley if (depth >= 0) depthShift[depth] = Ng; 514cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 515cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 516cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 5175acea1aeSMatthew G. Knepley ierr = DMPlexSetHybridBounds(gdm, cEnd, PETSC_DETERMINE, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 5184a6cfa73SMatthew G. Knepley for (c = cEnd; c < cEnd + Ng; ++c) { 519cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr); 520cd0c2139SMatthew G Knepley } 521cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 522cd0c2139SMatthew G Knepley IS faceIS; 523cd0c2139SMatthew G Knepley const PetscInt *faces; 524cd0c2139SMatthew G Knepley PetscInt numFaces, f; 525cd0c2139SMatthew G Knepley 526cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 527cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 528cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 529cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 530cd0c2139SMatthew G Knepley PetscInt size; 531cd0c2139SMatthew G Knepley 532da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 533da97024aSMatthew G. Knepley if (loc >= 0) continue; 53446c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 535cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr); 536cd0c2139SMatthew 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); 5374a6cfa73SMatthew G. Knepley ierr = DMPlexSetSupportSize(gdm, faces[f] + Ng, 2);CHKERRQ(ierr); 538cd0c2139SMatthew G Knepley } 539cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 540cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 541cd0c2139SMatthew G Knepley } 542cd0c2139SMatthew G Knepley /* Step 4: Setup ghosted DM */ 543cd0c2139SMatthew G Knepley ierr = DMSetUp(gdm);CHKERRQ(ierr); 544cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 545cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 546cd0c2139SMatthew G Knepley ghostCell = cEnd; 547cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 548cd0c2139SMatthew G Knepley IS faceIS; 549cd0c2139SMatthew G Knepley const PetscInt *faces; 550cd0c2139SMatthew G Knepley PetscInt numFaces, f; 551cd0c2139SMatthew G Knepley 552cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 553cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 554cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 55546c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 5564a6cfa73SMatthew G. Knepley PetscInt newFace = faces[f] + Ng; 557cd0c2139SMatthew G Knepley 558da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 559da97024aSMatthew G. Knepley if (loc >= 0) continue; 56046c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 561cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr); 562cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr); 56346c796b9SMatthew G. Knepley ++ghostCell; 564cd0c2139SMatthew G Knepley } 565cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 566cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 567cd0c2139SMatthew G Knepley } 568cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 569cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 570cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 571cd0c2139SMatthew G Knepley ierr = DMPlexStratify(gdm);CHKERRQ(ierr); 572cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 573cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 574cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 575cd0c2139SMatthew G Knepley ierr = PetscFree(depthShift);CHKERRQ(ierr); 576966c7b3fSMatthew G. Knepley /* Step 7: Periodicity */ 577966c7b3fSMatthew G. Knepley if (dm->maxCell) { 578966c7b3fSMatthew G. Knepley const PetscReal *maxCell, *L; 579966c7b3fSMatthew G. Knepley ierr = DMGetPeriodicity(dm, &maxCell, &L);CHKERRQ(ierr); 580966c7b3fSMatthew G. Knepley ierr = DMSetPeriodicity(gdm, maxCell, L);CHKERRQ(ierr); 581966c7b3fSMatthew G. Knepley } 5824a6cfa73SMatthew G. Knepley if (numGhostCells) *numGhostCells = Ng; 583cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 584cd0c2139SMatthew G Knepley } 585cd0c2139SMatthew G Knepley 586cd0c2139SMatthew G Knepley #undef __FUNCT__ 587cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells" 588cd0c2139SMatthew G Knepley /*@C 589cd0c2139SMatthew G Knepley DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face 590cd0c2139SMatthew G Knepley 591cd0c2139SMatthew G Knepley Collective on dm 592cd0c2139SMatthew G Knepley 593cd0c2139SMatthew G Knepley Input Parameters: 594cd0c2139SMatthew G Knepley + dm - The original DM 595cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL 596cd0c2139SMatthew G Knepley 597cd0c2139SMatthew G Knepley Output Parameters: 598cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM 599cd0c2139SMatthew G Knepley - dmGhosted - The new DM 600cd0c2139SMatthew G Knepley 601cd0c2139SMatthew G Knepley Note: If no label exists of that name, one will be created marking all boundary faces 602cd0c2139SMatthew G Knepley 603cd0c2139SMatthew G Knepley Level: developer 604cd0c2139SMatthew G Knepley 605cd0c2139SMatthew G Knepley .seealso: DMCreate() 60631266bc0SMatthew G. Knepley @*/ 607cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted) 608cd0c2139SMatthew G Knepley { 609cd0c2139SMatthew G Knepley DM gdm; 610cd0c2139SMatthew G Knepley DMLabel label; 611cd0c2139SMatthew G Knepley const char *name = labelName ? labelName : "Face Sets"; 612cd0c2139SMatthew G Knepley PetscInt dim; 613a42b08eeSMatthew G. Knepley PetscBool flag; 614cd0c2139SMatthew G Knepley PetscErrorCode ierr; 615cd0c2139SMatthew G Knepley 616cd0c2139SMatthew G Knepley PetscFunctionBegin; 617cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6184a6cfa73SMatthew G. Knepley if (numGhostCells) PetscValidPointer(numGhostCells, 3); 619cd0c2139SMatthew G Knepley PetscValidPointer(dmGhosted, 4); 620cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr); 621cd0c2139SMatthew G Knepley ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr); 622c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 623c73cfb54SMatthew G. Knepley ierr = DMSetDimension(gdm, dim);CHKERRQ(ierr); 624a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseCone(dm, &flag);CHKERRQ(ierr); 625a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseCone(gdm, flag);CHKERRQ(ierr); 626a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseClosure(dm, &flag);CHKERRQ(ierr); 627a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseClosure(gdm, flag);CHKERRQ(ierr); 628cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 629cd0c2139SMatthew G Knepley if (!label) { 630cd0c2139SMatthew G Knepley /* Get label for boundary faces */ 631cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr); 632cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 633cd0c2139SMatthew G Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 634cd0c2139SMatthew G Knepley } 635cd0c2139SMatthew G Knepley ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr); 6368e136ac0SMatthew G. Knepley ierr = DMPlexCopyBoundary(dm, gdm);CHKERRQ(ierr); 637cd0c2139SMatthew G Knepley *dmGhosted = gdm; 638cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 639cd0c2139SMatthew G Knepley } 640cd0c2139SMatthew G Knepley 641cd0c2139SMatthew G Knepley #undef __FUNCT__ 642cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal" 643607ab7a9SMatthew G. Knepley /* 644faedd622SMatthew G. Knepley We are adding three kinds of points here: 645607ab7a9SMatthew G. Knepley Replicated: Copies of points which exist in the mesh, such as vertices identified across a fault 646faedd622SMatthew G. Knepley Non-replicated: Points which exist on the fault, but are not replicated 647607ab7a9SMatthew G. Knepley Hybrid: Entirely new points, such as cohesive cells 648a6ae58d1SMatthew G. Knepley 649a6ae58d1SMatthew G. Knepley When creating subsequent cohesive cells, we shift the old hybrid cells to the end of the numbering at 650a6ae58d1SMatthew G. Knepley each depth so that the new split/hybrid points can be inserted as a block. 651607ab7a9SMatthew G. Knepley */ 652cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm) 653cd0c2139SMatthew G Knepley { 654cd0c2139SMatthew G Knepley MPI_Comm comm; 655607ab7a9SMatthew G. Knepley IS valueIS; 656607ab7a9SMatthew G. Knepley PetscInt numSP = 0; /* The number of depths for which we have replicated points */ 657607ab7a9SMatthew G. Knepley const PetscInt *values; /* List of depths for which we have replicated points */ 65818c5995bSMatthew G. Knepley IS *splitIS; 65918c5995bSMatthew G. Knepley IS *unsplitIS; 660607ab7a9SMatthew G. Knepley PetscInt *numSplitPoints; /* The number of replicated points at each depth */ 66118c5995bSMatthew G. Knepley PetscInt *numUnsplitPoints; /* The number of non-replicated points at each depth which still give rise to hybrid points */ 66236dbac82SMatthew G. Knepley PetscInt *numHybridPoints; /* The number of new hybrid points at each depth */ 66336dbac82SMatthew G. Knepley PetscInt *numHybridPointsOld; /* The number of existing hybrid points at each depth */ 664607ab7a9SMatthew G. Knepley const PetscInt **splitPoints; /* Replicated points for each depth */ 66518c5995bSMatthew G. Knepley const PetscInt **unsplitPoints; /* Non-replicated points for each depth */ 666cd0c2139SMatthew G Knepley PetscSection coordSection; 667cd0c2139SMatthew G Knepley Vec coordinates; 668cd0c2139SMatthew G Knepley PetscScalar *coords; 669607ab7a9SMatthew G. Knepley PetscInt depths[4]; /* Depths in the order that plex points are numbered */ 670a6ae58d1SMatthew G. Knepley PetscInt *depthMax; /* The first hybrid point at each depth in the original mesh */ 671a6ae58d1SMatthew G. Knepley PetscInt *depthEnd; /* The point limit at each depth in the original mesh */ 672607ab7a9SMatthew G. Knepley PetscInt *depthShift; /* Number of replicated+hybrid points at each depth */ 673607ab7a9SMatthew G. Knepley PetscInt *depthOffset; /* Prefix sums of depthShift */ 674607ab7a9SMatthew G. Knepley PetscInt *pMaxNew; /* The first replicated point at each depth in the new mesh, hybrids come after this */ 675607ab7a9SMatthew G. Knepley PetscInt *coneNew, *coneONew, *supportNew; 67618c5995bSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v; 677cd0c2139SMatthew G Knepley PetscErrorCode ierr; 678cd0c2139SMatthew G Knepley 679cd0c2139SMatthew G Knepley PetscFunctionBegin; 680cd0c2139SMatthew G Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 681c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 682607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 683fd4b9f15SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 684607ab7a9SMatthew G. Knepley depths[0] = depth; 685607ab7a9SMatthew G. Knepley depths[1] = 0; 686607ab7a9SMatthew G. Knepley depths[2] = depth-1; 687607ab7a9SMatthew G. Knepley depths[3] = 1; 688cd0c2139SMatthew G Knepley /* Count split points and add cohesive cells */ 689607ab7a9SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 6902203a8e9SMatthew G. Knepley ierr = PetscMalloc6(depth+1,&depthMax,depth+1,&depthEnd,depth+1,&depthShift,depth+1,&depthOffset,depth+1,&pMaxNew,depth+1,&numHybridPointsOld);CHKERRQ(ierr); 691dcca6d9dSJed 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); 692607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 693607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthOffset, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 694a6ae58d1SMatthew 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); 695607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 696607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 697a6ae58d1SMatthew G. Knepley depthEnd[d] = pMaxNew[d]; 698a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 699607ab7a9SMatthew G. Knepley numSplitPoints[d] = 0; 70018c5995bSMatthew G. Knepley numUnsplitPoints[d] = 0; 701607ab7a9SMatthew G. Knepley numHybridPoints[d] = 0; 702a6ae58d1SMatthew G. Knepley numHybridPointsOld[d] = depthMax[d] < 0 ? 0 : depthEnd[d] - depthMax[d]; 703607ab7a9SMatthew G. Knepley splitPoints[d] = NULL; 70418c5995bSMatthew G. Knepley unsplitPoints[d] = NULL; 70518c5995bSMatthew G. Knepley splitIS[d] = NULL; 70618c5995bSMatthew G. Knepley unsplitIS[d] = NULL; 707607ab7a9SMatthew G. Knepley } 708cd0c2139SMatthew G Knepley if (label) { 709cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 710cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 711cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 712cd0c2139SMatthew G Knepley } 713cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 714cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 715cd0c2139SMatthew G Knepley 716cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 71718c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr); 71818c5995bSMatthew G. Knepley if (splitIS[dep]) { 71918c5995bSMatthew G. Knepley ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 72018c5995bSMatthew G. Knepley ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 72118c5995bSMatthew G. Knepley } 72218c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr); 72318c5995bSMatthew G. Knepley if (unsplitIS[dep]) { 72418c5995bSMatthew G. Knepley ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr); 72518c5995bSMatthew G. Knepley ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr); 726cd0c2139SMatthew G Knepley } 727cd0c2139SMatthew G Knepley } 728607ab7a9SMatthew G. Knepley /* Calculate number of hybrid points */ 72918c5995bSMatthew 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 */ 730607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) depthShift[d] = numSplitPoints[d] + numHybridPoints[d]; 731607ab7a9SMatthew G. Knepley for (d = 1; d <= depth; ++d) depthOffset[depths[d]] = depthOffset[depths[d-1]] + depthShift[depths[d-1]]; 732a6ae58d1SMatthew G. Knepley for (d = 0; d <= depth; ++d) pMaxNew[d] += depthOffset[d] - numHybridPointsOld[d]; 733cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 734cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 735cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 736cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 737cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 738a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 7394c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 740cd0c2139SMatthew G Knepley const PetscInt *support; 7414c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, qf, qn, qp, e; 742cd0c2139SMatthew G Knepley 743cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 744cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 745cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 746cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 747cd0c2139SMatthew G Knepley if (dep == depth-1) { 7484c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 7494c367dbcSMatthew G. Knepley 750cd0c2139SMatthew G Knepley /* Add cohesive cells, they are prisms */ 7514c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr); 752cd0c2139SMatthew G Knepley } else if (dep == 0) { 7534c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 754cd0c2139SMatthew G Knepley 755cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 7564c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 757cd0c2139SMatthew G Knepley PetscInt val; 758cd0c2139SMatthew G Knepley 759cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 7604c367dbcSMatthew G. Knepley if (val == 1) ++qf; 7614c367dbcSMatthew G. Knepley if ((val == 1) || (val == (shift + 1))) ++qn; 7624c367dbcSMatthew G. Knepley if ((val == 1) || (val == -(shift + 1))) ++qp; 763cd0c2139SMatthew G Knepley } 7644c367dbcSMatthew G. Knepley /* Split old vertex: Edges into original vertex and new cohesive edge */ 7654c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 7664c367dbcSMatthew G. Knepley /* Split new vertex: Edges into split vertex and new cohesive edge */ 7674c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 7684c367dbcSMatthew G. Knepley /* Add hybrid edge */ 7694c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 7704c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 771cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 7724c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 7734c367dbcSMatthew G. Knepley 774cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 7754c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 776cd0c2139SMatthew G Knepley PetscInt val; 777cd0c2139SMatthew G Knepley 778cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 7794c367dbcSMatthew G. Knepley if (val == dim-1) ++qf; 7804c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 7814c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 782cd0c2139SMatthew G Knepley } 7834c367dbcSMatthew G. Knepley /* Split old edge: Faces into original edge and cohesive face (positive side?) */ 7844c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 7854c367dbcSMatthew G. Knepley /* Split new edge: Faces into split edge and cohesive face (negative side?) */ 7864c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 7874c367dbcSMatthew G. Knepley /* Add hybrid face */ 7884c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 7894c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 790cd0c2139SMatthew G Knepley } 791cd0c2139SMatthew G Knepley } 792cd0c2139SMatthew G Knepley } 79318c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 79418c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 79518c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 796a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 79718c5995bSMatthew G. Knepley const PetscInt *support; 798da1dd7e4SMatthew G. Knepley PetscInt coneSize, supportSize, qf, e, s; 79918c5995bSMatthew G. Knepley 80018c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 80118c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 80239254ff6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 80318c5995bSMatthew G. Knepley if (dep == 0) { 80418c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 80518c5995bSMatthew G. Knepley 80639254ff6SMatthew G. Knepley /* Unsplit vertex: Edges into original vertex, split edges, and new cohesive edge twice */ 80739254ff6SMatthew G. Knepley for (s = 0, qf = 0; s < supportSize; ++s, ++qf) { 80839254ff6SMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 80939254ff6SMatthew G. Knepley if (e >= 0) ++qf; 81039254ff6SMatthew G. Knepley } 81139254ff6SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 81218c5995bSMatthew G. Knepley /* Add hybrid edge */ 81318c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 814e1757548SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 815e1757548SMatthew G. Knepley PetscInt val; 816e1757548SMatthew G. Knepley 817e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 818e1757548SMatthew G. Knepley /* Split and unsplit edges produce hybrid faces */ 819da1dd7e4SMatthew G. Knepley if (val == 1) ++qf; 820da1dd7e4SMatthew G. Knepley if (val == (shift2 + 1)) ++qf; 821e1757548SMatthew G. Knepley } 822e1757548SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 82318c5995bSMatthew G. Knepley } else if (dep == dim-2) { 82418c5995bSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 825cd0c2139SMatthew G Knepley PetscInt val; 826cd0c2139SMatthew G Knepley 827da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 828cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 829da1dd7e4SMatthew G. Knepley if (val == dim-1) qf += 2; 830da1dd7e4SMatthew G. Knepley else ++qf; 831cd0c2139SMatthew G Knepley } 83218c5995bSMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */ 833da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 83418c5995bSMatthew G. Knepley /* Add hybrid face */ 835da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 836da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 837da1dd7e4SMatthew G. Knepley if (val == dim-1) ++qf; 838da1dd7e4SMatthew G. Knepley } 83918c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 840da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 841cd0c2139SMatthew G Knepley } 842cd0c2139SMatthew G Knepley } 843cd0c2139SMatthew G Knepley } 844cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 845cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 846cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 847dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 848dcca6d9dSJed Brown ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),&supportNew);CHKERRQ(ierr); 849cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 850cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 851cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 852cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 853a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 8544c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 855cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 8564c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, q, qf, qn, qp, v, e, s; 857cd0c2139SMatthew G Knepley 858cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 859cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 860cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 861cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 862cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 863cd0c2139SMatthew G Knepley if (dep == depth-1) { 86496a07cd0SMatthew G. Knepley PetscBool hasUnsplit = PETSC_FALSE; 8654c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 866cd0c2139SMatthew G Knepley const PetscInt *supportF; 867cd0c2139SMatthew G Knepley 868cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 869cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 870cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 871cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 872cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 873cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 8744c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 87518c5995bSMatthew G. Knepley if (v < 0) { 87618c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 87718c5995bSMatthew 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); 878a6ae58d1SMatthew G. Knepley coneNew[2+q] = DMPlexShiftPoint_Internal(cone[q], depth, depthMax, depthEnd, depthShift) /*cone[q] + depthOffset[dep-1]*/; 87996a07cd0SMatthew G. Knepley hasUnsplit = PETSC_TRUE; 88018c5995bSMatthew G. Knepley } else { 8814c367dbcSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep-1]; 882163235baSMatthew G. Knepley if (dep > 1) { 883163235baSMatthew G. Knepley const PetscInt *econe; 884163235baSMatthew G. Knepley PetscInt econeSize, r, vs, vu; 885163235baSMatthew G. Knepley 886163235baSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[q], &econeSize);CHKERRQ(ierr); 887163235baSMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[q], &econe);CHKERRQ(ierr); 888163235baSMatthew G. Knepley for (r = 0; r < econeSize; ++r) { 889163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numSplitPoints[dep-2], splitPoints[dep-2], &vs);CHKERRQ(ierr); 890163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numUnsplitPoints[dep-2], unsplitPoints[dep-2], &vu);CHKERRQ(ierr); 891163235baSMatthew G. Knepley if (vs >= 0) continue; 892163235baSMatthew 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); 893163235baSMatthew G. Knepley hasUnsplit = PETSC_TRUE; 894163235baSMatthew G. Knepley } 895163235baSMatthew G. Knepley } 896cd0c2139SMatthew G Knepley } 897cd0c2139SMatthew G Knepley } 898cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 899cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 900e537020bSMatthew G. Knepley /* Face support */ 901cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 902cd0c2139SMatthew G Knepley PetscInt val; 903cd0c2139SMatthew G Knepley 904cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 905cd0c2139SMatthew G Knepley if (val < 0) { 906cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 9074c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr); 908cd0c2139SMatthew G Knepley } else { 909cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 9104c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr); 911e537020bSMatthew G. Knepley /* Get orientation for cohesive face */ 912e537020bSMatthew G. Knepley { 913e537020bSMatthew G. Knepley const PetscInt *ncone, *nconeO; 914e537020bSMatthew G. Knepley PetscInt nconeSize, nc; 915e537020bSMatthew G. Knepley 916e537020bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 917e537020bSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 918e537020bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 919e537020bSMatthew G. Knepley for (nc = 0; nc < nconeSize; ++nc) { 920e537020bSMatthew G. Knepley if (ncone[nc] == oldp) { 921e537020bSMatthew G. Knepley coneONew[0] = nconeO[nc]; 922e537020bSMatthew G. Knepley break; 923cd0c2139SMatthew G Knepley } 924cd0c2139SMatthew G Knepley } 925e537020bSMatthew 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]); 926e537020bSMatthew G. Knepley } 927e537020bSMatthew G. Knepley } 928e537020bSMatthew G. Knepley } 9294c367dbcSMatthew G. Knepley /* Cohesive cell: Old and new split face, then new cohesive faces */ 930fd4b9f15SMatthew G. Knepley coneNew[0] = newp; /* Extracted negative side orientation above */ 9314c367dbcSMatthew G. Knepley coneNew[1] = splitp; 9324c367dbcSMatthew G. Knepley coneONew[1] = coneONew[0]; 933e537020bSMatthew G. Knepley for (q = 0; q < coneSize; ++q) { 93418c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 93518c5995bSMatthew G. Knepley if (v < 0) { 93618c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 93718c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 93818c5995bSMatthew G. Knepley coneONew[2+q] = 0; 93918c5995bSMatthew G. Knepley } else { 94018c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep]; 94118c5995bSMatthew G. Knepley } 942e537020bSMatthew G. Knepley coneONew[2+q] = 0; 943e537020bSMatthew G. Knepley } 9444c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr); 9454c367dbcSMatthew G. Knepley ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr); 94696a07cd0SMatthew G. Knepley /* Label the hybrid cells on the boundary of the split */ 94796a07cd0SMatthew G. Knepley if (hasUnsplit) {ierr = DMLabelSetValue(label, -hybcell, dim);CHKERRQ(ierr);} 948cd0c2139SMatthew G Knepley } else if (dep == 0) { 9494c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 950cd0c2139SMatthew G Knepley 951cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 9524c367dbcSMatthew G. Knepley for (e = 0, qn = 0; e < supportSize; ++e) { 953cd0c2139SMatthew G Knepley PetscInt val; 954cd0c2139SMatthew G Knepley 955cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 956cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 957a6ae58d1SMatthew G. Knepley supportNew[qn++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 958cd0c2139SMatthew G Knepley } 959cd0c2139SMatthew G Knepley } 9604c367dbcSMatthew G. Knepley supportNew[qn] = hybedge; 961cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 962cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 9634c367dbcSMatthew G. Knepley for (e = 0, qp = 0; e < supportSize; ++e) { 964cd0c2139SMatthew G Knepley PetscInt val, edge; 965cd0c2139SMatthew G Knepley 966cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 967cd0c2139SMatthew G Knepley if (val == 1) { 9684c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 969cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 9704c367dbcSMatthew G. Knepley supportNew[qp++] = edge + pMaxNew[dep+1]; 971cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 972a6ae58d1SMatthew G. Knepley supportNew[qp++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 973cd0c2139SMatthew G Knepley } 974cd0c2139SMatthew G Knepley } 9754c367dbcSMatthew G. Knepley supportNew[qp] = hybedge; 976cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 9774c367dbcSMatthew G. Knepley /* Hybrid edge: Old and new split vertex */ 978cd0c2139SMatthew G Knepley coneNew[0] = newp; 979cd0c2139SMatthew G Knepley coneNew[1] = splitp; 9804c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 9814c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 9824c367dbcSMatthew G. Knepley PetscInt val, edge; 9834c367dbcSMatthew G. Knepley 9844c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 9854c367dbcSMatthew G. Knepley if (val == 1) { 9864c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 9874c367dbcSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 9884c367dbcSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 9894c367dbcSMatthew G. Knepley } 9904c367dbcSMatthew G. Knepley } 9914c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 992cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 9934c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 9944c367dbcSMatthew G. Knepley 995cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 996cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 997cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 9984c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 999e1757548SMatthew G. Knepley if (v < 0) { 1000e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1001e1757548SMatthew 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); 1002a6ae58d1SMatthew G. Knepley coneNew[q] = DMPlexShiftPoint_Internal(cone[q], depth, depthMax, depthEnd, depthShift) /*cone[q] + depthOffset[dep-1]*/; 1003e1757548SMatthew G. Knepley } else { 10044c367dbcSMatthew G. Knepley coneNew[q] = v + pMaxNew[dep-1]; 1005cd0c2139SMatthew G Knepley } 1006e1757548SMatthew G. Knepley } 1007cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 1008cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 1009cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 1010cd0c2139SMatthew G Knepley PetscInt val; 1011cd0c2139SMatthew G Knepley 1012cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 10134c367dbcSMatthew G. Knepley if (val == dim-1) { 1014a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 10154c367dbcSMatthew G. Knepley } else if (val == (shift + dim-1)) { 1016a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 1017cd0c2139SMatthew G Knepley } 1018cd0c2139SMatthew G Knepley } 1019b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1020cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1021cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 1022cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 1023cd0c2139SMatthew G Knepley PetscInt val, face; 1024cd0c2139SMatthew G Knepley 1025cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1026cd0c2139SMatthew G Knepley if (val == dim-1) { 10274c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1028cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 10294c367dbcSMatthew G. Knepley supportNew[q++] = face + pMaxNew[dep+1]; 1030cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 1031a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 1032cd0c2139SMatthew G Knepley } 1033cd0c2139SMatthew G Knepley } 1034b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1035cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 10364c367dbcSMatthew G. Knepley /* Hybrid face */ 10374c367dbcSMatthew G. Knepley coneNew[0] = newp; 10384c367dbcSMatthew G. Knepley coneNew[1] = splitp; 10394c367dbcSMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 10404c367dbcSMatthew G. Knepley PetscInt vertex; 10414c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr); 1042e1757548SMatthew G. Knepley if (vertex < 0) { 1043e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr); 1044e1757548SMatthew 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); 1045e1757548SMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1046e1757548SMatthew G. Knepley } else { 10474c367dbcSMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep]; 10484c367dbcSMatthew G. Knepley } 1049e1757548SMatthew G. Knepley } 10504c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 10514c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 10524c367dbcSMatthew G. Knepley PetscInt val, face; 10534c367dbcSMatthew G. Knepley 10544c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 10554c367dbcSMatthew G. Knepley if (val == dim-1) { 10564c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 10574c367dbcSMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 10584c367dbcSMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 10594c367dbcSMatthew G. Knepley } 10604c367dbcSMatthew G. Knepley } 10614c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1062cd0c2139SMatthew G Knepley } 1063cd0c2139SMatthew G Knepley } 1064cd0c2139SMatthew G Knepley } 106518c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 106618c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 106718c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 1068a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 106918c5995bSMatthew G. Knepley const PetscInt *cone, *support, *ornt; 1070e1757548SMatthew G. Knepley PetscInt coneSize, supportSize, supportSizeNew, q, qf, e, f, s; 107118c5995bSMatthew G. Knepley 107218c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 107318c5995bSMatthew G. Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 107418c5995bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 107518c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 107618c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 107718c5995bSMatthew G. Knepley if (dep == 0) { 107818c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 107918c5995bSMatthew G. Knepley 108018c5995bSMatthew G. Knepley /* Unsplit vertex */ 108118c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 108218c5995bSMatthew G. Knepley for (s = 0, q = 0; s < supportSize; ++s) { 1083a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[s], depth, depthMax, depthEnd, depthShift) /*support[s] + depthOffset[dep+1]*/; 108418c5995bSMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 108518c5995bSMatthew G. Knepley if (e >= 0) { 108618c5995bSMatthew G. Knepley supportNew[q++] = e + pMaxNew[dep+1]; 108718c5995bSMatthew G. Knepley } 108818c5995bSMatthew G. Knepley } 108918c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 109018c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 109118c5995bSMatthew G. Knepley if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp); 109218c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 109318c5995bSMatthew G. Knepley /* Hybrid edge */ 109418c5995bSMatthew G. Knepley coneNew[0] = newp; 109518c5995bSMatthew G. Knepley coneNew[1] = newp; 109618c5995bSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 109718c5995bSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 109818c5995bSMatthew G. Knepley PetscInt val, edge; 109918c5995bSMatthew G. Knepley 110018c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 110118c5995bSMatthew G. Knepley if (val == 1) { 110218c5995bSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 110318c5995bSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 110418c5995bSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1105e1757548SMatthew G. Knepley } else if (val == (shift2 + 1)) { 1106e1757548SMatthew G. Knepley ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr); 1107e1757548SMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]); 1108e1757548SMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1]; 110918c5995bSMatthew G. Knepley } 111018c5995bSMatthew G. Knepley } 111118c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1112e1757548SMatthew G. Knepley } else if (dep == dim-2) { 1113e1757548SMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 1114e1757548SMatthew G. Knepley 1115da1dd7e4SMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and hybrid face twice */ 1116e1757548SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1117e1757548SMatthew G. Knepley PetscInt val, face; 1118e1757548SMatthew G. Knepley 1119e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1120e1757548SMatthew G. Knepley if (val == dim-1) { 1121e1757548SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1122e1757548SMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]); 1123a6ae58d1SMatthew G. Knepley supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthMax, depthEnd, depthShift) /*support[f] + depthOffset[dep+1]*/; 1124e1757548SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+1]; 1125e1757548SMatthew G. Knepley } else { 1126a6ae58d1SMatthew G. Knepley supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthMax, depthEnd, depthShift) /*support[f] + depthOffset[dep+1]*/; 1127e1757548SMatthew G. Knepley } 1128e1757548SMatthew G. Knepley } 1129e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1130e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1131da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 1132da1dd7e4SMatthew 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); 1133e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1134e1757548SMatthew G. Knepley /* Add hybrid face */ 1135e1757548SMatthew G. Knepley coneNew[0] = newp; 1136212cc919SMatthew G. Knepley coneNew[1] = newp; 1137e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[0], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1138e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[0]); 1139212cc919SMatthew G. Knepley coneNew[2] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1140e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1141e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]); 1142e1757548SMatthew G. Knepley coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1143e1757548SMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 1144da1dd7e4SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1145da1dd7e4SMatthew G. Knepley PetscInt val, face; 1146da1dd7e4SMatthew G. Knepley 1147da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1148da1dd7e4SMatthew G. Knepley if (val == dim-1) { 1149da1dd7e4SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1150da1dd7e4SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1151da1dd7e4SMatthew G. Knepley } 1152da1dd7e4SMatthew G. Knepley } 1153da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, hybface, &supportSizeNew);CHKERRQ(ierr); 1154da1dd7e4SMatthew 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); 1155e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1156cd0c2139SMatthew G Knepley } 1157cd0c2139SMatthew G Knepley } 1158cd0c2139SMatthew G Knepley } 1159cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 1160cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1161cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 1162cd0c2139SMatthew G Knepley IS pIS; 1163cd0c2139SMatthew G Knepley PetscInt numPoints; 1164cd0c2139SMatthew G Knepley const PetscInt *points; 1165cd0c2139SMatthew G Knepley 1166cd0c2139SMatthew G Knepley if (dep >= 0) continue; 1167cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 1168cd0c2139SMatthew G Knepley if (!pIS) continue; 1169cd0c2139SMatthew G Knepley dep = -dep - shift; 1170cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 1171cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 1172cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1173cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 1174a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*depthOffset[dep] + oldp*/; 1175cd0c2139SMatthew G Knepley const PetscInt *cone; 1176cd0c2139SMatthew G Knepley PetscInt coneSize, c; 117750cf782dSMatthew G. Knepley /* PetscBool replaced = PETSC_FALSE; */ 1178cd0c2139SMatthew G Knepley 1179cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 1180cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 1181cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 1182cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 1183cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1184cd0c2139SMatthew G Knepley const PetscInt coldp = cone[c] - depthOffset[dep-1]; 1185cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 1186cd0c2139SMatthew G Knepley 1187cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 1188cd0c2139SMatthew G Knepley if (val == dep-1) { 1189cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 1190cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 1191cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 1192cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 119350cf782dSMatthew G. Knepley /* replaced = PETSC_TRUE; */ 1194cd0c2139SMatthew G Knepley } 1195cd0c2139SMatthew G Knepley } 11964a189a86SMatthew G. Knepley /* Cells with only a vertex or edge on the submesh have no replacement */ 11974a189a86SMatthew G. Knepley /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 1198cd0c2139SMatthew G Knepley } 1199cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 1200cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 1201cd0c2139SMatthew G Knepley } 1202cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 1203cd0c2139SMatthew G Knepley ierr = DMPlexStratify(sdm);CHKERRQ(ierr); 1204cd0c2139SMatthew G Knepley /* Step 8: Coordinates */ 1205cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 120669d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 1207cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 1208cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 1209cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 1210a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[0][v], depth, depthMax, depthEnd, depthShift) /*depthOffset[0] + splitPoints[0][v]*/; 1211cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 1212cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 1213cd0c2139SMatthew G Knepley 1214cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 1215cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 1216cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 1217cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 1218cd0c2139SMatthew G Knepley } 1219cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 1220cd0c2139SMatthew G Knepley /* Step 9: SF, if I can figure this out we can split the mesh in parallel */ 1221cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1222cd0c2139SMatthew G Knepley /* Step 10: Labels */ 1223cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1224cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 1225cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1226cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 1227a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[dep][p], depth, depthMax, depthEnd, depthShift) /*depthOffset[dep] + splitPoints[dep][p]*/; 1228cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 1229cd0c2139SMatthew G Knepley PetscInt l; 1230cd0c2139SMatthew G Knepley 1231cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 1232cd0c2139SMatthew G Knepley DMLabel mlabel; 1233cd0c2139SMatthew G Knepley const char *lname; 1234cd0c2139SMatthew G Knepley PetscInt val; 12359a356370SMatthew G. Knepley PetscBool isDepth; 1236cd0c2139SMatthew G Knepley 1237cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 12389a356370SMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 12399a356370SMatthew G. Knepley if (isDepth) continue; 1240cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 1241cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 1242cd0c2139SMatthew G Knepley if (val >= 0) { 1243cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 12449a356370SMatthew G. Knepley #if 0 12459a356370SMatthew G. Knepley /* Do not put cohesive edges into the label */ 1246cd0c2139SMatthew G Knepley if (dep == 0) { 12474c367dbcSMatthew G. Knepley const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1248cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr); 12494c367dbcSMatthew G. Knepley } else if (dep == dim-2) { 12504c367dbcSMatthew G. Knepley const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 12514c367dbcSMatthew G. Knepley ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr); 1252cd0c2139SMatthew G Knepley } 12534c367dbcSMatthew G. Knepley /* Do not put cohesive faces into the label */ 12549a356370SMatthew G. Knepley #endif 1255cd0c2139SMatthew G Knepley } 1256cd0c2139SMatthew G Knepley } 1257cd0c2139SMatthew G Knepley } 1258cd0c2139SMatthew G Knepley } 1259cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1260cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 1261cd0c2139SMatthew G Knepley 1262cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 126318c5995bSMatthew G. Knepley if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 126418c5995bSMatthew G. Knepley ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr); 126518c5995bSMatthew G. Knepley if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);} 126618c5995bSMatthew G. Knepley ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr); 1267cd0c2139SMatthew G Knepley } 1268cd0c2139SMatthew G Knepley if (label) { 1269cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1270cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1271cd0c2139SMatthew G Knepley } 12720d4d4d06SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 12730d4d4d06SMatthew G. Knepley ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr); 127436dbac82SMatthew G. Knepley pMaxNew[d] = pEnd - numHybridPoints[d] - numHybridPointsOld[d]; 12750d4d4d06SMatthew G. Knepley } 12760e49e2e2SMatthew 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); 1277dcbb62e8SMatthew G. Knepley ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr); 1278a6ae58d1SMatthew G. Knepley ierr = PetscFree6(depthMax, depthEnd, depthShift, depthOffset, pMaxNew, numHybridPointsOld);CHKERRQ(ierr); 127918c5995bSMatthew G. Knepley ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr); 1280cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1281cd0c2139SMatthew G Knepley } 1282cd0c2139SMatthew G Knepley 1283cd0c2139SMatthew G Knepley #undef __FUNCT__ 1284cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells" 1285cd0c2139SMatthew G Knepley /*@C 1286cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 1287cd0c2139SMatthew G Knepley 1288cd0c2139SMatthew G Knepley Collective on dm 1289cd0c2139SMatthew G Knepley 1290cd0c2139SMatthew G Knepley Input Parameters: 1291cd0c2139SMatthew G Knepley + dm - The original DM 129253156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated) 1293cd0c2139SMatthew G Knepley 1294cd0c2139SMatthew G Knepley Output Parameters: 1295cd0c2139SMatthew G Knepley - dmSplit - The new DM 1296cd0c2139SMatthew G Knepley 1297cd0c2139SMatthew G Knepley Level: developer 1298cd0c2139SMatthew G Knepley 12992be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 1300cd0c2139SMatthew G Knepley @*/ 1301cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 1302cd0c2139SMatthew G Knepley { 1303cd0c2139SMatthew G Knepley DM sdm; 1304cd0c2139SMatthew G Knepley PetscInt dim; 1305cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1306cd0c2139SMatthew G Knepley 1307cd0c2139SMatthew G Knepley PetscFunctionBegin; 1308cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 130953156dfcSMatthew G. Knepley PetscValidPointer(dmSplit, 3); 1310cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 1311cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 1312c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1313c73cfb54SMatthew G. Knepley ierr = DMSetDimension(sdm, dim);CHKERRQ(ierr); 1314cd0c2139SMatthew G Knepley switch (dim) { 1315cd0c2139SMatthew G Knepley case 2: 1316cd0c2139SMatthew G Knepley case 3: 1317cd0c2139SMatthew G Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 1318cd0c2139SMatthew G Knepley break; 1319cd0c2139SMatthew G Knepley default: 1320cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 1321cd0c2139SMatthew G Knepley } 1322cd0c2139SMatthew G Knepley *dmSplit = sdm; 1323cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1324cd0c2139SMatthew G Knepley } 1325cd0c2139SMatthew G Knepley 1326cd0c2139SMatthew G Knepley #undef __FUNCT__ 13270f66a230SMatthew G. Knepley #define __FUNCT__ "GetSurfaceSide_Static" 13280f66a230SMatthew G. Knepley /* Returns the side of the surface for a given cell with a face on the surface */ 13290f66a230SMatthew G. Knepley static PetscErrorCode GetSurfaceSide_Static(DM dm, DM subdm, PetscInt numSubpoints, const PetscInt *subpoints, PetscInt cell, PetscInt face, PetscBool *pos) 13300f66a230SMatthew G. Knepley { 13310f66a230SMatthew G. Knepley const PetscInt *cone, *ornt; 13320f66a230SMatthew G. Knepley PetscInt dim, coneSize, c; 13330f66a230SMatthew G. Knepley PetscErrorCode ierr; 13340f66a230SMatthew G. Knepley 13350f66a230SMatthew G. Knepley PetscFunctionBegin; 13360f66a230SMatthew G. Knepley *pos = PETSC_TRUE; 1337c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 13380f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 13390f66a230SMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 13400f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, cell, &ornt);CHKERRQ(ierr); 13410f66a230SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 13420f66a230SMatthew G. Knepley if (cone[c] == face) { 13430f66a230SMatthew G. Knepley PetscInt o = ornt[c]; 13440f66a230SMatthew G. Knepley 13450f66a230SMatthew G. Knepley if (subdm) { 13460f66a230SMatthew G. Knepley const PetscInt *subcone, *subornt; 13470f66a230SMatthew G. Knepley PetscInt subpoint, subface, subconeSize, sc; 13480f66a230SMatthew G. Knepley 13490f66a230SMatthew G. Knepley ierr = PetscFindInt(cell, numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 13500f66a230SMatthew G. Knepley ierr = PetscFindInt(face, numSubpoints, subpoints, &subface);CHKERRQ(ierr); 13510f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 13520f66a230SMatthew G. Knepley ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 13530f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 13540f66a230SMatthew G. Knepley for (sc = 0; sc < subconeSize; ++sc) { 13550f66a230SMatthew G. Knepley if (subcone[sc] == subface) { 13560f66a230SMatthew G. Knepley o = subornt[0]; 13570f66a230SMatthew G. Knepley break; 13580f66a230SMatthew G. Knepley } 13590f66a230SMatthew G. Knepley } 13600f66a230SMatthew 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); 13610f66a230SMatthew G. Knepley } 13620f66a230SMatthew G. Knepley if (o >= 0) *pos = PETSC_TRUE; 13630f66a230SMatthew G. Knepley else *pos = PETSC_FALSE; 13640f66a230SMatthew G. Knepley break; 13650f66a230SMatthew G. Knepley } 13660f66a230SMatthew G. Knepley } 13670f66a230SMatthew 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); 13680f66a230SMatthew G. Knepley PetscFunctionReturn(0); 13690f66a230SMatthew G. Knepley } 13700f66a230SMatthew G. Knepley 13710f66a230SMatthew G. Knepley #undef __FUNCT__ 13722be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete" 1373cd0c2139SMatthew G Knepley /*@ 13740f66a230SMatthew G. Knepley DMPlexLabelCohesiveComplete - Starting with a label marking points on an internal surface, we add all other mesh pieces 1375cd0c2139SMatthew G Knepley to complete the surface 1376cd0c2139SMatthew G Knepley 1377cd0c2139SMatthew G Knepley Input Parameters: 1378cd0c2139SMatthew G Knepley + dm - The DM 13790f66a230SMatthew G. Knepley . label - A DMLabel marking the surface 13800f66a230SMatthew G. Knepley . blabel - A DMLabel marking the vertices on the boundary which will not be duplicated, or NULL to find them automatically 1381bb55d314SMatthew G. Knepley . flip - Flag to flip the submesh normal and replace points on the other side 138247946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL 1383cd0c2139SMatthew G Knepley 1384cd0c2139SMatthew G Knepley Output Parameter: 1385cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 1386cd0c2139SMatthew G Knepley 13870f66a230SMatthew G. Knepley Note: The vertices in blabel are called "unsplit" in the terminology from hybrid cell creation. 13880f66a230SMatthew G. Knepley 1389cd0c2139SMatthew G Knepley Level: developer 1390cd0c2139SMatthew G Knepley 13912be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 1392cd0c2139SMatthew G Knepley @*/ 13930f66a230SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, DMLabel blabel, PetscBool flip, DM subdm) 1394cd0c2139SMatthew G Knepley { 1395d90583fdSMatthew G. Knepley DMLabel depthLabel; 139686200784SMatthew G. Knepley IS dimIS, subpointIS, facePosIS, faceNegIS, crossEdgeIS = NULL; 139747946fd8SMatthew G. Knepley const PetscInt *points, *subpoints; 1398bb55d314SMatthew G. Knepley const PetscInt rev = flip ? -1 : 1; 1399370472baSMatthew G. Knepley PetscInt *pMax; 1400370472baSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, dim, depth, pSize, dep, cStart, cEnd, cMax, fStart, fEnd, vStart, vEnd, numPoints, numSubpoints, p, val; 1401cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1402cd0c2139SMatthew G Knepley 1403cd0c2139SMatthew G Knepley PetscFunctionBegin; 1404370472baSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1405370472baSMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1406370472baSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1407370472baSMatthew G. Knepley ierr = PetscMalloc1(pSize,&pMax);CHKERRQ(ierr); 1408370472baSMatthew 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); 1409d90583fdSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 1410c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 141147946fd8SMatthew G. Knepley if (subdm) { 141247946fd8SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 141347946fd8SMatthew G. Knepley if (subpointIS) { 141447946fd8SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 141547946fd8SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 141647946fd8SMatthew G. Knepley } 141747946fd8SMatthew G. Knepley } 1418d7c8f101SMatthew G. Knepley /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */ 1419cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 1420dc86033cSMatthew G. Knepley if (!dimIS) { 1421dc86033cSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1422dc86033cSMatthew G. Knepley PetscFunctionReturn(0); 1423dc86033cSMatthew G. Knepley } 1424cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1425cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1426d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */ 1427cd0c2139SMatthew G Knepley const PetscInt *support; 1428cd0c2139SMatthew G Knepley PetscInt supportSize, s; 1429cd0c2139SMatthew G Knepley 1430cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1431cd0c2139SMatthew G Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 1432cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1433cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 14340f66a230SMatthew G. Knepley const PetscInt *cone; 1435cd0c2139SMatthew G Knepley PetscInt coneSize, c; 14360f66a230SMatthew G. Knepley PetscBool pos; 1437cd0c2139SMatthew G Knepley 14380f66a230SMatthew G. Knepley ierr = GetSurfaceSide_Static(dm, subdm, numSubpoints, subpoints, support[s], points[p], &pos);CHKERRQ(ierr); 14390f66a230SMatthew G. Knepley if (pos) {ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr);} 14400f66a230SMatthew G. Knepley else {ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);} 14410f66a230SMatthew G. Knepley if (rev < 0) pos = !pos ? PETSC_TRUE : PETSC_FALSE; 14420f66a230SMatthew G. Knepley /* Put faces touching the fault in the label */ 1443cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1444cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1445cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1446cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 1447cd0c2139SMatthew G Knepley 1448cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1449cd0c2139SMatthew G Knepley if (val == -1) { 1450cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 1451cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 1452cd0c2139SMatthew G Knepley 1453cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1454cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1455cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 1456a0541d8aSMatthew G. Knepley PetscInt bval = -1; 1457cd0c2139SMatthew G Knepley 1458cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1459a0541d8aSMatthew G. Knepley if (blabel) {ierr = DMLabelGetValue(blabel, clp, &bval);CHKERRQ(ierr);} 1460a0541d8aSMatthew G. Knepley if ((val >= 0) && (val < dim-1) && (bval < 0)) { 1461cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1462cd0c2139SMatthew G Knepley break; 1463cd0c2139SMatthew G Knepley } 1464cd0c2139SMatthew G Knepley } 1465cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1466cd0c2139SMatthew G Knepley } 1467cd0c2139SMatthew G Knepley } 1468cd0c2139SMatthew G Knepley } 1469cd0c2139SMatthew G Knepley } 14700f66a230SMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 14710f66a230SMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 147247946fd8SMatthew G. Knepley if (subdm) { 147347946fd8SMatthew G. Knepley if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 147447946fd8SMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 147547946fd8SMatthew G. Knepley } 1476a0541d8aSMatthew G. Knepley /* Mark boundary points as unsplit */ 147786200784SMatthew G. Knepley if (blabel) { 1478a0541d8aSMatthew G. Knepley ierr = DMLabelGetStratumIS(blabel, 1, &dimIS);CHKERRQ(ierr); 1479a0541d8aSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1480a0541d8aSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1481a0541d8aSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1482a0541d8aSMatthew G. Knepley const PetscInt point = points[p]; 1483a0541d8aSMatthew G. Knepley PetscInt val, bval; 1484a0541d8aSMatthew G. Knepley 1485a0541d8aSMatthew G. Knepley ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr); 1486a0541d8aSMatthew G. Knepley if (bval >= 0) { 1487f7019248SMatthew G. Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1488f7019248SMatthew G. Knepley if ((val < 0) || (val > dim)) { 1489f7019248SMatthew G. Knepley /* This could be a point added from splitting a vertex on an adjacent fault, otherwise its just wrong */ 1490f7019248SMatthew G. Knepley ierr = DMLabelClearValue(blabel, point, bval);CHKERRQ(ierr); 1491f7019248SMatthew G. Knepley } 1492f7019248SMatthew G. Knepley } 1493f7019248SMatthew G. Knepley } 1494f7019248SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1495f7019248SMatthew G. Knepley const PetscInt point = points[p]; 1496f7019248SMatthew G. Knepley PetscInt val, bval; 1497f7019248SMatthew G. Knepley 1498f7019248SMatthew G. Knepley ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr); 1499f7019248SMatthew G. Knepley if (bval >= 0) { 150086200784SMatthew G. Knepley const PetscInt *cone, *support; 150186200784SMatthew G. Knepley PetscInt coneSize, supportSize, s, valA, valB, valE; 150286200784SMatthew G. Knepley 1503a0541d8aSMatthew G. Knepley /* Mark as unsplit */ 1504a0541d8aSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1505a0541d8aSMatthew G. Knepley if ((val < 0) || (val > dim)) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d has label value %d, should be part of the fault", point, val); 1506a0541d8aSMatthew G. Knepley ierr = DMLabelClearValue(label, point, val);CHKERRQ(ierr); 1507a0541d8aSMatthew G. Knepley ierr = DMLabelSetValue(label, point, shift2+val);CHKERRQ(ierr); 15082c06a818SMatthew G. Knepley /* Check for cross-edge 15092c06a818SMatthew G. Knepley A cross-edge has endpoints which are both on the boundary of the surface, but the edge itself is not. */ 151086200784SMatthew G. Knepley if (val != 0) continue; 151186200784SMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 151286200784SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 151386200784SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 151486200784SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 151586200784SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 151686200784SMatthew G. Knepley if (coneSize != 2) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Edge %D has %D vertices != 2", support[s], coneSize); 151786200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, cone[0], &valA);CHKERRQ(ierr); 151886200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, cone[1], &valB);CHKERRQ(ierr); 151986200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, support[s], &valE);CHKERRQ(ierr); 152009816f77SMatthew G. Knepley if ((valE < 0) && (valA >= 0) && (valB >= 0) && (cone[0] != cone[1])) {ierr = DMLabelSetValue(blabel, support[s], 2);CHKERRQ(ierr);} 152186200784SMatthew G. Knepley } 1522a0541d8aSMatthew G. Knepley } 1523a0541d8aSMatthew G. Knepley } 1524a0541d8aSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1525a0541d8aSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1526a0541d8aSMatthew G. Knepley } 1527cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1528c4d480a2SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 1529cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1530d24f5ce5SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1531d24f5ce5SMatthew G. Knepley cMax = cMax < 0 ? cEnd : cMax; 15320f66a230SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 1533cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 153486200784SMatthew G. Knepley if (blabel) {ierr = DMLabelGetStratumIS(blabel, 2, &crossEdgeIS);CHKERRQ(ierr);} 153586200784SMatthew G. Knepley if (dimIS && crossEdgeIS) { 153686200784SMatthew G. Knepley IS vertIS = dimIS; 153786200784SMatthew G. Knepley 153886200784SMatthew G. Knepley ierr = ISExpand(vertIS, crossEdgeIS, &dimIS);CHKERRQ(ierr); 153986200784SMatthew G. Knepley ierr = ISDestroy(&crossEdgeIS);CHKERRQ(ierr); 154086200784SMatthew G. Knepley ierr = ISDestroy(&vertIS);CHKERRQ(ierr); 154186200784SMatthew G. Knepley } 1542dc86033cSMatthew G. Knepley if (!dimIS) { 1543dc86033cSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1544dc86033cSMatthew G. Knepley PetscFunctionReturn(0); 1545dc86033cSMatthew G. Knepley } 1546cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1547cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1548d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */ 1549cd0c2139SMatthew G Knepley PetscInt *star = NULL; 155086200784SMatthew G. Knepley PetscInt starSize, s; 1551cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1552cd0c2139SMatthew G Knepley 1553d4622b2cSMatthew G. Knepley /* All points connected to the fault are inside a cell, so at the top level we will only check cells */ 1554cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1555cd0c2139SMatthew G Knepley while (again) { 1556cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1557cd0c2139SMatthew G Knepley again = 0; 1558cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1559cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1560cd0c2139SMatthew G Knepley const PetscInt *cone; 1561cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1562cd0c2139SMatthew G Knepley 1563d24f5ce5SMatthew G. Knepley if ((point < cStart) || (point >= cMax)) continue; 1564cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1565cd0c2139SMatthew G Knepley if (val != -1) continue; 1566d4622b2cSMatthew G. Knepley again = again == 1 ? 1 : 2; 1567cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1568cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1569cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1570cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1571cd0c2139SMatthew G Knepley if (val != -1) { 1572d7c8f101SMatthew G. Knepley const PetscInt *ccone; 1573166d9d0cSMatthew G. Knepley PetscInt cconeSize, cc, side; 1574d7c8f101SMatthew G. Knepley 1575*db8edaafSMatthew G. Knepley if (PetscAbs(val) < shift) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d on cell %d has an invalid label %d", cone[c], point, val); 157637a6de01SMatthew G. Knepley if (val > 0) side = 1; 157737a6de01SMatthew G. Knepley else side = -1; 157837a6de01SMatthew G. Knepley ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr); 1579d7c8f101SMatthew G. Knepley /* Mark cell faces which touch the fault */ 1580d7c8f101SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr); 1581d7c8f101SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr); 1582d7c8f101SMatthew G. Knepley for (cc = 0; cc < cconeSize; ++cc) { 1583d7c8f101SMatthew G. Knepley PetscInt *closure = NULL; 1584d7c8f101SMatthew G. Knepley PetscInt closureSize, cl; 1585d7c8f101SMatthew G. Knepley 1586166d9d0cSMatthew G. Knepley ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr); 1587166d9d0cSMatthew G. Knepley if (val != -1) continue; 1588d7c8f101SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1589d4622b2cSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1590d7c8f101SMatthew G. Knepley const PetscInt clp = closure[cl]; 1591d7c8f101SMatthew G. Knepley 1592d7c8f101SMatthew G. Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1593d7c8f101SMatthew G. Knepley if (val == -1) continue; 1594d7c8f101SMatthew G. Knepley ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr); 159537a6de01SMatthew G. Knepley break; 159637a6de01SMatthew G. Knepley } 1597d7c8f101SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1598cd0c2139SMatthew G Knepley } 1599cd0c2139SMatthew G Knepley again = 1; 1600cd0c2139SMatthew G Knepley break; 1601cd0c2139SMatthew G Knepley } 1602cd0c2139SMatthew G Knepley } 1603cd0c2139SMatthew G Knepley } 1604cd0c2139SMatthew G Knepley } 1605cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1606cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1607cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1608cd0c2139SMatthew G Knepley 1609cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1610cd0c2139SMatthew G Knepley if (val == -1) { 1611cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1612cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1613cd0c2139SMatthew G Knepley PetscBool marked = PETSC_FALSE; 1614cd0c2139SMatthew G Knepley 1615cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1616cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1617cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1618cd0c2139SMatthew G Knepley 1619d24f5ce5SMatthew G. Knepley if ((spoint < cStart) || (spoint >= cMax)) continue; 1620cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1621cd0c2139SMatthew 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); 1622d90583fdSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1623cd0c2139SMatthew G Knepley if (val > 0) { 1624cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1625cd0c2139SMatthew G Knepley } else { 1626cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1627cd0c2139SMatthew G Knepley } 1628cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1629cd0c2139SMatthew G Knepley break; 1630cd0c2139SMatthew G Knepley } 1631cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1632370472baSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1633370472baSMatthew G. Knepley if (point < pMax[dep] && !marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1634cd0c2139SMatthew G Knepley } 1635cd0c2139SMatthew G Knepley } 1636cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1637cd0c2139SMatthew G Knepley } 1638cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1639cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 164018c5995bSMatthew G. Knepley /* If any faces touching the fault divide cells on either side, split them */ 164118c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift+dim-1, &facePosIS);CHKERRQ(ierr); 164218c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr); 164318c5995bSMatthew G. Knepley ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr); 164418c5995bSMatthew G. Knepley ierr = ISDestroy(&facePosIS);CHKERRQ(ierr); 164518c5995bSMatthew G. Knepley ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr); 164618c5995bSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 164718c5995bSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 164818c5995bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 164918c5995bSMatthew G. Knepley const PetscInt point = points[p]; 165018c5995bSMatthew G. Knepley const PetscInt *support; 165118c5995bSMatthew G. Knepley PetscInt supportSize, valA, valB; 165218c5995bSMatthew G. Knepley 165318c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 165418c5995bSMatthew G. Knepley if (supportSize != 2) continue; 165518c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 165618c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr); 165718c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr); 165818c5995bSMatthew G. Knepley if ((valA == -1) || (valB == -1)) continue; 165918c5995bSMatthew G. Knepley if (valA*valB > 0) continue; 166018c5995bSMatthew G. Knepley /* Split the face */ 166118c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr); 166218c5995bSMatthew G. Knepley ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr); 166318c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr); 1664e1757548SMatthew G. Knepley /* Label its closure: 1665e1757548SMatthew G. Knepley unmarked: label as unsplit 1666e1757548SMatthew G. Knepley incident: relabel as split 1667e1757548SMatthew G. Knepley split: do nothing 1668e1757548SMatthew G. Knepley */ 166918c5995bSMatthew G. Knepley { 167018c5995bSMatthew G. Knepley PetscInt *closure = NULL; 167118c5995bSMatthew G. Knepley PetscInt closureSize, cl; 167218c5995bSMatthew G. Knepley 167318c5995bSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 167418c5995bSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 167518c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr); 16768771c1d3SMatthew G. Knepley if (valA == -1) { /* Mark as unsplit */ 167718c5995bSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 167818c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr); 16798771c1d3SMatthew G. Knepley } else if (((valA >= shift) && (valA < shift2)) || ((valA <= -shift) && (valA > -shift2))) { 1680e1757548SMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 1681e1757548SMatthew G. Knepley ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr); 1682e1757548SMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr); 1683e1757548SMatthew G. Knepley } 168418c5995bSMatthew G. Knepley } 168518c5995bSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 168618c5995bSMatthew G. Knepley } 168718c5995bSMatthew G. Knepley } 168818c5995bSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 168918c5995bSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1690370472baSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1691cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1692cd0c2139SMatthew G Knepley } 1693cd0c2139SMatthew G Knepley 1694cd0c2139SMatthew G Knepley #undef __FUNCT__ 16953cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh" 16963cf72582SMatthew G. Knepley /*@C 16973cf72582SMatthew G. Knepley DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface 16983cf72582SMatthew G. Knepley 16993cf72582SMatthew G. Knepley Collective on dm 17003cf72582SMatthew G. Knepley 17013cf72582SMatthew G. Knepley Input Parameters: 17023cf72582SMatthew G. Knepley + dm - The original DM 17033cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices 17043cf72582SMatthew G. Knepley 17053cf72582SMatthew G. Knepley Output Parameters: 17063cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface 17073cf72582SMatthew G. Knepley - dmHybrid - The new DM 17083cf72582SMatthew G. Knepley 17093cf72582SMatthew G. Knepley Level: developer 17103cf72582SMatthew G. Knepley 17113cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate() 17123cf72582SMatthew G. Knepley @*/ 17133cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid) 17143cf72582SMatthew G. Knepley { 17153cf72582SMatthew G. Knepley DM idm; 17163cf72582SMatthew G. Knepley DMLabel subpointMap, hlabel; 17173cf72582SMatthew G. Knepley PetscInt dim; 17183cf72582SMatthew G. Knepley PetscErrorCode ierr; 17193cf72582SMatthew G. Knepley 17203cf72582SMatthew G. Knepley PetscFunctionBegin; 17213cf72582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 17223cf72582SMatthew G. Knepley if (hybridLabel) PetscValidPointer(hybridLabel, 3); 17233cf72582SMatthew G. Knepley PetscValidPointer(dmHybrid, 4); 1724c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 17253cf72582SMatthew G. Knepley ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr); 17263cf72582SMatthew G. Knepley ierr = DMPlexOrient(idm);CHKERRQ(ierr); 17273cf72582SMatthew G. Knepley ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr); 17283cf72582SMatthew G. Knepley ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr); 17293cf72582SMatthew G. Knepley ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr); 17300f66a230SMatthew G. Knepley ierr = DMPlexLabelCohesiveComplete(dm, hlabel, NULL, PETSC_FALSE, idm);CHKERRQ(ierr); 17313cf72582SMatthew G. Knepley ierr = DMDestroy(&idm);CHKERRQ(ierr); 17323cf72582SMatthew G. Knepley ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr); 17333cf72582SMatthew G. Knepley if (hybridLabel) *hybridLabel = hlabel; 173453aa2e23SMatthew G. Knepley else {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);} 1735e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1736e6ccafaeSMatthew G Knepley } 1737e6ccafaeSMatthew G Knepley 1738e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1739efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated" 1740efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 1741efa14ee0SMatthew G Knepley 1742efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 1743efa14ee0SMatthew G Knepley */ 1744830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1745efa14ee0SMatthew G Knepley { 1746fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 1747efa14ee0SMatthew G Knepley const PetscInt *subvertices; 174877d178adSMatthew G. Knepley PetscInt *pStart, *pEnd, *pMax, pSize; 1749efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1750efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1751efa14ee0SMatthew G Knepley 1752efa14ee0SMatthew G Knepley PetscFunctionBegin; 1753efa14ee0SMatthew G Knepley *numFaces = 0; 1754efa14ee0SMatthew G Knepley *nFV = 0; 1755efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1756c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 175777d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1758dcca6d9dSJed Brown ierr = PetscMalloc3(pSize,&pStart,pSize,&pEnd,pSize,&pMax);CHKERRQ(ierr); 1759d92e47f8SMatthew 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); 1760efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 1761efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1762efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1763efa14ee0SMatthew G Knepley } 1764efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1765fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1766efa14ee0SMatthew G Knepley if (subvertexIS) { 1767efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1768efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1769efa14ee0SMatthew G Knepley } 1770efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1771efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 17720298fd71SBarry Smith PetscInt *star = NULL; 1773efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 1774efa14ee0SMatthew G Knepley 1775efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1776efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1777efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1778efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1779efa14ee0SMatthew G Knepley } 1780efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 1781efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 17820298fd71SBarry Smith PetscInt *closure = NULL; 1783efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 1784efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 1785efa14ee0SMatthew G Knepley 1786efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 178765560c7fSMatthew G Knepley if (cellLoc == 2) continue; 178882f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1789efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1790efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1791efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1792efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1793efa14ee0SMatthew G Knepley 1794efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1795efa14ee0SMatthew G Knepley ++numCorners; 1796efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1797830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 1798efa14ee0SMatthew G Knepley } 1799efa14ee0SMatthew G Knepley } 180018ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 180182f516ccSBarry 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); 1802efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 1803007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 1804007baee2SMatthew G. Knepley PetscInt numCells, nc; 1805007baee2SMatthew G. Knepley 1806efa14ee0SMatthew G Knepley ++(*numFaces); 1807efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 1808efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 1809efa14ee0SMatthew G Knepley } 1810007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1811007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 1812007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 1813007baee2SMatthew G. Knepley } 1814007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1815efa14ee0SMatthew G Knepley } 1816efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1817efa14ee0SMatthew G Knepley } 1818efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1819efa14ee0SMatthew G Knepley } 1820efa14ee0SMatthew G Knepley if (subvertexIS) { 1821efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1822efa14ee0SMatthew G Knepley } 1823efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1824efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1825efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1826efa14ee0SMatthew G Knepley } 1827efa14ee0SMatthew G Knepley 1828efa14ee0SMatthew G Knepley #undef __FUNCT__ 1829efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated" 1830830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 1831efa14ee0SMatthew G Knepley { 183234b4c39eSMatthew G. Knepley IS subvertexIS = NULL; 1833efa14ee0SMatthew G Knepley const PetscInt *subvertices; 1834efa14ee0SMatthew G Knepley PetscInt *pStart, *pEnd, *pMax; 1835efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 1836efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1837efa14ee0SMatthew G Knepley 1838efa14ee0SMatthew G Knepley PetscFunctionBegin; 1839c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1840dcca6d9dSJed Brown ierr = PetscMalloc3(dim+1,&pStart,dim+1,&pEnd,dim+1,&pMax);CHKERRQ(ierr); 18410298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1842efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 1843efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1844efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1845efa14ee0SMatthew G Knepley } 1846efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 184734b4c39eSMatthew G. Knepley if (vertexLabel) { 1848830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 1849efa14ee0SMatthew G Knepley if (subvertexIS) { 1850efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1851efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1852efa14ee0SMatthew G Knepley } 185334b4c39eSMatthew G. Knepley } 1854efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1855efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 18560298fd71SBarry Smith PetscInt *star = NULL; 1857efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 1858efa14ee0SMatthew G Knepley 1859efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1860efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1861efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1862efa14ee0SMatthew G Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 1863efa14ee0SMatthew G Knepley } 1864efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 1865efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 18660298fd71SBarry Smith PetscInt *closure = NULL; 1867efa14ee0SMatthew G Knepley PetscInt closureSize, c; 1868efa14ee0SMatthew G Knepley PetscInt faceLoc; 1869efa14ee0SMatthew G Knepley 1870efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 1871efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 187282f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 1873efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1874efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1875efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1876efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1877efa14ee0SMatthew G Knepley 1878efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1879efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1880830e53efSMatthew G. Knepley if (vertexLoc != value) break; 1881efa14ee0SMatthew G Knepley } 1882efa14ee0SMatthew G Knepley } 1883efa14ee0SMatthew G Knepley if (c == closureSize*2) { 1884efa14ee0SMatthew G Knepley const PetscInt *support; 1885efa14ee0SMatthew G Knepley PetscInt supportSize, s; 1886efa14ee0SMatthew G Knepley 1887efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1888efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1889efa14ee0SMatthew G Knepley 1890efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 1891efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1892efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1893efa14ee0SMatthew G Knepley break; 1894efa14ee0SMatthew G Knepley } 1895efa14ee0SMatthew G Knepley } 1896efa14ee0SMatthew G Knepley } 1897efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 1898efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 1899efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1900efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1901efa14ee0SMatthew G Knepley } 1902efa14ee0SMatthew G Knepley } 1903efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1904efa14ee0SMatthew G Knepley } 1905efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1906efa14ee0SMatthew G Knepley } 190734b4c39eSMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);} 1908efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1909efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1910efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1911efa14ee0SMatthew G Knepley } 1912efa14ee0SMatthew G Knepley 1913efa14ee0SMatthew G Knepley #undef __FUNCT__ 1914766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated" 191527c04023SMatthew 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) 1916766ab985SMatthew G. Knepley { 191727c04023SMatthew G. Knepley DMLabel label = NULL; 1918766ab985SMatthew G. Knepley const PetscInt *cone; 191927234c99SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize; 1920766ab985SMatthew G. Knepley PetscErrorCode ierr; 1921766ab985SMatthew G. Knepley 1922812bfc34SJed Brown PetscFunctionBegin; 1923c0ed958bSJed Brown *numFaces = 0; 1924c0ed958bSJed Brown *nFV = 0; 1925b6d5cb33SJed Brown if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1926fed694aaSMatthew G. Knepley *subCells = NULL; 1927c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1928766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1929766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1930766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 193127c04023SMatthew G. Knepley if (label) { 193227c04023SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 193327c04023SMatthew G. Knepley PetscInt val; 193427c04023SMatthew G. Knepley 193527c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 193627c04023SMatthew G. Knepley if (val == value) { 193727c04023SMatthew G. Knepley ++(*numFaces); 193827c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 193927c04023SMatthew G. Knepley } 194027c04023SMatthew G. Knepley } 194127c04023SMatthew G. Knepley } else { 1942766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 194327c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 194427c04023SMatthew G. Knepley } 1945766ab985SMatthew G. Knepley *nFV = hasLagrange ? coneSize/3 : coneSize/2; 1946785e854fSJed Brown ierr = PetscMalloc1(*numFaces *2, subCells);CHKERRQ(ierr); 1947766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1948766ab985SMatthew G. Knepley const PetscInt *cells; 1949766ab985SMatthew G. Knepley PetscInt numCells; 1950766ab985SMatthew G. Knepley 195127c04023SMatthew G. Knepley if (label) { 195227c04023SMatthew G. Knepley PetscInt val; 195327c04023SMatthew G. Knepley 195427c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 195527c04023SMatthew G. Knepley if (val != value) continue; 195627c04023SMatthew G. Knepley } 1957766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1958766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 1959766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 1960766ab985SMatthew G. Knepley } 1961766ab985SMatthew G. Knepley /* Negative face */ 1962766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 196327234c99SMatthew G. Knepley /* Not true in parallel 196427234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 1965766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 1966766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 196727234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 1968766ab985SMatthew G. Knepley } 1969766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 1970766ab985SMatthew G. Knepley /* Positive face is not included */ 1971766ab985SMatthew G. Knepley } 1972766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1973766ab985SMatthew G. Knepley } 1974766ab985SMatthew G. Knepley 1975766ab985SMatthew G. Knepley #undef __FUNCT__ 1976766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated" 19773982b651SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, DMLabel label, PetscInt value, DMLabel subpointMap, DM subdm) 1978766ab985SMatthew G. Knepley { 1979766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 1980766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 1981766ab985SMatthew G. Knepley PetscErrorCode ierr; 1982766ab985SMatthew G. Knepley 1983812bfc34SJed Brown PetscFunctionBegin; 1984c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1985766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1986766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1987766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 1988dcca6d9dSJed Brown ierr = PetscMalloc2(dim+1,&pStart,dim+1,&pEnd);CHKERRQ(ierr); 1989b3154360SMatthew G. Knepley for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);} 1990766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1991766ab985SMatthew G. Knepley const PetscInt *cone; 1992766ab985SMatthew G. Knepley PetscInt *closure = NULL; 1993b3154360SMatthew G. Knepley PetscInt fconeSize, coneSize, closureSize, cl, val; 1994766ab985SMatthew G. Knepley 199527c04023SMatthew G. Knepley if (label) { 199627c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 199727c04023SMatthew G. Knepley if (val != value) continue; 199827c04023SMatthew G. Knepley } 1999766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2000766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2001b3154360SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr); 2002b3154360SMatthew G. Knepley if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 2003b3154360SMatthew G. Knepley /* Negative face */ 2004766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2005766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2006766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 2007766ab985SMatthew G. Knepley 2008766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2009766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 2010766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 2011766ab985SMatthew G. Knepley break; 2012766ab985SMatthew G. Knepley } 2013766ab985SMatthew G. Knepley } 2014766ab985SMatthew G. Knepley } 2015766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2016766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 2017766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 2018766ab985SMatthew G. Knepley const PetscInt *support; 2019766ab985SMatthew G. Knepley PetscInt supportSize, s; 2020766ab985SMatthew G. Knepley 2021766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 2022711de394SMatthew G. Knepley /* if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); */ 2023766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 2024766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 2025766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 2026766ab985SMatthew G. Knepley } 2027766ab985SMatthew G. Knepley } 2028766ab985SMatthew G. Knepley } 2029766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 2030766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2031766ab985SMatthew G. Knepley } 2032766ab985SMatthew G. Knepley 2033766ab985SMatthew G. Knepley #undef __FUNCT__ 2034e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation" 2035e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2036e6ccafaeSMatthew G Knepley { 203782f516ccSBarry Smith MPI_Comm comm; 2038e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 2039e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 2040e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 2041e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2042e6ccafaeSMatthew G Knepley 204382f516ccSBarry Smith PetscFunctionBegin; 204482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2045c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &cellDim);CHKERRQ(ierr); 2046e6ccafaeSMatthew G Knepley if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 2047e6ccafaeSMatthew G Knepley 2048ddeab2a6SMatthew G. Knepley if (cellDim == 1 && numCorners == 2) { 2049ddeab2a6SMatthew G. Knepley /* Triangle */ 2050e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 2051e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2052ddeab2a6SMatthew G. Knepley } else if (cellDim == 2 && numCorners == 3) { 2053ddeab2a6SMatthew G. Knepley /* Triangle */ 2054ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2055ddeab2a6SMatthew G. Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2056ddeab2a6SMatthew G. Knepley } else if (cellDim == 3 && numCorners == 4) { 2057ddeab2a6SMatthew G. Knepley /* Tetrahedron */ 2058ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2059ddeab2a6SMatthew G. Knepley posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2060e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 2061e6ccafaeSMatthew G Knepley /* Quadratic line */ 2062e6ccafaeSMatthew G Knepley faceSize = 1; 2063e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2064e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 2065e6ccafaeSMatthew G Knepley /* Quads */ 2066e6ccafaeSMatthew G Knepley faceSize = 2; 2067e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 2068e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2069e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 2070e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2071e6ccafaeSMatthew G Knepley } else { 2072e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 2073e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 2074e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 2075e6ccafaeSMatthew G Knepley } 2076e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 2077e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 2078e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2079e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 2080e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2081e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2082e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 2083e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2084e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2085e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 2086e6ccafaeSMatthew G Knepley }; 2087e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 2088e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2089e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2090e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 2091e6ccafaeSMatthew G Knepley }; 2092e6ccafaeSMatthew G Knepley 2093e6ccafaeSMatthew G Knepley faceSize = faceSizeTri; 2094e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 2095e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 2096e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 2097e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 2098e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2099e6ccafaeSMatthew G Knepley 2100e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 2101e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 2102e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 2103e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 2104e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[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 tri crossface"); 2115e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2116e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2117e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 2118e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 2119e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2120e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 2121e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2122e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2123e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 2124e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2125e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2126e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2127e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 2128e6ccafaeSMatthew G Knepley }; 2129e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 2130e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2131e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2132e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2133e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 2134e6ccafaeSMatthew G Knepley }; 2135e6ccafaeSMatthew G Knepley 2136e6ccafaeSMatthew G Knepley faceSize = faceSizeQuad; 2137e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 2138e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 2139e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 2140e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 2141e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2142e6ccafaeSMatthew G Knepley 2143e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 2144e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 2145e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 2146e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 2147e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 2148e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2149e6ccafaeSMatthew G Knepley break; 2150e6ccafaeSMatthew G Knepley } 2151e6ccafaeSMatthew G Knepley } 2152e6ccafaeSMatthew G Knepley } 2153e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2154e6ccafaeSMatthew G Knepley break; 2155e6ccafaeSMatthew G Knepley } 2156e6ccafaeSMatthew G Knepley } 2157e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 2158e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2159e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2160e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 2161e6ccafaeSMatthew G Knepley /* Hexes 2162e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2163e6ccafaeSMatthew G Knepley pointing up at the second. 2164e6ccafaeSMatthew G Knepley 2165e6ccafaeSMatthew G Knepley 7---6 2166e6ccafaeSMatthew G Knepley /| /| 2167e6ccafaeSMatthew G Knepley 4---5 | 2168ddeab2a6SMatthew G. Knepley | 1-|-2 2169e6ccafaeSMatthew G Knepley |/ |/ 2170ddeab2a6SMatthew G. Knepley 0---3 2171e6ccafaeSMatthew G Knepley 2172e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2173e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 2174e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 2175e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2176e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 2177e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 2178e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2179ddeab2a6SMatthew G. Knepley 0, 3, 4, 5, /* front */ 2180ddeab2a6SMatthew G. Knepley 2, 3, 5, 6, /* right */ 2181ddeab2a6SMatthew G. Knepley 1, 2, 6, 7, /* back */ 2182ddeab2a6SMatthew G. Knepley 0, 1, 4, 7, /* left */ 2183e6ccafaeSMatthew G Knepley }; 2184e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 2185ddeab2a6SMatthew G. Knepley 1, 2, 3, 0, /* bottom */ 2186e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2187ddeab2a6SMatthew G. Knepley 0, 3, 5, 4, /* front */ 2188ddeab2a6SMatthew G. Knepley 3, 2, 6, 5, /* right */ 2189ddeab2a6SMatthew G. Knepley 2, 1, 7, 6, /* back */ 2190ddeab2a6SMatthew G. Knepley 1, 0, 4, 7, /* left */ 2191e6ccafaeSMatthew G Knepley }; 2192e6ccafaeSMatthew G Knepley 2193e6ccafaeSMatthew G Knepley faceSize = faceSizeHex; 2194e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 2195e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 2196e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2197e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 2198e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2199e6ccafaeSMatthew G Knepley 2200e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 2201e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 2202e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 2203e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 2204e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 2205e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 2206e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 2207e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2208e6ccafaeSMatthew G Knepley break; 2209e6ccafaeSMatthew G Knepley } 2210e6ccafaeSMatthew G Knepley } 2211e6ccafaeSMatthew G Knepley } 2212e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2213e6ccafaeSMatthew G Knepley break; 2214e6ccafaeSMatthew G Knepley } 2215e6ccafaeSMatthew G Knepley } 2216e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2217e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2218e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2219e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 2220e6ccafaeSMatthew G Knepley /* Quadratic tet */ 2221e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 2222e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 2223e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 2224e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2225e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 2226e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2227e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 2228e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 2229e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 2230e6ccafaeSMatthew G Knepley }; 2231e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 2232e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2233e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 2234e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 2235e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 2236e6ccafaeSMatthew G Knepley }; 2237e6ccafaeSMatthew G Knepley 2238e6ccafaeSMatthew G Knepley faceSize = faceSizeTet; 2239e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 2240e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 2241e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 2242e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 2243e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2244e6ccafaeSMatthew G Knepley 2245e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 2246e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 2247e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 2248e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 2249e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 2250e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 2251e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 2252e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2253e6ccafaeSMatthew G Knepley break; 2254e6ccafaeSMatthew G Knepley } 2255e6ccafaeSMatthew G Knepley } 2256e6ccafaeSMatthew G Knepley } 2257e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2258e6ccafaeSMatthew G Knepley break; 2259e6ccafaeSMatthew G Knepley } 2260e6ccafaeSMatthew G Knepley } 2261e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 2262e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2263e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2264e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 2265e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 2266e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2267e6ccafaeSMatthew G Knepley pointing up at the second. 2268e6ccafaeSMatthew G Knepley 2269e6ccafaeSMatthew G Knepley 7---6 2270e6ccafaeSMatthew G Knepley /| /| 2271e6ccafaeSMatthew G Knepley 4---5 | 2272e6ccafaeSMatthew G Knepley | 3-|-2 2273e6ccafaeSMatthew G Knepley |/ |/ 2274e6ccafaeSMatthew G Knepley 0---1 2275e6ccafaeSMatthew G Knepley 2276e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2277e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 2278e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 2279e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2280e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 2281e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 2282e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2283e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 2284e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 2285e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 2286e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 2287e6ccafaeSMatthew G Knepley }; 2288e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 2289e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 2290e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2291e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 2292e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 2293e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 2294e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 2295e6ccafaeSMatthew G Knepley }; 2296e6ccafaeSMatthew G Knepley 2297e6ccafaeSMatthew G Knepley faceSize = faceSizeQuadHex; 2298e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 2299e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 2300e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2301e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 2302e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2303e6ccafaeSMatthew G Knepley 2304e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 2305e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 2306e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 2307e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 2308e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 2309e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 2310e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 2311e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2312e6ccafaeSMatthew G Knepley break; 2313e6ccafaeSMatthew G Knepley } 2314e6ccafaeSMatthew G Knepley } 2315e6ccafaeSMatthew G Knepley } 2316e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2317e6ccafaeSMatthew G Knepley break; 2318e6ccafaeSMatthew G Knepley } 2319e6ccafaeSMatthew G Knepley } 2320e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2321e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2322e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2323e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 2324e6ccafaeSMatthew G Knepley if (!posOrient) { 2325e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 2326e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 2327e6ccafaeSMatthew G Knepley } else { 2328e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 2329e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 2330e6ccafaeSMatthew G Knepley } 2331e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 2332e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2333e6ccafaeSMatthew G Knepley } 2334e6ccafaeSMatthew G Knepley 2335e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2336e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace" 2337e6ccafaeSMatthew G Knepley /* 2338e6ccafaeSMatthew G Knepley Given a cell and a face, as a set of vertices, 2339e6ccafaeSMatthew G Knepley return the oriented face, as a set of vertices, in faceVertices 2340e6ccafaeSMatthew G Knepley The orientation is such that the face normal points out of the cell 2341e6ccafaeSMatthew G Knepley */ 2342e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2343e6ccafaeSMatthew G Knepley { 23440298fd71SBarry Smith const PetscInt *cone = NULL; 2345e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 2346e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 2347e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2348e6ccafaeSMatthew G Knepley 2349e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2350e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 2351e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 2352e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 2353e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2354e6ccafaeSMatthew G Knepley 2355e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 2356e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 2357e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 2358e6ccafaeSMatthew G Knepley } 2359e6ccafaeSMatthew G Knepley } 2360e6ccafaeSMatthew G Knepley if (found) { 2361e6ccafaeSMatthew G Knepley indices[v2] = v; 2362e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 2363e6ccafaeSMatthew G Knepley ++v2; 2364e6ccafaeSMatthew G Knepley } else { 2365e6ccafaeSMatthew G Knepley oppositeVertex = v; 2366e6ccafaeSMatthew G Knepley } 2367e6ccafaeSMatthew G Knepley } 2368e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 2369e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2370e6ccafaeSMatthew G Knepley } 2371e6ccafaeSMatthew G Knepley 2372e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2373cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal" 2374e6ccafaeSMatthew G Knepley /* 2375cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 2376e6ccafaeSMatthew G Knepley 2377e6ccafaeSMatthew G Knepley Not collective 2378e6ccafaeSMatthew G Knepley 2379e6ccafaeSMatthew G Knepley Input Parameters: 2380e6ccafaeSMatthew G Knepley + dm - The DMPlex 2381e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 2382e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 2383e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 2384e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 2385e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 2386e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 2387e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 2388e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 2389e6ccafaeSMatthew G Knepley 2390e6ccafaeSMatthew G Knepley Output Parameters: 2391e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 2392e6ccafaeSMatthew G Knepley 2393e6ccafaeSMatthew G Knepley Level: developer 2394e6ccafaeSMatthew G Knepley */ 2395cd0c2139SMatthew 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) 2396e6ccafaeSMatthew G Knepley { 239782f516ccSBarry Smith MPI_Comm comm; 2398e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 2399e6ccafaeSMatthew G Knepley const PetscInt *faces; 2400e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 2401e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2402e6ccafaeSMatthew G Knepley 2403e6ccafaeSMatthew G Knepley PetscFunctionBegin; 240482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2405e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 2406e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 2407e6ccafaeSMatthew G Knepley #if 0 2408e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 2409e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2410e6ccafaeSMatthew G Knepley #else 2411e6ccafaeSMatthew G Knepley { 2412e6ccafaeSMatthew G Knepley PetscInt f; 2413e6ccafaeSMatthew G Knepley 2414e6ccafaeSMatthew G Knepley numFaces = 0; 2415e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2416e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 2417e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 2418e6ccafaeSMatthew G Knepley 2419e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 2420e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 2421e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 2422e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 2423e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 2424e6ccafaeSMatthew G Knepley PetscInt v; 2425e6ccafaeSMatthew G Knepley 2426e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2427e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 2428e6ccafaeSMatthew G Knepley } 2429e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 2430e6ccafaeSMatthew G Knepley } 2431e6ccafaeSMatthew G Knepley if (d == dof) { 2432e6ccafaeSMatthew G Knepley numFaces = 1; 2433e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 2434e6ccafaeSMatthew G Knepley } 2435e6ccafaeSMatthew G Knepley } 2436e6ccafaeSMatthew G Knepley } 2437e6ccafaeSMatthew G Knepley #endif 2438e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 2439e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 2440e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 2441766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 2442e6ccafaeSMatthew G Knepley } else { 2443e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 2444e6ccafaeSMatthew G Knepley PetscBool posOriented; 2445e6ccafaeSMatthew G Knepley 2446e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2447e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 2448e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 2449e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 2450e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 2451e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 2452e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2453e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 2454e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 2455e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 2456e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 2457e6ccafaeSMatthew G Knepley break; 2458e6ccafaeSMatthew G Knepley } 2459e6ccafaeSMatthew G Knepley } 2460e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 2461e6ccafaeSMatthew G Knepley } 2462e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 2463e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 2464e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2465e6ccafaeSMatthew G Knepley ++(*newFacePoint); 2466e6ccafaeSMatthew G Knepley } 2467ef07cca7SMatthew G. Knepley #if 0 2468e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2469ef07cca7SMatthew G. Knepley #else 2470ef07cca7SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2471ef07cca7SMatthew G. Knepley #endif 2472e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2473e6ccafaeSMatthew G Knepley } 2474e6ccafaeSMatthew G Knepley 2475e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2476e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated" 247753156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2478e6ccafaeSMatthew G Knepley { 247982f516ccSBarry Smith MPI_Comm comm; 248053156dfcSMatthew G. Knepley DMLabel subpointMap; 2481efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 2482efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 2483efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 2484fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 2485efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 2486e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2487e6ccafaeSMatthew G Knepley 2488e6ccafaeSMatthew G Knepley PetscFunctionBegin; 248982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2490efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2491efa14ee0SMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2492efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2493efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 249453156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);} 2495efa14ee0SMatthew G Knepley /* Setup chart */ 2496efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2497efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2498efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2499efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2500e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2501e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 2502efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 2503e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 2504efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2505efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2506efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 2507efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2508e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2509e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2510e6ccafaeSMatthew G Knepley } 2511e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2512e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2513e6ccafaeSMatthew G Knepley } 2514e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2515e6ccafaeSMatthew G Knepley /* Create face cones */ 2516efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 25170298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2518efa14ee0SMatthew G Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2519e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2520e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 2521efa14ee0SMatthew G Knepley const PetscInt subcell = c; 25220298fd71SBarry Smith PetscInt *closure = NULL; 2523efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 2524e6ccafaeSMatthew G Knepley 2525e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2526efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2527efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 2528e6ccafaeSMatthew G Knepley PetscInt subVertex; 2529e6ccafaeSMatthew G Knepley 2530efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 2531efa14ee0SMatthew G Knepley ++numCorners; 2532efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 2533efa14ee0SMatthew G Knepley if (subVertex >= 0) { 2534efa14ee0SMatthew G Knepley closure[faceSize] = point; 253565560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 2536e6ccafaeSMatthew G Knepley ++faceSize; 2537e6ccafaeSMatthew G Knepley } 2538e6ccafaeSMatthew G Knepley } 2539e6ccafaeSMatthew G Knepley } 2540efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 2541efa14ee0SMatthew G Knepley if (faceSize == nFV) { 2542cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 2543e6ccafaeSMatthew G Knepley } 254465560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2545e6ccafaeSMatthew G Knepley } 2546efa14ee0SMatthew G Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2547e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2548e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2549e6ccafaeSMatthew G Knepley /* Build coordinates */ 2550efa14ee0SMatthew G Knepley { 2551efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 2552efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 2553efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 2554285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2555efa14ee0SMatthew G Knepley 255669d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2557e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 255869d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2559285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2560285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2561285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2562efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2563efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2564efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2565efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2566efa14ee0SMatthew G Knepley PetscInt dof; 2567efa14ee0SMatthew G Knepley 2568efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2569efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2570285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2571e6ccafaeSMatthew G Knepley } 2572e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2573e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2574e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2575e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 25762eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2577830e53efSMatthew G. Knepley if (coordSize) { 2578e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2579e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2580efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2581efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2582efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2583efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2584e6ccafaeSMatthew G Knepley 2585e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2586e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2587efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2588efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2589efa14ee0SMatthew 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); 2590e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2591e6ccafaeSMatthew G Knepley } 2592e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2593e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 25943b399e24SMatthew G. Knepley } 2595e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2596e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2597e6ccafaeSMatthew G Knepley } 2598efa14ee0SMatthew G Knepley /* Cleanup */ 2599efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2600efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2601efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2602efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2603e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2604e6ccafaeSMatthew G Knepley } 2605e6ccafaeSMatthew G Knepley 2606e6ccafaeSMatthew G Knepley #undef __FUNCT__ 26073982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal" 26083982b651SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 26093982b651SMatthew G. Knepley { 26103982b651SMatthew G. Knepley PetscInt subPoint; 26113982b651SMatthew G. Knepley PetscErrorCode ierr; 26123982b651SMatthew G. Knepley 26133982b651SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 26143982b651SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 26153982b651SMatthew G. Knepley } 26163982b651SMatthew G. Knepley 26173982b651SMatthew G. Knepley #undef __FUNCT__ 26183982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateSubmeshGeneric_Interpolated" 26193982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmeshGeneric_Interpolated(DM dm, DMLabel label, PetscInt value, PetscBool isCohesive, DM subdm) 2620e6ccafaeSMatthew G Knepley { 262182f516ccSBarry Smith MPI_Comm comm; 262253156dfcSMatthew G. Knepley DMLabel subpointMap; 2623efa14ee0SMatthew G Knepley IS *subpointIS; 2624efa14ee0SMatthew G Knepley const PetscInt **subpoints; 26253982b651SMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *orntNew; 2626efa14ee0SMatthew G Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2627e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2628e6ccafaeSMatthew G Knepley 2629e6ccafaeSMatthew G Knepley PetscFunctionBegin; 263082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2631efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2632e6ccafaeSMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2633efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2634efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 26353982b651SMatthew G. Knepley if (isCohesive) {ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);} 26363982b651SMatthew G. Knepley else {ierr = DMPlexMarkSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);} 2637efa14ee0SMatthew G Knepley /* Setup chart */ 2638c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2639dcca6d9dSJed Brown ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr); 2640e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2641e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2642e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 2643e6ccafaeSMatthew G Knepley } 2644e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2645e6ccafaeSMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2646e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2647e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 2648e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2649e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2650e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2651e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2652e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 26530ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2654e6ccafaeSMatthew G Knepley } 2655e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2656e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2657e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2658e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2659e6ccafaeSMatthew G Knepley const PetscInt *cone; 2660e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 2661e6ccafaeSMatthew G Knepley 2662e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2663e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2664e6ccafaeSMatthew G Knepley if (d == dim) { 2665e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2666e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2667e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2668e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 2669e6ccafaeSMatthew G Knepley } 2670e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2671e6ccafaeSMatthew G Knepley } 2672e6ccafaeSMatthew G Knepley } 2673e6ccafaeSMatthew G Knepley } 2674e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2675e6ccafaeSMatthew G Knepley /* Set cones */ 26760298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 26773982b651SMatthew G. Knepley ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&orntNew);CHKERRQ(ierr); 2678e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2679e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2680e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2681e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 26820e49e2e2SMatthew G. Knepley const PetscInt *cone, *ornt; 2683e6ccafaeSMatthew G Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2684e6ccafaeSMatthew G Knepley 2685e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2686e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2687e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 26880e49e2e2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2689e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2690e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 269101a2673eSMatthew G. Knepley if (subc >= 0) { 269201a2673eSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 26933982b651SMatthew G. Knepley orntNew[coneSizeNew] = ornt[c]; 269401a2673eSMatthew G. Knepley ++coneSizeNew; 269501a2673eSMatthew G. Knepley } 2696e6ccafaeSMatthew G Knepley } 2697e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2698e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 26993982b651SMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, orntNew);CHKERRQ(ierr); 2700e6ccafaeSMatthew G Knepley } 2701e6ccafaeSMatthew G Knepley } 27023982b651SMatthew G. Knepley ierr = PetscFree2(coneNew,orntNew);CHKERRQ(ierr); 2703e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2704e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2705e6ccafaeSMatthew G Knepley /* Build coordinates */ 2706e6ccafaeSMatthew G Knepley { 2707e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 2708e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 2709e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 2710285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2711e6ccafaeSMatthew G Knepley 271269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2713e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 271469d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2715285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2716285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2717285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2718e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2719e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2720e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2721e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2722e6ccafaeSMatthew G Knepley PetscInt dof; 2723e6ccafaeSMatthew G Knepley 2724e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2725e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2726285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2727e6ccafaeSMatthew G Knepley } 2728e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2729e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2730e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2731e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 27322eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2733e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2734e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2735e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2736e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2737e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2738e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2739e6ccafaeSMatthew G Knepley 2740e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2741e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2742e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2743e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2744e6ccafaeSMatthew 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); 2745efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2746e6ccafaeSMatthew G Knepley } 2747e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2748e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2749e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2750e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2751e6ccafaeSMatthew G Knepley } 27523982b651SMatthew G. Knepley /* Build SF: We need this complexity because subpoints might not be selected on the owning process */ 27533982b651SMatthew G. Knepley { 27543982b651SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 27553982b651SMatthew G. Knepley IS subpIS; 27563982b651SMatthew G. Knepley const PetscSFNode *remotePoints; 27573982b651SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 27583982b651SMatthew G. Knepley const PetscInt *localPoints, *subpoints; 27593982b651SMatthew G. Knepley PetscInt *slocalPoints; 27603982b651SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubpoints = 0, numSubroots, numSubleaves = 0, l, sl, ll, pStart, pEnd, p; 27613982b651SMatthew G. Knepley PetscMPIInt rank; 27623982b651SMatthew G. Knepley 27633982b651SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 27643982b651SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 27653982b651SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 27663982b651SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 27673982b651SMatthew G. Knepley ierr = DMPlexGetChart(subdm, NULL, &numSubroots);CHKERRQ(ierr); 27683982b651SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpIS);CHKERRQ(ierr); 27693982b651SMatthew G. Knepley if (subpIS) { 27703982b651SMatthew G. Knepley ierr = ISGetIndices(subpIS, &subpoints);CHKERRQ(ierr); 27713982b651SMatthew G. Knepley ierr = ISGetLocalSize(subpIS, &numSubpoints);CHKERRQ(ierr); 27723982b651SMatthew G. Knepley } 27733982b651SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 27743982b651SMatthew G. Knepley if (numRoots >= 0) { 27753982b651SMatthew G. Knepley ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 27763982b651SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 27773982b651SMatthew G. Knepley newLocalPoints[p].rank = -2; 27783982b651SMatthew G. Knepley newLocalPoints[p].index = -2; 27793982b651SMatthew G. Knepley } 27803982b651SMatthew G. Knepley /* Set subleaves */ 27813982b651SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 27823982b651SMatthew G. Knepley const PetscInt point = localPoints[l]; 27833982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 27843982b651SMatthew G. Knepley 27853982b651SMatthew G. Knepley if (subpoint < 0) continue; 27863982b651SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 27873982b651SMatthew G. Knepley newLocalPoints[point-pStart].index = subpoint; 27883982b651SMatthew G. Knepley ++numSubleaves; 27893982b651SMatthew G. Knepley } 27903982b651SMatthew G. Knepley /* Must put in owned subpoints */ 27913982b651SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 27923982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(p, 0, numSubpoints, subpoints); 27933982b651SMatthew G. Knepley 27943982b651SMatthew G. Knepley if (subpoint < 0) { 27953982b651SMatthew G. Knepley newOwners[p-pStart].rank = -3; 27963982b651SMatthew G. Knepley newOwners[p-pStart].index = -3; 27973982b651SMatthew G. Knepley } else { 27983982b651SMatthew G. Knepley newOwners[p-pStart].rank = rank; 27993982b651SMatthew G. Knepley newOwners[p-pStart].index = subpoint; 28003982b651SMatthew G. Knepley } 28013982b651SMatthew G. Knepley } 28023982b651SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 28033982b651SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 28043982b651SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 28053982b651SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 28063982b651SMatthew G. Knepley ierr = PetscMalloc1(numSubleaves, &slocalPoints);CHKERRQ(ierr); 28073982b651SMatthew G. Knepley ierr = PetscMalloc1(numSubleaves, &sremotePoints);CHKERRQ(ierr); 28083982b651SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 28093982b651SMatthew G. Knepley const PetscInt point = localPoints[l]; 28103982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 28113982b651SMatthew G. Knepley 28123982b651SMatthew G. Knepley if (subpoint < 0) continue; 28133982b651SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 28143982b651SMatthew G. Knepley slocalPoints[sl] = subpoint; 28153982b651SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 28163982b651SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 28173982b651SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 28183982b651SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 28193982b651SMatthew G. Knepley ++sl; 28203982b651SMatthew G. Knepley } 28213982b651SMatthew G. Knepley if (sl + ll != numSubleaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubleaves); 28223982b651SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 28233982b651SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubroots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 28243982b651SMatthew G. Knepley } 28253982b651SMatthew G. Knepley if (subpIS) { 28263982b651SMatthew G. Knepley ierr = ISRestoreIndices(subpIS, &subpoints);CHKERRQ(ierr); 28273982b651SMatthew G. Knepley ierr = ISDestroy(&subpIS);CHKERRQ(ierr); 28283982b651SMatthew G. Knepley } 28293982b651SMatthew G. Knepley } 2830efa14ee0SMatthew G Knepley /* Cleanup */ 2831e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 28320ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2833e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2834e6ccafaeSMatthew G Knepley } 2835efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2836e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2837e6ccafaeSMatthew G Knepley } 2838e6ccafaeSMatthew G Knepley 2839e6ccafaeSMatthew G Knepley #undef __FUNCT__ 28403982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated" 28413982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 28423982b651SMatthew G. Knepley { 28433982b651SMatthew G. Knepley PetscErrorCode ierr; 28443982b651SMatthew G. Knepley 28453982b651SMatthew G. Knepley PetscFunctionBegin; 28463982b651SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, vertexLabel, value, PETSC_FALSE, subdm);CHKERRQ(ierr); 28473982b651SMatthew G. Knepley PetscFunctionReturn(0); 28483982b651SMatthew G. Knepley } 28493982b651SMatthew G. Knepley 28503982b651SMatthew G. Knepley #undef __FUNCT__ 2851e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh" 2852d0fa310fSMatthew G. Knepley /*@ 2853e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 2854e6ccafaeSMatthew G Knepley 2855e6ccafaeSMatthew G Knepley Input Parameters: 2856e6ccafaeSMatthew G Knepley + dm - The original mesh 2857830e53efSMatthew G. Knepley . vertexLabel - The DMLabel marking vertices contained in the surface 2858830e53efSMatthew G. Knepley - value - The label value to use 2859e6ccafaeSMatthew G Knepley 2860e6ccafaeSMatthew G Knepley Output Parameter: 2861e6ccafaeSMatthew G Knepley . subdm - The surface mesh 2862e6ccafaeSMatthew G Knepley 2863e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2864e6ccafaeSMatthew G Knepley 2865e6ccafaeSMatthew G Knepley Level: developer 2866e6ccafaeSMatthew G Knepley 2867e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue() 2868830e53efSMatthew G. Knepley @*/ 286953156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm) 2870e6ccafaeSMatthew G Knepley { 2871e6ccafaeSMatthew G Knepley PetscInt dim, depth; 2872e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2873e6ccafaeSMatthew G Knepley 2874e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2875e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2876766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 2877c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2878e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 287982f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2880e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2881c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2882e6ccafaeSMatthew G Knepley if (depth == dim) { 2883830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2884e6ccafaeSMatthew G Knepley } else { 2885830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2886e6ccafaeSMatthew G Knepley } 2887e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2888e6ccafaeSMatthew G Knepley } 2889e6ccafaeSMatthew G Knepley 2890e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2891766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated" 289227c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 2893766ab985SMatthew G. Knepley { 2894766ab985SMatthew G. Knepley MPI_Comm comm; 2895766ab985SMatthew G. Knepley DMLabel subpointMap; 2896766ab985SMatthew G. Knepley IS subvertexIS; 2897766ab985SMatthew G. Knepley const PetscInt *subVertices; 2898fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 2899766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 290087feddfdSMatthew G. Knepley PetscInt cMax, c, f; 2901766ab985SMatthew G. Knepley PetscErrorCode ierr; 2902766ab985SMatthew G. Knepley 2903766ab985SMatthew G. Knepley PetscFunctionBegin; 2904766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 2905766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2906766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2907766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2908766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 290927c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 2910766ab985SMatthew G. Knepley /* Setup chart */ 2911766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2912766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2913766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2914766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2915766ab985SMatthew G. Knepley /* Set cone sizes */ 2916766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 2917766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 2918766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 2919766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2920766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2921766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2922766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2923766ab985SMatthew G. Knepley } 2924766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2925766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2926766ab985SMatthew G. Knepley } 2927766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2928766ab985SMatthew G. Knepley /* Create face cones */ 2929766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 293087feddfdSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2931766ab985SMatthew G. Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2932766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2933766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 2934766ab985SMatthew G. Knepley const PetscInt subcell = c; 293587feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 293687feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 2937766ab985SMatthew G. Knepley 293887feddfdSMatthew G. Knepley if (cell < cMax) continue; 293987feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 294087feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 294187feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 294287feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 294387feddfdSMatthew G. Knepley } 294487feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 294587feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 294687feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 294727234c99SMatthew G. Knepley /* Not true in parallel 294827234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 294987feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 295087feddfdSMatthew G. Knepley PetscInt negsubcell; 2951766ab985SMatthew G. Knepley 295287feddfdSMatthew G. Knepley if (cells[p] >= cMax) continue; 295387feddfdSMatthew G. Knepley /* I know this is a crap search */ 295487feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 295587feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 2956766ab985SMatthew G. Knepley } 295787feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 295887feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 2959766ab985SMatthew G. Knepley } 296087feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 296187feddfdSMatthew G. Knepley ++newFacePoint; 2962766ab985SMatthew G. Knepley } 2963766ab985SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2964766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2965766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2966766ab985SMatthew G. Knepley /* Build coordinates */ 2967766ab985SMatthew G. Knepley { 2968766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2969766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2970766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2971285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2972766ab985SMatthew G. Knepley 297369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2974766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 297569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2976285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2977285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2978285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2979766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2980766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2981766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2982766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2983766ab985SMatthew G. Knepley PetscInt dof; 2984766ab985SMatthew G. Knepley 2985766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2986766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2987285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2988766ab985SMatthew G. Knepley } 2989766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2990766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2991766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2992766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 29932eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2994766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2995766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2996766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2997766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2998766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2999766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 3000766ab985SMatthew G. Knepley 3001766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3002766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 3003766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 3004766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 3005766ab985SMatthew 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); 3006766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 3007766ab985SMatthew G. Knepley } 3008766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3009766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3010766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 3011766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 3012766ab985SMatthew G. Knepley } 3013aca35d17SMatthew G. Knepley /* Build SF */ 3014aca35d17SMatthew G. Knepley CHKMEMQ; 3015aca35d17SMatthew G. Knepley { 3016aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 3017aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 3018bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 3019aca35d17SMatthew G. Knepley const PetscInt *localPoints; 3020bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 302149c26ae4SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 3022bdcf2095SMatthew G. Knepley PetscMPIInt rank; 3023aca35d17SMatthew G. Knepley 3024bdcf2095SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 3025aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 3026aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 3027aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3028aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3029aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 3030aca35d17SMatthew G. Knepley if (numRoots >= 0) { 3031aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 3032dcca6d9dSJed Brown ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 3033bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 3034bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 3035bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 3036bdcf2095SMatthew G. Knepley } 30379e0823b2SMatthew G. Knepley /* Set subleaves */ 3038aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 3039aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 3040bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 3041aca35d17SMatthew G. Knepley 3042aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 3043bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 3044bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 3045bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 3046bdcf2095SMatthew G. Knepley ++numSubLeaves; 3047aca35d17SMatthew G. Knepley } 30489e0823b2SMatthew G. Knepley /* Must put in owned subpoints */ 30499e0823b2SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 30509e0823b2SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 30519e0823b2SMatthew G. Knepley 30529e0823b2SMatthew G. Knepley if (subPoint < 0) { 30539e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = -3; 30549e0823b2SMatthew G. Knepley newOwners[p-pStart].index = -3; 30559e0823b2SMatthew G. Knepley } else { 30569e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = rank; 30579e0823b2SMatthew G. Knepley newOwners[p-pStart].index = subPoint; 30589e0823b2SMatthew G. Knepley } 3059bdcf2095SMatthew G. Knepley } 3060bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3061bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3062bdcf2095SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3063bdcf2095SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3064785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &slocalPoints);CHKERRQ(ierr); 3065785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &sremotePoints);CHKERRQ(ierr); 306649c26ae4SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 3067bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 3068bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 3069aca35d17SMatthew G. Knepley 3070aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 307149c26ae4SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 3072aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 3073bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 3074bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 3075bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 3076bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 3077aca35d17SMatthew G. Knepley ++sl; 3078aca35d17SMatthew G. Knepley } 3079bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 308049c26ae4SMatthew G. Knepley if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 308149c26ae4SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 3082aca35d17SMatthew G. Knepley } 3083aca35d17SMatthew G. Knepley } 3084aca35d17SMatthew G. Knepley CHKMEMQ; 3085766ab985SMatthew G. Knepley /* Cleanup */ 3086766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 3087766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 3088766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 3089766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3090766ab985SMatthew G. Knepley } 3091766ab985SMatthew G. Knepley 3092766ab985SMatthew G. Knepley #undef __FUNCT__ 3093766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated" 30943982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DM subdm) 3095766ab985SMatthew G. Knepley { 30963982b651SMatthew G. Knepley DMLabel label = NULL; 3097766ab985SMatthew G. Knepley PetscErrorCode ierr; 3098766ab985SMatthew G. Knepley 3099766ab985SMatthew G. Knepley PetscFunctionBegin; 31003982b651SMatthew G. Knepley if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 31013982b651SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, label, value, PETSC_TRUE, subdm);CHKERRQ(ierr); 3102766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3103766ab985SMatthew G. Knepley } 3104766ab985SMatthew G. Knepley 3105766ab985SMatthew G. Knepley #undef __FUNCT__ 3106766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh" 3107766ab985SMatthew G. Knepley /* 310827c04023SMatthew 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. 3109766ab985SMatthew G. Knepley 3110766ab985SMatthew G. Knepley Input Parameters: 3111766ab985SMatthew G. Knepley + dm - The original mesh 311227c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 31137afc1a8bSJed Brown . label - A label name, or NULL 311427c04023SMatthew G. Knepley - value - A label value 3115766ab985SMatthew G. Knepley 3116766ab985SMatthew G. Knepley Output Parameter: 3117766ab985SMatthew G. Knepley . subdm - The surface mesh 3118766ab985SMatthew G. Knepley 3119766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3120766ab985SMatthew G. Knepley 3121766ab985SMatthew G. Knepley Level: developer 3122766ab985SMatthew G. Knepley 3123766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 3124766ab985SMatthew G. Knepley */ 312527c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 3126766ab985SMatthew G. Knepley { 3127766ab985SMatthew G. Knepley PetscInt dim, depth; 3128766ab985SMatthew G. Knepley PetscErrorCode ierr; 3129766ab985SMatthew G. Knepley 3130766ab985SMatthew G. Knepley PetscFunctionBegin; 3131766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 313227c04023SMatthew G. Knepley PetscValidPointer(subdm, 5); 3133c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3134766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3135766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 3136766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3137c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr); 3138766ab985SMatthew G. Knepley if (depth == dim) { 3139b3154360SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr); 3140766ab985SMatthew G. Knepley } else { 314127c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 3142e6ccafaeSMatthew G Knepley } 3143e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3144e6ccafaeSMatthew G Knepley } 3145e6ccafaeSMatthew G Knepley 3146e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3147e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap" 314864beef6dSMatthew G. Knepley /*@ 314964beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 315064beef6dSMatthew G. Knepley 315164beef6dSMatthew G. Knepley Input Parameter: 315264beef6dSMatthew G. Knepley . dm - The submesh DM 315364beef6dSMatthew G. Knepley 315464beef6dSMatthew G. Knepley Output Parameter: 315564beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 315664beef6dSMatthew G. Knepley 315764beef6dSMatthew G. Knepley Level: developer 315864beef6dSMatthew G. Knepley 315964beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 316064beef6dSMatthew G. Knepley @*/ 3161e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 3162e6ccafaeSMatthew G Knepley { 3163e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3164e6ccafaeSMatthew G Knepley 3165e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3166e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3167e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 3168e6ccafaeSMatthew G Knepley *subpointMap = mesh->subpointMap; 3169e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3170e6ccafaeSMatthew G Knepley } 3171e6ccafaeSMatthew G Knepley 3172e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3173e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap" 3174e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */ 3175e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 3176e6ccafaeSMatthew G Knepley { 3177e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 3178285d324eSMatthew G. Knepley DMLabel tmp; 3179e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3180e6ccafaeSMatthew G Knepley 3181e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3182e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3183285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 3184e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 3185285d324eSMatthew G. Knepley ++mesh->subpointMap->refct; 3186285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 3187e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3188e6ccafaeSMatthew G Knepley } 3189e6ccafaeSMatthew G Knepley 3190e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3191e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS" 319264beef6dSMatthew G. Knepley /*@ 3193e6ccafaeSMatthew G Knepley DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 3194e6ccafaeSMatthew G Knepley 3195e6ccafaeSMatthew G Knepley Input Parameter: 3196e6ccafaeSMatthew G Knepley . dm - The submesh DM 3197e6ccafaeSMatthew G Knepley 3198e6ccafaeSMatthew G Knepley Output Parameter: 31990298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 3200e6ccafaeSMatthew G Knepley 32013982b651SMatthew G. Knepley Note: This IS is guaranteed to be sorted by the construction of the submesh 320264beef6dSMatthew G. Knepley 320364beef6dSMatthew G. Knepley Level: developer 320464beef6dSMatthew G. Knepley 320564beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 320664beef6dSMatthew G. Knepley @*/ 3207e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 3208e6ccafaeSMatthew G Knepley { 320982f516ccSBarry Smith MPI_Comm comm; 3210e6ccafaeSMatthew G Knepley DMLabel subpointMap; 3211e6ccafaeSMatthew G Knepley IS is; 3212e6ccafaeSMatthew G Knepley const PetscInt *opoints; 3213e6ccafaeSMatthew G Knepley PetscInt *points, *depths; 3214e6ccafaeSMatthew G Knepley PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 3215e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3216e6ccafaeSMatthew G Knepley 3217e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3218e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3219e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 322082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 32210298fd71SBarry Smith *subpointIS = NULL; 3222e6ccafaeSMatthew G Knepley ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 3223e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3224fed694aaSMatthew G. Knepley if (subpointMap && depth >= 0) { 3225e6ccafaeSMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3226e6ccafaeSMatthew G Knepley if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 3227e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3228e6ccafaeSMatthew G Knepley depths[0] = depth; 3229e6ccafaeSMatthew G Knepley depths[1] = 0; 3230e6ccafaeSMatthew G Knepley for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 3231785e854fSJed Brown ierr = PetscMalloc1(pEnd, &points);CHKERRQ(ierr); 3232e6ccafaeSMatthew G Knepley for(d = 0, off = 0; d <= depth; ++d) { 3233e6ccafaeSMatthew G Knepley const PetscInt dep = depths[d]; 3234e6ccafaeSMatthew G Knepley 3235e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 3236e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 32371e21b6fdSMatthew G Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 3238e6ccafaeSMatthew 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); 3239e6ccafaeSMatthew G Knepley } else { 32401e21b6fdSMatthew G Knepley if (!n) { 32411e21b6fdSMatthew G Knepley if (d == 0) { 32421e21b6fdSMatthew G Knepley /* Missing cells */ 32431e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 32441e21b6fdSMatthew G Knepley } else { 32451e21b6fdSMatthew G Knepley /* Missing faces */ 32461e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 32471e21b6fdSMatthew G Knepley } 32481e21b6fdSMatthew G Knepley } 3249e6ccafaeSMatthew G Knepley } 3250e6ccafaeSMatthew G Knepley if (n) { 3251e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 3252e6ccafaeSMatthew G Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 3253e6ccafaeSMatthew G Knepley for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 3254e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 3255e6ccafaeSMatthew G Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 3256e6ccafaeSMatthew G Knepley } 3257e6ccafaeSMatthew G Knepley } 3258e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3259e6ccafaeSMatthew G Knepley if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 3260fed694aaSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 3261e6ccafaeSMatthew G Knepley } 3262e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3263e6ccafaeSMatthew G Knepley } 3264