1af0996ceSBarry Smith #include <petsc/private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 2c58f1c22SToby Isaac #include <petsc/private/dmlabelimpl.h> /*I "petscdmlabel.h" I*/ 30c312b8eSJed Brown #include <petscsf.h> 4e6ccafaeSMatthew G Knepley 5e6ccafaeSMatthew G Knepley #undef __FUNCT__ 630560a7bSMatthew G. Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces_Internal" 730560a7bSMatthew G. Knepley PetscErrorCode DMPlexMarkBoundaryFaces_Internal(DM dm, PetscInt cellHeight, DMLabel label) 830560a7bSMatthew G. Knepley { 930560a7bSMatthew G. Knepley PetscInt fStart, fEnd, f; 1030560a7bSMatthew G. Knepley PetscErrorCode ierr; 1130560a7bSMatthew G. Knepley 1230560a7bSMatthew G. Knepley PetscFunctionBegin; 1330560a7bSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1430560a7bSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight+1, &fStart, &fEnd);CHKERRQ(ierr); 1530560a7bSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 1630560a7bSMatthew G. Knepley PetscInt supportSize; 1730560a7bSMatthew G. Knepley 1830560a7bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 1930560a7bSMatthew G. Knepley if (supportSize == 1) {ierr = DMLabelSetValue(label, f, 1);CHKERRQ(ierr);} 2030560a7bSMatthew G. Knepley } 2130560a7bSMatthew G. Knepley PetscFunctionReturn(0); 2230560a7bSMatthew G. Knepley } 2330560a7bSMatthew G. Knepley 2430560a7bSMatthew G. Knepley #undef __FUNCT__ 25cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces" 26cd0c2139SMatthew G Knepley /*@ 27cd0c2139SMatthew G Knepley DMPlexMarkBoundaryFaces - Mark all faces on the boundary 28cd0c2139SMatthew G Knepley 29cd0c2139SMatthew G Knepley Not Collective 30cd0c2139SMatthew G Knepley 31cd0c2139SMatthew G Knepley Input Parameter: 32cd0c2139SMatthew G Knepley . dm - The original DM 33cd0c2139SMatthew G Knepley 34cd0c2139SMatthew G Knepley Output Parameter: 35cd0c2139SMatthew G Knepley . label - The DMLabel marking boundary faces with value 1 36cd0c2139SMatthew G Knepley 37cd0c2139SMatthew G Knepley Level: developer 38cd0c2139SMatthew G Knepley 39c58f1c22SToby Isaac .seealso: DMLabelCreate(), DMCreateLabel() 4009f723d9SJed Brown @*/ 41cd0c2139SMatthew G Knepley PetscErrorCode DMPlexMarkBoundaryFaces(DM dm, DMLabel label) 42cd0c2139SMatthew G Knepley { 43cd0c2139SMatthew G Knepley PetscErrorCode ierr; 44cd0c2139SMatthew G Knepley 45cd0c2139SMatthew G Knepley PetscFunctionBegin; 4674e03af4SMatthew G. Knepley ierr = DMPlexMarkBoundaryFaces_Internal(dm, 0, label);CHKERRQ(ierr); 47cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 48cd0c2139SMatthew G Knepley } 49cd0c2139SMatthew G Knepley 50cd0c2139SMatthew G Knepley #undef __FUNCT__ 51*b0bf5782SToby Isaac #define __FUNCT__ "DMPlexLabelComplete_Internal" 52*b0bf5782SToby Isaac PetscErrorCode DMPlexLabelComplete_Internal(DM dm, DMLabel label, PetscBool completeCells) 53*b0bf5782SToby Isaac { 54*b0bf5782SToby Isaac IS valueIS; 55*b0bf5782SToby Isaac const PetscInt *values; 56*b0bf5782SToby Isaac PetscInt numValues, v, cStart, cEnd; 57*b0bf5782SToby Isaac PetscErrorCode ierr; 58*b0bf5782SToby Isaac 59*b0bf5782SToby Isaac PetscFunctionBegin; 60*b0bf5782SToby Isaac ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 61*b0bf5782SToby Isaac ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 62*b0bf5782SToby Isaac ierr = DMPlexGetHeightStratum(dm,0,&cStart,&cEnd);CHKERRQ(ierr); 63*b0bf5782SToby Isaac ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 64*b0bf5782SToby Isaac for (v = 0; v < numValues; ++v) { 65*b0bf5782SToby Isaac IS pointIS; 66*b0bf5782SToby Isaac const PetscInt *points; 67*b0bf5782SToby Isaac PetscInt numPoints, p; 68*b0bf5782SToby Isaac 69*b0bf5782SToby Isaac ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 70*b0bf5782SToby Isaac ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 71*b0bf5782SToby Isaac ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 72*b0bf5782SToby Isaac for (p = 0; p < numPoints; ++p) { 73*b0bf5782SToby Isaac PetscInt q = points[p]; 74*b0bf5782SToby Isaac PetscInt *closure = NULL; 75*b0bf5782SToby Isaac PetscInt closureSize, c; 76*b0bf5782SToby Isaac 77*b0bf5782SToby Isaac if (cStart <= q && q < cEnd && !completeCells) { /* skip cells */ 78*b0bf5782SToby Isaac continue; 79*b0bf5782SToby Isaac } 80*b0bf5782SToby Isaac ierr = DMPlexGetTransitiveClosure(dm, q, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 81*b0bf5782SToby Isaac for (c = 0; c < closureSize*2; c += 2) { 82*b0bf5782SToby Isaac ierr = DMLabelSetValue(label, closure[c], values[v]);CHKERRQ(ierr); 83*b0bf5782SToby Isaac } 84*b0bf5782SToby Isaac ierr = DMPlexRestoreTransitiveClosure(dm, q, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 85*b0bf5782SToby Isaac } 86*b0bf5782SToby Isaac ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 87*b0bf5782SToby Isaac ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 88*b0bf5782SToby Isaac } 89*b0bf5782SToby Isaac ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 90*b0bf5782SToby Isaac ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 91*b0bf5782SToby Isaac PetscFunctionReturn(0); 92*b0bf5782SToby Isaac } 93*b0bf5782SToby Isaac 94*b0bf5782SToby Isaac #undef __FUNCT__ 952be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelComplete" 962be2b188SMatthew G Knepley /*@ 972be2b188SMatthew G Knepley DMPlexLabelComplete - Starting with a label marking points on a surface, we add the transitive closure to the surface 982be2b188SMatthew G Knepley 992be2b188SMatthew G Knepley Input Parameters: 1002be2b188SMatthew G Knepley + dm - The DM 1012be2b188SMatthew G Knepley - label - A DMLabel marking the surface points 1022be2b188SMatthew G Knepley 1032be2b188SMatthew G Knepley Output Parameter: 1042be2b188SMatthew G Knepley . label - A DMLabel marking all surface points in the transitive closure 1052be2b188SMatthew G Knepley 1062be2b188SMatthew G Knepley Level: developer 1072be2b188SMatthew G Knepley 1082be2b188SMatthew G Knepley .seealso: DMPlexLabelCohesiveComplete() 1092be2b188SMatthew G Knepley @*/ 1102be2b188SMatthew G Knepley PetscErrorCode DMPlexLabelComplete(DM dm, DMLabel label) 1112be2b188SMatthew G Knepley { 1122be2b188SMatthew G Knepley PetscErrorCode ierr; 1132be2b188SMatthew G Knepley 1142be2b188SMatthew G Knepley PetscFunctionBegin; 115*b0bf5782SToby Isaac ierr = DMPlexLabelComplete_Internal(dm, label, PETSC_TRUE);CHKERRQ(ierr); 1162be2b188SMatthew G Knepley PetscFunctionReturn(0); 1172be2b188SMatthew G Knepley } 1182be2b188SMatthew G Knepley 1192be2b188SMatthew G Knepley #undef __FUNCT__ 1206cf0e42fSMatthew G. Knepley #define __FUNCT__ "DMPlexLabelAddCells" 1216cf0e42fSMatthew G. Knepley /*@ 1226cf0e42fSMatthew G. Knepley DMPlexLabelAddCells - Starting with a label marking faces on a surface, we add a cell for each face 1236cf0e42fSMatthew G. Knepley 1246cf0e42fSMatthew G. Knepley Input Parameters: 1256cf0e42fSMatthew G. Knepley + dm - The DM 1266cf0e42fSMatthew G. Knepley - label - A DMLabel marking the surface points 1276cf0e42fSMatthew G. Knepley 1286cf0e42fSMatthew G. Knepley Output Parameter: 1296cf0e42fSMatthew G. Knepley . label - A DMLabel incorporating cells 1306cf0e42fSMatthew G. Knepley 1316cf0e42fSMatthew G. Knepley Level: developer 1326cf0e42fSMatthew G. Knepley 1336cf0e42fSMatthew G. Knepley Note: The cells allow FEM boundary conditions to be applied using the cell geometry 1346cf0e42fSMatthew G. Knepley 1356cf0e42fSMatthew G. Knepley .seealso: DMPlexLabelComplete(), DMPlexLabelCohesiveComplete() 1366cf0e42fSMatthew G. Knepley @*/ 1376cf0e42fSMatthew G. Knepley PetscErrorCode DMPlexLabelAddCells(DM dm, DMLabel label) 1386cf0e42fSMatthew G. Knepley { 1396cf0e42fSMatthew G. Knepley IS valueIS; 1406cf0e42fSMatthew G. Knepley const PetscInt *values; 14122eabd52SMatthew G. Knepley PetscInt numValues, v, cStart, cEnd, cEndInterior; 1426cf0e42fSMatthew G. Knepley PetscErrorCode ierr; 1436cf0e42fSMatthew G. Knepley 1446cf0e42fSMatthew G. Knepley PetscFunctionBegin; 1456cf0e42fSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 14622eabd52SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cEndInterior, NULL, NULL, NULL);CHKERRQ(ierr); 14722eabd52SMatthew G. Knepley cEnd = cEndInterior < 0 ? cEnd : cEndInterior; 1486cf0e42fSMatthew G. Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 1496cf0e42fSMatthew G. Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 1506cf0e42fSMatthew G. Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 1516cf0e42fSMatthew G. Knepley for (v = 0; v < numValues; ++v) { 1526cf0e42fSMatthew G. Knepley IS pointIS; 1536cf0e42fSMatthew G. Knepley const PetscInt *points; 1546cf0e42fSMatthew G. Knepley PetscInt numPoints, p; 1556cf0e42fSMatthew G. Knepley 1566cf0e42fSMatthew G. Knepley ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 1576cf0e42fSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 1586cf0e42fSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 1596cf0e42fSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1606cf0e42fSMatthew G. Knepley PetscInt *closure = NULL; 16122eabd52SMatthew G. Knepley PetscInt closureSize, point, cl; 1626cf0e42fSMatthew G. Knepley 1636cf0e42fSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 16422eabd52SMatthew G. Knepley for (cl = closureSize-1; cl > 0; --cl) { 16522eabd52SMatthew G. Knepley point = closure[cl*2]; 16622eabd52SMatthew G. Knepley if ((point >= cStart) && (point < cEnd)) {ierr = DMLabelSetValue(label, point, values[v]);CHKERRQ(ierr); break;} 16722eabd52SMatthew G. Knepley } 1686cf0e42fSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 1696cf0e42fSMatthew G. Knepley } 1706cf0e42fSMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 1716cf0e42fSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 1726cf0e42fSMatthew G. Knepley } 1736cf0e42fSMatthew G. Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1746cf0e42fSMatthew G. Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1756cf0e42fSMatthew G. Knepley PetscFunctionReturn(0); 1766cf0e42fSMatthew G. Knepley } 1776cf0e42fSMatthew G. Knepley 1786cf0e42fSMatthew G. Knepley #undef __FUNCT__ 1792582d50cSToby Isaac #define __FUNCT__ "DMPlexShiftPointSetUp_Internal" 18059eef20bSToby Isaac /* take (oldEnd, added) pairs, ordered by height and convert them to (oldstart, newstart) pairs, ordered by ascending 18159eef20bSToby Isaac * index (skipping first, which is (0,0)) */ 1822582d50cSToby Isaac PETSC_STATIC_INLINE PetscErrorCode DMPlexShiftPointSetUp_Internal(PetscInt depth, PetscInt depthShift[]) 183cd0c2139SMatthew G Knepley { 1842582d50cSToby Isaac PetscInt d, off = 0; 1852582d50cSToby Isaac 1862582d50cSToby Isaac PetscFunctionBegin; 18759eef20bSToby Isaac /* sort by (oldend): yes this is an O(n^2) sort, we expect depth <= 3 */ 1880974a383SToby Isaac for (d = 0; d < depth; d++) { 1892582d50cSToby Isaac PetscInt firstd = d; 1900974a383SToby Isaac PetscInt firstStart = depthShift[2*d]; 1912582d50cSToby Isaac PetscInt e; 1922582d50cSToby Isaac 1932582d50cSToby Isaac for (e = d+1; e <= depth; e++) { 1942582d50cSToby Isaac if (depthShift[2*e] < firstStart) { 1952582d50cSToby Isaac firstd = e; 1962582d50cSToby Isaac firstStart = depthShift[2*d]; 1972582d50cSToby Isaac } 1982582d50cSToby Isaac } 1992582d50cSToby Isaac if (firstd != d) { 2002582d50cSToby Isaac PetscInt swap[2]; 2012582d50cSToby Isaac 2022582d50cSToby Isaac e = firstd; 2032582d50cSToby Isaac swap[0] = depthShift[2*d]; 2042582d50cSToby Isaac swap[1] = depthShift[2*d+1]; 2052582d50cSToby Isaac depthShift[2*d] = depthShift[2*e]; 2062582d50cSToby Isaac depthShift[2*d+1] = depthShift[2*e+1]; 2072582d50cSToby Isaac depthShift[2*e] = swap[0]; 2082582d50cSToby Isaac depthShift[2*e+1] = swap[1]; 2092582d50cSToby Isaac } 2102582d50cSToby Isaac } 2112582d50cSToby Isaac /* convert (oldstart, added) to (oldstart, newstart) */ 2120974a383SToby Isaac for (d = 0; d <= depth; d++) { 2132582d50cSToby Isaac off += depthShift[2*d+1]; 21459eef20bSToby Isaac depthShift[2*d+1] = depthShift[2*d] + off; 2152582d50cSToby Isaac } 2162582d50cSToby Isaac PetscFunctionReturn(0); 2172582d50cSToby Isaac } 2182582d50cSToby Isaac 2192582d50cSToby Isaac #undef __FUNCT__ 2202582d50cSToby Isaac #define __FUNCT__ "DMPlexShiftPoint_Internal" 2212582d50cSToby Isaac /* depthShift is a list of (old, new) pairs */ 2222582d50cSToby Isaac PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthShift[]) 2232582d50cSToby Isaac { 2242582d50cSToby Isaac PetscInt d; 2252582d50cSToby Isaac PetscInt newOff = 0; 2262582d50cSToby Isaac 2272582d50cSToby Isaac for (d = 0; d <= depth; d++) { 2282582d50cSToby Isaac if (p < depthShift[2*d]) return p + newOff; 2292582d50cSToby Isaac else newOff = depthShift[2*d+1] - depthShift[2*d]; 2302582d50cSToby Isaac } 2310974a383SToby Isaac return p + newOff; 2322582d50cSToby Isaac } 2332582d50cSToby Isaac 2342582d50cSToby Isaac #undef __FUNCT__ 2352582d50cSToby Isaac #define __FUNCT__ "DMPlexShiftPointInverse_Internal" 2362582d50cSToby Isaac /* depthShift is a list of (old, new) pairs */ 2372582d50cSToby Isaac PETSC_STATIC_INLINE PetscInt DMPlexShiftPointInverse_Internal(PetscInt p, PetscInt depth, PetscInt depthShift[]) 2382582d50cSToby Isaac { 2392582d50cSToby Isaac PetscInt d; 2402582d50cSToby Isaac PetscInt newOff = 0; 2412582d50cSToby Isaac 2422582d50cSToby Isaac for (d = 0; d <= depth; d++) { 2432582d50cSToby Isaac if (p < depthShift[2*d+1]) return p + newOff; 2442582d50cSToby Isaac else newOff = depthShift[2*d] - depthShift[2*d+1]; 2452582d50cSToby Isaac } 2460974a383SToby Isaac return p + newOff; 247cd0c2139SMatthew G Knepley } 248cd0c2139SMatthew G Knepley 249cd0c2139SMatthew G Knepley #undef __FUNCT__ 250cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSizes_Internal" 251cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew) 252cd0c2139SMatthew G Knepley { 253cd0c2139SMatthew G Knepley PetscInt depth = 0, d, pStart, pEnd, p; 254cd0c2139SMatthew G Knepley PetscErrorCode ierr; 255cd0c2139SMatthew G Knepley 256cd0c2139SMatthew G Knepley PetscFunctionBegin; 257cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 258cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 259cd0c2139SMatthew G Knepley /* Step 1: Expand chart */ 260cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2610974a383SToby Isaac pEnd = DMPlexShiftPoint_Internal(pEnd,depth,depthShift); 262cd0c2139SMatthew G Knepley ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr); 263cd0c2139SMatthew G Knepley /* Step 2: Set cone and support sizes */ 264cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 265cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 266cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 2672582d50cSToby Isaac PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthShift); 268cd0c2139SMatthew G Knepley PetscInt size; 269cd0c2139SMatthew G Knepley 270cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 271cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr); 272cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 273cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr); 274cd0c2139SMatthew G Knepley } 275cd0c2139SMatthew G Knepley } 276cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 277cd0c2139SMatthew G Knepley } 278cd0c2139SMatthew G Knepley 279cd0c2139SMatthew G Knepley #undef __FUNCT__ 280cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoints_Internal" 281cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew) 282cd0c2139SMatthew G Knepley { 2832582d50cSToby Isaac PetscInt *newpoints; 2842582d50cSToby Isaac PetscInt depth = 0, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, pStart, pEnd, p; 285cd0c2139SMatthew G Knepley PetscErrorCode ierr; 286cd0c2139SMatthew G Knepley 287cd0c2139SMatthew G Knepley PetscFunctionBegin; 288cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 289cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 290cd0c2139SMatthew G Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 291dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dmNew, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 2922582d50cSToby Isaac ierr = PetscMalloc1(PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),&newpoints);CHKERRQ(ierr); 293cd0c2139SMatthew G Knepley /* Step 5: Set cones and supports */ 294cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 295cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 296cd0c2139SMatthew G Knepley const PetscInt *points = NULL, *orientations = NULL; 2972582d50cSToby Isaac PetscInt size,sizeNew, i, newp = DMPlexShiftPoint_Internal(p, depth, depthShift); 298cd0c2139SMatthew G Knepley 299cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 300cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr); 301cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr); 302cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 3032582d50cSToby Isaac newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthShift); 304cd0c2139SMatthew G Knepley } 305cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr); 306cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr); 307cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 308dcbb62e8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmNew, newp, &sizeNew);CHKERRQ(ierr); 309cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr); 310cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 3112582d50cSToby Isaac newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthShift); 312cd0c2139SMatthew G Knepley } 313dcbb62e8SMatthew G. Knepley for (i = size; i < sizeNew; ++i) newpoints[i] = 0; 314cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr); 315cd0c2139SMatthew G Knepley } 3162582d50cSToby Isaac ierr = PetscFree(newpoints);CHKERRQ(ierr); 317cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 318cd0c2139SMatthew G Knepley } 319cd0c2139SMatthew G Knepley 320cd0c2139SMatthew G Knepley #undef __FUNCT__ 321cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftCoordinates_Internal" 322cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew) 323cd0c2139SMatthew G Knepley { 324cd0c2139SMatthew G Knepley PetscSection coordSection, newCoordSection; 325cd0c2139SMatthew G Knepley Vec coordinates, newCoordinates; 326cd0c2139SMatthew G Knepley PetscScalar *coords, *newCoords; 3272582d50cSToby Isaac PetscInt coordSize; 3282582d50cSToby Isaac PetscInt dim, depth = 0, vStart, vEnd, vStartNew, vEndNew, v; 329cd0c2139SMatthew G Knepley PetscErrorCode ierr; 330cd0c2139SMatthew G Knepley 331cd0c2139SMatthew G Knepley PetscFunctionBegin; 332c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 333cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 334cd0c2139SMatthew G Knepley /* Step 8: Convert coordinates */ 335cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 336cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr); 33769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 338cd0c2139SMatthew G Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr); 339cd0c2139SMatthew G Knepley ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr); 340cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr); 341cd0c2139SMatthew G Knepley ierr = PetscSectionSetChart(newCoordSection, vStartNew, vEndNew);CHKERRQ(ierr); 342cd0c2139SMatthew G Knepley for (v = vStartNew; v < vEndNew; ++v) { 343cd0c2139SMatthew G Knepley ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr); 344cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr); 345cd0c2139SMatthew G Knepley } 346cd0c2139SMatthew G Knepley ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr); 34746e270d4SMatthew G. Knepley ierr = DMSetCoordinateSection(dmNew, PETSC_DETERMINE, newCoordSection);CHKERRQ(ierr); 348cd0c2139SMatthew G Knepley ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr); 349cd0c2139SMatthew G Knepley ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr); 350cd0c2139SMatthew G Knepley ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr); 351cd0c2139SMatthew G Knepley ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 3524e90ef8eSMatthew G. Knepley ierr = VecSetBlockSize(newCoordinates, dim);CHKERRQ(ierr); 3532eb5907fSJed Brown ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr); 354cd0c2139SMatthew G Knepley ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr); 355cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 356cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 357cd0c2139SMatthew G Knepley ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr); 358cd0c2139SMatthew G Knepley for (v = vStart; v < vEnd; ++v) { 359cd0c2139SMatthew G Knepley PetscInt dof, off, noff, d; 360cd0c2139SMatthew G Knepley 361cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 362cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3632582d50cSToby Isaac ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthShift), &noff);CHKERRQ(ierr); 364cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) { 365cd0c2139SMatthew G Knepley newCoords[noff+d] = coords[off+d]; 366cd0c2139SMatthew G Knepley } 367cd0c2139SMatthew G Knepley } 368cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 369cd0c2139SMatthew G Knepley ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr); 370cd0c2139SMatthew G Knepley ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 371cd0c2139SMatthew G Knepley ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr); 372cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 373cd0c2139SMatthew G Knepley } 374cd0c2139SMatthew G Knepley 375cd0c2139SMatthew G Knepley #undef __FUNCT__ 376cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal" 377cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew) 378cd0c2139SMatthew G Knepley { 3792582d50cSToby Isaac PetscInt depth = 0; 380cd0c2139SMatthew G Knepley PetscSF sfPoint, sfPointNew; 381cd0c2139SMatthew G Knepley const PetscSFNode *remotePoints; 382cd0c2139SMatthew G Knepley PetscSFNode *gremotePoints; 383cd0c2139SMatthew G Knepley const PetscInt *localPoints; 384cd0c2139SMatthew G Knepley PetscInt *glocalPoints, *newLocation, *newRemoteLocation; 385cd0c2139SMatthew G Knepley PetscInt numRoots, numLeaves, l, pStart, pEnd, totShift = 0; 386cd0c2139SMatthew G Knepley PetscErrorCode ierr; 387cd0c2139SMatthew G Knepley 388cd0c2139SMatthew G Knepley PetscFunctionBegin; 389cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 390cd0c2139SMatthew G Knepley /* Step 9: Convert pointSF */ 391cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 392cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr); 393cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 394cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 3956e21efdcSToby Isaac totShift = DMPlexShiftPoint_Internal(pEnd,depth,depthShift) - pEnd; 396cd0c2139SMatthew G Knepley if (numRoots >= 0) { 397dcca6d9dSJed Brown ierr = PetscMalloc2(numRoots,&newLocation,pEnd-pStart,&newRemoteLocation);CHKERRQ(ierr); 3982582d50cSToby Isaac for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthShift); 399cd0c2139SMatthew G Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 400cd0c2139SMatthew G Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 401785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &glocalPoints);CHKERRQ(ierr); 402785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &gremotePoints);CHKERRQ(ierr); 403cd0c2139SMatthew G Knepley for (l = 0; l < numLeaves; ++l) { 4042582d50cSToby Isaac glocalPoints[l] = DMPlexShiftPoint_Internal(localPoints[l], depth, depthShift); 405cd0c2139SMatthew G Knepley gremotePoints[l].rank = remotePoints[l].rank; 406cd0c2139SMatthew G Knepley gremotePoints[l].index = newRemoteLocation[localPoints[l]]; 407cd0c2139SMatthew G Knepley } 408cd0c2139SMatthew G Knepley ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr); 409cd0c2139SMatthew G Knepley ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 410cd0c2139SMatthew G Knepley } 411cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 412cd0c2139SMatthew G Knepley } 413cd0c2139SMatthew G Knepley 414cd0c2139SMatthew G Knepley #undef __FUNCT__ 415cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal" 416cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew) 417cd0c2139SMatthew G Knepley { 418cd0c2139SMatthew G Knepley PetscSF sfPoint; 419cd0c2139SMatthew G Knepley DMLabel vtkLabel, ghostLabel; 420cd0c2139SMatthew G Knepley const PetscSFNode *leafRemote; 421cd0c2139SMatthew G Knepley const PetscInt *leafLocal; 4222582d50cSToby Isaac PetscInt depth = 0, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f; 423cd0c2139SMatthew G Knepley PetscMPIInt rank; 424cd0c2139SMatthew G Knepley PetscErrorCode ierr; 425cd0c2139SMatthew G Knepley 426cd0c2139SMatthew G Knepley PetscFunctionBegin; 427cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 428cd0c2139SMatthew G Knepley /* Step 10: Convert labels */ 429c58f1c22SToby Isaac ierr = DMGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 430cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 431cd0c2139SMatthew G Knepley DMLabel label, newlabel; 432cd0c2139SMatthew G Knepley const char *lname; 433cd0c2139SMatthew G Knepley PetscBool isDepth; 434cd0c2139SMatthew G Knepley IS valueIS; 435cd0c2139SMatthew G Knepley const PetscInt *values; 436cd0c2139SMatthew G Knepley PetscInt numValues, val; 437cd0c2139SMatthew G Knepley 438c58f1c22SToby Isaac ierr = DMGetLabelName(dm, l, &lname);CHKERRQ(ierr); 439cd0c2139SMatthew G Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 440cd0c2139SMatthew G Knepley if (isDepth) continue; 441c58f1c22SToby Isaac ierr = DMCreateLabel(dmNew, lname);CHKERRQ(ierr); 442c58f1c22SToby Isaac ierr = DMGetLabel(dm, lname, &label);CHKERRQ(ierr); 443c58f1c22SToby Isaac ierr = DMGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr); 44464a6a1a4SToby Isaac ierr = DMLabelGetDefaultValue(label,&val);CHKERRQ(ierr); 44564a6a1a4SToby Isaac ierr = DMLabelSetDefaultValue(newlabel,val);CHKERRQ(ierr); 446cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 447cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 448cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 449cd0c2139SMatthew G Knepley for (val = 0; val < numValues; ++val) { 450cd0c2139SMatthew G Knepley IS pointIS; 451cd0c2139SMatthew G Knepley const PetscInt *points; 452cd0c2139SMatthew G Knepley PetscInt numPoints, p; 453cd0c2139SMatthew G Knepley 454cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 455cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 456cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 457cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 4582582d50cSToby Isaac const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthShift); 459cd0c2139SMatthew G Knepley 460cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr); 461cd0c2139SMatthew G Knepley } 462cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 463cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 464cd0c2139SMatthew G Knepley } 465cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 466cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 467cd0c2139SMatthew G Knepley } 468cd0c2139SMatthew G Knepley /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */ 469cd0c2139SMatthew G Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 470cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 471cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 472cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr); 473c58f1c22SToby Isaac ierr = DMCreateLabel(dmNew, "vtk");CHKERRQ(ierr); 474c58f1c22SToby Isaac ierr = DMCreateLabel(dmNew, "ghost");CHKERRQ(ierr); 475c58f1c22SToby Isaac ierr = DMGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr); 476c58f1c22SToby Isaac ierr = DMGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr); 477cd0c2139SMatthew G Knepley for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { 478cd0c2139SMatthew G Knepley for (; c < leafLocal[l] && c < cEnd; ++c) { 479cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 480cd0c2139SMatthew G Knepley } 481cd0c2139SMatthew G Knepley if (leafLocal[l] >= cEnd) break; 482cd0c2139SMatthew G Knepley if (leafRemote[l].rank == rank) { 483cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 484cd0c2139SMatthew G Knepley } else { 485cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr); 486cd0c2139SMatthew G Knepley } 487cd0c2139SMatthew G Knepley } 488cd0c2139SMatthew G Knepley for (; c < cEnd; ++c) { 489cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 490cd0c2139SMatthew G Knepley } 491cd0c2139SMatthew G Knepley if (0) { 492cd0c2139SMatthew G Knepley ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 493cd0c2139SMatthew G Knepley } 494cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr); 495cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 496cd0c2139SMatthew G Knepley PetscInt numCells; 497cd0c2139SMatthew G Knepley 498cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr); 499cd0c2139SMatthew G Knepley if (numCells < 2) { 500cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr); 501cd0c2139SMatthew G Knepley } else { 502cd0c2139SMatthew G Knepley const PetscInt *cells = NULL; 503cd0c2139SMatthew G Knepley PetscInt vA, vB; 504cd0c2139SMatthew G Knepley 505cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr); 506cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr); 507cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr); 508cd0c2139SMatthew G Knepley if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);} 509cd0c2139SMatthew G Knepley } 510cd0c2139SMatthew G Knepley } 511cd0c2139SMatthew G Knepley if (0) { 512cd0c2139SMatthew G Knepley ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 513cd0c2139SMatthew G Knepley } 514cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 515cd0c2139SMatthew G Knepley } 516cd0c2139SMatthew G Knepley 517cd0c2139SMatthew G Knepley #undef __FUNCT__ 518ca04dac2SToby Isaac #define __FUNCT__ "DMPlexShiftTree_Internal" 519ca04dac2SToby Isaac static PetscErrorCode DMPlexShiftTree_Internal(DM dm, PetscInt depthShift[], DM dmNew) 520ca04dac2SToby Isaac { 521ca04dac2SToby Isaac DM refTree; 522ca04dac2SToby Isaac PetscSection pSec; 523ca04dac2SToby Isaac PetscInt *parents, *childIDs; 524ca04dac2SToby Isaac PetscErrorCode ierr; 525ca04dac2SToby Isaac 526ca04dac2SToby Isaac PetscFunctionBegin; 527ca04dac2SToby Isaac ierr = DMPlexGetReferenceTree(dm,&refTree);CHKERRQ(ierr); 528ca04dac2SToby Isaac ierr = DMPlexSetReferenceTree(dmNew,refTree);CHKERRQ(ierr); 529ca04dac2SToby Isaac ierr = DMPlexGetTree(dm,&pSec,&parents,&childIDs,NULL,NULL);CHKERRQ(ierr); 530ca04dac2SToby Isaac if (pSec) { 5312582d50cSToby Isaac PetscInt p, pStart, pEnd, *parentsShifted, pStartShifted, pEndShifted, depth; 532fb4630b5SToby Isaac PetscInt *childIDsShifted; 533ca04dac2SToby Isaac PetscSection pSecShifted; 534ca04dac2SToby Isaac 535ca04dac2SToby Isaac ierr = PetscSectionGetChart(pSec,&pStart,&pEnd);CHKERRQ(ierr); 536ca04dac2SToby Isaac ierr = DMPlexGetDepth(dm,&depth);CHKERRQ(ierr); 5372582d50cSToby Isaac pStartShifted = DMPlexShiftPoint_Internal(pStart,depth,depthShift); 5382582d50cSToby Isaac pEndShifted = DMPlexShiftPoint_Internal(pEnd,depth,depthShift); 539fb4630b5SToby Isaac ierr = PetscMalloc2(pEndShifted - pStartShifted,&parentsShifted,pEndShifted-pStartShifted,&childIDsShifted);CHKERRQ(ierr); 540ca04dac2SToby Isaac ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dmNew),&pSecShifted);CHKERRQ(ierr); 541ca04dac2SToby Isaac ierr = PetscSectionSetChart(pSecShifted,pStartShifted,pEndShifted);CHKERRQ(ierr); 542ca04dac2SToby Isaac for (p = pStartShifted; p < pEndShifted; p++) { 543fb4630b5SToby Isaac /* start off assuming no children */ 544fb4630b5SToby Isaac ierr = PetscSectionSetDof(pSecShifted,p,0);CHKERRQ(ierr); 545fb4630b5SToby Isaac } 546fb4630b5SToby Isaac for (p = pStart; p < pEnd; p++) { 547fb4630b5SToby Isaac PetscInt dof; 548fb4630b5SToby Isaac PetscInt pNew = DMPlexShiftPoint_Internal(p,depth,depthShift); 549ca04dac2SToby Isaac 550ca04dac2SToby Isaac ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr); 551fb4630b5SToby Isaac ierr = PetscSectionSetDof(pSecShifted,pNew,dof);CHKERRQ(ierr); 552ca04dac2SToby Isaac } 553ca04dac2SToby Isaac ierr = PetscSectionSetUp(pSecShifted);CHKERRQ(ierr); 554fb4630b5SToby Isaac for (p = pStart; p < pEnd; p++) { 555fb4630b5SToby Isaac PetscInt dof; 556fb4630b5SToby Isaac PetscInt pNew = DMPlexShiftPoint_Internal(p,depth,depthShift); 557fb4630b5SToby Isaac 558fb4630b5SToby Isaac ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr); 559fb4630b5SToby Isaac if (dof) { 560fb4630b5SToby Isaac PetscInt off, offNew; 561fb4630b5SToby Isaac 562fb4630b5SToby Isaac ierr = PetscSectionGetOffset(pSec,p,&off);CHKERRQ(ierr); 563fb4630b5SToby Isaac ierr = PetscSectionGetOffset(pSecShifted,pNew,&offNew);CHKERRQ(ierr); 564fb4630b5SToby Isaac parentsShifted[offNew] = DMPlexShiftPoint_Internal(parents[off],depth,depthShift); 565fb4630b5SToby Isaac childIDsShifted[offNew] = childIDs[off]; 566fb4630b5SToby Isaac } 567fb4630b5SToby Isaac } 568fb4630b5SToby Isaac ierr = DMPlexSetTree(dmNew,pSecShifted,parentsShifted,childIDsShifted);CHKERRQ(ierr); 569fb4630b5SToby Isaac ierr = PetscFree2(parentsShifted,childIDsShifted);CHKERRQ(ierr); 570e6885bbbSToby Isaac ierr = PetscSectionDestroy(&pSecShifted);CHKERRQ(ierr); 571ca04dac2SToby Isaac } 572ca04dac2SToby Isaac PetscFunctionReturn(0); 573ca04dac2SToby Isaac } 574ca04dac2SToby Isaac 575ca04dac2SToby Isaac #undef __FUNCT__ 576cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal" 577cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm) 578cd0c2139SMatthew G Knepley { 579da97024aSMatthew G. Knepley PetscSF sf; 580cd0c2139SMatthew G Knepley IS valueIS; 581da97024aSMatthew G. Knepley const PetscInt *values, *leaves; 582cd0c2139SMatthew G Knepley PetscInt *depthShift; 5832582d50cSToby Isaac PetscInt d, depth = 0, nleaves, loc, Ng, numFS, fs, fStart, fEnd, ghostCell, cEnd, c; 584cd0c2139SMatthew G Knepley PetscErrorCode ierr; 585cd0c2139SMatthew G Knepley 586cd0c2139SMatthew G Knepley PetscFunctionBegin; 587da97024aSMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 588da97024aSMatthew G. Knepley ierr = PetscSFGetGraph(sf, NULL, &nleaves, &leaves, NULL);CHKERRQ(ierr); 589da97024aSMatthew G. Knepley nleaves = PetscMax(0, nleaves); 59046c796b9SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 591cd0c2139SMatthew G Knepley /* Count ghost cells */ 592cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 593cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr); 594cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 5954a6cfa73SMatthew G. Knepley Ng = 0; 596cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 59746c796b9SMatthew G. Knepley IS faceIS; 59846c796b9SMatthew G. Knepley const PetscInt *faces; 59946c796b9SMatthew G. Knepley PetscInt numFaces, f, numBdFaces = 0; 600cd0c2139SMatthew G Knepley 60146c796b9SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 60246c796b9SMatthew G. Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 60346c796b9SMatthew G. Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 60446c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 605ca04dac2SToby Isaac PetscInt numChildren; 606ca04dac2SToby Isaac 607da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 608ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 609ca04dac2SToby Isaac /* non-local and ancestors points don't get to register ghosts */ 610ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 61146c796b9SMatthew G. Knepley if ((faces[f] >= fStart) && (faces[f] < fEnd)) ++numBdFaces; 61246c796b9SMatthew G. Knepley } 6134a6cfa73SMatthew G. Knepley Ng += numBdFaces; 61446c796b9SMatthew G. Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 615cd0c2139SMatthew G Knepley } 616cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 6172582d50cSToby Isaac ierr = PetscMalloc1(2*(depth+1), &depthShift);CHKERRQ(ierr); 6182582d50cSToby Isaac for (d = 0; d <= depth; d++) { 61959eef20bSToby Isaac PetscInt dEnd; 6202582d50cSToby Isaac 6210974a383SToby Isaac ierr = DMPlexGetDepthStratum(dm,d,NULL,&dEnd);CHKERRQ(ierr); 62259eef20bSToby Isaac depthShift[2*d] = dEnd; 6232582d50cSToby Isaac depthShift[2*d+1] = 0; 6242582d50cSToby Isaac } 6252582d50cSToby Isaac if (depth >= 0) depthShift[2*depth+1] = Ng; 6262582d50cSToby Isaac ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift);CHKERRQ(ierr); 627cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 628cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 629cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 6305acea1aeSMatthew G. Knepley ierr = DMPlexSetHybridBounds(gdm, cEnd, PETSC_DETERMINE, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 6314a6cfa73SMatthew G. Knepley for (c = cEnd; c < cEnd + Ng; ++c) { 632cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr); 633cd0c2139SMatthew G Knepley } 634cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 635cd0c2139SMatthew G Knepley IS faceIS; 636cd0c2139SMatthew G Knepley const PetscInt *faces; 637cd0c2139SMatthew G Knepley PetscInt numFaces, f; 638cd0c2139SMatthew G Knepley 639cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 640cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 641cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 642cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 643ca04dac2SToby Isaac PetscInt size, numChildren; 644cd0c2139SMatthew G Knepley 645da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 646ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 647ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 64846c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 649cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr); 650cd0c2139SMatthew 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); 6514a6cfa73SMatthew G. Knepley ierr = DMPlexSetSupportSize(gdm, faces[f] + Ng, 2);CHKERRQ(ierr); 652cd0c2139SMatthew G Knepley } 653cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 654cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 655cd0c2139SMatthew G Knepley } 656cd0c2139SMatthew G Knepley /* Step 4: Setup ghosted DM */ 657cd0c2139SMatthew G Knepley ierr = DMSetUp(gdm);CHKERRQ(ierr); 658cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 659cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 660cd0c2139SMatthew G Knepley ghostCell = cEnd; 661cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 662cd0c2139SMatthew G Knepley IS faceIS; 663cd0c2139SMatthew G Knepley const PetscInt *faces; 664cd0c2139SMatthew G Knepley PetscInt numFaces, f; 665cd0c2139SMatthew G Knepley 666cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 667cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 668cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 66946c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 670ca04dac2SToby Isaac PetscInt newFace = faces[f] + Ng, numChildren; 671cd0c2139SMatthew G Knepley 672da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 673ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 674ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 67546c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 676cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr); 677cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr); 67846c796b9SMatthew G. Knepley ++ghostCell; 679cd0c2139SMatthew G Knepley } 680cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 681cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 682cd0c2139SMatthew G Knepley } 683cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 684cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 685cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 686cd0c2139SMatthew G Knepley ierr = DMPlexStratify(gdm);CHKERRQ(ierr); 687cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 688cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 689cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 690ca04dac2SToby Isaac ierr = DMPlexShiftTree_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 691cd0c2139SMatthew G Knepley ierr = PetscFree(depthShift);CHKERRQ(ierr); 692966c7b3fSMatthew G. Knepley /* Step 7: Periodicity */ 693966c7b3fSMatthew G. Knepley if (dm->maxCell) { 694966c7b3fSMatthew G. Knepley const PetscReal *maxCell, *L; 6955dc8c3f7SMatthew G. Knepley const DMBoundaryType *bd; 6965dc8c3f7SMatthew G. Knepley ierr = DMGetPeriodicity(dm, &maxCell, &L, &bd);CHKERRQ(ierr); 6975dc8c3f7SMatthew G. Knepley ierr = DMSetPeriodicity(gdm, maxCell, L, bd);CHKERRQ(ierr); 698966c7b3fSMatthew G. Knepley } 6994a6cfa73SMatthew G. Knepley if (numGhostCells) *numGhostCells = Ng; 700cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 701cd0c2139SMatthew G Knepley } 702cd0c2139SMatthew G Knepley 703cd0c2139SMatthew G Knepley #undef __FUNCT__ 704cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells" 705cd0c2139SMatthew G Knepley /*@C 706cd0c2139SMatthew G Knepley DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face 707cd0c2139SMatthew G Knepley 708cd0c2139SMatthew G Knepley Collective on dm 709cd0c2139SMatthew G Knepley 710cd0c2139SMatthew G Knepley Input Parameters: 711cd0c2139SMatthew G Knepley + dm - The original DM 712cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL 713cd0c2139SMatthew G Knepley 714cd0c2139SMatthew G Knepley Output Parameters: 715cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM 716cd0c2139SMatthew G Knepley - dmGhosted - The new DM 717cd0c2139SMatthew G Knepley 718cd0c2139SMatthew G Knepley Note: If no label exists of that name, one will be created marking all boundary faces 719cd0c2139SMatthew G Knepley 720cd0c2139SMatthew G Knepley Level: developer 721cd0c2139SMatthew G Knepley 722cd0c2139SMatthew G Knepley .seealso: DMCreate() 72331266bc0SMatthew G. Knepley @*/ 724cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted) 725cd0c2139SMatthew G Knepley { 726cd0c2139SMatthew G Knepley DM gdm; 727cd0c2139SMatthew G Knepley DMLabel label; 728cd0c2139SMatthew G Knepley const char *name = labelName ? labelName : "Face Sets"; 729cd0c2139SMatthew G Knepley PetscInt dim; 730a42b08eeSMatthew G. Knepley PetscBool flag; 731cd0c2139SMatthew G Knepley PetscErrorCode ierr; 732cd0c2139SMatthew G Knepley 733cd0c2139SMatthew G Knepley PetscFunctionBegin; 734cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 7354a6cfa73SMatthew G. Knepley if (numGhostCells) PetscValidPointer(numGhostCells, 3); 736cd0c2139SMatthew G Knepley PetscValidPointer(dmGhosted, 4); 737cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr); 738cd0c2139SMatthew G Knepley ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr); 739c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 740c73cfb54SMatthew G. Knepley ierr = DMSetDimension(gdm, dim);CHKERRQ(ierr); 741a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseCone(dm, &flag);CHKERRQ(ierr); 742a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseCone(gdm, flag);CHKERRQ(ierr); 743a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseClosure(dm, &flag);CHKERRQ(ierr); 744a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseClosure(gdm, flag);CHKERRQ(ierr); 745c58f1c22SToby Isaac ierr = DMGetLabel(dm, name, &label);CHKERRQ(ierr); 746cd0c2139SMatthew G Knepley if (!label) { 747cd0c2139SMatthew G Knepley /* Get label for boundary faces */ 748c58f1c22SToby Isaac ierr = DMCreateLabel(dm, name);CHKERRQ(ierr); 749c58f1c22SToby Isaac ierr = DMGetLabel(dm, name, &label);CHKERRQ(ierr); 750cd0c2139SMatthew G Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 751cd0c2139SMatthew G Knepley } 752cd0c2139SMatthew G Knepley ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr); 753a6ba4734SToby Isaac ierr = DMCopyBoundary(dm, gdm);CHKERRQ(ierr); 754cd0c2139SMatthew G Knepley *dmGhosted = gdm; 755cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 756cd0c2139SMatthew G Knepley } 757cd0c2139SMatthew G Knepley 758cd0c2139SMatthew G Knepley #undef __FUNCT__ 759cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal" 760607ab7a9SMatthew G. Knepley /* 761faedd622SMatthew G. Knepley We are adding three kinds of points here: 762607ab7a9SMatthew G. Knepley Replicated: Copies of points which exist in the mesh, such as vertices identified across a fault 763faedd622SMatthew G. Knepley Non-replicated: Points which exist on the fault, but are not replicated 764607ab7a9SMatthew G. Knepley Hybrid: Entirely new points, such as cohesive cells 765a6ae58d1SMatthew G. Knepley 766a6ae58d1SMatthew G. Knepley When creating subsequent cohesive cells, we shift the old hybrid cells to the end of the numbering at 767a6ae58d1SMatthew G. Knepley each depth so that the new split/hybrid points can be inserted as a block. 768607ab7a9SMatthew G. Knepley */ 769cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm) 770cd0c2139SMatthew G Knepley { 771cd0c2139SMatthew G Knepley MPI_Comm comm; 772607ab7a9SMatthew G. Knepley IS valueIS; 773607ab7a9SMatthew G. Knepley PetscInt numSP = 0; /* The number of depths for which we have replicated points */ 774607ab7a9SMatthew G. Knepley const PetscInt *values; /* List of depths for which we have replicated points */ 77518c5995bSMatthew G. Knepley IS *splitIS; 77618c5995bSMatthew G. Knepley IS *unsplitIS; 777607ab7a9SMatthew G. Knepley PetscInt *numSplitPoints; /* The number of replicated points at each depth */ 77818c5995bSMatthew G. Knepley PetscInt *numUnsplitPoints; /* The number of non-replicated points at each depth which still give rise to hybrid points */ 77936dbac82SMatthew G. Knepley PetscInt *numHybridPoints; /* The number of new hybrid points at each depth */ 78036dbac82SMatthew G. Knepley PetscInt *numHybridPointsOld; /* The number of existing hybrid points at each depth */ 781607ab7a9SMatthew G. Knepley const PetscInt **splitPoints; /* Replicated points for each depth */ 78218c5995bSMatthew G. Knepley const PetscInt **unsplitPoints; /* Non-replicated points for each depth */ 783cd0c2139SMatthew G Knepley PetscSection coordSection; 784cd0c2139SMatthew G Knepley Vec coordinates; 785cd0c2139SMatthew G Knepley PetscScalar *coords; 786a6ae58d1SMatthew G. Knepley PetscInt *depthMax; /* The first hybrid point at each depth in the original mesh */ 787a6ae58d1SMatthew G. Knepley PetscInt *depthEnd; /* The point limit at each depth in the original mesh */ 788607ab7a9SMatthew G. Knepley PetscInt *depthShift; /* Number of replicated+hybrid points at each depth */ 789607ab7a9SMatthew G. Knepley PetscInt *pMaxNew; /* The first replicated point at each depth in the new mesh, hybrids come after this */ 790607ab7a9SMatthew G. Knepley PetscInt *coneNew, *coneONew, *supportNew; 79118c5995bSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v; 792cd0c2139SMatthew G Knepley PetscErrorCode ierr; 793cd0c2139SMatthew G Knepley 794cd0c2139SMatthew G Knepley PetscFunctionBegin; 795cd0c2139SMatthew G Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 796c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 797607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 798fd4b9f15SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 799cd0c2139SMatthew G Knepley /* Count split points and add cohesive cells */ 800607ab7a9SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 8012582d50cSToby Isaac ierr = PetscMalloc5(depth+1,&depthMax,depth+1,&depthEnd,2*(depth+1),&depthShift,depth+1,&pMaxNew,depth+1,&numHybridPointsOld);CHKERRQ(ierr); 802dcca6d9dSJed 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); 803a6ae58d1SMatthew 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); 804607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 805607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 806a6ae58d1SMatthew G. Knepley depthEnd[d] = pMaxNew[d]; 807a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 808607ab7a9SMatthew G. Knepley numSplitPoints[d] = 0; 80918c5995bSMatthew G. Knepley numUnsplitPoints[d] = 0; 810607ab7a9SMatthew G. Knepley numHybridPoints[d] = 0; 811a6ae58d1SMatthew G. Knepley numHybridPointsOld[d] = depthMax[d] < 0 ? 0 : depthEnd[d] - depthMax[d]; 812607ab7a9SMatthew G. Knepley splitPoints[d] = NULL; 81318c5995bSMatthew G. Knepley unsplitPoints[d] = NULL; 81418c5995bSMatthew G. Knepley splitIS[d] = NULL; 81518c5995bSMatthew G. Knepley unsplitIS[d] = NULL; 81659eef20bSToby Isaac /* we are shifting the existing hybrid points with the stratum behind them, so 81759eef20bSToby Isaac * the split comes at the end of the normal points, i.e., at depthMax[d] */ 81859eef20bSToby Isaac depthShift[2*d] = depthMax[d]; 81959eef20bSToby Isaac depthShift[2*d+1] = 0; 820607ab7a9SMatthew G. Knepley } 821cd0c2139SMatthew G Knepley if (label) { 822cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 823cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 824cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 825cd0c2139SMatthew G Knepley } 826cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 827cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 828cd0c2139SMatthew G Knepley 829cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 83018c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr); 83118c5995bSMatthew G. Knepley if (splitIS[dep]) { 83218c5995bSMatthew G. Knepley ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 83318c5995bSMatthew G. Knepley ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 83418c5995bSMatthew G. Knepley } 83518c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr); 83618c5995bSMatthew G. Knepley if (unsplitIS[dep]) { 83718c5995bSMatthew G. Knepley ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr); 83818c5995bSMatthew G. Knepley ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr); 839cd0c2139SMatthew G Knepley } 840cd0c2139SMatthew G Knepley } 841607ab7a9SMatthew G. Knepley /* Calculate number of hybrid points */ 84218c5995bSMatthew 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 */ 8432582d50cSToby Isaac for (d = 0; d <= depth; ++d) depthShift[2*d+1] = numSplitPoints[d] + numHybridPoints[d]; 8442582d50cSToby Isaac ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift); 84559eef20bSToby Isaac /* the end of the points in this stratum that come before the new points: 84659eef20bSToby Isaac * shifting pMaxNew[d] gets the new start of the next stratum, then count back the old hybrid points and the newly 84759eef20bSToby Isaac * added points */ 8482582d50cSToby Isaac for (d = 0; d <= depth; ++d) pMaxNew[d] = DMPlexShiftPoint_Internal(pMaxNew[d],depth,depthShift) - (numHybridPointsOld[d] + numSplitPoints[d] + numHybridPoints[d]); 849cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 850cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 851cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 852cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 853cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 8542582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 8554c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 856cd0c2139SMatthew G Knepley const PetscInt *support; 8574c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, qf, qn, qp, e; 858cd0c2139SMatthew G Knepley 859cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 860cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 861cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 862cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 863cd0c2139SMatthew G Knepley if (dep == depth-1) { 8644c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 8654c367dbcSMatthew G. Knepley 866cd0c2139SMatthew G Knepley /* Add cohesive cells, they are prisms */ 8674c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr); 868cd0c2139SMatthew G Knepley } else if (dep == 0) { 8694c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 870cd0c2139SMatthew G Knepley 871cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 8724c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 873cd0c2139SMatthew G Knepley PetscInt val; 874cd0c2139SMatthew G Knepley 875cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 8764c367dbcSMatthew G. Knepley if (val == 1) ++qf; 8774c367dbcSMatthew G. Knepley if ((val == 1) || (val == (shift + 1))) ++qn; 8784c367dbcSMatthew G. Knepley if ((val == 1) || (val == -(shift + 1))) ++qp; 879cd0c2139SMatthew G Knepley } 8804c367dbcSMatthew G. Knepley /* Split old vertex: Edges into original vertex and new cohesive edge */ 8814c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 8824c367dbcSMatthew G. Knepley /* Split new vertex: Edges into split vertex and new cohesive edge */ 8834c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 8844c367dbcSMatthew G. Knepley /* Add hybrid edge */ 8854c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 8864c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 887cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 8884c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 8894c367dbcSMatthew G. Knepley 890cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 8914c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 892cd0c2139SMatthew G Knepley PetscInt val; 893cd0c2139SMatthew G Knepley 894cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 8954c367dbcSMatthew G. Knepley if (val == dim-1) ++qf; 8964c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 8974c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 898cd0c2139SMatthew G Knepley } 8994c367dbcSMatthew G. Knepley /* Split old edge: Faces into original edge and cohesive face (positive side?) */ 9004c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 9014c367dbcSMatthew G. Knepley /* Split new edge: Faces into split edge and cohesive face (negative side?) */ 9024c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 9034c367dbcSMatthew G. Knepley /* Add hybrid face */ 9044c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 9054c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 906cd0c2139SMatthew G Knepley } 907cd0c2139SMatthew G Knepley } 908cd0c2139SMatthew G Knepley } 90918c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 91018c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 91118c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 9122582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 91318c5995bSMatthew G. Knepley const PetscInt *support; 914da1dd7e4SMatthew G. Knepley PetscInt coneSize, supportSize, qf, e, s; 91518c5995bSMatthew G. Knepley 91618c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 91718c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 91839254ff6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 91918c5995bSMatthew G. Knepley if (dep == 0) { 92018c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 92118c5995bSMatthew G. Knepley 92239254ff6SMatthew G. Knepley /* Unsplit vertex: Edges into original vertex, split edges, and new cohesive edge twice */ 92339254ff6SMatthew G. Knepley for (s = 0, qf = 0; s < supportSize; ++s, ++qf) { 92439254ff6SMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 92539254ff6SMatthew G. Knepley if (e >= 0) ++qf; 92639254ff6SMatthew G. Knepley } 92739254ff6SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 92818c5995bSMatthew G. Knepley /* Add hybrid edge */ 92918c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 930e1757548SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 931e1757548SMatthew G. Knepley PetscInt val; 932e1757548SMatthew G. Knepley 933e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 934e1757548SMatthew G. Knepley /* Split and unsplit edges produce hybrid faces */ 935da1dd7e4SMatthew G. Knepley if (val == 1) ++qf; 936da1dd7e4SMatthew G. Knepley if (val == (shift2 + 1)) ++qf; 937e1757548SMatthew G. Knepley } 938e1757548SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 93918c5995bSMatthew G. Knepley } else if (dep == dim-2) { 94018c5995bSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 941cd0c2139SMatthew G Knepley PetscInt val; 942cd0c2139SMatthew G Knepley 943da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 944cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 945da1dd7e4SMatthew G. Knepley if (val == dim-1) qf += 2; 946da1dd7e4SMatthew G. Knepley else ++qf; 947cd0c2139SMatthew G Knepley } 94818c5995bSMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */ 949da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 95018c5995bSMatthew G. Knepley /* Add hybrid face */ 951da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 952da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 953da1dd7e4SMatthew G. Knepley if (val == dim-1) ++qf; 954da1dd7e4SMatthew G. Knepley } 95518c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 956da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 957cd0c2139SMatthew G Knepley } 958cd0c2139SMatthew G Knepley } 959cd0c2139SMatthew G Knepley } 960cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 961cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 962cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 963dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 964dcca6d9dSJed Brown ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),&supportNew);CHKERRQ(ierr); 965cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 966cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 967cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 968cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 9692582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 9704c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 971cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 9724c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, q, qf, qn, qp, v, e, s; 973cd0c2139SMatthew G Knepley 974cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 975cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 976cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 977cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 978cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 979cd0c2139SMatthew G Knepley if (dep == depth-1) { 98096a07cd0SMatthew G. Knepley PetscBool hasUnsplit = PETSC_FALSE; 9814c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 982cd0c2139SMatthew G Knepley const PetscInt *supportF; 983cd0c2139SMatthew G Knepley 984cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 985cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 986cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 987cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 988cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 989cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 9904c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 99118c5995bSMatthew G. Knepley if (v < 0) { 99218c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 99318c5995bSMatthew 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); 9942582d50cSToby Isaac coneNew[2+q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/; 99596a07cd0SMatthew G. Knepley hasUnsplit = PETSC_TRUE; 99618c5995bSMatthew G. Knepley } else { 9974c367dbcSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep-1]; 998163235baSMatthew G. Knepley if (dep > 1) { 999163235baSMatthew G. Knepley const PetscInt *econe; 1000163235baSMatthew G. Knepley PetscInt econeSize, r, vs, vu; 1001163235baSMatthew G. Knepley 1002163235baSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[q], &econeSize);CHKERRQ(ierr); 1003163235baSMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[q], &econe);CHKERRQ(ierr); 1004163235baSMatthew G. Knepley for (r = 0; r < econeSize; ++r) { 1005163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numSplitPoints[dep-2], splitPoints[dep-2], &vs);CHKERRQ(ierr); 1006163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numUnsplitPoints[dep-2], unsplitPoints[dep-2], &vu);CHKERRQ(ierr); 1007163235baSMatthew G. Knepley if (vs >= 0) continue; 1008163235baSMatthew 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); 1009163235baSMatthew G. Knepley hasUnsplit = PETSC_TRUE; 1010163235baSMatthew G. Knepley } 1011163235baSMatthew G. Knepley } 1012cd0c2139SMatthew G Knepley } 1013cd0c2139SMatthew G Knepley } 1014cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 1015cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 1016e537020bSMatthew G. Knepley /* Face support */ 1017cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1018cd0c2139SMatthew G Knepley PetscInt val; 1019cd0c2139SMatthew G Knepley 1020cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 1021cd0c2139SMatthew G Knepley if (val < 0) { 1022cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 10234c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr); 1024cd0c2139SMatthew G Knepley } else { 1025cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 10264c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr); 1027e537020bSMatthew G. Knepley /* Get orientation for cohesive face */ 1028e537020bSMatthew G. Knepley { 1029e537020bSMatthew G. Knepley const PetscInt *ncone, *nconeO; 1030e537020bSMatthew G. Knepley PetscInt nconeSize, nc; 1031e537020bSMatthew G. Knepley 1032e537020bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 1033e537020bSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 1034e537020bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 1035e537020bSMatthew G. Knepley for (nc = 0; nc < nconeSize; ++nc) { 1036e537020bSMatthew G. Knepley if (ncone[nc] == oldp) { 1037e537020bSMatthew G. Knepley coneONew[0] = nconeO[nc]; 1038e537020bSMatthew G. Knepley break; 1039cd0c2139SMatthew G Knepley } 1040cd0c2139SMatthew G Knepley } 1041e537020bSMatthew 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]); 1042e537020bSMatthew G. Knepley } 1043e537020bSMatthew G. Knepley } 1044e537020bSMatthew G. Knepley } 10454c367dbcSMatthew G. Knepley /* Cohesive cell: Old and new split face, then new cohesive faces */ 1046fd4b9f15SMatthew G. Knepley coneNew[0] = newp; /* Extracted negative side orientation above */ 10474c367dbcSMatthew G. Knepley coneNew[1] = splitp; 10484c367dbcSMatthew G. Knepley coneONew[1] = coneONew[0]; 1049e537020bSMatthew G. Knepley for (q = 0; q < coneSize; ++q) { 105018c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 105118c5995bSMatthew G. Knepley if (v < 0) { 105218c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 105318c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 105418c5995bSMatthew G. Knepley coneONew[2+q] = 0; 105518c5995bSMatthew G. Knepley } else { 105618c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep]; 105718c5995bSMatthew G. Knepley } 1058e537020bSMatthew G. Knepley coneONew[2+q] = 0; 1059e537020bSMatthew G. Knepley } 10604c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr); 10614c367dbcSMatthew G. Knepley ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr); 106296a07cd0SMatthew G. Knepley /* Label the hybrid cells on the boundary of the split */ 106396a07cd0SMatthew G. Knepley if (hasUnsplit) {ierr = DMLabelSetValue(label, -hybcell, dim);CHKERRQ(ierr);} 1064cd0c2139SMatthew G Knepley } else if (dep == 0) { 10654c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1066cd0c2139SMatthew G Knepley 1067cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 10684c367dbcSMatthew G. Knepley for (e = 0, qn = 0; e < supportSize; ++e) { 1069cd0c2139SMatthew G Knepley PetscInt val; 1070cd0c2139SMatthew G Knepley 1071cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1072cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 10732582d50cSToby Isaac supportNew[qn++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1074cd0c2139SMatthew G Knepley } 1075cd0c2139SMatthew G Knepley } 10764c367dbcSMatthew G. Knepley supportNew[qn] = hybedge; 1077cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1078cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 10794c367dbcSMatthew G. Knepley for (e = 0, qp = 0; e < supportSize; ++e) { 1080cd0c2139SMatthew G Knepley PetscInt val, edge; 1081cd0c2139SMatthew G Knepley 1082cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1083cd0c2139SMatthew G Knepley if (val == 1) { 10844c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 1085cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 10864c367dbcSMatthew G. Knepley supportNew[qp++] = edge + pMaxNew[dep+1]; 1087cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 10882582d50cSToby Isaac supportNew[qp++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1089cd0c2139SMatthew G Knepley } 1090cd0c2139SMatthew G Knepley } 10914c367dbcSMatthew G. Knepley supportNew[qp] = hybedge; 1092cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 10934c367dbcSMatthew G. Knepley /* Hybrid edge: Old and new split vertex */ 1094cd0c2139SMatthew G Knepley coneNew[0] = newp; 1095cd0c2139SMatthew G Knepley coneNew[1] = splitp; 10964c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 10974c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 10984c367dbcSMatthew G. Knepley PetscInt val, edge; 10994c367dbcSMatthew G. Knepley 11004c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 11014c367dbcSMatthew G. Knepley if (val == 1) { 11024c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 11034c367dbcSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 11044c367dbcSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 11054c367dbcSMatthew G. Knepley } 11064c367dbcSMatthew G. Knepley } 11074c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1108cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 11094c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 11104c367dbcSMatthew G. Knepley 1111cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 1112cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 1113cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 11144c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 1115e1757548SMatthew G. Knepley if (v < 0) { 1116e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1117e1757548SMatthew 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); 11182582d50cSToby Isaac coneNew[q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/; 1119e1757548SMatthew G. Knepley } else { 11204c367dbcSMatthew G. Knepley coneNew[q] = v + pMaxNew[dep-1]; 1121cd0c2139SMatthew G Knepley } 1122e1757548SMatthew G. Knepley } 1123cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 1124cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 1125cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 1126cd0c2139SMatthew G Knepley PetscInt val; 1127cd0c2139SMatthew G Knepley 1128cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 11294c367dbcSMatthew G. Knepley if (val == dim-1) { 11302582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 11314c367dbcSMatthew G. Knepley } else if (val == (shift + dim-1)) { 11322582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1133cd0c2139SMatthew G Knepley } 1134cd0c2139SMatthew G Knepley } 1135b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1136cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1137cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 1138cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 1139cd0c2139SMatthew G Knepley PetscInt val, face; 1140cd0c2139SMatthew G Knepley 1141cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1142cd0c2139SMatthew G Knepley if (val == dim-1) { 11434c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1144cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 11454c367dbcSMatthew G. Knepley supportNew[q++] = face + pMaxNew[dep+1]; 1146cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 11472582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1148cd0c2139SMatthew G Knepley } 1149cd0c2139SMatthew G Knepley } 1150b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1151cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 11524c367dbcSMatthew G. Knepley /* Hybrid face */ 11534c367dbcSMatthew G. Knepley coneNew[0] = newp; 11544c367dbcSMatthew G. Knepley coneNew[1] = splitp; 11554c367dbcSMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 11564c367dbcSMatthew G. Knepley PetscInt vertex; 11574c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr); 1158e1757548SMatthew G. Knepley if (vertex < 0) { 1159e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr); 1160e1757548SMatthew 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); 1161e1757548SMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1162e1757548SMatthew G. Knepley } else { 11634c367dbcSMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep]; 11644c367dbcSMatthew G. Knepley } 1165e1757548SMatthew G. Knepley } 11664c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 11674c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 11684c367dbcSMatthew G. Knepley PetscInt val, face; 11694c367dbcSMatthew G. Knepley 11704c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 11714c367dbcSMatthew G. Knepley if (val == dim-1) { 11724c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 11734c367dbcSMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 11744c367dbcSMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 11754c367dbcSMatthew G. Knepley } 11764c367dbcSMatthew G. Knepley } 11774c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1178cd0c2139SMatthew G Knepley } 1179cd0c2139SMatthew G Knepley } 1180cd0c2139SMatthew G Knepley } 118118c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 118218c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 118318c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 11842582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 118518c5995bSMatthew G. Knepley const PetscInt *cone, *support, *ornt; 1186e1757548SMatthew G. Knepley PetscInt coneSize, supportSize, supportSizeNew, q, qf, e, f, s; 118718c5995bSMatthew G. Knepley 118818c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 118918c5995bSMatthew G. Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 119018c5995bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 119118c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 119218c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 119318c5995bSMatthew G. Knepley if (dep == 0) { 119418c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 119518c5995bSMatthew G. Knepley 119618c5995bSMatthew G. Knepley /* Unsplit vertex */ 119718c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 119818c5995bSMatthew G. Knepley for (s = 0, q = 0; s < supportSize; ++s) { 11992582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[s], depth, depthShift) /*support[s] + depthOffset[dep+1]*/; 120018c5995bSMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 120118c5995bSMatthew G. Knepley if (e >= 0) { 120218c5995bSMatthew G. Knepley supportNew[q++] = e + pMaxNew[dep+1]; 120318c5995bSMatthew G. Knepley } 120418c5995bSMatthew G. Knepley } 120518c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 120618c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 120718c5995bSMatthew G. Knepley if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp); 120818c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 120918c5995bSMatthew G. Knepley /* Hybrid edge */ 121018c5995bSMatthew G. Knepley coneNew[0] = newp; 121118c5995bSMatthew G. Knepley coneNew[1] = newp; 121218c5995bSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 121318c5995bSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 121418c5995bSMatthew G. Knepley PetscInt val, edge; 121518c5995bSMatthew G. Knepley 121618c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 121718c5995bSMatthew G. Knepley if (val == 1) { 121818c5995bSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 121918c5995bSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 122018c5995bSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1221e1757548SMatthew G. Knepley } else if (val == (shift2 + 1)) { 1222e1757548SMatthew G. Knepley ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr); 1223e1757548SMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]); 1224e1757548SMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1]; 122518c5995bSMatthew G. Knepley } 122618c5995bSMatthew G. Knepley } 122718c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1228e1757548SMatthew G. Knepley } else if (dep == dim-2) { 1229e1757548SMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 1230e1757548SMatthew G. Knepley 1231da1dd7e4SMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and hybrid face twice */ 1232e1757548SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1233e1757548SMatthew G. Knepley PetscInt val, face; 1234e1757548SMatthew G. Knepley 1235e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1236e1757548SMatthew G. Knepley if (val == dim-1) { 1237e1757548SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1238e1757548SMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]); 12392582d50cSToby Isaac supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/; 1240e1757548SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+1]; 1241e1757548SMatthew G. Knepley } else { 12422582d50cSToby Isaac supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/; 1243e1757548SMatthew G. Knepley } 1244e1757548SMatthew G. Knepley } 1245e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1246e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1247da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 1248da1dd7e4SMatthew 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); 1249e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1250e1757548SMatthew G. Knepley /* Add hybrid face */ 1251e1757548SMatthew G. Knepley coneNew[0] = newp; 1252212cc919SMatthew G. Knepley coneNew[1] = newp; 1253e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[0], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1254e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[0]); 1255212cc919SMatthew G. Knepley coneNew[2] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1256e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1257e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]); 1258e1757548SMatthew G. Knepley coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1259e1757548SMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 1260da1dd7e4SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1261da1dd7e4SMatthew G. Knepley PetscInt val, face; 1262da1dd7e4SMatthew G. Knepley 1263da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1264da1dd7e4SMatthew G. Knepley if (val == dim-1) { 1265da1dd7e4SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1266da1dd7e4SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1267da1dd7e4SMatthew G. Knepley } 1268da1dd7e4SMatthew G. Knepley } 1269da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, hybface, &supportSizeNew);CHKERRQ(ierr); 1270da1dd7e4SMatthew 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); 1271e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1272cd0c2139SMatthew G Knepley } 1273cd0c2139SMatthew G Knepley } 1274cd0c2139SMatthew G Knepley } 1275cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 1276cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1277cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 1278cd0c2139SMatthew G Knepley IS pIS; 1279cd0c2139SMatthew G Knepley PetscInt numPoints; 1280cd0c2139SMatthew G Knepley const PetscInt *points; 1281cd0c2139SMatthew G Knepley 1282cd0c2139SMatthew G Knepley if (dep >= 0) continue; 1283cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 1284cd0c2139SMatthew G Knepley if (!pIS) continue; 1285cd0c2139SMatthew G Knepley dep = -dep - shift; 1286cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 1287cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 1288cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1289cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 12902582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*depthOffset[dep] + oldp*/; 1291cd0c2139SMatthew G Knepley const PetscInt *cone; 1292cd0c2139SMatthew G Knepley PetscInt coneSize, c; 129350cf782dSMatthew G. Knepley /* PetscBool replaced = PETSC_FALSE; */ 1294cd0c2139SMatthew G Knepley 1295cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 1296cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 1297cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 1298cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 1299cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1300e38fbfedSToby Isaac const PetscInt coldp = DMPlexShiftPointInverse_Internal(cone[c],depth,depthShift); 1301cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 1302cd0c2139SMatthew G Knepley 1303cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 1304cd0c2139SMatthew G Knepley if (val == dep-1) { 1305cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 1306cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 1307cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 1308cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 130950cf782dSMatthew G. Knepley /* replaced = PETSC_TRUE; */ 1310cd0c2139SMatthew G Knepley } 1311cd0c2139SMatthew G Knepley } 13124a189a86SMatthew G. Knepley /* Cells with only a vertex or edge on the submesh have no replacement */ 13134a189a86SMatthew G. Knepley /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 1314cd0c2139SMatthew G Knepley } 1315cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 1316cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 1317cd0c2139SMatthew G Knepley } 1318cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 1319cd0c2139SMatthew G Knepley ierr = DMPlexStratify(sdm);CHKERRQ(ierr); 1320cd0c2139SMatthew G Knepley /* Step 8: Coordinates */ 1321cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 132269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 1323cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 1324cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 1325cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 13262582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[0][v], depth, depthShift) /*depthOffset[0] + splitPoints[0][v]*/; 1327cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 1328cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 1329cd0c2139SMatthew G Knepley 1330cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 1331cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 1332cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 1333cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 1334cd0c2139SMatthew G Knepley } 1335cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 1336cd0c2139SMatthew G Knepley /* Step 9: SF, if I can figure this out we can split the mesh in parallel */ 1337cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1338cd0c2139SMatthew G Knepley /* Step 10: Labels */ 1339cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1340c58f1c22SToby Isaac ierr = DMGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 1341cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1342cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 13432582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[dep][p], depth, depthShift) /*depthOffset[dep] + splitPoints[dep][p]*/; 1344cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 1345cd0c2139SMatthew G Knepley PetscInt l; 1346cd0c2139SMatthew G Knepley 1347cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 1348cd0c2139SMatthew G Knepley DMLabel mlabel; 1349cd0c2139SMatthew G Knepley const char *lname; 1350cd0c2139SMatthew G Knepley PetscInt val; 13519a356370SMatthew G. Knepley PetscBool isDepth; 1352cd0c2139SMatthew G Knepley 1353c58f1c22SToby Isaac ierr = DMGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 13549a356370SMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 13559a356370SMatthew G. Knepley if (isDepth) continue; 1356c58f1c22SToby Isaac ierr = DMGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 1357cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 1358cd0c2139SMatthew G Knepley if (val >= 0) { 1359cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 13609a356370SMatthew G. Knepley #if 0 13619a356370SMatthew G. Knepley /* Do not put cohesive edges into the label */ 1362cd0c2139SMatthew G Knepley if (dep == 0) { 13634c367dbcSMatthew G. Knepley const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1364cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr); 13654c367dbcSMatthew G. Knepley } else if (dep == dim-2) { 13664c367dbcSMatthew G. Knepley const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 13674c367dbcSMatthew G. Knepley ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr); 1368cd0c2139SMatthew G Knepley } 13694c367dbcSMatthew G. Knepley /* Do not put cohesive faces into the label */ 13709a356370SMatthew G. Knepley #endif 1371cd0c2139SMatthew G Knepley } 1372cd0c2139SMatthew G Knepley } 1373cd0c2139SMatthew G Knepley } 1374cd0c2139SMatthew G Knepley } 1375cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1376cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 1377cd0c2139SMatthew G Knepley 1378cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 137918c5995bSMatthew G. Knepley if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 138018c5995bSMatthew G. Knepley ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr); 138118c5995bSMatthew G. Knepley if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);} 138218c5995bSMatthew G. Knepley ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr); 1383cd0c2139SMatthew G Knepley } 1384cd0c2139SMatthew G Knepley if (label) { 1385cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1386cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1387cd0c2139SMatthew G Knepley } 13880d4d4d06SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 13890d4d4d06SMatthew G. Knepley ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr); 139036dbac82SMatthew G. Knepley pMaxNew[d] = pEnd - numHybridPoints[d] - numHybridPointsOld[d]; 13910d4d4d06SMatthew G. Knepley } 13920e49e2e2SMatthew 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); 1393dcbb62e8SMatthew G. Knepley ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr); 13942582d50cSToby Isaac ierr = PetscFree5(depthMax, depthEnd, depthShift, pMaxNew, numHybridPointsOld);CHKERRQ(ierr); 139518c5995bSMatthew G. Knepley ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr); 1396cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1397cd0c2139SMatthew G Knepley } 1398cd0c2139SMatthew G Knepley 1399cd0c2139SMatthew G Knepley #undef __FUNCT__ 1400cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells" 1401cd0c2139SMatthew G Knepley /*@C 1402cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 1403cd0c2139SMatthew G Knepley 1404cd0c2139SMatthew G Knepley Collective on dm 1405cd0c2139SMatthew G Knepley 1406cd0c2139SMatthew G Knepley Input Parameters: 1407cd0c2139SMatthew G Knepley + dm - The original DM 140853156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated) 1409cd0c2139SMatthew G Knepley 1410cd0c2139SMatthew G Knepley Output Parameters: 1411cd0c2139SMatthew G Knepley - dmSplit - The new DM 1412cd0c2139SMatthew G Knepley 1413cd0c2139SMatthew G Knepley Level: developer 1414cd0c2139SMatthew G Knepley 14152be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 1416cd0c2139SMatthew G Knepley @*/ 1417cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 1418cd0c2139SMatthew G Knepley { 1419cd0c2139SMatthew G Knepley DM sdm; 1420cd0c2139SMatthew G Knepley PetscInt dim; 1421cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1422cd0c2139SMatthew G Knepley 1423cd0c2139SMatthew G Knepley PetscFunctionBegin; 1424cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 142553156dfcSMatthew G. Knepley PetscValidPointer(dmSplit, 3); 1426cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 1427cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 1428c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1429c73cfb54SMatthew G. Knepley ierr = DMSetDimension(sdm, dim);CHKERRQ(ierr); 1430cd0c2139SMatthew G Knepley switch (dim) { 1431cd0c2139SMatthew G Knepley case 2: 1432cd0c2139SMatthew G Knepley case 3: 1433cd0c2139SMatthew G Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 1434cd0c2139SMatthew G Knepley break; 1435cd0c2139SMatthew G Knepley default: 1436cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 1437cd0c2139SMatthew G Knepley } 1438cd0c2139SMatthew G Knepley *dmSplit = sdm; 1439cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1440cd0c2139SMatthew G Knepley } 1441cd0c2139SMatthew G Knepley 1442cd0c2139SMatthew G Knepley #undef __FUNCT__ 14430f66a230SMatthew G. Knepley #define __FUNCT__ "GetSurfaceSide_Static" 14440f66a230SMatthew G. Knepley /* Returns the side of the surface for a given cell with a face on the surface */ 14450f66a230SMatthew G. Knepley static PetscErrorCode GetSurfaceSide_Static(DM dm, DM subdm, PetscInt numSubpoints, const PetscInt *subpoints, PetscInt cell, PetscInt face, PetscBool *pos) 14460f66a230SMatthew G. Knepley { 14470f66a230SMatthew G. Knepley const PetscInt *cone, *ornt; 14480f66a230SMatthew G. Knepley PetscInt dim, coneSize, c; 14490f66a230SMatthew G. Knepley PetscErrorCode ierr; 14500f66a230SMatthew G. Knepley 14510f66a230SMatthew G. Knepley PetscFunctionBegin; 14520f66a230SMatthew G. Knepley *pos = PETSC_TRUE; 1453c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 14540f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 14550f66a230SMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 14560f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, cell, &ornt);CHKERRQ(ierr); 14570f66a230SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 14580f66a230SMatthew G. Knepley if (cone[c] == face) { 14590f66a230SMatthew G. Knepley PetscInt o = ornt[c]; 14600f66a230SMatthew G. Knepley 14610f66a230SMatthew G. Knepley if (subdm) { 14620f66a230SMatthew G. Knepley const PetscInt *subcone, *subornt; 14630f66a230SMatthew G. Knepley PetscInt subpoint, subface, subconeSize, sc; 14640f66a230SMatthew G. Knepley 14650f66a230SMatthew G. Knepley ierr = PetscFindInt(cell, numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 14660f66a230SMatthew G. Knepley ierr = PetscFindInt(face, numSubpoints, subpoints, &subface);CHKERRQ(ierr); 14670f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 14680f66a230SMatthew G. Knepley ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 14690f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 14700f66a230SMatthew G. Knepley for (sc = 0; sc < subconeSize; ++sc) { 14710f66a230SMatthew G. Knepley if (subcone[sc] == subface) { 14720f66a230SMatthew G. Knepley o = subornt[0]; 14730f66a230SMatthew G. Knepley break; 14740f66a230SMatthew G. Knepley } 14750f66a230SMatthew G. Knepley } 14760f66a230SMatthew 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); 14770f66a230SMatthew G. Knepley } 14780f66a230SMatthew G. Knepley if (o >= 0) *pos = PETSC_TRUE; 14790f66a230SMatthew G. Knepley else *pos = PETSC_FALSE; 14800f66a230SMatthew G. Knepley break; 14810f66a230SMatthew G. Knepley } 14820f66a230SMatthew G. Knepley } 14830f66a230SMatthew 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); 14840f66a230SMatthew G. Knepley PetscFunctionReturn(0); 14850f66a230SMatthew G. Knepley } 14860f66a230SMatthew G. Knepley 14870f66a230SMatthew G. Knepley #undef __FUNCT__ 14882be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete" 1489cd0c2139SMatthew G Knepley /*@ 14900f66a230SMatthew G. Knepley DMPlexLabelCohesiveComplete - Starting with a label marking points on an internal surface, we add all other mesh pieces 1491cd0c2139SMatthew G Knepley to complete the surface 1492cd0c2139SMatthew G Knepley 1493cd0c2139SMatthew G Knepley Input Parameters: 1494cd0c2139SMatthew G Knepley + dm - The DM 14950f66a230SMatthew G. Knepley . label - A DMLabel marking the surface 14960f66a230SMatthew G. Knepley . blabel - A DMLabel marking the vertices on the boundary which will not be duplicated, or NULL to find them automatically 1497bb55d314SMatthew G. Knepley . flip - Flag to flip the submesh normal and replace points on the other side 149847946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL 1499cd0c2139SMatthew G Knepley 1500cd0c2139SMatthew G Knepley Output Parameter: 1501cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 1502cd0c2139SMatthew G Knepley 15030f66a230SMatthew G. Knepley Note: The vertices in blabel are called "unsplit" in the terminology from hybrid cell creation. 15040f66a230SMatthew G. Knepley 1505cd0c2139SMatthew G Knepley Level: developer 1506cd0c2139SMatthew G Knepley 15072be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 1508cd0c2139SMatthew G Knepley @*/ 15090f66a230SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, DMLabel blabel, PetscBool flip, DM subdm) 1510cd0c2139SMatthew G Knepley { 1511d90583fdSMatthew G. Knepley DMLabel depthLabel; 151286200784SMatthew G. Knepley IS dimIS, subpointIS, facePosIS, faceNegIS, crossEdgeIS = NULL; 151347946fd8SMatthew G. Knepley const PetscInt *points, *subpoints; 1514bb55d314SMatthew G. Knepley const PetscInt rev = flip ? -1 : 1; 1515370472baSMatthew G. Knepley PetscInt *pMax; 1516370472baSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, dim, depth, pSize, dep, cStart, cEnd, cMax, fStart, fEnd, vStart, vEnd, numPoints, numSubpoints, p, val; 1517cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1518cd0c2139SMatthew G Knepley 1519cd0c2139SMatthew G Knepley PetscFunctionBegin; 1520370472baSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1521370472baSMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1522370472baSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1523370472baSMatthew G. Knepley ierr = PetscMalloc1(pSize,&pMax);CHKERRQ(ierr); 1524370472baSMatthew 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); 1525d90583fdSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 1526c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 152747946fd8SMatthew G. Knepley if (subdm) { 152847946fd8SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 152947946fd8SMatthew G. Knepley if (subpointIS) { 153047946fd8SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 153147946fd8SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 153247946fd8SMatthew G. Knepley } 153347946fd8SMatthew G. Knepley } 1534d7c8f101SMatthew G. Knepley /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */ 1535cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 1536dc86033cSMatthew G. Knepley if (!dimIS) { 1537dc86033cSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1538dc86033cSMatthew G. Knepley PetscFunctionReturn(0); 1539dc86033cSMatthew G. Knepley } 1540cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1541cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1542d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */ 1543cd0c2139SMatthew G Knepley const PetscInt *support; 1544cd0c2139SMatthew G Knepley PetscInt supportSize, s; 1545cd0c2139SMatthew G Knepley 1546cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1547cd0c2139SMatthew G Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 1548cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1549cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 15500f66a230SMatthew G. Knepley const PetscInt *cone; 1551cd0c2139SMatthew G Knepley PetscInt coneSize, c; 15520f66a230SMatthew G. Knepley PetscBool pos; 1553cd0c2139SMatthew G Knepley 15540f66a230SMatthew G. Knepley ierr = GetSurfaceSide_Static(dm, subdm, numSubpoints, subpoints, support[s], points[p], &pos);CHKERRQ(ierr); 15550f66a230SMatthew G. Knepley if (pos) {ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr);} 15560f66a230SMatthew G. Knepley else {ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);} 15570f66a230SMatthew G. Knepley if (rev < 0) pos = !pos ? PETSC_TRUE : PETSC_FALSE; 15580f66a230SMatthew G. Knepley /* Put faces touching the fault in the label */ 1559cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1560cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1561cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1562cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 1563cd0c2139SMatthew G Knepley 1564cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1565cd0c2139SMatthew G Knepley if (val == -1) { 1566cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 1567cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 1568cd0c2139SMatthew G Knepley 1569cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1570cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1571cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 1572a0541d8aSMatthew G. Knepley PetscInt bval = -1; 1573cd0c2139SMatthew G Knepley 1574cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1575a0541d8aSMatthew G. Knepley if (blabel) {ierr = DMLabelGetValue(blabel, clp, &bval);CHKERRQ(ierr);} 1576a0541d8aSMatthew G. Knepley if ((val >= 0) && (val < dim-1) && (bval < 0)) { 1577cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1578cd0c2139SMatthew G Knepley break; 1579cd0c2139SMatthew G Knepley } 1580cd0c2139SMatthew G Knepley } 1581cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1582cd0c2139SMatthew G Knepley } 1583cd0c2139SMatthew G Knepley } 1584cd0c2139SMatthew G Knepley } 1585cd0c2139SMatthew G Knepley } 15860f66a230SMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 15870f66a230SMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 158847946fd8SMatthew G. Knepley if (subdm) { 158947946fd8SMatthew G. Knepley if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 159047946fd8SMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 159147946fd8SMatthew G. Knepley } 1592a0541d8aSMatthew G. Knepley /* Mark boundary points as unsplit */ 159386200784SMatthew G. Knepley if (blabel) { 1594a0541d8aSMatthew G. Knepley ierr = DMLabelGetStratumIS(blabel, 1, &dimIS);CHKERRQ(ierr); 1595a0541d8aSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1596a0541d8aSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1597a0541d8aSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1598a0541d8aSMatthew G. Knepley const PetscInt point = points[p]; 1599a0541d8aSMatthew G. Knepley PetscInt val, bval; 1600a0541d8aSMatthew G. Knepley 1601a0541d8aSMatthew G. Knepley ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr); 1602a0541d8aSMatthew G. Knepley if (bval >= 0) { 1603f7019248SMatthew G. Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1604f7019248SMatthew G. Knepley if ((val < 0) || (val > dim)) { 1605f7019248SMatthew G. Knepley /* This could be a point added from splitting a vertex on an adjacent fault, otherwise its just wrong */ 1606f7019248SMatthew G. Knepley ierr = DMLabelClearValue(blabel, point, bval);CHKERRQ(ierr); 1607f7019248SMatthew G. Knepley } 1608f7019248SMatthew G. Knepley } 1609f7019248SMatthew G. Knepley } 1610f7019248SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1611f7019248SMatthew G. Knepley const PetscInt point = points[p]; 1612f7019248SMatthew G. Knepley PetscInt val, bval; 1613f7019248SMatthew G. Knepley 1614f7019248SMatthew G. Knepley ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr); 1615f7019248SMatthew G. Knepley if (bval >= 0) { 161686200784SMatthew G. Knepley const PetscInt *cone, *support; 161786200784SMatthew G. Knepley PetscInt coneSize, supportSize, s, valA, valB, valE; 161886200784SMatthew G. Knepley 1619a0541d8aSMatthew G. Knepley /* Mark as unsplit */ 1620a0541d8aSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1621a0541d8aSMatthew G. Knepley if ((val < 0) || (val > dim)) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d has label value %d, should be part of the fault", point, val); 1622a0541d8aSMatthew G. Knepley ierr = DMLabelClearValue(label, point, val);CHKERRQ(ierr); 1623a0541d8aSMatthew G. Knepley ierr = DMLabelSetValue(label, point, shift2+val);CHKERRQ(ierr); 16242c06a818SMatthew G. Knepley /* Check for cross-edge 16252c06a818SMatthew G. Knepley A cross-edge has endpoints which are both on the boundary of the surface, but the edge itself is not. */ 162686200784SMatthew G. Knepley if (val != 0) continue; 162786200784SMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 162886200784SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 162986200784SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 163086200784SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 163186200784SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 163286200784SMatthew G. Knepley if (coneSize != 2) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Edge %D has %D vertices != 2", support[s], coneSize); 163386200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, cone[0], &valA);CHKERRQ(ierr); 163486200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, cone[1], &valB);CHKERRQ(ierr); 163586200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, support[s], &valE);CHKERRQ(ierr); 163609816f77SMatthew G. Knepley if ((valE < 0) && (valA >= 0) && (valB >= 0) && (cone[0] != cone[1])) {ierr = DMLabelSetValue(blabel, support[s], 2);CHKERRQ(ierr);} 163786200784SMatthew G. Knepley } 1638a0541d8aSMatthew G. Knepley } 1639a0541d8aSMatthew G. Knepley } 1640a0541d8aSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1641a0541d8aSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1642a0541d8aSMatthew G. Knepley } 1643cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1644c4d480a2SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 1645cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1646d24f5ce5SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1647d24f5ce5SMatthew G. Knepley cMax = cMax < 0 ? cEnd : cMax; 16480f66a230SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 1649cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 165086200784SMatthew G. Knepley if (blabel) {ierr = DMLabelGetStratumIS(blabel, 2, &crossEdgeIS);CHKERRQ(ierr);} 165186200784SMatthew G. Knepley if (dimIS && crossEdgeIS) { 165286200784SMatthew G. Knepley IS vertIS = dimIS; 165386200784SMatthew G. Knepley 165486200784SMatthew G. Knepley ierr = ISExpand(vertIS, crossEdgeIS, &dimIS);CHKERRQ(ierr); 165586200784SMatthew G. Knepley ierr = ISDestroy(&crossEdgeIS);CHKERRQ(ierr); 165686200784SMatthew G. Knepley ierr = ISDestroy(&vertIS);CHKERRQ(ierr); 165786200784SMatthew G. Knepley } 1658dc86033cSMatthew G. Knepley if (!dimIS) { 1659dc86033cSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1660dc86033cSMatthew G. Knepley PetscFunctionReturn(0); 1661dc86033cSMatthew G. Knepley } 1662cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1663cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1664d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */ 1665cd0c2139SMatthew G Knepley PetscInt *star = NULL; 166686200784SMatthew G. Knepley PetscInt starSize, s; 1667cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1668cd0c2139SMatthew G Knepley 1669d4622b2cSMatthew G. Knepley /* All points connected to the fault are inside a cell, so at the top level we will only check cells */ 1670cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1671cd0c2139SMatthew G Knepley while (again) { 1672cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1673cd0c2139SMatthew G Knepley again = 0; 1674cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1675cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1676cd0c2139SMatthew G Knepley const PetscInt *cone; 1677cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1678cd0c2139SMatthew G Knepley 1679d24f5ce5SMatthew G. Knepley if ((point < cStart) || (point >= cMax)) continue; 1680cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1681cd0c2139SMatthew G Knepley if (val != -1) continue; 1682d4622b2cSMatthew G. Knepley again = again == 1 ? 1 : 2; 1683cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1684cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1685cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1686cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1687cd0c2139SMatthew G Knepley if (val != -1) { 1688d7c8f101SMatthew G. Knepley const PetscInt *ccone; 1689166d9d0cSMatthew G. Knepley PetscInt cconeSize, cc, side; 1690d7c8f101SMatthew G. Knepley 1691db8edaafSMatthew G. Knepley if (PetscAbs(val) < shift) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d on cell %d has an invalid label %d", cone[c], point, val); 169237a6de01SMatthew G. Knepley if (val > 0) side = 1; 169337a6de01SMatthew G. Knepley else side = -1; 169437a6de01SMatthew G. Knepley ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr); 1695d7c8f101SMatthew G. Knepley /* Mark cell faces which touch the fault */ 1696d7c8f101SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr); 1697d7c8f101SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr); 1698d7c8f101SMatthew G. Knepley for (cc = 0; cc < cconeSize; ++cc) { 1699d7c8f101SMatthew G. Knepley PetscInt *closure = NULL; 1700d7c8f101SMatthew G. Knepley PetscInt closureSize, cl; 1701d7c8f101SMatthew G. Knepley 1702166d9d0cSMatthew G. Knepley ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr); 1703166d9d0cSMatthew G. Knepley if (val != -1) continue; 1704d7c8f101SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1705d4622b2cSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1706d7c8f101SMatthew G. Knepley const PetscInt clp = closure[cl]; 1707d7c8f101SMatthew G. Knepley 1708d7c8f101SMatthew G. Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1709d7c8f101SMatthew G. Knepley if (val == -1) continue; 1710d7c8f101SMatthew G. Knepley ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr); 171137a6de01SMatthew G. Knepley break; 171237a6de01SMatthew G. Knepley } 1713d7c8f101SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1714cd0c2139SMatthew G Knepley } 1715cd0c2139SMatthew G Knepley again = 1; 1716cd0c2139SMatthew G Knepley break; 1717cd0c2139SMatthew G Knepley } 1718cd0c2139SMatthew G Knepley } 1719cd0c2139SMatthew G Knepley } 1720cd0c2139SMatthew G Knepley } 1721cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1722cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1723cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1724cd0c2139SMatthew G Knepley 1725cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1726cd0c2139SMatthew G Knepley if (val == -1) { 1727cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1728cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1729cd0c2139SMatthew G Knepley PetscBool marked = PETSC_FALSE; 1730cd0c2139SMatthew G Knepley 1731cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1732cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1733cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1734cd0c2139SMatthew G Knepley 1735d24f5ce5SMatthew G. Knepley if ((spoint < cStart) || (spoint >= cMax)) continue; 1736cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1737cd0c2139SMatthew 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); 1738d90583fdSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1739cd0c2139SMatthew G Knepley if (val > 0) { 1740cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1741cd0c2139SMatthew G Knepley } else { 1742cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1743cd0c2139SMatthew G Knepley } 1744cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1745cd0c2139SMatthew G Knepley break; 1746cd0c2139SMatthew G Knepley } 1747cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1748370472baSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1749370472baSMatthew G. Knepley if (point < pMax[dep] && !marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1750cd0c2139SMatthew G Knepley } 1751cd0c2139SMatthew G Knepley } 1752cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1753cd0c2139SMatthew G Knepley } 1754cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1755cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 175618c5995bSMatthew G. Knepley /* If any faces touching the fault divide cells on either side, split them */ 175718c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift+dim-1, &facePosIS);CHKERRQ(ierr); 175818c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr); 175918c5995bSMatthew G. Knepley ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr); 176018c5995bSMatthew G. Knepley ierr = ISDestroy(&facePosIS);CHKERRQ(ierr); 176118c5995bSMatthew G. Knepley ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr); 176218c5995bSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 176318c5995bSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 176418c5995bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 176518c5995bSMatthew G. Knepley const PetscInt point = points[p]; 176618c5995bSMatthew G. Knepley const PetscInt *support; 176718c5995bSMatthew G. Knepley PetscInt supportSize, valA, valB; 176818c5995bSMatthew G. Knepley 176918c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 177018c5995bSMatthew G. Knepley if (supportSize != 2) continue; 177118c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 177218c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr); 177318c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr); 177418c5995bSMatthew G. Knepley if ((valA == -1) || (valB == -1)) continue; 177518c5995bSMatthew G. Knepley if (valA*valB > 0) continue; 177618c5995bSMatthew G. Knepley /* Split the face */ 177718c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr); 177818c5995bSMatthew G. Knepley ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr); 177918c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr); 1780e1757548SMatthew G. Knepley /* Label its closure: 1781e1757548SMatthew G. Knepley unmarked: label as unsplit 1782e1757548SMatthew G. Knepley incident: relabel as split 1783e1757548SMatthew G. Knepley split: do nothing 1784e1757548SMatthew G. Knepley */ 178518c5995bSMatthew G. Knepley { 178618c5995bSMatthew G. Knepley PetscInt *closure = NULL; 178718c5995bSMatthew G. Knepley PetscInt closureSize, cl; 178818c5995bSMatthew G. Knepley 178918c5995bSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 179018c5995bSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 179118c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr); 17928771c1d3SMatthew G. Knepley if (valA == -1) { /* Mark as unsplit */ 179318c5995bSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 179418c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr); 17958771c1d3SMatthew G. Knepley } else if (((valA >= shift) && (valA < shift2)) || ((valA <= -shift) && (valA > -shift2))) { 1796e1757548SMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 1797e1757548SMatthew G. Knepley ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr); 1798e1757548SMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr); 1799e1757548SMatthew G. Knepley } 180018c5995bSMatthew G. Knepley } 180118c5995bSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 180218c5995bSMatthew G. Knepley } 180318c5995bSMatthew G. Knepley } 180418c5995bSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 180518c5995bSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1806370472baSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1807cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1808cd0c2139SMatthew G Knepley } 1809cd0c2139SMatthew G Knepley 1810cd0c2139SMatthew G Knepley #undef __FUNCT__ 18113cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh" 18123cf72582SMatthew G. Knepley /*@C 18133cf72582SMatthew G. Knepley DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface 18143cf72582SMatthew G. Knepley 18153cf72582SMatthew G. Knepley Collective on dm 18163cf72582SMatthew G. Knepley 18173cf72582SMatthew G. Knepley Input Parameters: 18183cf72582SMatthew G. Knepley + dm - The original DM 18193cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices 18203cf72582SMatthew G. Knepley 18213cf72582SMatthew G. Knepley Output Parameters: 18223cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface 18233cf72582SMatthew G. Knepley - dmHybrid - The new DM 18243cf72582SMatthew G. Knepley 18253cf72582SMatthew G. Knepley Level: developer 18263cf72582SMatthew G. Knepley 18273cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate() 18283cf72582SMatthew G. Knepley @*/ 18293cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid) 18303cf72582SMatthew G. Knepley { 18313cf72582SMatthew G. Knepley DM idm; 18323cf72582SMatthew G. Knepley DMLabel subpointMap, hlabel; 18333cf72582SMatthew G. Knepley PetscInt dim; 18343cf72582SMatthew G. Knepley PetscErrorCode ierr; 18353cf72582SMatthew G. Knepley 18363cf72582SMatthew G. Knepley PetscFunctionBegin; 18373cf72582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 18383cf72582SMatthew G. Knepley if (hybridLabel) PetscValidPointer(hybridLabel, 3); 18393cf72582SMatthew G. Knepley PetscValidPointer(dmHybrid, 4); 1840c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 18413cf72582SMatthew G. Knepley ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr); 18423cf72582SMatthew G. Knepley ierr = DMPlexOrient(idm);CHKERRQ(ierr); 18433cf72582SMatthew G. Knepley ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr); 18443cf72582SMatthew G. Knepley ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr); 18453cf72582SMatthew G. Knepley ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr); 18460f66a230SMatthew G. Knepley ierr = DMPlexLabelCohesiveComplete(dm, hlabel, NULL, PETSC_FALSE, idm);CHKERRQ(ierr); 18473cf72582SMatthew G. Knepley ierr = DMDestroy(&idm);CHKERRQ(ierr); 18483cf72582SMatthew G. Knepley ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr); 18493cf72582SMatthew G. Knepley if (hybridLabel) *hybridLabel = hlabel; 185053aa2e23SMatthew G. Knepley else {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);} 1851e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1852e6ccafaeSMatthew G Knepley } 1853e6ccafaeSMatthew G Knepley 1854e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1855efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated" 1856efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 1857efa14ee0SMatthew G Knepley 1858efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 1859efa14ee0SMatthew G Knepley */ 1860830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1861efa14ee0SMatthew G Knepley { 1862fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 1863efa14ee0SMatthew G Knepley const PetscInt *subvertices; 186477d178adSMatthew G. Knepley PetscInt *pStart, *pEnd, *pMax, pSize; 1865efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1866efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1867efa14ee0SMatthew G Knepley 1868efa14ee0SMatthew G Knepley PetscFunctionBegin; 1869efa14ee0SMatthew G Knepley *numFaces = 0; 1870efa14ee0SMatthew G Knepley *nFV = 0; 1871efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1872c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 187377d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1874dcca6d9dSJed Brown ierr = PetscMalloc3(pSize,&pStart,pSize,&pEnd,pSize,&pMax);CHKERRQ(ierr); 1875d92e47f8SMatthew 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); 1876efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 1877efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1878efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1879efa14ee0SMatthew G Knepley } 1880efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1881fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1882efa14ee0SMatthew G Knepley if (subvertexIS) { 1883efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1884efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1885efa14ee0SMatthew G Knepley } 1886efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1887efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 18880298fd71SBarry Smith PetscInt *star = NULL; 1889efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 1890efa14ee0SMatthew G Knepley 1891efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1892efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1893efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1894efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1895efa14ee0SMatthew G Knepley } 1896efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 1897efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 18980298fd71SBarry Smith PetscInt *closure = NULL; 1899efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 1900efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 1901efa14ee0SMatthew G Knepley 1902efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 190365560c7fSMatthew G Knepley if (cellLoc == 2) continue; 190482f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1905efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1906efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1907efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1908efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1909efa14ee0SMatthew G Knepley 1910efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1911efa14ee0SMatthew G Knepley ++numCorners; 1912efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1913830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 1914efa14ee0SMatthew G Knepley } 1915efa14ee0SMatthew G Knepley } 191618ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 191782f516ccSBarry 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); 1918efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 1919007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 1920007baee2SMatthew G. Knepley PetscInt numCells, nc; 1921007baee2SMatthew G. Knepley 1922efa14ee0SMatthew G Knepley ++(*numFaces); 1923efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 1924efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 1925efa14ee0SMatthew G Knepley } 1926007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1927007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 1928007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 1929007baee2SMatthew G. Knepley } 1930007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1931efa14ee0SMatthew G Knepley } 1932efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1933efa14ee0SMatthew G Knepley } 1934efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1935efa14ee0SMatthew G Knepley } 1936efa14ee0SMatthew G Knepley if (subvertexIS) { 1937efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1938efa14ee0SMatthew G Knepley } 1939efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1940efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1941efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1942efa14ee0SMatthew G Knepley } 1943efa14ee0SMatthew G Knepley 1944efa14ee0SMatthew G Knepley #undef __FUNCT__ 1945efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated" 1946830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 1947efa14ee0SMatthew G Knepley { 194834b4c39eSMatthew G. Knepley IS subvertexIS = NULL; 1949efa14ee0SMatthew G Knepley const PetscInt *subvertices; 1950efa14ee0SMatthew G Knepley PetscInt *pStart, *pEnd, *pMax; 1951efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 1952efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1953efa14ee0SMatthew G Knepley 1954efa14ee0SMatthew G Knepley PetscFunctionBegin; 1955c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1956dcca6d9dSJed Brown ierr = PetscMalloc3(dim+1,&pStart,dim+1,&pEnd,dim+1,&pMax);CHKERRQ(ierr); 19570298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1958efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 1959efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1960efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1961efa14ee0SMatthew G Knepley } 1962efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 196334b4c39eSMatthew G. Knepley if (vertexLabel) { 1964830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 1965efa14ee0SMatthew G Knepley if (subvertexIS) { 1966efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1967efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1968efa14ee0SMatthew G Knepley } 196934b4c39eSMatthew G. Knepley } 1970efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1971efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 19720298fd71SBarry Smith PetscInt *star = NULL; 1973efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 1974efa14ee0SMatthew G Knepley 1975efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1976efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1977efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1978efa14ee0SMatthew G Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 1979efa14ee0SMatthew G Knepley } 1980efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 1981efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 19820298fd71SBarry Smith PetscInt *closure = NULL; 1983efa14ee0SMatthew G Knepley PetscInt closureSize, c; 1984efa14ee0SMatthew G Knepley PetscInt faceLoc; 1985efa14ee0SMatthew G Knepley 1986efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 1987efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 198882f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 1989efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1990efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1991efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1992efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1993efa14ee0SMatthew G Knepley 1994efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1995efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1996830e53efSMatthew G. Knepley if (vertexLoc != value) break; 1997efa14ee0SMatthew G Knepley } 1998efa14ee0SMatthew G Knepley } 1999efa14ee0SMatthew G Knepley if (c == closureSize*2) { 2000efa14ee0SMatthew G Knepley const PetscInt *support; 2001efa14ee0SMatthew G Knepley PetscInt supportSize, s; 2002efa14ee0SMatthew G Knepley 2003efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 2004efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 2005efa14ee0SMatthew G Knepley 2006efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 2007efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 2008efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 2009efa14ee0SMatthew G Knepley break; 2010efa14ee0SMatthew G Knepley } 2011efa14ee0SMatthew G Knepley } 2012efa14ee0SMatthew G Knepley } 2013efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2014efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2015efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 2016efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 2017efa14ee0SMatthew G Knepley } 2018efa14ee0SMatthew G Knepley } 2019efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2020efa14ee0SMatthew G Knepley } 2021efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 2022efa14ee0SMatthew G Knepley } 202334b4c39eSMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);} 2024efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2025efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 2026efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 2027efa14ee0SMatthew G Knepley } 2028efa14ee0SMatthew G Knepley 2029efa14ee0SMatthew G Knepley #undef __FUNCT__ 2030766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated" 203127c04023SMatthew 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) 2032766ab985SMatthew G. Knepley { 203327c04023SMatthew G. Knepley DMLabel label = NULL; 2034766ab985SMatthew G. Knepley const PetscInt *cone; 203527234c99SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize; 2036766ab985SMatthew G. Knepley PetscErrorCode ierr; 2037766ab985SMatthew G. Knepley 2038812bfc34SJed Brown PetscFunctionBegin; 2039c0ed958bSJed Brown *numFaces = 0; 2040c0ed958bSJed Brown *nFV = 0; 2041c58f1c22SToby Isaac if (labelname) {ierr = DMGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 2042fed694aaSMatthew G. Knepley *subCells = NULL; 2043c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2044766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 2045766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2046766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 204727c04023SMatthew G. Knepley if (label) { 204827c04023SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 204927c04023SMatthew G. Knepley PetscInt val; 205027c04023SMatthew G. Knepley 205127c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 205227c04023SMatthew G. Knepley if (val == value) { 205327c04023SMatthew G. Knepley ++(*numFaces); 205427c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 205527c04023SMatthew G. Knepley } 205627c04023SMatthew G. Knepley } 205727c04023SMatthew G. Knepley } else { 2058766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 205927c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 206027c04023SMatthew G. Knepley } 2061766ab985SMatthew G. Knepley *nFV = hasLagrange ? coneSize/3 : coneSize/2; 2062785e854fSJed Brown ierr = PetscMalloc1(*numFaces *2, subCells);CHKERRQ(ierr); 2063766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 2064766ab985SMatthew G. Knepley const PetscInt *cells; 2065766ab985SMatthew G. Knepley PetscInt numCells; 2066766ab985SMatthew G. Knepley 206727c04023SMatthew G. Knepley if (label) { 206827c04023SMatthew G. Knepley PetscInt val; 206927c04023SMatthew G. Knepley 207027c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 207127c04023SMatthew G. Knepley if (val != value) continue; 207227c04023SMatthew G. Knepley } 2073766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2074766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 2075766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 2076766ab985SMatthew G. Knepley } 2077766ab985SMatthew G. Knepley /* Negative face */ 2078766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 207927234c99SMatthew G. Knepley /* Not true in parallel 208027234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 2081766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 2082766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 208327234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 2084766ab985SMatthew G. Knepley } 2085766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 2086766ab985SMatthew G. Knepley /* Positive face is not included */ 2087766ab985SMatthew G. Knepley } 2088766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2089766ab985SMatthew G. Knepley } 2090766ab985SMatthew G. Knepley 2091766ab985SMatthew G. Knepley #undef __FUNCT__ 2092766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated" 20933982b651SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, DMLabel label, PetscInt value, DMLabel subpointMap, DM subdm) 2094766ab985SMatthew G. Knepley { 2095766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 2096766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 2097766ab985SMatthew G. Knepley PetscErrorCode ierr; 2098766ab985SMatthew G. Knepley 2099812bfc34SJed Brown PetscFunctionBegin; 2100c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2101766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 2102766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2103766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 2104dcca6d9dSJed Brown ierr = PetscMalloc2(dim+1,&pStart,dim+1,&pEnd);CHKERRQ(ierr); 2105b3154360SMatthew G. Knepley for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);} 2106766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 2107766ab985SMatthew G. Knepley const PetscInt *cone; 2108766ab985SMatthew G. Knepley PetscInt *closure = NULL; 2109b3154360SMatthew G. Knepley PetscInt fconeSize, coneSize, closureSize, cl, val; 2110766ab985SMatthew G. Knepley 211127c04023SMatthew G. Knepley if (label) { 211227c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 211327c04023SMatthew G. Knepley if (val != value) continue; 211427c04023SMatthew G. Knepley } 2115766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2116766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2117b3154360SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr); 2118b3154360SMatthew G. Knepley if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 2119b3154360SMatthew G. Knepley /* Negative face */ 2120766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2121766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2122766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 2123766ab985SMatthew G. Knepley 2124766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2125766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 2126766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 2127766ab985SMatthew G. Knepley break; 2128766ab985SMatthew G. Knepley } 2129766ab985SMatthew G. Knepley } 2130766ab985SMatthew G. Knepley } 2131766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2132766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 2133766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 2134766ab985SMatthew G. Knepley const PetscInt *support; 2135766ab985SMatthew G. Knepley PetscInt supportSize, s; 2136766ab985SMatthew G. Knepley 2137766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 2138711de394SMatthew G. Knepley /* if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); */ 2139766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 2140766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 2141766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 2142766ab985SMatthew G. Knepley } 2143766ab985SMatthew G. Knepley } 2144766ab985SMatthew G. Knepley } 2145766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 2146766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2147766ab985SMatthew G. Knepley } 2148766ab985SMatthew G. Knepley 2149766ab985SMatthew G. Knepley #undef __FUNCT__ 2150e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation" 2151e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2152e6ccafaeSMatthew G Knepley { 215382f516ccSBarry Smith MPI_Comm comm; 2154e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 2155e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 2156e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 2157e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2158e6ccafaeSMatthew G Knepley 215982f516ccSBarry Smith PetscFunctionBegin; 216082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2161c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &cellDim);CHKERRQ(ierr); 2162e6ccafaeSMatthew G Knepley if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 2163e6ccafaeSMatthew G Knepley 2164ddeab2a6SMatthew G. Knepley if (cellDim == 1 && numCorners == 2) { 2165ddeab2a6SMatthew G. Knepley /* Triangle */ 2166e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 2167e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2168ddeab2a6SMatthew G. Knepley } else if (cellDim == 2 && numCorners == 3) { 2169ddeab2a6SMatthew G. Knepley /* Triangle */ 2170ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2171ddeab2a6SMatthew G. Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2172ddeab2a6SMatthew G. Knepley } else if (cellDim == 3 && numCorners == 4) { 2173ddeab2a6SMatthew G. Knepley /* Tetrahedron */ 2174ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2175ddeab2a6SMatthew G. Knepley posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2176e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 2177e6ccafaeSMatthew G Knepley /* Quadratic line */ 2178e6ccafaeSMatthew G Knepley faceSize = 1; 2179e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2180e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 2181e6ccafaeSMatthew G Knepley /* Quads */ 2182e6ccafaeSMatthew G Knepley faceSize = 2; 2183e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 2184e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2185e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 2186e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2187e6ccafaeSMatthew G Knepley } else { 2188e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 2189e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 2190e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 2191e6ccafaeSMatthew G Knepley } 2192e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 2193e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 2194e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2195e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 2196e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2197e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2198e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 2199e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2200e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2201e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 2202e6ccafaeSMatthew G Knepley }; 2203e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 2204e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2205e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2206e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 2207e6ccafaeSMatthew G Knepley }; 2208e6ccafaeSMatthew G Knepley 2209e6ccafaeSMatthew G Knepley faceSize = faceSizeTri; 2210e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 2211e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 2212e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 2213e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 2214e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2215e6ccafaeSMatthew G Knepley 2216e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 2217e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 2218e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 2219e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 2220e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 2221e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2222e6ccafaeSMatthew G Knepley break; 2223e6ccafaeSMatthew G Knepley } 2224e6ccafaeSMatthew G Knepley } 2225e6ccafaeSMatthew G Knepley } 2226e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2227e6ccafaeSMatthew G Knepley break; 2228e6ccafaeSMatthew G Knepley } 2229e6ccafaeSMatthew G Knepley } 2230e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 2231e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2232e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2233e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 2234e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 2235e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2236e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 2237e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2238e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2239e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 2240e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2241e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2242e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2243e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 2244e6ccafaeSMatthew G Knepley }; 2245e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 2246e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2247e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2248e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2249e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 2250e6ccafaeSMatthew G Knepley }; 2251e6ccafaeSMatthew G Knepley 2252e6ccafaeSMatthew G Knepley faceSize = faceSizeQuad; 2253e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 2254e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 2255e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 2256e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 2257e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2258e6ccafaeSMatthew G Knepley 2259e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 2260e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 2261e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 2262e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 2263e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 2264e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2265e6ccafaeSMatthew G Knepley break; 2266e6ccafaeSMatthew G Knepley } 2267e6ccafaeSMatthew G Knepley } 2268e6ccafaeSMatthew G Knepley } 2269e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2270e6ccafaeSMatthew G Knepley break; 2271e6ccafaeSMatthew G Knepley } 2272e6ccafaeSMatthew G Knepley } 2273e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 2274e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2275e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2276e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 2277e6ccafaeSMatthew G Knepley /* Hexes 2278e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2279e6ccafaeSMatthew G Knepley pointing up at the second. 2280e6ccafaeSMatthew G Knepley 2281e6ccafaeSMatthew G Knepley 7---6 2282e6ccafaeSMatthew G Knepley /| /| 2283e6ccafaeSMatthew G Knepley 4---5 | 2284ddeab2a6SMatthew G. Knepley | 1-|-2 2285e6ccafaeSMatthew G Knepley |/ |/ 2286ddeab2a6SMatthew G. Knepley 0---3 2287e6ccafaeSMatthew G Knepley 2288e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2289e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 2290e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 2291e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2292e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 2293e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 2294e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2295ddeab2a6SMatthew G. Knepley 0, 3, 4, 5, /* front */ 2296ddeab2a6SMatthew G. Knepley 2, 3, 5, 6, /* right */ 2297ddeab2a6SMatthew G. Knepley 1, 2, 6, 7, /* back */ 2298ddeab2a6SMatthew G. Knepley 0, 1, 4, 7, /* left */ 2299e6ccafaeSMatthew G Knepley }; 2300e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 2301ddeab2a6SMatthew G. Knepley 1, 2, 3, 0, /* bottom */ 2302e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2303ddeab2a6SMatthew G. Knepley 0, 3, 5, 4, /* front */ 2304ddeab2a6SMatthew G. Knepley 3, 2, 6, 5, /* right */ 2305ddeab2a6SMatthew G. Knepley 2, 1, 7, 6, /* back */ 2306ddeab2a6SMatthew G. Knepley 1, 0, 4, 7, /* left */ 2307e6ccafaeSMatthew G Knepley }; 2308e6ccafaeSMatthew G Knepley 2309e6ccafaeSMatthew G Knepley faceSize = faceSizeHex; 2310e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 2311e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 2312e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2313e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 2314e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2315e6ccafaeSMatthew G Knepley 2316e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 2317e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 2318e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 2319e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 2320e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 2321e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 2322e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 2323e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2324e6ccafaeSMatthew G Knepley break; 2325e6ccafaeSMatthew G Knepley } 2326e6ccafaeSMatthew G Knepley } 2327e6ccafaeSMatthew G Knepley } 2328e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2329e6ccafaeSMatthew G Knepley break; 2330e6ccafaeSMatthew G Knepley } 2331e6ccafaeSMatthew G Knepley } 2332e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2333e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2334e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2335e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 2336e6ccafaeSMatthew G Knepley /* Quadratic tet */ 2337e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 2338e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 2339e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 2340e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2341e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 2342e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2343e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 2344e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 2345e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 2346e6ccafaeSMatthew G Knepley }; 2347e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 2348e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2349e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 2350e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 2351e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 2352e6ccafaeSMatthew G Knepley }; 2353e6ccafaeSMatthew G Knepley 2354e6ccafaeSMatthew G Knepley faceSize = faceSizeTet; 2355e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 2356e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 2357e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 2358e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 2359e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2360e6ccafaeSMatthew G Knepley 2361e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 2362e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 2363e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 2364e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 2365e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 2366e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 2367e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 2368e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2369e6ccafaeSMatthew G Knepley break; 2370e6ccafaeSMatthew G Knepley } 2371e6ccafaeSMatthew G Knepley } 2372e6ccafaeSMatthew G Knepley } 2373e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2374e6ccafaeSMatthew G Knepley break; 2375e6ccafaeSMatthew G Knepley } 2376e6ccafaeSMatthew G Knepley } 2377e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 2378e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2379e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2380e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 2381e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 2382e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2383e6ccafaeSMatthew G Knepley pointing up at the second. 2384e6ccafaeSMatthew G Knepley 2385e6ccafaeSMatthew G Knepley 7---6 2386e6ccafaeSMatthew G Knepley /| /| 2387e6ccafaeSMatthew G Knepley 4---5 | 2388e6ccafaeSMatthew G Knepley | 3-|-2 2389e6ccafaeSMatthew G Knepley |/ |/ 2390e6ccafaeSMatthew G Knepley 0---1 2391e6ccafaeSMatthew G Knepley 2392e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2393e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 2394e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 2395e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2396e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 2397e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 2398e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2399e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 2400e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 2401e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 2402e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 2403e6ccafaeSMatthew G Knepley }; 2404e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 2405e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 2406e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2407e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 2408e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 2409e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 2410e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 2411e6ccafaeSMatthew G Knepley }; 2412e6ccafaeSMatthew G Knepley 2413e6ccafaeSMatthew G Knepley faceSize = faceSizeQuadHex; 2414e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 2415e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 2416e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2417e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 2418e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2419e6ccafaeSMatthew G Knepley 2420e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 2421e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 2422e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 2423e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 2424e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 2425e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 2426e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 2427e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2428e6ccafaeSMatthew G Knepley break; 2429e6ccafaeSMatthew G Knepley } 2430e6ccafaeSMatthew G Knepley } 2431e6ccafaeSMatthew G Knepley } 2432e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2433e6ccafaeSMatthew G Knepley break; 2434e6ccafaeSMatthew G Knepley } 2435e6ccafaeSMatthew G Knepley } 2436e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2437e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2438e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2439e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 2440e6ccafaeSMatthew G Knepley if (!posOrient) { 2441e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 2442e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 2443e6ccafaeSMatthew G Knepley } else { 2444e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 2445e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 2446e6ccafaeSMatthew G Knepley } 2447e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 2448e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2449e6ccafaeSMatthew G Knepley } 2450e6ccafaeSMatthew G Knepley 2451e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2452e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace" 2453e6ccafaeSMatthew G Knepley /* 2454e6ccafaeSMatthew G Knepley Given a cell and a face, as a set of vertices, 2455e6ccafaeSMatthew G Knepley return the oriented face, as a set of vertices, in faceVertices 2456e6ccafaeSMatthew G Knepley The orientation is such that the face normal points out of the cell 2457e6ccafaeSMatthew G Knepley */ 2458e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2459e6ccafaeSMatthew G Knepley { 24600298fd71SBarry Smith const PetscInt *cone = NULL; 2461e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 2462e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 2463e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2464e6ccafaeSMatthew G Knepley 2465e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2466e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 2467e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 2468e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 2469e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2470e6ccafaeSMatthew G Knepley 2471e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 2472e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 2473e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 2474e6ccafaeSMatthew G Knepley } 2475e6ccafaeSMatthew G Knepley } 2476e6ccafaeSMatthew G Knepley if (found) { 2477e6ccafaeSMatthew G Knepley indices[v2] = v; 2478e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 2479e6ccafaeSMatthew G Knepley ++v2; 2480e6ccafaeSMatthew G Knepley } else { 2481e6ccafaeSMatthew G Knepley oppositeVertex = v; 2482e6ccafaeSMatthew G Knepley } 2483e6ccafaeSMatthew G Knepley } 2484e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 2485e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2486e6ccafaeSMatthew G Knepley } 2487e6ccafaeSMatthew G Knepley 2488e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2489cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal" 2490e6ccafaeSMatthew G Knepley /* 2491cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 2492e6ccafaeSMatthew G Knepley 2493e6ccafaeSMatthew G Knepley Not collective 2494e6ccafaeSMatthew G Knepley 2495e6ccafaeSMatthew G Knepley Input Parameters: 2496e6ccafaeSMatthew G Knepley + dm - The DMPlex 2497e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 2498e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 2499e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 2500e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 2501e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 2502e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 2503e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 2504e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 2505e6ccafaeSMatthew G Knepley 2506e6ccafaeSMatthew G Knepley Output Parameters: 2507e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 2508e6ccafaeSMatthew G Knepley 2509e6ccafaeSMatthew G Knepley Level: developer 2510e6ccafaeSMatthew G Knepley */ 2511cd0c2139SMatthew 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) 2512e6ccafaeSMatthew G Knepley { 251382f516ccSBarry Smith MPI_Comm comm; 2514e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 2515e6ccafaeSMatthew G Knepley const PetscInt *faces; 2516e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 2517e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2518e6ccafaeSMatthew G Knepley 2519e6ccafaeSMatthew G Knepley PetscFunctionBegin; 252082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2521e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 2522e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 2523e6ccafaeSMatthew G Knepley #if 0 2524e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 2525e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2526e6ccafaeSMatthew G Knepley #else 2527e6ccafaeSMatthew G Knepley { 2528e6ccafaeSMatthew G Knepley PetscInt f; 2529e6ccafaeSMatthew G Knepley 2530e6ccafaeSMatthew G Knepley numFaces = 0; 2531e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2532e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 2533e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 2534e6ccafaeSMatthew G Knepley 2535e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 2536e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 2537e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 2538e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 2539e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 2540e6ccafaeSMatthew G Knepley PetscInt v; 2541e6ccafaeSMatthew G Knepley 2542e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2543e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 2544e6ccafaeSMatthew G Knepley } 2545e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 2546e6ccafaeSMatthew G Knepley } 2547e6ccafaeSMatthew G Knepley if (d == dof) { 2548e6ccafaeSMatthew G Knepley numFaces = 1; 2549e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 2550e6ccafaeSMatthew G Knepley } 2551e6ccafaeSMatthew G Knepley } 2552e6ccafaeSMatthew G Knepley } 2553e6ccafaeSMatthew G Knepley #endif 2554e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 2555e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 2556e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 2557766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 2558e6ccafaeSMatthew G Knepley } else { 2559e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 2560e6ccafaeSMatthew G Knepley PetscBool posOriented; 2561e6ccafaeSMatthew G Knepley 2562e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2563e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 2564e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 2565e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 2566e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 2567e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 2568e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2569e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 2570e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 2571e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 2572e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 2573e6ccafaeSMatthew G Knepley break; 2574e6ccafaeSMatthew G Knepley } 2575e6ccafaeSMatthew G Knepley } 2576e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 2577e6ccafaeSMatthew G Knepley } 2578e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 2579e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 2580e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2581e6ccafaeSMatthew G Knepley ++(*newFacePoint); 2582e6ccafaeSMatthew G Knepley } 2583ef07cca7SMatthew G. Knepley #if 0 2584e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2585ef07cca7SMatthew G. Knepley #else 2586ef07cca7SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2587ef07cca7SMatthew G. Knepley #endif 2588e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2589e6ccafaeSMatthew G Knepley } 2590e6ccafaeSMatthew G Knepley 2591e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2592e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated" 259353156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2594e6ccafaeSMatthew G Knepley { 259582f516ccSBarry Smith MPI_Comm comm; 259653156dfcSMatthew G. Knepley DMLabel subpointMap; 2597efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 2598efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 2599efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 2600fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 2601efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 2602e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2603e6ccafaeSMatthew G Knepley 2604e6ccafaeSMatthew G Knepley PetscFunctionBegin; 260582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2606efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2607efa14ee0SMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2608efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2609efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 261053156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);} 2611efa14ee0SMatthew G Knepley /* Setup chart */ 2612efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2613efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2614efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2615efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2616e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2617e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 2618efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 2619e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 2620efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2621efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2622efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 2623efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2624e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2625e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2626e6ccafaeSMatthew G Knepley } 2627e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2628e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2629e6ccafaeSMatthew G Knepley } 2630e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2631e6ccafaeSMatthew G Knepley /* Create face cones */ 2632efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 26330298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2634efa14ee0SMatthew G Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2635e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2636e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 2637efa14ee0SMatthew G Knepley const PetscInt subcell = c; 26380298fd71SBarry Smith PetscInt *closure = NULL; 2639efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 2640e6ccafaeSMatthew G Knepley 2641e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2642efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2643efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 2644e6ccafaeSMatthew G Knepley PetscInt subVertex; 2645e6ccafaeSMatthew G Knepley 2646efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 2647efa14ee0SMatthew G Knepley ++numCorners; 2648efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 2649efa14ee0SMatthew G Knepley if (subVertex >= 0) { 2650efa14ee0SMatthew G Knepley closure[faceSize] = point; 265165560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 2652e6ccafaeSMatthew G Knepley ++faceSize; 2653e6ccafaeSMatthew G Knepley } 2654e6ccafaeSMatthew G Knepley } 2655e6ccafaeSMatthew G Knepley } 2656efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 2657efa14ee0SMatthew G Knepley if (faceSize == nFV) { 2658cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 2659e6ccafaeSMatthew G Knepley } 266065560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2661e6ccafaeSMatthew G Knepley } 2662efa14ee0SMatthew G Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2663e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2664e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2665e6ccafaeSMatthew G Knepley /* Build coordinates */ 2666efa14ee0SMatthew G Knepley { 2667efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 2668efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 2669efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 2670285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 267124640c55SToby Isaac const char *name; 2672efa14ee0SMatthew G Knepley 267369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2674e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 267569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2676285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2677285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2678285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2679efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2680efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2681efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2682efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2683efa14ee0SMatthew G Knepley PetscInt dof; 2684efa14ee0SMatthew G Knepley 2685efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2686efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2687285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2688e6ccafaeSMatthew G Knepley } 2689e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2690e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2691e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 269224640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 269324640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr); 2694e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 26952eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2696830e53efSMatthew G. Knepley if (coordSize) { 2697e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2698e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2699efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2700efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2701efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2702efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2703e6ccafaeSMatthew G Knepley 2704e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2705e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2706efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2707efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2708efa14ee0SMatthew 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); 2709e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2710e6ccafaeSMatthew G Knepley } 2711e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2712e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 27133b399e24SMatthew G. Knepley } 2714e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2715e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2716e6ccafaeSMatthew G Knepley } 2717efa14ee0SMatthew G Knepley /* Cleanup */ 2718efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2719efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2720efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2721efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2722e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2723e6ccafaeSMatthew G Knepley } 2724e6ccafaeSMatthew G Knepley 2725e6ccafaeSMatthew G Knepley #undef __FUNCT__ 27263982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal" 27273982b651SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 27283982b651SMatthew G. Knepley { 27293982b651SMatthew G. Knepley PetscInt subPoint; 27303982b651SMatthew G. Knepley PetscErrorCode ierr; 27313982b651SMatthew G. Knepley 27323982b651SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 27333982b651SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 27343982b651SMatthew G. Knepley } 27353982b651SMatthew G. Knepley 27363982b651SMatthew G. Knepley #undef __FUNCT__ 27373982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateSubmeshGeneric_Interpolated" 2738bec263e5SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmeshGeneric_Interpolated(DM dm, DMLabel label, PetscInt value, PetscBool isCohesive, PetscInt cellHeight, DM subdm) 2739e6ccafaeSMatthew G Knepley { 274082f516ccSBarry Smith MPI_Comm comm; 274153156dfcSMatthew G. Knepley DMLabel subpointMap; 2742efa14ee0SMatthew G Knepley IS *subpointIS; 2743efa14ee0SMatthew G Knepley const PetscInt **subpoints; 27443982b651SMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *orntNew; 2745efa14ee0SMatthew G Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2746e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2747e6ccafaeSMatthew G Knepley 2748e6ccafaeSMatthew G Knepley PetscFunctionBegin; 274982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2750efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2751e6ccafaeSMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2752efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2753bec263e5SMatthew G. Knepley if (cellHeight) { 27543982b651SMatthew G. Knepley if (isCohesive) {ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);} 27553982b651SMatthew G. Knepley else {ierr = DMPlexMarkSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);} 2756bec263e5SMatthew G. Knepley } else { 2757bec263e5SMatthew G. Knepley DMLabel depth; 2758bec263e5SMatthew G. Knepley IS pointIS; 2759bec263e5SMatthew G. Knepley const PetscInt *points; 2760bec263e5SMatthew G. Knepley PetscInt numPoints; 2761bec263e5SMatthew G. Knepley 2762bec263e5SMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depth);CHKERRQ(ierr); 2763bec263e5SMatthew G. Knepley ierr = DMLabelGetStratumSize(label, value, &numPoints);CHKERRQ(ierr); 2764bec263e5SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, value, &pointIS);CHKERRQ(ierr); 2765bec263e5SMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 2766bec263e5SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 2767bec263e5SMatthew G. Knepley PetscInt *closure = NULL; 2768bec263e5SMatthew G. Knepley PetscInt closureSize, c, pdim; 2769bec263e5SMatthew G. Knepley 2770bec263e5SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2771bec263e5SMatthew G. Knepley for (c = 0; c < closureSize*2; c += 2) { 2772bec263e5SMatthew G. Knepley ierr = DMLabelGetValue(depth, closure[c], &pdim);CHKERRQ(ierr); 2773bec263e5SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, closure[c], pdim);CHKERRQ(ierr); 2774bec263e5SMatthew G. Knepley } 2775bec263e5SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2776bec263e5SMatthew G. Knepley } 2777bec263e5SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 2778bec263e5SMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 2779bec263e5SMatthew G. Knepley } 2780bec263e5SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 2781efa14ee0SMatthew G Knepley /* Setup chart */ 2782c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2783dcca6d9dSJed Brown ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr); 2784e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2785e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2786e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 2787e6ccafaeSMatthew G Knepley } 2788e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2789bec263e5SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, cellHeight);CHKERRQ(ierr); 2790e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2791e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 2792e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2793e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2794e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2795e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2796e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 27970ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2798e6ccafaeSMatthew G Knepley } 2799e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2800e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2801e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2802e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2803e6ccafaeSMatthew G Knepley const PetscInt *cone; 2804e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 2805e6ccafaeSMatthew G Knepley 2806e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2807e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2808bec263e5SMatthew G. Knepley if (cellHeight && (d == dim)) { 2809e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2810e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2811e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2812e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 2813e6ccafaeSMatthew G Knepley } 2814e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2815e6ccafaeSMatthew G Knepley } 2816e6ccafaeSMatthew G Knepley } 2817e6ccafaeSMatthew G Knepley } 2818e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2819e6ccafaeSMatthew G Knepley /* Set cones */ 28200298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 28213982b651SMatthew G. Knepley ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&orntNew);CHKERRQ(ierr); 2822e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2823e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2824e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2825e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 28260e49e2e2SMatthew G. Knepley const PetscInt *cone, *ornt; 2827e6ccafaeSMatthew G Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2828e6ccafaeSMatthew G Knepley 2829e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2830e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2831e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 28320e49e2e2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2833e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2834e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 283501a2673eSMatthew G. Knepley if (subc >= 0) { 283601a2673eSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 28373982b651SMatthew G. Knepley orntNew[coneSizeNew] = ornt[c]; 283801a2673eSMatthew G. Knepley ++coneSizeNew; 283901a2673eSMatthew G. Knepley } 2840e6ccafaeSMatthew G Knepley } 2841e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2842e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 28433982b651SMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, orntNew);CHKERRQ(ierr); 2844e6ccafaeSMatthew G Knepley } 2845e6ccafaeSMatthew G Knepley } 28463982b651SMatthew G. Knepley ierr = PetscFree2(coneNew,orntNew);CHKERRQ(ierr); 2847e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2848e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2849e6ccafaeSMatthew G Knepley /* Build coordinates */ 2850e6ccafaeSMatthew G Knepley { 2851e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 2852e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 2853e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 2854285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 285524640c55SToby Isaac const char *name; 2856e6ccafaeSMatthew G Knepley 285769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2858e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 285969d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2860285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2861285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2862285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2863e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2864e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2865e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2866e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2867e6ccafaeSMatthew G Knepley PetscInt dof; 2868e6ccafaeSMatthew G Knepley 2869e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2870e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2871285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2872e6ccafaeSMatthew G Knepley } 2873e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2874e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2875e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 287624640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 287724640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr); 2878e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 28792eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2880e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2881e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2882e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2883e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2884e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2885e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2886e6ccafaeSMatthew G Knepley 2887e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2888e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2889e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2890e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2891e6ccafaeSMatthew 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); 2892efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2893e6ccafaeSMatthew G Knepley } 2894e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2895e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2896e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2897e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2898e6ccafaeSMatthew G Knepley } 28993982b651SMatthew G. Knepley /* Build SF: We need this complexity because subpoints might not be selected on the owning process */ 29003982b651SMatthew G. Knepley { 29013982b651SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 29023982b651SMatthew G. Knepley IS subpIS; 29033982b651SMatthew G. Knepley const PetscSFNode *remotePoints; 29043982b651SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 29053982b651SMatthew G. Knepley const PetscInt *localPoints, *subpoints; 29063982b651SMatthew G. Knepley PetscInt *slocalPoints; 29073982b651SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubpoints = 0, numSubroots, numSubleaves = 0, l, sl, ll, pStart, pEnd, p; 29083982b651SMatthew G. Knepley PetscMPIInt rank; 29093982b651SMatthew G. Knepley 29103982b651SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 29113982b651SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 29123982b651SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 29133982b651SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 29143982b651SMatthew G. Knepley ierr = DMPlexGetChart(subdm, NULL, &numSubroots);CHKERRQ(ierr); 29153982b651SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpIS);CHKERRQ(ierr); 29163982b651SMatthew G. Knepley if (subpIS) { 29173982b651SMatthew G. Knepley ierr = ISGetIndices(subpIS, &subpoints);CHKERRQ(ierr); 29183982b651SMatthew G. Knepley ierr = ISGetLocalSize(subpIS, &numSubpoints);CHKERRQ(ierr); 29193982b651SMatthew G. Knepley } 29203982b651SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 29213982b651SMatthew G. Knepley if (numRoots >= 0) { 29223982b651SMatthew G. Knepley ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 29233982b651SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 29243982b651SMatthew G. Knepley newLocalPoints[p].rank = -2; 29253982b651SMatthew G. Knepley newLocalPoints[p].index = -2; 29263982b651SMatthew G. Knepley } 29273982b651SMatthew G. Knepley /* Set subleaves */ 29283982b651SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 29293982b651SMatthew G. Knepley const PetscInt point = localPoints[l]; 29303982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 29313982b651SMatthew G. Knepley 29323982b651SMatthew G. Knepley if (subpoint < 0) continue; 29333982b651SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 29343982b651SMatthew G. Knepley newLocalPoints[point-pStart].index = subpoint; 29353982b651SMatthew G. Knepley ++numSubleaves; 29363982b651SMatthew G. Knepley } 29373982b651SMatthew G. Knepley /* Must put in owned subpoints */ 29383982b651SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 29393982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(p, 0, numSubpoints, subpoints); 29403982b651SMatthew G. Knepley 29413982b651SMatthew G. Knepley if (subpoint < 0) { 29423982b651SMatthew G. Knepley newOwners[p-pStart].rank = -3; 29433982b651SMatthew G. Knepley newOwners[p-pStart].index = -3; 29443982b651SMatthew G. Knepley } else { 29453982b651SMatthew G. Knepley newOwners[p-pStart].rank = rank; 29463982b651SMatthew G. Knepley newOwners[p-pStart].index = subpoint; 29473982b651SMatthew G. Knepley } 29483982b651SMatthew G. Knepley } 29493982b651SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 29503982b651SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 29513982b651SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 29523982b651SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 29533982b651SMatthew G. Knepley ierr = PetscMalloc1(numSubleaves, &slocalPoints);CHKERRQ(ierr); 29543982b651SMatthew G. Knepley ierr = PetscMalloc1(numSubleaves, &sremotePoints);CHKERRQ(ierr); 29553982b651SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 29563982b651SMatthew G. Knepley const PetscInt point = localPoints[l]; 29573982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 29583982b651SMatthew G. Knepley 29593982b651SMatthew G. Knepley if (subpoint < 0) continue; 29603982b651SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 29613982b651SMatthew G. Knepley slocalPoints[sl] = subpoint; 29623982b651SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 29633982b651SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 29643982b651SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 29653982b651SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 29663982b651SMatthew G. Knepley ++sl; 29673982b651SMatthew G. Knepley } 29683982b651SMatthew G. Knepley if (sl + ll != numSubleaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubleaves); 29693982b651SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 29703982b651SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubroots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 29713982b651SMatthew G. Knepley } 29723982b651SMatthew G. Knepley if (subpIS) { 29733982b651SMatthew G. Knepley ierr = ISRestoreIndices(subpIS, &subpoints);CHKERRQ(ierr); 29743982b651SMatthew G. Knepley ierr = ISDestroy(&subpIS);CHKERRQ(ierr); 29753982b651SMatthew G. Knepley } 29763982b651SMatthew G. Knepley } 2977efa14ee0SMatthew G Knepley /* Cleanup */ 2978e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 29790ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2980e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2981e6ccafaeSMatthew G Knepley } 2982efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2983e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2984e6ccafaeSMatthew G Knepley } 2985e6ccafaeSMatthew G Knepley 2986e6ccafaeSMatthew G Knepley #undef __FUNCT__ 29873982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated" 29883982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 29893982b651SMatthew G. Knepley { 29903982b651SMatthew G. Knepley PetscErrorCode ierr; 29913982b651SMatthew G. Knepley 29923982b651SMatthew G. Knepley PetscFunctionBegin; 2993bec263e5SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, vertexLabel, value, PETSC_FALSE, 1, subdm);CHKERRQ(ierr); 29943982b651SMatthew G. Knepley PetscFunctionReturn(0); 29953982b651SMatthew G. Knepley } 29963982b651SMatthew G. Knepley 29973982b651SMatthew G. Knepley #undef __FUNCT__ 2998e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh" 2999d0fa310fSMatthew G. Knepley /*@ 3000e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 3001e6ccafaeSMatthew G Knepley 3002e6ccafaeSMatthew G Knepley Input Parameters: 3003e6ccafaeSMatthew G Knepley + dm - The original mesh 3004830e53efSMatthew G. Knepley . vertexLabel - The DMLabel marking vertices contained in the surface 3005830e53efSMatthew G. Knepley - value - The label value to use 3006e6ccafaeSMatthew G Knepley 3007e6ccafaeSMatthew G Knepley Output Parameter: 3008e6ccafaeSMatthew G Knepley . subdm - The surface mesh 3009e6ccafaeSMatthew G Knepley 3010e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3011e6ccafaeSMatthew G Knepley 3012e6ccafaeSMatthew G Knepley Level: developer 3013e6ccafaeSMatthew G Knepley 3014c58f1c22SToby Isaac .seealso: DMPlexGetSubpointMap(), DMGetLabel(), DMLabelSetValue() 3015830e53efSMatthew G. Knepley @*/ 301653156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm) 3017e6ccafaeSMatthew G Knepley { 3018e6ccafaeSMatthew G Knepley PetscInt dim, depth; 3019e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3020e6ccafaeSMatthew G Knepley 3021e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3022e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3023766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 3024c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3025e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 302682f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 3027e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3028c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr); 3029e6ccafaeSMatthew G Knepley if (depth == dim) { 3030830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 3031e6ccafaeSMatthew G Knepley } else { 3032830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 3033e6ccafaeSMatthew G Knepley } 3034e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3035e6ccafaeSMatthew G Knepley } 3036e6ccafaeSMatthew G Knepley 3037e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3038766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated" 303927c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 3040766ab985SMatthew G. Knepley { 3041766ab985SMatthew G. Knepley MPI_Comm comm; 3042766ab985SMatthew G. Knepley DMLabel subpointMap; 3043766ab985SMatthew G. Knepley IS subvertexIS; 3044766ab985SMatthew G. Knepley const PetscInt *subVertices; 3045fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 3046766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 304787feddfdSMatthew G. Knepley PetscInt cMax, c, f; 3048766ab985SMatthew G. Knepley PetscErrorCode ierr; 3049766ab985SMatthew G. Knepley 3050766ab985SMatthew G. Knepley PetscFunctionBegin; 3051766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 3052766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 3053766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 3054766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 3055766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 305627c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 3057766ab985SMatthew G. Knepley /* Setup chart */ 3058766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 3059766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 3060766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 3061766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 3062766ab985SMatthew G. Knepley /* Set cone sizes */ 3063766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 3064766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 3065766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 3066766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 3067766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 3068766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 3069766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 3070766ab985SMatthew G. Knepley } 3071766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 3072766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 3073766ab985SMatthew G. Knepley } 3074766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 3075766ab985SMatthew G. Knepley /* Create face cones */ 3076766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 307787feddfdSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 3078766ab985SMatthew G. Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 3079766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 3080766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 3081766ab985SMatthew G. Knepley const PetscInt subcell = c; 308287feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 308387feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 3084766ab985SMatthew G. Knepley 308587feddfdSMatthew G. Knepley if (cell < cMax) continue; 308687feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 308787feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 308887feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 308987feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 309087feddfdSMatthew G. Knepley } 309187feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 309287feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 309387feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 309427234c99SMatthew G. Knepley /* Not true in parallel 309527234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 309687feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 309787feddfdSMatthew G. Knepley PetscInt negsubcell; 3098766ab985SMatthew G. Knepley 309987feddfdSMatthew G. Knepley if (cells[p] >= cMax) continue; 310087feddfdSMatthew G. Knepley /* I know this is a crap search */ 310187feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 310287feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 3103766ab985SMatthew G. Knepley } 310487feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 310587feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 3106766ab985SMatthew G. Knepley } 310787feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 310887feddfdSMatthew G. Knepley ++newFacePoint; 3109766ab985SMatthew G. Knepley } 3110766ab985SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 3111766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 3112766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 3113766ab985SMatthew G. Knepley /* Build coordinates */ 3114766ab985SMatthew G. Knepley { 3115766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 3116766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 3117766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 3118285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 311924640c55SToby Isaac const char *name; 3120766ab985SMatthew G. Knepley 312169d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3122766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 312369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 3124285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 3125285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 3126285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 3127766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 3128766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 3129766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 3130766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 3131766ab985SMatthew G. Knepley PetscInt dof; 3132766ab985SMatthew G. Knepley 3133766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3134766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 3135285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 3136766ab985SMatthew G. Knepley } 3137766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 3138766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 3139766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 314024640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 314124640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr); 3142766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 31432eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 3144766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 3145766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3146766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 3147766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 3148766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 3149766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 3150766ab985SMatthew G. Knepley 3151766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3152766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 3153766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 3154766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 3155766ab985SMatthew 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); 3156766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 3157766ab985SMatthew G. Knepley } 3158766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3159766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3160766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 3161766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 3162766ab985SMatthew G. Knepley } 3163aca35d17SMatthew G. Knepley /* Build SF */ 3164aca35d17SMatthew G. Knepley CHKMEMQ; 3165aca35d17SMatthew G. Knepley { 3166aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 3167aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 3168bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 3169aca35d17SMatthew G. Knepley const PetscInt *localPoints; 3170bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 317149c26ae4SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 3172bdcf2095SMatthew G. Knepley PetscMPIInt rank; 3173aca35d17SMatthew G. Knepley 3174bdcf2095SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 3175aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 3176aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 3177aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3178aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3179aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 3180aca35d17SMatthew G. Knepley if (numRoots >= 0) { 3181aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 3182dcca6d9dSJed Brown ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 3183bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 3184bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 3185bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 3186bdcf2095SMatthew G. Knepley } 31879e0823b2SMatthew G. Knepley /* Set subleaves */ 3188aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 3189aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 3190bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 3191aca35d17SMatthew G. Knepley 3192aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 3193bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 3194bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 3195bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 3196bdcf2095SMatthew G. Knepley ++numSubLeaves; 3197aca35d17SMatthew G. Knepley } 31989e0823b2SMatthew G. Knepley /* Must put in owned subpoints */ 31999e0823b2SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 32009e0823b2SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 32019e0823b2SMatthew G. Knepley 32029e0823b2SMatthew G. Knepley if (subPoint < 0) { 32039e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = -3; 32049e0823b2SMatthew G. Knepley newOwners[p-pStart].index = -3; 32059e0823b2SMatthew G. Knepley } else { 32069e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = rank; 32079e0823b2SMatthew G. Knepley newOwners[p-pStart].index = subPoint; 32089e0823b2SMatthew G. Knepley } 3209bdcf2095SMatthew G. Knepley } 3210bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3211bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3212bdcf2095SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3213bdcf2095SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3214785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &slocalPoints);CHKERRQ(ierr); 3215785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &sremotePoints);CHKERRQ(ierr); 321649c26ae4SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 3217bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 3218bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 3219aca35d17SMatthew G. Knepley 3220aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 322149c26ae4SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 3222aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 3223bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 3224bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 3225bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 3226bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 3227aca35d17SMatthew G. Knepley ++sl; 3228aca35d17SMatthew G. Knepley } 3229bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 323049c26ae4SMatthew G. Knepley if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 323149c26ae4SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 3232aca35d17SMatthew G. Knepley } 3233aca35d17SMatthew G. Knepley } 3234aca35d17SMatthew G. Knepley CHKMEMQ; 3235766ab985SMatthew G. Knepley /* Cleanup */ 3236766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 3237766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 3238766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 3239766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3240766ab985SMatthew G. Knepley } 3241766ab985SMatthew G. Knepley 3242766ab985SMatthew G. Knepley #undef __FUNCT__ 3243766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated" 32443982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DM subdm) 3245766ab985SMatthew G. Knepley { 32463982b651SMatthew G. Knepley DMLabel label = NULL; 3247766ab985SMatthew G. Knepley PetscErrorCode ierr; 3248766ab985SMatthew G. Knepley 3249766ab985SMatthew G. Knepley PetscFunctionBegin; 3250c58f1c22SToby Isaac if (labelname) {ierr = DMGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 3251bec263e5SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, label, value, PETSC_TRUE, 1, subdm);CHKERRQ(ierr); 3252766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3253766ab985SMatthew G. Knepley } 3254766ab985SMatthew G. Knepley 3255766ab985SMatthew G. Knepley #undef __FUNCT__ 3256766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh" 3257766ab985SMatthew G. Knepley /* 325827c04023SMatthew 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. 3259766ab985SMatthew G. Knepley 3260766ab985SMatthew G. Knepley Input Parameters: 3261766ab985SMatthew G. Knepley + dm - The original mesh 326227c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 32637afc1a8bSJed Brown . label - A label name, or NULL 326427c04023SMatthew G. Knepley - value - A label value 3265766ab985SMatthew G. Knepley 3266766ab985SMatthew G. Knepley Output Parameter: 3267766ab985SMatthew G. Knepley . subdm - The surface mesh 3268766ab985SMatthew G. Knepley 3269766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3270766ab985SMatthew G. Knepley 3271766ab985SMatthew G. Knepley Level: developer 3272766ab985SMatthew G. Knepley 3273766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 3274766ab985SMatthew G. Knepley */ 327527c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 3276766ab985SMatthew G. Knepley { 3277766ab985SMatthew G. Knepley PetscInt dim, depth; 3278766ab985SMatthew G. Knepley PetscErrorCode ierr; 3279766ab985SMatthew G. Knepley 3280766ab985SMatthew G. Knepley PetscFunctionBegin; 3281766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 328227c04023SMatthew G. Knepley PetscValidPointer(subdm, 5); 3283c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3284766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3285766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 3286766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3287c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr); 3288766ab985SMatthew G. Knepley if (depth == dim) { 3289b3154360SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr); 3290766ab985SMatthew G. Knepley } else { 329127c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 3292e6ccafaeSMatthew G Knepley } 3293e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3294e6ccafaeSMatthew G Knepley } 3295e6ccafaeSMatthew G Knepley 3296e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3297bec263e5SMatthew G. Knepley #define __FUNCT__ "DMPlexFilter" 3298bec263e5SMatthew G. Knepley /*@ 3299bec263e5SMatthew G. Knepley DMPlexFilter - Extract a subset of mesh cells defined by a label as a separate mesh 3300bec263e5SMatthew G. Knepley 3301bec263e5SMatthew G. Knepley Input Parameters: 3302bec263e5SMatthew G. Knepley + dm - The original mesh 3303bec263e5SMatthew G. Knepley . cellLabel - The DMLabel marking cells contained in the new mesh 3304bec263e5SMatthew G. Knepley - value - The label value to use 3305bec263e5SMatthew G. Knepley 3306bec263e5SMatthew G. Knepley Output Parameter: 3307bec263e5SMatthew G. Knepley . subdm - The new mesh 3308bec263e5SMatthew G. Knepley 3309bec263e5SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3310bec263e5SMatthew G. Knepley 3311bec263e5SMatthew G. Knepley Level: developer 3312bec263e5SMatthew G. Knepley 3313c58f1c22SToby Isaac .seealso: DMPlexGetSubpointMap(), DMGetLabel(), DMLabelSetValue() 3314bec263e5SMatthew G. Knepley @*/ 3315bec263e5SMatthew G. Knepley PetscErrorCode DMPlexFilter(DM dm, DMLabel cellLabel, PetscInt value, DM *subdm) 3316bec263e5SMatthew G. Knepley { 3317bec263e5SMatthew G. Knepley PetscInt dim; 3318bec263e5SMatthew G. Knepley PetscErrorCode ierr; 3319bec263e5SMatthew G. Knepley 3320bec263e5SMatthew G. Knepley PetscFunctionBegin; 3321bec263e5SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3322bec263e5SMatthew G. Knepley PetscValidPointer(subdm, 3); 3323bec263e5SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3324bec263e5SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject) dm), subdm);CHKERRQ(ierr); 3325bec263e5SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3326bec263e5SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim);CHKERRQ(ierr); 3327bec263e5SMatthew G. Knepley /* Extract submesh in place, could be empty on some procs, could have inconsistency if procs do not both extract a shared cell */ 3328bec263e5SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, cellLabel, value, PETSC_FALSE, 0, *subdm);CHKERRQ(ierr); 3329bec263e5SMatthew G. Knepley PetscFunctionReturn(0); 3330bec263e5SMatthew G. Knepley } 3331bec263e5SMatthew G. Knepley 3332bec263e5SMatthew G. Knepley #undef __FUNCT__ 3333e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap" 333464beef6dSMatthew G. Knepley /*@ 333564beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 333664beef6dSMatthew G. Knepley 333764beef6dSMatthew G. Knepley Input Parameter: 333864beef6dSMatthew G. Knepley . dm - The submesh DM 333964beef6dSMatthew G. Knepley 334064beef6dSMatthew G. Knepley Output Parameter: 334164beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 334264beef6dSMatthew G. Knepley 334364beef6dSMatthew G. Knepley Level: developer 334464beef6dSMatthew G. Knepley 334564beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 334664beef6dSMatthew G. Knepley @*/ 3347e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 3348e6ccafaeSMatthew G Knepley { 3349e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3350e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3351e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 335265663942SMatthew G. Knepley *subpointMap = ((DM_Plex*) dm->data)->subpointMap; 3353e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3354e6ccafaeSMatthew G Knepley } 3355e6ccafaeSMatthew G Knepley 3356e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3357e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap" 3358e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */ 3359e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 3360e6ccafaeSMatthew G Knepley { 3361e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 3362285d324eSMatthew G. Knepley DMLabel tmp; 3363e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3364e6ccafaeSMatthew G Knepley 3365e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3366e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3367285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 3368e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 3369285d324eSMatthew G. Knepley ++mesh->subpointMap->refct; 3370285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 3371e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3372e6ccafaeSMatthew G Knepley } 3373e6ccafaeSMatthew G Knepley 3374e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3375e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS" 337664beef6dSMatthew G. Knepley /*@ 3377e6ccafaeSMatthew G Knepley DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 3378e6ccafaeSMatthew G Knepley 3379e6ccafaeSMatthew G Knepley Input Parameter: 3380e6ccafaeSMatthew G Knepley . dm - The submesh DM 3381e6ccafaeSMatthew G Knepley 3382e6ccafaeSMatthew G Knepley Output Parameter: 33830298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 3384e6ccafaeSMatthew G Knepley 33853982b651SMatthew G. Knepley Note: This IS is guaranteed to be sorted by the construction of the submesh 338664beef6dSMatthew G. Knepley 338764beef6dSMatthew G. Knepley Level: developer 338864beef6dSMatthew G. Knepley 338964beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 339064beef6dSMatthew G. Knepley @*/ 3391e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 3392e6ccafaeSMatthew G Knepley { 339382f516ccSBarry Smith MPI_Comm comm; 3394e6ccafaeSMatthew G Knepley DMLabel subpointMap; 3395e6ccafaeSMatthew G Knepley IS is; 3396e6ccafaeSMatthew G Knepley const PetscInt *opoints; 3397e6ccafaeSMatthew G Knepley PetscInt *points, *depths; 3398e6ccafaeSMatthew G Knepley PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 3399e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3400e6ccafaeSMatthew G Knepley 3401e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3402e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3403e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 340482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 34050298fd71SBarry Smith *subpointIS = NULL; 3406e6ccafaeSMatthew G Knepley ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 3407e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3408fed694aaSMatthew G. Knepley if (subpointMap && depth >= 0) { 3409e6ccafaeSMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3410e6ccafaeSMatthew G Knepley if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 3411e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3412e6ccafaeSMatthew G Knepley depths[0] = depth; 3413e6ccafaeSMatthew G Knepley depths[1] = 0; 3414e6ccafaeSMatthew G Knepley for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 3415785e854fSJed Brown ierr = PetscMalloc1(pEnd, &points);CHKERRQ(ierr); 3416e6ccafaeSMatthew G Knepley for(d = 0, off = 0; d <= depth; ++d) { 3417e6ccafaeSMatthew G Knepley const PetscInt dep = depths[d]; 3418e6ccafaeSMatthew G Knepley 3419e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 3420e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 34211e21b6fdSMatthew G Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 3422e6ccafaeSMatthew 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); 3423e6ccafaeSMatthew G Knepley } else { 34241e21b6fdSMatthew G Knepley if (!n) { 34251e21b6fdSMatthew G Knepley if (d == 0) { 34261e21b6fdSMatthew G Knepley /* Missing cells */ 34271e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 34281e21b6fdSMatthew G Knepley } else { 34291e21b6fdSMatthew G Knepley /* Missing faces */ 34301e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 34311e21b6fdSMatthew G Knepley } 34321e21b6fdSMatthew G Knepley } 3433e6ccafaeSMatthew G Knepley } 3434e6ccafaeSMatthew G Knepley if (n) { 3435e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 3436e6ccafaeSMatthew G Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 3437e6ccafaeSMatthew G Knepley for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 3438e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 3439e6ccafaeSMatthew G Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 3440e6ccafaeSMatthew G Knepley } 3441e6ccafaeSMatthew G Knepley } 3442e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3443e6ccafaeSMatthew G Knepley if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 3444fed694aaSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 3445e6ccafaeSMatthew G Knepley } 3446e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3447e6ccafaeSMatthew G Knepley } 3448