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__ 51b0bf5782SToby Isaac #define __FUNCT__ "DMPlexLabelComplete_Internal" 52b0bf5782SToby Isaac PetscErrorCode DMPlexLabelComplete_Internal(DM dm, DMLabel label, PetscBool completeCells) 53b0bf5782SToby Isaac { 54b0bf5782SToby Isaac IS valueIS; 55b0bf5782SToby Isaac const PetscInt *values; 56b0bf5782SToby Isaac PetscInt numValues, v, cStart, cEnd; 57b0bf5782SToby Isaac PetscErrorCode ierr; 58b0bf5782SToby Isaac 59b0bf5782SToby Isaac PetscFunctionBegin; 60b0bf5782SToby Isaac ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 61b0bf5782SToby Isaac ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 62b0bf5782SToby Isaac ierr = DMPlexGetHeightStratum(dm,0,&cStart,&cEnd);CHKERRQ(ierr); 63b0bf5782SToby Isaac ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 64b0bf5782SToby Isaac for (v = 0; v < numValues; ++v) { 65b0bf5782SToby Isaac IS pointIS; 66b0bf5782SToby Isaac const PetscInt *points; 67b0bf5782SToby Isaac PetscInt numPoints, p; 68b0bf5782SToby Isaac 69b0bf5782SToby Isaac ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 70b0bf5782SToby Isaac ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 71b0bf5782SToby Isaac ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 72b0bf5782SToby Isaac for (p = 0; p < numPoints; ++p) { 73b0bf5782SToby Isaac PetscInt q = points[p]; 74b0bf5782SToby Isaac PetscInt *closure = NULL; 75b0bf5782SToby Isaac PetscInt closureSize, c; 76b0bf5782SToby Isaac 77b0bf5782SToby Isaac if (cStart <= q && q < cEnd && !completeCells) { /* skip cells */ 78b0bf5782SToby Isaac continue; 79b0bf5782SToby Isaac } 80b0bf5782SToby Isaac ierr = DMPlexGetTransitiveClosure(dm, q, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 81b0bf5782SToby Isaac for (c = 0; c < closureSize*2; c += 2) { 82b0bf5782SToby Isaac ierr = DMLabelSetValue(label, closure[c], values[v]);CHKERRQ(ierr); 83b0bf5782SToby Isaac } 84b0bf5782SToby Isaac ierr = DMPlexRestoreTransitiveClosure(dm, q, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 85b0bf5782SToby Isaac } 86b0bf5782SToby Isaac ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 87b0bf5782SToby Isaac ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 88b0bf5782SToby Isaac } 89b0bf5782SToby Isaac ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 90b0bf5782SToby Isaac ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 91b0bf5782SToby Isaac PetscFunctionReturn(0); 92b0bf5782SToby Isaac } 93b0bf5782SToby Isaac 94b0bf5782SToby 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; 115b0bf5782SToby 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; 327*f2b8cce1SMatthew G. Knepley PetscInt coordSize, sStart, sEnd; 328*f2b8cce1SMatthew G. Knepley PetscInt dim, depth = 0, cStart, cEnd, cStartNew, cEndNew, c, vStart, vEnd, vStartNew, vEndNew, v; 329*f2b8cce1SMatthew G. Knepley PetscBool hasCells; 330cd0c2139SMatthew G Knepley PetscErrorCode ierr; 331cd0c2139SMatthew G Knepley 332cd0c2139SMatthew G Knepley PetscFunctionBegin; 333*f2b8cce1SMatthew G. Knepley ierr = DMGetCoordinateDim(dm, &dim);CHKERRQ(ierr); 334cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 335cd0c2139SMatthew G Knepley /* Step 8: Convert coordinates */ 336cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 337*f2b8cce1SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 338cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr); 339*f2b8cce1SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dmNew, 0, &cStartNew, &cEndNew);CHKERRQ(ierr); 34069d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 341cd0c2139SMatthew G Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr); 342cd0c2139SMatthew G Knepley ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr); 343cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr); 344*f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetChart(coordSection, &sStart, &sEnd);CHKERRQ(ierr); 345*f2b8cce1SMatthew G. Knepley hasCells = sStart == cStart ? PETSC_TRUE : PETSC_FALSE; 346*f2b8cce1SMatthew G. Knepley ierr = PetscSectionSetChart(newCoordSection, hasCells ? cStartNew : vStartNew, vEndNew);CHKERRQ(ierr); 347*f2b8cce1SMatthew G. Knepley if (hasCells) { 348*f2b8cce1SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 349*f2b8cce1SMatthew G. Knepley PetscInt cNew = DMPlexShiftPoint_Internal(c, depth, depthShift), dof; 350*f2b8cce1SMatthew G. Knepley 351*f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, c, &dof);CHKERRQ(ierr); 352*f2b8cce1SMatthew G. Knepley ierr = PetscSectionSetDof(newCoordSection, cNew, dof);CHKERRQ(ierr); 353*f2b8cce1SMatthew G. Knepley ierr = PetscSectionSetFieldDof(newCoordSection, cNew, 0, dof);CHKERRQ(ierr); 354*f2b8cce1SMatthew G. Knepley } 355*f2b8cce1SMatthew G. Knepley } 356cd0c2139SMatthew G Knepley for (v = vStartNew; v < vEndNew; ++v) { 357cd0c2139SMatthew G Knepley ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr); 358cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr); 359cd0c2139SMatthew G Knepley } 360cd0c2139SMatthew G Knepley ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr); 36146e270d4SMatthew G. Knepley ierr = DMSetCoordinateSection(dmNew, PETSC_DETERMINE, newCoordSection);CHKERRQ(ierr); 362cd0c2139SMatthew G Knepley ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr); 363cd0c2139SMatthew G Knepley ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr); 364cd0c2139SMatthew G Knepley ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr); 365cd0c2139SMatthew G Knepley ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 3664e90ef8eSMatthew G. Knepley ierr = VecSetBlockSize(newCoordinates, dim);CHKERRQ(ierr); 3672eb5907fSJed Brown ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr); 368cd0c2139SMatthew G Knepley ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr); 369cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 370cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 371cd0c2139SMatthew G Knepley ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr); 372*f2b8cce1SMatthew G. Knepley if (hasCells) { 373*f2b8cce1SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 374*f2b8cce1SMatthew G. Knepley PetscInt cNew = DMPlexShiftPoint_Internal(c, depth, depthShift), dof, off, noff, d; 375*f2b8cce1SMatthew G. Knepley 376*f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, c, &dof);CHKERRQ(ierr); 377*f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, c, &off);CHKERRQ(ierr); 378*f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetOffset(newCoordSection, cNew, &noff);CHKERRQ(ierr); 379*f2b8cce1SMatthew G. Knepley for (d = 0; d < dof; ++d) newCoords[noff+d] = coords[off+d]; 380*f2b8cce1SMatthew G. Knepley } 381*f2b8cce1SMatthew G. Knepley } 382cd0c2139SMatthew G Knepley for (v = vStart; v < vEnd; ++v) { 383cd0c2139SMatthew G Knepley PetscInt dof, off, noff, d; 384cd0c2139SMatthew G Knepley 385cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 386cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3872582d50cSToby Isaac ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthShift), &noff);CHKERRQ(ierr); 388*f2b8cce1SMatthew G. Knepley for (d = 0; d < dof; ++d) newCoords[noff+d] = coords[off+d]; 389cd0c2139SMatthew G Knepley } 390cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 391cd0c2139SMatthew G Knepley ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr); 392cd0c2139SMatthew G Knepley ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 393cd0c2139SMatthew G Knepley ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr); 394cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 395cd0c2139SMatthew G Knepley } 396cd0c2139SMatthew G Knepley 397cd0c2139SMatthew G Knepley #undef __FUNCT__ 398cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal" 399cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew) 400cd0c2139SMatthew G Knepley { 4012582d50cSToby Isaac PetscInt depth = 0; 402cd0c2139SMatthew G Knepley PetscSF sfPoint, sfPointNew; 403cd0c2139SMatthew G Knepley const PetscSFNode *remotePoints; 404cd0c2139SMatthew G Knepley PetscSFNode *gremotePoints; 405cd0c2139SMatthew G Knepley const PetscInt *localPoints; 406cd0c2139SMatthew G Knepley PetscInt *glocalPoints, *newLocation, *newRemoteLocation; 407cd0c2139SMatthew G Knepley PetscInt numRoots, numLeaves, l, pStart, pEnd, totShift = 0; 408cd0c2139SMatthew G Knepley PetscErrorCode ierr; 409cd0c2139SMatthew G Knepley 410cd0c2139SMatthew G Knepley PetscFunctionBegin; 411cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 412cd0c2139SMatthew G Knepley /* Step 9: Convert pointSF */ 413cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 414cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr); 415cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 416cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 4176e21efdcSToby Isaac totShift = DMPlexShiftPoint_Internal(pEnd,depth,depthShift) - pEnd; 418cd0c2139SMatthew G Knepley if (numRoots >= 0) { 419dcca6d9dSJed Brown ierr = PetscMalloc2(numRoots,&newLocation,pEnd-pStart,&newRemoteLocation);CHKERRQ(ierr); 4202582d50cSToby Isaac for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthShift); 421cd0c2139SMatthew G Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 422cd0c2139SMatthew G Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 423785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &glocalPoints);CHKERRQ(ierr); 424785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &gremotePoints);CHKERRQ(ierr); 425cd0c2139SMatthew G Knepley for (l = 0; l < numLeaves; ++l) { 4262582d50cSToby Isaac glocalPoints[l] = DMPlexShiftPoint_Internal(localPoints[l], depth, depthShift); 427cd0c2139SMatthew G Knepley gremotePoints[l].rank = remotePoints[l].rank; 428cd0c2139SMatthew G Knepley gremotePoints[l].index = newRemoteLocation[localPoints[l]]; 429cd0c2139SMatthew G Knepley } 430cd0c2139SMatthew G Knepley ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr); 431cd0c2139SMatthew G Knepley ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 432cd0c2139SMatthew G Knepley } 433cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 434cd0c2139SMatthew G Knepley } 435cd0c2139SMatthew G Knepley 436cd0c2139SMatthew G Knepley #undef __FUNCT__ 437cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal" 438cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew) 439cd0c2139SMatthew G Knepley { 440cd0c2139SMatthew G Knepley PetscSF sfPoint; 441cd0c2139SMatthew G Knepley DMLabel vtkLabel, ghostLabel; 442cd0c2139SMatthew G Knepley const PetscSFNode *leafRemote; 443cd0c2139SMatthew G Knepley const PetscInt *leafLocal; 4442582d50cSToby Isaac PetscInt depth = 0, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f; 445cd0c2139SMatthew G Knepley PetscMPIInt rank; 446cd0c2139SMatthew G Knepley PetscErrorCode ierr; 447cd0c2139SMatthew G Knepley 448cd0c2139SMatthew G Knepley PetscFunctionBegin; 449cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 450cd0c2139SMatthew G Knepley /* Step 10: Convert labels */ 451c58f1c22SToby Isaac ierr = DMGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 452cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 453cd0c2139SMatthew G Knepley DMLabel label, newlabel; 454cd0c2139SMatthew G Knepley const char *lname; 455cd0c2139SMatthew G Knepley PetscBool isDepth; 456cd0c2139SMatthew G Knepley IS valueIS; 457cd0c2139SMatthew G Knepley const PetscInt *values; 458cd0c2139SMatthew G Knepley PetscInt numValues, val; 459cd0c2139SMatthew G Knepley 460c58f1c22SToby Isaac ierr = DMGetLabelName(dm, l, &lname);CHKERRQ(ierr); 461cd0c2139SMatthew G Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 462cd0c2139SMatthew G Knepley if (isDepth) continue; 463c58f1c22SToby Isaac ierr = DMCreateLabel(dmNew, lname);CHKERRQ(ierr); 464c58f1c22SToby Isaac ierr = DMGetLabel(dm, lname, &label);CHKERRQ(ierr); 465c58f1c22SToby Isaac ierr = DMGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr); 46664a6a1a4SToby Isaac ierr = DMLabelGetDefaultValue(label,&val);CHKERRQ(ierr); 46764a6a1a4SToby Isaac ierr = DMLabelSetDefaultValue(newlabel,val);CHKERRQ(ierr); 468cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 469cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 470cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 471cd0c2139SMatthew G Knepley for (val = 0; val < numValues; ++val) { 472cd0c2139SMatthew G Knepley IS pointIS; 473cd0c2139SMatthew G Knepley const PetscInt *points; 474cd0c2139SMatthew G Knepley PetscInt numPoints, p; 475cd0c2139SMatthew G Knepley 476cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 477cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 478cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 479cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 4802582d50cSToby Isaac const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthShift); 481cd0c2139SMatthew G Knepley 482cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr); 483cd0c2139SMatthew G Knepley } 484cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 485cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 486cd0c2139SMatthew G Knepley } 487cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 488cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 489cd0c2139SMatthew G Knepley } 490cd0c2139SMatthew G Knepley /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */ 491cd0c2139SMatthew G Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 492cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 493cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 494cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr); 495c58f1c22SToby Isaac ierr = DMCreateLabel(dmNew, "vtk");CHKERRQ(ierr); 496c58f1c22SToby Isaac ierr = DMCreateLabel(dmNew, "ghost");CHKERRQ(ierr); 497c58f1c22SToby Isaac ierr = DMGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr); 498c58f1c22SToby Isaac ierr = DMGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr); 499cd0c2139SMatthew G Knepley for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { 500cd0c2139SMatthew G Knepley for (; c < leafLocal[l] && c < cEnd; ++c) { 501cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 502cd0c2139SMatthew G Knepley } 503cd0c2139SMatthew G Knepley if (leafLocal[l] >= cEnd) break; 504cd0c2139SMatthew G Knepley if (leafRemote[l].rank == rank) { 505cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 506cd0c2139SMatthew G Knepley } else { 507cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr); 508cd0c2139SMatthew G Knepley } 509cd0c2139SMatthew G Knepley } 510cd0c2139SMatthew G Knepley for (; c < cEnd; ++c) { 511cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 512cd0c2139SMatthew G Knepley } 513cd0c2139SMatthew G Knepley if (0) { 514cd0c2139SMatthew G Knepley ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 515cd0c2139SMatthew G Knepley } 516cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr); 517cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 518cd0c2139SMatthew G Knepley PetscInt numCells; 519cd0c2139SMatthew G Knepley 520cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr); 521cd0c2139SMatthew G Knepley if (numCells < 2) { 522cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr); 523cd0c2139SMatthew G Knepley } else { 524cd0c2139SMatthew G Knepley const PetscInt *cells = NULL; 525cd0c2139SMatthew G Knepley PetscInt vA, vB; 526cd0c2139SMatthew G Knepley 527cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr); 528cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr); 529cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr); 530cd0c2139SMatthew G Knepley if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);} 531cd0c2139SMatthew G Knepley } 532cd0c2139SMatthew G Knepley } 533cd0c2139SMatthew G Knepley if (0) { 534cd0c2139SMatthew G Knepley ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 535cd0c2139SMatthew G Knepley } 536cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 537cd0c2139SMatthew G Knepley } 538cd0c2139SMatthew G Knepley 539cd0c2139SMatthew G Knepley #undef __FUNCT__ 540ca04dac2SToby Isaac #define __FUNCT__ "DMPlexShiftTree_Internal" 541ca04dac2SToby Isaac static PetscErrorCode DMPlexShiftTree_Internal(DM dm, PetscInt depthShift[], DM dmNew) 542ca04dac2SToby Isaac { 543ca04dac2SToby Isaac DM refTree; 544ca04dac2SToby Isaac PetscSection pSec; 545ca04dac2SToby Isaac PetscInt *parents, *childIDs; 546ca04dac2SToby Isaac PetscErrorCode ierr; 547ca04dac2SToby Isaac 548ca04dac2SToby Isaac PetscFunctionBegin; 549ca04dac2SToby Isaac ierr = DMPlexGetReferenceTree(dm,&refTree);CHKERRQ(ierr); 550ca04dac2SToby Isaac ierr = DMPlexSetReferenceTree(dmNew,refTree);CHKERRQ(ierr); 551ca04dac2SToby Isaac ierr = DMPlexGetTree(dm,&pSec,&parents,&childIDs,NULL,NULL);CHKERRQ(ierr); 552ca04dac2SToby Isaac if (pSec) { 5532582d50cSToby Isaac PetscInt p, pStart, pEnd, *parentsShifted, pStartShifted, pEndShifted, depth; 554fb4630b5SToby Isaac PetscInt *childIDsShifted; 555ca04dac2SToby Isaac PetscSection pSecShifted; 556ca04dac2SToby Isaac 557ca04dac2SToby Isaac ierr = PetscSectionGetChart(pSec,&pStart,&pEnd);CHKERRQ(ierr); 558ca04dac2SToby Isaac ierr = DMPlexGetDepth(dm,&depth);CHKERRQ(ierr); 5592582d50cSToby Isaac pStartShifted = DMPlexShiftPoint_Internal(pStart,depth,depthShift); 5602582d50cSToby Isaac pEndShifted = DMPlexShiftPoint_Internal(pEnd,depth,depthShift); 561fb4630b5SToby Isaac ierr = PetscMalloc2(pEndShifted - pStartShifted,&parentsShifted,pEndShifted-pStartShifted,&childIDsShifted);CHKERRQ(ierr); 562ca04dac2SToby Isaac ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dmNew),&pSecShifted);CHKERRQ(ierr); 563ca04dac2SToby Isaac ierr = PetscSectionSetChart(pSecShifted,pStartShifted,pEndShifted);CHKERRQ(ierr); 564ca04dac2SToby Isaac for (p = pStartShifted; p < pEndShifted; p++) { 565fb4630b5SToby Isaac /* start off assuming no children */ 566fb4630b5SToby Isaac ierr = PetscSectionSetDof(pSecShifted,p,0);CHKERRQ(ierr); 567fb4630b5SToby Isaac } 568fb4630b5SToby Isaac for (p = pStart; p < pEnd; p++) { 569fb4630b5SToby Isaac PetscInt dof; 570fb4630b5SToby Isaac PetscInt pNew = DMPlexShiftPoint_Internal(p,depth,depthShift); 571ca04dac2SToby Isaac 572ca04dac2SToby Isaac ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr); 573fb4630b5SToby Isaac ierr = PetscSectionSetDof(pSecShifted,pNew,dof);CHKERRQ(ierr); 574ca04dac2SToby Isaac } 575ca04dac2SToby Isaac ierr = PetscSectionSetUp(pSecShifted);CHKERRQ(ierr); 576fb4630b5SToby Isaac for (p = pStart; p < pEnd; p++) { 577fb4630b5SToby Isaac PetscInt dof; 578fb4630b5SToby Isaac PetscInt pNew = DMPlexShiftPoint_Internal(p,depth,depthShift); 579fb4630b5SToby Isaac 580fb4630b5SToby Isaac ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr); 581fb4630b5SToby Isaac if (dof) { 582fb4630b5SToby Isaac PetscInt off, offNew; 583fb4630b5SToby Isaac 584fb4630b5SToby Isaac ierr = PetscSectionGetOffset(pSec,p,&off);CHKERRQ(ierr); 585fb4630b5SToby Isaac ierr = PetscSectionGetOffset(pSecShifted,pNew,&offNew);CHKERRQ(ierr); 586fb4630b5SToby Isaac parentsShifted[offNew] = DMPlexShiftPoint_Internal(parents[off],depth,depthShift); 587fb4630b5SToby Isaac childIDsShifted[offNew] = childIDs[off]; 588fb4630b5SToby Isaac } 589fb4630b5SToby Isaac } 590fb4630b5SToby Isaac ierr = DMPlexSetTree(dmNew,pSecShifted,parentsShifted,childIDsShifted);CHKERRQ(ierr); 591fb4630b5SToby Isaac ierr = PetscFree2(parentsShifted,childIDsShifted);CHKERRQ(ierr); 592e6885bbbSToby Isaac ierr = PetscSectionDestroy(&pSecShifted);CHKERRQ(ierr); 593ca04dac2SToby Isaac } 594ca04dac2SToby Isaac PetscFunctionReturn(0); 595ca04dac2SToby Isaac } 596ca04dac2SToby Isaac 597ca04dac2SToby Isaac #undef __FUNCT__ 598cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal" 599cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm) 600cd0c2139SMatthew G Knepley { 601da97024aSMatthew G. Knepley PetscSF sf; 602cd0c2139SMatthew G Knepley IS valueIS; 603da97024aSMatthew G. Knepley const PetscInt *values, *leaves; 604cd0c2139SMatthew G Knepley PetscInt *depthShift; 6052582d50cSToby Isaac PetscInt d, depth = 0, nleaves, loc, Ng, numFS, fs, fStart, fEnd, ghostCell, cEnd, c; 606cd0c2139SMatthew G Knepley PetscErrorCode ierr; 607cd0c2139SMatthew G Knepley 608cd0c2139SMatthew G Knepley PetscFunctionBegin; 609da97024aSMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 610da97024aSMatthew G. Knepley ierr = PetscSFGetGraph(sf, NULL, &nleaves, &leaves, NULL);CHKERRQ(ierr); 611da97024aSMatthew G. Knepley nleaves = PetscMax(0, nleaves); 61246c796b9SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 613cd0c2139SMatthew G Knepley /* Count ghost cells */ 614cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 615cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr); 616cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 6174a6cfa73SMatthew G. Knepley Ng = 0; 618cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 61946c796b9SMatthew G. Knepley IS faceIS; 62046c796b9SMatthew G. Knepley const PetscInt *faces; 62146c796b9SMatthew G. Knepley PetscInt numFaces, f, numBdFaces = 0; 622cd0c2139SMatthew G Knepley 62346c796b9SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 62446c796b9SMatthew G. Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 62546c796b9SMatthew G. Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 62646c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 627ca04dac2SToby Isaac PetscInt numChildren; 628ca04dac2SToby Isaac 629da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 630ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 631ca04dac2SToby Isaac /* non-local and ancestors points don't get to register ghosts */ 632ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 63346c796b9SMatthew G. Knepley if ((faces[f] >= fStart) && (faces[f] < fEnd)) ++numBdFaces; 63446c796b9SMatthew G. Knepley } 6354a6cfa73SMatthew G. Knepley Ng += numBdFaces; 63646c796b9SMatthew G. Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 637cd0c2139SMatthew G Knepley } 638cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 6392582d50cSToby Isaac ierr = PetscMalloc1(2*(depth+1), &depthShift);CHKERRQ(ierr); 6402582d50cSToby Isaac for (d = 0; d <= depth; d++) { 64159eef20bSToby Isaac PetscInt dEnd; 6422582d50cSToby Isaac 6430974a383SToby Isaac ierr = DMPlexGetDepthStratum(dm,d,NULL,&dEnd);CHKERRQ(ierr); 64459eef20bSToby Isaac depthShift[2*d] = dEnd; 6452582d50cSToby Isaac depthShift[2*d+1] = 0; 6462582d50cSToby Isaac } 6472582d50cSToby Isaac if (depth >= 0) depthShift[2*depth+1] = Ng; 6482582d50cSToby Isaac ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift);CHKERRQ(ierr); 649cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 650cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 651cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 6525acea1aeSMatthew G. Knepley ierr = DMPlexSetHybridBounds(gdm, cEnd, PETSC_DETERMINE, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 6534a6cfa73SMatthew G. Knepley for (c = cEnd; c < cEnd + Ng; ++c) { 654cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr); 655cd0c2139SMatthew G Knepley } 656cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 657cd0c2139SMatthew G Knepley IS faceIS; 658cd0c2139SMatthew G Knepley const PetscInt *faces; 659cd0c2139SMatthew G Knepley PetscInt numFaces, f; 660cd0c2139SMatthew G Knepley 661cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 662cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 663cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 664cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 665ca04dac2SToby Isaac PetscInt size, numChildren; 666cd0c2139SMatthew G Knepley 667da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 668ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 669ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 67046c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 671cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr); 672cd0c2139SMatthew 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); 6734a6cfa73SMatthew G. Knepley ierr = DMPlexSetSupportSize(gdm, faces[f] + Ng, 2);CHKERRQ(ierr); 674cd0c2139SMatthew G Knepley } 675cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 676cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 677cd0c2139SMatthew G Knepley } 678cd0c2139SMatthew G Knepley /* Step 4: Setup ghosted DM */ 679cd0c2139SMatthew G Knepley ierr = DMSetUp(gdm);CHKERRQ(ierr); 680cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 681cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 682cd0c2139SMatthew G Knepley ghostCell = cEnd; 683cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 684cd0c2139SMatthew G Knepley IS faceIS; 685cd0c2139SMatthew G Knepley const PetscInt *faces; 686cd0c2139SMatthew G Knepley PetscInt numFaces, f; 687cd0c2139SMatthew G Knepley 688cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 689cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 690cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 69146c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 692ca04dac2SToby Isaac PetscInt newFace = faces[f] + Ng, numChildren; 693cd0c2139SMatthew G Knepley 694da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 695ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 696ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 69746c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 698cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr); 699cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr); 70046c796b9SMatthew G. Knepley ++ghostCell; 701cd0c2139SMatthew G Knepley } 702cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 703cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 704cd0c2139SMatthew G Knepley } 705cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 706cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 707cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 708cd0c2139SMatthew G Knepley ierr = DMPlexStratify(gdm);CHKERRQ(ierr); 709cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 710cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 711cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 712ca04dac2SToby Isaac ierr = DMPlexShiftTree_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 713cd0c2139SMatthew G Knepley ierr = PetscFree(depthShift);CHKERRQ(ierr); 714966c7b3fSMatthew G. Knepley /* Step 7: Periodicity */ 715966c7b3fSMatthew G. Knepley if (dm->maxCell) { 716966c7b3fSMatthew G. Knepley const PetscReal *maxCell, *L; 7175dc8c3f7SMatthew G. Knepley const DMBoundaryType *bd; 7185dc8c3f7SMatthew G. Knepley ierr = DMGetPeriodicity(dm, &maxCell, &L, &bd);CHKERRQ(ierr); 7195dc8c3f7SMatthew G. Knepley ierr = DMSetPeriodicity(gdm, maxCell, L, bd);CHKERRQ(ierr); 720966c7b3fSMatthew G. Knepley } 7214a6cfa73SMatthew G. Knepley if (numGhostCells) *numGhostCells = Ng; 722cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 723cd0c2139SMatthew G Knepley } 724cd0c2139SMatthew G Knepley 725cd0c2139SMatthew G Knepley #undef __FUNCT__ 726cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells" 727cd0c2139SMatthew G Knepley /*@C 728cd0c2139SMatthew G Knepley DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face 729cd0c2139SMatthew G Knepley 730cd0c2139SMatthew G Knepley Collective on dm 731cd0c2139SMatthew G Knepley 732cd0c2139SMatthew G Knepley Input Parameters: 733cd0c2139SMatthew G Knepley + dm - The original DM 734cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL 735cd0c2139SMatthew G Knepley 736cd0c2139SMatthew G Knepley Output Parameters: 737cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM 738cd0c2139SMatthew G Knepley - dmGhosted - The new DM 739cd0c2139SMatthew G Knepley 740cd0c2139SMatthew G Knepley Note: If no label exists of that name, one will be created marking all boundary faces 741cd0c2139SMatthew G Knepley 742cd0c2139SMatthew G Knepley Level: developer 743cd0c2139SMatthew G Knepley 744cd0c2139SMatthew G Knepley .seealso: DMCreate() 74531266bc0SMatthew G. Knepley @*/ 746cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted) 747cd0c2139SMatthew G Knepley { 748cd0c2139SMatthew G Knepley DM gdm; 749cd0c2139SMatthew G Knepley DMLabel label; 750cd0c2139SMatthew G Knepley const char *name = labelName ? labelName : "Face Sets"; 751cd0c2139SMatthew G Knepley PetscInt dim; 752a42b08eeSMatthew G. Knepley PetscBool flag; 753cd0c2139SMatthew G Knepley PetscErrorCode ierr; 754cd0c2139SMatthew G Knepley 755cd0c2139SMatthew G Knepley PetscFunctionBegin; 756cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 7574a6cfa73SMatthew G. Knepley if (numGhostCells) PetscValidPointer(numGhostCells, 3); 758cd0c2139SMatthew G Knepley PetscValidPointer(dmGhosted, 4); 759cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr); 760cd0c2139SMatthew G Knepley ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr); 761c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 762c73cfb54SMatthew G. Knepley ierr = DMSetDimension(gdm, dim);CHKERRQ(ierr); 763a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseCone(dm, &flag);CHKERRQ(ierr); 764a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseCone(gdm, flag);CHKERRQ(ierr); 765a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseClosure(dm, &flag);CHKERRQ(ierr); 766a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseClosure(gdm, flag);CHKERRQ(ierr); 767c58f1c22SToby Isaac ierr = DMGetLabel(dm, name, &label);CHKERRQ(ierr); 768cd0c2139SMatthew G Knepley if (!label) { 769cd0c2139SMatthew G Knepley /* Get label for boundary faces */ 770c58f1c22SToby Isaac ierr = DMCreateLabel(dm, name);CHKERRQ(ierr); 771c58f1c22SToby Isaac ierr = DMGetLabel(dm, name, &label);CHKERRQ(ierr); 772cd0c2139SMatthew G Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 773cd0c2139SMatthew G Knepley } 774cd0c2139SMatthew G Knepley ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr); 775a6ba4734SToby Isaac ierr = DMCopyBoundary(dm, gdm);CHKERRQ(ierr); 776cd0c2139SMatthew G Knepley *dmGhosted = gdm; 777cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 778cd0c2139SMatthew G Knepley } 779cd0c2139SMatthew G Knepley 780cd0c2139SMatthew G Knepley #undef __FUNCT__ 781cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal" 782607ab7a9SMatthew G. Knepley /* 783faedd622SMatthew G. Knepley We are adding three kinds of points here: 784607ab7a9SMatthew G. Knepley Replicated: Copies of points which exist in the mesh, such as vertices identified across a fault 785faedd622SMatthew G. Knepley Non-replicated: Points which exist on the fault, but are not replicated 786607ab7a9SMatthew G. Knepley Hybrid: Entirely new points, such as cohesive cells 787a6ae58d1SMatthew G. Knepley 788a6ae58d1SMatthew G. Knepley When creating subsequent cohesive cells, we shift the old hybrid cells to the end of the numbering at 789a6ae58d1SMatthew G. Knepley each depth so that the new split/hybrid points can be inserted as a block. 790607ab7a9SMatthew G. Knepley */ 791cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm) 792cd0c2139SMatthew G Knepley { 793cd0c2139SMatthew G Knepley MPI_Comm comm; 794607ab7a9SMatthew G. Knepley IS valueIS; 795607ab7a9SMatthew G. Knepley PetscInt numSP = 0; /* The number of depths for which we have replicated points */ 796607ab7a9SMatthew G. Knepley const PetscInt *values; /* List of depths for which we have replicated points */ 79718c5995bSMatthew G. Knepley IS *splitIS; 79818c5995bSMatthew G. Knepley IS *unsplitIS; 799607ab7a9SMatthew G. Knepley PetscInt *numSplitPoints; /* The number of replicated points at each depth */ 80018c5995bSMatthew G. Knepley PetscInt *numUnsplitPoints; /* The number of non-replicated points at each depth which still give rise to hybrid points */ 80136dbac82SMatthew G. Knepley PetscInt *numHybridPoints; /* The number of new hybrid points at each depth */ 80236dbac82SMatthew G. Knepley PetscInt *numHybridPointsOld; /* The number of existing hybrid points at each depth */ 803607ab7a9SMatthew G. Knepley const PetscInt **splitPoints; /* Replicated points for each depth */ 80418c5995bSMatthew G. Knepley const PetscInt **unsplitPoints; /* Non-replicated points for each depth */ 805cd0c2139SMatthew G Knepley PetscSection coordSection; 806cd0c2139SMatthew G Knepley Vec coordinates; 807cd0c2139SMatthew G Knepley PetscScalar *coords; 808a6ae58d1SMatthew G. Knepley PetscInt *depthMax; /* The first hybrid point at each depth in the original mesh */ 809a6ae58d1SMatthew G. Knepley PetscInt *depthEnd; /* The point limit at each depth in the original mesh */ 810607ab7a9SMatthew G. Knepley PetscInt *depthShift; /* Number of replicated+hybrid points at each depth */ 811607ab7a9SMatthew G. Knepley PetscInt *pMaxNew; /* The first replicated point at each depth in the new mesh, hybrids come after this */ 812607ab7a9SMatthew G. Knepley PetscInt *coneNew, *coneONew, *supportNew; 81318c5995bSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v; 814cd0c2139SMatthew G Knepley PetscErrorCode ierr; 815cd0c2139SMatthew G Knepley 816cd0c2139SMatthew G Knepley PetscFunctionBegin; 817cd0c2139SMatthew G Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 818c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 819607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 820fd4b9f15SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 821cd0c2139SMatthew G Knepley /* Count split points and add cohesive cells */ 822607ab7a9SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 8232582d50cSToby Isaac ierr = PetscMalloc5(depth+1,&depthMax,depth+1,&depthEnd,2*(depth+1),&depthShift,depth+1,&pMaxNew,depth+1,&numHybridPointsOld);CHKERRQ(ierr); 824dcca6d9dSJed 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); 825a6ae58d1SMatthew 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); 826607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 827607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 828a6ae58d1SMatthew G. Knepley depthEnd[d] = pMaxNew[d]; 829a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 830607ab7a9SMatthew G. Knepley numSplitPoints[d] = 0; 83118c5995bSMatthew G. Knepley numUnsplitPoints[d] = 0; 832607ab7a9SMatthew G. Knepley numHybridPoints[d] = 0; 833a6ae58d1SMatthew G. Knepley numHybridPointsOld[d] = depthMax[d] < 0 ? 0 : depthEnd[d] - depthMax[d]; 834607ab7a9SMatthew G. Knepley splitPoints[d] = NULL; 83518c5995bSMatthew G. Knepley unsplitPoints[d] = NULL; 83618c5995bSMatthew G. Knepley splitIS[d] = NULL; 83718c5995bSMatthew G. Knepley unsplitIS[d] = NULL; 83859eef20bSToby Isaac /* we are shifting the existing hybrid points with the stratum behind them, so 83959eef20bSToby Isaac * the split comes at the end of the normal points, i.e., at depthMax[d] */ 84059eef20bSToby Isaac depthShift[2*d] = depthMax[d]; 84159eef20bSToby Isaac depthShift[2*d+1] = 0; 842607ab7a9SMatthew G. Knepley } 843cd0c2139SMatthew G Knepley if (label) { 844cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 845cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 846cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 847cd0c2139SMatthew G Knepley } 848cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 849cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 850cd0c2139SMatthew G Knepley 851cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 85218c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr); 85318c5995bSMatthew G. Knepley if (splitIS[dep]) { 85418c5995bSMatthew G. Knepley ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 85518c5995bSMatthew G. Knepley ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 85618c5995bSMatthew G. Knepley } 85718c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr); 85818c5995bSMatthew G. Knepley if (unsplitIS[dep]) { 85918c5995bSMatthew G. Knepley ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr); 86018c5995bSMatthew G. Knepley ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr); 861cd0c2139SMatthew G Knepley } 862cd0c2139SMatthew G Knepley } 863607ab7a9SMatthew G. Knepley /* Calculate number of hybrid points */ 86418c5995bSMatthew 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 */ 8652582d50cSToby Isaac for (d = 0; d <= depth; ++d) depthShift[2*d+1] = numSplitPoints[d] + numHybridPoints[d]; 8662582d50cSToby Isaac ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift); 86759eef20bSToby Isaac /* the end of the points in this stratum that come before the new points: 86859eef20bSToby Isaac * shifting pMaxNew[d] gets the new start of the next stratum, then count back the old hybrid points and the newly 86959eef20bSToby Isaac * added points */ 8702582d50cSToby Isaac for (d = 0; d <= depth; ++d) pMaxNew[d] = DMPlexShiftPoint_Internal(pMaxNew[d],depth,depthShift) - (numHybridPointsOld[d] + numSplitPoints[d] + numHybridPoints[d]); 871cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 872cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 873cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 874cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 875cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 8762582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 8774c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 878cd0c2139SMatthew G Knepley const PetscInt *support; 8794c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, qf, qn, qp, e; 880cd0c2139SMatthew G Knepley 881cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 882cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 883cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 884cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 885cd0c2139SMatthew G Knepley if (dep == depth-1) { 8864c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 8874c367dbcSMatthew G. Knepley 888cd0c2139SMatthew G Knepley /* Add cohesive cells, they are prisms */ 8894c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr); 890cd0c2139SMatthew G Knepley } else if (dep == 0) { 8914c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 892cd0c2139SMatthew G Knepley 893cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 8944c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 895cd0c2139SMatthew G Knepley PetscInt val; 896cd0c2139SMatthew G Knepley 897cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 8984c367dbcSMatthew G. Knepley if (val == 1) ++qf; 8994c367dbcSMatthew G. Knepley if ((val == 1) || (val == (shift + 1))) ++qn; 9004c367dbcSMatthew G. Knepley if ((val == 1) || (val == -(shift + 1))) ++qp; 901cd0c2139SMatthew G Knepley } 9024c367dbcSMatthew G. Knepley /* Split old vertex: Edges into original vertex and new cohesive edge */ 9034c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 9044c367dbcSMatthew G. Knepley /* Split new vertex: Edges into split vertex and new cohesive edge */ 9054c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 9064c367dbcSMatthew G. Knepley /* Add hybrid edge */ 9074c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 9084c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 909cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 9104c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 9114c367dbcSMatthew G. Knepley 912cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 9134c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 914cd0c2139SMatthew G Knepley PetscInt val; 915cd0c2139SMatthew G Knepley 916cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 9174c367dbcSMatthew G. Knepley if (val == dim-1) ++qf; 9184c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 9194c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 920cd0c2139SMatthew G Knepley } 9214c367dbcSMatthew G. Knepley /* Split old edge: Faces into original edge and cohesive face (positive side?) */ 9224c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 9234c367dbcSMatthew G. Knepley /* Split new edge: Faces into split edge and cohesive face (negative side?) */ 9244c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 9254c367dbcSMatthew G. Knepley /* Add hybrid face */ 9264c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 9274c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 928cd0c2139SMatthew G Knepley } 929cd0c2139SMatthew G Knepley } 930cd0c2139SMatthew G Knepley } 93118c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 93218c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 93318c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 9342582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 93518c5995bSMatthew G. Knepley const PetscInt *support; 936da1dd7e4SMatthew G. Knepley PetscInt coneSize, supportSize, qf, e, s; 93718c5995bSMatthew G. Knepley 93818c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 93918c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 94039254ff6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 94118c5995bSMatthew G. Knepley if (dep == 0) { 94218c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 94318c5995bSMatthew G. Knepley 94439254ff6SMatthew G. Knepley /* Unsplit vertex: Edges into original vertex, split edges, and new cohesive edge twice */ 94539254ff6SMatthew G. Knepley for (s = 0, qf = 0; s < supportSize; ++s, ++qf) { 94639254ff6SMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 94739254ff6SMatthew G. Knepley if (e >= 0) ++qf; 94839254ff6SMatthew G. Knepley } 94939254ff6SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 95018c5995bSMatthew G. Knepley /* Add hybrid edge */ 95118c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 952e1757548SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 953e1757548SMatthew G. Knepley PetscInt val; 954e1757548SMatthew G. Knepley 955e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 956e1757548SMatthew G. Knepley /* Split and unsplit edges produce hybrid faces */ 957da1dd7e4SMatthew G. Knepley if (val == 1) ++qf; 958da1dd7e4SMatthew G. Knepley if (val == (shift2 + 1)) ++qf; 959e1757548SMatthew G. Knepley } 960e1757548SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 96118c5995bSMatthew G. Knepley } else if (dep == dim-2) { 96218c5995bSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 963cd0c2139SMatthew G Knepley PetscInt val; 964cd0c2139SMatthew G Knepley 965da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 966cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 967da1dd7e4SMatthew G. Knepley if (val == dim-1) qf += 2; 968da1dd7e4SMatthew G. Knepley else ++qf; 969cd0c2139SMatthew G Knepley } 97018c5995bSMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */ 971da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 97218c5995bSMatthew G. Knepley /* Add hybrid face */ 973da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 974da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 975da1dd7e4SMatthew G. Knepley if (val == dim-1) ++qf; 976da1dd7e4SMatthew G. Knepley } 97718c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 978da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 979cd0c2139SMatthew G Knepley } 980cd0c2139SMatthew G Knepley } 981cd0c2139SMatthew G Knepley } 982cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 983cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 984cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 985dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 986dcca6d9dSJed Brown ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),&supportNew);CHKERRQ(ierr); 987cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 988cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 989cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 990cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 9912582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 9924c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 993cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 9944c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, q, qf, qn, qp, v, e, s; 995cd0c2139SMatthew G Knepley 996cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 997cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 998cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 999cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 1000cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 1001cd0c2139SMatthew G Knepley if (dep == depth-1) { 100296a07cd0SMatthew G. Knepley PetscBool hasUnsplit = PETSC_FALSE; 10034c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1004cd0c2139SMatthew G Knepley const PetscInt *supportF; 1005cd0c2139SMatthew G Knepley 1006cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 1007cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 1008cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 1009cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 1010cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 1011cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 10124c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 101318c5995bSMatthew G. Knepley if (v < 0) { 101418c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 101518c5995bSMatthew 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); 10162582d50cSToby Isaac coneNew[2+q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/; 101796a07cd0SMatthew G. Knepley hasUnsplit = PETSC_TRUE; 101818c5995bSMatthew G. Knepley } else { 10194c367dbcSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep-1]; 1020163235baSMatthew G. Knepley if (dep > 1) { 1021163235baSMatthew G. Knepley const PetscInt *econe; 1022163235baSMatthew G. Knepley PetscInt econeSize, r, vs, vu; 1023163235baSMatthew G. Knepley 1024163235baSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[q], &econeSize);CHKERRQ(ierr); 1025163235baSMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[q], &econe);CHKERRQ(ierr); 1026163235baSMatthew G. Knepley for (r = 0; r < econeSize; ++r) { 1027163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numSplitPoints[dep-2], splitPoints[dep-2], &vs);CHKERRQ(ierr); 1028163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numUnsplitPoints[dep-2], unsplitPoints[dep-2], &vu);CHKERRQ(ierr); 1029163235baSMatthew G. Knepley if (vs >= 0) continue; 1030163235baSMatthew 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); 1031163235baSMatthew G. Knepley hasUnsplit = PETSC_TRUE; 1032163235baSMatthew G. Knepley } 1033163235baSMatthew G. Knepley } 1034cd0c2139SMatthew G Knepley } 1035cd0c2139SMatthew G Knepley } 1036cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 1037cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 1038e537020bSMatthew G. Knepley /* Face support */ 1039cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1040cd0c2139SMatthew G Knepley PetscInt val; 1041cd0c2139SMatthew G Knepley 1042cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 1043cd0c2139SMatthew G Knepley if (val < 0) { 1044cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 10454c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr); 1046cd0c2139SMatthew G Knepley } else { 1047cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 10484c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr); 1049e537020bSMatthew G. Knepley /* Get orientation for cohesive face */ 1050e537020bSMatthew G. Knepley { 1051e537020bSMatthew G. Knepley const PetscInt *ncone, *nconeO; 1052e537020bSMatthew G. Knepley PetscInt nconeSize, nc; 1053e537020bSMatthew G. Knepley 1054e537020bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 1055e537020bSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 1056e537020bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 1057e537020bSMatthew G. Knepley for (nc = 0; nc < nconeSize; ++nc) { 1058e537020bSMatthew G. Knepley if (ncone[nc] == oldp) { 1059e537020bSMatthew G. Knepley coneONew[0] = nconeO[nc]; 1060e537020bSMatthew G. Knepley break; 1061cd0c2139SMatthew G Knepley } 1062cd0c2139SMatthew G Knepley } 1063e537020bSMatthew 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]); 1064e537020bSMatthew G. Knepley } 1065e537020bSMatthew G. Knepley } 1066e537020bSMatthew G. Knepley } 10674c367dbcSMatthew G. Knepley /* Cohesive cell: Old and new split face, then new cohesive faces */ 1068fd4b9f15SMatthew G. Knepley coneNew[0] = newp; /* Extracted negative side orientation above */ 10694c367dbcSMatthew G. Knepley coneNew[1] = splitp; 10704c367dbcSMatthew G. Knepley coneONew[1] = coneONew[0]; 1071e537020bSMatthew G. Knepley for (q = 0; q < coneSize; ++q) { 107218c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 107318c5995bSMatthew G. Knepley if (v < 0) { 107418c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 107518c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 107618c5995bSMatthew G. Knepley coneONew[2+q] = 0; 107718c5995bSMatthew G. Knepley } else { 107818c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep]; 107918c5995bSMatthew G. Knepley } 1080e537020bSMatthew G. Knepley coneONew[2+q] = 0; 1081e537020bSMatthew G. Knepley } 10824c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr); 10834c367dbcSMatthew G. Knepley ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr); 108496a07cd0SMatthew G. Knepley /* Label the hybrid cells on the boundary of the split */ 108596a07cd0SMatthew G. Knepley if (hasUnsplit) {ierr = DMLabelSetValue(label, -hybcell, dim);CHKERRQ(ierr);} 1086cd0c2139SMatthew G Knepley } else if (dep == 0) { 10874c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1088cd0c2139SMatthew G Knepley 1089cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 10904c367dbcSMatthew G. Knepley for (e = 0, qn = 0; e < supportSize; ++e) { 1091cd0c2139SMatthew G Knepley PetscInt val; 1092cd0c2139SMatthew G Knepley 1093cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1094cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 10952582d50cSToby Isaac supportNew[qn++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1096cd0c2139SMatthew G Knepley } 1097cd0c2139SMatthew G Knepley } 10984c367dbcSMatthew G. Knepley supportNew[qn] = hybedge; 1099cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1100cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 11014c367dbcSMatthew G. Knepley for (e = 0, qp = 0; e < supportSize; ++e) { 1102cd0c2139SMatthew G Knepley PetscInt val, edge; 1103cd0c2139SMatthew G Knepley 1104cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1105cd0c2139SMatthew G Knepley if (val == 1) { 11064c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 1107cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 11084c367dbcSMatthew G. Knepley supportNew[qp++] = edge + pMaxNew[dep+1]; 1109cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 11102582d50cSToby Isaac supportNew[qp++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1111cd0c2139SMatthew G Knepley } 1112cd0c2139SMatthew G Knepley } 11134c367dbcSMatthew G. Knepley supportNew[qp] = hybedge; 1114cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 11154c367dbcSMatthew G. Knepley /* Hybrid edge: Old and new split vertex */ 1116cd0c2139SMatthew G Knepley coneNew[0] = newp; 1117cd0c2139SMatthew G Knepley coneNew[1] = splitp; 11184c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 11194c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 11204c367dbcSMatthew G. Knepley PetscInt val, edge; 11214c367dbcSMatthew G. Knepley 11224c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 11234c367dbcSMatthew G. Knepley if (val == 1) { 11244c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 11254c367dbcSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 11264c367dbcSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 11274c367dbcSMatthew G. Knepley } 11284c367dbcSMatthew G. Knepley } 11294c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1130cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 11314c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 11324c367dbcSMatthew G. Knepley 1133cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 1134cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 1135cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 11364c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 1137e1757548SMatthew G. Knepley if (v < 0) { 1138e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1139e1757548SMatthew 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); 11402582d50cSToby Isaac coneNew[q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/; 1141e1757548SMatthew G. Knepley } else { 11424c367dbcSMatthew G. Knepley coneNew[q] = v + pMaxNew[dep-1]; 1143cd0c2139SMatthew G Knepley } 1144e1757548SMatthew G. Knepley } 1145cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 1146cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 1147cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 1148cd0c2139SMatthew G Knepley PetscInt val; 1149cd0c2139SMatthew G Knepley 1150cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 11514c367dbcSMatthew G. Knepley if (val == dim-1) { 11522582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 11534c367dbcSMatthew G. Knepley } else if (val == (shift + dim-1)) { 11542582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1155cd0c2139SMatthew G Knepley } 1156cd0c2139SMatthew G Knepley } 1157b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1158cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1159cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 1160cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 1161cd0c2139SMatthew G Knepley PetscInt val, face; 1162cd0c2139SMatthew G Knepley 1163cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1164cd0c2139SMatthew G Knepley if (val == dim-1) { 11654c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1166cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 11674c367dbcSMatthew G. Knepley supportNew[q++] = face + pMaxNew[dep+1]; 1168cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 11692582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1170cd0c2139SMatthew G Knepley } 1171cd0c2139SMatthew G Knepley } 1172b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1173cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 11744c367dbcSMatthew G. Knepley /* Hybrid face */ 11754c367dbcSMatthew G. Knepley coneNew[0] = newp; 11764c367dbcSMatthew G. Knepley coneNew[1] = splitp; 11774c367dbcSMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 11784c367dbcSMatthew G. Knepley PetscInt vertex; 11794c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr); 1180e1757548SMatthew G. Knepley if (vertex < 0) { 1181e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr); 1182e1757548SMatthew 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); 1183e1757548SMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1184e1757548SMatthew G. Knepley } else { 11854c367dbcSMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep]; 11864c367dbcSMatthew G. Knepley } 1187e1757548SMatthew G. Knepley } 11884c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 11894c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 11904c367dbcSMatthew G. Knepley PetscInt val, face; 11914c367dbcSMatthew G. Knepley 11924c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 11934c367dbcSMatthew G. Knepley if (val == dim-1) { 11944c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 11954c367dbcSMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 11964c367dbcSMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 11974c367dbcSMatthew G. Knepley } 11984c367dbcSMatthew G. Knepley } 11994c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1200cd0c2139SMatthew G Knepley } 1201cd0c2139SMatthew G Knepley } 1202cd0c2139SMatthew G Knepley } 120318c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 120418c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 120518c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 12062582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 120718c5995bSMatthew G. Knepley const PetscInt *cone, *support, *ornt; 1208e1757548SMatthew G. Knepley PetscInt coneSize, supportSize, supportSizeNew, q, qf, e, f, s; 120918c5995bSMatthew G. Knepley 121018c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 121118c5995bSMatthew G. Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 121218c5995bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 121318c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 121418c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 121518c5995bSMatthew G. Knepley if (dep == 0) { 121618c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 121718c5995bSMatthew G. Knepley 121818c5995bSMatthew G. Knepley /* Unsplit vertex */ 121918c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 122018c5995bSMatthew G. Knepley for (s = 0, q = 0; s < supportSize; ++s) { 12212582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[s], depth, depthShift) /*support[s] + depthOffset[dep+1]*/; 122218c5995bSMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 122318c5995bSMatthew G. Knepley if (e >= 0) { 122418c5995bSMatthew G. Knepley supportNew[q++] = e + pMaxNew[dep+1]; 122518c5995bSMatthew G. Knepley } 122618c5995bSMatthew G. Knepley } 122718c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 122818c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 122918c5995bSMatthew G. Knepley if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp); 123018c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 123118c5995bSMatthew G. Knepley /* Hybrid edge */ 123218c5995bSMatthew G. Knepley coneNew[0] = newp; 123318c5995bSMatthew G. Knepley coneNew[1] = newp; 123418c5995bSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 123518c5995bSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 123618c5995bSMatthew G. Knepley PetscInt val, edge; 123718c5995bSMatthew G. Knepley 123818c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 123918c5995bSMatthew G. Knepley if (val == 1) { 124018c5995bSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 124118c5995bSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 124218c5995bSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1243e1757548SMatthew G. Knepley } else if (val == (shift2 + 1)) { 1244e1757548SMatthew G. Knepley ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr); 1245e1757548SMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]); 1246e1757548SMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1]; 124718c5995bSMatthew G. Knepley } 124818c5995bSMatthew G. Knepley } 124918c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1250e1757548SMatthew G. Knepley } else if (dep == dim-2) { 1251e1757548SMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 1252e1757548SMatthew G. Knepley 1253da1dd7e4SMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and hybrid face twice */ 1254e1757548SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1255e1757548SMatthew G. Knepley PetscInt val, face; 1256e1757548SMatthew G. Knepley 1257e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1258e1757548SMatthew G. Knepley if (val == dim-1) { 1259e1757548SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1260e1757548SMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]); 12612582d50cSToby Isaac supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/; 1262e1757548SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+1]; 1263e1757548SMatthew G. Knepley } else { 12642582d50cSToby Isaac supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/; 1265e1757548SMatthew G. Knepley } 1266e1757548SMatthew G. Knepley } 1267e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1268e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1269da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 1270da1dd7e4SMatthew 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); 1271e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1272e1757548SMatthew G. Knepley /* Add hybrid face */ 1273e1757548SMatthew G. Knepley coneNew[0] = newp; 1274212cc919SMatthew G. Knepley coneNew[1] = newp; 1275e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[0], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1276e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[0]); 1277212cc919SMatthew G. Knepley coneNew[2] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1278e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1279e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]); 1280e1757548SMatthew G. Knepley coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1281e1757548SMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 1282da1dd7e4SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1283da1dd7e4SMatthew G. Knepley PetscInt val, face; 1284da1dd7e4SMatthew G. Knepley 1285da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1286da1dd7e4SMatthew G. Knepley if (val == dim-1) { 1287da1dd7e4SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1288da1dd7e4SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1289da1dd7e4SMatthew G. Knepley } 1290da1dd7e4SMatthew G. Knepley } 1291da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, hybface, &supportSizeNew);CHKERRQ(ierr); 1292da1dd7e4SMatthew 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); 1293e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1294cd0c2139SMatthew G Knepley } 1295cd0c2139SMatthew G Knepley } 1296cd0c2139SMatthew G Knepley } 1297cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 1298cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1299cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 1300cd0c2139SMatthew G Knepley IS pIS; 1301cd0c2139SMatthew G Knepley PetscInt numPoints; 1302cd0c2139SMatthew G Knepley const PetscInt *points; 1303cd0c2139SMatthew G Knepley 1304cd0c2139SMatthew G Knepley if (dep >= 0) continue; 1305cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 1306cd0c2139SMatthew G Knepley if (!pIS) continue; 1307cd0c2139SMatthew G Knepley dep = -dep - shift; 1308cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 1309cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 1310cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1311cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 13122582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*depthOffset[dep] + oldp*/; 1313cd0c2139SMatthew G Knepley const PetscInt *cone; 1314cd0c2139SMatthew G Knepley PetscInt coneSize, c; 131550cf782dSMatthew G. Knepley /* PetscBool replaced = PETSC_FALSE; */ 1316cd0c2139SMatthew G Knepley 1317cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 1318cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 1319cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 1320cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 1321cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1322e38fbfedSToby Isaac const PetscInt coldp = DMPlexShiftPointInverse_Internal(cone[c],depth,depthShift); 1323cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 1324cd0c2139SMatthew G Knepley 1325cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 1326cd0c2139SMatthew G Knepley if (val == dep-1) { 1327cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 1328cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 1329cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 1330cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 133150cf782dSMatthew G. Knepley /* replaced = PETSC_TRUE; */ 1332cd0c2139SMatthew G Knepley } 1333cd0c2139SMatthew G Knepley } 13344a189a86SMatthew G. Knepley /* Cells with only a vertex or edge on the submesh have no replacement */ 13354a189a86SMatthew G. Knepley /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 1336cd0c2139SMatthew G Knepley } 1337cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 1338cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 1339cd0c2139SMatthew G Knepley } 1340cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 1341cd0c2139SMatthew G Knepley ierr = DMPlexStratify(sdm);CHKERRQ(ierr); 1342cd0c2139SMatthew G Knepley /* Step 8: Coordinates */ 1343cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 134469d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 1345cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 1346cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 1347cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 13482582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[0][v], depth, depthShift) /*depthOffset[0] + splitPoints[0][v]*/; 1349cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 1350cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 1351cd0c2139SMatthew G Knepley 1352cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 1353cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 1354cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 1355cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 1356cd0c2139SMatthew G Knepley } 1357cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 1358cd0c2139SMatthew G Knepley /* Step 9: SF, if I can figure this out we can split the mesh in parallel */ 1359cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1360cd0c2139SMatthew G Knepley /* Step 10: Labels */ 1361cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1362c58f1c22SToby Isaac ierr = DMGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 1363cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1364cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 13652582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[dep][p], depth, depthShift) /*depthOffset[dep] + splitPoints[dep][p]*/; 1366cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 1367cd0c2139SMatthew G Knepley PetscInt l; 1368cd0c2139SMatthew G Knepley 1369cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 1370cd0c2139SMatthew G Knepley DMLabel mlabel; 1371cd0c2139SMatthew G Knepley const char *lname; 1372cd0c2139SMatthew G Knepley PetscInt val; 13739a356370SMatthew G. Knepley PetscBool isDepth; 1374cd0c2139SMatthew G Knepley 1375c58f1c22SToby Isaac ierr = DMGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 13769a356370SMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 13779a356370SMatthew G. Knepley if (isDepth) continue; 1378c58f1c22SToby Isaac ierr = DMGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 1379cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 1380cd0c2139SMatthew G Knepley if (val >= 0) { 1381cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 13829a356370SMatthew G. Knepley #if 0 13839a356370SMatthew G. Knepley /* Do not put cohesive edges into the label */ 1384cd0c2139SMatthew G Knepley if (dep == 0) { 13854c367dbcSMatthew G. Knepley const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1386cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr); 13874c367dbcSMatthew G. Knepley } else if (dep == dim-2) { 13884c367dbcSMatthew G. Knepley const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 13894c367dbcSMatthew G. Knepley ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr); 1390cd0c2139SMatthew G Knepley } 13914c367dbcSMatthew G. Knepley /* Do not put cohesive faces into the label */ 13929a356370SMatthew G. Knepley #endif 1393cd0c2139SMatthew G Knepley } 1394cd0c2139SMatthew G Knepley } 1395cd0c2139SMatthew G Knepley } 1396cd0c2139SMatthew G Knepley } 1397cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1398cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 1399cd0c2139SMatthew G Knepley 1400cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 140118c5995bSMatthew G. Knepley if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 140218c5995bSMatthew G. Knepley ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr); 140318c5995bSMatthew G. Knepley if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);} 140418c5995bSMatthew G. Knepley ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr); 1405cd0c2139SMatthew G Knepley } 1406cd0c2139SMatthew G Knepley if (label) { 1407cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1408cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1409cd0c2139SMatthew G Knepley } 14100d4d4d06SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 14110d4d4d06SMatthew G. Knepley ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr); 141236dbac82SMatthew G. Knepley pMaxNew[d] = pEnd - numHybridPoints[d] - numHybridPointsOld[d]; 14130d4d4d06SMatthew G. Knepley } 14140e49e2e2SMatthew 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); 1415dcbb62e8SMatthew G. Knepley ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr); 14162582d50cSToby Isaac ierr = PetscFree5(depthMax, depthEnd, depthShift, pMaxNew, numHybridPointsOld);CHKERRQ(ierr); 141718c5995bSMatthew G. Knepley ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr); 1418cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1419cd0c2139SMatthew G Knepley } 1420cd0c2139SMatthew G Knepley 1421cd0c2139SMatthew G Knepley #undef __FUNCT__ 1422cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells" 1423cd0c2139SMatthew G Knepley /*@C 1424cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 1425cd0c2139SMatthew G Knepley 1426cd0c2139SMatthew G Knepley Collective on dm 1427cd0c2139SMatthew G Knepley 1428cd0c2139SMatthew G Knepley Input Parameters: 1429cd0c2139SMatthew G Knepley + dm - The original DM 143053156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated) 1431cd0c2139SMatthew G Knepley 1432cd0c2139SMatthew G Knepley Output Parameters: 1433cd0c2139SMatthew G Knepley - dmSplit - The new DM 1434cd0c2139SMatthew G Knepley 1435cd0c2139SMatthew G Knepley Level: developer 1436cd0c2139SMatthew G Knepley 14372be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 1438cd0c2139SMatthew G Knepley @*/ 1439cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 1440cd0c2139SMatthew G Knepley { 1441cd0c2139SMatthew G Knepley DM sdm; 1442cd0c2139SMatthew G Knepley PetscInt dim; 1443cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1444cd0c2139SMatthew G Knepley 1445cd0c2139SMatthew G Knepley PetscFunctionBegin; 1446cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 144753156dfcSMatthew G. Knepley PetscValidPointer(dmSplit, 3); 1448cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 1449cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 1450c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1451c73cfb54SMatthew G. Knepley ierr = DMSetDimension(sdm, dim);CHKERRQ(ierr); 1452cd0c2139SMatthew G Knepley switch (dim) { 1453cd0c2139SMatthew G Knepley case 2: 1454cd0c2139SMatthew G Knepley case 3: 1455cd0c2139SMatthew G Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 1456cd0c2139SMatthew G Knepley break; 1457cd0c2139SMatthew G Knepley default: 1458cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 1459cd0c2139SMatthew G Knepley } 1460cd0c2139SMatthew G Knepley *dmSplit = sdm; 1461cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1462cd0c2139SMatthew G Knepley } 1463cd0c2139SMatthew G Knepley 1464cd0c2139SMatthew G Knepley #undef __FUNCT__ 14650f66a230SMatthew G. Knepley #define __FUNCT__ "GetSurfaceSide_Static" 14660f66a230SMatthew G. Knepley /* Returns the side of the surface for a given cell with a face on the surface */ 14670f66a230SMatthew G. Knepley static PetscErrorCode GetSurfaceSide_Static(DM dm, DM subdm, PetscInt numSubpoints, const PetscInt *subpoints, PetscInt cell, PetscInt face, PetscBool *pos) 14680f66a230SMatthew G. Knepley { 14690f66a230SMatthew G. Knepley const PetscInt *cone, *ornt; 14700f66a230SMatthew G. Knepley PetscInt dim, coneSize, c; 14710f66a230SMatthew G. Knepley PetscErrorCode ierr; 14720f66a230SMatthew G. Knepley 14730f66a230SMatthew G. Knepley PetscFunctionBegin; 14740f66a230SMatthew G. Knepley *pos = PETSC_TRUE; 1475c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 14760f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 14770f66a230SMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 14780f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, cell, &ornt);CHKERRQ(ierr); 14790f66a230SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 14800f66a230SMatthew G. Knepley if (cone[c] == face) { 14810f66a230SMatthew G. Knepley PetscInt o = ornt[c]; 14820f66a230SMatthew G. Knepley 14830f66a230SMatthew G. Knepley if (subdm) { 14840f66a230SMatthew G. Knepley const PetscInt *subcone, *subornt; 14850f66a230SMatthew G. Knepley PetscInt subpoint, subface, subconeSize, sc; 14860f66a230SMatthew G. Knepley 14870f66a230SMatthew G. Knepley ierr = PetscFindInt(cell, numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 14880f66a230SMatthew G. Knepley ierr = PetscFindInt(face, numSubpoints, subpoints, &subface);CHKERRQ(ierr); 14890f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 14900f66a230SMatthew G. Knepley ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 14910f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 14920f66a230SMatthew G. Knepley for (sc = 0; sc < subconeSize; ++sc) { 14930f66a230SMatthew G. Knepley if (subcone[sc] == subface) { 14940f66a230SMatthew G. Knepley o = subornt[0]; 14950f66a230SMatthew G. Knepley break; 14960f66a230SMatthew G. Knepley } 14970f66a230SMatthew G. Knepley } 14980f66a230SMatthew 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); 14990f66a230SMatthew G. Knepley } 15000f66a230SMatthew G. Knepley if (o >= 0) *pos = PETSC_TRUE; 15010f66a230SMatthew G. Knepley else *pos = PETSC_FALSE; 15020f66a230SMatthew G. Knepley break; 15030f66a230SMatthew G. Knepley } 15040f66a230SMatthew G. Knepley } 15050f66a230SMatthew 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); 15060f66a230SMatthew G. Knepley PetscFunctionReturn(0); 15070f66a230SMatthew G. Knepley } 15080f66a230SMatthew G. Knepley 15090f66a230SMatthew G. Knepley #undef __FUNCT__ 15102be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete" 1511cd0c2139SMatthew G Knepley /*@ 15120f66a230SMatthew G. Knepley DMPlexLabelCohesiveComplete - Starting with a label marking points on an internal surface, we add all other mesh pieces 1513cd0c2139SMatthew G Knepley to complete the surface 1514cd0c2139SMatthew G Knepley 1515cd0c2139SMatthew G Knepley Input Parameters: 1516cd0c2139SMatthew G Knepley + dm - The DM 15170f66a230SMatthew G. Knepley . label - A DMLabel marking the surface 15180f66a230SMatthew G. Knepley . blabel - A DMLabel marking the vertices on the boundary which will not be duplicated, or NULL to find them automatically 1519bb55d314SMatthew G. Knepley . flip - Flag to flip the submesh normal and replace points on the other side 152047946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL 1521cd0c2139SMatthew G Knepley 1522cd0c2139SMatthew G Knepley Output Parameter: 1523cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 1524cd0c2139SMatthew G Knepley 15250f66a230SMatthew G. Knepley Note: The vertices in blabel are called "unsplit" in the terminology from hybrid cell creation. 15260f66a230SMatthew G. Knepley 1527cd0c2139SMatthew G Knepley Level: developer 1528cd0c2139SMatthew G Knepley 15292be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 1530cd0c2139SMatthew G Knepley @*/ 15310f66a230SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, DMLabel blabel, PetscBool flip, DM subdm) 1532cd0c2139SMatthew G Knepley { 1533d90583fdSMatthew G. Knepley DMLabel depthLabel; 153486200784SMatthew G. Knepley IS dimIS, subpointIS, facePosIS, faceNegIS, crossEdgeIS = NULL; 153547946fd8SMatthew G. Knepley const PetscInt *points, *subpoints; 1536bb55d314SMatthew G. Knepley const PetscInt rev = flip ? -1 : 1; 1537370472baSMatthew G. Knepley PetscInt *pMax; 1538370472baSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, dim, depth, pSize, dep, cStart, cEnd, cMax, fStart, fEnd, vStart, vEnd, numPoints, numSubpoints, p, val; 1539cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1540cd0c2139SMatthew G Knepley 1541cd0c2139SMatthew G Knepley PetscFunctionBegin; 1542370472baSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1543370472baSMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1544370472baSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1545370472baSMatthew G. Knepley ierr = PetscMalloc1(pSize,&pMax);CHKERRQ(ierr); 1546370472baSMatthew 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); 1547d90583fdSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 1548c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 154947946fd8SMatthew G. Knepley if (subdm) { 155047946fd8SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 155147946fd8SMatthew G. Knepley if (subpointIS) { 155247946fd8SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 155347946fd8SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 155447946fd8SMatthew G. Knepley } 155547946fd8SMatthew G. Knepley } 1556d7c8f101SMatthew G. Knepley /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */ 1557cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 1558dc86033cSMatthew G. Knepley if (!dimIS) { 1559dc86033cSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1560dc86033cSMatthew G. Knepley PetscFunctionReturn(0); 1561dc86033cSMatthew G. Knepley } 1562cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1563cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1564d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */ 1565cd0c2139SMatthew G Knepley const PetscInt *support; 1566cd0c2139SMatthew G Knepley PetscInt supportSize, s; 1567cd0c2139SMatthew G Knepley 1568cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1569cd0c2139SMatthew G Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 1570cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1571cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 15720f66a230SMatthew G. Knepley const PetscInt *cone; 1573cd0c2139SMatthew G Knepley PetscInt coneSize, c; 15740f66a230SMatthew G. Knepley PetscBool pos; 1575cd0c2139SMatthew G Knepley 15760f66a230SMatthew G. Knepley ierr = GetSurfaceSide_Static(dm, subdm, numSubpoints, subpoints, support[s], points[p], &pos);CHKERRQ(ierr); 15770f66a230SMatthew G. Knepley if (pos) {ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr);} 15780f66a230SMatthew G. Knepley else {ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);} 15790f66a230SMatthew G. Knepley if (rev < 0) pos = !pos ? PETSC_TRUE : PETSC_FALSE; 15800f66a230SMatthew G. Knepley /* Put faces touching the fault in the label */ 1581cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1582cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1583cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1584cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 1585cd0c2139SMatthew G Knepley 1586cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1587cd0c2139SMatthew G Knepley if (val == -1) { 1588cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 1589cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 1590cd0c2139SMatthew G Knepley 1591cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1592cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1593cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 1594a0541d8aSMatthew G. Knepley PetscInt bval = -1; 1595cd0c2139SMatthew G Knepley 1596cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1597a0541d8aSMatthew G. Knepley if (blabel) {ierr = DMLabelGetValue(blabel, clp, &bval);CHKERRQ(ierr);} 1598a0541d8aSMatthew G. Knepley if ((val >= 0) && (val < dim-1) && (bval < 0)) { 1599cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1600cd0c2139SMatthew G Knepley break; 1601cd0c2139SMatthew G Knepley } 1602cd0c2139SMatthew G Knepley } 1603cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1604cd0c2139SMatthew G Knepley } 1605cd0c2139SMatthew G Knepley } 1606cd0c2139SMatthew G Knepley } 1607cd0c2139SMatthew G Knepley } 16080f66a230SMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 16090f66a230SMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 161047946fd8SMatthew G. Knepley if (subdm) { 161147946fd8SMatthew G. Knepley if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 161247946fd8SMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 161347946fd8SMatthew G. Knepley } 1614a0541d8aSMatthew G. Knepley /* Mark boundary points as unsplit */ 161586200784SMatthew G. Knepley if (blabel) { 1616a0541d8aSMatthew G. Knepley ierr = DMLabelGetStratumIS(blabel, 1, &dimIS);CHKERRQ(ierr); 1617a0541d8aSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1618a0541d8aSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1619a0541d8aSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1620a0541d8aSMatthew G. Knepley const PetscInt point = points[p]; 1621a0541d8aSMatthew G. Knepley PetscInt val, bval; 1622a0541d8aSMatthew G. Knepley 1623a0541d8aSMatthew G. Knepley ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr); 1624a0541d8aSMatthew G. Knepley if (bval >= 0) { 1625f7019248SMatthew G. Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1626f7019248SMatthew G. Knepley if ((val < 0) || (val > dim)) { 1627f7019248SMatthew G. Knepley /* This could be a point added from splitting a vertex on an adjacent fault, otherwise its just wrong */ 1628f7019248SMatthew G. Knepley ierr = DMLabelClearValue(blabel, point, bval);CHKERRQ(ierr); 1629f7019248SMatthew G. Knepley } 1630f7019248SMatthew G. Knepley } 1631f7019248SMatthew G. Knepley } 1632f7019248SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1633f7019248SMatthew G. Knepley const PetscInt point = points[p]; 1634f7019248SMatthew G. Knepley PetscInt val, bval; 1635f7019248SMatthew G. Knepley 1636f7019248SMatthew G. Knepley ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr); 1637f7019248SMatthew G. Knepley if (bval >= 0) { 163886200784SMatthew G. Knepley const PetscInt *cone, *support; 163986200784SMatthew G. Knepley PetscInt coneSize, supportSize, s, valA, valB, valE; 164086200784SMatthew G. Knepley 1641a0541d8aSMatthew G. Knepley /* Mark as unsplit */ 1642a0541d8aSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1643a0541d8aSMatthew 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); 1644a0541d8aSMatthew G. Knepley ierr = DMLabelClearValue(label, point, val);CHKERRQ(ierr); 1645a0541d8aSMatthew G. Knepley ierr = DMLabelSetValue(label, point, shift2+val);CHKERRQ(ierr); 16462c06a818SMatthew G. Knepley /* Check for cross-edge 16472c06a818SMatthew G. Knepley A cross-edge has endpoints which are both on the boundary of the surface, but the edge itself is not. */ 164886200784SMatthew G. Knepley if (val != 0) continue; 164986200784SMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 165086200784SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 165186200784SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 165286200784SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 165386200784SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 165486200784SMatthew G. Knepley if (coneSize != 2) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Edge %D has %D vertices != 2", support[s], coneSize); 165586200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, cone[0], &valA);CHKERRQ(ierr); 165686200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, cone[1], &valB);CHKERRQ(ierr); 165786200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, support[s], &valE);CHKERRQ(ierr); 165809816f77SMatthew G. Knepley if ((valE < 0) && (valA >= 0) && (valB >= 0) && (cone[0] != cone[1])) {ierr = DMLabelSetValue(blabel, support[s], 2);CHKERRQ(ierr);} 165986200784SMatthew G. Knepley } 1660a0541d8aSMatthew G. Knepley } 1661a0541d8aSMatthew G. Knepley } 1662a0541d8aSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1663a0541d8aSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1664a0541d8aSMatthew G. Knepley } 1665cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1666c4d480a2SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 1667cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1668d24f5ce5SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1669d24f5ce5SMatthew G. Knepley cMax = cMax < 0 ? cEnd : cMax; 16700f66a230SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 1671cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 167286200784SMatthew G. Knepley if (blabel) {ierr = DMLabelGetStratumIS(blabel, 2, &crossEdgeIS);CHKERRQ(ierr);} 167386200784SMatthew G. Knepley if (dimIS && crossEdgeIS) { 167486200784SMatthew G. Knepley IS vertIS = dimIS; 167586200784SMatthew G. Knepley 167686200784SMatthew G. Knepley ierr = ISExpand(vertIS, crossEdgeIS, &dimIS);CHKERRQ(ierr); 167786200784SMatthew G. Knepley ierr = ISDestroy(&crossEdgeIS);CHKERRQ(ierr); 167886200784SMatthew G. Knepley ierr = ISDestroy(&vertIS);CHKERRQ(ierr); 167986200784SMatthew G. Knepley } 1680dc86033cSMatthew G. Knepley if (!dimIS) { 1681dc86033cSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1682dc86033cSMatthew G. Knepley PetscFunctionReturn(0); 1683dc86033cSMatthew G. Knepley } 1684cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1685cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1686d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */ 1687cd0c2139SMatthew G Knepley PetscInt *star = NULL; 168886200784SMatthew G. Knepley PetscInt starSize, s; 1689cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1690cd0c2139SMatthew G Knepley 1691d4622b2cSMatthew G. Knepley /* All points connected to the fault are inside a cell, so at the top level we will only check cells */ 1692cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1693cd0c2139SMatthew G Knepley while (again) { 1694cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1695cd0c2139SMatthew G Knepley again = 0; 1696cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1697cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1698cd0c2139SMatthew G Knepley const PetscInt *cone; 1699cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1700cd0c2139SMatthew G Knepley 1701d24f5ce5SMatthew G. Knepley if ((point < cStart) || (point >= cMax)) continue; 1702cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1703cd0c2139SMatthew G Knepley if (val != -1) continue; 1704d4622b2cSMatthew G. Knepley again = again == 1 ? 1 : 2; 1705cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1706cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1707cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1708cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1709cd0c2139SMatthew G Knepley if (val != -1) { 1710d7c8f101SMatthew G. Knepley const PetscInt *ccone; 1711166d9d0cSMatthew G. Knepley PetscInt cconeSize, cc, side; 1712d7c8f101SMatthew G. Knepley 1713db8edaafSMatthew 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); 171437a6de01SMatthew G. Knepley if (val > 0) side = 1; 171537a6de01SMatthew G. Knepley else side = -1; 171637a6de01SMatthew G. Knepley ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr); 1717d7c8f101SMatthew G. Knepley /* Mark cell faces which touch the fault */ 1718d7c8f101SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr); 1719d7c8f101SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr); 1720d7c8f101SMatthew G. Knepley for (cc = 0; cc < cconeSize; ++cc) { 1721d7c8f101SMatthew G. Knepley PetscInt *closure = NULL; 1722d7c8f101SMatthew G. Knepley PetscInt closureSize, cl; 1723d7c8f101SMatthew G. Knepley 1724166d9d0cSMatthew G. Knepley ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr); 1725166d9d0cSMatthew G. Knepley if (val != -1) continue; 1726d7c8f101SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1727d4622b2cSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1728d7c8f101SMatthew G. Knepley const PetscInt clp = closure[cl]; 1729d7c8f101SMatthew G. Knepley 1730d7c8f101SMatthew G. Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1731d7c8f101SMatthew G. Knepley if (val == -1) continue; 1732d7c8f101SMatthew G. Knepley ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr); 173337a6de01SMatthew G. Knepley break; 173437a6de01SMatthew G. Knepley } 1735d7c8f101SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1736cd0c2139SMatthew G Knepley } 1737cd0c2139SMatthew G Knepley again = 1; 1738cd0c2139SMatthew G Knepley break; 1739cd0c2139SMatthew G Knepley } 1740cd0c2139SMatthew G Knepley } 1741cd0c2139SMatthew G Knepley } 1742cd0c2139SMatthew G Knepley } 1743cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1744cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1745cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1746cd0c2139SMatthew G Knepley 1747cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1748cd0c2139SMatthew G Knepley if (val == -1) { 1749cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1750cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1751cd0c2139SMatthew G Knepley PetscBool marked = PETSC_FALSE; 1752cd0c2139SMatthew G Knepley 1753cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1754cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1755cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1756cd0c2139SMatthew G Knepley 1757d24f5ce5SMatthew G. Knepley if ((spoint < cStart) || (spoint >= cMax)) continue; 1758cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1759cd0c2139SMatthew 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); 1760d90583fdSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1761cd0c2139SMatthew G Knepley if (val > 0) { 1762cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1763cd0c2139SMatthew G Knepley } else { 1764cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1765cd0c2139SMatthew G Knepley } 1766cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1767cd0c2139SMatthew G Knepley break; 1768cd0c2139SMatthew G Knepley } 1769cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1770370472baSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1771370472baSMatthew G. Knepley if (point < pMax[dep] && !marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1772cd0c2139SMatthew G Knepley } 1773cd0c2139SMatthew G Knepley } 1774cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1775cd0c2139SMatthew G Knepley } 1776cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1777cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 177818c5995bSMatthew G. Knepley /* If any faces touching the fault divide cells on either side, split them */ 177918c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift+dim-1, &facePosIS);CHKERRQ(ierr); 178018c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr); 178118c5995bSMatthew G. Knepley ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr); 178218c5995bSMatthew G. Knepley ierr = ISDestroy(&facePosIS);CHKERRQ(ierr); 178318c5995bSMatthew G. Knepley ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr); 178418c5995bSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 178518c5995bSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 178618c5995bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 178718c5995bSMatthew G. Knepley const PetscInt point = points[p]; 178818c5995bSMatthew G. Knepley const PetscInt *support; 178918c5995bSMatthew G. Knepley PetscInt supportSize, valA, valB; 179018c5995bSMatthew G. Knepley 179118c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 179218c5995bSMatthew G. Knepley if (supportSize != 2) continue; 179318c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 179418c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr); 179518c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr); 179618c5995bSMatthew G. Knepley if ((valA == -1) || (valB == -1)) continue; 179718c5995bSMatthew G. Knepley if (valA*valB > 0) continue; 179818c5995bSMatthew G. Knepley /* Split the face */ 179918c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr); 180018c5995bSMatthew G. Knepley ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr); 180118c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr); 1802e1757548SMatthew G. Knepley /* Label its closure: 1803e1757548SMatthew G. Knepley unmarked: label as unsplit 1804e1757548SMatthew G. Knepley incident: relabel as split 1805e1757548SMatthew G. Knepley split: do nothing 1806e1757548SMatthew G. Knepley */ 180718c5995bSMatthew G. Knepley { 180818c5995bSMatthew G. Knepley PetscInt *closure = NULL; 180918c5995bSMatthew G. Knepley PetscInt closureSize, cl; 181018c5995bSMatthew G. Knepley 181118c5995bSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 181218c5995bSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 181318c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr); 18148771c1d3SMatthew G. Knepley if (valA == -1) { /* Mark as unsplit */ 181518c5995bSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 181618c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr); 18178771c1d3SMatthew G. Knepley } else if (((valA >= shift) && (valA < shift2)) || ((valA <= -shift) && (valA > -shift2))) { 1818e1757548SMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 1819e1757548SMatthew G. Knepley ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr); 1820e1757548SMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr); 1821e1757548SMatthew G. Knepley } 182218c5995bSMatthew G. Knepley } 182318c5995bSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 182418c5995bSMatthew G. Knepley } 182518c5995bSMatthew G. Knepley } 182618c5995bSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 182718c5995bSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1828370472baSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1829cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1830cd0c2139SMatthew G Knepley } 1831cd0c2139SMatthew G Knepley 1832cd0c2139SMatthew G Knepley #undef __FUNCT__ 18333cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh" 18343cf72582SMatthew G. Knepley /*@C 18353cf72582SMatthew G. Knepley DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface 18363cf72582SMatthew G. Knepley 18373cf72582SMatthew G. Knepley Collective on dm 18383cf72582SMatthew G. Knepley 18393cf72582SMatthew G. Knepley Input Parameters: 18403cf72582SMatthew G. Knepley + dm - The original DM 18413cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices 18423cf72582SMatthew G. Knepley 18433cf72582SMatthew G. Knepley Output Parameters: 18443cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface 18453cf72582SMatthew G. Knepley - dmHybrid - The new DM 18463cf72582SMatthew G. Knepley 18473cf72582SMatthew G. Knepley Level: developer 18483cf72582SMatthew G. Knepley 18493cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate() 18503cf72582SMatthew G. Knepley @*/ 18513cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid) 18523cf72582SMatthew G. Knepley { 18533cf72582SMatthew G. Knepley DM idm; 18543cf72582SMatthew G. Knepley DMLabel subpointMap, hlabel; 18553cf72582SMatthew G. Knepley PetscInt dim; 18563cf72582SMatthew G. Knepley PetscErrorCode ierr; 18573cf72582SMatthew G. Knepley 18583cf72582SMatthew G. Knepley PetscFunctionBegin; 18593cf72582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 18603cf72582SMatthew G. Knepley if (hybridLabel) PetscValidPointer(hybridLabel, 3); 18613cf72582SMatthew G. Knepley PetscValidPointer(dmHybrid, 4); 1862c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 18633cf72582SMatthew G. Knepley ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr); 18643cf72582SMatthew G. Knepley ierr = DMPlexOrient(idm);CHKERRQ(ierr); 18653cf72582SMatthew G. Knepley ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr); 18663cf72582SMatthew G. Knepley ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr); 18673cf72582SMatthew G. Knepley ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr); 18680f66a230SMatthew G. Knepley ierr = DMPlexLabelCohesiveComplete(dm, hlabel, NULL, PETSC_FALSE, idm);CHKERRQ(ierr); 18693cf72582SMatthew G. Knepley ierr = DMDestroy(&idm);CHKERRQ(ierr); 18703cf72582SMatthew G. Knepley ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr); 18713cf72582SMatthew G. Knepley if (hybridLabel) *hybridLabel = hlabel; 187253aa2e23SMatthew G. Knepley else {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);} 1873e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1874e6ccafaeSMatthew G Knepley } 1875e6ccafaeSMatthew G Knepley 1876e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1877efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated" 1878efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 1879efa14ee0SMatthew G Knepley 1880efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 1881efa14ee0SMatthew G Knepley */ 1882830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1883efa14ee0SMatthew G Knepley { 1884fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 1885efa14ee0SMatthew G Knepley const PetscInt *subvertices; 188677d178adSMatthew G. Knepley PetscInt *pStart, *pEnd, *pMax, pSize; 1887efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1888efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1889efa14ee0SMatthew G Knepley 1890efa14ee0SMatthew G Knepley PetscFunctionBegin; 1891efa14ee0SMatthew G Knepley *numFaces = 0; 1892efa14ee0SMatthew G Knepley *nFV = 0; 1893efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1894c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 189577d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1896dcca6d9dSJed Brown ierr = PetscMalloc3(pSize,&pStart,pSize,&pEnd,pSize,&pMax);CHKERRQ(ierr); 1897d92e47f8SMatthew 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); 1898efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 1899efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1900efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1901efa14ee0SMatthew G Knepley } 1902efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1903fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1904efa14ee0SMatthew G Knepley if (subvertexIS) { 1905efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1906efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1907efa14ee0SMatthew G Knepley } 1908efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1909efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 19100298fd71SBarry Smith PetscInt *star = NULL; 1911efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 1912efa14ee0SMatthew G Knepley 1913efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1914efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1915efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1916efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1917efa14ee0SMatthew G Knepley } 1918efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 1919efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 19200298fd71SBarry Smith PetscInt *closure = NULL; 1921efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 1922efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 1923efa14ee0SMatthew G Knepley 1924efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 192565560c7fSMatthew G Knepley if (cellLoc == 2) continue; 192682f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1927efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1928efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1929efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1930efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1931efa14ee0SMatthew G Knepley 1932efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1933efa14ee0SMatthew G Knepley ++numCorners; 1934efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1935830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 1936efa14ee0SMatthew G Knepley } 1937efa14ee0SMatthew G Knepley } 193818ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 193982f516ccSBarry 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); 1940efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 1941007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 1942007baee2SMatthew G. Knepley PetscInt numCells, nc; 1943007baee2SMatthew G. Knepley 1944efa14ee0SMatthew G Knepley ++(*numFaces); 1945efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 1946efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 1947efa14ee0SMatthew G Knepley } 1948007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1949007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 1950007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 1951007baee2SMatthew G. Knepley } 1952007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1953efa14ee0SMatthew G Knepley } 1954efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1955efa14ee0SMatthew G Knepley } 1956efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1957efa14ee0SMatthew G Knepley } 1958efa14ee0SMatthew G Knepley if (subvertexIS) { 1959efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1960efa14ee0SMatthew G Knepley } 1961efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1962efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1963efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1964efa14ee0SMatthew G Knepley } 1965efa14ee0SMatthew G Knepley 1966efa14ee0SMatthew G Knepley #undef __FUNCT__ 1967efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated" 1968830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 1969efa14ee0SMatthew G Knepley { 197034b4c39eSMatthew G. Knepley IS subvertexIS = NULL; 1971efa14ee0SMatthew G Knepley const PetscInt *subvertices; 1972efa14ee0SMatthew G Knepley PetscInt *pStart, *pEnd, *pMax; 1973efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 1974efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1975efa14ee0SMatthew G Knepley 1976efa14ee0SMatthew G Knepley PetscFunctionBegin; 1977c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1978dcca6d9dSJed Brown ierr = PetscMalloc3(dim+1,&pStart,dim+1,&pEnd,dim+1,&pMax);CHKERRQ(ierr); 19790298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1980efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 1981efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1982efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1983efa14ee0SMatthew G Knepley } 1984efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 198534b4c39eSMatthew G. Knepley if (vertexLabel) { 1986830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 1987efa14ee0SMatthew G Knepley if (subvertexIS) { 1988efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1989efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1990efa14ee0SMatthew G Knepley } 199134b4c39eSMatthew G. Knepley } 1992efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1993efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 19940298fd71SBarry Smith PetscInt *star = NULL; 1995efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 1996efa14ee0SMatthew G Knepley 1997efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1998efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1999efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 2000efa14ee0SMatthew G Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 2001efa14ee0SMatthew G Knepley } 2002efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 2003efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 20040298fd71SBarry Smith PetscInt *closure = NULL; 2005efa14ee0SMatthew G Knepley PetscInt closureSize, c; 2006efa14ee0SMatthew G Knepley PetscInt faceLoc; 2007efa14ee0SMatthew G Knepley 2008efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 2009efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 201082f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 2011efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2012efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 2013efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 2014efa14ee0SMatthew G Knepley PetscInt vertexLoc; 2015efa14ee0SMatthew G Knepley 2016efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 2017efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 2018830e53efSMatthew G. Knepley if (vertexLoc != value) break; 2019efa14ee0SMatthew G Knepley } 2020efa14ee0SMatthew G Knepley } 2021efa14ee0SMatthew G Knepley if (c == closureSize*2) { 2022efa14ee0SMatthew G Knepley const PetscInt *support; 2023efa14ee0SMatthew G Knepley PetscInt supportSize, s; 2024efa14ee0SMatthew G Knepley 2025efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 2026efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 2027efa14ee0SMatthew G Knepley 2028efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 2029efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 2030efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 2031efa14ee0SMatthew G Knepley break; 2032efa14ee0SMatthew G Knepley } 2033efa14ee0SMatthew G Knepley } 2034efa14ee0SMatthew G Knepley } 2035efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2036efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2037efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 2038efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 2039efa14ee0SMatthew G Knepley } 2040efa14ee0SMatthew G Knepley } 2041efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2042efa14ee0SMatthew G Knepley } 2043efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 2044efa14ee0SMatthew G Knepley } 204534b4c39eSMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);} 2046efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2047efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 2048efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 2049efa14ee0SMatthew G Knepley } 2050efa14ee0SMatthew G Knepley 2051efa14ee0SMatthew G Knepley #undef __FUNCT__ 2052766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated" 205327c04023SMatthew 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) 2054766ab985SMatthew G. Knepley { 205527c04023SMatthew G. Knepley DMLabel label = NULL; 2056766ab985SMatthew G. Knepley const PetscInt *cone; 205727234c99SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize; 2058766ab985SMatthew G. Knepley PetscErrorCode ierr; 2059766ab985SMatthew G. Knepley 2060812bfc34SJed Brown PetscFunctionBegin; 2061c0ed958bSJed Brown *numFaces = 0; 2062c0ed958bSJed Brown *nFV = 0; 2063c58f1c22SToby Isaac if (labelname) {ierr = DMGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 2064fed694aaSMatthew G. Knepley *subCells = NULL; 2065c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2066766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 2067766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2068766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 206927c04023SMatthew G. Knepley if (label) { 207027c04023SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 207127c04023SMatthew G. Knepley PetscInt val; 207227c04023SMatthew G. Knepley 207327c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 207427c04023SMatthew G. Knepley if (val == value) { 207527c04023SMatthew G. Knepley ++(*numFaces); 207627c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 207727c04023SMatthew G. Knepley } 207827c04023SMatthew G. Knepley } 207927c04023SMatthew G. Knepley } else { 2080766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 208127c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 208227c04023SMatthew G. Knepley } 2083766ab985SMatthew G. Knepley *nFV = hasLagrange ? coneSize/3 : coneSize/2; 2084785e854fSJed Brown ierr = PetscMalloc1(*numFaces *2, subCells);CHKERRQ(ierr); 2085766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 2086766ab985SMatthew G. Knepley const PetscInt *cells; 2087766ab985SMatthew G. Knepley PetscInt numCells; 2088766ab985SMatthew G. Knepley 208927c04023SMatthew G. Knepley if (label) { 209027c04023SMatthew G. Knepley PetscInt val; 209127c04023SMatthew G. Knepley 209227c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 209327c04023SMatthew G. Knepley if (val != value) continue; 209427c04023SMatthew G. Knepley } 2095766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2096766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 2097766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 2098766ab985SMatthew G. Knepley } 2099766ab985SMatthew G. Knepley /* Negative face */ 2100766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 210127234c99SMatthew G. Knepley /* Not true in parallel 210227234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 2103766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 2104766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 210527234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 2106766ab985SMatthew G. Knepley } 2107766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 2108766ab985SMatthew G. Knepley /* Positive face is not included */ 2109766ab985SMatthew G. Knepley } 2110766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2111766ab985SMatthew G. Knepley } 2112766ab985SMatthew G. Knepley 2113766ab985SMatthew G. Knepley #undef __FUNCT__ 2114766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated" 21153982b651SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, DMLabel label, PetscInt value, DMLabel subpointMap, DM subdm) 2116766ab985SMatthew G. Knepley { 2117766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 2118766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 2119766ab985SMatthew G. Knepley PetscErrorCode ierr; 2120766ab985SMatthew G. Knepley 2121812bfc34SJed Brown PetscFunctionBegin; 2122c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2123766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 2124766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2125766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 2126dcca6d9dSJed Brown ierr = PetscMalloc2(dim+1,&pStart,dim+1,&pEnd);CHKERRQ(ierr); 2127b3154360SMatthew G. Knepley for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);} 2128766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 2129766ab985SMatthew G. Knepley const PetscInt *cone; 2130766ab985SMatthew G. Knepley PetscInt *closure = NULL; 2131b3154360SMatthew G. Knepley PetscInt fconeSize, coneSize, closureSize, cl, val; 2132766ab985SMatthew G. Knepley 213327c04023SMatthew G. Knepley if (label) { 213427c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 213527c04023SMatthew G. Knepley if (val != value) continue; 213627c04023SMatthew G. Knepley } 2137766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2138766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2139b3154360SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr); 2140b3154360SMatthew G. Knepley if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 2141b3154360SMatthew G. Knepley /* Negative face */ 2142766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2143766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2144766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 2145766ab985SMatthew G. Knepley 2146766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2147766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 2148766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 2149766ab985SMatthew G. Knepley break; 2150766ab985SMatthew G. Knepley } 2151766ab985SMatthew G. Knepley } 2152766ab985SMatthew G. Knepley } 2153766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2154766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 2155766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 2156766ab985SMatthew G. Knepley const PetscInt *support; 2157766ab985SMatthew G. Knepley PetscInt supportSize, s; 2158766ab985SMatthew G. Knepley 2159766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 2160711de394SMatthew G. Knepley /* if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); */ 2161766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 2162766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 2163766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 2164766ab985SMatthew G. Knepley } 2165766ab985SMatthew G. Knepley } 2166766ab985SMatthew G. Knepley } 2167766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 2168766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2169766ab985SMatthew G. Knepley } 2170766ab985SMatthew G. Knepley 2171766ab985SMatthew G. Knepley #undef __FUNCT__ 2172e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation" 2173e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2174e6ccafaeSMatthew G Knepley { 217582f516ccSBarry Smith MPI_Comm comm; 2176e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 2177e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 2178e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 2179e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2180e6ccafaeSMatthew G Knepley 218182f516ccSBarry Smith PetscFunctionBegin; 218282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2183c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &cellDim);CHKERRQ(ierr); 2184e6ccafaeSMatthew G Knepley if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 2185e6ccafaeSMatthew G Knepley 2186ddeab2a6SMatthew G. Knepley if (cellDim == 1 && numCorners == 2) { 2187ddeab2a6SMatthew G. Knepley /* Triangle */ 2188e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 2189e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2190ddeab2a6SMatthew G. Knepley } else if (cellDim == 2 && numCorners == 3) { 2191ddeab2a6SMatthew G. Knepley /* Triangle */ 2192ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2193ddeab2a6SMatthew G. Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2194ddeab2a6SMatthew G. Knepley } else if (cellDim == 3 && numCorners == 4) { 2195ddeab2a6SMatthew G. Knepley /* Tetrahedron */ 2196ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2197ddeab2a6SMatthew G. Knepley posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2198e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 2199e6ccafaeSMatthew G Knepley /* Quadratic line */ 2200e6ccafaeSMatthew G Knepley faceSize = 1; 2201e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2202e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 2203e6ccafaeSMatthew G Knepley /* Quads */ 2204e6ccafaeSMatthew G Knepley faceSize = 2; 2205e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 2206e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2207e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 2208e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2209e6ccafaeSMatthew G Knepley } else { 2210e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 2211e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 2212e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 2213e6ccafaeSMatthew G Knepley } 2214e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 2215e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 2216e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2217e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 2218e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2219e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2220e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 2221e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2222e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2223e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 2224e6ccafaeSMatthew G Knepley }; 2225e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 2226e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2227e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2228e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 2229e6ccafaeSMatthew G Knepley }; 2230e6ccafaeSMatthew G Knepley 2231e6ccafaeSMatthew G Knepley faceSize = faceSizeTri; 2232e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 2233e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 2234e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 2235e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 2236e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2237e6ccafaeSMatthew G Knepley 2238e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 2239e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 2240e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 2241e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 2242e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 2243e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2244e6ccafaeSMatthew G Knepley break; 2245e6ccafaeSMatthew G Knepley } 2246e6ccafaeSMatthew G Knepley } 2247e6ccafaeSMatthew G Knepley } 2248e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2249e6ccafaeSMatthew G Knepley break; 2250e6ccafaeSMatthew G Knepley } 2251e6ccafaeSMatthew G Knepley } 2252e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 2253e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2254e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2255e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 2256e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 2257e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2258e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 2259e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2260e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2261e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 2262e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2263e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2264e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2265e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 2266e6ccafaeSMatthew G Knepley }; 2267e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 2268e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2269e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2270e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2271e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 2272e6ccafaeSMatthew G Knepley }; 2273e6ccafaeSMatthew G Knepley 2274e6ccafaeSMatthew G Knepley faceSize = faceSizeQuad; 2275e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 2276e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 2277e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 2278e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 2279e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2280e6ccafaeSMatthew G Knepley 2281e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 2282e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 2283e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 2284e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 2285e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 2286e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2287e6ccafaeSMatthew G Knepley break; 2288e6ccafaeSMatthew G Knepley } 2289e6ccafaeSMatthew G Knepley } 2290e6ccafaeSMatthew G Knepley } 2291e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2292e6ccafaeSMatthew G Knepley break; 2293e6ccafaeSMatthew G Knepley } 2294e6ccafaeSMatthew G Knepley } 2295e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 2296e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2297e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2298e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 2299e6ccafaeSMatthew G Knepley /* Hexes 2300e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2301e6ccafaeSMatthew G Knepley pointing up at the second. 2302e6ccafaeSMatthew G Knepley 2303e6ccafaeSMatthew G Knepley 7---6 2304e6ccafaeSMatthew G Knepley /| /| 2305e6ccafaeSMatthew G Knepley 4---5 | 2306ddeab2a6SMatthew G. Knepley | 1-|-2 2307e6ccafaeSMatthew G Knepley |/ |/ 2308ddeab2a6SMatthew G. Knepley 0---3 2309e6ccafaeSMatthew G Knepley 2310e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2311e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 2312e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 2313e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2314e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 2315e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 2316e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2317ddeab2a6SMatthew G. Knepley 0, 3, 4, 5, /* front */ 2318ddeab2a6SMatthew G. Knepley 2, 3, 5, 6, /* right */ 2319ddeab2a6SMatthew G. Knepley 1, 2, 6, 7, /* back */ 2320ddeab2a6SMatthew G. Knepley 0, 1, 4, 7, /* left */ 2321e6ccafaeSMatthew G Knepley }; 2322e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 2323ddeab2a6SMatthew G. Knepley 1, 2, 3, 0, /* bottom */ 2324e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2325ddeab2a6SMatthew G. Knepley 0, 3, 5, 4, /* front */ 2326ddeab2a6SMatthew G. Knepley 3, 2, 6, 5, /* right */ 2327ddeab2a6SMatthew G. Knepley 2, 1, 7, 6, /* back */ 2328ddeab2a6SMatthew G. Knepley 1, 0, 4, 7, /* left */ 2329e6ccafaeSMatthew G Knepley }; 2330e6ccafaeSMatthew G Knepley 2331e6ccafaeSMatthew G Knepley faceSize = faceSizeHex; 2332e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 2333e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 2334e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2335e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 2336e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2337e6ccafaeSMatthew G Knepley 2338e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 2339e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 2340e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 2341e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 2342e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 2343e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 2344e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 2345e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2346e6ccafaeSMatthew G Knepley break; 2347e6ccafaeSMatthew G Knepley } 2348e6ccafaeSMatthew G Knepley } 2349e6ccafaeSMatthew G Knepley } 2350e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2351e6ccafaeSMatthew G Knepley break; 2352e6ccafaeSMatthew G Knepley } 2353e6ccafaeSMatthew G Knepley } 2354e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2355e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2356e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2357e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 2358e6ccafaeSMatthew G Knepley /* Quadratic tet */ 2359e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 2360e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 2361e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 2362e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2363e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 2364e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2365e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 2366e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 2367e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 2368e6ccafaeSMatthew G Knepley }; 2369e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 2370e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2371e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 2372e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 2373e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 2374e6ccafaeSMatthew G Knepley }; 2375e6ccafaeSMatthew G Knepley 2376e6ccafaeSMatthew G Knepley faceSize = faceSizeTet; 2377e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 2378e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 2379e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 2380e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 2381e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2382e6ccafaeSMatthew G Knepley 2383e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 2384e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 2385e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 2386e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 2387e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 2388e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 2389e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 2390e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2391e6ccafaeSMatthew G Knepley break; 2392e6ccafaeSMatthew G Knepley } 2393e6ccafaeSMatthew G Knepley } 2394e6ccafaeSMatthew G Knepley } 2395e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2396e6ccafaeSMatthew G Knepley break; 2397e6ccafaeSMatthew G Knepley } 2398e6ccafaeSMatthew G Knepley } 2399e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 2400e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2401e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2402e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 2403e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 2404e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2405e6ccafaeSMatthew G Knepley pointing up at the second. 2406e6ccafaeSMatthew G Knepley 2407e6ccafaeSMatthew G Knepley 7---6 2408e6ccafaeSMatthew G Knepley /| /| 2409e6ccafaeSMatthew G Knepley 4---5 | 2410e6ccafaeSMatthew G Knepley | 3-|-2 2411e6ccafaeSMatthew G Knepley |/ |/ 2412e6ccafaeSMatthew G Knepley 0---1 2413e6ccafaeSMatthew G Knepley 2414e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2415e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 2416e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 2417e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2418e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 2419e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 2420e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2421e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 2422e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 2423e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 2424e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 2425e6ccafaeSMatthew G Knepley }; 2426e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 2427e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 2428e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2429e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 2430e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 2431e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 2432e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 2433e6ccafaeSMatthew G Knepley }; 2434e6ccafaeSMatthew G Knepley 2435e6ccafaeSMatthew G Knepley faceSize = faceSizeQuadHex; 2436e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 2437e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 2438e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2439e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 2440e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2441e6ccafaeSMatthew G Knepley 2442e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 2443e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 2444e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 2445e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 2446e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 2447e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 2448e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 2449e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2450e6ccafaeSMatthew G Knepley break; 2451e6ccafaeSMatthew G Knepley } 2452e6ccafaeSMatthew G Knepley } 2453e6ccafaeSMatthew G Knepley } 2454e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2455e6ccafaeSMatthew G Knepley break; 2456e6ccafaeSMatthew G Knepley } 2457e6ccafaeSMatthew G Knepley } 2458e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2459e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2460e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2461e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 2462e6ccafaeSMatthew G Knepley if (!posOrient) { 2463e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 2464e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 2465e6ccafaeSMatthew G Knepley } else { 2466e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 2467e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 2468e6ccafaeSMatthew G Knepley } 2469e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 2470e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2471e6ccafaeSMatthew G Knepley } 2472e6ccafaeSMatthew G Knepley 2473e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2474e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace" 2475e6ccafaeSMatthew G Knepley /* 2476e6ccafaeSMatthew G Knepley Given a cell and a face, as a set of vertices, 2477e6ccafaeSMatthew G Knepley return the oriented face, as a set of vertices, in faceVertices 2478e6ccafaeSMatthew G Knepley The orientation is such that the face normal points out of the cell 2479e6ccafaeSMatthew G Knepley */ 2480e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2481e6ccafaeSMatthew G Knepley { 24820298fd71SBarry Smith const PetscInt *cone = NULL; 2483e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 2484e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 2485e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2486e6ccafaeSMatthew G Knepley 2487e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2488e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 2489e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 2490e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 2491e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2492e6ccafaeSMatthew G Knepley 2493e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 2494e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 2495e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 2496e6ccafaeSMatthew G Knepley } 2497e6ccafaeSMatthew G Knepley } 2498e6ccafaeSMatthew G Knepley if (found) { 2499e6ccafaeSMatthew G Knepley indices[v2] = v; 2500e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 2501e6ccafaeSMatthew G Knepley ++v2; 2502e6ccafaeSMatthew G Knepley } else { 2503e6ccafaeSMatthew G Knepley oppositeVertex = v; 2504e6ccafaeSMatthew G Knepley } 2505e6ccafaeSMatthew G Knepley } 2506e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 2507e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2508e6ccafaeSMatthew G Knepley } 2509e6ccafaeSMatthew G Knepley 2510e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2511cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal" 2512e6ccafaeSMatthew G Knepley /* 2513cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 2514e6ccafaeSMatthew G Knepley 2515e6ccafaeSMatthew G Knepley Not collective 2516e6ccafaeSMatthew G Knepley 2517e6ccafaeSMatthew G Knepley Input Parameters: 2518e6ccafaeSMatthew G Knepley + dm - The DMPlex 2519e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 2520e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 2521e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 2522e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 2523e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 2524e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 2525e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 2526e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 2527e6ccafaeSMatthew G Knepley 2528e6ccafaeSMatthew G Knepley Output Parameters: 2529e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 2530e6ccafaeSMatthew G Knepley 2531e6ccafaeSMatthew G Knepley Level: developer 2532e6ccafaeSMatthew G Knepley */ 2533cd0c2139SMatthew 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) 2534e6ccafaeSMatthew G Knepley { 253582f516ccSBarry Smith MPI_Comm comm; 2536e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 2537e6ccafaeSMatthew G Knepley const PetscInt *faces; 2538e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 2539e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2540e6ccafaeSMatthew G Knepley 2541e6ccafaeSMatthew G Knepley PetscFunctionBegin; 254282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2543e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 2544e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 2545e6ccafaeSMatthew G Knepley #if 0 2546e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 2547e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2548e6ccafaeSMatthew G Knepley #else 2549e6ccafaeSMatthew G Knepley { 2550e6ccafaeSMatthew G Knepley PetscInt f; 2551e6ccafaeSMatthew G Knepley 2552e6ccafaeSMatthew G Knepley numFaces = 0; 2553e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2554e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 2555e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 2556e6ccafaeSMatthew G Knepley 2557e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 2558e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 2559e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 2560e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 2561e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 2562e6ccafaeSMatthew G Knepley PetscInt v; 2563e6ccafaeSMatthew G Knepley 2564e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2565e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 2566e6ccafaeSMatthew G Knepley } 2567e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 2568e6ccafaeSMatthew G Knepley } 2569e6ccafaeSMatthew G Knepley if (d == dof) { 2570e6ccafaeSMatthew G Knepley numFaces = 1; 2571e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 2572e6ccafaeSMatthew G Knepley } 2573e6ccafaeSMatthew G Knepley } 2574e6ccafaeSMatthew G Knepley } 2575e6ccafaeSMatthew G Knepley #endif 2576e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 2577e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 2578e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 2579766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 2580e6ccafaeSMatthew G Knepley } else { 2581e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 2582e6ccafaeSMatthew G Knepley PetscBool posOriented; 2583e6ccafaeSMatthew G Knepley 2584e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2585e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 2586e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 2587e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 2588e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 2589e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 2590e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2591e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 2592e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 2593e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 2594e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 2595e6ccafaeSMatthew G Knepley break; 2596e6ccafaeSMatthew G Knepley } 2597e6ccafaeSMatthew G Knepley } 2598e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 2599e6ccafaeSMatthew G Knepley } 2600e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 2601e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 2602e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2603e6ccafaeSMatthew G Knepley ++(*newFacePoint); 2604e6ccafaeSMatthew G Knepley } 2605ef07cca7SMatthew G. Knepley #if 0 2606e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2607ef07cca7SMatthew G. Knepley #else 2608ef07cca7SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2609ef07cca7SMatthew G. Knepley #endif 2610e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2611e6ccafaeSMatthew G Knepley } 2612e6ccafaeSMatthew G Knepley 2613e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2614e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated" 261553156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2616e6ccafaeSMatthew G Knepley { 261782f516ccSBarry Smith MPI_Comm comm; 261853156dfcSMatthew G. Knepley DMLabel subpointMap; 2619efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 2620efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 2621efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 2622fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 2623efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 2624e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2625e6ccafaeSMatthew G Knepley 2626e6ccafaeSMatthew G Knepley PetscFunctionBegin; 262782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2628efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2629efa14ee0SMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2630efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2631efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 263253156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);} 2633efa14ee0SMatthew G Knepley /* Setup chart */ 2634efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2635efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2636efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2637efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2638e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2639e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 2640efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 2641e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 2642efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2643efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2644efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 2645efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2646e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2647e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2648e6ccafaeSMatthew G Knepley } 2649e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2650e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2651e6ccafaeSMatthew G Knepley } 2652e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2653e6ccafaeSMatthew G Knepley /* Create face cones */ 2654efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 26550298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2656efa14ee0SMatthew G Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2657e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2658e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 2659efa14ee0SMatthew G Knepley const PetscInt subcell = c; 26600298fd71SBarry Smith PetscInt *closure = NULL; 2661efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 2662e6ccafaeSMatthew G Knepley 2663e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2664efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2665efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 2666e6ccafaeSMatthew G Knepley PetscInt subVertex; 2667e6ccafaeSMatthew G Knepley 2668efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 2669efa14ee0SMatthew G Knepley ++numCorners; 2670efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 2671efa14ee0SMatthew G Knepley if (subVertex >= 0) { 2672efa14ee0SMatthew G Knepley closure[faceSize] = point; 267365560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 2674e6ccafaeSMatthew G Knepley ++faceSize; 2675e6ccafaeSMatthew G Knepley } 2676e6ccafaeSMatthew G Knepley } 2677e6ccafaeSMatthew G Knepley } 2678efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 2679efa14ee0SMatthew G Knepley if (faceSize == nFV) { 2680cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 2681e6ccafaeSMatthew G Knepley } 268265560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2683e6ccafaeSMatthew G Knepley } 2684efa14ee0SMatthew G Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2685e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2686e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2687e6ccafaeSMatthew G Knepley /* Build coordinates */ 2688efa14ee0SMatthew G Knepley { 2689efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 2690efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 2691efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 2692285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 269324640c55SToby Isaac const char *name; 2694efa14ee0SMatthew G Knepley 269569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2696e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 269769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2698285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2699285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2700285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2701efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2702efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2703efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2704efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2705efa14ee0SMatthew G Knepley PetscInt dof; 2706efa14ee0SMatthew G Knepley 2707efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2708efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2709285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2710e6ccafaeSMatthew G Knepley } 2711e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2712e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2713e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 271424640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 271524640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr); 2716e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 27172eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2718830e53efSMatthew G. Knepley if (coordSize) { 2719e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2720e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2721efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2722efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2723efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2724efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2725e6ccafaeSMatthew G Knepley 2726e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2727e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2728efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2729efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2730efa14ee0SMatthew 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); 2731e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2732e6ccafaeSMatthew G Knepley } 2733e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2734e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 27353b399e24SMatthew G. Knepley } 2736e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2737e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2738e6ccafaeSMatthew G Knepley } 2739efa14ee0SMatthew G Knepley /* Cleanup */ 2740efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2741efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2742efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2743efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2744e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2745e6ccafaeSMatthew G Knepley } 2746e6ccafaeSMatthew G Knepley 2747e6ccafaeSMatthew G Knepley #undef __FUNCT__ 27483982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal" 27493982b651SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 27503982b651SMatthew G. Knepley { 27513982b651SMatthew G. Knepley PetscInt subPoint; 27523982b651SMatthew G. Knepley PetscErrorCode ierr; 27533982b651SMatthew G. Knepley 27543982b651SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 27553982b651SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 27563982b651SMatthew G. Knepley } 27573982b651SMatthew G. Knepley 27583982b651SMatthew G. Knepley #undef __FUNCT__ 27593982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateSubmeshGeneric_Interpolated" 2760bec263e5SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmeshGeneric_Interpolated(DM dm, DMLabel label, PetscInt value, PetscBool isCohesive, PetscInt cellHeight, DM subdm) 2761e6ccafaeSMatthew G Knepley { 276282f516ccSBarry Smith MPI_Comm comm; 276353156dfcSMatthew G. Knepley DMLabel subpointMap; 2764efa14ee0SMatthew G Knepley IS *subpointIS; 2765efa14ee0SMatthew G Knepley const PetscInt **subpoints; 27663982b651SMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *orntNew; 2767efa14ee0SMatthew G Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2768e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2769e6ccafaeSMatthew G Knepley 2770e6ccafaeSMatthew G Knepley PetscFunctionBegin; 277182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2772efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2773e6ccafaeSMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2774efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2775bec263e5SMatthew G. Knepley if (cellHeight) { 27763982b651SMatthew G. Knepley if (isCohesive) {ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);} 27773982b651SMatthew G. Knepley else {ierr = DMPlexMarkSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);} 2778bec263e5SMatthew G. Knepley } else { 2779bec263e5SMatthew G. Knepley DMLabel depth; 2780bec263e5SMatthew G. Knepley IS pointIS; 2781bec263e5SMatthew G. Knepley const PetscInt *points; 2782bec263e5SMatthew G. Knepley PetscInt numPoints; 2783bec263e5SMatthew G. Knepley 2784bec263e5SMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depth);CHKERRQ(ierr); 2785bec263e5SMatthew G. Knepley ierr = DMLabelGetStratumSize(label, value, &numPoints);CHKERRQ(ierr); 2786bec263e5SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, value, &pointIS);CHKERRQ(ierr); 2787bec263e5SMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 2788bec263e5SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 2789bec263e5SMatthew G. Knepley PetscInt *closure = NULL; 2790bec263e5SMatthew G. Knepley PetscInt closureSize, c, pdim; 2791bec263e5SMatthew G. Knepley 2792bec263e5SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2793bec263e5SMatthew G. Knepley for (c = 0; c < closureSize*2; c += 2) { 2794bec263e5SMatthew G. Knepley ierr = DMLabelGetValue(depth, closure[c], &pdim);CHKERRQ(ierr); 2795bec263e5SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, closure[c], pdim);CHKERRQ(ierr); 2796bec263e5SMatthew G. Knepley } 2797bec263e5SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2798bec263e5SMatthew G. Knepley } 2799bec263e5SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 2800bec263e5SMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 2801bec263e5SMatthew G. Knepley } 2802bec263e5SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 2803efa14ee0SMatthew G Knepley /* Setup chart */ 2804c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2805dcca6d9dSJed Brown ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr); 2806e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2807e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2808e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 2809e6ccafaeSMatthew G Knepley } 2810e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2811bec263e5SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, cellHeight);CHKERRQ(ierr); 2812e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2813e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 2814e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2815e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2816e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2817e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2818e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 28190ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2820e6ccafaeSMatthew G Knepley } 2821e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2822e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2823e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2824e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2825e6ccafaeSMatthew G Knepley const PetscInt *cone; 2826e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 2827e6ccafaeSMatthew G Knepley 2828e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2829e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2830bec263e5SMatthew G. Knepley if (cellHeight && (d == dim)) { 2831e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2832e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2833e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2834e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 2835e6ccafaeSMatthew G Knepley } 2836e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2837e6ccafaeSMatthew G Knepley } 2838e6ccafaeSMatthew G Knepley } 2839e6ccafaeSMatthew G Knepley } 2840e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2841e6ccafaeSMatthew G Knepley /* Set cones */ 28420298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 28433982b651SMatthew G. Knepley ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&orntNew);CHKERRQ(ierr); 2844e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2845e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2846e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2847e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 28480e49e2e2SMatthew G. Knepley const PetscInt *cone, *ornt; 2849e6ccafaeSMatthew G Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2850e6ccafaeSMatthew G Knepley 2851e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2852e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2853e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 28540e49e2e2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2855e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2856e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 285701a2673eSMatthew G. Knepley if (subc >= 0) { 285801a2673eSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 28593982b651SMatthew G. Knepley orntNew[coneSizeNew] = ornt[c]; 286001a2673eSMatthew G. Knepley ++coneSizeNew; 286101a2673eSMatthew G. Knepley } 2862e6ccafaeSMatthew G Knepley } 2863e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2864e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 28653982b651SMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, orntNew);CHKERRQ(ierr); 2866e6ccafaeSMatthew G Knepley } 2867e6ccafaeSMatthew G Knepley } 28683982b651SMatthew G. Knepley ierr = PetscFree2(coneNew,orntNew);CHKERRQ(ierr); 2869e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2870e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2871e6ccafaeSMatthew G Knepley /* Build coordinates */ 2872e6ccafaeSMatthew G Knepley { 2873e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 2874e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 2875e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 2876285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 287724640c55SToby Isaac const char *name; 2878e6ccafaeSMatthew G Knepley 287969d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2880e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 288169d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2882285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2883285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2884285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2885e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2886e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2887e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2888e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2889e6ccafaeSMatthew G Knepley PetscInt dof; 2890e6ccafaeSMatthew G Knepley 2891e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2892e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2893285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2894e6ccafaeSMatthew G Knepley } 2895e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2896e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2897e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 289824640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 289924640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr); 2900e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 29012eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2902e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2903e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2904e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2905e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2906e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2907e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2908e6ccafaeSMatthew G Knepley 2909e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2910e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2911e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2912e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2913e6ccafaeSMatthew 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); 2914efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2915e6ccafaeSMatthew G Knepley } 2916e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2917e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2918e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2919e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2920e6ccafaeSMatthew G Knepley } 29213982b651SMatthew G. Knepley /* Build SF: We need this complexity because subpoints might not be selected on the owning process */ 29223982b651SMatthew G. Knepley { 29233982b651SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 29243982b651SMatthew G. Knepley IS subpIS; 29253982b651SMatthew G. Knepley const PetscSFNode *remotePoints; 29263982b651SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 29273982b651SMatthew G. Knepley const PetscInt *localPoints, *subpoints; 29283982b651SMatthew G. Knepley PetscInt *slocalPoints; 29293982b651SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubpoints = 0, numSubroots, numSubleaves = 0, l, sl, ll, pStart, pEnd, p; 29303982b651SMatthew G. Knepley PetscMPIInt rank; 29313982b651SMatthew G. Knepley 29323982b651SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 29333982b651SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 29343982b651SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 29353982b651SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 29363982b651SMatthew G. Knepley ierr = DMPlexGetChart(subdm, NULL, &numSubroots);CHKERRQ(ierr); 29373982b651SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpIS);CHKERRQ(ierr); 29383982b651SMatthew G. Knepley if (subpIS) { 29393982b651SMatthew G. Knepley ierr = ISGetIndices(subpIS, &subpoints);CHKERRQ(ierr); 29403982b651SMatthew G. Knepley ierr = ISGetLocalSize(subpIS, &numSubpoints);CHKERRQ(ierr); 29413982b651SMatthew G. Knepley } 29423982b651SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 29433982b651SMatthew G. Knepley if (numRoots >= 0) { 29443982b651SMatthew G. Knepley ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 29453982b651SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 29463982b651SMatthew G. Knepley newLocalPoints[p].rank = -2; 29473982b651SMatthew G. Knepley newLocalPoints[p].index = -2; 29483982b651SMatthew G. Knepley } 29493982b651SMatthew G. Knepley /* Set subleaves */ 29503982b651SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 29513982b651SMatthew G. Knepley const PetscInt point = localPoints[l]; 29523982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 29533982b651SMatthew G. Knepley 29543982b651SMatthew G. Knepley if (subpoint < 0) continue; 29553982b651SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 29563982b651SMatthew G. Knepley newLocalPoints[point-pStart].index = subpoint; 29573982b651SMatthew G. Knepley ++numSubleaves; 29583982b651SMatthew G. Knepley } 29593982b651SMatthew G. Knepley /* Must put in owned subpoints */ 29603982b651SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 29613982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(p, 0, numSubpoints, subpoints); 29623982b651SMatthew G. Knepley 29633982b651SMatthew G. Knepley if (subpoint < 0) { 29643982b651SMatthew G. Knepley newOwners[p-pStart].rank = -3; 29653982b651SMatthew G. Knepley newOwners[p-pStart].index = -3; 29663982b651SMatthew G. Knepley } else { 29673982b651SMatthew G. Knepley newOwners[p-pStart].rank = rank; 29683982b651SMatthew G. Knepley newOwners[p-pStart].index = subpoint; 29693982b651SMatthew G. Knepley } 29703982b651SMatthew G. Knepley } 29713982b651SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 29723982b651SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 29733982b651SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 29743982b651SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 29753982b651SMatthew G. Knepley ierr = PetscMalloc1(numSubleaves, &slocalPoints);CHKERRQ(ierr); 29763982b651SMatthew G. Knepley ierr = PetscMalloc1(numSubleaves, &sremotePoints);CHKERRQ(ierr); 29773982b651SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 29783982b651SMatthew G. Knepley const PetscInt point = localPoints[l]; 29793982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 29803982b651SMatthew G. Knepley 29813982b651SMatthew G. Knepley if (subpoint < 0) continue; 29823982b651SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 29833982b651SMatthew G. Knepley slocalPoints[sl] = subpoint; 29843982b651SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 29853982b651SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 29863982b651SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 29873982b651SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 29883982b651SMatthew G. Knepley ++sl; 29893982b651SMatthew G. Knepley } 29903982b651SMatthew G. Knepley if (sl + ll != numSubleaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubleaves); 29913982b651SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 29923982b651SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubroots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 29933982b651SMatthew G. Knepley } 29943982b651SMatthew G. Knepley if (subpIS) { 29953982b651SMatthew G. Knepley ierr = ISRestoreIndices(subpIS, &subpoints);CHKERRQ(ierr); 29963982b651SMatthew G. Knepley ierr = ISDestroy(&subpIS);CHKERRQ(ierr); 29973982b651SMatthew G. Knepley } 29983982b651SMatthew G. Knepley } 2999efa14ee0SMatthew G Knepley /* Cleanup */ 3000e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 30010ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 3002e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 3003e6ccafaeSMatthew G Knepley } 3004efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 3005e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3006e6ccafaeSMatthew G Knepley } 3007e6ccafaeSMatthew G Knepley 3008e6ccafaeSMatthew G Knepley #undef __FUNCT__ 30093982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated" 30103982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 30113982b651SMatthew G. Knepley { 30123982b651SMatthew G. Knepley PetscErrorCode ierr; 30133982b651SMatthew G. Knepley 30143982b651SMatthew G. Knepley PetscFunctionBegin; 3015bec263e5SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, vertexLabel, value, PETSC_FALSE, 1, subdm);CHKERRQ(ierr); 30163982b651SMatthew G. Knepley PetscFunctionReturn(0); 30173982b651SMatthew G. Knepley } 30183982b651SMatthew G. Knepley 30193982b651SMatthew G. Knepley #undef __FUNCT__ 3020e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh" 3021d0fa310fSMatthew G. Knepley /*@ 3022e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 3023e6ccafaeSMatthew G Knepley 3024e6ccafaeSMatthew G Knepley Input Parameters: 3025e6ccafaeSMatthew G Knepley + dm - The original mesh 3026830e53efSMatthew G. Knepley . vertexLabel - The DMLabel marking vertices contained in the surface 3027830e53efSMatthew G. Knepley - value - The label value to use 3028e6ccafaeSMatthew G Knepley 3029e6ccafaeSMatthew G Knepley Output Parameter: 3030e6ccafaeSMatthew G Knepley . subdm - The surface mesh 3031e6ccafaeSMatthew G Knepley 3032e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3033e6ccafaeSMatthew G Knepley 3034e6ccafaeSMatthew G Knepley Level: developer 3035e6ccafaeSMatthew G Knepley 3036c58f1c22SToby Isaac .seealso: DMPlexGetSubpointMap(), DMGetLabel(), DMLabelSetValue() 3037830e53efSMatthew G. Knepley @*/ 303853156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm) 3039e6ccafaeSMatthew G Knepley { 3040e6ccafaeSMatthew G Knepley PetscInt dim, depth; 3041e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3042e6ccafaeSMatthew G Knepley 3043e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3044e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3045766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 3046c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3047e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 304882f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 3049e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3050c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr); 3051e6ccafaeSMatthew G Knepley if (depth == dim) { 3052830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 3053e6ccafaeSMatthew G Knepley } else { 3054830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 3055e6ccafaeSMatthew G Knepley } 3056e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3057e6ccafaeSMatthew G Knepley } 3058e6ccafaeSMatthew G Knepley 3059e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3060766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated" 306127c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 3062766ab985SMatthew G. Knepley { 3063766ab985SMatthew G. Knepley MPI_Comm comm; 3064766ab985SMatthew G. Knepley DMLabel subpointMap; 3065766ab985SMatthew G. Knepley IS subvertexIS; 3066766ab985SMatthew G. Knepley const PetscInt *subVertices; 3067fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 3068766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 306987feddfdSMatthew G. Knepley PetscInt cMax, c, f; 3070766ab985SMatthew G. Knepley PetscErrorCode ierr; 3071766ab985SMatthew G. Knepley 3072766ab985SMatthew G. Knepley PetscFunctionBegin; 3073766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 3074766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 3075766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 3076766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 3077766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 307827c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 3079766ab985SMatthew G. Knepley /* Setup chart */ 3080766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 3081766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 3082766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 3083766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 3084766ab985SMatthew G. Knepley /* Set cone sizes */ 3085766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 3086766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 3087766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 3088766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 3089766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 3090766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 3091766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 3092766ab985SMatthew G. Knepley } 3093766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 3094766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 3095766ab985SMatthew G. Knepley } 3096766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 3097766ab985SMatthew G. Knepley /* Create face cones */ 3098766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 309987feddfdSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 3100766ab985SMatthew G. Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 3101766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 3102766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 3103766ab985SMatthew G. Knepley const PetscInt subcell = c; 310487feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 310587feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 3106766ab985SMatthew G. Knepley 310787feddfdSMatthew G. Knepley if (cell < cMax) continue; 310887feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 310987feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 311087feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 311187feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 311287feddfdSMatthew G. Knepley } 311387feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 311487feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 311587feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 311627234c99SMatthew G. Knepley /* Not true in parallel 311727234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 311887feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 311987feddfdSMatthew G. Knepley PetscInt negsubcell; 3120766ab985SMatthew G. Knepley 312187feddfdSMatthew G. Knepley if (cells[p] >= cMax) continue; 312287feddfdSMatthew G. Knepley /* I know this is a crap search */ 312387feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 312487feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 3125766ab985SMatthew G. Knepley } 312687feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 312787feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 3128766ab985SMatthew G. Knepley } 312987feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 313087feddfdSMatthew G. Knepley ++newFacePoint; 3131766ab985SMatthew G. Knepley } 3132766ab985SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 3133766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 3134766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 3135766ab985SMatthew G. Knepley /* Build coordinates */ 3136766ab985SMatthew G. Knepley { 3137766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 3138766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 3139766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 3140285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 314124640c55SToby Isaac const char *name; 3142766ab985SMatthew G. Knepley 314369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3144766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 314569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 3146285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 3147285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 3148285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 3149766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 3150766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 3151766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 3152766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 3153766ab985SMatthew G. Knepley PetscInt dof; 3154766ab985SMatthew G. Knepley 3155766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3156766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 3157285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 3158766ab985SMatthew G. Knepley } 3159766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 3160766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 3161766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 316224640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 316324640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr); 3164766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 31652eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 3166766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 3167766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3168766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 3169766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 3170766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 3171766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 3172766ab985SMatthew G. Knepley 3173766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3174766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 3175766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 3176766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 3177766ab985SMatthew 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); 3178766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 3179766ab985SMatthew G. Knepley } 3180766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3181766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3182766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 3183766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 3184766ab985SMatthew G. Knepley } 3185aca35d17SMatthew G. Knepley /* Build SF */ 3186aca35d17SMatthew G. Knepley CHKMEMQ; 3187aca35d17SMatthew G. Knepley { 3188aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 3189aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 3190bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 3191aca35d17SMatthew G. Knepley const PetscInt *localPoints; 3192bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 319349c26ae4SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 3194bdcf2095SMatthew G. Knepley PetscMPIInt rank; 3195aca35d17SMatthew G. Knepley 3196bdcf2095SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 3197aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 3198aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 3199aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3200aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3201aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 3202aca35d17SMatthew G. Knepley if (numRoots >= 0) { 3203aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 3204dcca6d9dSJed Brown ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 3205bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 3206bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 3207bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 3208bdcf2095SMatthew G. Knepley } 32099e0823b2SMatthew G. Knepley /* Set subleaves */ 3210aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 3211aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 3212bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 3213aca35d17SMatthew G. Knepley 3214aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 3215bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 3216bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 3217bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 3218bdcf2095SMatthew G. Knepley ++numSubLeaves; 3219aca35d17SMatthew G. Knepley } 32209e0823b2SMatthew G. Knepley /* Must put in owned subpoints */ 32219e0823b2SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 32229e0823b2SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 32239e0823b2SMatthew G. Knepley 32249e0823b2SMatthew G. Knepley if (subPoint < 0) { 32259e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = -3; 32269e0823b2SMatthew G. Knepley newOwners[p-pStart].index = -3; 32279e0823b2SMatthew G. Knepley } else { 32289e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = rank; 32299e0823b2SMatthew G. Knepley newOwners[p-pStart].index = subPoint; 32309e0823b2SMatthew G. Knepley } 3231bdcf2095SMatthew G. Knepley } 3232bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3233bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3234bdcf2095SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3235bdcf2095SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3236785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &slocalPoints);CHKERRQ(ierr); 3237785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &sremotePoints);CHKERRQ(ierr); 323849c26ae4SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 3239bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 3240bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 3241aca35d17SMatthew G. Knepley 3242aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 324349c26ae4SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 3244aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 3245bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 3246bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 3247bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 3248bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 3249aca35d17SMatthew G. Knepley ++sl; 3250aca35d17SMatthew G. Knepley } 3251bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 325249c26ae4SMatthew G. Knepley if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 325349c26ae4SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 3254aca35d17SMatthew G. Knepley } 3255aca35d17SMatthew G. Knepley } 3256aca35d17SMatthew G. Knepley CHKMEMQ; 3257766ab985SMatthew G. Knepley /* Cleanup */ 3258766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 3259766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 3260766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 3261766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3262766ab985SMatthew G. Knepley } 3263766ab985SMatthew G. Knepley 3264766ab985SMatthew G. Knepley #undef __FUNCT__ 3265766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated" 32663982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DM subdm) 3267766ab985SMatthew G. Knepley { 32683982b651SMatthew G. Knepley DMLabel label = NULL; 3269766ab985SMatthew G. Knepley PetscErrorCode ierr; 3270766ab985SMatthew G. Knepley 3271766ab985SMatthew G. Knepley PetscFunctionBegin; 3272c58f1c22SToby Isaac if (labelname) {ierr = DMGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 3273bec263e5SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, label, value, PETSC_TRUE, 1, subdm);CHKERRQ(ierr); 3274766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3275766ab985SMatthew G. Knepley } 3276766ab985SMatthew G. Knepley 3277766ab985SMatthew G. Knepley #undef __FUNCT__ 3278766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh" 3279766ab985SMatthew G. Knepley /* 328027c04023SMatthew 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. 3281766ab985SMatthew G. Knepley 3282766ab985SMatthew G. Knepley Input Parameters: 3283766ab985SMatthew G. Knepley + dm - The original mesh 328427c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 32857afc1a8bSJed Brown . label - A label name, or NULL 328627c04023SMatthew G. Knepley - value - A label value 3287766ab985SMatthew G. Knepley 3288766ab985SMatthew G. Knepley Output Parameter: 3289766ab985SMatthew G. Knepley . subdm - The surface mesh 3290766ab985SMatthew G. Knepley 3291766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3292766ab985SMatthew G. Knepley 3293766ab985SMatthew G. Knepley Level: developer 3294766ab985SMatthew G. Knepley 3295766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 3296766ab985SMatthew G. Knepley */ 329727c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 3298766ab985SMatthew G. Knepley { 3299766ab985SMatthew G. Knepley PetscInt dim, depth; 3300766ab985SMatthew G. Knepley PetscErrorCode ierr; 3301766ab985SMatthew G. Knepley 3302766ab985SMatthew G. Knepley PetscFunctionBegin; 3303766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 330427c04023SMatthew G. Knepley PetscValidPointer(subdm, 5); 3305c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3306766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3307766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 3308766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3309c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr); 3310766ab985SMatthew G. Knepley if (depth == dim) { 3311b3154360SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr); 3312766ab985SMatthew G. Knepley } else { 331327c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 3314e6ccafaeSMatthew G Knepley } 3315e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3316e6ccafaeSMatthew G Knepley } 3317e6ccafaeSMatthew G Knepley 3318e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3319bec263e5SMatthew G. Knepley #define __FUNCT__ "DMPlexFilter" 3320bec263e5SMatthew G. Knepley /*@ 3321bec263e5SMatthew G. Knepley DMPlexFilter - Extract a subset of mesh cells defined by a label as a separate mesh 3322bec263e5SMatthew G. Knepley 3323bec263e5SMatthew G. Knepley Input Parameters: 3324bec263e5SMatthew G. Knepley + dm - The original mesh 3325bec263e5SMatthew G. Knepley . cellLabel - The DMLabel marking cells contained in the new mesh 3326bec263e5SMatthew G. Knepley - value - The label value to use 3327bec263e5SMatthew G. Knepley 3328bec263e5SMatthew G. Knepley Output Parameter: 3329bec263e5SMatthew G. Knepley . subdm - The new mesh 3330bec263e5SMatthew G. Knepley 3331bec263e5SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3332bec263e5SMatthew G. Knepley 3333bec263e5SMatthew G. Knepley Level: developer 3334bec263e5SMatthew G. Knepley 3335c58f1c22SToby Isaac .seealso: DMPlexGetSubpointMap(), DMGetLabel(), DMLabelSetValue() 3336bec263e5SMatthew G. Knepley @*/ 3337bec263e5SMatthew G. Knepley PetscErrorCode DMPlexFilter(DM dm, DMLabel cellLabel, PetscInt value, DM *subdm) 3338bec263e5SMatthew G. Knepley { 3339bec263e5SMatthew G. Knepley PetscInt dim; 3340bec263e5SMatthew G. Knepley PetscErrorCode ierr; 3341bec263e5SMatthew G. Knepley 3342bec263e5SMatthew G. Knepley PetscFunctionBegin; 3343bec263e5SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3344bec263e5SMatthew G. Knepley PetscValidPointer(subdm, 3); 3345bec263e5SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3346bec263e5SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject) dm), subdm);CHKERRQ(ierr); 3347bec263e5SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3348bec263e5SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim);CHKERRQ(ierr); 3349bec263e5SMatthew G. Knepley /* Extract submesh in place, could be empty on some procs, could have inconsistency if procs do not both extract a shared cell */ 3350bec263e5SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, cellLabel, value, PETSC_FALSE, 0, *subdm);CHKERRQ(ierr); 3351bec263e5SMatthew G. Knepley PetscFunctionReturn(0); 3352bec263e5SMatthew G. Knepley } 3353bec263e5SMatthew G. Knepley 3354bec263e5SMatthew G. Knepley #undef __FUNCT__ 3355e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap" 335664beef6dSMatthew G. Knepley /*@ 335764beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 335864beef6dSMatthew G. Knepley 335964beef6dSMatthew G. Knepley Input Parameter: 336064beef6dSMatthew G. Knepley . dm - The submesh DM 336164beef6dSMatthew G. Knepley 336264beef6dSMatthew G. Knepley Output Parameter: 336364beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 336464beef6dSMatthew G. Knepley 336564beef6dSMatthew G. Knepley Level: developer 336664beef6dSMatthew G. Knepley 336764beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 336864beef6dSMatthew G. Knepley @*/ 3369e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 3370e6ccafaeSMatthew G Knepley { 3371e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3372e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3373e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 337465663942SMatthew G. Knepley *subpointMap = ((DM_Plex*) dm->data)->subpointMap; 3375e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3376e6ccafaeSMatthew G Knepley } 3377e6ccafaeSMatthew G Knepley 3378e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3379e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap" 3380e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */ 3381e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 3382e6ccafaeSMatthew G Knepley { 3383e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 3384285d324eSMatthew G. Knepley DMLabel tmp; 3385e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3386e6ccafaeSMatthew G Knepley 3387e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3388e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3389285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 3390e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 3391285d324eSMatthew G. Knepley ++mesh->subpointMap->refct; 3392285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 3393e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3394e6ccafaeSMatthew G Knepley } 3395e6ccafaeSMatthew G Knepley 3396e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3397e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS" 339864beef6dSMatthew G. Knepley /*@ 3399e6ccafaeSMatthew G Knepley DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 3400e6ccafaeSMatthew G Knepley 3401e6ccafaeSMatthew G Knepley Input Parameter: 3402e6ccafaeSMatthew G Knepley . dm - The submesh DM 3403e6ccafaeSMatthew G Knepley 3404e6ccafaeSMatthew G Knepley Output Parameter: 34050298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 3406e6ccafaeSMatthew G Knepley 34073982b651SMatthew G. Knepley Note: This IS is guaranteed to be sorted by the construction of the submesh 340864beef6dSMatthew G. Knepley 340964beef6dSMatthew G. Knepley Level: developer 341064beef6dSMatthew G. Knepley 341164beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 341264beef6dSMatthew G. Knepley @*/ 3413e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 3414e6ccafaeSMatthew G Knepley { 341582f516ccSBarry Smith MPI_Comm comm; 3416e6ccafaeSMatthew G Knepley DMLabel subpointMap; 3417e6ccafaeSMatthew G Knepley IS is; 3418e6ccafaeSMatthew G Knepley const PetscInt *opoints; 3419e6ccafaeSMatthew G Knepley PetscInt *points, *depths; 3420e6ccafaeSMatthew G Knepley PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 3421e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3422e6ccafaeSMatthew G Knepley 3423e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3424e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3425e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 342682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 34270298fd71SBarry Smith *subpointIS = NULL; 3428e6ccafaeSMatthew G Knepley ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 3429e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3430fed694aaSMatthew G. Knepley if (subpointMap && depth >= 0) { 3431e6ccafaeSMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3432e6ccafaeSMatthew G Knepley if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 3433e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3434e6ccafaeSMatthew G Knepley depths[0] = depth; 3435e6ccafaeSMatthew G Knepley depths[1] = 0; 3436e6ccafaeSMatthew G Knepley for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 3437785e854fSJed Brown ierr = PetscMalloc1(pEnd, &points);CHKERRQ(ierr); 3438e6ccafaeSMatthew G Knepley for(d = 0, off = 0; d <= depth; ++d) { 3439e6ccafaeSMatthew G Knepley const PetscInt dep = depths[d]; 3440e6ccafaeSMatthew G Knepley 3441e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 3442e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 34431e21b6fdSMatthew G Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 3444e6ccafaeSMatthew 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); 3445e6ccafaeSMatthew G Knepley } else { 34461e21b6fdSMatthew G Knepley if (!n) { 34471e21b6fdSMatthew G Knepley if (d == 0) { 34481e21b6fdSMatthew G Knepley /* Missing cells */ 34491e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 34501e21b6fdSMatthew G Knepley } else { 34511e21b6fdSMatthew G Knepley /* Missing faces */ 34521e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 34531e21b6fdSMatthew G Knepley } 34541e21b6fdSMatthew G Knepley } 3455e6ccafaeSMatthew G Knepley } 3456e6ccafaeSMatthew G Knepley if (n) { 3457e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 3458e6ccafaeSMatthew G Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 3459e6ccafaeSMatthew G Knepley for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 3460e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 3461e6ccafaeSMatthew G Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 3462e6ccafaeSMatthew G Knepley } 3463e6ccafaeSMatthew G Knepley } 3464e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3465e6ccafaeSMatthew G Knepley if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 3466fed694aaSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 3467e6ccafaeSMatthew G Knepley } 3468e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3469e6ccafaeSMatthew G Knepley } 3470