1af0996ceSBarry Smith #include <petsc/private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 20c312b8eSJed Brown #include <petscsf.h> 3e6ccafaeSMatthew G Knepley 4e6ccafaeSMatthew G Knepley #undef __FUNCT__ 530560a7bSMatthew G. Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces_Internal" 630560a7bSMatthew G. Knepley PetscErrorCode DMPlexMarkBoundaryFaces_Internal(DM dm, PetscInt cellHeight, DMLabel label) 730560a7bSMatthew G. Knepley { 830560a7bSMatthew G. Knepley PetscInt fStart, fEnd, f; 930560a7bSMatthew G. Knepley PetscErrorCode ierr; 1030560a7bSMatthew G. Knepley 1130560a7bSMatthew G. Knepley PetscFunctionBegin; 1230560a7bSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1330560a7bSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight+1, &fStart, &fEnd);CHKERRQ(ierr); 1430560a7bSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 1530560a7bSMatthew G. Knepley PetscInt supportSize; 1630560a7bSMatthew G. Knepley 1730560a7bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 1830560a7bSMatthew G. Knepley if (supportSize == 1) {ierr = DMLabelSetValue(label, f, 1);CHKERRQ(ierr);} 1930560a7bSMatthew G. Knepley } 2030560a7bSMatthew G. Knepley PetscFunctionReturn(0); 2130560a7bSMatthew G. Knepley } 2230560a7bSMatthew G. Knepley 2330560a7bSMatthew G. Knepley #undef __FUNCT__ 24cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces" 25cd0c2139SMatthew G Knepley /*@ 26cd0c2139SMatthew G Knepley DMPlexMarkBoundaryFaces - Mark all faces on the boundary 27cd0c2139SMatthew G Knepley 28cd0c2139SMatthew G Knepley Not Collective 29cd0c2139SMatthew G Knepley 30cd0c2139SMatthew G Knepley Input Parameter: 31cd0c2139SMatthew G Knepley . dm - The original DM 32cd0c2139SMatthew G Knepley 33cd0c2139SMatthew G Knepley Output Parameter: 34cd0c2139SMatthew G Knepley . label - The DMLabel marking boundary faces with value 1 35cd0c2139SMatthew G Knepley 36cd0c2139SMatthew G Knepley Level: developer 37cd0c2139SMatthew G Knepley 38cd0c2139SMatthew G Knepley .seealso: DMLabelCreate(), DMPlexCreateLabel() 3909f723d9SJed Brown @*/ 40cd0c2139SMatthew G Knepley PetscErrorCode DMPlexMarkBoundaryFaces(DM dm, DMLabel label) 41cd0c2139SMatthew G Knepley { 42cd0c2139SMatthew G Knepley PetscErrorCode ierr; 43cd0c2139SMatthew G Knepley 44cd0c2139SMatthew G Knepley PetscFunctionBegin; 4574e03af4SMatthew G. Knepley ierr = DMPlexMarkBoundaryFaces_Internal(dm, 0, label);CHKERRQ(ierr); 46cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 47cd0c2139SMatthew G Knepley } 48cd0c2139SMatthew G Knepley 49cd0c2139SMatthew G Knepley #undef __FUNCT__ 502be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelComplete" 512be2b188SMatthew G Knepley /*@ 522be2b188SMatthew G Knepley DMPlexLabelComplete - Starting with a label marking points on a surface, we add the transitive closure to the surface 532be2b188SMatthew G Knepley 542be2b188SMatthew G Knepley Input Parameters: 552be2b188SMatthew G Knepley + dm - The DM 562be2b188SMatthew G Knepley - label - A DMLabel marking the surface points 572be2b188SMatthew G Knepley 582be2b188SMatthew G Knepley Output Parameter: 592be2b188SMatthew G Knepley . label - A DMLabel marking all surface points in the transitive closure 602be2b188SMatthew G Knepley 612be2b188SMatthew G Knepley Level: developer 622be2b188SMatthew G Knepley 632be2b188SMatthew G Knepley .seealso: DMPlexLabelCohesiveComplete() 642be2b188SMatthew G Knepley @*/ 652be2b188SMatthew G Knepley PetscErrorCode DMPlexLabelComplete(DM dm, DMLabel label) 662be2b188SMatthew G Knepley { 672be2b188SMatthew G Knepley IS valueIS; 682be2b188SMatthew G Knepley const PetscInt *values; 692be2b188SMatthew G Knepley PetscInt numValues, v; 702be2b188SMatthew G Knepley PetscErrorCode ierr; 712be2b188SMatthew G Knepley 722be2b188SMatthew G Knepley PetscFunctionBegin; 732be2b188SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 742be2b188SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 752be2b188SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 762be2b188SMatthew G Knepley for (v = 0; v < numValues; ++v) { 772be2b188SMatthew G Knepley IS pointIS; 782be2b188SMatthew G Knepley const PetscInt *points; 792be2b188SMatthew G Knepley PetscInt numPoints, p; 802be2b188SMatthew G Knepley 812be2b188SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 822be2b188SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 832be2b188SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 842be2b188SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 852be2b188SMatthew G Knepley PetscInt *closure = NULL; 862be2b188SMatthew G Knepley PetscInt closureSize, c; 872be2b188SMatthew G Knepley 882be2b188SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 892be2b188SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 902be2b188SMatthew G Knepley ierr = DMLabelSetValue(label, closure[c], values[v]);CHKERRQ(ierr); 912be2b188SMatthew G Knepley } 922be2b188SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 932be2b188SMatthew G Knepley } 942be2b188SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 952be2b188SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 962be2b188SMatthew G Knepley } 972be2b188SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 982be2b188SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 992be2b188SMatthew G Knepley PetscFunctionReturn(0); 1002be2b188SMatthew G Knepley } 1012be2b188SMatthew G Knepley 1022be2b188SMatthew G Knepley #undef __FUNCT__ 1036cf0e42fSMatthew G. Knepley #define __FUNCT__ "DMPlexLabelAddCells" 1046cf0e42fSMatthew G. Knepley /*@ 1056cf0e42fSMatthew G. Knepley DMPlexLabelAddCells - Starting with a label marking faces on a surface, we add a cell for each face 1066cf0e42fSMatthew G. Knepley 1076cf0e42fSMatthew G. Knepley Input Parameters: 1086cf0e42fSMatthew G. Knepley + dm - The DM 1096cf0e42fSMatthew G. Knepley - label - A DMLabel marking the surface points 1106cf0e42fSMatthew G. Knepley 1116cf0e42fSMatthew G. Knepley Output Parameter: 1126cf0e42fSMatthew G. Knepley . label - A DMLabel incorporating cells 1136cf0e42fSMatthew G. Knepley 1146cf0e42fSMatthew G. Knepley Level: developer 1156cf0e42fSMatthew G. Knepley 1166cf0e42fSMatthew G. Knepley Note: The cells allow FEM boundary conditions to be applied using the cell geometry 1176cf0e42fSMatthew G. Knepley 1186cf0e42fSMatthew G. Knepley .seealso: DMPlexLabelComplete(), DMPlexLabelCohesiveComplete() 1196cf0e42fSMatthew G. Knepley @*/ 1206cf0e42fSMatthew G. Knepley PetscErrorCode DMPlexLabelAddCells(DM dm, DMLabel label) 1216cf0e42fSMatthew G. Knepley { 1226cf0e42fSMatthew G. Knepley IS valueIS; 1236cf0e42fSMatthew G. Knepley const PetscInt *values; 12422eabd52SMatthew G. Knepley PetscInt numValues, v, cStart, cEnd, cEndInterior; 1256cf0e42fSMatthew G. Knepley PetscErrorCode ierr; 1266cf0e42fSMatthew G. Knepley 1276cf0e42fSMatthew G. Knepley PetscFunctionBegin; 1286cf0e42fSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 12922eabd52SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cEndInterior, NULL, NULL, NULL);CHKERRQ(ierr); 13022eabd52SMatthew G. Knepley cEnd = cEndInterior < 0 ? cEnd : cEndInterior; 1316cf0e42fSMatthew G. Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 1326cf0e42fSMatthew G. Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 1336cf0e42fSMatthew G. Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 1346cf0e42fSMatthew G. Knepley for (v = 0; v < numValues; ++v) { 1356cf0e42fSMatthew G. Knepley IS pointIS; 1366cf0e42fSMatthew G. Knepley const PetscInt *points; 1376cf0e42fSMatthew G. Knepley PetscInt numPoints, p; 1386cf0e42fSMatthew G. Knepley 1396cf0e42fSMatthew G. Knepley ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 1406cf0e42fSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 1416cf0e42fSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 1426cf0e42fSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1436cf0e42fSMatthew G. Knepley PetscInt *closure = NULL; 14422eabd52SMatthew G. Knepley PetscInt closureSize, point, cl; 1456cf0e42fSMatthew G. Knepley 1466cf0e42fSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 14722eabd52SMatthew G. Knepley for (cl = closureSize-1; cl > 0; --cl) { 14822eabd52SMatthew G. Knepley point = closure[cl*2]; 14922eabd52SMatthew G. Knepley if ((point >= cStart) && (point < cEnd)) {ierr = DMLabelSetValue(label, point, values[v]);CHKERRQ(ierr); break;} 15022eabd52SMatthew G. Knepley } 1516cf0e42fSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 1526cf0e42fSMatthew G. Knepley } 1536cf0e42fSMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 1546cf0e42fSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 1556cf0e42fSMatthew G. Knepley } 1566cf0e42fSMatthew G. Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1576cf0e42fSMatthew G. Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1586cf0e42fSMatthew G. Knepley PetscFunctionReturn(0); 1596cf0e42fSMatthew G. Knepley } 1606cf0e42fSMatthew G. Knepley 1616cf0e42fSMatthew G. Knepley #undef __FUNCT__ 1622582d50cSToby Isaac #define __FUNCT__ "DMPlexShiftPointSetUp_Internal" 16359eef20bSToby Isaac /* take (oldEnd, added) pairs, ordered by height and convert them to (oldstart, newstart) pairs, ordered by ascending 16459eef20bSToby Isaac * index (skipping first, which is (0,0)) */ 1652582d50cSToby Isaac PETSC_STATIC_INLINE PetscErrorCode DMPlexShiftPointSetUp_Internal(PetscInt depth, PetscInt depthShift[]) 166cd0c2139SMatthew G Knepley { 1672582d50cSToby Isaac PetscInt d, off = 0; 1682582d50cSToby Isaac 1692582d50cSToby Isaac PetscFunctionBegin; 17059eef20bSToby Isaac /* sort by (oldend): yes this is an O(n^2) sort, we expect depth <= 3 */ 171*0974a383SToby Isaac for (d = 0; d < depth; d++) { 1722582d50cSToby Isaac PetscInt firstd = d; 173*0974a383SToby Isaac PetscInt firstStart = depthShift[2*d]; 1742582d50cSToby Isaac PetscInt e; 1752582d50cSToby Isaac 1762582d50cSToby Isaac for (e = d+1; e <= depth; e++) { 1772582d50cSToby Isaac if (depthShift[2*e] < firstStart) { 1782582d50cSToby Isaac firstd = e; 1792582d50cSToby Isaac firstStart = depthShift[2*d]; 1802582d50cSToby Isaac } 1812582d50cSToby Isaac } 1822582d50cSToby Isaac if (firstd != d) { 1832582d50cSToby Isaac PetscInt swap[2]; 1842582d50cSToby Isaac 1852582d50cSToby Isaac e = firstd; 1862582d50cSToby Isaac swap[0] = depthShift[2*d]; 1872582d50cSToby Isaac swap[1] = depthShift[2*d+1]; 1882582d50cSToby Isaac depthShift[2*d] = depthShift[2*e]; 1892582d50cSToby Isaac depthShift[2*d+1] = depthShift[2*e+1]; 1902582d50cSToby Isaac depthShift[2*e] = swap[0]; 1912582d50cSToby Isaac depthShift[2*e+1] = swap[1]; 1922582d50cSToby Isaac } 1932582d50cSToby Isaac } 1942582d50cSToby Isaac /* convert (oldstart, added) to (oldstart, newstart) */ 195*0974a383SToby Isaac for (d = 0; d <= depth; d++) { 1962582d50cSToby Isaac off += depthShift[2*d+1]; 19759eef20bSToby Isaac depthShift[2*d+1] = depthShift[2*d] + off; 1982582d50cSToby Isaac } 1992582d50cSToby Isaac PetscFunctionReturn(0); 2002582d50cSToby Isaac } 2012582d50cSToby Isaac 2022582d50cSToby Isaac #undef __FUNCT__ 2032582d50cSToby Isaac #define __FUNCT__ "DMPlexShiftPoint_Internal" 2042582d50cSToby Isaac /* depthShift is a list of (old, new) pairs */ 2052582d50cSToby Isaac PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthShift[]) 2062582d50cSToby Isaac { 2072582d50cSToby Isaac PetscInt d; 2082582d50cSToby Isaac PetscInt newOff = 0; 2092582d50cSToby Isaac 2102582d50cSToby Isaac for (d = 0; d <= depth; d++) { 2112582d50cSToby Isaac if (p < depthShift[2*d]) return p + newOff; 2122582d50cSToby Isaac else newOff = depthShift[2*d+1] - depthShift[2*d]; 2132582d50cSToby Isaac } 214*0974a383SToby Isaac return p + newOff; 2152582d50cSToby Isaac } 2162582d50cSToby Isaac 2172582d50cSToby Isaac #undef __FUNCT__ 2182582d50cSToby Isaac #define __FUNCT__ "DMPlexShiftPointInverse_Internal" 2192582d50cSToby Isaac /* depthShift is a list of (old, new) pairs */ 2202582d50cSToby Isaac PETSC_STATIC_INLINE PetscInt DMPlexShiftPointInverse_Internal(PetscInt p, PetscInt depth, PetscInt depthShift[]) 2212582d50cSToby Isaac { 2222582d50cSToby Isaac PetscInt d; 2232582d50cSToby Isaac PetscInt newOff = 0; 2242582d50cSToby Isaac 2252582d50cSToby Isaac for (d = 0; d <= depth; d++) { 2262582d50cSToby Isaac if (p < depthShift[2*d+1]) return p + newOff; 2272582d50cSToby Isaac else newOff = depthShift[2*d] - depthShift[2*d+1]; 2282582d50cSToby Isaac } 229*0974a383SToby Isaac return p + newOff; 230cd0c2139SMatthew G Knepley } 231cd0c2139SMatthew G Knepley 232cd0c2139SMatthew G Knepley #undef __FUNCT__ 233cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSizes_Internal" 234cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew) 235cd0c2139SMatthew G Knepley { 236cd0c2139SMatthew G Knepley PetscInt depth = 0, d, pStart, pEnd, p; 237cd0c2139SMatthew G Knepley PetscErrorCode ierr; 238cd0c2139SMatthew G Knepley 239cd0c2139SMatthew G Knepley PetscFunctionBegin; 240cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 241cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 242cd0c2139SMatthew G Knepley /* Step 1: Expand chart */ 243cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 244*0974a383SToby Isaac pEnd = DMPlexShiftPoint_Internal(pEnd,depth,depthShift); 245cd0c2139SMatthew G Knepley ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr); 246cd0c2139SMatthew G Knepley /* Step 2: Set cone and support sizes */ 247cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 248cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 249cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 2502582d50cSToby Isaac PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthShift); 251cd0c2139SMatthew G Knepley PetscInt size; 252cd0c2139SMatthew G Knepley 253cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 254cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr); 255cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 256cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr); 257cd0c2139SMatthew G Knepley } 258cd0c2139SMatthew G Knepley } 259cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 260cd0c2139SMatthew G Knepley } 261cd0c2139SMatthew G Knepley 262cd0c2139SMatthew G Knepley #undef __FUNCT__ 263cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoints_Internal" 264cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew) 265cd0c2139SMatthew G Knepley { 2662582d50cSToby Isaac PetscInt *newpoints; 2672582d50cSToby Isaac PetscInt depth = 0, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, pStart, pEnd, p; 268cd0c2139SMatthew G Knepley PetscErrorCode ierr; 269cd0c2139SMatthew G Knepley 270cd0c2139SMatthew G Knepley PetscFunctionBegin; 271cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 272cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 273cd0c2139SMatthew G Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 274dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dmNew, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 2752582d50cSToby Isaac ierr = PetscMalloc1(PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),&newpoints);CHKERRQ(ierr); 276cd0c2139SMatthew G Knepley /* Step 5: Set cones and supports */ 277cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 278cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 279cd0c2139SMatthew G Knepley const PetscInt *points = NULL, *orientations = NULL; 2802582d50cSToby Isaac PetscInt size,sizeNew, i, newp = DMPlexShiftPoint_Internal(p, depth, depthShift); 281cd0c2139SMatthew G Knepley 282cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 283cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr); 284cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr); 285cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 2862582d50cSToby Isaac newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthShift); 287cd0c2139SMatthew G Knepley } 288cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr); 289cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr); 290cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 291dcbb62e8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmNew, newp, &sizeNew);CHKERRQ(ierr); 292cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr); 293cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 2942582d50cSToby Isaac newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthShift); 295cd0c2139SMatthew G Knepley } 296dcbb62e8SMatthew G. Knepley for (i = size; i < sizeNew; ++i) newpoints[i] = 0; 297cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr); 298cd0c2139SMatthew G Knepley } 2992582d50cSToby Isaac ierr = PetscFree(newpoints);CHKERRQ(ierr); 300cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 301cd0c2139SMatthew G Knepley } 302cd0c2139SMatthew G Knepley 303cd0c2139SMatthew G Knepley #undef __FUNCT__ 304cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftCoordinates_Internal" 305cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew) 306cd0c2139SMatthew G Knepley { 307cd0c2139SMatthew G Knepley PetscSection coordSection, newCoordSection; 308cd0c2139SMatthew G Knepley Vec coordinates, newCoordinates; 309cd0c2139SMatthew G Knepley PetscScalar *coords, *newCoords; 3102582d50cSToby Isaac PetscInt coordSize; 3112582d50cSToby Isaac PetscInt dim, depth = 0, vStart, vEnd, vStartNew, vEndNew, v; 312cd0c2139SMatthew G Knepley PetscErrorCode ierr; 313cd0c2139SMatthew G Knepley 314cd0c2139SMatthew G Knepley PetscFunctionBegin; 315c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 316cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 317cd0c2139SMatthew G Knepley /* Step 8: Convert coordinates */ 318cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 319cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr); 32069d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 321cd0c2139SMatthew G Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr); 322cd0c2139SMatthew G Knepley ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr); 323cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr); 324cd0c2139SMatthew G Knepley ierr = PetscSectionSetChart(newCoordSection, vStartNew, vEndNew);CHKERRQ(ierr); 325cd0c2139SMatthew G Knepley for (v = vStartNew; v < vEndNew; ++v) { 326cd0c2139SMatthew G Knepley ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr); 327cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr); 328cd0c2139SMatthew G Knepley } 329cd0c2139SMatthew G Knepley ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr); 33046e270d4SMatthew G. Knepley ierr = DMSetCoordinateSection(dmNew, PETSC_DETERMINE, newCoordSection);CHKERRQ(ierr); 331cd0c2139SMatthew G Knepley ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr); 332cd0c2139SMatthew G Knepley ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr); 333cd0c2139SMatthew G Knepley ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr); 334cd0c2139SMatthew G Knepley ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 3354e90ef8eSMatthew G. Knepley ierr = VecSetBlockSize(newCoordinates, dim);CHKERRQ(ierr); 3362eb5907fSJed Brown ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr); 337cd0c2139SMatthew G Knepley ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr); 338cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 339cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 340cd0c2139SMatthew G Knepley ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr); 341cd0c2139SMatthew G Knepley for (v = vStart; v < vEnd; ++v) { 342cd0c2139SMatthew G Knepley PetscInt dof, off, noff, d; 343cd0c2139SMatthew G Knepley 344cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 345cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3462582d50cSToby Isaac ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthShift), &noff);CHKERRQ(ierr); 347cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) { 348cd0c2139SMatthew G Knepley newCoords[noff+d] = coords[off+d]; 349cd0c2139SMatthew G Knepley } 350cd0c2139SMatthew G Knepley } 351cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 352cd0c2139SMatthew G Knepley ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr); 353cd0c2139SMatthew G Knepley ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 354cd0c2139SMatthew G Knepley ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr); 355cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 356cd0c2139SMatthew G Knepley } 357cd0c2139SMatthew G Knepley 358cd0c2139SMatthew G Knepley #undef __FUNCT__ 359cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal" 360cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew) 361cd0c2139SMatthew G Knepley { 3622582d50cSToby Isaac PetscInt depth = 0; 363cd0c2139SMatthew G Knepley PetscSF sfPoint, sfPointNew; 364cd0c2139SMatthew G Knepley const PetscSFNode *remotePoints; 365cd0c2139SMatthew G Knepley PetscSFNode *gremotePoints; 366cd0c2139SMatthew G Knepley const PetscInt *localPoints; 367cd0c2139SMatthew G Knepley PetscInt *glocalPoints, *newLocation, *newRemoteLocation; 368cd0c2139SMatthew G Knepley PetscInt numRoots, numLeaves, l, pStart, pEnd, totShift = 0; 369cd0c2139SMatthew G Knepley PetscErrorCode ierr; 370cd0c2139SMatthew G Knepley 371cd0c2139SMatthew G Knepley PetscFunctionBegin; 372cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 373cd0c2139SMatthew G Knepley /* Step 9: Convert pointSF */ 374cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 375cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr); 376cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 377cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 378cd0c2139SMatthew G Knepley if (numRoots >= 0) { 379dcca6d9dSJed Brown ierr = PetscMalloc2(numRoots,&newLocation,pEnd-pStart,&newRemoteLocation);CHKERRQ(ierr); 3802582d50cSToby Isaac for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthShift); 381cd0c2139SMatthew G Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 382cd0c2139SMatthew G Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 383785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &glocalPoints);CHKERRQ(ierr); 384785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &gremotePoints);CHKERRQ(ierr); 385cd0c2139SMatthew G Knepley for (l = 0; l < numLeaves; ++l) { 3862582d50cSToby Isaac glocalPoints[l] = DMPlexShiftPoint_Internal(localPoints[l], depth, depthShift); 387cd0c2139SMatthew G Knepley gremotePoints[l].rank = remotePoints[l].rank; 388cd0c2139SMatthew G Knepley gremotePoints[l].index = newRemoteLocation[localPoints[l]]; 389cd0c2139SMatthew G Knepley } 390cd0c2139SMatthew G Knepley ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr); 391cd0c2139SMatthew G Knepley ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 392cd0c2139SMatthew G Knepley } 393cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 394cd0c2139SMatthew G Knepley } 395cd0c2139SMatthew G Knepley 396cd0c2139SMatthew G Knepley #undef __FUNCT__ 397cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal" 398cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew) 399cd0c2139SMatthew G Knepley { 400cd0c2139SMatthew G Knepley PetscSF sfPoint; 401cd0c2139SMatthew G Knepley DMLabel vtkLabel, ghostLabel; 402cd0c2139SMatthew G Knepley const PetscSFNode *leafRemote; 403cd0c2139SMatthew G Knepley const PetscInt *leafLocal; 4042582d50cSToby Isaac PetscInt depth = 0, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f; 405cd0c2139SMatthew G Knepley PetscMPIInt rank; 406cd0c2139SMatthew G Knepley PetscErrorCode ierr; 407cd0c2139SMatthew G Knepley 408cd0c2139SMatthew G Knepley PetscFunctionBegin; 409cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 410cd0c2139SMatthew G Knepley /* Step 10: Convert labels */ 411cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 412cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 413cd0c2139SMatthew G Knepley DMLabel label, newlabel; 414cd0c2139SMatthew G Knepley const char *lname; 415cd0c2139SMatthew G Knepley PetscBool isDepth; 416cd0c2139SMatthew G Knepley IS valueIS; 417cd0c2139SMatthew G Knepley const PetscInt *values; 418cd0c2139SMatthew G Knepley PetscInt numValues, val; 419cd0c2139SMatthew G Knepley 420cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr); 421cd0c2139SMatthew G Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 422cd0c2139SMatthew G Knepley if (isDepth) continue; 423cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, lname);CHKERRQ(ierr); 424cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr); 425cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr); 426cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 427cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 428cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 429cd0c2139SMatthew G Knepley for (val = 0; val < numValues; ++val) { 430cd0c2139SMatthew G Knepley IS pointIS; 431cd0c2139SMatthew G Knepley const PetscInt *points; 432cd0c2139SMatthew G Knepley PetscInt numPoints, p; 433cd0c2139SMatthew G Knepley 434cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 435cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 436cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 437cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 4382582d50cSToby Isaac const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthShift); 439cd0c2139SMatthew G Knepley 440cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr); 441cd0c2139SMatthew G Knepley } 442cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 443cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 444cd0c2139SMatthew G Knepley } 445cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 446cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 447cd0c2139SMatthew G Knepley } 448cd0c2139SMatthew G Knepley /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */ 449cd0c2139SMatthew G Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 450cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 451cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 452cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr); 453cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "vtk");CHKERRQ(ierr); 454cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "ghost");CHKERRQ(ierr); 455cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr); 456cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr); 457cd0c2139SMatthew G Knepley for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { 458cd0c2139SMatthew G Knepley for (; c < leafLocal[l] && c < cEnd; ++c) { 459cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 460cd0c2139SMatthew G Knepley } 461cd0c2139SMatthew G Knepley if (leafLocal[l] >= cEnd) break; 462cd0c2139SMatthew G Knepley if (leafRemote[l].rank == rank) { 463cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 464cd0c2139SMatthew G Knepley } else { 465cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr); 466cd0c2139SMatthew G Knepley } 467cd0c2139SMatthew G Knepley } 468cd0c2139SMatthew G Knepley for (; c < cEnd; ++c) { 469cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 470cd0c2139SMatthew G Knepley } 471cd0c2139SMatthew G Knepley if (0) { 472cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 473cd0c2139SMatthew G Knepley ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 474cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 475cd0c2139SMatthew G Knepley } 476cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr); 477cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 478cd0c2139SMatthew G Knepley PetscInt numCells; 479cd0c2139SMatthew G Knepley 480cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr); 481cd0c2139SMatthew G Knepley if (numCells < 2) { 482cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr); 483cd0c2139SMatthew G Knepley } else { 484cd0c2139SMatthew G Knepley const PetscInt *cells = NULL; 485cd0c2139SMatthew G Knepley PetscInt vA, vB; 486cd0c2139SMatthew G Knepley 487cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr); 488cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr); 489cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr); 490cd0c2139SMatthew G Knepley if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);} 491cd0c2139SMatthew G Knepley } 492cd0c2139SMatthew G Knepley } 493cd0c2139SMatthew G Knepley if (0) { 494cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 495cd0c2139SMatthew G Knepley ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 496cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 497cd0c2139SMatthew G Knepley } 498cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 499cd0c2139SMatthew G Knepley } 500cd0c2139SMatthew G Knepley 501cd0c2139SMatthew G Knepley #undef __FUNCT__ 502ca04dac2SToby Isaac #define __FUNCT__ "DMPlexShiftTree_Internal" 503ca04dac2SToby Isaac static PetscErrorCode DMPlexShiftTree_Internal(DM dm, PetscInt depthShift[], DM dmNew) 504ca04dac2SToby Isaac { 505ca04dac2SToby Isaac DM refTree; 506ca04dac2SToby Isaac PetscSection pSec; 507ca04dac2SToby Isaac PetscInt *parents, *childIDs; 508ca04dac2SToby Isaac PetscErrorCode ierr; 509ca04dac2SToby Isaac 510ca04dac2SToby Isaac PetscFunctionBegin; 511ca04dac2SToby Isaac ierr = DMPlexGetReferenceTree(dm,&refTree);CHKERRQ(ierr); 512ca04dac2SToby Isaac ierr = DMPlexSetReferenceTree(dmNew,refTree);CHKERRQ(ierr); 513ca04dac2SToby Isaac ierr = DMPlexGetTree(dm,&pSec,&parents,&childIDs,NULL,NULL);CHKERRQ(ierr); 514ca04dac2SToby Isaac if (pSec) { 5152582d50cSToby Isaac PetscInt p, pStart, pEnd, *parentsShifted, pStartShifted, pEndShifted, depth; 516ca04dac2SToby Isaac PetscSection pSecShifted; 517ca04dac2SToby Isaac 518ca04dac2SToby Isaac ierr = PetscSectionGetChart(pSec,&pStart,&pEnd);CHKERRQ(ierr); 519ca04dac2SToby Isaac ierr = DMPlexGetDepth(dm,&depth);CHKERRQ(ierr); 5202582d50cSToby Isaac pStartShifted = DMPlexShiftPoint_Internal(pStart,depth,depthShift); 5212582d50cSToby Isaac pEndShifted = DMPlexShiftPoint_Internal(pEnd,depth,depthShift); 522ca04dac2SToby Isaac ierr = PetscMalloc1(pEndShifted - pStartShifted,&parentsShifted);CHKERRQ(ierr); 523ca04dac2SToby Isaac ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dmNew),&pSecShifted);CHKERRQ(ierr); 524ca04dac2SToby Isaac ierr = PetscSectionSetChart(pSecShifted,pStartShifted,pEndShifted);CHKERRQ(ierr); 525ca04dac2SToby Isaac for (p = 0; p < pEndShifted - pStartShifted; p++) { 5262582d50cSToby Isaac parentsShifted[p] = DMPlexShiftPoint_Internal(parents[p],depth,depthShift); 527ca04dac2SToby Isaac } 528ca04dac2SToby Isaac for (p = pStartShifted; p < pEndShifted; p++) { 529ca04dac2SToby Isaac PetscInt dof, pShifted; 530ca04dac2SToby Isaac 5312582d50cSToby Isaac pShifted = DMPlexShiftPoint_Internal(parents[p],depth,depthShift); 532ca04dac2SToby Isaac ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr); 533ca04dac2SToby Isaac ierr = PetscSectionSetDof(pSecShifted,pShifted,dof);CHKERRQ(ierr); 534ca04dac2SToby Isaac } 535ca04dac2SToby Isaac ierr = PetscSectionSetUp(pSecShifted);CHKERRQ(ierr); 536ca04dac2SToby Isaac ierr = DMPlexSetTree(dmNew,pSecShifted,parentsShifted,childIDs);CHKERRQ(ierr); 537ca04dac2SToby Isaac } 538ca04dac2SToby Isaac PetscFunctionReturn(0); 539ca04dac2SToby Isaac } 540ca04dac2SToby Isaac 541ca04dac2SToby Isaac #undef __FUNCT__ 542cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal" 543cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm) 544cd0c2139SMatthew G Knepley { 545da97024aSMatthew G. Knepley PetscSF sf; 546cd0c2139SMatthew G Knepley IS valueIS; 547da97024aSMatthew G. Knepley const PetscInt *values, *leaves; 548cd0c2139SMatthew G Knepley PetscInt *depthShift; 5492582d50cSToby Isaac PetscInt d, depth = 0, nleaves, loc, Ng, numFS, fs, fStart, fEnd, ghostCell, cEnd, c; 550cd0c2139SMatthew G Knepley PetscErrorCode ierr; 551cd0c2139SMatthew G Knepley 552cd0c2139SMatthew G Knepley PetscFunctionBegin; 553da97024aSMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 554da97024aSMatthew G. Knepley ierr = PetscSFGetGraph(sf, NULL, &nleaves, &leaves, NULL);CHKERRQ(ierr); 555da97024aSMatthew G. Knepley nleaves = PetscMax(0, nleaves); 55646c796b9SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 557cd0c2139SMatthew G Knepley /* Count ghost cells */ 558cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 559cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr); 560cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 5614a6cfa73SMatthew G. Knepley Ng = 0; 562cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 56346c796b9SMatthew G. Knepley IS faceIS; 56446c796b9SMatthew G. Knepley const PetscInt *faces; 56546c796b9SMatthew G. Knepley PetscInt numFaces, f, numBdFaces = 0; 566cd0c2139SMatthew G Knepley 56746c796b9SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 56846c796b9SMatthew G. Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 56946c796b9SMatthew G. Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 57046c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 571ca04dac2SToby Isaac PetscInt numChildren; 572ca04dac2SToby Isaac 573da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 574ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 575ca04dac2SToby Isaac /* non-local and ancestors points don't get to register ghosts */ 576ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 57746c796b9SMatthew G. Knepley if ((faces[f] >= fStart) && (faces[f] < fEnd)) ++numBdFaces; 57846c796b9SMatthew G. Knepley } 5794a6cfa73SMatthew G. Knepley Ng += numBdFaces; 58046c796b9SMatthew G. Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 581cd0c2139SMatthew G Knepley } 582cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 5832582d50cSToby Isaac ierr = PetscMalloc1(2*(depth+1), &depthShift);CHKERRQ(ierr); 5842582d50cSToby Isaac for (d = 0; d <= depth; d++) { 58559eef20bSToby Isaac PetscInt dEnd; 5862582d50cSToby Isaac 587*0974a383SToby Isaac ierr = DMPlexGetDepthStratum(dm,d,NULL,&dEnd);CHKERRQ(ierr); 58859eef20bSToby Isaac depthShift[2*d] = dEnd; 5892582d50cSToby Isaac depthShift[2*d+1] = 0; 5902582d50cSToby Isaac } 5912582d50cSToby Isaac if (depth >= 0) depthShift[2*depth+1] = Ng; 5922582d50cSToby Isaac ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift);CHKERRQ(ierr); 593cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 594cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 595cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 5965acea1aeSMatthew G. Knepley ierr = DMPlexSetHybridBounds(gdm, cEnd, PETSC_DETERMINE, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 5974a6cfa73SMatthew G. Knepley for (c = cEnd; c < cEnd + Ng; ++c) { 598cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr); 599cd0c2139SMatthew G Knepley } 600cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 601cd0c2139SMatthew G Knepley IS faceIS; 602cd0c2139SMatthew G Knepley const PetscInt *faces; 603cd0c2139SMatthew G Knepley PetscInt numFaces, f; 604cd0c2139SMatthew G Knepley 605cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 606cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 607cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 608cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 609ca04dac2SToby Isaac PetscInt size, numChildren; 610cd0c2139SMatthew G Knepley 611da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 612ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 613ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 61446c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 615cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr); 616cd0c2139SMatthew 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); 6174a6cfa73SMatthew G. Knepley ierr = DMPlexSetSupportSize(gdm, faces[f] + Ng, 2);CHKERRQ(ierr); 618cd0c2139SMatthew G Knepley } 619cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 620cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 621cd0c2139SMatthew G Knepley } 622cd0c2139SMatthew G Knepley /* Step 4: Setup ghosted DM */ 623cd0c2139SMatthew G Knepley ierr = DMSetUp(gdm);CHKERRQ(ierr); 624cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 625cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 626cd0c2139SMatthew G Knepley ghostCell = cEnd; 627cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 628cd0c2139SMatthew G Knepley IS faceIS; 629cd0c2139SMatthew G Knepley const PetscInt *faces; 630cd0c2139SMatthew G Knepley PetscInt numFaces, f; 631cd0c2139SMatthew G Knepley 632cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 633cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 634cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 63546c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 636ca04dac2SToby Isaac PetscInt newFace = faces[f] + Ng, numChildren; 637cd0c2139SMatthew G Knepley 638da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 639ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 640ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 64146c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 642cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr); 643cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr); 64446c796b9SMatthew G. Knepley ++ghostCell; 645cd0c2139SMatthew G Knepley } 646cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 647cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 648cd0c2139SMatthew G Knepley } 649cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 650cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 651cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 652cd0c2139SMatthew G Knepley ierr = DMPlexStratify(gdm);CHKERRQ(ierr); 653cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 654cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 655cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 656ca04dac2SToby Isaac ierr = DMPlexShiftTree_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 657cd0c2139SMatthew G Knepley ierr = PetscFree(depthShift);CHKERRQ(ierr); 658966c7b3fSMatthew G. Knepley /* Step 7: Periodicity */ 659966c7b3fSMatthew G. Knepley if (dm->maxCell) { 660966c7b3fSMatthew G. Knepley const PetscReal *maxCell, *L; 6615dc8c3f7SMatthew G. Knepley const DMBoundaryType *bd; 6625dc8c3f7SMatthew G. Knepley ierr = DMGetPeriodicity(dm, &maxCell, &L, &bd);CHKERRQ(ierr); 6635dc8c3f7SMatthew G. Knepley ierr = DMSetPeriodicity(gdm, maxCell, L, bd);CHKERRQ(ierr); 664966c7b3fSMatthew G. Knepley } 6654a6cfa73SMatthew G. Knepley if (numGhostCells) *numGhostCells = Ng; 666cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 667cd0c2139SMatthew G Knepley } 668cd0c2139SMatthew G Knepley 669cd0c2139SMatthew G Knepley #undef __FUNCT__ 670cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells" 671cd0c2139SMatthew G Knepley /*@C 672cd0c2139SMatthew G Knepley DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face 673cd0c2139SMatthew G Knepley 674cd0c2139SMatthew G Knepley Collective on dm 675cd0c2139SMatthew G Knepley 676cd0c2139SMatthew G Knepley Input Parameters: 677cd0c2139SMatthew G Knepley + dm - The original DM 678cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL 679cd0c2139SMatthew G Knepley 680cd0c2139SMatthew G Knepley Output Parameters: 681cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM 682cd0c2139SMatthew G Knepley - dmGhosted - The new DM 683cd0c2139SMatthew G Knepley 684cd0c2139SMatthew G Knepley Note: If no label exists of that name, one will be created marking all boundary faces 685cd0c2139SMatthew G Knepley 686cd0c2139SMatthew G Knepley Level: developer 687cd0c2139SMatthew G Knepley 688cd0c2139SMatthew G Knepley .seealso: DMCreate() 68931266bc0SMatthew G. Knepley @*/ 690cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted) 691cd0c2139SMatthew G Knepley { 692cd0c2139SMatthew G Knepley DM gdm; 693cd0c2139SMatthew G Knepley DMLabel label; 694cd0c2139SMatthew G Knepley const char *name = labelName ? labelName : "Face Sets"; 695cd0c2139SMatthew G Knepley PetscInt dim; 696a42b08eeSMatthew G. Knepley PetscBool flag; 697cd0c2139SMatthew G Knepley PetscErrorCode ierr; 698cd0c2139SMatthew G Knepley 699cd0c2139SMatthew G Knepley PetscFunctionBegin; 700cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 7014a6cfa73SMatthew G. Knepley if (numGhostCells) PetscValidPointer(numGhostCells, 3); 702cd0c2139SMatthew G Knepley PetscValidPointer(dmGhosted, 4); 703cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr); 704cd0c2139SMatthew G Knepley ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr); 705c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 706c73cfb54SMatthew G. Knepley ierr = DMSetDimension(gdm, dim);CHKERRQ(ierr); 707a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseCone(dm, &flag);CHKERRQ(ierr); 708a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseCone(gdm, flag);CHKERRQ(ierr); 709a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseClosure(dm, &flag);CHKERRQ(ierr); 710a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseClosure(gdm, flag);CHKERRQ(ierr); 711cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 712cd0c2139SMatthew G Knepley if (!label) { 713cd0c2139SMatthew G Knepley /* Get label for boundary faces */ 714cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr); 715cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 716cd0c2139SMatthew G Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 717cd0c2139SMatthew G Knepley } 718cd0c2139SMatthew G Knepley ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr); 7198e136ac0SMatthew G. Knepley ierr = DMPlexCopyBoundary(dm, gdm);CHKERRQ(ierr); 720cd0c2139SMatthew G Knepley *dmGhosted = gdm; 721cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 722cd0c2139SMatthew G Knepley } 723cd0c2139SMatthew G Knepley 724cd0c2139SMatthew G Knepley #undef __FUNCT__ 725cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal" 726607ab7a9SMatthew G. Knepley /* 727faedd622SMatthew G. Knepley We are adding three kinds of points here: 728607ab7a9SMatthew G. Knepley Replicated: Copies of points which exist in the mesh, such as vertices identified across a fault 729faedd622SMatthew G. Knepley Non-replicated: Points which exist on the fault, but are not replicated 730607ab7a9SMatthew G. Knepley Hybrid: Entirely new points, such as cohesive cells 731a6ae58d1SMatthew G. Knepley 732a6ae58d1SMatthew G. Knepley When creating subsequent cohesive cells, we shift the old hybrid cells to the end of the numbering at 733a6ae58d1SMatthew G. Knepley each depth so that the new split/hybrid points can be inserted as a block. 734607ab7a9SMatthew G. Knepley */ 735cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm) 736cd0c2139SMatthew G Knepley { 737cd0c2139SMatthew G Knepley MPI_Comm comm; 738607ab7a9SMatthew G. Knepley IS valueIS; 739607ab7a9SMatthew G. Knepley PetscInt numSP = 0; /* The number of depths for which we have replicated points */ 740607ab7a9SMatthew G. Knepley const PetscInt *values; /* List of depths for which we have replicated points */ 74118c5995bSMatthew G. Knepley IS *splitIS; 74218c5995bSMatthew G. Knepley IS *unsplitIS; 743607ab7a9SMatthew G. Knepley PetscInt *numSplitPoints; /* The number of replicated points at each depth */ 74418c5995bSMatthew G. Knepley PetscInt *numUnsplitPoints; /* The number of non-replicated points at each depth which still give rise to hybrid points */ 74536dbac82SMatthew G. Knepley PetscInt *numHybridPoints; /* The number of new hybrid points at each depth */ 74636dbac82SMatthew G. Knepley PetscInt *numHybridPointsOld; /* The number of existing hybrid points at each depth */ 747607ab7a9SMatthew G. Knepley const PetscInt **splitPoints; /* Replicated points for each depth */ 74818c5995bSMatthew G. Knepley const PetscInt **unsplitPoints; /* Non-replicated points for each depth */ 749cd0c2139SMatthew G Knepley PetscSection coordSection; 750cd0c2139SMatthew G Knepley Vec coordinates; 751cd0c2139SMatthew G Knepley PetscScalar *coords; 752a6ae58d1SMatthew G. Knepley PetscInt *depthMax; /* The first hybrid point at each depth in the original mesh */ 753a6ae58d1SMatthew G. Knepley PetscInt *depthEnd; /* The point limit at each depth in the original mesh */ 754607ab7a9SMatthew G. Knepley PetscInt *depthShift; /* Number of replicated+hybrid points at each depth */ 755607ab7a9SMatthew G. Knepley PetscInt *pMaxNew; /* The first replicated point at each depth in the new mesh, hybrids come after this */ 756607ab7a9SMatthew G. Knepley PetscInt *coneNew, *coneONew, *supportNew; 75718c5995bSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v; 758cd0c2139SMatthew G Knepley PetscErrorCode ierr; 759cd0c2139SMatthew G Knepley 760cd0c2139SMatthew G Knepley PetscFunctionBegin; 761cd0c2139SMatthew G Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 762c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 763607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 764fd4b9f15SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 765cd0c2139SMatthew G Knepley /* Count split points and add cohesive cells */ 766607ab7a9SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 7672582d50cSToby Isaac ierr = PetscMalloc5(depth+1,&depthMax,depth+1,&depthEnd,2*(depth+1),&depthShift,depth+1,&pMaxNew,depth+1,&numHybridPointsOld);CHKERRQ(ierr); 768dcca6d9dSJed 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); 769a6ae58d1SMatthew 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); 770607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 771607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 772a6ae58d1SMatthew G. Knepley depthEnd[d] = pMaxNew[d]; 773a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 774607ab7a9SMatthew G. Knepley numSplitPoints[d] = 0; 77518c5995bSMatthew G. Knepley numUnsplitPoints[d] = 0; 776607ab7a9SMatthew G. Knepley numHybridPoints[d] = 0; 777a6ae58d1SMatthew G. Knepley numHybridPointsOld[d] = depthMax[d] < 0 ? 0 : depthEnd[d] - depthMax[d]; 778607ab7a9SMatthew G. Knepley splitPoints[d] = NULL; 77918c5995bSMatthew G. Knepley unsplitPoints[d] = NULL; 78018c5995bSMatthew G. Knepley splitIS[d] = NULL; 78118c5995bSMatthew G. Knepley unsplitIS[d] = NULL; 78259eef20bSToby Isaac /* we are shifting the existing hybrid points with the stratum behind them, so 78359eef20bSToby Isaac * the split comes at the end of the normal points, i.e., at depthMax[d] */ 78459eef20bSToby Isaac depthShift[2*d] = depthMax[d]; 78559eef20bSToby Isaac depthShift[2*d+1] = 0; 786607ab7a9SMatthew G. Knepley } 787cd0c2139SMatthew G Knepley if (label) { 788cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 789cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 790cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 791cd0c2139SMatthew G Knepley } 792cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 793cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 794cd0c2139SMatthew G Knepley 795cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 79618c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr); 79718c5995bSMatthew G. Knepley if (splitIS[dep]) { 79818c5995bSMatthew G. Knepley ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 79918c5995bSMatthew G. Knepley ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 80018c5995bSMatthew G. Knepley } 80118c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr); 80218c5995bSMatthew G. Knepley if (unsplitIS[dep]) { 80318c5995bSMatthew G. Knepley ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr); 80418c5995bSMatthew G. Knepley ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr); 805cd0c2139SMatthew G Knepley } 806cd0c2139SMatthew G Knepley } 807607ab7a9SMatthew G. Knepley /* Calculate number of hybrid points */ 80818c5995bSMatthew 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 */ 8092582d50cSToby Isaac for (d = 0; d <= depth; ++d) depthShift[2*d+1] = numSplitPoints[d] + numHybridPoints[d]; 8102582d50cSToby Isaac ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift); 81159eef20bSToby Isaac /* the end of the points in this stratum that come before the new points: 81259eef20bSToby Isaac * shifting pMaxNew[d] gets the new start of the next stratum, then count back the old hybrid points and the newly 81359eef20bSToby Isaac * added points */ 8142582d50cSToby Isaac for (d = 0; d <= depth; ++d) pMaxNew[d] = DMPlexShiftPoint_Internal(pMaxNew[d],depth,depthShift) - (numHybridPointsOld[d] + numSplitPoints[d] + numHybridPoints[d]); 815cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 816cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 817cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 818cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 819cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 8202582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 8214c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 822cd0c2139SMatthew G Knepley const PetscInt *support; 8234c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, qf, qn, qp, e; 824cd0c2139SMatthew G Knepley 825cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 826cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 827cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 828cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 829cd0c2139SMatthew G Knepley if (dep == depth-1) { 8304c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 8314c367dbcSMatthew G. Knepley 832cd0c2139SMatthew G Knepley /* Add cohesive cells, they are prisms */ 8334c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr); 834cd0c2139SMatthew G Knepley } else if (dep == 0) { 8354c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 836cd0c2139SMatthew G Knepley 837cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 8384c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 839cd0c2139SMatthew G Knepley PetscInt val; 840cd0c2139SMatthew G Knepley 841cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 8424c367dbcSMatthew G. Knepley if (val == 1) ++qf; 8434c367dbcSMatthew G. Knepley if ((val == 1) || (val == (shift + 1))) ++qn; 8444c367dbcSMatthew G. Knepley if ((val == 1) || (val == -(shift + 1))) ++qp; 845cd0c2139SMatthew G Knepley } 8464c367dbcSMatthew G. Knepley /* Split old vertex: Edges into original vertex and new cohesive edge */ 8474c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 8484c367dbcSMatthew G. Knepley /* Split new vertex: Edges into split vertex and new cohesive edge */ 8494c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 8504c367dbcSMatthew G. Knepley /* Add hybrid edge */ 8514c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 8524c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 853cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 8544c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 8554c367dbcSMatthew G. Knepley 856cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 8574c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 858cd0c2139SMatthew G Knepley PetscInt val; 859cd0c2139SMatthew G Knepley 860cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 8614c367dbcSMatthew G. Knepley if (val == dim-1) ++qf; 8624c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 8634c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 864cd0c2139SMatthew G Knepley } 8654c367dbcSMatthew G. Knepley /* Split old edge: Faces into original edge and cohesive face (positive side?) */ 8664c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 8674c367dbcSMatthew G. Knepley /* Split new edge: Faces into split edge and cohesive face (negative side?) */ 8684c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 8694c367dbcSMatthew G. Knepley /* Add hybrid face */ 8704c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 8714c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 872cd0c2139SMatthew G Knepley } 873cd0c2139SMatthew G Knepley } 874cd0c2139SMatthew G Knepley } 87518c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 87618c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 87718c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 8782582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 87918c5995bSMatthew G. Knepley const PetscInt *support; 880da1dd7e4SMatthew G. Knepley PetscInt coneSize, supportSize, qf, e, s; 88118c5995bSMatthew G. Knepley 88218c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 88318c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 88439254ff6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 88518c5995bSMatthew G. Knepley if (dep == 0) { 88618c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 88718c5995bSMatthew G. Knepley 88839254ff6SMatthew G. Knepley /* Unsplit vertex: Edges into original vertex, split edges, and new cohesive edge twice */ 88939254ff6SMatthew G. Knepley for (s = 0, qf = 0; s < supportSize; ++s, ++qf) { 89039254ff6SMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 89139254ff6SMatthew G. Knepley if (e >= 0) ++qf; 89239254ff6SMatthew G. Knepley } 89339254ff6SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 89418c5995bSMatthew G. Knepley /* Add hybrid edge */ 89518c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 896e1757548SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 897e1757548SMatthew G. Knepley PetscInt val; 898e1757548SMatthew G. Knepley 899e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 900e1757548SMatthew G. Knepley /* Split and unsplit edges produce hybrid faces */ 901da1dd7e4SMatthew G. Knepley if (val == 1) ++qf; 902da1dd7e4SMatthew G. Knepley if (val == (shift2 + 1)) ++qf; 903e1757548SMatthew G. Knepley } 904e1757548SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 90518c5995bSMatthew G. Knepley } else if (dep == dim-2) { 90618c5995bSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 907cd0c2139SMatthew G Knepley PetscInt val; 908cd0c2139SMatthew G Knepley 909da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 910cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 911da1dd7e4SMatthew G. Knepley if (val == dim-1) qf += 2; 912da1dd7e4SMatthew G. Knepley else ++qf; 913cd0c2139SMatthew G Knepley } 91418c5995bSMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */ 915da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 91618c5995bSMatthew G. Knepley /* Add hybrid face */ 917da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 918da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 919da1dd7e4SMatthew G. Knepley if (val == dim-1) ++qf; 920da1dd7e4SMatthew G. Knepley } 92118c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 922da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 923cd0c2139SMatthew G Knepley } 924cd0c2139SMatthew G Knepley } 925cd0c2139SMatthew G Knepley } 926cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 927cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 928cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 929dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 930dcca6d9dSJed Brown ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),&supportNew);CHKERRQ(ierr); 931cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 932cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 933cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 934cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 9352582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 9364c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 937cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 9384c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, q, qf, qn, qp, v, e, s; 939cd0c2139SMatthew G Knepley 940cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 941cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 942cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 943cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 944cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 945cd0c2139SMatthew G Knepley if (dep == depth-1) { 94696a07cd0SMatthew G. Knepley PetscBool hasUnsplit = PETSC_FALSE; 9474c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 948cd0c2139SMatthew G Knepley const PetscInt *supportF; 949cd0c2139SMatthew G Knepley 950cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 951cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 952cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 953cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 954cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 955cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 9564c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 95718c5995bSMatthew G. Knepley if (v < 0) { 95818c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 95918c5995bSMatthew 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); 9602582d50cSToby Isaac coneNew[2+q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/; 96196a07cd0SMatthew G. Knepley hasUnsplit = PETSC_TRUE; 96218c5995bSMatthew G. Knepley } else { 9634c367dbcSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep-1]; 964163235baSMatthew G. Knepley if (dep > 1) { 965163235baSMatthew G. Knepley const PetscInt *econe; 966163235baSMatthew G. Knepley PetscInt econeSize, r, vs, vu; 967163235baSMatthew G. Knepley 968163235baSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[q], &econeSize);CHKERRQ(ierr); 969163235baSMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[q], &econe);CHKERRQ(ierr); 970163235baSMatthew G. Knepley for (r = 0; r < econeSize; ++r) { 971163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numSplitPoints[dep-2], splitPoints[dep-2], &vs);CHKERRQ(ierr); 972163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numUnsplitPoints[dep-2], unsplitPoints[dep-2], &vu);CHKERRQ(ierr); 973163235baSMatthew G. Knepley if (vs >= 0) continue; 974163235baSMatthew 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); 975163235baSMatthew G. Knepley hasUnsplit = PETSC_TRUE; 976163235baSMatthew G. Knepley } 977163235baSMatthew G. Knepley } 978cd0c2139SMatthew G Knepley } 979cd0c2139SMatthew G Knepley } 980cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 981cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 982e537020bSMatthew G. Knepley /* Face support */ 983cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 984cd0c2139SMatthew G Knepley PetscInt val; 985cd0c2139SMatthew G Knepley 986cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 987cd0c2139SMatthew G Knepley if (val < 0) { 988cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 9894c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr); 990cd0c2139SMatthew G Knepley } else { 991cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 9924c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr); 993e537020bSMatthew G. Knepley /* Get orientation for cohesive face */ 994e537020bSMatthew G. Knepley { 995e537020bSMatthew G. Knepley const PetscInt *ncone, *nconeO; 996e537020bSMatthew G. Knepley PetscInt nconeSize, nc; 997e537020bSMatthew G. Knepley 998e537020bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 999e537020bSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 1000e537020bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 1001e537020bSMatthew G. Knepley for (nc = 0; nc < nconeSize; ++nc) { 1002e537020bSMatthew G. Knepley if (ncone[nc] == oldp) { 1003e537020bSMatthew G. Knepley coneONew[0] = nconeO[nc]; 1004e537020bSMatthew G. Knepley break; 1005cd0c2139SMatthew G Knepley } 1006cd0c2139SMatthew G Knepley } 1007e537020bSMatthew 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]); 1008e537020bSMatthew G. Knepley } 1009e537020bSMatthew G. Knepley } 1010e537020bSMatthew G. Knepley } 10114c367dbcSMatthew G. Knepley /* Cohesive cell: Old and new split face, then new cohesive faces */ 1012fd4b9f15SMatthew G. Knepley coneNew[0] = newp; /* Extracted negative side orientation above */ 10134c367dbcSMatthew G. Knepley coneNew[1] = splitp; 10144c367dbcSMatthew G. Knepley coneONew[1] = coneONew[0]; 1015e537020bSMatthew G. Knepley for (q = 0; q < coneSize; ++q) { 101618c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 101718c5995bSMatthew G. Knepley if (v < 0) { 101818c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 101918c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 102018c5995bSMatthew G. Knepley coneONew[2+q] = 0; 102118c5995bSMatthew G. Knepley } else { 102218c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep]; 102318c5995bSMatthew G. Knepley } 1024e537020bSMatthew G. Knepley coneONew[2+q] = 0; 1025e537020bSMatthew G. Knepley } 10264c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr); 10274c367dbcSMatthew G. Knepley ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr); 102896a07cd0SMatthew G. Knepley /* Label the hybrid cells on the boundary of the split */ 102996a07cd0SMatthew G. Knepley if (hasUnsplit) {ierr = DMLabelSetValue(label, -hybcell, dim);CHKERRQ(ierr);} 1030cd0c2139SMatthew G Knepley } else if (dep == 0) { 10314c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1032cd0c2139SMatthew G Knepley 1033cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 10344c367dbcSMatthew G. Knepley for (e = 0, qn = 0; e < supportSize; ++e) { 1035cd0c2139SMatthew G Knepley PetscInt val; 1036cd0c2139SMatthew G Knepley 1037cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1038cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 10392582d50cSToby Isaac supportNew[qn++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1040cd0c2139SMatthew G Knepley } 1041cd0c2139SMatthew G Knepley } 10424c367dbcSMatthew G. Knepley supportNew[qn] = hybedge; 1043cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1044cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 10454c367dbcSMatthew G. Knepley for (e = 0, qp = 0; e < supportSize; ++e) { 1046cd0c2139SMatthew G Knepley PetscInt val, edge; 1047cd0c2139SMatthew G Knepley 1048cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1049cd0c2139SMatthew G Knepley if (val == 1) { 10504c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 1051cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 10524c367dbcSMatthew G. Knepley supportNew[qp++] = edge + pMaxNew[dep+1]; 1053cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 10542582d50cSToby Isaac supportNew[qp++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1055cd0c2139SMatthew G Knepley } 1056cd0c2139SMatthew G Knepley } 10574c367dbcSMatthew G. Knepley supportNew[qp] = hybedge; 1058cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 10594c367dbcSMatthew G. Knepley /* Hybrid edge: Old and new split vertex */ 1060cd0c2139SMatthew G Knepley coneNew[0] = newp; 1061cd0c2139SMatthew G Knepley coneNew[1] = splitp; 10624c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 10634c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 10644c367dbcSMatthew G. Knepley PetscInt val, edge; 10654c367dbcSMatthew G. Knepley 10664c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 10674c367dbcSMatthew G. Knepley if (val == 1) { 10684c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 10694c367dbcSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 10704c367dbcSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 10714c367dbcSMatthew G. Knepley } 10724c367dbcSMatthew G. Knepley } 10734c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1074cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 10754c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 10764c367dbcSMatthew G. Knepley 1077cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 1078cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 1079cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 10804c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 1081e1757548SMatthew G. Knepley if (v < 0) { 1082e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1083e1757548SMatthew 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); 10842582d50cSToby Isaac coneNew[q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/; 1085e1757548SMatthew G. Knepley } else { 10864c367dbcSMatthew G. Knepley coneNew[q] = v + pMaxNew[dep-1]; 1087cd0c2139SMatthew G Knepley } 1088e1757548SMatthew G. Knepley } 1089cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 1090cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 1091cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 1092cd0c2139SMatthew G Knepley PetscInt val; 1093cd0c2139SMatthew G Knepley 1094cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 10954c367dbcSMatthew G. Knepley if (val == dim-1) { 10962582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 10974c367dbcSMatthew G. Knepley } else if (val == (shift + dim-1)) { 10982582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1099cd0c2139SMatthew G Knepley } 1100cd0c2139SMatthew G Knepley } 1101b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1102cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1103cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 1104cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 1105cd0c2139SMatthew G Knepley PetscInt val, face; 1106cd0c2139SMatthew G Knepley 1107cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1108cd0c2139SMatthew G Knepley if (val == dim-1) { 11094c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1110cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 11114c367dbcSMatthew G. Knepley supportNew[q++] = face + pMaxNew[dep+1]; 1112cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 11132582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1114cd0c2139SMatthew G Knepley } 1115cd0c2139SMatthew G Knepley } 1116b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1117cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 11184c367dbcSMatthew G. Knepley /* Hybrid face */ 11194c367dbcSMatthew G. Knepley coneNew[0] = newp; 11204c367dbcSMatthew G. Knepley coneNew[1] = splitp; 11214c367dbcSMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 11224c367dbcSMatthew G. Knepley PetscInt vertex; 11234c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr); 1124e1757548SMatthew G. Knepley if (vertex < 0) { 1125e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr); 1126e1757548SMatthew 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); 1127e1757548SMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1128e1757548SMatthew G. Knepley } else { 11294c367dbcSMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep]; 11304c367dbcSMatthew G. Knepley } 1131e1757548SMatthew G. Knepley } 11324c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 11334c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 11344c367dbcSMatthew G. Knepley PetscInt val, face; 11354c367dbcSMatthew G. Knepley 11364c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 11374c367dbcSMatthew G. Knepley if (val == dim-1) { 11384c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 11394c367dbcSMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 11404c367dbcSMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 11414c367dbcSMatthew G. Knepley } 11424c367dbcSMatthew G. Knepley } 11434c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1144cd0c2139SMatthew G Knepley } 1145cd0c2139SMatthew G Knepley } 1146cd0c2139SMatthew G Knepley } 114718c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 114818c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 114918c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 11502582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 115118c5995bSMatthew G. Knepley const PetscInt *cone, *support, *ornt; 1152e1757548SMatthew G. Knepley PetscInt coneSize, supportSize, supportSizeNew, q, qf, e, f, s; 115318c5995bSMatthew G. Knepley 115418c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 115518c5995bSMatthew G. Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 115618c5995bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 115718c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 115818c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 115918c5995bSMatthew G. Knepley if (dep == 0) { 116018c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 116118c5995bSMatthew G. Knepley 116218c5995bSMatthew G. Knepley /* Unsplit vertex */ 116318c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 116418c5995bSMatthew G. Knepley for (s = 0, q = 0; s < supportSize; ++s) { 11652582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[s], depth, depthShift) /*support[s] + depthOffset[dep+1]*/; 116618c5995bSMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 116718c5995bSMatthew G. Knepley if (e >= 0) { 116818c5995bSMatthew G. Knepley supportNew[q++] = e + pMaxNew[dep+1]; 116918c5995bSMatthew G. Knepley } 117018c5995bSMatthew G. Knepley } 117118c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 117218c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 117318c5995bSMatthew G. Knepley if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp); 117418c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 117518c5995bSMatthew G. Knepley /* Hybrid edge */ 117618c5995bSMatthew G. Knepley coneNew[0] = newp; 117718c5995bSMatthew G. Knepley coneNew[1] = newp; 117818c5995bSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 117918c5995bSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 118018c5995bSMatthew G. Knepley PetscInt val, edge; 118118c5995bSMatthew G. Knepley 118218c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 118318c5995bSMatthew G. Knepley if (val == 1) { 118418c5995bSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 118518c5995bSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 118618c5995bSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1187e1757548SMatthew G. Knepley } else if (val == (shift2 + 1)) { 1188e1757548SMatthew G. Knepley ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr); 1189e1757548SMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]); 1190e1757548SMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1]; 119118c5995bSMatthew G. Knepley } 119218c5995bSMatthew G. Knepley } 119318c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1194e1757548SMatthew G. Knepley } else if (dep == dim-2) { 1195e1757548SMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 1196e1757548SMatthew G. Knepley 1197da1dd7e4SMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and hybrid face twice */ 1198e1757548SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1199e1757548SMatthew G. Knepley PetscInt val, face; 1200e1757548SMatthew G. Knepley 1201e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1202e1757548SMatthew G. Knepley if (val == dim-1) { 1203e1757548SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1204e1757548SMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]); 12052582d50cSToby Isaac supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/; 1206e1757548SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+1]; 1207e1757548SMatthew G. Knepley } else { 12082582d50cSToby Isaac supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/; 1209e1757548SMatthew G. Knepley } 1210e1757548SMatthew G. Knepley } 1211e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1212e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1213da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 1214da1dd7e4SMatthew 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); 1215e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1216e1757548SMatthew G. Knepley /* Add hybrid face */ 1217e1757548SMatthew G. Knepley coneNew[0] = newp; 1218212cc919SMatthew G. Knepley coneNew[1] = newp; 1219e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[0], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1220e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[0]); 1221212cc919SMatthew G. Knepley coneNew[2] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1222e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1223e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]); 1224e1757548SMatthew G. Knepley coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1225e1757548SMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 1226da1dd7e4SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1227da1dd7e4SMatthew G. Knepley PetscInt val, face; 1228da1dd7e4SMatthew G. Knepley 1229da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1230da1dd7e4SMatthew G. Knepley if (val == dim-1) { 1231da1dd7e4SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1232da1dd7e4SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1233da1dd7e4SMatthew G. Knepley } 1234da1dd7e4SMatthew G. Knepley } 1235da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, hybface, &supportSizeNew);CHKERRQ(ierr); 1236da1dd7e4SMatthew 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); 1237e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1238cd0c2139SMatthew G Knepley } 1239cd0c2139SMatthew G Knepley } 1240cd0c2139SMatthew G Knepley } 1241cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 1242cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1243cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 1244cd0c2139SMatthew G Knepley IS pIS; 1245cd0c2139SMatthew G Knepley PetscInt numPoints; 1246cd0c2139SMatthew G Knepley const PetscInt *points; 1247cd0c2139SMatthew G Knepley 1248cd0c2139SMatthew G Knepley if (dep >= 0) continue; 1249cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 1250cd0c2139SMatthew G Knepley if (!pIS) continue; 1251cd0c2139SMatthew G Knepley dep = -dep - shift; 1252cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 1253cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 1254cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1255cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 12562582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*depthOffset[dep] + oldp*/; 1257cd0c2139SMatthew G Knepley const PetscInt *cone; 1258cd0c2139SMatthew G Knepley PetscInt coneSize, c; 125950cf782dSMatthew G. Knepley /* PetscBool replaced = PETSC_FALSE; */ 1260cd0c2139SMatthew G Knepley 1261cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 1262cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 1263cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 1264cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 1265cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 12662582d50cSToby Isaac const PetscInt coldp = DMPlexShiftPointInverse_Internal(cone[2],depth,depthShift); 1267cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 1268cd0c2139SMatthew G Knepley 1269cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 1270cd0c2139SMatthew G Knepley if (val == dep-1) { 1271cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 1272cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 1273cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 1274cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 127550cf782dSMatthew G. Knepley /* replaced = PETSC_TRUE; */ 1276cd0c2139SMatthew G Knepley } 1277cd0c2139SMatthew G Knepley } 12784a189a86SMatthew G. Knepley /* Cells with only a vertex or edge on the submesh have no replacement */ 12794a189a86SMatthew G. Knepley /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 1280cd0c2139SMatthew G Knepley } 1281cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 1282cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 1283cd0c2139SMatthew G Knepley } 1284cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 1285cd0c2139SMatthew G Knepley ierr = DMPlexStratify(sdm);CHKERRQ(ierr); 1286cd0c2139SMatthew G Knepley /* Step 8: Coordinates */ 1287cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 128869d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 1289cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 1290cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 1291cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 12922582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[0][v], depth, depthShift) /*depthOffset[0] + splitPoints[0][v]*/; 1293cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 1294cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 1295cd0c2139SMatthew G Knepley 1296cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 1297cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 1298cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 1299cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 1300cd0c2139SMatthew G Knepley } 1301cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 1302cd0c2139SMatthew G Knepley /* Step 9: SF, if I can figure this out we can split the mesh in parallel */ 1303cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1304cd0c2139SMatthew G Knepley /* Step 10: Labels */ 1305cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1306cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 1307cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1308cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 13092582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[dep][p], depth, depthShift) /*depthOffset[dep] + splitPoints[dep][p]*/; 1310cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 1311cd0c2139SMatthew G Knepley PetscInt l; 1312cd0c2139SMatthew G Knepley 1313cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 1314cd0c2139SMatthew G Knepley DMLabel mlabel; 1315cd0c2139SMatthew G Knepley const char *lname; 1316cd0c2139SMatthew G Knepley PetscInt val; 13179a356370SMatthew G. Knepley PetscBool isDepth; 1318cd0c2139SMatthew G Knepley 1319cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 13209a356370SMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 13219a356370SMatthew G. Knepley if (isDepth) continue; 1322cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 1323cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 1324cd0c2139SMatthew G Knepley if (val >= 0) { 1325cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 13269a356370SMatthew G. Knepley #if 0 13279a356370SMatthew G. Knepley /* Do not put cohesive edges into the label */ 1328cd0c2139SMatthew G Knepley if (dep == 0) { 13294c367dbcSMatthew G. Knepley const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1330cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr); 13314c367dbcSMatthew G. Knepley } else if (dep == dim-2) { 13324c367dbcSMatthew G. Knepley const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 13334c367dbcSMatthew G. Knepley ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr); 1334cd0c2139SMatthew G Knepley } 13354c367dbcSMatthew G. Knepley /* Do not put cohesive faces into the label */ 13369a356370SMatthew G. Knepley #endif 1337cd0c2139SMatthew G Knepley } 1338cd0c2139SMatthew G Knepley } 1339cd0c2139SMatthew G Knepley } 1340cd0c2139SMatthew G Knepley } 1341cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1342cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 1343cd0c2139SMatthew G Knepley 1344cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 134518c5995bSMatthew G. Knepley if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 134618c5995bSMatthew G. Knepley ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr); 134718c5995bSMatthew G. Knepley if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);} 134818c5995bSMatthew G. Knepley ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr); 1349cd0c2139SMatthew G Knepley } 1350cd0c2139SMatthew G Knepley if (label) { 1351cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1352cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1353cd0c2139SMatthew G Knepley } 13540d4d4d06SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 13550d4d4d06SMatthew G. Knepley ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr); 135636dbac82SMatthew G. Knepley pMaxNew[d] = pEnd - numHybridPoints[d] - numHybridPointsOld[d]; 13570d4d4d06SMatthew G. Knepley } 13580e49e2e2SMatthew 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); 1359dcbb62e8SMatthew G. Knepley ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr); 13602582d50cSToby Isaac ierr = PetscFree5(depthMax, depthEnd, depthShift, pMaxNew, numHybridPointsOld);CHKERRQ(ierr); 136118c5995bSMatthew G. Knepley ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr); 1362cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1363cd0c2139SMatthew G Knepley } 1364cd0c2139SMatthew G Knepley 1365cd0c2139SMatthew G Knepley #undef __FUNCT__ 1366cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells" 1367cd0c2139SMatthew G Knepley /*@C 1368cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 1369cd0c2139SMatthew G Knepley 1370cd0c2139SMatthew G Knepley Collective on dm 1371cd0c2139SMatthew G Knepley 1372cd0c2139SMatthew G Knepley Input Parameters: 1373cd0c2139SMatthew G Knepley + dm - The original DM 137453156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated) 1375cd0c2139SMatthew G Knepley 1376cd0c2139SMatthew G Knepley Output Parameters: 1377cd0c2139SMatthew G Knepley - dmSplit - The new DM 1378cd0c2139SMatthew G Knepley 1379cd0c2139SMatthew G Knepley Level: developer 1380cd0c2139SMatthew G Knepley 13812be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 1382cd0c2139SMatthew G Knepley @*/ 1383cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 1384cd0c2139SMatthew G Knepley { 1385cd0c2139SMatthew G Knepley DM sdm; 1386cd0c2139SMatthew G Knepley PetscInt dim; 1387cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1388cd0c2139SMatthew G Knepley 1389cd0c2139SMatthew G Knepley PetscFunctionBegin; 1390cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 139153156dfcSMatthew G. Knepley PetscValidPointer(dmSplit, 3); 1392cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 1393cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 1394c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1395c73cfb54SMatthew G. Knepley ierr = DMSetDimension(sdm, dim);CHKERRQ(ierr); 1396cd0c2139SMatthew G Knepley switch (dim) { 1397cd0c2139SMatthew G Knepley case 2: 1398cd0c2139SMatthew G Knepley case 3: 1399cd0c2139SMatthew G Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 1400cd0c2139SMatthew G Knepley break; 1401cd0c2139SMatthew G Knepley default: 1402cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 1403cd0c2139SMatthew G Knepley } 1404cd0c2139SMatthew G Knepley *dmSplit = sdm; 1405cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1406cd0c2139SMatthew G Knepley } 1407cd0c2139SMatthew G Knepley 1408cd0c2139SMatthew G Knepley #undef __FUNCT__ 14090f66a230SMatthew G. Knepley #define __FUNCT__ "GetSurfaceSide_Static" 14100f66a230SMatthew G. Knepley /* Returns the side of the surface for a given cell with a face on the surface */ 14110f66a230SMatthew G. Knepley static PetscErrorCode GetSurfaceSide_Static(DM dm, DM subdm, PetscInt numSubpoints, const PetscInt *subpoints, PetscInt cell, PetscInt face, PetscBool *pos) 14120f66a230SMatthew G. Knepley { 14130f66a230SMatthew G. Knepley const PetscInt *cone, *ornt; 14140f66a230SMatthew G. Knepley PetscInt dim, coneSize, c; 14150f66a230SMatthew G. Knepley PetscErrorCode ierr; 14160f66a230SMatthew G. Knepley 14170f66a230SMatthew G. Knepley PetscFunctionBegin; 14180f66a230SMatthew G. Knepley *pos = PETSC_TRUE; 1419c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 14200f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 14210f66a230SMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 14220f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, cell, &ornt);CHKERRQ(ierr); 14230f66a230SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 14240f66a230SMatthew G. Knepley if (cone[c] == face) { 14250f66a230SMatthew G. Knepley PetscInt o = ornt[c]; 14260f66a230SMatthew G. Knepley 14270f66a230SMatthew G. Knepley if (subdm) { 14280f66a230SMatthew G. Knepley const PetscInt *subcone, *subornt; 14290f66a230SMatthew G. Knepley PetscInt subpoint, subface, subconeSize, sc; 14300f66a230SMatthew G. Knepley 14310f66a230SMatthew G. Knepley ierr = PetscFindInt(cell, numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 14320f66a230SMatthew G. Knepley ierr = PetscFindInt(face, numSubpoints, subpoints, &subface);CHKERRQ(ierr); 14330f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 14340f66a230SMatthew G. Knepley ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 14350f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 14360f66a230SMatthew G. Knepley for (sc = 0; sc < subconeSize; ++sc) { 14370f66a230SMatthew G. Knepley if (subcone[sc] == subface) { 14380f66a230SMatthew G. Knepley o = subornt[0]; 14390f66a230SMatthew G. Knepley break; 14400f66a230SMatthew G. Knepley } 14410f66a230SMatthew G. Knepley } 14420f66a230SMatthew 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); 14430f66a230SMatthew G. Knepley } 14440f66a230SMatthew G. Knepley if (o >= 0) *pos = PETSC_TRUE; 14450f66a230SMatthew G. Knepley else *pos = PETSC_FALSE; 14460f66a230SMatthew G. Knepley break; 14470f66a230SMatthew G. Knepley } 14480f66a230SMatthew G. Knepley } 14490f66a230SMatthew 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); 14500f66a230SMatthew G. Knepley PetscFunctionReturn(0); 14510f66a230SMatthew G. Knepley } 14520f66a230SMatthew G. Knepley 14530f66a230SMatthew G. Knepley #undef __FUNCT__ 14542be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete" 1455cd0c2139SMatthew G Knepley /*@ 14560f66a230SMatthew G. Knepley DMPlexLabelCohesiveComplete - Starting with a label marking points on an internal surface, we add all other mesh pieces 1457cd0c2139SMatthew G Knepley to complete the surface 1458cd0c2139SMatthew G Knepley 1459cd0c2139SMatthew G Knepley Input Parameters: 1460cd0c2139SMatthew G Knepley + dm - The DM 14610f66a230SMatthew G. Knepley . label - A DMLabel marking the surface 14620f66a230SMatthew G. Knepley . blabel - A DMLabel marking the vertices on the boundary which will not be duplicated, or NULL to find them automatically 1463bb55d314SMatthew G. Knepley . flip - Flag to flip the submesh normal and replace points on the other side 146447946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL 1465cd0c2139SMatthew G Knepley 1466cd0c2139SMatthew G Knepley Output Parameter: 1467cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 1468cd0c2139SMatthew G Knepley 14690f66a230SMatthew G. Knepley Note: The vertices in blabel are called "unsplit" in the terminology from hybrid cell creation. 14700f66a230SMatthew G. Knepley 1471cd0c2139SMatthew G Knepley Level: developer 1472cd0c2139SMatthew G Knepley 14732be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 1474cd0c2139SMatthew G Knepley @*/ 14750f66a230SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, DMLabel blabel, PetscBool flip, DM subdm) 1476cd0c2139SMatthew G Knepley { 1477d90583fdSMatthew G. Knepley DMLabel depthLabel; 147886200784SMatthew G. Knepley IS dimIS, subpointIS, facePosIS, faceNegIS, crossEdgeIS = NULL; 147947946fd8SMatthew G. Knepley const PetscInt *points, *subpoints; 1480bb55d314SMatthew G. Knepley const PetscInt rev = flip ? -1 : 1; 1481370472baSMatthew G. Knepley PetscInt *pMax; 1482370472baSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, dim, depth, pSize, dep, cStart, cEnd, cMax, fStart, fEnd, vStart, vEnd, numPoints, numSubpoints, p, val; 1483cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1484cd0c2139SMatthew G Knepley 1485cd0c2139SMatthew G Knepley PetscFunctionBegin; 1486370472baSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1487370472baSMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1488370472baSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1489370472baSMatthew G. Knepley ierr = PetscMalloc1(pSize,&pMax);CHKERRQ(ierr); 1490370472baSMatthew 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); 1491d90583fdSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 1492c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 149347946fd8SMatthew G. Knepley if (subdm) { 149447946fd8SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 149547946fd8SMatthew G. Knepley if (subpointIS) { 149647946fd8SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 149747946fd8SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 149847946fd8SMatthew G. Knepley } 149947946fd8SMatthew G. Knepley } 1500d7c8f101SMatthew G. Knepley /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */ 1501cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 1502dc86033cSMatthew G. Knepley if (!dimIS) { 1503dc86033cSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1504dc86033cSMatthew G. Knepley PetscFunctionReturn(0); 1505dc86033cSMatthew G. Knepley } 1506cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1507cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1508d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */ 1509cd0c2139SMatthew G Knepley const PetscInt *support; 1510cd0c2139SMatthew G Knepley PetscInt supportSize, s; 1511cd0c2139SMatthew G Knepley 1512cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1513cd0c2139SMatthew G Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 1514cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1515cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 15160f66a230SMatthew G. Knepley const PetscInt *cone; 1517cd0c2139SMatthew G Knepley PetscInt coneSize, c; 15180f66a230SMatthew G. Knepley PetscBool pos; 1519cd0c2139SMatthew G Knepley 15200f66a230SMatthew G. Knepley ierr = GetSurfaceSide_Static(dm, subdm, numSubpoints, subpoints, support[s], points[p], &pos);CHKERRQ(ierr); 15210f66a230SMatthew G. Knepley if (pos) {ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr);} 15220f66a230SMatthew G. Knepley else {ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);} 15230f66a230SMatthew G. Knepley if (rev < 0) pos = !pos ? PETSC_TRUE : PETSC_FALSE; 15240f66a230SMatthew G. Knepley /* Put faces touching the fault in the label */ 1525cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1526cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1527cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1528cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 1529cd0c2139SMatthew G Knepley 1530cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1531cd0c2139SMatthew G Knepley if (val == -1) { 1532cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 1533cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 1534cd0c2139SMatthew G Knepley 1535cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1536cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1537cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 1538a0541d8aSMatthew G. Knepley PetscInt bval = -1; 1539cd0c2139SMatthew G Knepley 1540cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1541a0541d8aSMatthew G. Knepley if (blabel) {ierr = DMLabelGetValue(blabel, clp, &bval);CHKERRQ(ierr);} 1542a0541d8aSMatthew G. Knepley if ((val >= 0) && (val < dim-1) && (bval < 0)) { 1543cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1544cd0c2139SMatthew G Knepley break; 1545cd0c2139SMatthew G Knepley } 1546cd0c2139SMatthew G Knepley } 1547cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1548cd0c2139SMatthew G Knepley } 1549cd0c2139SMatthew G Knepley } 1550cd0c2139SMatthew G Knepley } 1551cd0c2139SMatthew G Knepley } 15520f66a230SMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 15530f66a230SMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 155447946fd8SMatthew G. Knepley if (subdm) { 155547946fd8SMatthew G. Knepley if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 155647946fd8SMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 155747946fd8SMatthew G. Knepley } 1558a0541d8aSMatthew G. Knepley /* Mark boundary points as unsplit */ 155986200784SMatthew G. Knepley if (blabel) { 1560a0541d8aSMatthew G. Knepley ierr = DMLabelGetStratumIS(blabel, 1, &dimIS);CHKERRQ(ierr); 1561a0541d8aSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1562a0541d8aSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1563a0541d8aSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1564a0541d8aSMatthew G. Knepley const PetscInt point = points[p]; 1565a0541d8aSMatthew G. Knepley PetscInt val, bval; 1566a0541d8aSMatthew G. Knepley 1567a0541d8aSMatthew G. Knepley ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr); 1568a0541d8aSMatthew G. Knepley if (bval >= 0) { 1569f7019248SMatthew G. Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1570f7019248SMatthew G. Knepley if ((val < 0) || (val > dim)) { 1571f7019248SMatthew G. Knepley /* This could be a point added from splitting a vertex on an adjacent fault, otherwise its just wrong */ 1572f7019248SMatthew G. Knepley ierr = DMLabelClearValue(blabel, point, bval);CHKERRQ(ierr); 1573f7019248SMatthew G. Knepley } 1574f7019248SMatthew G. Knepley } 1575f7019248SMatthew G. Knepley } 1576f7019248SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1577f7019248SMatthew G. Knepley const PetscInt point = points[p]; 1578f7019248SMatthew G. Knepley PetscInt val, bval; 1579f7019248SMatthew G. Knepley 1580f7019248SMatthew G. Knepley ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr); 1581f7019248SMatthew G. Knepley if (bval >= 0) { 158286200784SMatthew G. Knepley const PetscInt *cone, *support; 158386200784SMatthew G. Knepley PetscInt coneSize, supportSize, s, valA, valB, valE; 158486200784SMatthew G. Knepley 1585a0541d8aSMatthew G. Knepley /* Mark as unsplit */ 1586a0541d8aSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1587a0541d8aSMatthew 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); 1588a0541d8aSMatthew G. Knepley ierr = DMLabelClearValue(label, point, val);CHKERRQ(ierr); 1589a0541d8aSMatthew G. Knepley ierr = DMLabelSetValue(label, point, shift2+val);CHKERRQ(ierr); 15902c06a818SMatthew G. Knepley /* Check for cross-edge 15912c06a818SMatthew G. Knepley A cross-edge has endpoints which are both on the boundary of the surface, but the edge itself is not. */ 159286200784SMatthew G. Knepley if (val != 0) continue; 159386200784SMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 159486200784SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 159586200784SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 159686200784SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 159786200784SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 159886200784SMatthew G. Knepley if (coneSize != 2) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Edge %D has %D vertices != 2", support[s], coneSize); 159986200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, cone[0], &valA);CHKERRQ(ierr); 160086200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, cone[1], &valB);CHKERRQ(ierr); 160186200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, support[s], &valE);CHKERRQ(ierr); 160209816f77SMatthew G. Knepley if ((valE < 0) && (valA >= 0) && (valB >= 0) && (cone[0] != cone[1])) {ierr = DMLabelSetValue(blabel, support[s], 2);CHKERRQ(ierr);} 160386200784SMatthew G. Knepley } 1604a0541d8aSMatthew G. Knepley } 1605a0541d8aSMatthew G. Knepley } 1606a0541d8aSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1607a0541d8aSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1608a0541d8aSMatthew G. Knepley } 1609cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1610c4d480a2SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 1611cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1612d24f5ce5SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1613d24f5ce5SMatthew G. Knepley cMax = cMax < 0 ? cEnd : cMax; 16140f66a230SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 1615cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 161686200784SMatthew G. Knepley if (blabel) {ierr = DMLabelGetStratumIS(blabel, 2, &crossEdgeIS);CHKERRQ(ierr);} 161786200784SMatthew G. Knepley if (dimIS && crossEdgeIS) { 161886200784SMatthew G. Knepley IS vertIS = dimIS; 161986200784SMatthew G. Knepley 162086200784SMatthew G. Knepley ierr = ISExpand(vertIS, crossEdgeIS, &dimIS);CHKERRQ(ierr); 162186200784SMatthew G. Knepley ierr = ISDestroy(&crossEdgeIS);CHKERRQ(ierr); 162286200784SMatthew G. Knepley ierr = ISDestroy(&vertIS);CHKERRQ(ierr); 162386200784SMatthew G. Knepley } 1624dc86033cSMatthew G. Knepley if (!dimIS) { 1625dc86033cSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1626dc86033cSMatthew G. Knepley PetscFunctionReturn(0); 1627dc86033cSMatthew G. Knepley } 1628cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1629cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1630d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */ 1631cd0c2139SMatthew G Knepley PetscInt *star = NULL; 163286200784SMatthew G. Knepley PetscInt starSize, s; 1633cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1634cd0c2139SMatthew G Knepley 1635d4622b2cSMatthew G. Knepley /* All points connected to the fault are inside a cell, so at the top level we will only check cells */ 1636cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1637cd0c2139SMatthew G Knepley while (again) { 1638cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1639cd0c2139SMatthew G Knepley again = 0; 1640cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1641cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1642cd0c2139SMatthew G Knepley const PetscInt *cone; 1643cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1644cd0c2139SMatthew G Knepley 1645d24f5ce5SMatthew G. Knepley if ((point < cStart) || (point >= cMax)) continue; 1646cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1647cd0c2139SMatthew G Knepley if (val != -1) continue; 1648d4622b2cSMatthew G. Knepley again = again == 1 ? 1 : 2; 1649cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1650cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1651cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1652cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1653cd0c2139SMatthew G Knepley if (val != -1) { 1654d7c8f101SMatthew G. Knepley const PetscInt *ccone; 1655166d9d0cSMatthew G. Knepley PetscInt cconeSize, cc, side; 1656d7c8f101SMatthew G. Knepley 1657db8edaafSMatthew 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); 165837a6de01SMatthew G. Knepley if (val > 0) side = 1; 165937a6de01SMatthew G. Knepley else side = -1; 166037a6de01SMatthew G. Knepley ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr); 1661d7c8f101SMatthew G. Knepley /* Mark cell faces which touch the fault */ 1662d7c8f101SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr); 1663d7c8f101SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr); 1664d7c8f101SMatthew G. Knepley for (cc = 0; cc < cconeSize; ++cc) { 1665d7c8f101SMatthew G. Knepley PetscInt *closure = NULL; 1666d7c8f101SMatthew G. Knepley PetscInt closureSize, cl; 1667d7c8f101SMatthew G. Knepley 1668166d9d0cSMatthew G. Knepley ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr); 1669166d9d0cSMatthew G. Knepley if (val != -1) continue; 1670d7c8f101SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1671d4622b2cSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1672d7c8f101SMatthew G. Knepley const PetscInt clp = closure[cl]; 1673d7c8f101SMatthew G. Knepley 1674d7c8f101SMatthew G. Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1675d7c8f101SMatthew G. Knepley if (val == -1) continue; 1676d7c8f101SMatthew G. Knepley ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr); 167737a6de01SMatthew G. Knepley break; 167837a6de01SMatthew G. Knepley } 1679d7c8f101SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1680cd0c2139SMatthew G Knepley } 1681cd0c2139SMatthew G Knepley again = 1; 1682cd0c2139SMatthew G Knepley break; 1683cd0c2139SMatthew G Knepley } 1684cd0c2139SMatthew G Knepley } 1685cd0c2139SMatthew G Knepley } 1686cd0c2139SMatthew G Knepley } 1687cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1688cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1689cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1690cd0c2139SMatthew G Knepley 1691cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1692cd0c2139SMatthew G Knepley if (val == -1) { 1693cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1694cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1695cd0c2139SMatthew G Knepley PetscBool marked = PETSC_FALSE; 1696cd0c2139SMatthew G Knepley 1697cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1698cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1699cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1700cd0c2139SMatthew G Knepley 1701d24f5ce5SMatthew G. Knepley if ((spoint < cStart) || (spoint >= cMax)) continue; 1702cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1703cd0c2139SMatthew 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); 1704d90583fdSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1705cd0c2139SMatthew G Knepley if (val > 0) { 1706cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1707cd0c2139SMatthew G Knepley } else { 1708cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1709cd0c2139SMatthew G Knepley } 1710cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1711cd0c2139SMatthew G Knepley break; 1712cd0c2139SMatthew G Knepley } 1713cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1714370472baSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1715370472baSMatthew G. Knepley if (point < pMax[dep] && !marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1716cd0c2139SMatthew G Knepley } 1717cd0c2139SMatthew G Knepley } 1718cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1719cd0c2139SMatthew G Knepley } 1720cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1721cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 172218c5995bSMatthew G. Knepley /* If any faces touching the fault divide cells on either side, split them */ 172318c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift+dim-1, &facePosIS);CHKERRQ(ierr); 172418c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr); 172518c5995bSMatthew G. Knepley ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr); 172618c5995bSMatthew G. Knepley ierr = ISDestroy(&facePosIS);CHKERRQ(ierr); 172718c5995bSMatthew G. Knepley ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr); 172818c5995bSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 172918c5995bSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 173018c5995bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 173118c5995bSMatthew G. Knepley const PetscInt point = points[p]; 173218c5995bSMatthew G. Knepley const PetscInt *support; 173318c5995bSMatthew G. Knepley PetscInt supportSize, valA, valB; 173418c5995bSMatthew G. Knepley 173518c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 173618c5995bSMatthew G. Knepley if (supportSize != 2) continue; 173718c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 173818c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr); 173918c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr); 174018c5995bSMatthew G. Knepley if ((valA == -1) || (valB == -1)) continue; 174118c5995bSMatthew G. Knepley if (valA*valB > 0) continue; 174218c5995bSMatthew G. Knepley /* Split the face */ 174318c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr); 174418c5995bSMatthew G. Knepley ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr); 174518c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr); 1746e1757548SMatthew G. Knepley /* Label its closure: 1747e1757548SMatthew G. Knepley unmarked: label as unsplit 1748e1757548SMatthew G. Knepley incident: relabel as split 1749e1757548SMatthew G. Knepley split: do nothing 1750e1757548SMatthew G. Knepley */ 175118c5995bSMatthew G. Knepley { 175218c5995bSMatthew G. Knepley PetscInt *closure = NULL; 175318c5995bSMatthew G. Knepley PetscInt closureSize, cl; 175418c5995bSMatthew G. Knepley 175518c5995bSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 175618c5995bSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 175718c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr); 17588771c1d3SMatthew G. Knepley if (valA == -1) { /* Mark as unsplit */ 175918c5995bSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 176018c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr); 17618771c1d3SMatthew G. Knepley } else if (((valA >= shift) && (valA < shift2)) || ((valA <= -shift) && (valA > -shift2))) { 1762e1757548SMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 1763e1757548SMatthew G. Knepley ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr); 1764e1757548SMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr); 1765e1757548SMatthew G. Knepley } 176618c5995bSMatthew G. Knepley } 176718c5995bSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 176818c5995bSMatthew G. Knepley } 176918c5995bSMatthew G. Knepley } 177018c5995bSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 177118c5995bSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1772370472baSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1773cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1774cd0c2139SMatthew G Knepley } 1775cd0c2139SMatthew G Knepley 1776cd0c2139SMatthew G Knepley #undef __FUNCT__ 17773cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh" 17783cf72582SMatthew G. Knepley /*@C 17793cf72582SMatthew G. Knepley DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface 17803cf72582SMatthew G. Knepley 17813cf72582SMatthew G. Knepley Collective on dm 17823cf72582SMatthew G. Knepley 17833cf72582SMatthew G. Knepley Input Parameters: 17843cf72582SMatthew G. Knepley + dm - The original DM 17853cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices 17863cf72582SMatthew G. Knepley 17873cf72582SMatthew G. Knepley Output Parameters: 17883cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface 17893cf72582SMatthew G. Knepley - dmHybrid - The new DM 17903cf72582SMatthew G. Knepley 17913cf72582SMatthew G. Knepley Level: developer 17923cf72582SMatthew G. Knepley 17933cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate() 17943cf72582SMatthew G. Knepley @*/ 17953cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid) 17963cf72582SMatthew G. Knepley { 17973cf72582SMatthew G. Knepley DM idm; 17983cf72582SMatthew G. Knepley DMLabel subpointMap, hlabel; 17993cf72582SMatthew G. Knepley PetscInt dim; 18003cf72582SMatthew G. Knepley PetscErrorCode ierr; 18013cf72582SMatthew G. Knepley 18023cf72582SMatthew G. Knepley PetscFunctionBegin; 18033cf72582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 18043cf72582SMatthew G. Knepley if (hybridLabel) PetscValidPointer(hybridLabel, 3); 18053cf72582SMatthew G. Knepley PetscValidPointer(dmHybrid, 4); 1806c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 18073cf72582SMatthew G. Knepley ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr); 18083cf72582SMatthew G. Knepley ierr = DMPlexOrient(idm);CHKERRQ(ierr); 18093cf72582SMatthew G. Knepley ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr); 18103cf72582SMatthew G. Knepley ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr); 18113cf72582SMatthew G. Knepley ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr); 18120f66a230SMatthew G. Knepley ierr = DMPlexLabelCohesiveComplete(dm, hlabel, NULL, PETSC_FALSE, idm);CHKERRQ(ierr); 18133cf72582SMatthew G. Knepley ierr = DMDestroy(&idm);CHKERRQ(ierr); 18143cf72582SMatthew G. Knepley ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr); 18153cf72582SMatthew G. Knepley if (hybridLabel) *hybridLabel = hlabel; 181653aa2e23SMatthew G. Knepley else {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);} 1817e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1818e6ccafaeSMatthew G Knepley } 1819e6ccafaeSMatthew G Knepley 1820e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1821efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated" 1822efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 1823efa14ee0SMatthew G Knepley 1824efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 1825efa14ee0SMatthew G Knepley */ 1826830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1827efa14ee0SMatthew G Knepley { 1828fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 1829efa14ee0SMatthew G Knepley const PetscInt *subvertices; 183077d178adSMatthew G. Knepley PetscInt *pStart, *pEnd, *pMax, pSize; 1831efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1832efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1833efa14ee0SMatthew G Knepley 1834efa14ee0SMatthew G Knepley PetscFunctionBegin; 1835efa14ee0SMatthew G Knepley *numFaces = 0; 1836efa14ee0SMatthew G Knepley *nFV = 0; 1837efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1838c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 183977d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1840dcca6d9dSJed Brown ierr = PetscMalloc3(pSize,&pStart,pSize,&pEnd,pSize,&pMax);CHKERRQ(ierr); 1841d92e47f8SMatthew 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); 1842efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 1843efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1844efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1845efa14ee0SMatthew G Knepley } 1846efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1847fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1848efa14ee0SMatthew G Knepley if (subvertexIS) { 1849efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1850efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1851efa14ee0SMatthew G Knepley } 1852efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1853efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 18540298fd71SBarry Smith PetscInt *star = NULL; 1855efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 1856efa14ee0SMatthew G Knepley 1857efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1858efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1859efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1860efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1861efa14ee0SMatthew G Knepley } 1862efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 1863efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 18640298fd71SBarry Smith PetscInt *closure = NULL; 1865efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 1866efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 1867efa14ee0SMatthew G Knepley 1868efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 186965560c7fSMatthew G Knepley if (cellLoc == 2) continue; 187082f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1871efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1872efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1873efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1874efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1875efa14ee0SMatthew G Knepley 1876efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1877efa14ee0SMatthew G Knepley ++numCorners; 1878efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1879830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 1880efa14ee0SMatthew G Knepley } 1881efa14ee0SMatthew G Knepley } 188218ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 188382f516ccSBarry 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); 1884efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 1885007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 1886007baee2SMatthew G. Knepley PetscInt numCells, nc; 1887007baee2SMatthew G. Knepley 1888efa14ee0SMatthew G Knepley ++(*numFaces); 1889efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 1890efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 1891efa14ee0SMatthew G Knepley } 1892007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1893007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 1894007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 1895007baee2SMatthew G. Knepley } 1896007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1897efa14ee0SMatthew G Knepley } 1898efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1899efa14ee0SMatthew G Knepley } 1900efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1901efa14ee0SMatthew G Knepley } 1902efa14ee0SMatthew G Knepley if (subvertexIS) { 1903efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1904efa14ee0SMatthew G Knepley } 1905efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1906efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1907efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1908efa14ee0SMatthew G Knepley } 1909efa14ee0SMatthew G Knepley 1910efa14ee0SMatthew G Knepley #undef __FUNCT__ 1911efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated" 1912830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 1913efa14ee0SMatthew G Knepley { 191434b4c39eSMatthew G. Knepley IS subvertexIS = NULL; 1915efa14ee0SMatthew G Knepley const PetscInt *subvertices; 1916efa14ee0SMatthew G Knepley PetscInt *pStart, *pEnd, *pMax; 1917efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 1918efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1919efa14ee0SMatthew G Knepley 1920efa14ee0SMatthew G Knepley PetscFunctionBegin; 1921c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1922dcca6d9dSJed Brown ierr = PetscMalloc3(dim+1,&pStart,dim+1,&pEnd,dim+1,&pMax);CHKERRQ(ierr); 19230298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1924efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 1925efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1926efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1927efa14ee0SMatthew G Knepley } 1928efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 192934b4c39eSMatthew G. Knepley if (vertexLabel) { 1930830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 1931efa14ee0SMatthew G Knepley if (subvertexIS) { 1932efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1933efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1934efa14ee0SMatthew G Knepley } 193534b4c39eSMatthew G. Knepley } 1936efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1937efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 19380298fd71SBarry Smith PetscInt *star = NULL; 1939efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 1940efa14ee0SMatthew G Knepley 1941efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1942efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1943efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1944efa14ee0SMatthew G Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 1945efa14ee0SMatthew G Knepley } 1946efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 1947efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 19480298fd71SBarry Smith PetscInt *closure = NULL; 1949efa14ee0SMatthew G Knepley PetscInt closureSize, c; 1950efa14ee0SMatthew G Knepley PetscInt faceLoc; 1951efa14ee0SMatthew G Knepley 1952efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 1953efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 195482f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 1955efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1956efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1957efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1958efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1959efa14ee0SMatthew G Knepley 1960efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1961efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1962830e53efSMatthew G. Knepley if (vertexLoc != value) break; 1963efa14ee0SMatthew G Knepley } 1964efa14ee0SMatthew G Knepley } 1965efa14ee0SMatthew G Knepley if (c == closureSize*2) { 1966efa14ee0SMatthew G Knepley const PetscInt *support; 1967efa14ee0SMatthew G Knepley PetscInt supportSize, s; 1968efa14ee0SMatthew G Knepley 1969efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1970efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1971efa14ee0SMatthew G Knepley 1972efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 1973efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1974efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1975efa14ee0SMatthew G Knepley break; 1976efa14ee0SMatthew G Knepley } 1977efa14ee0SMatthew G Knepley } 1978efa14ee0SMatthew G Knepley } 1979efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 1980efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 1981efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1982efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1983efa14ee0SMatthew G Knepley } 1984efa14ee0SMatthew G Knepley } 1985efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1986efa14ee0SMatthew G Knepley } 1987efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1988efa14ee0SMatthew G Knepley } 198934b4c39eSMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);} 1990efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1991efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1992efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1993efa14ee0SMatthew G Knepley } 1994efa14ee0SMatthew G Knepley 1995efa14ee0SMatthew G Knepley #undef __FUNCT__ 1996766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated" 199727c04023SMatthew 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) 1998766ab985SMatthew G. Knepley { 199927c04023SMatthew G. Knepley DMLabel label = NULL; 2000766ab985SMatthew G. Knepley const PetscInt *cone; 200127234c99SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize; 2002766ab985SMatthew G. Knepley PetscErrorCode ierr; 2003766ab985SMatthew G. Knepley 2004812bfc34SJed Brown PetscFunctionBegin; 2005c0ed958bSJed Brown *numFaces = 0; 2006c0ed958bSJed Brown *nFV = 0; 2007b6d5cb33SJed Brown if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 2008fed694aaSMatthew G. Knepley *subCells = NULL; 2009c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2010766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 2011766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2012766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 201327c04023SMatthew G. Knepley if (label) { 201427c04023SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 201527c04023SMatthew G. Knepley PetscInt val; 201627c04023SMatthew G. Knepley 201727c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 201827c04023SMatthew G. Knepley if (val == value) { 201927c04023SMatthew G. Knepley ++(*numFaces); 202027c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 202127c04023SMatthew G. Knepley } 202227c04023SMatthew G. Knepley } 202327c04023SMatthew G. Knepley } else { 2024766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 202527c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 202627c04023SMatthew G. Knepley } 2027766ab985SMatthew G. Knepley *nFV = hasLagrange ? coneSize/3 : coneSize/2; 2028785e854fSJed Brown ierr = PetscMalloc1(*numFaces *2, subCells);CHKERRQ(ierr); 2029766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 2030766ab985SMatthew G. Knepley const PetscInt *cells; 2031766ab985SMatthew G. Knepley PetscInt numCells; 2032766ab985SMatthew G. Knepley 203327c04023SMatthew G. Knepley if (label) { 203427c04023SMatthew G. Knepley PetscInt val; 203527c04023SMatthew G. Knepley 203627c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 203727c04023SMatthew G. Knepley if (val != value) continue; 203827c04023SMatthew G. Knepley } 2039766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2040766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 2041766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 2042766ab985SMatthew G. Knepley } 2043766ab985SMatthew G. Knepley /* Negative face */ 2044766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 204527234c99SMatthew G. Knepley /* Not true in parallel 204627234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 2047766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 2048766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 204927234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 2050766ab985SMatthew G. Knepley } 2051766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 2052766ab985SMatthew G. Knepley /* Positive face is not included */ 2053766ab985SMatthew G. Knepley } 2054766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2055766ab985SMatthew G. Knepley } 2056766ab985SMatthew G. Knepley 2057766ab985SMatthew G. Knepley #undef __FUNCT__ 2058766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated" 20593982b651SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, DMLabel label, PetscInt value, DMLabel subpointMap, DM subdm) 2060766ab985SMatthew G. Knepley { 2061766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 2062766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 2063766ab985SMatthew G. Knepley PetscErrorCode ierr; 2064766ab985SMatthew G. Knepley 2065812bfc34SJed Brown PetscFunctionBegin; 2066c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2067766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 2068766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2069766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 2070dcca6d9dSJed Brown ierr = PetscMalloc2(dim+1,&pStart,dim+1,&pEnd);CHKERRQ(ierr); 2071b3154360SMatthew G. Knepley for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);} 2072766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 2073766ab985SMatthew G. Knepley const PetscInt *cone; 2074766ab985SMatthew G. Knepley PetscInt *closure = NULL; 2075b3154360SMatthew G. Knepley PetscInt fconeSize, coneSize, closureSize, cl, val; 2076766ab985SMatthew G. Knepley 207727c04023SMatthew G. Knepley if (label) { 207827c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 207927c04023SMatthew G. Knepley if (val != value) continue; 208027c04023SMatthew G. Knepley } 2081766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2082766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2083b3154360SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr); 2084b3154360SMatthew G. Knepley if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 2085b3154360SMatthew G. Knepley /* Negative face */ 2086766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2087766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2088766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 2089766ab985SMatthew G. Knepley 2090766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2091766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 2092766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 2093766ab985SMatthew G. Knepley break; 2094766ab985SMatthew G. Knepley } 2095766ab985SMatthew G. Knepley } 2096766ab985SMatthew G. Knepley } 2097766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2098766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 2099766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 2100766ab985SMatthew G. Knepley const PetscInt *support; 2101766ab985SMatthew G. Knepley PetscInt supportSize, s; 2102766ab985SMatthew G. Knepley 2103766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 2104711de394SMatthew G. Knepley /* if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); */ 2105766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 2106766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 2107766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 2108766ab985SMatthew G. Knepley } 2109766ab985SMatthew G. Knepley } 2110766ab985SMatthew G. Knepley } 2111766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 2112766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2113766ab985SMatthew G. Knepley } 2114766ab985SMatthew G. Knepley 2115766ab985SMatthew G. Knepley #undef __FUNCT__ 2116e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation" 2117e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2118e6ccafaeSMatthew G Knepley { 211982f516ccSBarry Smith MPI_Comm comm; 2120e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 2121e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 2122e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 2123e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2124e6ccafaeSMatthew G Knepley 212582f516ccSBarry Smith PetscFunctionBegin; 212682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2127c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &cellDim);CHKERRQ(ierr); 2128e6ccafaeSMatthew G Knepley if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 2129e6ccafaeSMatthew G Knepley 2130ddeab2a6SMatthew G. Knepley if (cellDim == 1 && numCorners == 2) { 2131ddeab2a6SMatthew G. Knepley /* Triangle */ 2132e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 2133e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2134ddeab2a6SMatthew G. Knepley } else if (cellDim == 2 && numCorners == 3) { 2135ddeab2a6SMatthew G. Knepley /* Triangle */ 2136ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2137ddeab2a6SMatthew G. Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2138ddeab2a6SMatthew G. Knepley } else if (cellDim == 3 && numCorners == 4) { 2139ddeab2a6SMatthew G. Knepley /* Tetrahedron */ 2140ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2141ddeab2a6SMatthew G. Knepley posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2142e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 2143e6ccafaeSMatthew G Knepley /* Quadratic line */ 2144e6ccafaeSMatthew G Knepley faceSize = 1; 2145e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2146e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 2147e6ccafaeSMatthew G Knepley /* Quads */ 2148e6ccafaeSMatthew G Knepley faceSize = 2; 2149e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 2150e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2151e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 2152e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2153e6ccafaeSMatthew G Knepley } else { 2154e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 2155e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 2156e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 2157e6ccafaeSMatthew G Knepley } 2158e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 2159e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 2160e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2161e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 2162e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2163e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2164e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 2165e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2166e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2167e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 2168e6ccafaeSMatthew G Knepley }; 2169e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 2170e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2171e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2172e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 2173e6ccafaeSMatthew G Knepley }; 2174e6ccafaeSMatthew G Knepley 2175e6ccafaeSMatthew G Knepley faceSize = faceSizeTri; 2176e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 2177e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 2178e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 2179e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 2180e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2181e6ccafaeSMatthew G Knepley 2182e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 2183e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 2184e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 2185e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 2186e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 2187e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2188e6ccafaeSMatthew G Knepley break; 2189e6ccafaeSMatthew G Knepley } 2190e6ccafaeSMatthew G Knepley } 2191e6ccafaeSMatthew G Knepley } 2192e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2193e6ccafaeSMatthew G Knepley break; 2194e6ccafaeSMatthew G Knepley } 2195e6ccafaeSMatthew G Knepley } 2196e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 2197e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2198e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2199e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 2200e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 2201e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2202e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 2203e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2204e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2205e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 2206e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2207e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2208e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2209e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 2210e6ccafaeSMatthew G Knepley }; 2211e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 2212e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2213e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2214e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2215e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 2216e6ccafaeSMatthew G Knepley }; 2217e6ccafaeSMatthew G Knepley 2218e6ccafaeSMatthew G Knepley faceSize = faceSizeQuad; 2219e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 2220e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 2221e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 2222e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 2223e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2224e6ccafaeSMatthew G Knepley 2225e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 2226e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 2227e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 2228e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 2229e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 2230e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2231e6ccafaeSMatthew G Knepley break; 2232e6ccafaeSMatthew G Knepley } 2233e6ccafaeSMatthew G Knepley } 2234e6ccafaeSMatthew G Knepley } 2235e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2236e6ccafaeSMatthew G Knepley break; 2237e6ccafaeSMatthew G Knepley } 2238e6ccafaeSMatthew G Knepley } 2239e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 2240e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2241e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2242e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 2243e6ccafaeSMatthew G Knepley /* Hexes 2244e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2245e6ccafaeSMatthew G Knepley pointing up at the second. 2246e6ccafaeSMatthew G Knepley 2247e6ccafaeSMatthew G Knepley 7---6 2248e6ccafaeSMatthew G Knepley /| /| 2249e6ccafaeSMatthew G Knepley 4---5 | 2250ddeab2a6SMatthew G. Knepley | 1-|-2 2251e6ccafaeSMatthew G Knepley |/ |/ 2252ddeab2a6SMatthew G. Knepley 0---3 2253e6ccafaeSMatthew G Knepley 2254e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2255e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 2256e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 2257e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2258e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 2259e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 2260e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2261ddeab2a6SMatthew G. Knepley 0, 3, 4, 5, /* front */ 2262ddeab2a6SMatthew G. Knepley 2, 3, 5, 6, /* right */ 2263ddeab2a6SMatthew G. Knepley 1, 2, 6, 7, /* back */ 2264ddeab2a6SMatthew G. Knepley 0, 1, 4, 7, /* left */ 2265e6ccafaeSMatthew G Knepley }; 2266e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 2267ddeab2a6SMatthew G. Knepley 1, 2, 3, 0, /* bottom */ 2268e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2269ddeab2a6SMatthew G. Knepley 0, 3, 5, 4, /* front */ 2270ddeab2a6SMatthew G. Knepley 3, 2, 6, 5, /* right */ 2271ddeab2a6SMatthew G. Knepley 2, 1, 7, 6, /* back */ 2272ddeab2a6SMatthew G. Knepley 1, 0, 4, 7, /* left */ 2273e6ccafaeSMatthew G Knepley }; 2274e6ccafaeSMatthew G Knepley 2275e6ccafaeSMatthew G Knepley faceSize = faceSizeHex; 2276e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 2277e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 2278e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2279e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 2280e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2281e6ccafaeSMatthew G Knepley 2282e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 2283e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 2284e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 2285e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 2286e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 2287e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 2288e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 2289e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2290e6ccafaeSMatthew G Knepley break; 2291e6ccafaeSMatthew G Knepley } 2292e6ccafaeSMatthew G Knepley } 2293e6ccafaeSMatthew G Knepley } 2294e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2295e6ccafaeSMatthew G Knepley break; 2296e6ccafaeSMatthew G Knepley } 2297e6ccafaeSMatthew G Knepley } 2298e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2299e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2300e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2301e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 2302e6ccafaeSMatthew G Knepley /* Quadratic tet */ 2303e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 2304e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 2305e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 2306e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2307e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 2308e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2309e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 2310e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 2311e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 2312e6ccafaeSMatthew G Knepley }; 2313e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 2314e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2315e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 2316e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 2317e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 2318e6ccafaeSMatthew G Knepley }; 2319e6ccafaeSMatthew G Knepley 2320e6ccafaeSMatthew G Knepley faceSize = faceSizeTet; 2321e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 2322e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 2323e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 2324e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 2325e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2326e6ccafaeSMatthew G Knepley 2327e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 2328e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 2329e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 2330e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 2331e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 2332e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 2333e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 2334e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2335e6ccafaeSMatthew G Knepley break; 2336e6ccafaeSMatthew G Knepley } 2337e6ccafaeSMatthew G Knepley } 2338e6ccafaeSMatthew G Knepley } 2339e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2340e6ccafaeSMatthew G Knepley break; 2341e6ccafaeSMatthew G Knepley } 2342e6ccafaeSMatthew G Knepley } 2343e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 2344e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2345e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2346e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 2347e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 2348e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2349e6ccafaeSMatthew G Knepley pointing up at the second. 2350e6ccafaeSMatthew G Knepley 2351e6ccafaeSMatthew G Knepley 7---6 2352e6ccafaeSMatthew G Knepley /| /| 2353e6ccafaeSMatthew G Knepley 4---5 | 2354e6ccafaeSMatthew G Knepley | 3-|-2 2355e6ccafaeSMatthew G Knepley |/ |/ 2356e6ccafaeSMatthew G Knepley 0---1 2357e6ccafaeSMatthew G Knepley 2358e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2359e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 2360e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 2361e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2362e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 2363e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 2364e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2365e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 2366e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 2367e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 2368e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 2369e6ccafaeSMatthew G Knepley }; 2370e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 2371e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 2372e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2373e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 2374e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 2375e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 2376e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 2377e6ccafaeSMatthew G Knepley }; 2378e6ccafaeSMatthew G Knepley 2379e6ccafaeSMatthew G Knepley faceSize = faceSizeQuadHex; 2380e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 2381e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 2382e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2383e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 2384e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2385e6ccafaeSMatthew G Knepley 2386e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 2387e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 2388e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 2389e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 2390e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 2391e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 2392e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 2393e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2394e6ccafaeSMatthew G Knepley break; 2395e6ccafaeSMatthew G Knepley } 2396e6ccafaeSMatthew G Knepley } 2397e6ccafaeSMatthew G Knepley } 2398e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2399e6ccafaeSMatthew G Knepley break; 2400e6ccafaeSMatthew G Knepley } 2401e6ccafaeSMatthew G Knepley } 2402e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2403e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2404e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2405e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 2406e6ccafaeSMatthew G Knepley if (!posOrient) { 2407e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 2408e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 2409e6ccafaeSMatthew G Knepley } else { 2410e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 2411e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 2412e6ccafaeSMatthew G Knepley } 2413e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 2414e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2415e6ccafaeSMatthew G Knepley } 2416e6ccafaeSMatthew G Knepley 2417e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2418e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace" 2419e6ccafaeSMatthew G Knepley /* 2420e6ccafaeSMatthew G Knepley Given a cell and a face, as a set of vertices, 2421e6ccafaeSMatthew G Knepley return the oriented face, as a set of vertices, in faceVertices 2422e6ccafaeSMatthew G Knepley The orientation is such that the face normal points out of the cell 2423e6ccafaeSMatthew G Knepley */ 2424e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2425e6ccafaeSMatthew G Knepley { 24260298fd71SBarry Smith const PetscInt *cone = NULL; 2427e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 2428e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 2429e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2430e6ccafaeSMatthew G Knepley 2431e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2432e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 2433e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 2434e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 2435e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2436e6ccafaeSMatthew G Knepley 2437e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 2438e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 2439e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 2440e6ccafaeSMatthew G Knepley } 2441e6ccafaeSMatthew G Knepley } 2442e6ccafaeSMatthew G Knepley if (found) { 2443e6ccafaeSMatthew G Knepley indices[v2] = v; 2444e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 2445e6ccafaeSMatthew G Knepley ++v2; 2446e6ccafaeSMatthew G Knepley } else { 2447e6ccafaeSMatthew G Knepley oppositeVertex = v; 2448e6ccafaeSMatthew G Knepley } 2449e6ccafaeSMatthew G Knepley } 2450e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 2451e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2452e6ccafaeSMatthew G Knepley } 2453e6ccafaeSMatthew G Knepley 2454e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2455cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal" 2456e6ccafaeSMatthew G Knepley /* 2457cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 2458e6ccafaeSMatthew G Knepley 2459e6ccafaeSMatthew G Knepley Not collective 2460e6ccafaeSMatthew G Knepley 2461e6ccafaeSMatthew G Knepley Input Parameters: 2462e6ccafaeSMatthew G Knepley + dm - The DMPlex 2463e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 2464e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 2465e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 2466e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 2467e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 2468e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 2469e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 2470e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 2471e6ccafaeSMatthew G Knepley 2472e6ccafaeSMatthew G Knepley Output Parameters: 2473e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 2474e6ccafaeSMatthew G Knepley 2475e6ccafaeSMatthew G Knepley Level: developer 2476e6ccafaeSMatthew G Knepley */ 2477cd0c2139SMatthew 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) 2478e6ccafaeSMatthew G Knepley { 247982f516ccSBarry Smith MPI_Comm comm; 2480e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 2481e6ccafaeSMatthew G Knepley const PetscInt *faces; 2482e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 2483e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2484e6ccafaeSMatthew G Knepley 2485e6ccafaeSMatthew G Knepley PetscFunctionBegin; 248682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2487e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 2488e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 2489e6ccafaeSMatthew G Knepley #if 0 2490e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 2491e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2492e6ccafaeSMatthew G Knepley #else 2493e6ccafaeSMatthew G Knepley { 2494e6ccafaeSMatthew G Knepley PetscInt f; 2495e6ccafaeSMatthew G Knepley 2496e6ccafaeSMatthew G Knepley numFaces = 0; 2497e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2498e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 2499e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 2500e6ccafaeSMatthew G Knepley 2501e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 2502e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 2503e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 2504e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 2505e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 2506e6ccafaeSMatthew G Knepley PetscInt v; 2507e6ccafaeSMatthew G Knepley 2508e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2509e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 2510e6ccafaeSMatthew G Knepley } 2511e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 2512e6ccafaeSMatthew G Knepley } 2513e6ccafaeSMatthew G Knepley if (d == dof) { 2514e6ccafaeSMatthew G Knepley numFaces = 1; 2515e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 2516e6ccafaeSMatthew G Knepley } 2517e6ccafaeSMatthew G Knepley } 2518e6ccafaeSMatthew G Knepley } 2519e6ccafaeSMatthew G Knepley #endif 2520e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 2521e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 2522e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 2523766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 2524e6ccafaeSMatthew G Knepley } else { 2525e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 2526e6ccafaeSMatthew G Knepley PetscBool posOriented; 2527e6ccafaeSMatthew G Knepley 2528e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2529e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 2530e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 2531e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 2532e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 2533e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 2534e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2535e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 2536e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 2537e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 2538e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 2539e6ccafaeSMatthew G Knepley break; 2540e6ccafaeSMatthew G Knepley } 2541e6ccafaeSMatthew G Knepley } 2542e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 2543e6ccafaeSMatthew G Knepley } 2544e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 2545e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 2546e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2547e6ccafaeSMatthew G Knepley ++(*newFacePoint); 2548e6ccafaeSMatthew G Knepley } 2549ef07cca7SMatthew G. Knepley #if 0 2550e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2551ef07cca7SMatthew G. Knepley #else 2552ef07cca7SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2553ef07cca7SMatthew G. Knepley #endif 2554e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2555e6ccafaeSMatthew G Knepley } 2556e6ccafaeSMatthew G Knepley 2557e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2558e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated" 255953156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2560e6ccafaeSMatthew G Knepley { 256182f516ccSBarry Smith MPI_Comm comm; 256253156dfcSMatthew G. Knepley DMLabel subpointMap; 2563efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 2564efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 2565efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 2566fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 2567efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 2568e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2569e6ccafaeSMatthew G Knepley 2570e6ccafaeSMatthew G Knepley PetscFunctionBegin; 257182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2572efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2573efa14ee0SMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2574efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2575efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 257653156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);} 2577efa14ee0SMatthew G Knepley /* Setup chart */ 2578efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2579efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2580efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2581efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2582e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2583e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 2584efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 2585e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 2586efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2587efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2588efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 2589efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2590e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2591e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2592e6ccafaeSMatthew G Knepley } 2593e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2594e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2595e6ccafaeSMatthew G Knepley } 2596e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2597e6ccafaeSMatthew G Knepley /* Create face cones */ 2598efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 25990298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2600efa14ee0SMatthew G Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2601e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2602e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 2603efa14ee0SMatthew G Knepley const PetscInt subcell = c; 26040298fd71SBarry Smith PetscInt *closure = NULL; 2605efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 2606e6ccafaeSMatthew G Knepley 2607e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2608efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2609efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 2610e6ccafaeSMatthew G Knepley PetscInt subVertex; 2611e6ccafaeSMatthew G Knepley 2612efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 2613efa14ee0SMatthew G Knepley ++numCorners; 2614efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 2615efa14ee0SMatthew G Knepley if (subVertex >= 0) { 2616efa14ee0SMatthew G Knepley closure[faceSize] = point; 261765560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 2618e6ccafaeSMatthew G Knepley ++faceSize; 2619e6ccafaeSMatthew G Knepley } 2620e6ccafaeSMatthew G Knepley } 2621e6ccafaeSMatthew G Knepley } 2622efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 2623efa14ee0SMatthew G Knepley if (faceSize == nFV) { 2624cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 2625e6ccafaeSMatthew G Knepley } 262665560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2627e6ccafaeSMatthew G Knepley } 2628efa14ee0SMatthew G Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2629e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2630e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2631e6ccafaeSMatthew G Knepley /* Build coordinates */ 2632efa14ee0SMatthew G Knepley { 2633efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 2634efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 2635efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 2636285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2637efa14ee0SMatthew G Knepley 263869d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2639e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 264069d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2641285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2642285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2643285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2644efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2645efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2646efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2647efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2648efa14ee0SMatthew G Knepley PetscInt dof; 2649efa14ee0SMatthew G Knepley 2650efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2651efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2652285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2653e6ccafaeSMatthew G Knepley } 2654e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2655e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2656e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2657e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 26582eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2659830e53efSMatthew G. Knepley if (coordSize) { 2660e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2661e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2662efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2663efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2664efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2665efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2666e6ccafaeSMatthew G Knepley 2667e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2668e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2669efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2670efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2671efa14ee0SMatthew 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); 2672e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2673e6ccafaeSMatthew G Knepley } 2674e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2675e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 26763b399e24SMatthew G. Knepley } 2677e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2678e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2679e6ccafaeSMatthew G Knepley } 2680efa14ee0SMatthew G Knepley /* Cleanup */ 2681efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2682efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2683efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2684efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2685e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2686e6ccafaeSMatthew G Knepley } 2687e6ccafaeSMatthew G Knepley 2688e6ccafaeSMatthew G Knepley #undef __FUNCT__ 26893982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal" 26903982b651SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 26913982b651SMatthew G. Knepley { 26923982b651SMatthew G. Knepley PetscInt subPoint; 26933982b651SMatthew G. Knepley PetscErrorCode ierr; 26943982b651SMatthew G. Knepley 26953982b651SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 26963982b651SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 26973982b651SMatthew G. Knepley } 26983982b651SMatthew G. Knepley 26993982b651SMatthew G. Knepley #undef __FUNCT__ 27003982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateSubmeshGeneric_Interpolated" 27013982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmeshGeneric_Interpolated(DM dm, DMLabel label, PetscInt value, PetscBool isCohesive, DM subdm) 2702e6ccafaeSMatthew G Knepley { 270382f516ccSBarry Smith MPI_Comm comm; 270453156dfcSMatthew G. Knepley DMLabel subpointMap; 2705efa14ee0SMatthew G Knepley IS *subpointIS; 2706efa14ee0SMatthew G Knepley const PetscInt **subpoints; 27073982b651SMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *orntNew; 2708efa14ee0SMatthew G Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2709e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2710e6ccafaeSMatthew G Knepley 2711e6ccafaeSMatthew G Knepley PetscFunctionBegin; 271282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2713efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2714e6ccafaeSMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2715efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2716efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 27173982b651SMatthew G. Knepley if (isCohesive) {ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);} 27183982b651SMatthew G. Knepley else {ierr = DMPlexMarkSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);} 2719efa14ee0SMatthew G Knepley /* Setup chart */ 2720c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2721dcca6d9dSJed Brown ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr); 2722e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2723e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2724e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 2725e6ccafaeSMatthew G Knepley } 2726e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2727e6ccafaeSMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2728e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2729e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 2730e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2731e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2732e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2733e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2734e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 27350ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2736e6ccafaeSMatthew G Knepley } 2737e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2738e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2739e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2740e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2741e6ccafaeSMatthew G Knepley const PetscInt *cone; 2742e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 2743e6ccafaeSMatthew G Knepley 2744e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2745e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2746e6ccafaeSMatthew G Knepley if (d == dim) { 2747e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2748e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2749e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2750e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 2751e6ccafaeSMatthew G Knepley } 2752e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2753e6ccafaeSMatthew G Knepley } 2754e6ccafaeSMatthew G Knepley } 2755e6ccafaeSMatthew G Knepley } 2756e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2757e6ccafaeSMatthew G Knepley /* Set cones */ 27580298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 27593982b651SMatthew G. Knepley ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&orntNew);CHKERRQ(ierr); 2760e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2761e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2762e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2763e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 27640e49e2e2SMatthew G. Knepley const PetscInt *cone, *ornt; 2765e6ccafaeSMatthew G Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2766e6ccafaeSMatthew G Knepley 2767e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2768e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2769e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 27700e49e2e2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2771e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2772e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 277301a2673eSMatthew G. Knepley if (subc >= 0) { 277401a2673eSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 27753982b651SMatthew G. Knepley orntNew[coneSizeNew] = ornt[c]; 277601a2673eSMatthew G. Knepley ++coneSizeNew; 277701a2673eSMatthew G. Knepley } 2778e6ccafaeSMatthew G Knepley } 2779e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2780e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 27813982b651SMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, orntNew);CHKERRQ(ierr); 2782e6ccafaeSMatthew G Knepley } 2783e6ccafaeSMatthew G Knepley } 27843982b651SMatthew G. Knepley ierr = PetscFree2(coneNew,orntNew);CHKERRQ(ierr); 2785e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2786e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2787e6ccafaeSMatthew G Knepley /* Build coordinates */ 2788e6ccafaeSMatthew G Knepley { 2789e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 2790e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 2791e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 2792285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2793e6ccafaeSMatthew G Knepley 279469d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2795e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 279669d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2797285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2798285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2799285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2800e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2801e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2802e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2803e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2804e6ccafaeSMatthew G Knepley PetscInt dof; 2805e6ccafaeSMatthew G Knepley 2806e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2807e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2808285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2809e6ccafaeSMatthew G Knepley } 2810e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2811e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2812e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2813e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 28142eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2815e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2816e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2817e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2818e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2819e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2820e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2821e6ccafaeSMatthew G Knepley 2822e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2823e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2824e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2825e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2826e6ccafaeSMatthew 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); 2827efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2828e6ccafaeSMatthew G Knepley } 2829e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2830e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2831e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2832e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2833e6ccafaeSMatthew G Knepley } 28343982b651SMatthew G. Knepley /* Build SF: We need this complexity because subpoints might not be selected on the owning process */ 28353982b651SMatthew G. Knepley { 28363982b651SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 28373982b651SMatthew G. Knepley IS subpIS; 28383982b651SMatthew G. Knepley const PetscSFNode *remotePoints; 28393982b651SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 28403982b651SMatthew G. Knepley const PetscInt *localPoints, *subpoints; 28413982b651SMatthew G. Knepley PetscInt *slocalPoints; 28423982b651SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubpoints = 0, numSubroots, numSubleaves = 0, l, sl, ll, pStart, pEnd, p; 28433982b651SMatthew G. Knepley PetscMPIInt rank; 28443982b651SMatthew G. Knepley 28453982b651SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 28463982b651SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 28473982b651SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 28483982b651SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 28493982b651SMatthew G. Knepley ierr = DMPlexGetChart(subdm, NULL, &numSubroots);CHKERRQ(ierr); 28503982b651SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpIS);CHKERRQ(ierr); 28513982b651SMatthew G. Knepley if (subpIS) { 28523982b651SMatthew G. Knepley ierr = ISGetIndices(subpIS, &subpoints);CHKERRQ(ierr); 28533982b651SMatthew G. Knepley ierr = ISGetLocalSize(subpIS, &numSubpoints);CHKERRQ(ierr); 28543982b651SMatthew G. Knepley } 28553982b651SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 28563982b651SMatthew G. Knepley if (numRoots >= 0) { 28573982b651SMatthew G. Knepley ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 28583982b651SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 28593982b651SMatthew G. Knepley newLocalPoints[p].rank = -2; 28603982b651SMatthew G. Knepley newLocalPoints[p].index = -2; 28613982b651SMatthew G. Knepley } 28623982b651SMatthew G. Knepley /* Set subleaves */ 28633982b651SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 28643982b651SMatthew G. Knepley const PetscInt point = localPoints[l]; 28653982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 28663982b651SMatthew G. Knepley 28673982b651SMatthew G. Knepley if (subpoint < 0) continue; 28683982b651SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 28693982b651SMatthew G. Knepley newLocalPoints[point-pStart].index = subpoint; 28703982b651SMatthew G. Knepley ++numSubleaves; 28713982b651SMatthew G. Knepley } 28723982b651SMatthew G. Knepley /* Must put in owned subpoints */ 28733982b651SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 28743982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(p, 0, numSubpoints, subpoints); 28753982b651SMatthew G. Knepley 28763982b651SMatthew G. Knepley if (subpoint < 0) { 28773982b651SMatthew G. Knepley newOwners[p-pStart].rank = -3; 28783982b651SMatthew G. Knepley newOwners[p-pStart].index = -3; 28793982b651SMatthew G. Knepley } else { 28803982b651SMatthew G. Knepley newOwners[p-pStart].rank = rank; 28813982b651SMatthew G. Knepley newOwners[p-pStart].index = subpoint; 28823982b651SMatthew G. Knepley } 28833982b651SMatthew G. Knepley } 28843982b651SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 28853982b651SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 28863982b651SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 28873982b651SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 28883982b651SMatthew G. Knepley ierr = PetscMalloc1(numSubleaves, &slocalPoints);CHKERRQ(ierr); 28893982b651SMatthew G. Knepley ierr = PetscMalloc1(numSubleaves, &sremotePoints);CHKERRQ(ierr); 28903982b651SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 28913982b651SMatthew G. Knepley const PetscInt point = localPoints[l]; 28923982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 28933982b651SMatthew G. Knepley 28943982b651SMatthew G. Knepley if (subpoint < 0) continue; 28953982b651SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 28963982b651SMatthew G. Knepley slocalPoints[sl] = subpoint; 28973982b651SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 28983982b651SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 28993982b651SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 29003982b651SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 29013982b651SMatthew G. Knepley ++sl; 29023982b651SMatthew G. Knepley } 29033982b651SMatthew G. Knepley if (sl + ll != numSubleaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubleaves); 29043982b651SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 29053982b651SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubroots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 29063982b651SMatthew G. Knepley } 29073982b651SMatthew G. Knepley if (subpIS) { 29083982b651SMatthew G. Knepley ierr = ISRestoreIndices(subpIS, &subpoints);CHKERRQ(ierr); 29093982b651SMatthew G. Knepley ierr = ISDestroy(&subpIS);CHKERRQ(ierr); 29103982b651SMatthew G. Knepley } 29113982b651SMatthew G. Knepley } 2912efa14ee0SMatthew G Knepley /* Cleanup */ 2913e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 29140ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2915e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2916e6ccafaeSMatthew G Knepley } 2917efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2918e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2919e6ccafaeSMatthew G Knepley } 2920e6ccafaeSMatthew G Knepley 2921e6ccafaeSMatthew G Knepley #undef __FUNCT__ 29223982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated" 29233982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 29243982b651SMatthew G. Knepley { 29253982b651SMatthew G. Knepley PetscErrorCode ierr; 29263982b651SMatthew G. Knepley 29273982b651SMatthew G. Knepley PetscFunctionBegin; 29283982b651SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, vertexLabel, value, PETSC_FALSE, subdm);CHKERRQ(ierr); 29293982b651SMatthew G. Knepley PetscFunctionReturn(0); 29303982b651SMatthew G. Knepley } 29313982b651SMatthew G. Knepley 29323982b651SMatthew G. Knepley #undef __FUNCT__ 2933e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh" 2934d0fa310fSMatthew G. Knepley /*@ 2935e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 2936e6ccafaeSMatthew G Knepley 2937e6ccafaeSMatthew G Knepley Input Parameters: 2938e6ccafaeSMatthew G Knepley + dm - The original mesh 2939830e53efSMatthew G. Knepley . vertexLabel - The DMLabel marking vertices contained in the surface 2940830e53efSMatthew G. Knepley - value - The label value to use 2941e6ccafaeSMatthew G Knepley 2942e6ccafaeSMatthew G Knepley Output Parameter: 2943e6ccafaeSMatthew G Knepley . subdm - The surface mesh 2944e6ccafaeSMatthew G Knepley 2945e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2946e6ccafaeSMatthew G Knepley 2947e6ccafaeSMatthew G Knepley Level: developer 2948e6ccafaeSMatthew G Knepley 2949e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue() 2950830e53efSMatthew G. Knepley @*/ 295153156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm) 2952e6ccafaeSMatthew G Knepley { 2953e6ccafaeSMatthew G Knepley PetscInt dim, depth; 2954e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2955e6ccafaeSMatthew G Knepley 2956e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2957e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2958766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 2959c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2960e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 296182f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2962e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2963c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2964e6ccafaeSMatthew G Knepley if (depth == dim) { 2965830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2966e6ccafaeSMatthew G Knepley } else { 2967830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2968e6ccafaeSMatthew G Knepley } 2969e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2970e6ccafaeSMatthew G Knepley } 2971e6ccafaeSMatthew G Knepley 2972e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2973766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated" 297427c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 2975766ab985SMatthew G. Knepley { 2976766ab985SMatthew G. Knepley MPI_Comm comm; 2977766ab985SMatthew G. Knepley DMLabel subpointMap; 2978766ab985SMatthew G. Knepley IS subvertexIS; 2979766ab985SMatthew G. Knepley const PetscInt *subVertices; 2980fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 2981766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 298287feddfdSMatthew G. Knepley PetscInt cMax, c, f; 2983766ab985SMatthew G. Knepley PetscErrorCode ierr; 2984766ab985SMatthew G. Knepley 2985766ab985SMatthew G. Knepley PetscFunctionBegin; 2986766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 2987766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2988766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2989766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2990766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 299127c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 2992766ab985SMatthew G. Knepley /* Setup chart */ 2993766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2994766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2995766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2996766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2997766ab985SMatthew G. Knepley /* Set cone sizes */ 2998766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 2999766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 3000766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 3001766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 3002766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 3003766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 3004766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 3005766ab985SMatthew G. Knepley } 3006766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 3007766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 3008766ab985SMatthew G. Knepley } 3009766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 3010766ab985SMatthew G. Knepley /* Create face cones */ 3011766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 301287feddfdSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 3013766ab985SMatthew G. Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 3014766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 3015766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 3016766ab985SMatthew G. Knepley const PetscInt subcell = c; 301787feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 301887feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 3019766ab985SMatthew G. Knepley 302087feddfdSMatthew G. Knepley if (cell < cMax) continue; 302187feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 302287feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 302387feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 302487feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 302587feddfdSMatthew G. Knepley } 302687feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 302787feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 302887feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 302927234c99SMatthew G. Knepley /* Not true in parallel 303027234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 303187feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 303287feddfdSMatthew G. Knepley PetscInt negsubcell; 3033766ab985SMatthew G. Knepley 303487feddfdSMatthew G. Knepley if (cells[p] >= cMax) continue; 303587feddfdSMatthew G. Knepley /* I know this is a crap search */ 303687feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 303787feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 3038766ab985SMatthew G. Knepley } 303987feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 304087feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 3041766ab985SMatthew G. Knepley } 304287feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 304387feddfdSMatthew G. Knepley ++newFacePoint; 3044766ab985SMatthew G. Knepley } 3045766ab985SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 3046766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 3047766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 3048766ab985SMatthew G. Knepley /* Build coordinates */ 3049766ab985SMatthew G. Knepley { 3050766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 3051766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 3052766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 3053285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 3054766ab985SMatthew G. Knepley 305569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3056766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 305769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 3058285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 3059285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 3060285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 3061766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 3062766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 3063766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 3064766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 3065766ab985SMatthew G. Knepley PetscInt dof; 3066766ab985SMatthew G. Knepley 3067766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3068766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 3069285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 3070766ab985SMatthew G. Knepley } 3071766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 3072766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 3073766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 3074766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 30752eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 3076766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 3077766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3078766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 3079766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 3080766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 3081766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 3082766ab985SMatthew G. Knepley 3083766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3084766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 3085766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 3086766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 3087766ab985SMatthew 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); 3088766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 3089766ab985SMatthew G. Knepley } 3090766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3091766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3092766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 3093766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 3094766ab985SMatthew G. Knepley } 3095aca35d17SMatthew G. Knepley /* Build SF */ 3096aca35d17SMatthew G. Knepley CHKMEMQ; 3097aca35d17SMatthew G. Knepley { 3098aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 3099aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 3100bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 3101aca35d17SMatthew G. Knepley const PetscInt *localPoints; 3102bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 310349c26ae4SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 3104bdcf2095SMatthew G. Knepley PetscMPIInt rank; 3105aca35d17SMatthew G. Knepley 3106bdcf2095SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 3107aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 3108aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 3109aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3110aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3111aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 3112aca35d17SMatthew G. Knepley if (numRoots >= 0) { 3113aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 3114dcca6d9dSJed Brown ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 3115bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 3116bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 3117bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 3118bdcf2095SMatthew G. Knepley } 31199e0823b2SMatthew G. Knepley /* Set subleaves */ 3120aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 3121aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 3122bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 3123aca35d17SMatthew G. Knepley 3124aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 3125bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 3126bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 3127bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 3128bdcf2095SMatthew G. Knepley ++numSubLeaves; 3129aca35d17SMatthew G. Knepley } 31309e0823b2SMatthew G. Knepley /* Must put in owned subpoints */ 31319e0823b2SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 31329e0823b2SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 31339e0823b2SMatthew G. Knepley 31349e0823b2SMatthew G. Knepley if (subPoint < 0) { 31359e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = -3; 31369e0823b2SMatthew G. Knepley newOwners[p-pStart].index = -3; 31379e0823b2SMatthew G. Knepley } else { 31389e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = rank; 31399e0823b2SMatthew G. Knepley newOwners[p-pStart].index = subPoint; 31409e0823b2SMatthew G. Knepley } 3141bdcf2095SMatthew G. Knepley } 3142bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3143bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3144bdcf2095SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3145bdcf2095SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3146785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &slocalPoints);CHKERRQ(ierr); 3147785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &sremotePoints);CHKERRQ(ierr); 314849c26ae4SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 3149bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 3150bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 3151aca35d17SMatthew G. Knepley 3152aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 315349c26ae4SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 3154aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 3155bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 3156bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 3157bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 3158bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 3159aca35d17SMatthew G. Knepley ++sl; 3160aca35d17SMatthew G. Knepley } 3161bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 316249c26ae4SMatthew G. Knepley if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 316349c26ae4SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 3164aca35d17SMatthew G. Knepley } 3165aca35d17SMatthew G. Knepley } 3166aca35d17SMatthew G. Knepley CHKMEMQ; 3167766ab985SMatthew G. Knepley /* Cleanup */ 3168766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 3169766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 3170766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 3171766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3172766ab985SMatthew G. Knepley } 3173766ab985SMatthew G. Knepley 3174766ab985SMatthew G. Knepley #undef __FUNCT__ 3175766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated" 31763982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DM subdm) 3177766ab985SMatthew G. Knepley { 31783982b651SMatthew G. Knepley DMLabel label = NULL; 3179766ab985SMatthew G. Knepley PetscErrorCode ierr; 3180766ab985SMatthew G. Knepley 3181766ab985SMatthew G. Knepley PetscFunctionBegin; 31823982b651SMatthew G. Knepley if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 31833982b651SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, label, value, PETSC_TRUE, subdm);CHKERRQ(ierr); 3184766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3185766ab985SMatthew G. Knepley } 3186766ab985SMatthew G. Knepley 3187766ab985SMatthew G. Knepley #undef __FUNCT__ 3188766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh" 3189766ab985SMatthew G. Knepley /* 319027c04023SMatthew 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. 3191766ab985SMatthew G. Knepley 3192766ab985SMatthew G. Knepley Input Parameters: 3193766ab985SMatthew G. Knepley + dm - The original mesh 319427c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 31957afc1a8bSJed Brown . label - A label name, or NULL 319627c04023SMatthew G. Knepley - value - A label value 3197766ab985SMatthew G. Knepley 3198766ab985SMatthew G. Knepley Output Parameter: 3199766ab985SMatthew G. Knepley . subdm - The surface mesh 3200766ab985SMatthew G. Knepley 3201766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3202766ab985SMatthew G. Knepley 3203766ab985SMatthew G. Knepley Level: developer 3204766ab985SMatthew G. Knepley 3205766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 3206766ab985SMatthew G. Knepley */ 320727c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 3208766ab985SMatthew G. Knepley { 3209766ab985SMatthew G. Knepley PetscInt dim, depth; 3210766ab985SMatthew G. Knepley PetscErrorCode ierr; 3211766ab985SMatthew G. Knepley 3212766ab985SMatthew G. Knepley PetscFunctionBegin; 3213766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 321427c04023SMatthew G. Knepley PetscValidPointer(subdm, 5); 3215c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3216766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3217766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 3218766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3219c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr); 3220766ab985SMatthew G. Knepley if (depth == dim) { 3221b3154360SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr); 3222766ab985SMatthew G. Knepley } else { 322327c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 3224e6ccafaeSMatthew G Knepley } 3225e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3226e6ccafaeSMatthew G Knepley } 3227e6ccafaeSMatthew G Knepley 3228e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3229e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap" 323064beef6dSMatthew G. Knepley /*@ 323164beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 323264beef6dSMatthew G. Knepley 323364beef6dSMatthew G. Knepley Input Parameter: 323464beef6dSMatthew G. Knepley . dm - The submesh DM 323564beef6dSMatthew G. Knepley 323664beef6dSMatthew G. Knepley Output Parameter: 323764beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 323864beef6dSMatthew G. Knepley 323964beef6dSMatthew G. Knepley Level: developer 324064beef6dSMatthew G. Knepley 324164beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 324264beef6dSMatthew G. Knepley @*/ 3243e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 3244e6ccafaeSMatthew G Knepley { 3245e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3246e6ccafaeSMatthew G Knepley 3247e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3248e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3249e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 3250e6ccafaeSMatthew G Knepley *subpointMap = mesh->subpointMap; 3251e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3252e6ccafaeSMatthew G Knepley } 3253e6ccafaeSMatthew G Knepley 3254e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3255e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap" 3256e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */ 3257e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 3258e6ccafaeSMatthew G Knepley { 3259e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 3260285d324eSMatthew G. Knepley DMLabel tmp; 3261e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3262e6ccafaeSMatthew G Knepley 3263e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3264e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3265285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 3266e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 3267285d324eSMatthew G. Knepley ++mesh->subpointMap->refct; 3268285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 3269e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3270e6ccafaeSMatthew G Knepley } 3271e6ccafaeSMatthew G Knepley 3272e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3273e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS" 327464beef6dSMatthew G. Knepley /*@ 3275e6ccafaeSMatthew G Knepley DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 3276e6ccafaeSMatthew G Knepley 3277e6ccafaeSMatthew G Knepley Input Parameter: 3278e6ccafaeSMatthew G Knepley . dm - The submesh DM 3279e6ccafaeSMatthew G Knepley 3280e6ccafaeSMatthew G Knepley Output Parameter: 32810298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 3282e6ccafaeSMatthew G Knepley 32833982b651SMatthew G. Knepley Note: This IS is guaranteed to be sorted by the construction of the submesh 328464beef6dSMatthew G. Knepley 328564beef6dSMatthew G. Knepley Level: developer 328664beef6dSMatthew G. Knepley 328764beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 328864beef6dSMatthew G. Knepley @*/ 3289e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 3290e6ccafaeSMatthew G Knepley { 329182f516ccSBarry Smith MPI_Comm comm; 3292e6ccafaeSMatthew G Knepley DMLabel subpointMap; 3293e6ccafaeSMatthew G Knepley IS is; 3294e6ccafaeSMatthew G Knepley const PetscInt *opoints; 3295e6ccafaeSMatthew G Knepley PetscInt *points, *depths; 3296e6ccafaeSMatthew G Knepley PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 3297e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3298e6ccafaeSMatthew G Knepley 3299e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3300e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3301e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 330282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 33030298fd71SBarry Smith *subpointIS = NULL; 3304e6ccafaeSMatthew G Knepley ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 3305e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3306fed694aaSMatthew G. Knepley if (subpointMap && depth >= 0) { 3307e6ccafaeSMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3308e6ccafaeSMatthew G Knepley if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 3309e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3310e6ccafaeSMatthew G Knepley depths[0] = depth; 3311e6ccafaeSMatthew G Knepley depths[1] = 0; 3312e6ccafaeSMatthew G Knepley for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 3313785e854fSJed Brown ierr = PetscMalloc1(pEnd, &points);CHKERRQ(ierr); 3314e6ccafaeSMatthew G Knepley for(d = 0, off = 0; d <= depth; ++d) { 3315e6ccafaeSMatthew G Knepley const PetscInt dep = depths[d]; 3316e6ccafaeSMatthew G Knepley 3317e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 3318e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 33191e21b6fdSMatthew G Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 3320e6ccafaeSMatthew 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); 3321e6ccafaeSMatthew G Knepley } else { 33221e21b6fdSMatthew G Knepley if (!n) { 33231e21b6fdSMatthew G Knepley if (d == 0) { 33241e21b6fdSMatthew G Knepley /* Missing cells */ 33251e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 33261e21b6fdSMatthew G Knepley } else { 33271e21b6fdSMatthew G Knepley /* Missing faces */ 33281e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 33291e21b6fdSMatthew G Knepley } 33301e21b6fdSMatthew G Knepley } 3331e6ccafaeSMatthew G Knepley } 3332e6ccafaeSMatthew G Knepley if (n) { 3333e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 3334e6ccafaeSMatthew G Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 3335e6ccafaeSMatthew G Knepley for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 3336e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 3337e6ccafaeSMatthew G Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 3338e6ccafaeSMatthew G Knepley } 3339e6ccafaeSMatthew G Knepley } 3340e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3341e6ccafaeSMatthew G Knepley if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 3342fed694aaSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 3343e6ccafaeSMatthew G Knepley } 3344e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3345e6ccafaeSMatthew G Knepley } 3346