134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 20c312b8eSJed Brown #include <petscsf.h> 3e6ccafaeSMatthew G Knepley 4e6ccafaeSMatthew G Knepley #undef __FUNCT__ 5cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces" 6cd0c2139SMatthew G Knepley /*@ 7cd0c2139SMatthew G Knepley DMPlexMarkBoundaryFaces - Mark all faces on the boundary 8cd0c2139SMatthew G Knepley 9cd0c2139SMatthew G Knepley Not Collective 10cd0c2139SMatthew G Knepley 11cd0c2139SMatthew G Knepley Input Parameter: 12cd0c2139SMatthew G Knepley . dm - The original DM 13cd0c2139SMatthew G Knepley 14cd0c2139SMatthew G Knepley Output Parameter: 15cd0c2139SMatthew G Knepley . label - The DMLabel marking boundary faces with value 1 16cd0c2139SMatthew G Knepley 17cd0c2139SMatthew G Knepley Level: developer 18cd0c2139SMatthew G Knepley 19cd0c2139SMatthew G Knepley .seealso: DMLabelCreate(), DMPlexCreateLabel() 2009f723d9SJed Brown @*/ 21cd0c2139SMatthew G Knepley PetscErrorCode DMPlexMarkBoundaryFaces(DM dm, DMLabel label) 22cd0c2139SMatthew G Knepley { 23cd0c2139SMatthew G Knepley PetscInt fStart, fEnd, f; 24cd0c2139SMatthew G Knepley PetscErrorCode ierr; 25cd0c2139SMatthew G Knepley 26cd0c2139SMatthew G Knepley PetscFunctionBegin; 27cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 28cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 29cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 30cd0c2139SMatthew G Knepley PetscInt supportSize; 31cd0c2139SMatthew G Knepley 32cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 33cd0c2139SMatthew G Knepley if (supportSize == 1) { 34cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, f, 1);CHKERRQ(ierr); 35cd0c2139SMatthew G Knepley } 36cd0c2139SMatthew G Knepley } 37cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 38cd0c2139SMatthew G Knepley } 39cd0c2139SMatthew G Knepley 40cd0c2139SMatthew G Knepley #undef __FUNCT__ 412be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelComplete" 422be2b188SMatthew G Knepley /*@ 432be2b188SMatthew G Knepley DMPlexLabelComplete - Starting with a label marking points on a surface, we add the transitive closure to the surface 442be2b188SMatthew G Knepley 452be2b188SMatthew G Knepley Input Parameters: 462be2b188SMatthew G Knepley + dm - The DM 472be2b188SMatthew G Knepley - label - A DMLabel marking the surface points 482be2b188SMatthew G Knepley 492be2b188SMatthew G Knepley Output Parameter: 502be2b188SMatthew G Knepley . label - A DMLabel marking all surface points in the transitive closure 512be2b188SMatthew G Knepley 522be2b188SMatthew G Knepley Level: developer 532be2b188SMatthew G Knepley 542be2b188SMatthew G Knepley .seealso: DMPlexLabelCohesiveComplete() 552be2b188SMatthew G Knepley @*/ 562be2b188SMatthew G Knepley PetscErrorCode DMPlexLabelComplete(DM dm, DMLabel label) 572be2b188SMatthew G Knepley { 582be2b188SMatthew G Knepley IS valueIS; 592be2b188SMatthew G Knepley const PetscInt *values; 602be2b188SMatthew G Knepley PetscInt numValues, v; 612be2b188SMatthew G Knepley PetscErrorCode ierr; 622be2b188SMatthew G Knepley 632be2b188SMatthew G Knepley PetscFunctionBegin; 642be2b188SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 652be2b188SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 662be2b188SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 672be2b188SMatthew G Knepley for (v = 0; v < numValues; ++v) { 682be2b188SMatthew G Knepley IS pointIS; 692be2b188SMatthew G Knepley const PetscInt *points; 702be2b188SMatthew G Knepley PetscInt numPoints, p; 712be2b188SMatthew G Knepley 722be2b188SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 732be2b188SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 742be2b188SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 752be2b188SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 762be2b188SMatthew G Knepley PetscInt *closure = NULL; 772be2b188SMatthew G Knepley PetscInt closureSize, c; 782be2b188SMatthew G Knepley 792be2b188SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 802be2b188SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 812be2b188SMatthew G Knepley ierr = DMLabelSetValue(label, closure[c], values[v]);CHKERRQ(ierr); 822be2b188SMatthew G Knepley } 832be2b188SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 842be2b188SMatthew G Knepley } 852be2b188SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 862be2b188SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 872be2b188SMatthew G Knepley } 882be2b188SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 892be2b188SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 902be2b188SMatthew G Knepley PetscFunctionReturn(0); 912be2b188SMatthew G Knepley } 922be2b188SMatthew G Knepley 932be2b188SMatthew G Knepley #undef __FUNCT__ 946cf0e42fSMatthew G. Knepley #define __FUNCT__ "DMPlexLabelAddCells" 956cf0e42fSMatthew G. Knepley /*@ 966cf0e42fSMatthew G. Knepley DMPlexLabelAddCells - Starting with a label marking faces on a surface, we add a cell for each face 976cf0e42fSMatthew G. Knepley 986cf0e42fSMatthew G. Knepley Input Parameters: 996cf0e42fSMatthew G. Knepley + dm - The DM 1006cf0e42fSMatthew G. Knepley - label - A DMLabel marking the surface points 1016cf0e42fSMatthew G. Knepley 1026cf0e42fSMatthew G. Knepley Output Parameter: 1036cf0e42fSMatthew G. Knepley . label - A DMLabel incorporating cells 1046cf0e42fSMatthew G. Knepley 1056cf0e42fSMatthew G. Knepley Level: developer 1066cf0e42fSMatthew G. Knepley 1076cf0e42fSMatthew G. Knepley Note: The cells allow FEM boundary conditions to be applied using the cell geometry 1086cf0e42fSMatthew G. Knepley 1096cf0e42fSMatthew G. Knepley .seealso: DMPlexLabelComplete(), DMPlexLabelCohesiveComplete() 1106cf0e42fSMatthew G. Knepley @*/ 1116cf0e42fSMatthew G. Knepley PetscErrorCode DMPlexLabelAddCells(DM dm, DMLabel label) 1126cf0e42fSMatthew G. Knepley { 1136cf0e42fSMatthew G. Knepley IS valueIS; 1146cf0e42fSMatthew G. Knepley const PetscInt *values; 1156cf0e42fSMatthew G. Knepley PetscInt numValues, v, cStart, cEnd; 1166cf0e42fSMatthew G. Knepley PetscErrorCode ierr; 1176cf0e42fSMatthew G. Knepley 1186cf0e42fSMatthew G. Knepley PetscFunctionBegin; 1196cf0e42fSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1206cf0e42fSMatthew G. Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 1216cf0e42fSMatthew G. Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 1226cf0e42fSMatthew G. Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 1236cf0e42fSMatthew G. Knepley for (v = 0; v < numValues; ++v) { 1246cf0e42fSMatthew G. Knepley IS pointIS; 1256cf0e42fSMatthew G. Knepley const PetscInt *points; 1266cf0e42fSMatthew G. Knepley PetscInt numPoints, p; 1276cf0e42fSMatthew G. Knepley 1286cf0e42fSMatthew G. Knepley ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 1296cf0e42fSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 1306cf0e42fSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 1316cf0e42fSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1326cf0e42fSMatthew G. Knepley PetscInt *closure = NULL; 1336cf0e42fSMatthew G. Knepley PetscInt closureSize, point; 1346cf0e42fSMatthew G. Knepley 1356cf0e42fSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 1366cf0e42fSMatthew G. Knepley point = closure[(closureSize-1)*2]; 1376cf0e42fSMatthew G. Knepley if ((point >= cStart) && (point < cEnd)) {ierr = DMLabelSetValue(label, point, values[v]);CHKERRQ(ierr);} 1386cf0e42fSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 1396cf0e42fSMatthew G. Knepley } 1406cf0e42fSMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 1416cf0e42fSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 1426cf0e42fSMatthew G. Knepley } 1436cf0e42fSMatthew G. Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1446cf0e42fSMatthew G. Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1456cf0e42fSMatthew G. Knepley PetscFunctionReturn(0); 1466cf0e42fSMatthew G. Knepley } 1476cf0e42fSMatthew G. Knepley 1486cf0e42fSMatthew G. Knepley #undef __FUNCT__ 149cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoint_Internal" 150a6ae58d1SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthMax[], PetscInt depthEnd[], PetscInt depthShift[]) 151cd0c2139SMatthew G Knepley { 152cd0c2139SMatthew G Knepley if (depth < 0) return p; 153a6ae58d1SMatthew G. Knepley /* Normal Cells */ if (p < depthMax[depth]) return p; 154a6ae58d1SMatthew G. Knepley /* Hybrid Cells+Normal Vertices */ if (p < depthMax[0]) return p + depthShift[depth]; 155a6ae58d1SMatthew G. Knepley /* Hybrid Vertices+Normal Faces */ if (depth < 2 || p < depthMax[depth-1]) return p + depthShift[depth] + depthShift[0]; 156a6ae58d1SMatthew G. Knepley /* Hybrid Faces+Normal Edges */ if (depth < 3 || p < depthMax[depth-2]) return p + depthShift[depth] + depthShift[0] + depthShift[depth-1]; 157a6ae58d1SMatthew G. Knepley /* Hybrid Edges */ return p + depthShift[depth] + depthShift[0] + depthShift[depth-1] + depthShift[depth-2]; 158cd0c2139SMatthew G Knepley } 159cd0c2139SMatthew G Knepley 160cd0c2139SMatthew G Knepley #undef __FUNCT__ 161cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSizes_Internal" 162cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew) 163cd0c2139SMatthew G Knepley { 164a6ae58d1SMatthew G. Knepley PetscInt *depthMax, *depthEnd; 165cd0c2139SMatthew G Knepley PetscInt depth = 0, d, pStart, pEnd, p; 166cd0c2139SMatthew G Knepley PetscErrorCode ierr; 167cd0c2139SMatthew G Knepley 168cd0c2139SMatthew G Knepley PetscFunctionBegin; 169cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 170cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 1712203a8e9SMatthew G. Knepley ierr = PetscMalloc2(depth+1,&depthMax,depth+1,&depthEnd);CHKERRQ(ierr); 172cd0c2139SMatthew G Knepley /* Step 1: Expand chart */ 173cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 174a6ae58d1SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &depthMax[depth], depth > 0 ? &depthMax[depth-1] : NULL, &depthMax[1], &depthMax[0]);CHKERRQ(ierr); 175cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 176cd0c2139SMatthew G Knepley pEnd += depthShift[d]; 177cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 178a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 179cd0c2139SMatthew G Knepley } 180cd0c2139SMatthew G Knepley ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr); 181cd0c2139SMatthew G Knepley /* Step 2: Set cone and support sizes */ 182cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 183cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 184cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 185a6ae58d1SMatthew G. Knepley PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthMax, depthEnd, depthShift); 186cd0c2139SMatthew G Knepley PetscInt size; 187cd0c2139SMatthew G Knepley 188cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 189cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr); 190cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 191cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr); 192cd0c2139SMatthew G Knepley } 193cd0c2139SMatthew G Knepley } 194a6ae58d1SMatthew G. Knepley ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr); 195cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 196cd0c2139SMatthew G Knepley } 197cd0c2139SMatthew G Knepley 198cd0c2139SMatthew G Knepley #undef __FUNCT__ 199cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoints_Internal" 200cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew) 201cd0c2139SMatthew G Knepley { 202a6ae58d1SMatthew G. Knepley PetscInt *depthEnd, *depthMax, *newpoints; 203dcbb62e8SMatthew G. Knepley PetscInt depth = 0, d, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, pStart, pEnd, p; 204cd0c2139SMatthew G Knepley PetscErrorCode ierr; 205cd0c2139SMatthew G Knepley 206cd0c2139SMatthew G Knepley PetscFunctionBegin; 207cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 208cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 209cd0c2139SMatthew G Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 210dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dmNew, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 2112203a8e9SMatthew G. Knepley ierr = PetscMalloc3(depth+1,&depthEnd,depth+1,&depthMax,PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),&newpoints);CHKERRQ(ierr); 212a6ae58d1SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &depthMax[depth], depth > 0 ? &depthMax[depth-1] : NULL, &depthMax[1], &depthMax[0]);CHKERRQ(ierr); 213cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 214cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 215a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 216cd0c2139SMatthew G Knepley } 217cd0c2139SMatthew G Knepley /* Step 5: Set cones and supports */ 218cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 219cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 220cd0c2139SMatthew G Knepley const PetscInt *points = NULL, *orientations = NULL; 221a6ae58d1SMatthew G. Knepley PetscInt size,sizeNew, i, newp = DMPlexShiftPoint_Internal(p, depth, depthMax, depthEnd, depthShift); 222cd0c2139SMatthew G Knepley 223cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 224cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr); 225cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr); 226cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 227a6ae58d1SMatthew G. Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthMax, depthEnd, depthShift); 228cd0c2139SMatthew G Knepley } 229cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr); 230cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr); 231cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 232dcbb62e8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmNew, newp, &sizeNew);CHKERRQ(ierr); 233cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr); 234cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 235a6ae58d1SMatthew G. Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthMax, depthEnd, depthShift); 236cd0c2139SMatthew G Knepley } 237dcbb62e8SMatthew G. Knepley for (i = size; i < sizeNew; ++i) newpoints[i] = 0; 238cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr); 239cd0c2139SMatthew G Knepley } 240a6ae58d1SMatthew G. Knepley ierr = PetscFree3(depthEnd,depthMax,newpoints);CHKERRQ(ierr); 241cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 242cd0c2139SMatthew G Knepley } 243cd0c2139SMatthew G Knepley 244cd0c2139SMatthew G Knepley #undef __FUNCT__ 245cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftCoordinates_Internal" 246cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew) 247cd0c2139SMatthew G Knepley { 248cd0c2139SMatthew G Knepley PetscSection coordSection, newCoordSection; 249cd0c2139SMatthew G Knepley Vec coordinates, newCoordinates; 250cd0c2139SMatthew G Knepley PetscScalar *coords, *newCoords; 251cd0c2139SMatthew G Knepley PetscInt *depthEnd, coordSize; 252cd0c2139SMatthew G Knepley PetscInt dim, depth = 0, d, vStart, vEnd, vStartNew, vEndNew, v; 253cd0c2139SMatthew G Knepley PetscErrorCode ierr; 254cd0c2139SMatthew G Knepley 255cd0c2139SMatthew G Knepley PetscFunctionBegin; 256cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 257cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 258785e854fSJed Brown ierr = PetscMalloc1((depth+1), &depthEnd);CHKERRQ(ierr); 259cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 260cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 261cd0c2139SMatthew G Knepley } 262cd0c2139SMatthew G Knepley /* Step 8: Convert coordinates */ 263cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 264cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr); 26569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 266cd0c2139SMatthew G Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr); 267cd0c2139SMatthew G Knepley ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr); 268cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr); 269cd0c2139SMatthew G Knepley ierr = PetscSectionSetChart(newCoordSection, vStartNew, vEndNew);CHKERRQ(ierr); 270cd0c2139SMatthew G Knepley for (v = vStartNew; v < vEndNew; ++v) { 271cd0c2139SMatthew G Knepley ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr); 272cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr); 273cd0c2139SMatthew G Knepley } 274cd0c2139SMatthew G Knepley ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr); 27569d8a9ceSMatthew G. Knepley ierr = DMSetCoordinateSection(dmNew, newCoordSection);CHKERRQ(ierr); 276cd0c2139SMatthew G Knepley ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr); 277cd0c2139SMatthew G Knepley ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr); 278cd0c2139SMatthew G Knepley ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr); 279cd0c2139SMatthew G Knepley ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2802eb5907fSJed Brown ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr); 281cd0c2139SMatthew G Knepley ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr); 282cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 283cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 284cd0c2139SMatthew G Knepley ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr); 285cd0c2139SMatthew G Knepley for (v = vStart; v < vEnd; ++v) { 286cd0c2139SMatthew G Knepley PetscInt dof, off, noff, d; 287cd0c2139SMatthew G Knepley 288cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 289cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 290a6ae58d1SMatthew G. Knepley ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthEnd, depthEnd, depthShift), &noff);CHKERRQ(ierr); 291cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) { 292cd0c2139SMatthew G Knepley newCoords[noff+d] = coords[off+d]; 293cd0c2139SMatthew G Knepley } 294cd0c2139SMatthew G Knepley } 295cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 296cd0c2139SMatthew G Knepley ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr); 297cd0c2139SMatthew G Knepley ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 298cd0c2139SMatthew G Knepley ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr); 299cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 300cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 301cd0c2139SMatthew G Knepley } 302cd0c2139SMatthew G Knepley 303cd0c2139SMatthew G Knepley #undef __FUNCT__ 304cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal" 305cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew) 306cd0c2139SMatthew G Knepley { 307a6ae58d1SMatthew G. Knepley PetscInt *depthMax, *depthEnd; 308cd0c2139SMatthew G Knepley PetscInt depth = 0, d; 309cd0c2139SMatthew G Knepley PetscSF sfPoint, sfPointNew; 310cd0c2139SMatthew G Knepley const PetscSFNode *remotePoints; 311cd0c2139SMatthew G Knepley PetscSFNode *gremotePoints; 312cd0c2139SMatthew G Knepley const PetscInt *localPoints; 313cd0c2139SMatthew G Knepley PetscInt *glocalPoints, *newLocation, *newRemoteLocation; 314cd0c2139SMatthew G Knepley PetscInt numRoots, numLeaves, l, pStart, pEnd, totShift = 0; 315cd0c2139SMatthew G Knepley PetscErrorCode ierr; 316cd0c2139SMatthew G Knepley 317cd0c2139SMatthew G Knepley PetscFunctionBegin; 318cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3192203a8e9SMatthew G. Knepley ierr = PetscMalloc2(depth+1,&depthMax,depth+1,&depthEnd);CHKERRQ(ierr); 320a6ae58d1SMatthew 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); 321cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 322cd0c2139SMatthew G Knepley totShift += depthShift[d]; 323cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 324a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 325cd0c2139SMatthew G Knepley } 326cd0c2139SMatthew G Knepley /* Step 9: Convert pointSF */ 327cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 328cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr); 329cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 330cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 331cd0c2139SMatthew G Knepley if (numRoots >= 0) { 332dcca6d9dSJed Brown ierr = PetscMalloc2(numRoots,&newLocation,pEnd-pStart,&newRemoteLocation);CHKERRQ(ierr); 333a6ae58d1SMatthew G. Knepley for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthMax, depthEnd, depthShift); 334cd0c2139SMatthew G Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 335cd0c2139SMatthew G Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 336785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &glocalPoints);CHKERRQ(ierr); 337785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &gremotePoints);CHKERRQ(ierr); 338cd0c2139SMatthew G Knepley for (l = 0; l < numLeaves; ++l) { 339a6ae58d1SMatthew G. Knepley glocalPoints[l] = DMPlexShiftPoint_Internal(localPoints[l], depth, depthMax, depthEnd, depthShift); 340cd0c2139SMatthew G Knepley gremotePoints[l].rank = remotePoints[l].rank; 341cd0c2139SMatthew G Knepley gremotePoints[l].index = newRemoteLocation[localPoints[l]]; 342cd0c2139SMatthew G Knepley } 343cd0c2139SMatthew G Knepley ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr); 344cd0c2139SMatthew G Knepley ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 345cd0c2139SMatthew G Knepley } 346a6ae58d1SMatthew G. Knepley ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr); 347cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 348cd0c2139SMatthew G Knepley } 349cd0c2139SMatthew G Knepley 350cd0c2139SMatthew G Knepley #undef __FUNCT__ 351cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal" 352cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew) 353cd0c2139SMatthew G Knepley { 354cd0c2139SMatthew G Knepley PetscSF sfPoint; 355cd0c2139SMatthew G Knepley DMLabel vtkLabel, ghostLabel; 356a6ae58d1SMatthew G. Knepley PetscInt *depthMax, *depthEnd; 357cd0c2139SMatthew G Knepley const PetscSFNode *leafRemote; 358cd0c2139SMatthew G Knepley const PetscInt *leafLocal; 359cd0c2139SMatthew G Knepley PetscInt depth = 0, d, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f; 360cd0c2139SMatthew G Knepley PetscMPIInt rank; 361cd0c2139SMatthew G Knepley PetscErrorCode ierr; 362cd0c2139SMatthew G Knepley 363cd0c2139SMatthew G Knepley PetscFunctionBegin; 364cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3652203a8e9SMatthew G. Knepley ierr = PetscMalloc2(depth+1,&depthMax,depth+1,&depthEnd);CHKERRQ(ierr); 366a6ae58d1SMatthew 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); 367cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 368cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 369a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 370cd0c2139SMatthew G Knepley } 371cd0c2139SMatthew G Knepley /* Step 10: Convert labels */ 372cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 373cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 374cd0c2139SMatthew G Knepley DMLabel label, newlabel; 375cd0c2139SMatthew G Knepley const char *lname; 376cd0c2139SMatthew G Knepley PetscBool isDepth; 377cd0c2139SMatthew G Knepley IS valueIS; 378cd0c2139SMatthew G Knepley const PetscInt *values; 379cd0c2139SMatthew G Knepley PetscInt numValues, val; 380cd0c2139SMatthew G Knepley 381cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr); 382cd0c2139SMatthew G Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 383cd0c2139SMatthew G Knepley if (isDepth) continue; 384cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, lname);CHKERRQ(ierr); 385cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr); 386cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr); 387cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 388cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 389cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 390cd0c2139SMatthew G Knepley for (val = 0; val < numValues; ++val) { 391cd0c2139SMatthew G Knepley IS pointIS; 392cd0c2139SMatthew G Knepley const PetscInt *points; 393cd0c2139SMatthew G Knepley PetscInt numPoints, p; 394cd0c2139SMatthew G Knepley 395cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 396cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 397cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 398cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 399a6ae58d1SMatthew G. Knepley const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthMax, depthEnd, depthShift); 400cd0c2139SMatthew G Knepley 401cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr); 402cd0c2139SMatthew G Knepley } 403cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 404cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 405cd0c2139SMatthew G Knepley } 406cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 407cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 408cd0c2139SMatthew G Knepley } 409a6ae58d1SMatthew G. Knepley ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr); 410cd0c2139SMatthew G Knepley /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */ 411cd0c2139SMatthew G Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 412cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 413cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 414cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr); 415cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "vtk");CHKERRQ(ierr); 416cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "ghost");CHKERRQ(ierr); 417cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr); 418cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr); 419cd0c2139SMatthew G Knepley for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { 420cd0c2139SMatthew G Knepley for (; c < leafLocal[l] && c < cEnd; ++c) { 421cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 422cd0c2139SMatthew G Knepley } 423cd0c2139SMatthew G Knepley if (leafLocal[l] >= cEnd) break; 424cd0c2139SMatthew G Knepley if (leafRemote[l].rank == rank) { 425cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 426cd0c2139SMatthew G Knepley } else { 427cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr); 428cd0c2139SMatthew G Knepley } 429cd0c2139SMatthew G Knepley } 430cd0c2139SMatthew G Knepley for (; c < cEnd; ++c) { 431cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 432cd0c2139SMatthew G Knepley } 433cd0c2139SMatthew G Knepley if (0) { 434cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 435cd0c2139SMatthew G Knepley ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 436cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 437cd0c2139SMatthew G Knepley } 438cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr); 439cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 440cd0c2139SMatthew G Knepley PetscInt numCells; 441cd0c2139SMatthew G Knepley 442cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr); 443cd0c2139SMatthew G Knepley if (numCells < 2) { 444cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr); 445cd0c2139SMatthew G Knepley } else { 446cd0c2139SMatthew G Knepley const PetscInt *cells = NULL; 447cd0c2139SMatthew G Knepley PetscInt vA, vB; 448cd0c2139SMatthew G Knepley 449cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr); 450cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr); 451cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr); 452cd0c2139SMatthew G Knepley if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);} 453cd0c2139SMatthew G Knepley } 454cd0c2139SMatthew G Knepley } 455cd0c2139SMatthew G Knepley if (0) { 456cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 457cd0c2139SMatthew G Knepley ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 458cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 459cd0c2139SMatthew G Knepley } 460cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 461cd0c2139SMatthew G Knepley } 462cd0c2139SMatthew G Knepley 463cd0c2139SMatthew G Knepley #undef __FUNCT__ 464cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal" 465cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm) 466cd0c2139SMatthew G Knepley { 467cd0c2139SMatthew G Knepley IS valueIS; 468cd0c2139SMatthew G Knepley const PetscInt *values; 469cd0c2139SMatthew G Knepley PetscInt *depthShift; 47046c796b9SMatthew G. Knepley PetscInt depth = 0, numFS, fs, fStart, fEnd, ghostCell, cEnd, c; 471cd0c2139SMatthew G Knepley PetscErrorCode ierr; 472cd0c2139SMatthew G Knepley 473cd0c2139SMatthew G Knepley PetscFunctionBegin; 47446c796b9SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 475cd0c2139SMatthew G Knepley /* Count ghost cells */ 476cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 477cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr); 478cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 479cd0c2139SMatthew G Knepley *numGhostCells = 0; 480cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 48146c796b9SMatthew G. Knepley IS faceIS; 48246c796b9SMatthew G. Knepley const PetscInt *faces; 48346c796b9SMatthew G. Knepley PetscInt numFaces, f, numBdFaces = 0; 484cd0c2139SMatthew G Knepley 48546c796b9SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 48646c796b9SMatthew G. Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 48746c796b9SMatthew G. Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 48846c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 48946c796b9SMatthew G. Knepley if ((faces[f] >= fStart) && (faces[f] < fEnd)) ++numBdFaces; 49046c796b9SMatthew G. Knepley } 491cd0c2139SMatthew G Knepley *numGhostCells += numBdFaces; 49246c796b9SMatthew G. Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 493cd0c2139SMatthew G Knepley } 494cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 495785e854fSJed Brown ierr = PetscMalloc1((depth+1), &depthShift);CHKERRQ(ierr); 496cd0c2139SMatthew G Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 497cd0c2139SMatthew G Knepley if (depth >= 0) depthShift[depth] = *numGhostCells; 498cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 499cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 500cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 501cd0c2139SMatthew G Knepley for (c = cEnd; c < cEnd + *numGhostCells; ++c) { 502cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr); 503cd0c2139SMatthew G Knepley } 504cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 505cd0c2139SMatthew G Knepley IS faceIS; 506cd0c2139SMatthew G Knepley const PetscInt *faces; 507cd0c2139SMatthew G Knepley PetscInt numFaces, f; 508cd0c2139SMatthew G Knepley 509cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 510cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 511cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 512cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 513cd0c2139SMatthew G Knepley PetscInt size; 514cd0c2139SMatthew G Knepley 51546c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 516cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr); 517cd0c2139SMatthew 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); 518cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(gdm, faces[f] + *numGhostCells, 2);CHKERRQ(ierr); 519cd0c2139SMatthew G Knepley } 520cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 521cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 522cd0c2139SMatthew G Knepley } 523cd0c2139SMatthew G Knepley /* Step 4: Setup ghosted DM */ 524cd0c2139SMatthew G Knepley ierr = DMSetUp(gdm);CHKERRQ(ierr); 525cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 526cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 527cd0c2139SMatthew G Knepley ghostCell = cEnd; 528cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 529cd0c2139SMatthew G Knepley IS faceIS; 530cd0c2139SMatthew G Knepley const PetscInt *faces; 531cd0c2139SMatthew G Knepley PetscInt numFaces, f; 532cd0c2139SMatthew G Knepley 533cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 534cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 535cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 53646c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 537cd0c2139SMatthew G Knepley PetscInt newFace = faces[f] + *numGhostCells; 538cd0c2139SMatthew G Knepley 53946c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 540cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr); 541cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr); 54246c796b9SMatthew G. Knepley ++ghostCell; 543cd0c2139SMatthew G Knepley } 544cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 545cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 546cd0c2139SMatthew G Knepley } 547cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 548cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 549cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 550cd0c2139SMatthew G Knepley ierr = DMPlexStratify(gdm);CHKERRQ(ierr); 551cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 552cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 553cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 554cd0c2139SMatthew G Knepley ierr = PetscFree(depthShift);CHKERRQ(ierr); 555cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 556cd0c2139SMatthew G Knepley } 557cd0c2139SMatthew G Knepley 558cd0c2139SMatthew G Knepley #undef __FUNCT__ 559cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells" 560cd0c2139SMatthew G Knepley /*@C 561cd0c2139SMatthew G Knepley DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face 562cd0c2139SMatthew G Knepley 563cd0c2139SMatthew G Knepley Collective on dm 564cd0c2139SMatthew G Knepley 565cd0c2139SMatthew G Knepley Input Parameters: 566cd0c2139SMatthew G Knepley + dm - The original DM 567cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL 568cd0c2139SMatthew G Knepley 569cd0c2139SMatthew G Knepley Output Parameters: 570cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM 571cd0c2139SMatthew G Knepley - dmGhosted - The new DM 572cd0c2139SMatthew G Knepley 573cd0c2139SMatthew G Knepley Note: If no label exists of that name, one will be created marking all boundary faces 574cd0c2139SMatthew G Knepley 575cd0c2139SMatthew G Knepley Level: developer 576cd0c2139SMatthew G Knepley 577cd0c2139SMatthew G Knepley .seealso: DMCreate() 57831266bc0SMatthew G. Knepley @*/ 579cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted) 580cd0c2139SMatthew G Knepley { 581cd0c2139SMatthew G Knepley DM gdm; 582cd0c2139SMatthew G Knepley DMLabel label; 583cd0c2139SMatthew G Knepley const char *name = labelName ? labelName : "Face Sets"; 584cd0c2139SMatthew G Knepley PetscInt dim; 585a42b08eeSMatthew G. Knepley PetscBool flag; 586cd0c2139SMatthew G Knepley PetscErrorCode ierr; 587cd0c2139SMatthew G Knepley 588cd0c2139SMatthew G Knepley PetscFunctionBegin; 589cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 590cd0c2139SMatthew G Knepley PetscValidPointer(numGhostCells, 3); 591cd0c2139SMatthew G Knepley PetscValidPointer(dmGhosted, 4); 592cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr); 593cd0c2139SMatthew G Knepley ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr); 594cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 595cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(gdm, dim);CHKERRQ(ierr); 596a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseCone(dm, &flag);CHKERRQ(ierr); 597a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseCone(gdm, flag);CHKERRQ(ierr); 598a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseClosure(dm, &flag);CHKERRQ(ierr); 599a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseClosure(gdm, flag);CHKERRQ(ierr); 600cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 601cd0c2139SMatthew G Knepley if (!label) { 602cd0c2139SMatthew G Knepley /* Get label for boundary faces */ 603cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr); 604cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 605cd0c2139SMatthew G Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 606cd0c2139SMatthew G Knepley } 607cd0c2139SMatthew G Knepley ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr); 608cd0c2139SMatthew G Knepley *dmGhosted = gdm; 609cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 610cd0c2139SMatthew G Knepley } 611cd0c2139SMatthew G Knepley 612cd0c2139SMatthew G Knepley #undef __FUNCT__ 613cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal" 614607ab7a9SMatthew G. Knepley /* 615faedd622SMatthew G. Knepley We are adding three kinds of points here: 616607ab7a9SMatthew G. Knepley Replicated: Copies of points which exist in the mesh, such as vertices identified across a fault 617faedd622SMatthew G. Knepley Non-replicated: Points which exist on the fault, but are not replicated 618607ab7a9SMatthew G. Knepley Hybrid: Entirely new points, such as cohesive cells 619a6ae58d1SMatthew G. Knepley 620a6ae58d1SMatthew G. Knepley When creating subsequent cohesive cells, we shift the old hybrid cells to the end of the numbering at 621a6ae58d1SMatthew G. Knepley each depth so that the new split/hybrid points can be inserted as a block. 622607ab7a9SMatthew G. Knepley */ 623cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm) 624cd0c2139SMatthew G Knepley { 625cd0c2139SMatthew G Knepley MPI_Comm comm; 626607ab7a9SMatthew G. Knepley IS valueIS; 627607ab7a9SMatthew G. Knepley PetscInt numSP = 0; /* The number of depths for which we have replicated points */ 628607ab7a9SMatthew G. Knepley const PetscInt *values; /* List of depths for which we have replicated points */ 62918c5995bSMatthew G. Knepley IS *splitIS; 63018c5995bSMatthew G. Knepley IS *unsplitIS; 631607ab7a9SMatthew G. Knepley PetscInt *numSplitPoints; /* The number of replicated points at each depth */ 63218c5995bSMatthew G. Knepley PetscInt *numUnsplitPoints; /* The number of non-replicated points at each depth which still give rise to hybrid points */ 63336dbac82SMatthew G. Knepley PetscInt *numHybridPoints; /* The number of new hybrid points at each depth */ 63436dbac82SMatthew G. Knepley PetscInt *numHybridPointsOld; /* The number of existing hybrid points at each depth */ 635607ab7a9SMatthew G. Knepley const PetscInt **splitPoints; /* Replicated points for each depth */ 63618c5995bSMatthew G. Knepley const PetscInt **unsplitPoints; /* Non-replicated points for each depth */ 637cd0c2139SMatthew G Knepley PetscSection coordSection; 638cd0c2139SMatthew G Knepley Vec coordinates; 639cd0c2139SMatthew G Knepley PetscScalar *coords; 640607ab7a9SMatthew G. Knepley PetscInt depths[4]; /* Depths in the order that plex points are numbered */ 641a6ae58d1SMatthew G. Knepley PetscInt *depthMax; /* The first hybrid point at each depth in the original mesh */ 642a6ae58d1SMatthew G. Knepley PetscInt *depthEnd; /* The point limit at each depth in the original mesh */ 643607ab7a9SMatthew G. Knepley PetscInt *depthShift; /* Number of replicated+hybrid points at each depth */ 644607ab7a9SMatthew G. Knepley PetscInt *depthOffset; /* Prefix sums of depthShift */ 645607ab7a9SMatthew G. Knepley PetscInt *pMaxNew; /* The first replicated point at each depth in the new mesh, hybrids come after this */ 646607ab7a9SMatthew G. Knepley PetscInt *coneNew, *coneONew, *supportNew; 64718c5995bSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v; 648cd0c2139SMatthew G Knepley PetscErrorCode ierr; 649cd0c2139SMatthew G Knepley 650cd0c2139SMatthew G Knepley PetscFunctionBegin; 651cd0c2139SMatthew G Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 652cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 653607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 654fd4b9f15SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 655607ab7a9SMatthew G. Knepley depths[0] = depth; 656607ab7a9SMatthew G. Knepley depths[1] = 0; 657607ab7a9SMatthew G. Knepley depths[2] = depth-1; 658607ab7a9SMatthew G. Knepley depths[3] = 1; 659cd0c2139SMatthew G Knepley /* Count split points and add cohesive cells */ 660607ab7a9SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 6612203a8e9SMatthew G. Knepley ierr = PetscMalloc6(depth+1,&depthMax,depth+1,&depthEnd,depth+1,&depthShift,depth+1,&depthOffset,depth+1,&pMaxNew,depth+1,&numHybridPointsOld);CHKERRQ(ierr); 662dcca6d9dSJed 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); 663607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 664607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthOffset, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 665a6ae58d1SMatthew 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); 666607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 667607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 668a6ae58d1SMatthew G. Knepley depthEnd[d] = pMaxNew[d]; 669a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 670607ab7a9SMatthew G. Knepley numSplitPoints[d] = 0; 67118c5995bSMatthew G. Knepley numUnsplitPoints[d] = 0; 672607ab7a9SMatthew G. Knepley numHybridPoints[d] = 0; 673a6ae58d1SMatthew G. Knepley numHybridPointsOld[d] = depthMax[d] < 0 ? 0 : depthEnd[d] - depthMax[d]; 674607ab7a9SMatthew G. Knepley splitPoints[d] = NULL; 67518c5995bSMatthew G. Knepley unsplitPoints[d] = NULL; 67618c5995bSMatthew G. Knepley splitIS[d] = NULL; 67718c5995bSMatthew G. Knepley unsplitIS[d] = NULL; 678607ab7a9SMatthew G. Knepley } 679cd0c2139SMatthew G Knepley if (label) { 680cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 681cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 682cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 683cd0c2139SMatthew G Knepley } 684cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 685cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 686cd0c2139SMatthew G Knepley 687cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 68818c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr); 68918c5995bSMatthew G. Knepley if (splitIS[dep]) { 69018c5995bSMatthew G. Knepley ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 69118c5995bSMatthew G. Knepley ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 69218c5995bSMatthew G. Knepley } 69318c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr); 69418c5995bSMatthew G. Knepley if (unsplitIS[dep]) { 69518c5995bSMatthew G. Knepley ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr); 69618c5995bSMatthew G. Knepley ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr); 697cd0c2139SMatthew G Knepley } 698cd0c2139SMatthew G Knepley } 699607ab7a9SMatthew G. Knepley /* Calculate number of hybrid points */ 70018c5995bSMatthew 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 */ 701607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) depthShift[d] = numSplitPoints[d] + numHybridPoints[d]; 702607ab7a9SMatthew G. Knepley for (d = 1; d <= depth; ++d) depthOffset[depths[d]] = depthOffset[depths[d-1]] + depthShift[depths[d-1]]; 703a6ae58d1SMatthew G. Knepley for (d = 0; d <= depth; ++d) pMaxNew[d] += depthOffset[d] - numHybridPointsOld[d]; 704cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 705cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 706cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 707cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 708cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 709a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 7104c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 711cd0c2139SMatthew G Knepley const PetscInt *support; 7124c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, qf, qn, qp, e; 713cd0c2139SMatthew G Knepley 714cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 715cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 716cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 717cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 718cd0c2139SMatthew G Knepley if (dep == depth-1) { 7194c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 7204c367dbcSMatthew G. Knepley 721cd0c2139SMatthew G Knepley /* Add cohesive cells, they are prisms */ 7224c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr); 723cd0c2139SMatthew G Knepley } else if (dep == 0) { 7244c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 725cd0c2139SMatthew G Knepley 726cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 7274c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 728cd0c2139SMatthew G Knepley PetscInt val; 729cd0c2139SMatthew G Knepley 730cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 7314c367dbcSMatthew G. Knepley if (val == 1) ++qf; 7324c367dbcSMatthew G. Knepley if ((val == 1) || (val == (shift + 1))) ++qn; 7334c367dbcSMatthew G. Knepley if ((val == 1) || (val == -(shift + 1))) ++qp; 734cd0c2139SMatthew G Knepley } 7354c367dbcSMatthew G. Knepley /* Split old vertex: Edges into original vertex and new cohesive edge */ 7364c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 7374c367dbcSMatthew G. Knepley /* Split new vertex: Edges into split vertex and new cohesive edge */ 7384c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 7394c367dbcSMatthew G. Knepley /* Add hybrid edge */ 7404c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 7414c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 742cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 7434c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 7444c367dbcSMatthew G. Knepley 745cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 7464c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 747cd0c2139SMatthew G Knepley PetscInt val; 748cd0c2139SMatthew G Knepley 749cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 7504c367dbcSMatthew G. Knepley if (val == dim-1) ++qf; 7514c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 7524c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 753cd0c2139SMatthew G Knepley } 7544c367dbcSMatthew G. Knepley /* Split old edge: Faces into original edge and cohesive face (positive side?) */ 7554c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 7564c367dbcSMatthew G. Knepley /* Split new edge: Faces into split edge and cohesive face (negative side?) */ 7574c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 7584c367dbcSMatthew G. Knepley /* Add hybrid face */ 7594c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 7604c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 761cd0c2139SMatthew G Knepley } 762cd0c2139SMatthew G Knepley } 763cd0c2139SMatthew G Knepley } 76418c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 76518c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 76618c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 767a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 76818c5995bSMatthew G. Knepley const PetscInt *support; 769da1dd7e4SMatthew G. Knepley PetscInt coneSize, supportSize, qf, e, s; 77018c5995bSMatthew G. Knepley 77118c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 77218c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 77339254ff6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 77418c5995bSMatthew G. Knepley if (dep == 0) { 77518c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 77618c5995bSMatthew G. Knepley 77739254ff6SMatthew G. Knepley /* Unsplit vertex: Edges into original vertex, split edges, and new cohesive edge twice */ 77839254ff6SMatthew G. Knepley for (s = 0, qf = 0; s < supportSize; ++s, ++qf) { 77939254ff6SMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 78039254ff6SMatthew G. Knepley if (e >= 0) ++qf; 78139254ff6SMatthew G. Knepley } 78239254ff6SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 78318c5995bSMatthew G. Knepley /* Add hybrid edge */ 78418c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 785e1757548SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 786e1757548SMatthew G. Knepley PetscInt val; 787e1757548SMatthew G. Knepley 788e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 789e1757548SMatthew G. Knepley /* Split and unsplit edges produce hybrid faces */ 790da1dd7e4SMatthew G. Knepley if (val == 1) ++qf; 791da1dd7e4SMatthew G. Knepley if (val == (shift2 + 1)) ++qf; 792e1757548SMatthew G. Knepley } 793e1757548SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 79418c5995bSMatthew G. Knepley } else if (dep == dim-2) { 79518c5995bSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 796cd0c2139SMatthew G Knepley PetscInt val; 797cd0c2139SMatthew G Knepley 798da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 799cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 800da1dd7e4SMatthew G. Knepley if (val == dim-1) qf += 2; 801da1dd7e4SMatthew G. Knepley else ++qf; 802cd0c2139SMatthew G Knepley } 80318c5995bSMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */ 804da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 80518c5995bSMatthew G. Knepley /* Add hybrid face */ 806da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 807da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 808da1dd7e4SMatthew G. Knepley if (val == dim-1) ++qf; 809da1dd7e4SMatthew G. Knepley } 81018c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 811da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 812cd0c2139SMatthew G Knepley } 813cd0c2139SMatthew G Knepley } 814cd0c2139SMatthew G Knepley } 815cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 816cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 817cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 818dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 819dcca6d9dSJed Brown ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),&supportNew);CHKERRQ(ierr); 820cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 821cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 822cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 823cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 824a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 8254c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 826cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 8274c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, q, qf, qn, qp, v, e, s; 828cd0c2139SMatthew G Knepley 829cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 830cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 831cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 832cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 833cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 834cd0c2139SMatthew G Knepley if (dep == depth-1) { 83596a07cd0SMatthew G. Knepley PetscBool hasUnsplit = PETSC_FALSE; 8364c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 837cd0c2139SMatthew G Knepley const PetscInt *supportF; 838cd0c2139SMatthew G Knepley 839cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 840cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 841cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 842cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 843cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 844cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 8454c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 84618c5995bSMatthew G. Knepley if (v < 0) { 84718c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 84818c5995bSMatthew 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); 849a6ae58d1SMatthew G. Knepley coneNew[2+q] = DMPlexShiftPoint_Internal(cone[q], depth, depthMax, depthEnd, depthShift) /*cone[q] + depthOffset[dep-1]*/; 85096a07cd0SMatthew G. Knepley hasUnsplit = PETSC_TRUE; 85118c5995bSMatthew G. Knepley } else { 8524c367dbcSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep-1]; 853163235baSMatthew G. Knepley if (dep > 1) { 854163235baSMatthew G. Knepley const PetscInt *econe; 855163235baSMatthew G. Knepley PetscInt econeSize, r, vs, vu; 856163235baSMatthew G. Knepley 857163235baSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[q], &econeSize);CHKERRQ(ierr); 858163235baSMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[q], &econe);CHKERRQ(ierr); 859163235baSMatthew G. Knepley for (r = 0; r < econeSize; ++r) { 860163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numSplitPoints[dep-2], splitPoints[dep-2], &vs);CHKERRQ(ierr); 861163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numUnsplitPoints[dep-2], unsplitPoints[dep-2], &vu);CHKERRQ(ierr); 862163235baSMatthew G. Knepley if (vs >= 0) continue; 863163235baSMatthew 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); 864163235baSMatthew G. Knepley hasUnsplit = PETSC_TRUE; 865163235baSMatthew G. Knepley } 866163235baSMatthew G. Knepley } 867cd0c2139SMatthew G Knepley } 868cd0c2139SMatthew G Knepley } 869cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 870cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 871e537020bSMatthew G. Knepley /* Face support */ 872cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 873cd0c2139SMatthew G Knepley PetscInt val; 874cd0c2139SMatthew G Knepley 875cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 876cd0c2139SMatthew G Knepley if (val < 0) { 877cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 8784c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr); 879cd0c2139SMatthew G Knepley } else { 880cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 8814c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr); 882e537020bSMatthew G. Knepley /* Get orientation for cohesive face */ 883e537020bSMatthew G. Knepley { 884e537020bSMatthew G. Knepley const PetscInt *ncone, *nconeO; 885e537020bSMatthew G. Knepley PetscInt nconeSize, nc; 886e537020bSMatthew G. Knepley 887e537020bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 888e537020bSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 889e537020bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 890e537020bSMatthew G. Knepley for (nc = 0; nc < nconeSize; ++nc) { 891e537020bSMatthew G. Knepley if (ncone[nc] == oldp) { 892e537020bSMatthew G. Knepley coneONew[0] = nconeO[nc]; 893e537020bSMatthew G. Knepley break; 894cd0c2139SMatthew G Knepley } 895cd0c2139SMatthew G Knepley } 896e537020bSMatthew 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]); 897e537020bSMatthew G. Knepley } 898e537020bSMatthew G. Knepley } 899e537020bSMatthew G. Knepley } 9004c367dbcSMatthew G. Knepley /* Cohesive cell: Old and new split face, then new cohesive faces */ 901fd4b9f15SMatthew G. Knepley coneNew[0] = newp; /* Extracted negative side orientation above */ 9024c367dbcSMatthew G. Knepley coneNew[1] = splitp; 9034c367dbcSMatthew G. Knepley coneONew[1] = coneONew[0]; 904e537020bSMatthew G. Knepley for (q = 0; q < coneSize; ++q) { 90518c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 90618c5995bSMatthew G. Knepley if (v < 0) { 90718c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 90818c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 90918c5995bSMatthew G. Knepley coneONew[2+q] = 0; 91018c5995bSMatthew G. Knepley } else { 91118c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep]; 91218c5995bSMatthew G. Knepley } 913e537020bSMatthew G. Knepley coneONew[2+q] = 0; 914e537020bSMatthew G. Knepley } 9154c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr); 9164c367dbcSMatthew G. Knepley ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr); 91796a07cd0SMatthew G. Knepley /* Label the hybrid cells on the boundary of the split */ 91896a07cd0SMatthew G. Knepley if (hasUnsplit) {ierr = DMLabelSetValue(label, -hybcell, dim);CHKERRQ(ierr);} 919cd0c2139SMatthew G Knepley } else if (dep == 0) { 9204c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 921cd0c2139SMatthew G Knepley 922cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 9234c367dbcSMatthew G. Knepley for (e = 0, qn = 0; e < supportSize; ++e) { 924cd0c2139SMatthew G Knepley PetscInt val; 925cd0c2139SMatthew G Knepley 926cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 927cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 928a6ae58d1SMatthew G. Knepley supportNew[qn++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 929cd0c2139SMatthew G Knepley } 930cd0c2139SMatthew G Knepley } 9314c367dbcSMatthew G. Knepley supportNew[qn] = hybedge; 932cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 933cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 9344c367dbcSMatthew G. Knepley for (e = 0, qp = 0; e < supportSize; ++e) { 935cd0c2139SMatthew G Knepley PetscInt val, edge; 936cd0c2139SMatthew G Knepley 937cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 938cd0c2139SMatthew G Knepley if (val == 1) { 9394c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 940cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 9414c367dbcSMatthew G. Knepley supportNew[qp++] = edge + pMaxNew[dep+1]; 942cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 943a6ae58d1SMatthew G. Knepley supportNew[qp++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 944cd0c2139SMatthew G Knepley } 945cd0c2139SMatthew G Knepley } 9464c367dbcSMatthew G. Knepley supportNew[qp] = hybedge; 947cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 9484c367dbcSMatthew G. Knepley /* Hybrid edge: Old and new split vertex */ 949cd0c2139SMatthew G Knepley coneNew[0] = newp; 950cd0c2139SMatthew G Knepley coneNew[1] = splitp; 9514c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 9524c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 9534c367dbcSMatthew G. Knepley PetscInt val, edge; 9544c367dbcSMatthew G. Knepley 9554c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 9564c367dbcSMatthew G. Knepley if (val == 1) { 9574c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 9584c367dbcSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 9594c367dbcSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 9604c367dbcSMatthew G. Knepley } 9614c367dbcSMatthew G. Knepley } 9624c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 963cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 9644c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 9654c367dbcSMatthew G. Knepley 966cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 967cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 968cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 9694c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 970e1757548SMatthew G. Knepley if (v < 0) { 971e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 972e1757548SMatthew 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); 973a6ae58d1SMatthew G. Knepley coneNew[q] = DMPlexShiftPoint_Internal(cone[q], depth, depthMax, depthEnd, depthShift) /*cone[q] + depthOffset[dep-1]*/; 974e1757548SMatthew G. Knepley } else { 9754c367dbcSMatthew G. Knepley coneNew[q] = v + pMaxNew[dep-1]; 976cd0c2139SMatthew G Knepley } 977e1757548SMatthew G. Knepley } 978cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 979cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 980cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 981cd0c2139SMatthew G Knepley PetscInt val; 982cd0c2139SMatthew G Knepley 983cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 9844c367dbcSMatthew G. Knepley if (val == dim-1) { 985a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 9864c367dbcSMatthew G. Knepley } else if (val == (shift + dim-1)) { 987a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 988cd0c2139SMatthew G Knepley } 989cd0c2139SMatthew G Knepley } 990b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 991cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 992cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 993cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 994cd0c2139SMatthew G Knepley PetscInt val, face; 995cd0c2139SMatthew G Knepley 996cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 997cd0c2139SMatthew G Knepley if (val == dim-1) { 9984c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 999cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 10004c367dbcSMatthew G. Knepley supportNew[q++] = face + pMaxNew[dep+1]; 1001cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 1002a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 1003cd0c2139SMatthew G Knepley } 1004cd0c2139SMatthew G Knepley } 1005b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1006cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 10074c367dbcSMatthew G. Knepley /* Hybrid face */ 10084c367dbcSMatthew G. Knepley coneNew[0] = newp; 10094c367dbcSMatthew G. Knepley coneNew[1] = splitp; 10104c367dbcSMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 10114c367dbcSMatthew G. Knepley PetscInt vertex; 10124c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr); 1013e1757548SMatthew G. Knepley if (vertex < 0) { 1014e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr); 1015e1757548SMatthew 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); 1016e1757548SMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1017e1757548SMatthew G. Knepley } else { 10184c367dbcSMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep]; 10194c367dbcSMatthew G. Knepley } 1020e1757548SMatthew G. Knepley } 10214c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 10224c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 10234c367dbcSMatthew G. Knepley PetscInt val, face; 10244c367dbcSMatthew G. Knepley 10254c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 10264c367dbcSMatthew G. Knepley if (val == dim-1) { 10274c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 10284c367dbcSMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 10294c367dbcSMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 10304c367dbcSMatthew G. Knepley } 10314c367dbcSMatthew G. Knepley } 10324c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1033cd0c2139SMatthew G Knepley } 1034cd0c2139SMatthew G Knepley } 1035cd0c2139SMatthew G Knepley } 103618c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 103718c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 103818c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 1039a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 104018c5995bSMatthew G. Knepley const PetscInt *cone, *support, *ornt; 1041e1757548SMatthew G. Knepley PetscInt coneSize, supportSize, supportSizeNew, q, qf, e, f, s; 104218c5995bSMatthew G. Knepley 104318c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 104418c5995bSMatthew G. Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 104518c5995bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 104618c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 104718c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 104818c5995bSMatthew G. Knepley if (dep == 0) { 104918c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 105018c5995bSMatthew G. Knepley 105118c5995bSMatthew G. Knepley /* Unsplit vertex */ 105218c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 105318c5995bSMatthew G. Knepley for (s = 0, q = 0; s < supportSize; ++s) { 1054a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[s], depth, depthMax, depthEnd, depthShift) /*support[s] + depthOffset[dep+1]*/; 105518c5995bSMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 105618c5995bSMatthew G. Knepley if (e >= 0) { 105718c5995bSMatthew G. Knepley supportNew[q++] = e + pMaxNew[dep+1]; 105818c5995bSMatthew G. Knepley } 105918c5995bSMatthew G. Knepley } 106018c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 106118c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 106218c5995bSMatthew G. Knepley if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp); 106318c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 106418c5995bSMatthew G. Knepley /* Hybrid edge */ 106518c5995bSMatthew G. Knepley coneNew[0] = newp; 106618c5995bSMatthew G. Knepley coneNew[1] = newp; 106718c5995bSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 106818c5995bSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 106918c5995bSMatthew G. Knepley PetscInt val, edge; 107018c5995bSMatthew G. Knepley 107118c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 107218c5995bSMatthew G. Knepley if (val == 1) { 107318c5995bSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 107418c5995bSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 107518c5995bSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1076e1757548SMatthew G. Knepley } else if (val == (shift2 + 1)) { 1077e1757548SMatthew G. Knepley ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr); 1078e1757548SMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]); 1079e1757548SMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1]; 108018c5995bSMatthew G. Knepley } 108118c5995bSMatthew G. Knepley } 108218c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1083e1757548SMatthew G. Knepley } else if (dep == dim-2) { 1084e1757548SMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 1085e1757548SMatthew G. Knepley 1086da1dd7e4SMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and hybrid face twice */ 1087e1757548SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1088e1757548SMatthew G. Knepley PetscInt val, face; 1089e1757548SMatthew G. Knepley 1090e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1091e1757548SMatthew G. Knepley if (val == dim-1) { 1092e1757548SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1093e1757548SMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]); 1094a6ae58d1SMatthew G. Knepley supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthMax, depthEnd, depthShift) /*support[f] + depthOffset[dep+1]*/; 1095e1757548SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+1]; 1096e1757548SMatthew G. Knepley } else { 1097a6ae58d1SMatthew G. Knepley supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthMax, depthEnd, depthShift) /*support[f] + depthOffset[dep+1]*/; 1098e1757548SMatthew G. Knepley } 1099e1757548SMatthew G. Knepley } 1100e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1101e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1102da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 1103da1dd7e4SMatthew 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); 1104e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1105e1757548SMatthew G. Knepley /* Add hybrid face */ 1106e1757548SMatthew G. Knepley coneNew[0] = newp; 1107212cc919SMatthew G. Knepley coneNew[1] = newp; 1108e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[0], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1109e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[0]); 1110212cc919SMatthew G. Knepley coneNew[2] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1111e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1112e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]); 1113e1757548SMatthew G. Knepley coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1114e1757548SMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 1115da1dd7e4SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1116da1dd7e4SMatthew G. Knepley PetscInt val, face; 1117da1dd7e4SMatthew G. Knepley 1118da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1119da1dd7e4SMatthew G. Knepley if (val == dim-1) { 1120da1dd7e4SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1121da1dd7e4SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1122da1dd7e4SMatthew G. Knepley } 1123da1dd7e4SMatthew G. Knepley } 1124da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, hybface, &supportSizeNew);CHKERRQ(ierr); 1125da1dd7e4SMatthew 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); 1126e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1127cd0c2139SMatthew G Knepley } 1128cd0c2139SMatthew G Knepley } 1129cd0c2139SMatthew G Knepley } 1130cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 1131cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1132cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 1133cd0c2139SMatthew G Knepley IS pIS; 1134cd0c2139SMatthew G Knepley PetscInt numPoints; 1135cd0c2139SMatthew G Knepley const PetscInt *points; 1136cd0c2139SMatthew G Knepley 1137cd0c2139SMatthew G Knepley if (dep >= 0) continue; 1138cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 1139cd0c2139SMatthew G Knepley if (!pIS) continue; 1140cd0c2139SMatthew G Knepley dep = -dep - shift; 1141cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 1142cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 1143cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1144cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 1145a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*depthOffset[dep] + oldp*/; 1146cd0c2139SMatthew G Knepley const PetscInt *cone; 1147cd0c2139SMatthew G Knepley PetscInt coneSize, c; 114850cf782dSMatthew G. Knepley /* PetscBool replaced = PETSC_FALSE; */ 1149cd0c2139SMatthew G Knepley 1150cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 1151cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 1152cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 1153cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 1154cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1155cd0c2139SMatthew G Knepley const PetscInt coldp = cone[c] - depthOffset[dep-1]; 1156cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 1157cd0c2139SMatthew G Knepley 1158cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 1159cd0c2139SMatthew G Knepley if (val == dep-1) { 1160cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 1161cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 1162cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 1163cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 116450cf782dSMatthew G. Knepley /* replaced = PETSC_TRUE; */ 1165cd0c2139SMatthew G Knepley } 1166cd0c2139SMatthew G Knepley } 11674a189a86SMatthew G. Knepley /* Cells with only a vertex or edge on the submesh have no replacement */ 11684a189a86SMatthew G. Knepley /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 1169cd0c2139SMatthew G Knepley } 1170cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 1171cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 1172cd0c2139SMatthew G Knepley } 1173cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 1174cd0c2139SMatthew G Knepley ierr = DMPlexStratify(sdm);CHKERRQ(ierr); 1175cd0c2139SMatthew G Knepley /* Step 8: Coordinates */ 1176cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 117769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 1178cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 1179cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 1180cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 1181a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[0][v], depth, depthMax, depthEnd, depthShift) /*depthOffset[0] + splitPoints[0][v]*/; 1182cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 1183cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 1184cd0c2139SMatthew G Knepley 1185cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 1186cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 1187cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 1188cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 1189cd0c2139SMatthew G Knepley } 1190cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 1191cd0c2139SMatthew G Knepley /* Step 9: SF, if I can figure this out we can split the mesh in parallel */ 1192cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1193cd0c2139SMatthew G Knepley /* Step 10: Labels */ 1194cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1195cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 1196cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1197cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 1198a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[dep][p], depth, depthMax, depthEnd, depthShift) /*depthOffset[dep] + splitPoints[dep][p]*/; 1199cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 1200cd0c2139SMatthew G Knepley PetscInt l; 1201cd0c2139SMatthew G Knepley 1202cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 1203cd0c2139SMatthew G Knepley DMLabel mlabel; 1204cd0c2139SMatthew G Knepley const char *lname; 1205cd0c2139SMatthew G Knepley PetscInt val; 12069a356370SMatthew G. Knepley PetscBool isDepth; 1207cd0c2139SMatthew G Knepley 1208cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 12099a356370SMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 12109a356370SMatthew G. Knepley if (isDepth) continue; 1211cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 1212cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 1213cd0c2139SMatthew G Knepley if (val >= 0) { 1214cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 12159a356370SMatthew G. Knepley #if 0 12169a356370SMatthew G. Knepley /* Do not put cohesive edges into the label */ 1217cd0c2139SMatthew G Knepley if (dep == 0) { 12184c367dbcSMatthew G. Knepley const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1219cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr); 12204c367dbcSMatthew G. Knepley } else if (dep == dim-2) { 12214c367dbcSMatthew G. Knepley const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 12224c367dbcSMatthew G. Knepley ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr); 1223cd0c2139SMatthew G Knepley } 12244c367dbcSMatthew G. Knepley /* Do not put cohesive faces into the label */ 12259a356370SMatthew G. Knepley #endif 1226cd0c2139SMatthew G Knepley } 1227cd0c2139SMatthew G Knepley } 1228cd0c2139SMatthew G Knepley } 1229cd0c2139SMatthew G Knepley } 1230cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1231cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 1232cd0c2139SMatthew G Knepley 1233cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 123418c5995bSMatthew G. Knepley if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 123518c5995bSMatthew G. Knepley ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr); 123618c5995bSMatthew G. Knepley if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);} 123718c5995bSMatthew G. Knepley ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr); 1238cd0c2139SMatthew G Knepley } 1239cd0c2139SMatthew G Knepley if (label) { 1240cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1241cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1242cd0c2139SMatthew G Knepley } 12430d4d4d06SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 12440d4d4d06SMatthew G. Knepley ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr); 124536dbac82SMatthew G. Knepley pMaxNew[d] = pEnd - numHybridPoints[d] - numHybridPointsOld[d]; 12460d4d4d06SMatthew G. Knepley } 12470e49e2e2SMatthew 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); 1248dcbb62e8SMatthew G. Knepley ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr); 1249a6ae58d1SMatthew G. Knepley ierr = PetscFree6(depthMax, depthEnd, depthShift, depthOffset, pMaxNew, numHybridPointsOld);CHKERRQ(ierr); 125018c5995bSMatthew G. Knepley ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr); 1251cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1252cd0c2139SMatthew G Knepley } 1253cd0c2139SMatthew G Knepley 1254cd0c2139SMatthew G Knepley #undef __FUNCT__ 1255cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells" 1256cd0c2139SMatthew G Knepley /*@C 1257cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 1258cd0c2139SMatthew G Knepley 1259cd0c2139SMatthew G Knepley Collective on dm 1260cd0c2139SMatthew G Knepley 1261cd0c2139SMatthew G Knepley Input Parameters: 1262cd0c2139SMatthew G Knepley + dm - The original DM 126353156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated) 1264cd0c2139SMatthew G Knepley 1265cd0c2139SMatthew G Knepley Output Parameters: 1266cd0c2139SMatthew G Knepley - dmSplit - The new DM 1267cd0c2139SMatthew G Knepley 1268cd0c2139SMatthew G Knepley Level: developer 1269cd0c2139SMatthew G Knepley 12702be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 1271cd0c2139SMatthew G Knepley @*/ 1272cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 1273cd0c2139SMatthew G Knepley { 1274cd0c2139SMatthew G Knepley DM sdm; 1275cd0c2139SMatthew G Knepley PetscInt dim; 1276cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1277cd0c2139SMatthew G Knepley 1278cd0c2139SMatthew G Knepley PetscFunctionBegin; 1279cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 128053156dfcSMatthew G. Knepley PetscValidPointer(dmSplit, 3); 1281cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 1282cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 1283cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1284cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(sdm, dim);CHKERRQ(ierr); 1285cd0c2139SMatthew G Knepley switch (dim) { 1286cd0c2139SMatthew G Knepley case 2: 1287cd0c2139SMatthew G Knepley case 3: 1288cd0c2139SMatthew G Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 1289cd0c2139SMatthew G Knepley break; 1290cd0c2139SMatthew G Knepley default: 1291cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 1292cd0c2139SMatthew G Knepley } 1293cd0c2139SMatthew G Knepley *dmSplit = sdm; 1294cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1295cd0c2139SMatthew G Knepley } 1296cd0c2139SMatthew G Knepley 1297cd0c2139SMatthew G Knepley #undef __FUNCT__ 1298*0f66a230SMatthew G. Knepley #define __FUNCT__ "GetSurfaceSide_Static" 1299*0f66a230SMatthew G. Knepley /* Returns the side of the surface for a given cell with a face on the surface */ 1300*0f66a230SMatthew G. Knepley static PetscErrorCode GetSurfaceSide_Static(DM dm, DM subdm, PetscInt numSubpoints, const PetscInt *subpoints, PetscInt cell, PetscInt face, PetscBool *pos) 1301*0f66a230SMatthew G. Knepley { 1302*0f66a230SMatthew G. Knepley const PetscInt *cone, *ornt; 1303*0f66a230SMatthew G. Knepley PetscInt dim, coneSize, c; 1304*0f66a230SMatthew G. Knepley PetscErrorCode ierr; 1305*0f66a230SMatthew G. Knepley 1306*0f66a230SMatthew G. Knepley PetscFunctionBegin; 1307*0f66a230SMatthew G. Knepley *pos = PETSC_TRUE; 1308*0f66a230SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1309*0f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 1310*0f66a230SMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 1311*0f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, cell, &ornt);CHKERRQ(ierr); 1312*0f66a230SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 1313*0f66a230SMatthew G. Knepley if (cone[c] == face) { 1314*0f66a230SMatthew G. Knepley PetscInt o = ornt[c]; 1315*0f66a230SMatthew G. Knepley 1316*0f66a230SMatthew G. Knepley if (subdm) { 1317*0f66a230SMatthew G. Knepley const PetscInt *subcone, *subornt; 1318*0f66a230SMatthew G. Knepley PetscInt subpoint, subface, subconeSize, sc; 1319*0f66a230SMatthew G. Knepley 1320*0f66a230SMatthew G. Knepley ierr = PetscFindInt(cell, numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 1321*0f66a230SMatthew G. Knepley ierr = PetscFindInt(face, numSubpoints, subpoints, &subface);CHKERRQ(ierr); 1322*0f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 1323*0f66a230SMatthew G. Knepley ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 1324*0f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 1325*0f66a230SMatthew G. Knepley for (sc = 0; sc < subconeSize; ++sc) { 1326*0f66a230SMatthew G. Knepley if (subcone[sc] == subface) { 1327*0f66a230SMatthew G. Knepley o = subornt[0]; 1328*0f66a230SMatthew G. Knepley break; 1329*0f66a230SMatthew G. Knepley } 1330*0f66a230SMatthew G. Knepley } 1331*0f66a230SMatthew 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); 1332*0f66a230SMatthew G. Knepley } 1333*0f66a230SMatthew G. Knepley if (o >= 0) *pos = PETSC_TRUE; 1334*0f66a230SMatthew G. Knepley else *pos = PETSC_FALSE; 1335*0f66a230SMatthew G. Knepley break; 1336*0f66a230SMatthew G. Knepley } 1337*0f66a230SMatthew G. Knepley } 1338*0f66a230SMatthew 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); 1339*0f66a230SMatthew G. Knepley PetscFunctionReturn(0); 1340*0f66a230SMatthew G. Knepley } 1341*0f66a230SMatthew G. Knepley 1342*0f66a230SMatthew G. Knepley #undef __FUNCT__ 13432be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete" 1344cd0c2139SMatthew G Knepley /*@ 1345*0f66a230SMatthew G. Knepley DMPlexLabelCohesiveComplete - Starting with a label marking points on an internal surface, we add all other mesh pieces 1346cd0c2139SMatthew G Knepley to complete the surface 1347cd0c2139SMatthew G Knepley 1348cd0c2139SMatthew G Knepley Input Parameters: 1349cd0c2139SMatthew G Knepley + dm - The DM 1350*0f66a230SMatthew G. Knepley . label - A DMLabel marking the surface 1351*0f66a230SMatthew G. Knepley . blabel - A DMLabel marking the vertices on the boundary which will not be duplicated, or NULL to find them automatically 1352bb55d314SMatthew G. Knepley . flip - Flag to flip the submesh normal and replace points on the other side 135347946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL 1354cd0c2139SMatthew G Knepley 1355cd0c2139SMatthew G Knepley Output Parameter: 1356cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 1357cd0c2139SMatthew G Knepley 1358*0f66a230SMatthew G. Knepley Note: The vertices in blabel are called "unsplit" in the terminology from hybrid cell creation. 1359*0f66a230SMatthew G. Knepley 1360cd0c2139SMatthew G Knepley Level: developer 1361cd0c2139SMatthew G Knepley 13622be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 1363cd0c2139SMatthew G Knepley @*/ 1364*0f66a230SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, DMLabel blabel, PetscBool flip, DM subdm) 1365cd0c2139SMatthew G Knepley { 1366d90583fdSMatthew G. Knepley DMLabel depthLabel; 136718c5995bSMatthew G. Knepley IS dimIS, subpointIS, facePosIS, faceNegIS; 136847946fd8SMatthew G. Knepley const PetscInt *points, *subpoints; 1369bb55d314SMatthew G. Knepley const PetscInt rev = flip ? -1 : 1; 1370*0f66a230SMatthew G. Knepley PetscInt shift = 100, shift2 = 200, dim, dep, cStart, cEnd, fStart, fEnd, vStart, vEnd, numPoints, numSubpoints, p, val; 1371cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1372cd0c2139SMatthew G Knepley 1373cd0c2139SMatthew G Knepley PetscFunctionBegin; 1374d90583fdSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 1375cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 137647946fd8SMatthew G. Knepley if (subdm) { 137747946fd8SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 137847946fd8SMatthew G. Knepley if (subpointIS) { 137947946fd8SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 138047946fd8SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 138147946fd8SMatthew G. Knepley } 138247946fd8SMatthew G. Knepley } 1383d7c8f101SMatthew G. Knepley /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */ 1384cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 1385cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1386cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1387cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1388d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */ 1389cd0c2139SMatthew G Knepley const PetscInt *support; 1390cd0c2139SMatthew G Knepley PetscInt supportSize, s; 1391cd0c2139SMatthew G Knepley 1392cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1393cd0c2139SMatthew G Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 1394cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1395cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1396*0f66a230SMatthew G. Knepley const PetscInt *cone; 1397cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1398*0f66a230SMatthew G. Knepley PetscBool pos; 1399cd0c2139SMatthew G Knepley 1400*0f66a230SMatthew G. Knepley ierr = GetSurfaceSide_Static(dm, subdm, numSubpoints, subpoints, support[s], points[p], &pos);CHKERRQ(ierr); 1401*0f66a230SMatthew G. Knepley if (pos) {ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr);} 1402*0f66a230SMatthew G. Knepley else {ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);} 1403*0f66a230SMatthew G. Knepley if (rev < 0) pos = !pos ? PETSC_TRUE : PETSC_FALSE; 1404*0f66a230SMatthew G. Knepley /* Put faces touching the fault in the label */ 1405cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1406cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1407cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1408cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 1409cd0c2139SMatthew G Knepley 1410cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1411cd0c2139SMatthew G Knepley if (val == -1) { 1412cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 1413cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 1414cd0c2139SMatthew G Knepley 1415cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1416cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1417cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 1418cd0c2139SMatthew G Knepley 1419cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1420cd0c2139SMatthew G Knepley if ((val >= 0) && (val < dim-1)) { 1421cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1422cd0c2139SMatthew G Knepley break; 1423cd0c2139SMatthew G Knepley } 1424cd0c2139SMatthew G Knepley } 1425cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1426cd0c2139SMatthew G Knepley } 1427cd0c2139SMatthew G Knepley } 1428cd0c2139SMatthew G Knepley } 1429cd0c2139SMatthew G Knepley } 1430*0f66a230SMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1431*0f66a230SMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1432*0f66a230SMatthew G. Knepley /* Add in halo faces, and cells in the support */ 1433*0f66a230SMatthew G. Knepley if (blabel && subdm) { 1434*0f66a230SMatthew G. Knepley DMLabel bdlabel; 1435*0f66a230SMatthew G. Knepley 1436*0f66a230SMatthew G. Knepley ierr = DMPlexGetLabel(subdm, "boundary", &bdlabel);CHKERRQ(ierr); 1437*0f66a230SMatthew G. Knepley ierr = DMLabelGetStratumIS(bdlabel, 1, &dimIS);CHKERRQ(ierr); 1438*0f66a230SMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1439*0f66a230SMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1440*0f66a230SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault boundary vertices */ 1441*0f66a230SMatthew G. Knepley PetscInt *star = NULL; 1442*0f66a230SMatthew G. Knepley PetscInt starSize, s; 1443*0f66a230SMatthew G. Knepley 1444*0f66a230SMatthew G. Knepley if ((points[p] < vStart) || (points[p] >= vEnd)) continue; 1445*0f66a230SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1446*0f66a230SMatthew G. Knepley for (s = 0; s < starSize*2; s += 2) { 1447*0f66a230SMatthew G. Knepley const PetscInt point = star[s]; 1448*0f66a230SMatthew G. Knepley PetscBool inHalo = PETSC_TRUE; 1449*0f66a230SMatthew G. Knepley PetscInt *closure = NULL; 1450*0f66a230SMatthew G. Knepley PetscInt closureSize, cl, val, bval; 1451*0f66a230SMatthew G. Knepley 1452*0f66a230SMatthew G. Knepley if ((point < fStart) || (point >= fEnd)) continue; 1453*0f66a230SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1454*0f66a230SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1455*0f66a230SMatthew G. Knepley const PetscInt clp = closure[cl]; 1456*0f66a230SMatthew G. Knepley 1457*0f66a230SMatthew G. Knepley if ((clp < vStart) || (clp >= vEnd)) continue; 1458*0f66a230SMatthew G. Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1459*0f66a230SMatthew G. Knepley if (!((val == 0) || (bval == 0))) {inHalo = PETSC_FALSE; break;} 1460*0f66a230SMatthew G. Knepley } 1461*0f66a230SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1462*0f66a230SMatthew G. Knepley if (inHalo) { 1463*0f66a230SMatthew G. Knepley const PetscInt *support; 1464*0f66a230SMatthew G. Knepley PetscInt supportSize, s; 1465*0f66a230SMatthew G. Knepley PetscBool pos; 1466*0f66a230SMatthew G. Knepley 1467*0f66a230SMatthew G. Knepley /* Set face to positive side, it will be split below */ 1468*0f66a230SMatthew G. Knepley ierr = DMLabelSetValue(label, point, rev*(shift+dim-1));CHKERRQ(ierr); 1469*0f66a230SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 1470*0f66a230SMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 1471*0f66a230SMatthew G. Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Halo face %d has supportSize %d != 2", point, supportSize); 1472*0f66a230SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 1473*0f66a230SMatthew G. Knepley ierr = GetSurfaceSide_Static(dm, subdm, numSubpoints, subpoints, support[s], point, &pos);CHKERRQ(ierr); 1474*0f66a230SMatthew G. Knepley if (pos) {ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr);} 1475*0f66a230SMatthew G. Knepley else {ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);} 1476*0f66a230SMatthew G. Knepley } 1477*0f66a230SMatthew G. Knepley } 1478*0f66a230SMatthew G. Knepley } 1479*0f66a230SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1480*0f66a230SMatthew G. Knepley } 1481*0f66a230SMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1482*0f66a230SMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1483*0f66a230SMatthew G. Knepley } 148447946fd8SMatthew G. Knepley if (subdm) { 148547946fd8SMatthew G. Knepley if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 148647946fd8SMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 148747946fd8SMatthew G. Knepley } 1488cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1489cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1490*0f66a230SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 1491*0f66a230SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 1492cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 1493cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1494cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1495cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1496d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */ 1497cd0c2139SMatthew G Knepley PetscInt *star = NULL; 1498cd0c2139SMatthew G Knepley PetscInt starSize, s; 1499cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1500cd0c2139SMatthew G Knepley 1501d4622b2cSMatthew G. Knepley /* All points connected to the fault are inside a cell, so at the top level we will only check cells */ 1502cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1503cd0c2139SMatthew G Knepley while (again) { 1504cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1505cd0c2139SMatthew G Knepley again = 0; 1506cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1507cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1508cd0c2139SMatthew G Knepley const PetscInt *cone; 1509cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1510cd0c2139SMatthew G Knepley 1511cd0c2139SMatthew G Knepley if ((point < cStart) || (point >= cEnd)) continue; 1512cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1513cd0c2139SMatthew G Knepley if (val != -1) continue; 1514d4622b2cSMatthew G. Knepley again = again == 1 ? 1 : 2; 1515cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1516cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1517cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1518cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1519cd0c2139SMatthew G Knepley if (val != -1) { 1520d7c8f101SMatthew G. Knepley const PetscInt *ccone; 1521166d9d0cSMatthew G. Knepley PetscInt cconeSize, cc, side; 1522d7c8f101SMatthew G. Knepley 1523cd0c2139SMatthew G Knepley if (abs(val) < shift) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d on cell %d has an invalid label %d", cone[c], point, val); 152437a6de01SMatthew G. Knepley if (val > 0) side = 1; 152537a6de01SMatthew G. Knepley else side = -1; 152637a6de01SMatthew G. Knepley ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr); 1527d7c8f101SMatthew G. Knepley /* Mark cell faces which touch the fault */ 1528d7c8f101SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr); 1529d7c8f101SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr); 1530d7c8f101SMatthew G. Knepley for (cc = 0; cc < cconeSize; ++cc) { 1531d7c8f101SMatthew G. Knepley PetscInt *closure = NULL; 1532d7c8f101SMatthew G. Knepley PetscInt closureSize, cl; 1533d7c8f101SMatthew G. Knepley 1534166d9d0cSMatthew G. Knepley ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr); 1535166d9d0cSMatthew G. Knepley if (val != -1) continue; 1536d7c8f101SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1537d4622b2cSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1538d7c8f101SMatthew G. Knepley const PetscInt clp = closure[cl]; 1539d7c8f101SMatthew G. Knepley 1540d7c8f101SMatthew G. Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1541d7c8f101SMatthew G. Knepley if (val == -1) continue; 1542d7c8f101SMatthew G. Knepley ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr); 154337a6de01SMatthew G. Knepley break; 154437a6de01SMatthew G. Knepley } 1545d7c8f101SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1546cd0c2139SMatthew G Knepley } 1547cd0c2139SMatthew G Knepley again = 1; 1548cd0c2139SMatthew G Knepley break; 1549cd0c2139SMatthew G Knepley } 1550cd0c2139SMatthew G Knepley } 1551cd0c2139SMatthew G Knepley } 1552cd0c2139SMatthew G Knepley } 1553cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1554cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1555cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1556cd0c2139SMatthew G Knepley 1557cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1558cd0c2139SMatthew G Knepley if (val == -1) { 1559cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1560cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1561cd0c2139SMatthew G Knepley PetscBool marked = PETSC_FALSE; 1562cd0c2139SMatthew G Knepley 1563cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1564cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1565cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1566cd0c2139SMatthew G Knepley 1567cd0c2139SMatthew G Knepley if ((spoint < cStart) || (spoint >= cEnd)) continue; 1568cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1569cd0c2139SMatthew 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); 1570d90583fdSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1571cd0c2139SMatthew G Knepley if (val > 0) { 1572cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1573cd0c2139SMatthew G Knepley } else { 1574cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1575cd0c2139SMatthew G Knepley } 1576cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1577cd0c2139SMatthew G Knepley break; 1578cd0c2139SMatthew G Knepley } 1579cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1580cd0c2139SMatthew G Knepley if (!marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1581cd0c2139SMatthew G Knepley } 1582cd0c2139SMatthew G Knepley } 1583cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1584cd0c2139SMatthew G Knepley } 1585cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1586cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 158718c5995bSMatthew G. Knepley /* If any faces touching the fault divide cells on either side, split them */ 158818c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift+dim-1, &facePosIS);CHKERRQ(ierr); 158918c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr); 159018c5995bSMatthew G. Knepley ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr); 159118c5995bSMatthew G. Knepley ierr = ISDestroy(&facePosIS);CHKERRQ(ierr); 159218c5995bSMatthew G. Knepley ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr); 159318c5995bSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 159418c5995bSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 159518c5995bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 159618c5995bSMatthew G. Knepley const PetscInt point = points[p]; 159718c5995bSMatthew G. Knepley const PetscInt *support; 159818c5995bSMatthew G. Knepley PetscInt supportSize, valA, valB; 159918c5995bSMatthew G. Knepley 160018c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 160118c5995bSMatthew G. Knepley if (supportSize != 2) continue; 160218c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 160318c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr); 160418c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr); 160518c5995bSMatthew G. Knepley if ((valA == -1) || (valB == -1)) continue; 160618c5995bSMatthew G. Knepley if (valA*valB > 0) continue; 160718c5995bSMatthew G. Knepley /* Split the face */ 160818c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr); 160918c5995bSMatthew G. Knepley ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr); 161018c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr); 1611e1757548SMatthew G. Knepley /* Label its closure: 1612e1757548SMatthew G. Knepley unmarked: label as unsplit 1613e1757548SMatthew G. Knepley incident: relabel as split 1614e1757548SMatthew G. Knepley split: do nothing 1615e1757548SMatthew G. Knepley */ 161618c5995bSMatthew G. Knepley { 161718c5995bSMatthew G. Knepley PetscInt *closure = NULL; 161818c5995bSMatthew G. Knepley PetscInt closureSize, cl; 161918c5995bSMatthew G. Knepley 162018c5995bSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 162118c5995bSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 162218c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr); 16238771c1d3SMatthew G. Knepley if (valA == -1) { /* Mark as unsplit */ 162418c5995bSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 162518c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr); 16268771c1d3SMatthew G. Knepley } else if (((valA >= shift) && (valA < shift2)) || ((valA <= -shift) && (valA > -shift2))) { 1627e1757548SMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 1628e1757548SMatthew G. Knepley ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr); 1629e1757548SMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr); 1630e1757548SMatthew G. Knepley } 163118c5995bSMatthew G. Knepley } 163218c5995bSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 163318c5995bSMatthew G. Knepley } 163418c5995bSMatthew G. Knepley } 163518c5995bSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 163618c5995bSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1637cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1638cd0c2139SMatthew G Knepley } 1639cd0c2139SMatthew G Knepley 1640cd0c2139SMatthew G Knepley #undef __FUNCT__ 16413cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh" 16423cf72582SMatthew G. Knepley /*@C 16433cf72582SMatthew G. Knepley DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface 16443cf72582SMatthew G. Knepley 16453cf72582SMatthew G. Knepley Collective on dm 16463cf72582SMatthew G. Knepley 16473cf72582SMatthew G. Knepley Input Parameters: 16483cf72582SMatthew G. Knepley + dm - The original DM 16493cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices 16503cf72582SMatthew G. Knepley 16513cf72582SMatthew G. Knepley Output Parameters: 16523cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface 16533cf72582SMatthew G. Knepley - dmHybrid - The new DM 16543cf72582SMatthew G. Knepley 16553cf72582SMatthew G. Knepley Level: developer 16563cf72582SMatthew G. Knepley 16573cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate() 16583cf72582SMatthew G. Knepley @*/ 16593cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid) 16603cf72582SMatthew G. Knepley { 16613cf72582SMatthew G. Knepley DM idm; 16623cf72582SMatthew G. Knepley DMLabel subpointMap, hlabel; 16633cf72582SMatthew G. Knepley PetscInt dim; 16643cf72582SMatthew G. Knepley PetscErrorCode ierr; 16653cf72582SMatthew G. Knepley 16663cf72582SMatthew G. Knepley PetscFunctionBegin; 16673cf72582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 16683cf72582SMatthew G. Knepley if (hybridLabel) PetscValidPointer(hybridLabel, 3); 16693cf72582SMatthew G. Knepley PetscValidPointer(dmHybrid, 4); 16703cf72582SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 16713cf72582SMatthew G. Knepley ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr); 16723cf72582SMatthew G. Knepley ierr = DMPlexOrient(idm);CHKERRQ(ierr); 16733cf72582SMatthew G. Knepley ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr); 16743cf72582SMatthew G. Knepley ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr); 16753cf72582SMatthew G. Knepley ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr); 1676*0f66a230SMatthew G. Knepley ierr = DMPlexLabelCohesiveComplete(dm, hlabel, NULL, PETSC_FALSE, idm);CHKERRQ(ierr); 16773cf72582SMatthew G. Knepley ierr = DMDestroy(&idm);CHKERRQ(ierr); 16783cf72582SMatthew G. Knepley ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr); 16793cf72582SMatthew G. Knepley if (hybridLabel) *hybridLabel = hlabel; 168053aa2e23SMatthew G. Knepley else {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);} 1681e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1682e6ccafaeSMatthew G Knepley } 1683e6ccafaeSMatthew G Knepley 1684e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1685efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated" 1686efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 1687efa14ee0SMatthew G Knepley 1688efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 1689efa14ee0SMatthew G Knepley */ 1690830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1691efa14ee0SMatthew G Knepley { 1692fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 1693efa14ee0SMatthew G Knepley const PetscInt *subvertices; 169477d178adSMatthew G. Knepley PetscInt *pStart, *pEnd, *pMax, pSize; 1695efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1696efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1697efa14ee0SMatthew G Knepley 1698efa14ee0SMatthew G Knepley PetscFunctionBegin; 1699efa14ee0SMatthew G Knepley *numFaces = 0; 1700efa14ee0SMatthew G Knepley *nFV = 0; 1701efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1702efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 170377d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1704dcca6d9dSJed Brown ierr = PetscMalloc3(pSize,&pStart,pSize,&pEnd,pSize,&pMax);CHKERRQ(ierr); 1705d92e47f8SMatthew 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); 1706efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 1707efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1708efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1709efa14ee0SMatthew G Knepley } 1710efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1711fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1712efa14ee0SMatthew G Knepley if (subvertexIS) { 1713efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1714efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1715efa14ee0SMatthew G Knepley } 1716efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1717efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 17180298fd71SBarry Smith PetscInt *star = NULL; 1719efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 1720efa14ee0SMatthew G Knepley 1721efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1722efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1723efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1724efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1725efa14ee0SMatthew G Knepley } 1726efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 1727efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 17280298fd71SBarry Smith PetscInt *closure = NULL; 1729efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 1730efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 1731efa14ee0SMatthew G Knepley 1732efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 173365560c7fSMatthew G Knepley if (cellLoc == 2) continue; 173482f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1735efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1736efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1737efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1738efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1739efa14ee0SMatthew G Knepley 1740efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1741efa14ee0SMatthew G Knepley ++numCorners; 1742efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1743830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 1744efa14ee0SMatthew G Knepley } 1745efa14ee0SMatthew G Knepley } 174618ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 174782f516ccSBarry 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); 1748efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 1749007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 1750007baee2SMatthew G. Knepley PetscInt numCells, nc; 1751007baee2SMatthew G. Knepley 1752efa14ee0SMatthew G Knepley ++(*numFaces); 1753efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 1754efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 1755efa14ee0SMatthew G Knepley } 1756007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1757007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 1758007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 1759007baee2SMatthew G. Knepley } 1760007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1761efa14ee0SMatthew G Knepley } 1762efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1763efa14ee0SMatthew G Knepley } 1764efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1765efa14ee0SMatthew G Knepley } 1766efa14ee0SMatthew G Knepley if (subvertexIS) { 1767efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1768efa14ee0SMatthew G Knepley } 1769efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1770efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1771efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1772efa14ee0SMatthew G Knepley } 1773efa14ee0SMatthew G Knepley 1774efa14ee0SMatthew G Knepley #undef __FUNCT__ 1775efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated" 1776830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 1777efa14ee0SMatthew G Knepley { 1778efa14ee0SMatthew G Knepley IS subvertexIS; 1779efa14ee0SMatthew G Knepley const PetscInt *subvertices; 1780efa14ee0SMatthew G Knepley PetscInt *pStart, *pEnd, *pMax; 1781efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 1782efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1783efa14ee0SMatthew G Knepley 1784efa14ee0SMatthew G Knepley PetscFunctionBegin; 1785efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1786dcca6d9dSJed Brown ierr = PetscMalloc3(dim+1,&pStart,dim+1,&pEnd,dim+1,&pMax);CHKERRQ(ierr); 17870298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1788efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 1789efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1790efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1791efa14ee0SMatthew G Knepley } 1792efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1793830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 1794efa14ee0SMatthew G Knepley if (subvertexIS) { 1795efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1796efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1797efa14ee0SMatthew G Knepley } 1798efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1799efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 18000298fd71SBarry Smith PetscInt *star = NULL; 1801efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 1802efa14ee0SMatthew G Knepley 1803efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1804efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1805efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1806efa14ee0SMatthew G Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 1807efa14ee0SMatthew G Knepley } 1808efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 1809efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 18100298fd71SBarry Smith PetscInt *closure = NULL; 1811efa14ee0SMatthew G Knepley PetscInt closureSize, c; 1812efa14ee0SMatthew G Knepley PetscInt faceLoc; 1813efa14ee0SMatthew G Knepley 1814efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 1815efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 181682f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 1817efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1818efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1819efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1820efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1821efa14ee0SMatthew G Knepley 1822efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1823efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1824830e53efSMatthew G. Knepley if (vertexLoc != value) break; 1825efa14ee0SMatthew G Knepley } 1826efa14ee0SMatthew G Knepley } 1827efa14ee0SMatthew G Knepley if (c == closureSize*2) { 1828efa14ee0SMatthew G Knepley const PetscInt *support; 1829efa14ee0SMatthew G Knepley PetscInt supportSize, s; 1830efa14ee0SMatthew G Knepley 1831efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1832efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1833efa14ee0SMatthew G Knepley 1834efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 1835efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1836efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1837efa14ee0SMatthew G Knepley break; 1838efa14ee0SMatthew G Knepley } 1839efa14ee0SMatthew G Knepley } 1840efa14ee0SMatthew G Knepley } 1841efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 1842efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 1843efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1844efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1845efa14ee0SMatthew G Knepley } 1846efa14ee0SMatthew G Knepley } 1847efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1848efa14ee0SMatthew G Knepley } 1849efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1850efa14ee0SMatthew G Knepley } 1851efa14ee0SMatthew G Knepley if (subvertexIS) { 1852efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1853efa14ee0SMatthew G Knepley } 1854efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1855efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1856efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1857efa14ee0SMatthew G Knepley } 1858efa14ee0SMatthew G Knepley 1859efa14ee0SMatthew G Knepley #undef __FUNCT__ 1860766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated" 186127c04023SMatthew 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) 1862766ab985SMatthew G. Knepley { 186327c04023SMatthew G. Knepley DMLabel label = NULL; 1864766ab985SMatthew G. Knepley const PetscInt *cone; 186527234c99SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize; 1866766ab985SMatthew G. Knepley PetscErrorCode ierr; 1867766ab985SMatthew G. Knepley 1868812bfc34SJed Brown PetscFunctionBegin; 1869c0ed958bSJed Brown *numFaces = 0; 1870c0ed958bSJed Brown *nFV = 0; 1871b6d5cb33SJed Brown if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1872fed694aaSMatthew G. Knepley *subCells = NULL; 1873766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1874766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1875766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1876766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 187727c04023SMatthew G. Knepley if (label) { 187827c04023SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 187927c04023SMatthew G. Knepley PetscInt val; 188027c04023SMatthew G. Knepley 188127c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 188227c04023SMatthew G. Knepley if (val == value) { 188327c04023SMatthew G. Knepley ++(*numFaces); 188427c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 188527c04023SMatthew G. Knepley } 188627c04023SMatthew G. Knepley } 188727c04023SMatthew G. Knepley } else { 1888766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 188927c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 189027c04023SMatthew G. Knepley } 1891766ab985SMatthew G. Knepley *nFV = hasLagrange ? coneSize/3 : coneSize/2; 1892785e854fSJed Brown ierr = PetscMalloc1(*numFaces *2, subCells);CHKERRQ(ierr); 1893766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1894766ab985SMatthew G. Knepley const PetscInt *cells; 1895766ab985SMatthew G. Knepley PetscInt numCells; 1896766ab985SMatthew G. Knepley 189727c04023SMatthew G. Knepley if (label) { 189827c04023SMatthew G. Knepley PetscInt val; 189927c04023SMatthew G. Knepley 190027c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 190127c04023SMatthew G. Knepley if (val != value) continue; 190227c04023SMatthew G. Knepley } 1903766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1904766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 1905766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 1906766ab985SMatthew G. Knepley } 1907766ab985SMatthew G. Knepley /* Negative face */ 1908766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 190927234c99SMatthew G. Knepley /* Not true in parallel 191027234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 1911766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 1912766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 191327234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 1914766ab985SMatthew G. Knepley } 1915766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 1916766ab985SMatthew G. Knepley /* Positive face is not included */ 1917766ab985SMatthew G. Knepley } 1918766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1919766ab985SMatthew G. Knepley } 1920766ab985SMatthew G. Knepley 1921766ab985SMatthew G. Knepley #undef __FUNCT__ 1922766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated" 1923b3154360SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DMLabel subpointMap, DM subdm) 1924766ab985SMatthew G. Knepley { 192527c04023SMatthew G. Knepley DMLabel label = NULL; 1926766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 1927766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 1928766ab985SMatthew G. Knepley PetscErrorCode ierr; 1929766ab985SMatthew G. Knepley 1930812bfc34SJed Brown PetscFunctionBegin; 193127c04023SMatthew G. Knepley if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1932766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1933766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1934766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1935766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 1936dcca6d9dSJed Brown ierr = PetscMalloc2(dim+1,&pStart,dim+1,&pEnd);CHKERRQ(ierr); 1937b3154360SMatthew G. Knepley for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);} 1938766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1939766ab985SMatthew G. Knepley const PetscInt *cone; 1940766ab985SMatthew G. Knepley PetscInt *closure = NULL; 1941b3154360SMatthew G. Knepley PetscInt fconeSize, coneSize, closureSize, cl, val; 1942766ab985SMatthew G. Knepley 194327c04023SMatthew G. Knepley if (label) { 194427c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 194527c04023SMatthew G. Knepley if (val != value) continue; 194627c04023SMatthew G. Knepley } 1947766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 1948766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1949b3154360SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr); 1950b3154360SMatthew G. Knepley if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 1951b3154360SMatthew G. Knepley /* Negative face */ 1952766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1953766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1954766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 1955766ab985SMatthew G. Knepley 1956766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 1957766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1958766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1959766ab985SMatthew G. Knepley break; 1960766ab985SMatthew G. Knepley } 1961766ab985SMatthew G. Knepley } 1962766ab985SMatthew G. Knepley } 1963766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1964766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 1965766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 1966766ab985SMatthew G. Knepley const PetscInt *support; 1967766ab985SMatthew G. Knepley PetscInt supportSize, s; 1968766ab985SMatthew G. Knepley 1969766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 1970711de394SMatthew G. Knepley /* if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); */ 1971766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 1972766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 1973766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1974766ab985SMatthew G. Knepley } 1975766ab985SMatthew G. Knepley } 1976766ab985SMatthew G. Knepley } 1977766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 1978766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1979766ab985SMatthew G. Knepley } 1980766ab985SMatthew G. Knepley 1981766ab985SMatthew G. Knepley #undef __FUNCT__ 1982e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation" 1983e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 1984e6ccafaeSMatthew G Knepley { 198582f516ccSBarry Smith MPI_Comm comm; 1986e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 1987e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 1988e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 1989e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1990e6ccafaeSMatthew G Knepley 199182f516ccSBarry Smith PetscFunctionBegin; 199282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1993e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &cellDim);CHKERRQ(ierr); 1994e6ccafaeSMatthew G Knepley if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 1995e6ccafaeSMatthew G Knepley 1996ddeab2a6SMatthew G. Knepley if (cellDim == 1 && numCorners == 2) { 1997ddeab2a6SMatthew G. Knepley /* Triangle */ 1998e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 1999e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2000ddeab2a6SMatthew G. Knepley } else if (cellDim == 2 && numCorners == 3) { 2001ddeab2a6SMatthew G. Knepley /* Triangle */ 2002ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2003ddeab2a6SMatthew G. Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2004ddeab2a6SMatthew G. Knepley } else if (cellDim == 3 && numCorners == 4) { 2005ddeab2a6SMatthew G. Knepley /* Tetrahedron */ 2006ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2007ddeab2a6SMatthew G. Knepley posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2008e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 2009e6ccafaeSMatthew G Knepley /* Quadratic line */ 2010e6ccafaeSMatthew G Knepley faceSize = 1; 2011e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2012e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 2013e6ccafaeSMatthew G Knepley /* Quads */ 2014e6ccafaeSMatthew G Knepley faceSize = 2; 2015e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 2016e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2017e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 2018e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2019e6ccafaeSMatthew G Knepley } else { 2020e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 2021e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 2022e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 2023e6ccafaeSMatthew G Knepley } 2024e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 2025e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 2026e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2027e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 2028e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2029e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2030e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 2031e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2032e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2033e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 2034e6ccafaeSMatthew G Knepley }; 2035e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 2036e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2037e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2038e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 2039e6ccafaeSMatthew G Knepley }; 2040e6ccafaeSMatthew G Knepley 2041e6ccafaeSMatthew G Knepley faceSize = faceSizeTri; 2042e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 2043e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 2044e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 2045e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 2046e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2047e6ccafaeSMatthew G Knepley 2048e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 2049e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 2050e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 2051e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 2052e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 2053e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2054e6ccafaeSMatthew G Knepley break; 2055e6ccafaeSMatthew G Knepley } 2056e6ccafaeSMatthew G Knepley } 2057e6ccafaeSMatthew G Knepley } 2058e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2059e6ccafaeSMatthew G Knepley break; 2060e6ccafaeSMatthew G Knepley } 2061e6ccafaeSMatthew G Knepley } 2062e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 2063e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2064e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2065e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 2066e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 2067e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2068e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 2069e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2070e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2071e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 2072e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2073e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2074e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2075e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 2076e6ccafaeSMatthew G Knepley }; 2077e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 2078e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2079e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2080e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2081e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 2082e6ccafaeSMatthew G Knepley }; 2083e6ccafaeSMatthew G Knepley 2084e6ccafaeSMatthew G Knepley faceSize = faceSizeQuad; 2085e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 2086e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 2087e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 2088e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 2089e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2090e6ccafaeSMatthew G Knepley 2091e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 2092e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 2093e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 2094e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 2095e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 2096e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2097e6ccafaeSMatthew G Knepley break; 2098e6ccafaeSMatthew G Knepley } 2099e6ccafaeSMatthew G Knepley } 2100e6ccafaeSMatthew G Knepley } 2101e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2102e6ccafaeSMatthew G Knepley break; 2103e6ccafaeSMatthew G Knepley } 2104e6ccafaeSMatthew G Knepley } 2105e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 2106e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2107e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2108e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 2109e6ccafaeSMatthew G Knepley /* Hexes 2110e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2111e6ccafaeSMatthew G Knepley pointing up at the second. 2112e6ccafaeSMatthew G Knepley 2113e6ccafaeSMatthew G Knepley 7---6 2114e6ccafaeSMatthew G Knepley /| /| 2115e6ccafaeSMatthew G Knepley 4---5 | 2116ddeab2a6SMatthew G. Knepley | 1-|-2 2117e6ccafaeSMatthew G Knepley |/ |/ 2118ddeab2a6SMatthew G. Knepley 0---3 2119e6ccafaeSMatthew G Knepley 2120e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2121e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 2122e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 2123e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2124e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 2125e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 2126e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2127ddeab2a6SMatthew G. Knepley 0, 3, 4, 5, /* front */ 2128ddeab2a6SMatthew G. Knepley 2, 3, 5, 6, /* right */ 2129ddeab2a6SMatthew G. Knepley 1, 2, 6, 7, /* back */ 2130ddeab2a6SMatthew G. Knepley 0, 1, 4, 7, /* left */ 2131e6ccafaeSMatthew G Knepley }; 2132e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 2133ddeab2a6SMatthew G. Knepley 1, 2, 3, 0, /* bottom */ 2134e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2135ddeab2a6SMatthew G. Knepley 0, 3, 5, 4, /* front */ 2136ddeab2a6SMatthew G. Knepley 3, 2, 6, 5, /* right */ 2137ddeab2a6SMatthew G. Knepley 2, 1, 7, 6, /* back */ 2138ddeab2a6SMatthew G. Knepley 1, 0, 4, 7, /* left */ 2139e6ccafaeSMatthew G Knepley }; 2140e6ccafaeSMatthew G Knepley 2141e6ccafaeSMatthew G Knepley faceSize = faceSizeHex; 2142e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 2143e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 2144e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2145e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 2146e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2147e6ccafaeSMatthew G Knepley 2148e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 2149e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 2150e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 2151e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 2152e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 2153e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 2154e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 2155e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2156e6ccafaeSMatthew G Knepley break; 2157e6ccafaeSMatthew G Knepley } 2158e6ccafaeSMatthew G Knepley } 2159e6ccafaeSMatthew G Knepley } 2160e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2161e6ccafaeSMatthew G Knepley break; 2162e6ccafaeSMatthew G Knepley } 2163e6ccafaeSMatthew G Knepley } 2164e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2165e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2166e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2167e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 2168e6ccafaeSMatthew G Knepley /* Quadratic tet */ 2169e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 2170e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 2171e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 2172e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2173e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 2174e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2175e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 2176e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 2177e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 2178e6ccafaeSMatthew G Knepley }; 2179e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 2180e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2181e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 2182e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 2183e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 2184e6ccafaeSMatthew G Knepley }; 2185e6ccafaeSMatthew G Knepley 2186e6ccafaeSMatthew G Knepley faceSize = faceSizeTet; 2187e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 2188e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 2189e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 2190e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 2191e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2192e6ccafaeSMatthew G Knepley 2193e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 2194e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 2195e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 2196e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 2197e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 2198e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 2199e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 2200e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2201e6ccafaeSMatthew G Knepley break; 2202e6ccafaeSMatthew G Knepley } 2203e6ccafaeSMatthew G Knepley } 2204e6ccafaeSMatthew G Knepley } 2205e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2206e6ccafaeSMatthew G Knepley break; 2207e6ccafaeSMatthew G Knepley } 2208e6ccafaeSMatthew G Knepley } 2209e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 2210e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2211e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2212e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 2213e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 2214e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2215e6ccafaeSMatthew G Knepley pointing up at the second. 2216e6ccafaeSMatthew G Knepley 2217e6ccafaeSMatthew G Knepley 7---6 2218e6ccafaeSMatthew G Knepley /| /| 2219e6ccafaeSMatthew G Knepley 4---5 | 2220e6ccafaeSMatthew G Knepley | 3-|-2 2221e6ccafaeSMatthew G Knepley |/ |/ 2222e6ccafaeSMatthew G Knepley 0---1 2223e6ccafaeSMatthew G Knepley 2224e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2225e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 2226e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 2227e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2228e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 2229e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 2230e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2231e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 2232e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 2233e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 2234e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 2235e6ccafaeSMatthew G Knepley }; 2236e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 2237e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 2238e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2239e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 2240e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 2241e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 2242e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 2243e6ccafaeSMatthew G Knepley }; 2244e6ccafaeSMatthew G Knepley 2245e6ccafaeSMatthew G Knepley faceSize = faceSizeQuadHex; 2246e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 2247e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 2248e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2249e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 2250e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2251e6ccafaeSMatthew G Knepley 2252e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 2253e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 2254e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 2255e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 2256e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 2257e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 2258e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 2259e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2260e6ccafaeSMatthew G Knepley break; 2261e6ccafaeSMatthew G Knepley } 2262e6ccafaeSMatthew G Knepley } 2263e6ccafaeSMatthew G Knepley } 2264e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2265e6ccafaeSMatthew G Knepley break; 2266e6ccafaeSMatthew G Knepley } 2267e6ccafaeSMatthew G Knepley } 2268e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2269e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2270e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2271e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 2272e6ccafaeSMatthew G Knepley if (!posOrient) { 2273e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 2274e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 2275e6ccafaeSMatthew G Knepley } else { 2276e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 2277e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 2278e6ccafaeSMatthew G Knepley } 2279e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 2280e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2281e6ccafaeSMatthew G Knepley } 2282e6ccafaeSMatthew G Knepley 2283e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2284e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace" 2285e6ccafaeSMatthew G Knepley /* 2286e6ccafaeSMatthew G Knepley Given a cell and a face, as a set of vertices, 2287e6ccafaeSMatthew G Knepley return the oriented face, as a set of vertices, in faceVertices 2288e6ccafaeSMatthew G Knepley The orientation is such that the face normal points out of the cell 2289e6ccafaeSMatthew G Knepley */ 2290e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2291e6ccafaeSMatthew G Knepley { 22920298fd71SBarry Smith const PetscInt *cone = NULL; 2293e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 2294e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 2295e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2296e6ccafaeSMatthew G Knepley 2297e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2298e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 2299e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 2300e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 2301e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2302e6ccafaeSMatthew G Knepley 2303e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 2304e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 2305e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 2306e6ccafaeSMatthew G Knepley } 2307e6ccafaeSMatthew G Knepley } 2308e6ccafaeSMatthew G Knepley if (found) { 2309e6ccafaeSMatthew G Knepley indices[v2] = v; 2310e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 2311e6ccafaeSMatthew G Knepley ++v2; 2312e6ccafaeSMatthew G Knepley } else { 2313e6ccafaeSMatthew G Knepley oppositeVertex = v; 2314e6ccafaeSMatthew G Knepley } 2315e6ccafaeSMatthew G Knepley } 2316e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 2317e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2318e6ccafaeSMatthew G Knepley } 2319e6ccafaeSMatthew G Knepley 2320e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2321cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal" 2322e6ccafaeSMatthew G Knepley /* 2323cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 2324e6ccafaeSMatthew G Knepley 2325e6ccafaeSMatthew G Knepley Not collective 2326e6ccafaeSMatthew G Knepley 2327e6ccafaeSMatthew G Knepley Input Parameters: 2328e6ccafaeSMatthew G Knepley + dm - The DMPlex 2329e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 2330e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 2331e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 2332e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 2333e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 2334e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 2335e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 2336e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 2337e6ccafaeSMatthew G Knepley 2338e6ccafaeSMatthew G Knepley Output Parameters: 2339e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 2340e6ccafaeSMatthew G Knepley 2341e6ccafaeSMatthew G Knepley Level: developer 2342e6ccafaeSMatthew G Knepley */ 2343cd0c2139SMatthew 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) 2344e6ccafaeSMatthew G Knepley { 234582f516ccSBarry Smith MPI_Comm comm; 2346e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 2347e6ccafaeSMatthew G Knepley const PetscInt *faces; 2348e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 2349e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2350e6ccafaeSMatthew G Knepley 2351e6ccafaeSMatthew G Knepley PetscFunctionBegin; 235282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2353e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 2354e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 2355e6ccafaeSMatthew G Knepley #if 0 2356e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 2357e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2358e6ccafaeSMatthew G Knepley #else 2359e6ccafaeSMatthew G Knepley { 2360e6ccafaeSMatthew G Knepley PetscInt f; 2361e6ccafaeSMatthew G Knepley 2362e6ccafaeSMatthew G Knepley numFaces = 0; 2363e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2364e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 2365e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 2366e6ccafaeSMatthew G Knepley 2367e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 2368e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 2369e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 2370e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 2371e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 2372e6ccafaeSMatthew G Knepley PetscInt v; 2373e6ccafaeSMatthew G Knepley 2374e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2375e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 2376e6ccafaeSMatthew G Knepley } 2377e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 2378e6ccafaeSMatthew G Knepley } 2379e6ccafaeSMatthew G Knepley if (d == dof) { 2380e6ccafaeSMatthew G Knepley numFaces = 1; 2381e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 2382e6ccafaeSMatthew G Knepley } 2383e6ccafaeSMatthew G Knepley } 2384e6ccafaeSMatthew G Knepley } 2385e6ccafaeSMatthew G Knepley #endif 2386e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 2387e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 2388e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 2389766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 2390e6ccafaeSMatthew G Knepley } else { 2391e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 2392e6ccafaeSMatthew G Knepley PetscBool posOriented; 2393e6ccafaeSMatthew G Knepley 2394e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2395e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 2396e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 2397e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 2398e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 2399e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 2400e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2401e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 2402e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 2403e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 2404e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 2405e6ccafaeSMatthew G Knepley break; 2406e6ccafaeSMatthew G Knepley } 2407e6ccafaeSMatthew G Knepley } 2408e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 2409e6ccafaeSMatthew G Knepley } 2410e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 2411e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 2412e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2413e6ccafaeSMatthew G Knepley ++(*newFacePoint); 2414e6ccafaeSMatthew G Knepley } 2415ef07cca7SMatthew G. Knepley #if 0 2416e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2417ef07cca7SMatthew G. Knepley #else 2418ef07cca7SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2419ef07cca7SMatthew G. Knepley #endif 2420e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2421e6ccafaeSMatthew G Knepley } 2422e6ccafaeSMatthew G Knepley 2423e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2424e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated" 242553156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2426e6ccafaeSMatthew G Knepley { 242782f516ccSBarry Smith MPI_Comm comm; 242853156dfcSMatthew G. Knepley DMLabel subpointMap; 2429efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 2430efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 2431efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 2432fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 2433efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 2434e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2435e6ccafaeSMatthew G Knepley 2436e6ccafaeSMatthew G Knepley PetscFunctionBegin; 243782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2438efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2439efa14ee0SMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2440efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2441efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 244253156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);} 2443efa14ee0SMatthew G Knepley /* Setup chart */ 2444efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2445efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2446efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2447efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2448e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2449e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 2450efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 2451e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 2452efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2453efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2454efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 2455efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2456e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2457e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2458e6ccafaeSMatthew G Knepley } 2459e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2460e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2461e6ccafaeSMatthew G Knepley } 2462e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2463e6ccafaeSMatthew G Knepley /* Create face cones */ 2464efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 24650298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2466efa14ee0SMatthew G Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2467e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2468e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 2469efa14ee0SMatthew G Knepley const PetscInt subcell = c; 24700298fd71SBarry Smith PetscInt *closure = NULL; 2471efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 2472e6ccafaeSMatthew G Knepley 2473e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2474efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2475efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 2476e6ccafaeSMatthew G Knepley PetscInt subVertex; 2477e6ccafaeSMatthew G Knepley 2478efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 2479efa14ee0SMatthew G Knepley ++numCorners; 2480efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 2481efa14ee0SMatthew G Knepley if (subVertex >= 0) { 2482efa14ee0SMatthew G Knepley closure[faceSize] = point; 248365560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 2484e6ccafaeSMatthew G Knepley ++faceSize; 2485e6ccafaeSMatthew G Knepley } 2486e6ccafaeSMatthew G Knepley } 2487e6ccafaeSMatthew G Knepley } 2488efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 2489efa14ee0SMatthew G Knepley if (faceSize == nFV) { 2490cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 2491e6ccafaeSMatthew G Knepley } 249265560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2493e6ccafaeSMatthew G Knepley } 2494efa14ee0SMatthew G Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2495e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2496e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2497e6ccafaeSMatthew G Knepley /* Build coordinates */ 2498efa14ee0SMatthew G Knepley { 2499efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 2500efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 2501efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 2502285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2503efa14ee0SMatthew G Knepley 250469d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2505e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 250669d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2507285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2508285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2509285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2510efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2511efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2512efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2513efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2514efa14ee0SMatthew G Knepley PetscInt dof; 2515efa14ee0SMatthew G Knepley 2516efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2517efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2518285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2519e6ccafaeSMatthew G Knepley } 2520e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2521e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2522e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2523e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 25242eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2525830e53efSMatthew G. Knepley if (coordSize) { 2526e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2527e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2528efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2529efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2530efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2531efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2532e6ccafaeSMatthew G Knepley 2533e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2534e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2535efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2536efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2537efa14ee0SMatthew 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); 2538e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2539e6ccafaeSMatthew G Knepley } 2540e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2541e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 25423b399e24SMatthew G. Knepley } 2543e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2544e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2545e6ccafaeSMatthew G Knepley } 2546efa14ee0SMatthew G Knepley /* Cleanup */ 2547efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2548efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2549efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2550efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2551e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2552e6ccafaeSMatthew G Knepley } 2553e6ccafaeSMatthew G Knepley 2554e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2555e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated" 255653156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2557e6ccafaeSMatthew G Knepley { 255882f516ccSBarry Smith MPI_Comm comm; 255953156dfcSMatthew G. Knepley DMLabel subpointMap; 2560efa14ee0SMatthew G Knepley IS *subpointIS; 2561efa14ee0SMatthew G Knepley const PetscInt **subpoints; 256201a2673eSMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *coneONew; 2563efa14ee0SMatthew G Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2564e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2565e6ccafaeSMatthew G Knepley 2566e6ccafaeSMatthew G Knepley PetscFunctionBegin; 256782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2568efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2569e6ccafaeSMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2570efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2571efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 257253156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Interpolated(dm, vertexLabel, value, subpointMap, subdm);CHKERRQ(ierr);} 2573efa14ee0SMatthew G Knepley /* Setup chart */ 2574efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2575dcca6d9dSJed Brown ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr); 2576e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2577e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2578e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 2579e6ccafaeSMatthew G Knepley } 2580e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2581e6ccafaeSMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2582e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2583e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 2584e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2585e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2586e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2587e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2588e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 25890ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2590e6ccafaeSMatthew G Knepley } 2591e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2592e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2593e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2594e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2595e6ccafaeSMatthew G Knepley const PetscInt *cone; 2596e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 2597e6ccafaeSMatthew G Knepley 2598e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2599e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2600e6ccafaeSMatthew G Knepley if (d == dim) { 2601e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2602e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2603e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2604e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 2605e6ccafaeSMatthew G Knepley } 2606e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2607e6ccafaeSMatthew G Knepley } 2608e6ccafaeSMatthew G Knepley } 2609e6ccafaeSMatthew G Knepley } 2610e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2611e6ccafaeSMatthew G Knepley /* Set cones */ 26120298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2613dcca6d9dSJed Brown ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&coneONew);CHKERRQ(ierr); 2614e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2615e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2616e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2617e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 26180e49e2e2SMatthew G. Knepley const PetscInt *cone, *ornt; 2619e6ccafaeSMatthew G Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2620e6ccafaeSMatthew G Knepley 2621e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2622e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2623e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 26240e49e2e2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2625e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2626e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 262701a2673eSMatthew G. Knepley if (subc >= 0) { 262801a2673eSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 262901a2673eSMatthew G. Knepley coneONew[coneSizeNew] = ornt[c]; 263001a2673eSMatthew G. Knepley ++coneSizeNew; 263101a2673eSMatthew G. Knepley } 2632e6ccafaeSMatthew G Knepley } 2633e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2634e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 263501a2673eSMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, coneONew);CHKERRQ(ierr); 2636e6ccafaeSMatthew G Knepley } 2637e6ccafaeSMatthew G Knepley } 263801a2673eSMatthew G. Knepley ierr = PetscFree2(coneNew,coneONew);CHKERRQ(ierr); 2639e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2640e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2641e6ccafaeSMatthew G Knepley /* Build coordinates */ 2642e6ccafaeSMatthew G Knepley { 2643e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 2644e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 2645e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 2646285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2647e6ccafaeSMatthew G Knepley 264869d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2649e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 265069d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2651285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2652285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2653285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2654e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2655e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2656e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2657e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2658e6ccafaeSMatthew G Knepley PetscInt dof; 2659e6ccafaeSMatthew G Knepley 2660e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2661e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2662285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2663e6ccafaeSMatthew G Knepley } 2664e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2665e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2666e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2667e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 26682eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2669e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2670e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2671e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2672e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2673e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2674e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2675e6ccafaeSMatthew G Knepley 2676e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2677e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2678e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2679e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2680e6ccafaeSMatthew 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); 2681efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2682e6ccafaeSMatthew G Knepley } 2683e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2684e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2685e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2686e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2687e6ccafaeSMatthew G Knepley } 2688efa14ee0SMatthew G Knepley /* Cleanup */ 2689e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 26900ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2691e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2692e6ccafaeSMatthew G Knepley } 2693efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2694e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2695e6ccafaeSMatthew G Knepley } 2696e6ccafaeSMatthew G Knepley 2697e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2698e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh" 2699d0fa310fSMatthew G. Knepley /*@ 2700e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 2701e6ccafaeSMatthew G Knepley 2702e6ccafaeSMatthew G Knepley Input Parameters: 2703e6ccafaeSMatthew G Knepley + dm - The original mesh 2704830e53efSMatthew G. Knepley . vertexLabel - The DMLabel marking vertices contained in the surface 2705830e53efSMatthew G. Knepley - value - The label value to use 2706e6ccafaeSMatthew G Knepley 2707e6ccafaeSMatthew G Knepley Output Parameter: 2708e6ccafaeSMatthew G Knepley . subdm - The surface mesh 2709e6ccafaeSMatthew G Knepley 2710e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2711e6ccafaeSMatthew G Knepley 2712e6ccafaeSMatthew G Knepley Level: developer 2713e6ccafaeSMatthew G Knepley 2714e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue() 2715830e53efSMatthew G. Knepley @*/ 271653156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm) 2717e6ccafaeSMatthew G Knepley { 2718e6ccafaeSMatthew G Knepley PetscInt dim, depth; 2719e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2720e6ccafaeSMatthew G Knepley 2721e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2722e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2723766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 2724e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2725e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 272682f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2727e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2728e6ccafaeSMatthew G Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2729e6ccafaeSMatthew G Knepley if (depth == dim) { 2730830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2731e6ccafaeSMatthew G Knepley } else { 2732830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2733e6ccafaeSMatthew G Knepley } 2734e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2735e6ccafaeSMatthew G Knepley } 2736e6ccafaeSMatthew G Knepley 2737e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2738aca35d17SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal" 2739aca35d17SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 2740aca35d17SMatthew G. Knepley { 2741aca35d17SMatthew G. Knepley PetscInt subPoint; 2742aca35d17SMatthew G. Knepley PetscErrorCode ierr; 2743aca35d17SMatthew G. Knepley 2744aca35d17SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 2745aca35d17SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 2746aca35d17SMatthew G. Knepley } 2747aca35d17SMatthew G. Knepley 2748aca35d17SMatthew G. Knepley #undef __FUNCT__ 2749766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated" 275027c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 2751766ab985SMatthew G. Knepley { 2752766ab985SMatthew G. Knepley MPI_Comm comm; 2753766ab985SMatthew G. Knepley DMLabel subpointMap; 2754766ab985SMatthew G. Knepley IS subvertexIS; 2755766ab985SMatthew G. Knepley const PetscInt *subVertices; 2756fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 2757766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 275887feddfdSMatthew G. Knepley PetscInt cMax, c, f; 2759766ab985SMatthew G. Knepley PetscErrorCode ierr; 2760766ab985SMatthew G. Knepley 2761766ab985SMatthew G. Knepley PetscFunctionBegin; 2762766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 2763766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2764766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2765766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2766766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 276727c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 2768766ab985SMatthew G. Knepley /* Setup chart */ 2769766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2770766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2771766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2772766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2773766ab985SMatthew G. Knepley /* Set cone sizes */ 2774766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 2775766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 2776766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 2777766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2778766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2779766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2780766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2781766ab985SMatthew G. Knepley } 2782766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2783766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2784766ab985SMatthew G. Knepley } 2785766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2786766ab985SMatthew G. Knepley /* Create face cones */ 2787766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 278887feddfdSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2789766ab985SMatthew G. Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2790766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2791766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 2792766ab985SMatthew G. Knepley const PetscInt subcell = c; 279387feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 279487feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 2795766ab985SMatthew G. Knepley 279687feddfdSMatthew G. Knepley if (cell < cMax) continue; 279787feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 279887feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 279987feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 280087feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 280187feddfdSMatthew G. Knepley } 280287feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 280387feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 280487feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 280527234c99SMatthew G. Knepley /* Not true in parallel 280627234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 280787feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 280887feddfdSMatthew G. Knepley PetscInt negsubcell; 2809766ab985SMatthew G. Knepley 281087feddfdSMatthew G. Knepley if (cells[p] >= cMax) continue; 281187feddfdSMatthew G. Knepley /* I know this is a crap search */ 281287feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 281387feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 2814766ab985SMatthew G. Knepley } 281587feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 281687feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 2817766ab985SMatthew G. Knepley } 281887feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 281987feddfdSMatthew G. Knepley ++newFacePoint; 2820766ab985SMatthew G. Knepley } 2821766ab985SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2822766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2823766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2824766ab985SMatthew G. Knepley /* Build coordinates */ 2825766ab985SMatthew G. Knepley { 2826766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2827766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2828766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2829285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2830766ab985SMatthew G. Knepley 283169d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2832766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 283369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2834285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2835285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2836285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2837766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2838766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2839766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2840766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2841766ab985SMatthew G. Knepley PetscInt dof; 2842766ab985SMatthew G. Knepley 2843766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2844766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2845285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2846766ab985SMatthew G. Knepley } 2847766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2848766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2849766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2850766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 28512eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2852766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2853766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2854766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2855766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2856766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2857766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 2858766ab985SMatthew G. Knepley 2859766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2860766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2861766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2862766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2863766ab985SMatthew 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); 2864766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2865766ab985SMatthew G. Knepley } 2866766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2867766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2868766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2869766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2870766ab985SMatthew G. Knepley } 2871aca35d17SMatthew G. Knepley /* Build SF */ 2872aca35d17SMatthew G. Knepley CHKMEMQ; 2873aca35d17SMatthew G. Knepley { 2874aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 2875aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 2876bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 2877aca35d17SMatthew G. Knepley const PetscInt *localPoints; 2878bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 287949c26ae4SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 2880bdcf2095SMatthew G. Knepley PetscMPIInt rank; 2881aca35d17SMatthew G. Knepley 2882bdcf2095SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 2883aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 2884aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 2885aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2886aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 2887aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 2888aca35d17SMatthew G. Knepley if (numRoots >= 0) { 2889aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 2890dcca6d9dSJed Brown ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 2891bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 2892bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 2893bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 2894bdcf2095SMatthew G. Knepley } 28959e0823b2SMatthew G. Knepley /* Set subleaves */ 2896aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2897aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 2898bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2899aca35d17SMatthew G. Knepley 2900aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 2901bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 2902bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 2903bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 2904bdcf2095SMatthew G. Knepley ++numSubLeaves; 2905aca35d17SMatthew G. Knepley } 29069e0823b2SMatthew G. Knepley /* Must put in owned subpoints */ 29079e0823b2SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 29089e0823b2SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 29099e0823b2SMatthew G. Knepley 29109e0823b2SMatthew G. Knepley if (subPoint < 0) { 29119e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = -3; 29129e0823b2SMatthew G. Knepley newOwners[p-pStart].index = -3; 29139e0823b2SMatthew G. Knepley } else { 29149e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = rank; 29159e0823b2SMatthew G. Knepley newOwners[p-pStart].index = subPoint; 29169e0823b2SMatthew G. Knepley } 2917bdcf2095SMatthew G. Knepley } 2918bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2919bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2920bdcf2095SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2921bdcf2095SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2922785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &slocalPoints);CHKERRQ(ierr); 2923785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &sremotePoints);CHKERRQ(ierr); 292449c26ae4SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 2925bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 2926bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2927aca35d17SMatthew G. Knepley 2928aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 292949c26ae4SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 2930aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 2931bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 2932bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 2933bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 2934bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 2935aca35d17SMatthew G. Knepley ++sl; 2936aca35d17SMatthew G. Knepley } 2937bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 293849c26ae4SMatthew G. Knepley if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 293949c26ae4SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 2940aca35d17SMatthew G. Knepley } 2941aca35d17SMatthew G. Knepley } 2942aca35d17SMatthew G. Knepley CHKMEMQ; 2943766ab985SMatthew G. Knepley /* Cleanup */ 2944766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2945766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2946766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 2947766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2948766ab985SMatthew G. Knepley } 2949766ab985SMatthew G. Knepley 2950766ab985SMatthew G. Knepley #undef __FUNCT__ 2951766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated" 2952b3154360SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char label[], PetscInt value, DM subdm) 2953766ab985SMatthew G. Knepley { 2954766ab985SMatthew G. Knepley MPI_Comm comm; 2955766ab985SMatthew G. Knepley DMLabel subpointMap; 2956766ab985SMatthew G. Knepley IS *subpointIS; 2957766ab985SMatthew G. Knepley const PetscInt **subpoints; 2958b1a8e46aSMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *orntNew; 2959766ab985SMatthew G. Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2960766ab985SMatthew G. Knepley PetscErrorCode ierr; 2961766ab985SMatthew G. Knepley 2962766ab985SMatthew G. Knepley PetscFunctionBegin; 2963766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2964766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2965766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2966766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2967766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 2968b3154360SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr); 2969766ab985SMatthew G. Knepley /* Setup chart */ 2970766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2971dcca6d9dSJed Brown ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr); 2972766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2973766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2974766ab985SMatthew G. Knepley totSubPoints += numSubPoints[d]; 2975766ab985SMatthew G. Knepley } 2976766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2977766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2978766ab985SMatthew G. Knepley /* Set cone sizes */ 2979766ab985SMatthew G. Knepley firstSubPoint[dim] = 0; 2980766ab985SMatthew G. Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2981766ab985SMatthew G. Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2982766ab985SMatthew G. Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2983766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2984766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2985b643afeaSMatthew G. Knepley if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2986766ab985SMatthew G. Knepley } 2987766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2988766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2989766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2990766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2991766ab985SMatthew G. Knepley const PetscInt *cone; 2992766ab985SMatthew G. Knepley PetscInt coneSize, coneSizeNew, c, val; 2993766ab985SMatthew G. Knepley 2994766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2995766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2996766ab985SMatthew G. Knepley if (d == dim) { 2997766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2998766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2999766ab985SMatthew G. Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 3000766ab985SMatthew G. Knepley if (val >= 0) coneSizeNew++; 3001766ab985SMatthew G. Knepley } 3002766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 3003766ab985SMatthew G. Knepley } 3004766ab985SMatthew G. Knepley } 3005766ab985SMatthew G. Knepley } 3006766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 3007766ab985SMatthew G. Knepley /* Set cones */ 3008766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 3009dcca6d9dSJed Brown ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&orntNew);CHKERRQ(ierr); 3010766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 3011766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 3012766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 3013766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 3014b1a8e46aSMatthew G. Knepley const PetscInt *cone, *ornt; 3015766ab985SMatthew G. Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 3016766ab985SMatthew G. Knepley 3017766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 3018766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 3019766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 3020b1a8e46aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 3021766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 3022766ab985SMatthew G. Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 3023b1a8e46aSMatthew G. Knepley if (subc >= 0) { 3024b1a8e46aSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 3025b1a8e46aSMatthew G. Knepley orntNew[coneSizeNew++] = ornt[c]; 3026b1a8e46aSMatthew G. Knepley } 3027766ab985SMatthew G. Knepley } 3028766ab985SMatthew G. Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 3029766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 3030b1a8e46aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, orntNew);CHKERRQ(ierr); 3031766ab985SMatthew G. Knepley } 3032766ab985SMatthew G. Knepley } 3033b1a8e46aSMatthew G. Knepley ierr = PetscFree2(coneNew,orntNew);CHKERRQ(ierr); 3034766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 3035766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 3036766ab985SMatthew G. Knepley /* Build coordinates */ 3037766ab985SMatthew G. Knepley { 3038766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 3039766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 3040766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 3041285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 3042766ab985SMatthew G. Knepley 304369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3044766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 304569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 3046285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 3047285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 3048285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 3049766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 3050766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 3051766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 3052766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 3053766ab985SMatthew G. Knepley PetscInt dof; 3054766ab985SMatthew G. Knepley 3055766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3056766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 3057285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 3058766ab985SMatthew G. Knepley } 3059766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 3060766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 3061766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 3062766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 30632eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 3064766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 3065766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3066766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 3067766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 3068766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 3069766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 3070766ab985SMatthew G. Knepley 3071766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3072766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 3073766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 3074766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 3075766ab985SMatthew 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); 3076766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 3077766ab985SMatthew G. Knepley } 3078766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3079766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3080766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 3081766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 3082766ab985SMatthew G. Knepley } 3083c80a7578SMatthew G. Knepley /* Build SF: We need this complexity because subpoints might not be selected on the owning process */ 3084c80a7578SMatthew G. Knepley { 3085c80a7578SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 3086251556f3SMatthew G. Knepley IS subpIS; 3087c80a7578SMatthew G. Knepley const PetscSFNode *remotePoints; 3088c80a7578SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 3089c80a7578SMatthew G. Knepley const PetscInt *localPoints, *subpoints; 3090c80a7578SMatthew G. Knepley PetscInt *slocalPoints; 3091f033dbf2SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubpoints = 0, numSubroots, numSubleaves = 0, l, sl, ll, pStart, pEnd, p; 3092c80a7578SMatthew G. Knepley PetscMPIInt rank; 3093c80a7578SMatthew G. Knepley 3094c80a7578SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 3095c80a7578SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 3096c80a7578SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 3097c80a7578SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3098c80a7578SMatthew G. Knepley ierr = DMPlexGetChart(subdm, NULL, &numSubroots);CHKERRQ(ierr); 3099251556f3SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpIS);CHKERRQ(ierr); 3100251556f3SMatthew G. Knepley if (subpIS) { 3101251556f3SMatthew G. Knepley ierr = ISGetIndices(subpIS, &subpoints);CHKERRQ(ierr); 3102251556f3SMatthew G. Knepley ierr = ISGetLocalSize(subpIS, &numSubpoints);CHKERRQ(ierr); 3103f033dbf2SMatthew G. Knepley } 3104c80a7578SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 3105c80a7578SMatthew G. Knepley if (numRoots >= 0) { 310682db75e7SMatthew G. Knepley ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 3107c80a7578SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 3108c80a7578SMatthew G. Knepley newLocalPoints[p].rank = -2; 3109c80a7578SMatthew G. Knepley newLocalPoints[p].index = -2; 3110c80a7578SMatthew G. Knepley } 3111c80a7578SMatthew G. Knepley /* Set subleaves */ 3112c80a7578SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 3113c80a7578SMatthew G. Knepley const PetscInt point = localPoints[l]; 3114c80a7578SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 3115c80a7578SMatthew G. Knepley 3116c80a7578SMatthew G. Knepley if (subpoint < 0) continue; 3117c80a7578SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 3118c80a7578SMatthew G. Knepley newLocalPoints[point-pStart].index = subpoint; 3119c80a7578SMatthew G. Knepley ++numSubleaves; 3120c80a7578SMatthew G. Knepley } 3121c80a7578SMatthew G. Knepley /* Must put in owned subpoints */ 3122c80a7578SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 3123c80a7578SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(p, 0, numSubpoints, subpoints); 3124c80a7578SMatthew G. Knepley 3125c80a7578SMatthew G. Knepley if (subpoint < 0) { 3126c80a7578SMatthew G. Knepley newOwners[p-pStart].rank = -3; 3127c80a7578SMatthew G. Knepley newOwners[p-pStart].index = -3; 3128c80a7578SMatthew G. Knepley } else { 3129c80a7578SMatthew G. Knepley newOwners[p-pStart].rank = rank; 3130c80a7578SMatthew G. Knepley newOwners[p-pStart].index = subpoint; 3131c80a7578SMatthew G. Knepley } 3132c80a7578SMatthew G. Knepley } 3133c80a7578SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3134c80a7578SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3135c80a7578SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3136c80a7578SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3137c80a7578SMatthew G. Knepley ierr = PetscMalloc(numSubleaves * sizeof(PetscInt), &slocalPoints);CHKERRQ(ierr); 3138c80a7578SMatthew G. Knepley ierr = PetscMalloc(numSubleaves * sizeof(PetscSFNode), &sremotePoints);CHKERRQ(ierr); 3139c80a7578SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 3140c80a7578SMatthew G. Knepley const PetscInt point = localPoints[l]; 3141c80a7578SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 3142c80a7578SMatthew G. Knepley 3143c80a7578SMatthew G. Knepley if (subpoint < 0) continue; 3144c80a7578SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 3145c80a7578SMatthew G. Knepley slocalPoints[sl] = subpoint; 3146c80a7578SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 3147c80a7578SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 3148c80a7578SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 3149c80a7578SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 3150c80a7578SMatthew G. Knepley ++sl; 3151c80a7578SMatthew G. Knepley } 3152c80a7578SMatthew G. Knepley if (sl + ll != numSubleaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubleaves); 3153c80a7578SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 3154c80a7578SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubroots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 3155c80a7578SMatthew G. Knepley } 3156251556f3SMatthew G. Knepley if (subpIS) { 3157251556f3SMatthew G. Knepley ierr = ISRestoreIndices(subpIS, &subpoints);CHKERRQ(ierr); 3158251556f3SMatthew G. Knepley ierr = ISDestroy(&subpIS);CHKERRQ(ierr); 3159251556f3SMatthew G. Knepley } 3160c80a7578SMatthew G. Knepley } 3161766ab985SMatthew G. Knepley /* Cleanup */ 3162766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 3163b643afeaSMatthew G. Knepley if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 3164766ab985SMatthew G. Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 3165766ab985SMatthew G. Knepley } 3166766ab985SMatthew G. Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 3167766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3168766ab985SMatthew G. Knepley } 3169766ab985SMatthew G. Knepley 3170766ab985SMatthew G. Knepley #undef __FUNCT__ 3171766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh" 3172766ab985SMatthew G. Knepley /* 317327c04023SMatthew 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. 3174766ab985SMatthew G. Knepley 3175766ab985SMatthew G. Knepley Input Parameters: 3176766ab985SMatthew G. Knepley + dm - The original mesh 317727c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 31787afc1a8bSJed Brown . label - A label name, or NULL 317927c04023SMatthew G. Knepley - value - A label value 3180766ab985SMatthew G. Knepley 3181766ab985SMatthew G. Knepley Output Parameter: 3182766ab985SMatthew G. Knepley . subdm - The surface mesh 3183766ab985SMatthew G. Knepley 3184766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3185766ab985SMatthew G. Knepley 3186766ab985SMatthew G. Knepley Level: developer 3187766ab985SMatthew G. Knepley 3188766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 3189766ab985SMatthew G. Knepley */ 319027c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 3191766ab985SMatthew G. Knepley { 3192766ab985SMatthew G. Knepley PetscInt dim, depth; 3193766ab985SMatthew G. Knepley PetscErrorCode ierr; 3194766ab985SMatthew G. Knepley 3195766ab985SMatthew G. Knepley PetscFunctionBegin; 3196766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 319727c04023SMatthew G. Knepley PetscValidPointer(subdm, 5); 3198766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 3199766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3200766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 3201766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3202766ab985SMatthew G. Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 3203766ab985SMatthew G. Knepley if (depth == dim) { 3204b3154360SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr); 3205766ab985SMatthew G. Knepley } else { 320627c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 3207e6ccafaeSMatthew G Knepley } 3208e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3209e6ccafaeSMatthew G Knepley } 3210e6ccafaeSMatthew G Knepley 3211e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3212e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap" 321364beef6dSMatthew G. Knepley /*@ 321464beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 321564beef6dSMatthew G. Knepley 321664beef6dSMatthew G. Knepley Input Parameter: 321764beef6dSMatthew G. Knepley . dm - The submesh DM 321864beef6dSMatthew G. Knepley 321964beef6dSMatthew G. Knepley Output Parameter: 322064beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 322164beef6dSMatthew G. Knepley 322264beef6dSMatthew G. Knepley Level: developer 322364beef6dSMatthew G. Knepley 322464beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 322564beef6dSMatthew G. Knepley @*/ 3226e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 3227e6ccafaeSMatthew G Knepley { 3228e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3229e6ccafaeSMatthew G Knepley 3230e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3231e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3232e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 3233e6ccafaeSMatthew G Knepley *subpointMap = mesh->subpointMap; 3234e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3235e6ccafaeSMatthew G Knepley } 3236e6ccafaeSMatthew G Knepley 3237e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3238e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap" 3239e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */ 3240e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 3241e6ccafaeSMatthew G Knepley { 3242e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 3243285d324eSMatthew G. Knepley DMLabel tmp; 3244e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3245e6ccafaeSMatthew G Knepley 3246e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3247e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3248285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 3249e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 3250285d324eSMatthew G. Knepley ++mesh->subpointMap->refct; 3251285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 3252e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3253e6ccafaeSMatthew G Knepley } 3254e6ccafaeSMatthew G Knepley 3255e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3256e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS" 325764beef6dSMatthew G. Knepley /*@ 3258e6ccafaeSMatthew G Knepley DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 3259e6ccafaeSMatthew G Knepley 3260e6ccafaeSMatthew G Knepley Input Parameter: 3261e6ccafaeSMatthew G Knepley . dm - The submesh DM 3262e6ccafaeSMatthew G Knepley 3263e6ccafaeSMatthew G Knepley Output Parameter: 32640298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 3265e6ccafaeSMatthew G Knepley 3266e6ccafaeSMatthew G Knepley Note: This is IS is guaranteed to be sorted by the construction of the submesh 326764beef6dSMatthew G. Knepley 326864beef6dSMatthew G. Knepley Level: developer 326964beef6dSMatthew G. Knepley 327064beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 327164beef6dSMatthew G. Knepley @*/ 3272e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 3273e6ccafaeSMatthew G Knepley { 327482f516ccSBarry Smith MPI_Comm comm; 3275e6ccafaeSMatthew G Knepley DMLabel subpointMap; 3276e6ccafaeSMatthew G Knepley IS is; 3277e6ccafaeSMatthew G Knepley const PetscInt *opoints; 3278e6ccafaeSMatthew G Knepley PetscInt *points, *depths; 3279e6ccafaeSMatthew G Knepley PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 3280e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3281e6ccafaeSMatthew G Knepley 3282e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3283e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3284e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 328582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 32860298fd71SBarry Smith *subpointIS = NULL; 3287e6ccafaeSMatthew G Knepley ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 3288e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3289fed694aaSMatthew G. Knepley if (subpointMap && depth >= 0) { 3290e6ccafaeSMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3291e6ccafaeSMatthew G Knepley if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 3292e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3293e6ccafaeSMatthew G Knepley depths[0] = depth; 3294e6ccafaeSMatthew G Knepley depths[1] = 0; 3295e6ccafaeSMatthew G Knepley for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 3296785e854fSJed Brown ierr = PetscMalloc1(pEnd, &points);CHKERRQ(ierr); 3297e6ccafaeSMatthew G Knepley for(d = 0, off = 0; d <= depth; ++d) { 3298e6ccafaeSMatthew G Knepley const PetscInt dep = depths[d]; 3299e6ccafaeSMatthew G Knepley 3300e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 3301e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 33021e21b6fdSMatthew G Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 3303e6ccafaeSMatthew 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); 3304e6ccafaeSMatthew G Knepley } else { 33051e21b6fdSMatthew G Knepley if (!n) { 33061e21b6fdSMatthew G Knepley if (d == 0) { 33071e21b6fdSMatthew G Knepley /* Missing cells */ 33081e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 33091e21b6fdSMatthew G Knepley } else { 33101e21b6fdSMatthew G Knepley /* Missing faces */ 33111e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 33121e21b6fdSMatthew G Knepley } 33131e21b6fdSMatthew G Knepley } 3314e6ccafaeSMatthew G Knepley } 3315e6ccafaeSMatthew G Knepley if (n) { 3316e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 3317e6ccafaeSMatthew G Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 3318e6ccafaeSMatthew G Knepley for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 3319e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 3320e6ccafaeSMatthew G Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 3321e6ccafaeSMatthew G Knepley } 3322e6ccafaeSMatthew G Knepley } 3323e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3324e6ccafaeSMatthew G Knepley if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 3325fed694aaSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 3326e6ccafaeSMatthew G Knepley } 3327e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3328e6ccafaeSMatthew G Knepley } 3329