1af0996ceSBarry Smith #include <petsc/private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 2c58f1c22SToby Isaac #include <petsc/private/dmlabelimpl.h> /*I "petscdmlabel.h" I*/ 30c312b8eSJed Brown #include <petscsf.h> 4e6ccafaeSMatthew G Knepley 5e6ccafaeSMatthew G Knepley #undef __FUNCT__ 630560a7bSMatthew G. Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces_Internal" 730560a7bSMatthew G. Knepley PetscErrorCode DMPlexMarkBoundaryFaces_Internal(DM dm, PetscInt cellHeight, DMLabel label) 830560a7bSMatthew G. Knepley { 930560a7bSMatthew G. Knepley PetscInt fStart, fEnd, f; 1030560a7bSMatthew G. Knepley PetscErrorCode ierr; 1130560a7bSMatthew G. Knepley 1230560a7bSMatthew G. Knepley PetscFunctionBegin; 1330560a7bSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1430560a7bSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight+1, &fStart, &fEnd);CHKERRQ(ierr); 1530560a7bSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 1630560a7bSMatthew G. Knepley PetscInt supportSize; 1730560a7bSMatthew G. Knepley 1830560a7bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 1930560a7bSMatthew G. Knepley if (supportSize == 1) {ierr = DMLabelSetValue(label, f, 1);CHKERRQ(ierr);} 2030560a7bSMatthew G. Knepley } 2130560a7bSMatthew G. Knepley PetscFunctionReturn(0); 2230560a7bSMatthew G. Knepley } 2330560a7bSMatthew G. Knepley 2430560a7bSMatthew G. Knepley #undef __FUNCT__ 25cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces" 26cd0c2139SMatthew G Knepley /*@ 27cd0c2139SMatthew G Knepley DMPlexMarkBoundaryFaces - Mark all faces on the boundary 28cd0c2139SMatthew G Knepley 29cd0c2139SMatthew G Knepley Not Collective 30cd0c2139SMatthew G Knepley 31cd0c2139SMatthew G Knepley Input Parameter: 32cd0c2139SMatthew G Knepley . dm - The original DM 33cd0c2139SMatthew G Knepley 34cd0c2139SMatthew G Knepley Output Parameter: 35cd0c2139SMatthew G Knepley . label - The DMLabel marking boundary faces with value 1 36cd0c2139SMatthew G Knepley 37cd0c2139SMatthew G Knepley Level: developer 38cd0c2139SMatthew G Knepley 39c58f1c22SToby Isaac .seealso: DMLabelCreate(), DMCreateLabel() 4009f723d9SJed Brown @*/ 41cd0c2139SMatthew G Knepley PetscErrorCode DMPlexMarkBoundaryFaces(DM dm, DMLabel label) 42cd0c2139SMatthew G Knepley { 43cd0c2139SMatthew G Knepley PetscErrorCode ierr; 44cd0c2139SMatthew G Knepley 45cd0c2139SMatthew G Knepley PetscFunctionBegin; 4674e03af4SMatthew G. Knepley ierr = DMPlexMarkBoundaryFaces_Internal(dm, 0, label);CHKERRQ(ierr); 47cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 48cd0c2139SMatthew G Knepley } 49cd0c2139SMatthew G Knepley 50cd0c2139SMatthew G Knepley #undef __FUNCT__ 51b0bf5782SToby Isaac #define __FUNCT__ "DMPlexLabelComplete_Internal" 52b0bf5782SToby Isaac PetscErrorCode DMPlexLabelComplete_Internal(DM dm, DMLabel label, PetscBool completeCells) 53b0bf5782SToby Isaac { 54b0bf5782SToby Isaac IS valueIS; 55b0bf5782SToby Isaac const PetscInt *values; 56b0bf5782SToby Isaac PetscInt numValues, v, cStart, cEnd; 57b0bf5782SToby Isaac PetscErrorCode ierr; 58b0bf5782SToby Isaac 59b0bf5782SToby Isaac PetscFunctionBegin; 60b0bf5782SToby Isaac ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 61b0bf5782SToby Isaac ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 62b0bf5782SToby Isaac ierr = DMPlexGetHeightStratum(dm,0,&cStart,&cEnd);CHKERRQ(ierr); 63b0bf5782SToby Isaac ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 64b0bf5782SToby Isaac for (v = 0; v < numValues; ++v) { 65b0bf5782SToby Isaac IS pointIS; 66b0bf5782SToby Isaac const PetscInt *points; 67b0bf5782SToby Isaac PetscInt numPoints, p; 68b0bf5782SToby Isaac 69b0bf5782SToby Isaac ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 70b0bf5782SToby Isaac ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 71b0bf5782SToby Isaac ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 72b0bf5782SToby Isaac for (p = 0; p < numPoints; ++p) { 73b0bf5782SToby Isaac PetscInt q = points[p]; 74b0bf5782SToby Isaac PetscInt *closure = NULL; 75b0bf5782SToby Isaac PetscInt closureSize, c; 76b0bf5782SToby Isaac 77b0bf5782SToby Isaac if (cStart <= q && q < cEnd && !completeCells) { /* skip cells */ 78b0bf5782SToby Isaac continue; 79b0bf5782SToby Isaac } 80b0bf5782SToby Isaac ierr = DMPlexGetTransitiveClosure(dm, q, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 81b0bf5782SToby Isaac for (c = 0; c < closureSize*2; c += 2) { 82b0bf5782SToby Isaac ierr = DMLabelSetValue(label, closure[c], values[v]);CHKERRQ(ierr); 83b0bf5782SToby Isaac } 84b0bf5782SToby Isaac ierr = DMPlexRestoreTransitiveClosure(dm, q, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 85b0bf5782SToby Isaac } 86b0bf5782SToby Isaac ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 87b0bf5782SToby Isaac ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 88b0bf5782SToby Isaac } 89b0bf5782SToby Isaac ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 90b0bf5782SToby Isaac ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 91b0bf5782SToby Isaac PetscFunctionReturn(0); 92b0bf5782SToby Isaac } 93b0bf5782SToby Isaac 94b0bf5782SToby Isaac #undef __FUNCT__ 952be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelComplete" 962be2b188SMatthew G Knepley /*@ 972be2b188SMatthew G Knepley DMPlexLabelComplete - Starting with a label marking points on a surface, we add the transitive closure to the surface 982be2b188SMatthew G Knepley 992be2b188SMatthew G Knepley Input Parameters: 1002be2b188SMatthew G Knepley + dm - The DM 1012be2b188SMatthew G Knepley - label - A DMLabel marking the surface points 1022be2b188SMatthew G Knepley 1032be2b188SMatthew G Knepley Output Parameter: 1042be2b188SMatthew G Knepley . label - A DMLabel marking all surface points in the transitive closure 1052be2b188SMatthew G Knepley 1062be2b188SMatthew G Knepley Level: developer 1072be2b188SMatthew G Knepley 1082be2b188SMatthew G Knepley .seealso: DMPlexLabelCohesiveComplete() 1092be2b188SMatthew G Knepley @*/ 1102be2b188SMatthew G Knepley PetscErrorCode DMPlexLabelComplete(DM dm, DMLabel label) 1112be2b188SMatthew G Knepley { 1122be2b188SMatthew G Knepley PetscErrorCode ierr; 1132be2b188SMatthew G Knepley 1142be2b188SMatthew G Knepley PetscFunctionBegin; 115b0bf5782SToby Isaac ierr = DMPlexLabelComplete_Internal(dm, label, PETSC_TRUE);CHKERRQ(ierr); 1162be2b188SMatthew G Knepley PetscFunctionReturn(0); 1172be2b188SMatthew G Knepley } 1182be2b188SMatthew G Knepley 1192be2b188SMatthew G Knepley #undef __FUNCT__ 1206cf0e42fSMatthew G. Knepley #define __FUNCT__ "DMPlexLabelAddCells" 1216cf0e42fSMatthew G. Knepley /*@ 1226cf0e42fSMatthew G. Knepley DMPlexLabelAddCells - Starting with a label marking faces on a surface, we add a cell for each face 1236cf0e42fSMatthew G. Knepley 1246cf0e42fSMatthew G. Knepley Input Parameters: 1256cf0e42fSMatthew G. Knepley + dm - The DM 1266cf0e42fSMatthew G. Knepley - label - A DMLabel marking the surface points 1276cf0e42fSMatthew G. Knepley 1286cf0e42fSMatthew G. Knepley Output Parameter: 1296cf0e42fSMatthew G. Knepley . label - A DMLabel incorporating cells 1306cf0e42fSMatthew G. Knepley 1316cf0e42fSMatthew G. Knepley Level: developer 1326cf0e42fSMatthew G. Knepley 1336cf0e42fSMatthew G. Knepley Note: The cells allow FEM boundary conditions to be applied using the cell geometry 1346cf0e42fSMatthew G. Knepley 1356cf0e42fSMatthew G. Knepley .seealso: DMPlexLabelComplete(), DMPlexLabelCohesiveComplete() 1366cf0e42fSMatthew G. Knepley @*/ 1376cf0e42fSMatthew G. Knepley PetscErrorCode DMPlexLabelAddCells(DM dm, DMLabel label) 1386cf0e42fSMatthew G. Knepley { 1396cf0e42fSMatthew G. Knepley IS valueIS; 1406cf0e42fSMatthew G. Knepley const PetscInt *values; 14122eabd52SMatthew G. Knepley PetscInt numValues, v, cStart, cEnd, cEndInterior; 1426cf0e42fSMatthew G. Knepley PetscErrorCode ierr; 1436cf0e42fSMatthew G. Knepley 1446cf0e42fSMatthew G. Knepley PetscFunctionBegin; 1456cf0e42fSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 14622eabd52SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cEndInterior, NULL, NULL, NULL);CHKERRQ(ierr); 14722eabd52SMatthew G. Knepley cEnd = cEndInterior < 0 ? cEnd : cEndInterior; 1486cf0e42fSMatthew G. Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 1496cf0e42fSMatthew G. Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 1506cf0e42fSMatthew G. Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 1516cf0e42fSMatthew G. Knepley for (v = 0; v < numValues; ++v) { 1526cf0e42fSMatthew G. Knepley IS pointIS; 1536cf0e42fSMatthew G. Knepley const PetscInt *points; 1546cf0e42fSMatthew G. Knepley PetscInt numPoints, p; 1556cf0e42fSMatthew G. Knepley 1566cf0e42fSMatthew G. Knepley ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 1576cf0e42fSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 1586cf0e42fSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 1596cf0e42fSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1606cf0e42fSMatthew G. Knepley PetscInt *closure = NULL; 16122eabd52SMatthew G. Knepley PetscInt closureSize, point, cl; 1626cf0e42fSMatthew G. Knepley 1636cf0e42fSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 16422eabd52SMatthew G. Knepley for (cl = closureSize-1; cl > 0; --cl) { 16522eabd52SMatthew G. Knepley point = closure[cl*2]; 16622eabd52SMatthew G. Knepley if ((point >= cStart) && (point < cEnd)) {ierr = DMLabelSetValue(label, point, values[v]);CHKERRQ(ierr); break;} 16722eabd52SMatthew G. Knepley } 1686cf0e42fSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 1696cf0e42fSMatthew G. Knepley } 1706cf0e42fSMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 1716cf0e42fSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 1726cf0e42fSMatthew G. Knepley } 1736cf0e42fSMatthew G. Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1746cf0e42fSMatthew G. Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1756cf0e42fSMatthew G. Knepley PetscFunctionReturn(0); 1766cf0e42fSMatthew G. Knepley } 1776cf0e42fSMatthew G. Knepley 1786cf0e42fSMatthew G. Knepley #undef __FUNCT__ 179f402d5e4SToby Isaac #define __FUNCT__ "DMPlexLabelClearCells" 180f402d5e4SToby Isaac /*@ 181f402d5e4SToby Isaac DMPlexLabelClearCells - Remove cells from a label 182f402d5e4SToby Isaac 183f402d5e4SToby Isaac Input Parameters: 184f402d5e4SToby Isaac + dm - The DM 185f402d5e4SToby Isaac - label - A DMLabel marking surface points and their adjacent cells 186f402d5e4SToby Isaac 187f402d5e4SToby Isaac Output Parameter: 188f402d5e4SToby Isaac . label - A DMLabel without cells 189f402d5e4SToby Isaac 190f402d5e4SToby Isaac Level: developer 191f402d5e4SToby Isaac 192f402d5e4SToby Isaac Note: This undoes DMPlexLabelAddCells() 193f402d5e4SToby Isaac 194f402d5e4SToby Isaac .seealso: DMPlexLabelComplete(), DMPlexLabelCohesiveComplete(), DMPlexLabelAddCells() 195f402d5e4SToby Isaac @*/ 196f402d5e4SToby Isaac PetscErrorCode DMPlexLabelClearCells(DM dm, DMLabel label) 197f402d5e4SToby Isaac { 198f402d5e4SToby Isaac IS valueIS; 199f402d5e4SToby Isaac const PetscInt *values; 200f402d5e4SToby Isaac PetscInt numValues, v, cStart, cEnd, cEndInterior; 201f402d5e4SToby Isaac PetscErrorCode ierr; 202f402d5e4SToby Isaac 203f402d5e4SToby Isaac PetscFunctionBegin; 204f402d5e4SToby Isaac ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 205f402d5e4SToby Isaac ierr = DMPlexGetHybridBounds(dm, &cEndInterior, NULL, NULL, NULL);CHKERRQ(ierr); 206f402d5e4SToby Isaac cEnd = cEndInterior < 0 ? cEnd : cEndInterior; 207f402d5e4SToby Isaac ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 208f402d5e4SToby Isaac ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 209f402d5e4SToby Isaac ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 210f402d5e4SToby Isaac for (v = 0; v < numValues; ++v) { 211f402d5e4SToby Isaac IS pointIS; 212f402d5e4SToby Isaac const PetscInt *points; 213f402d5e4SToby Isaac PetscInt numPoints, p; 214f402d5e4SToby Isaac 215f402d5e4SToby Isaac ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 216f402d5e4SToby Isaac ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 217f402d5e4SToby Isaac ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 218f402d5e4SToby Isaac for (p = 0; p < numPoints; ++p) { 219f402d5e4SToby Isaac PetscInt point = points[p]; 220f402d5e4SToby Isaac 221f402d5e4SToby Isaac if (point >= cStart && point < cEnd) { 222f402d5e4SToby Isaac ierr = DMLabelClearValue(label,point,values[v]);CHKERRQ(ierr); 223f402d5e4SToby Isaac } 224f402d5e4SToby Isaac } 225f402d5e4SToby Isaac ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 226f402d5e4SToby Isaac ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 227f402d5e4SToby Isaac } 228f402d5e4SToby Isaac ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 229f402d5e4SToby Isaac ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 230f402d5e4SToby Isaac PetscFunctionReturn(0); 231f402d5e4SToby Isaac } 232f402d5e4SToby Isaac 233f402d5e4SToby Isaac #undef __FUNCT__ 2342582d50cSToby Isaac #define __FUNCT__ "DMPlexShiftPointSetUp_Internal" 23559eef20bSToby Isaac /* take (oldEnd, added) pairs, ordered by height and convert them to (oldstart, newstart) pairs, ordered by ascending 23659eef20bSToby Isaac * index (skipping first, which is (0,0)) */ 2372582d50cSToby Isaac PETSC_STATIC_INLINE PetscErrorCode DMPlexShiftPointSetUp_Internal(PetscInt depth, PetscInt depthShift[]) 238cd0c2139SMatthew G Knepley { 2392582d50cSToby Isaac PetscInt d, off = 0; 2402582d50cSToby Isaac 2412582d50cSToby Isaac PetscFunctionBegin; 24259eef20bSToby Isaac /* sort by (oldend): yes this is an O(n^2) sort, we expect depth <= 3 */ 2430974a383SToby Isaac for (d = 0; d < depth; d++) { 2442582d50cSToby Isaac PetscInt firstd = d; 2450974a383SToby Isaac PetscInt firstStart = depthShift[2*d]; 2462582d50cSToby Isaac PetscInt e; 2472582d50cSToby Isaac 2482582d50cSToby Isaac for (e = d+1; e <= depth; e++) { 2492582d50cSToby Isaac if (depthShift[2*e] < firstStart) { 2502582d50cSToby Isaac firstd = e; 2512582d50cSToby Isaac firstStart = depthShift[2*d]; 2522582d50cSToby Isaac } 2532582d50cSToby Isaac } 2542582d50cSToby Isaac if (firstd != d) { 2552582d50cSToby Isaac PetscInt swap[2]; 2562582d50cSToby Isaac 2572582d50cSToby Isaac e = firstd; 2582582d50cSToby Isaac swap[0] = depthShift[2*d]; 2592582d50cSToby Isaac swap[1] = depthShift[2*d+1]; 2602582d50cSToby Isaac depthShift[2*d] = depthShift[2*e]; 2612582d50cSToby Isaac depthShift[2*d+1] = depthShift[2*e+1]; 2622582d50cSToby Isaac depthShift[2*e] = swap[0]; 2632582d50cSToby Isaac depthShift[2*e+1] = swap[1]; 2642582d50cSToby Isaac } 2652582d50cSToby Isaac } 2662582d50cSToby Isaac /* convert (oldstart, added) to (oldstart, newstart) */ 2670974a383SToby Isaac for (d = 0; d <= depth; d++) { 2682582d50cSToby Isaac off += depthShift[2*d+1]; 26959eef20bSToby Isaac depthShift[2*d+1] = depthShift[2*d] + off; 2702582d50cSToby Isaac } 2712582d50cSToby Isaac PetscFunctionReturn(0); 2722582d50cSToby Isaac } 2732582d50cSToby Isaac 2742582d50cSToby Isaac #undef __FUNCT__ 2752582d50cSToby Isaac #define __FUNCT__ "DMPlexShiftPoint_Internal" 2762582d50cSToby Isaac /* depthShift is a list of (old, new) pairs */ 2772582d50cSToby Isaac PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthShift[]) 2782582d50cSToby Isaac { 2792582d50cSToby Isaac PetscInt d; 2802582d50cSToby Isaac PetscInt newOff = 0; 2812582d50cSToby Isaac 2822582d50cSToby Isaac for (d = 0; d <= depth; d++) { 2832582d50cSToby Isaac if (p < depthShift[2*d]) return p + newOff; 2842582d50cSToby Isaac else newOff = depthShift[2*d+1] - depthShift[2*d]; 2852582d50cSToby Isaac } 2860974a383SToby Isaac return p + newOff; 2872582d50cSToby Isaac } 2882582d50cSToby Isaac 2892582d50cSToby Isaac #undef __FUNCT__ 2902582d50cSToby Isaac #define __FUNCT__ "DMPlexShiftPointInverse_Internal" 2912582d50cSToby Isaac /* depthShift is a list of (old, new) pairs */ 2922582d50cSToby Isaac PETSC_STATIC_INLINE PetscInt DMPlexShiftPointInverse_Internal(PetscInt p, PetscInt depth, PetscInt depthShift[]) 2932582d50cSToby Isaac { 2942582d50cSToby Isaac PetscInt d; 2952582d50cSToby Isaac PetscInt newOff = 0; 2962582d50cSToby Isaac 2972582d50cSToby Isaac for (d = 0; d <= depth; d++) { 2982582d50cSToby Isaac if (p < depthShift[2*d+1]) return p + newOff; 2992582d50cSToby Isaac else newOff = depthShift[2*d] - depthShift[2*d+1]; 3002582d50cSToby Isaac } 3010974a383SToby Isaac return p + newOff; 302cd0c2139SMatthew G Knepley } 303cd0c2139SMatthew G Knepley 304cd0c2139SMatthew G Knepley #undef __FUNCT__ 305cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSizes_Internal" 306cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew) 307cd0c2139SMatthew G Knepley { 308cd0c2139SMatthew G Knepley PetscInt depth = 0, d, pStart, pEnd, p; 309cd0c2139SMatthew G Knepley PetscErrorCode ierr; 310cd0c2139SMatthew G Knepley 311cd0c2139SMatthew G Knepley PetscFunctionBegin; 312cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 313cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 314cd0c2139SMatthew G Knepley /* Step 1: Expand chart */ 315cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3160974a383SToby Isaac pEnd = DMPlexShiftPoint_Internal(pEnd,depth,depthShift); 317cd0c2139SMatthew G Knepley ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr); 318cd0c2139SMatthew G Knepley /* Step 2: Set cone and support sizes */ 319cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 320cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 321cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 3222582d50cSToby Isaac PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthShift); 323cd0c2139SMatthew G Knepley PetscInt size; 324cd0c2139SMatthew G Knepley 325cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 326cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr); 327cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 328cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr); 329cd0c2139SMatthew G Knepley } 330cd0c2139SMatthew G Knepley } 331cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 332cd0c2139SMatthew G Knepley } 333cd0c2139SMatthew G Knepley 334cd0c2139SMatthew G Knepley #undef __FUNCT__ 335cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoints_Internal" 336cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew) 337cd0c2139SMatthew G Knepley { 3382582d50cSToby Isaac PetscInt *newpoints; 3392582d50cSToby Isaac PetscInt depth = 0, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, pStart, pEnd, p; 340cd0c2139SMatthew G Knepley PetscErrorCode ierr; 341cd0c2139SMatthew G Knepley 342cd0c2139SMatthew G Knepley PetscFunctionBegin; 343cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 344cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 345cd0c2139SMatthew G Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 346dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dmNew, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 3472582d50cSToby Isaac ierr = PetscMalloc1(PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),&newpoints);CHKERRQ(ierr); 348cd0c2139SMatthew G Knepley /* Step 5: Set cones and supports */ 349cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 350cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 351cd0c2139SMatthew G Knepley const PetscInt *points = NULL, *orientations = NULL; 3522582d50cSToby Isaac PetscInt size,sizeNew, i, newp = DMPlexShiftPoint_Internal(p, depth, depthShift); 353cd0c2139SMatthew G Knepley 354cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 355cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr); 356cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr); 357cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 3582582d50cSToby Isaac newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthShift); 359cd0c2139SMatthew G Knepley } 360cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr); 361cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr); 362cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 363dcbb62e8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmNew, newp, &sizeNew);CHKERRQ(ierr); 364cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr); 365cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 3662582d50cSToby Isaac newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthShift); 367cd0c2139SMatthew G Knepley } 368dcbb62e8SMatthew G. Knepley for (i = size; i < sizeNew; ++i) newpoints[i] = 0; 369cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr); 370cd0c2139SMatthew G Knepley } 3712582d50cSToby Isaac ierr = PetscFree(newpoints);CHKERRQ(ierr); 372cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 373cd0c2139SMatthew G Knepley } 374cd0c2139SMatthew G Knepley 375cd0c2139SMatthew G Knepley #undef __FUNCT__ 376cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftCoordinates_Internal" 377cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew) 378cd0c2139SMatthew G Knepley { 379cd0c2139SMatthew G Knepley PetscSection coordSection, newCoordSection; 380cd0c2139SMatthew G Knepley Vec coordinates, newCoordinates; 381cd0c2139SMatthew G Knepley PetscScalar *coords, *newCoords; 382f2b8cce1SMatthew G. Knepley PetscInt coordSize, sStart, sEnd; 383f2b8cce1SMatthew G. Knepley PetscInt dim, depth = 0, cStart, cEnd, cStartNew, cEndNew, c, vStart, vEnd, vStartNew, vEndNew, v; 384f2b8cce1SMatthew G. Knepley PetscBool hasCells; 385cd0c2139SMatthew G Knepley PetscErrorCode ierr; 386cd0c2139SMatthew G Knepley 387cd0c2139SMatthew G Knepley PetscFunctionBegin; 388f2b8cce1SMatthew G. Knepley ierr = DMGetCoordinateDim(dm, &dim);CHKERRQ(ierr); 389cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 390cd0c2139SMatthew G Knepley /* Step 8: Convert coordinates */ 391cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 392f2b8cce1SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 393cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr); 394f2b8cce1SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dmNew, 0, &cStartNew, &cEndNew);CHKERRQ(ierr); 39569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 396cd0c2139SMatthew G Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr); 397cd0c2139SMatthew G Knepley ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr); 398cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr); 399f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetChart(coordSection, &sStart, &sEnd);CHKERRQ(ierr); 400f2b8cce1SMatthew G. Knepley hasCells = sStart == cStart ? PETSC_TRUE : PETSC_FALSE; 401f2b8cce1SMatthew G. Knepley ierr = PetscSectionSetChart(newCoordSection, hasCells ? cStartNew : vStartNew, vEndNew);CHKERRQ(ierr); 402f2b8cce1SMatthew G. Knepley if (hasCells) { 403f2b8cce1SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 404f2b8cce1SMatthew G. Knepley PetscInt cNew = DMPlexShiftPoint_Internal(c, depth, depthShift), dof; 405f2b8cce1SMatthew G. Knepley 406f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, c, &dof);CHKERRQ(ierr); 407f2b8cce1SMatthew G. Knepley ierr = PetscSectionSetDof(newCoordSection, cNew, dof);CHKERRQ(ierr); 408f2b8cce1SMatthew G. Knepley ierr = PetscSectionSetFieldDof(newCoordSection, cNew, 0, dof);CHKERRQ(ierr); 409f2b8cce1SMatthew G. Knepley } 410f2b8cce1SMatthew G. Knepley } 411cd0c2139SMatthew G Knepley for (v = vStartNew; v < vEndNew; ++v) { 412cd0c2139SMatthew G Knepley ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr); 413cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr); 414cd0c2139SMatthew G Knepley } 415cd0c2139SMatthew G Knepley ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr); 41646e270d4SMatthew G. Knepley ierr = DMSetCoordinateSection(dmNew, PETSC_DETERMINE, newCoordSection);CHKERRQ(ierr); 417cd0c2139SMatthew G Knepley ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr); 418cd0c2139SMatthew G Knepley ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr); 419cd0c2139SMatthew G Knepley ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr); 420cd0c2139SMatthew G Knepley ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 4214e90ef8eSMatthew G. Knepley ierr = VecSetBlockSize(newCoordinates, dim);CHKERRQ(ierr); 4222eb5907fSJed Brown ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr); 423cd0c2139SMatthew G Knepley ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr); 424cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 425cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 426cd0c2139SMatthew G Knepley ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr); 427f2b8cce1SMatthew G. Knepley if (hasCells) { 428f2b8cce1SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 429f2b8cce1SMatthew G. Knepley PetscInt cNew = DMPlexShiftPoint_Internal(c, depth, depthShift), dof, off, noff, d; 430f2b8cce1SMatthew G. Knepley 431f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, c, &dof);CHKERRQ(ierr); 432f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, c, &off);CHKERRQ(ierr); 433f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetOffset(newCoordSection, cNew, &noff);CHKERRQ(ierr); 434f2b8cce1SMatthew G. Knepley for (d = 0; d < dof; ++d) newCoords[noff+d] = coords[off+d]; 435f2b8cce1SMatthew G. Knepley } 436f2b8cce1SMatthew G. Knepley } 437cd0c2139SMatthew G Knepley for (v = vStart; v < vEnd; ++v) { 438cd0c2139SMatthew G Knepley PetscInt dof, off, noff, d; 439cd0c2139SMatthew G Knepley 440cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 441cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 4422582d50cSToby Isaac ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthShift), &noff);CHKERRQ(ierr); 443f2b8cce1SMatthew G. Knepley for (d = 0; d < dof; ++d) newCoords[noff+d] = coords[off+d]; 444cd0c2139SMatthew G Knepley } 445cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 446cd0c2139SMatthew G Knepley ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr); 447cd0c2139SMatthew G Knepley ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 448cd0c2139SMatthew G Knepley ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr); 449cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 450cd0c2139SMatthew G Knepley } 451cd0c2139SMatthew G Knepley 452cd0c2139SMatthew G Knepley #undef __FUNCT__ 453cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal" 454cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew) 455cd0c2139SMatthew G Knepley { 4562582d50cSToby Isaac PetscInt depth = 0; 457cd0c2139SMatthew G Knepley PetscSF sfPoint, sfPointNew; 458cd0c2139SMatthew G Knepley const PetscSFNode *remotePoints; 459cd0c2139SMatthew G Knepley PetscSFNode *gremotePoints; 460cd0c2139SMatthew G Knepley const PetscInt *localPoints; 461cd0c2139SMatthew G Knepley PetscInt *glocalPoints, *newLocation, *newRemoteLocation; 462cd0c2139SMatthew G Knepley PetscInt numRoots, numLeaves, l, pStart, pEnd, totShift = 0; 463cd0c2139SMatthew G Knepley PetscErrorCode ierr; 464cd0c2139SMatthew G Knepley 465cd0c2139SMatthew G Knepley PetscFunctionBegin; 466cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 467cd0c2139SMatthew G Knepley /* Step 9: Convert pointSF */ 468cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 469cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr); 470cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 471cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 4726e21efdcSToby Isaac totShift = DMPlexShiftPoint_Internal(pEnd,depth,depthShift) - pEnd; 473cd0c2139SMatthew G Knepley if (numRoots >= 0) { 474dcca6d9dSJed Brown ierr = PetscMalloc2(numRoots,&newLocation,pEnd-pStart,&newRemoteLocation);CHKERRQ(ierr); 4752582d50cSToby Isaac for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthShift); 476cd0c2139SMatthew G Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 477cd0c2139SMatthew G Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 478785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &glocalPoints);CHKERRQ(ierr); 479785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &gremotePoints);CHKERRQ(ierr); 480cd0c2139SMatthew G Knepley for (l = 0; l < numLeaves; ++l) { 4812582d50cSToby Isaac glocalPoints[l] = DMPlexShiftPoint_Internal(localPoints[l], depth, depthShift); 482cd0c2139SMatthew G Knepley gremotePoints[l].rank = remotePoints[l].rank; 483cd0c2139SMatthew G Knepley gremotePoints[l].index = newRemoteLocation[localPoints[l]]; 484cd0c2139SMatthew G Knepley } 485cd0c2139SMatthew G Knepley ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr); 486cd0c2139SMatthew G Knepley ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 487cd0c2139SMatthew G Knepley } 488cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 489cd0c2139SMatthew G Knepley } 490cd0c2139SMatthew G Knepley 491cd0c2139SMatthew G Knepley #undef __FUNCT__ 492cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal" 493cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew) 494cd0c2139SMatthew G Knepley { 495cd0c2139SMatthew G Knepley PetscSF sfPoint; 496cd0c2139SMatthew G Knepley DMLabel vtkLabel, ghostLabel; 497cd0c2139SMatthew G Knepley const PetscSFNode *leafRemote; 498cd0c2139SMatthew G Knepley const PetscInt *leafLocal; 4992582d50cSToby Isaac PetscInt depth = 0, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f; 500cd0c2139SMatthew G Knepley PetscMPIInt rank; 501cd0c2139SMatthew G Knepley PetscErrorCode ierr; 502cd0c2139SMatthew G Knepley 503cd0c2139SMatthew G Knepley PetscFunctionBegin; 504cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 505cd0c2139SMatthew G Knepley /* Step 10: Convert labels */ 506c58f1c22SToby Isaac ierr = DMGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 507cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 508cd0c2139SMatthew G Knepley DMLabel label, newlabel; 509cd0c2139SMatthew G Knepley const char *lname; 510cd0c2139SMatthew G Knepley PetscBool isDepth; 511cd0c2139SMatthew G Knepley IS valueIS; 512cd0c2139SMatthew G Knepley const PetscInt *values; 513cd0c2139SMatthew G Knepley PetscInt numValues, val; 514cd0c2139SMatthew G Knepley 515c58f1c22SToby Isaac ierr = DMGetLabelName(dm, l, &lname);CHKERRQ(ierr); 516cd0c2139SMatthew G Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 517cd0c2139SMatthew G Knepley if (isDepth) continue; 518c58f1c22SToby Isaac ierr = DMCreateLabel(dmNew, lname);CHKERRQ(ierr); 519c58f1c22SToby Isaac ierr = DMGetLabel(dm, lname, &label);CHKERRQ(ierr); 520c58f1c22SToby Isaac ierr = DMGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr); 52164a6a1a4SToby Isaac ierr = DMLabelGetDefaultValue(label,&val);CHKERRQ(ierr); 52264a6a1a4SToby Isaac ierr = DMLabelSetDefaultValue(newlabel,val);CHKERRQ(ierr); 523cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 524cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 525cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 526cd0c2139SMatthew G Knepley for (val = 0; val < numValues; ++val) { 527cd0c2139SMatthew G Knepley IS pointIS; 528cd0c2139SMatthew G Knepley const PetscInt *points; 529cd0c2139SMatthew G Knepley PetscInt numPoints, p; 530cd0c2139SMatthew G Knepley 531cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 532cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 533cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 534cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 5352582d50cSToby Isaac const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthShift); 536cd0c2139SMatthew G Knepley 537cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr); 538cd0c2139SMatthew G Knepley } 539cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 540cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 541cd0c2139SMatthew G Knepley } 542cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 543cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 544cd0c2139SMatthew G Knepley } 545cd0c2139SMatthew G Knepley /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */ 546cd0c2139SMatthew G Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 547cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 548cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 549cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr); 550c58f1c22SToby Isaac ierr = DMCreateLabel(dmNew, "vtk");CHKERRQ(ierr); 551c58f1c22SToby Isaac ierr = DMCreateLabel(dmNew, "ghost");CHKERRQ(ierr); 552c58f1c22SToby Isaac ierr = DMGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr); 553c58f1c22SToby Isaac ierr = DMGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr); 554cd0c2139SMatthew G Knepley for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { 555cd0c2139SMatthew G Knepley for (; c < leafLocal[l] && c < cEnd; ++c) { 556cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 557cd0c2139SMatthew G Knepley } 558cd0c2139SMatthew G Knepley if (leafLocal[l] >= cEnd) break; 559cd0c2139SMatthew G Knepley if (leafRemote[l].rank == rank) { 560cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 561cd0c2139SMatthew G Knepley } else { 562cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr); 563cd0c2139SMatthew G Knepley } 564cd0c2139SMatthew G Knepley } 565cd0c2139SMatthew G Knepley for (; c < cEnd; ++c) { 566cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 567cd0c2139SMatthew G Knepley } 568cd0c2139SMatthew G Knepley if (0) { 569cd0c2139SMatthew G Knepley ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 570cd0c2139SMatthew G Knepley } 571cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr); 572cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 573cd0c2139SMatthew G Knepley PetscInt numCells; 574cd0c2139SMatthew G Knepley 575cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr); 576cd0c2139SMatthew G Knepley if (numCells < 2) { 577cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr); 578cd0c2139SMatthew G Knepley } else { 579cd0c2139SMatthew G Knepley const PetscInt *cells = NULL; 580cd0c2139SMatthew G Knepley PetscInt vA, vB; 581cd0c2139SMatthew G Knepley 582cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr); 583cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr); 584cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr); 585cd0c2139SMatthew G Knepley if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);} 586cd0c2139SMatthew G Knepley } 587cd0c2139SMatthew G Knepley } 588cd0c2139SMatthew G Knepley if (0) { 589cd0c2139SMatthew G Knepley ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 590cd0c2139SMatthew G Knepley } 591cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 592cd0c2139SMatthew G Knepley } 593cd0c2139SMatthew G Knepley 594cd0c2139SMatthew G Knepley #undef __FUNCT__ 595ca04dac2SToby Isaac #define __FUNCT__ "DMPlexShiftTree_Internal" 596ca04dac2SToby Isaac static PetscErrorCode DMPlexShiftTree_Internal(DM dm, PetscInt depthShift[], DM dmNew) 597ca04dac2SToby Isaac { 598ca04dac2SToby Isaac DM refTree; 599ca04dac2SToby Isaac PetscSection pSec; 600ca04dac2SToby Isaac PetscInt *parents, *childIDs; 601ca04dac2SToby Isaac PetscErrorCode ierr; 602ca04dac2SToby Isaac 603ca04dac2SToby Isaac PetscFunctionBegin; 604ca04dac2SToby Isaac ierr = DMPlexGetReferenceTree(dm,&refTree);CHKERRQ(ierr); 605ca04dac2SToby Isaac ierr = DMPlexSetReferenceTree(dmNew,refTree);CHKERRQ(ierr); 606ca04dac2SToby Isaac ierr = DMPlexGetTree(dm,&pSec,&parents,&childIDs,NULL,NULL);CHKERRQ(ierr); 607ca04dac2SToby Isaac if (pSec) { 6082582d50cSToby Isaac PetscInt p, pStart, pEnd, *parentsShifted, pStartShifted, pEndShifted, depth; 609fb4630b5SToby Isaac PetscInt *childIDsShifted; 610ca04dac2SToby Isaac PetscSection pSecShifted; 611ca04dac2SToby Isaac 612ca04dac2SToby Isaac ierr = PetscSectionGetChart(pSec,&pStart,&pEnd);CHKERRQ(ierr); 613ca04dac2SToby Isaac ierr = DMPlexGetDepth(dm,&depth);CHKERRQ(ierr); 6142582d50cSToby Isaac pStartShifted = DMPlexShiftPoint_Internal(pStart,depth,depthShift); 6152582d50cSToby Isaac pEndShifted = DMPlexShiftPoint_Internal(pEnd,depth,depthShift); 616fb4630b5SToby Isaac ierr = PetscMalloc2(pEndShifted - pStartShifted,&parentsShifted,pEndShifted-pStartShifted,&childIDsShifted);CHKERRQ(ierr); 617ca04dac2SToby Isaac ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dmNew),&pSecShifted);CHKERRQ(ierr); 618ca04dac2SToby Isaac ierr = PetscSectionSetChart(pSecShifted,pStartShifted,pEndShifted);CHKERRQ(ierr); 619ca04dac2SToby Isaac for (p = pStartShifted; p < pEndShifted; p++) { 620fb4630b5SToby Isaac /* start off assuming no children */ 621fb4630b5SToby Isaac ierr = PetscSectionSetDof(pSecShifted,p,0);CHKERRQ(ierr); 622fb4630b5SToby Isaac } 623fb4630b5SToby Isaac for (p = pStart; p < pEnd; p++) { 624fb4630b5SToby Isaac PetscInt dof; 625fb4630b5SToby Isaac PetscInt pNew = DMPlexShiftPoint_Internal(p,depth,depthShift); 626ca04dac2SToby Isaac 627ca04dac2SToby Isaac ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr); 628fb4630b5SToby Isaac ierr = PetscSectionSetDof(pSecShifted,pNew,dof);CHKERRQ(ierr); 629ca04dac2SToby Isaac } 630ca04dac2SToby Isaac ierr = PetscSectionSetUp(pSecShifted);CHKERRQ(ierr); 631fb4630b5SToby Isaac for (p = pStart; p < pEnd; p++) { 632fb4630b5SToby Isaac PetscInt dof; 633fb4630b5SToby Isaac PetscInt pNew = DMPlexShiftPoint_Internal(p,depth,depthShift); 634fb4630b5SToby Isaac 635fb4630b5SToby Isaac ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr); 636fb4630b5SToby Isaac if (dof) { 637fb4630b5SToby Isaac PetscInt off, offNew; 638fb4630b5SToby Isaac 639fb4630b5SToby Isaac ierr = PetscSectionGetOffset(pSec,p,&off);CHKERRQ(ierr); 640fb4630b5SToby Isaac ierr = PetscSectionGetOffset(pSecShifted,pNew,&offNew);CHKERRQ(ierr); 641fb4630b5SToby Isaac parentsShifted[offNew] = DMPlexShiftPoint_Internal(parents[off],depth,depthShift); 642fb4630b5SToby Isaac childIDsShifted[offNew] = childIDs[off]; 643fb4630b5SToby Isaac } 644fb4630b5SToby Isaac } 645fb4630b5SToby Isaac ierr = DMPlexSetTree(dmNew,pSecShifted,parentsShifted,childIDsShifted);CHKERRQ(ierr); 646fb4630b5SToby Isaac ierr = PetscFree2(parentsShifted,childIDsShifted);CHKERRQ(ierr); 647e6885bbbSToby Isaac ierr = PetscSectionDestroy(&pSecShifted);CHKERRQ(ierr); 648ca04dac2SToby Isaac } 649ca04dac2SToby Isaac PetscFunctionReturn(0); 650ca04dac2SToby Isaac } 651ca04dac2SToby Isaac 652ca04dac2SToby Isaac #undef __FUNCT__ 653cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal" 654cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm) 655cd0c2139SMatthew G Knepley { 656da97024aSMatthew G. Knepley PetscSF sf; 657cd0c2139SMatthew G Knepley IS valueIS; 658da97024aSMatthew G. Knepley const PetscInt *values, *leaves; 659cd0c2139SMatthew G Knepley PetscInt *depthShift; 6602582d50cSToby Isaac PetscInt d, depth = 0, nleaves, loc, Ng, numFS, fs, fStart, fEnd, ghostCell, cEnd, c; 661cd0c2139SMatthew G Knepley PetscErrorCode ierr; 662cd0c2139SMatthew G Knepley 663cd0c2139SMatthew G Knepley PetscFunctionBegin; 664da97024aSMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 665da97024aSMatthew G. Knepley ierr = PetscSFGetGraph(sf, NULL, &nleaves, &leaves, NULL);CHKERRQ(ierr); 666da97024aSMatthew G. Knepley nleaves = PetscMax(0, nleaves); 66746c796b9SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 668cd0c2139SMatthew G Knepley /* Count ghost cells */ 669cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 670cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr); 671cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 6724a6cfa73SMatthew G. Knepley Ng = 0; 673cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 67446c796b9SMatthew G. Knepley IS faceIS; 67546c796b9SMatthew G. Knepley const PetscInt *faces; 67646c796b9SMatthew G. Knepley PetscInt numFaces, f, numBdFaces = 0; 677cd0c2139SMatthew G Knepley 67846c796b9SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 67946c796b9SMatthew G. Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 68046c796b9SMatthew G. Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 68146c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 682ca04dac2SToby Isaac PetscInt numChildren; 683ca04dac2SToby Isaac 684da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 685ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 686ca04dac2SToby Isaac /* non-local and ancestors points don't get to register ghosts */ 687ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 68846c796b9SMatthew G. Knepley if ((faces[f] >= fStart) && (faces[f] < fEnd)) ++numBdFaces; 68946c796b9SMatthew G. Knepley } 6904a6cfa73SMatthew G. Knepley Ng += numBdFaces; 69146c796b9SMatthew G. Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 692cd0c2139SMatthew G Knepley } 693cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 6942582d50cSToby Isaac ierr = PetscMalloc1(2*(depth+1), &depthShift);CHKERRQ(ierr); 6952582d50cSToby Isaac for (d = 0; d <= depth; d++) { 69659eef20bSToby Isaac PetscInt dEnd; 6972582d50cSToby Isaac 6980974a383SToby Isaac ierr = DMPlexGetDepthStratum(dm,d,NULL,&dEnd);CHKERRQ(ierr); 69959eef20bSToby Isaac depthShift[2*d] = dEnd; 7002582d50cSToby Isaac depthShift[2*d+1] = 0; 7012582d50cSToby Isaac } 7022582d50cSToby Isaac if (depth >= 0) depthShift[2*depth+1] = Ng; 7032582d50cSToby Isaac ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift);CHKERRQ(ierr); 704cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 705cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 706cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 7075acea1aeSMatthew G. Knepley ierr = DMPlexSetHybridBounds(gdm, cEnd, PETSC_DETERMINE, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 7084a6cfa73SMatthew G. Knepley for (c = cEnd; c < cEnd + Ng; ++c) { 709cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr); 710cd0c2139SMatthew G Knepley } 711cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 712cd0c2139SMatthew G Knepley IS faceIS; 713cd0c2139SMatthew G Knepley const PetscInt *faces; 714cd0c2139SMatthew G Knepley PetscInt numFaces, f; 715cd0c2139SMatthew G Knepley 716cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 717cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 718cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 719cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 720ca04dac2SToby Isaac PetscInt size, numChildren; 721cd0c2139SMatthew G Knepley 722da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 723ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 724ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 72546c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 726cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr); 727cd0c2139SMatthew 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); 7284a6cfa73SMatthew G. Knepley ierr = DMPlexSetSupportSize(gdm, faces[f] + Ng, 2);CHKERRQ(ierr); 729cd0c2139SMatthew G Knepley } 730cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 731cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 732cd0c2139SMatthew G Knepley } 733cd0c2139SMatthew G Knepley /* Step 4: Setup ghosted DM */ 734cd0c2139SMatthew G Knepley ierr = DMSetUp(gdm);CHKERRQ(ierr); 735cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 736cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 737cd0c2139SMatthew G Knepley ghostCell = cEnd; 738cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 739cd0c2139SMatthew G Knepley IS faceIS; 740cd0c2139SMatthew G Knepley const PetscInt *faces; 741cd0c2139SMatthew G Knepley PetscInt numFaces, f; 742cd0c2139SMatthew G Knepley 743cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 744cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 745cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 74646c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 747ca04dac2SToby Isaac PetscInt newFace = faces[f] + Ng, numChildren; 748cd0c2139SMatthew G Knepley 749da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 750ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 751ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 75246c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 753cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr); 754cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr); 75546c796b9SMatthew G. Knepley ++ghostCell; 756cd0c2139SMatthew G Knepley } 757cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 758cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 759cd0c2139SMatthew G Knepley } 760cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 761cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 762cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 763cd0c2139SMatthew G Knepley ierr = DMPlexStratify(gdm);CHKERRQ(ierr); 764cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 765cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 766cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 767ca04dac2SToby Isaac ierr = DMPlexShiftTree_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 768cd0c2139SMatthew G Knepley ierr = PetscFree(depthShift);CHKERRQ(ierr); 769966c7b3fSMatthew G. Knepley /* Step 7: Periodicity */ 770966c7b3fSMatthew G. Knepley if (dm->maxCell) { 771966c7b3fSMatthew G. Knepley const PetscReal *maxCell, *L; 7725dc8c3f7SMatthew G. Knepley const DMBoundaryType *bd; 7735dc8c3f7SMatthew G. Knepley ierr = DMGetPeriodicity(dm, &maxCell, &L, &bd);CHKERRQ(ierr); 7745dc8c3f7SMatthew G. Knepley ierr = DMSetPeriodicity(gdm, maxCell, L, bd);CHKERRQ(ierr); 775966c7b3fSMatthew G. Knepley } 7764a6cfa73SMatthew G. Knepley if (numGhostCells) *numGhostCells = Ng; 777cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 778cd0c2139SMatthew G Knepley } 779cd0c2139SMatthew G Knepley 780cd0c2139SMatthew G Knepley #undef __FUNCT__ 781cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells" 782cd0c2139SMatthew G Knepley /*@C 783cd0c2139SMatthew G Knepley DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face 784cd0c2139SMatthew G Knepley 785cd0c2139SMatthew G Knepley Collective on dm 786cd0c2139SMatthew G Knepley 787cd0c2139SMatthew G Knepley Input Parameters: 788cd0c2139SMatthew G Knepley + dm - The original DM 789cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL 790cd0c2139SMatthew G Knepley 791cd0c2139SMatthew G Knepley Output Parameters: 792cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM 793cd0c2139SMatthew G Knepley - dmGhosted - The new DM 794cd0c2139SMatthew G Knepley 795cd0c2139SMatthew G Knepley Note: If no label exists of that name, one will be created marking all boundary faces 796cd0c2139SMatthew G Knepley 797cd0c2139SMatthew G Knepley Level: developer 798cd0c2139SMatthew G Knepley 799cd0c2139SMatthew G Knepley .seealso: DMCreate() 80031266bc0SMatthew G. Knepley @*/ 801cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted) 802cd0c2139SMatthew G Knepley { 803cd0c2139SMatthew G Knepley DM gdm; 804cd0c2139SMatthew G Knepley DMLabel label; 805cd0c2139SMatthew G Knepley const char *name = labelName ? labelName : "Face Sets"; 806cd0c2139SMatthew G Knepley PetscInt dim; 807a42b08eeSMatthew G. Knepley PetscBool flag; 808cd0c2139SMatthew G Knepley PetscErrorCode ierr; 809cd0c2139SMatthew G Knepley 810cd0c2139SMatthew G Knepley PetscFunctionBegin; 811cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 8124a6cfa73SMatthew G. Knepley if (numGhostCells) PetscValidPointer(numGhostCells, 3); 813cd0c2139SMatthew G Knepley PetscValidPointer(dmGhosted, 4); 814cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr); 815cd0c2139SMatthew G Knepley ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr); 816c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 817c73cfb54SMatthew G. Knepley ierr = DMSetDimension(gdm, dim);CHKERRQ(ierr); 818a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseCone(dm, &flag);CHKERRQ(ierr); 819a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseCone(gdm, flag);CHKERRQ(ierr); 820a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseClosure(dm, &flag);CHKERRQ(ierr); 821a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseClosure(gdm, flag);CHKERRQ(ierr); 822c58f1c22SToby Isaac ierr = DMGetLabel(dm, name, &label);CHKERRQ(ierr); 823cd0c2139SMatthew G Knepley if (!label) { 824cd0c2139SMatthew G Knepley /* Get label for boundary faces */ 825c58f1c22SToby Isaac ierr = DMCreateLabel(dm, name);CHKERRQ(ierr); 826c58f1c22SToby Isaac ierr = DMGetLabel(dm, name, &label);CHKERRQ(ierr); 827cd0c2139SMatthew G Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 828cd0c2139SMatthew G Knepley } 829cd0c2139SMatthew G Knepley ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr); 830a6ba4734SToby Isaac ierr = DMCopyBoundary(dm, gdm);CHKERRQ(ierr); 831cd0c2139SMatthew G Knepley *dmGhosted = gdm; 832cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 833cd0c2139SMatthew G Knepley } 834cd0c2139SMatthew G Knepley 835cd0c2139SMatthew G Knepley #undef __FUNCT__ 836cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal" 837607ab7a9SMatthew G. Knepley /* 838faedd622SMatthew G. Knepley We are adding three kinds of points here: 839607ab7a9SMatthew G. Knepley Replicated: Copies of points which exist in the mesh, such as vertices identified across a fault 840faedd622SMatthew G. Knepley Non-replicated: Points which exist on the fault, but are not replicated 841607ab7a9SMatthew G. Knepley Hybrid: Entirely new points, such as cohesive cells 842a6ae58d1SMatthew G. Knepley 843a6ae58d1SMatthew G. Knepley When creating subsequent cohesive cells, we shift the old hybrid cells to the end of the numbering at 844a6ae58d1SMatthew G. Knepley each depth so that the new split/hybrid points can be inserted as a block. 845607ab7a9SMatthew G. Knepley */ 846cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm) 847cd0c2139SMatthew G Knepley { 848cd0c2139SMatthew G Knepley MPI_Comm comm; 849607ab7a9SMatthew G. Knepley IS valueIS; 850607ab7a9SMatthew G. Knepley PetscInt numSP = 0; /* The number of depths for which we have replicated points */ 851607ab7a9SMatthew G. Knepley const PetscInt *values; /* List of depths for which we have replicated points */ 85218c5995bSMatthew G. Knepley IS *splitIS; 85318c5995bSMatthew G. Knepley IS *unsplitIS; 854607ab7a9SMatthew G. Knepley PetscInt *numSplitPoints; /* The number of replicated points at each depth */ 85518c5995bSMatthew G. Knepley PetscInt *numUnsplitPoints; /* The number of non-replicated points at each depth which still give rise to hybrid points */ 85636dbac82SMatthew G. Knepley PetscInt *numHybridPoints; /* The number of new hybrid points at each depth */ 85736dbac82SMatthew G. Knepley PetscInt *numHybridPointsOld; /* The number of existing hybrid points at each depth */ 858607ab7a9SMatthew G. Knepley const PetscInt **splitPoints; /* Replicated points for each depth */ 85918c5995bSMatthew G. Knepley const PetscInt **unsplitPoints; /* Non-replicated points for each depth */ 860cd0c2139SMatthew G Knepley PetscSection coordSection; 861cd0c2139SMatthew G Knepley Vec coordinates; 862cd0c2139SMatthew G Knepley PetscScalar *coords; 863a6ae58d1SMatthew G. Knepley PetscInt *depthMax; /* The first hybrid point at each depth in the original mesh */ 864a6ae58d1SMatthew G. Knepley PetscInt *depthEnd; /* The point limit at each depth in the original mesh */ 865607ab7a9SMatthew G. Knepley PetscInt *depthShift; /* Number of replicated+hybrid points at each depth */ 866607ab7a9SMatthew G. Knepley PetscInt *pMaxNew; /* The first replicated point at each depth in the new mesh, hybrids come after this */ 867607ab7a9SMatthew G. Knepley PetscInt *coneNew, *coneONew, *supportNew; 86818c5995bSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v; 869cd0c2139SMatthew G Knepley PetscErrorCode ierr; 870cd0c2139SMatthew G Knepley 871cd0c2139SMatthew G Knepley PetscFunctionBegin; 872cd0c2139SMatthew G Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 873c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 874607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 875fd4b9f15SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 876cd0c2139SMatthew G Knepley /* Count split points and add cohesive cells */ 877607ab7a9SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 8782582d50cSToby Isaac ierr = PetscMalloc5(depth+1,&depthMax,depth+1,&depthEnd,2*(depth+1),&depthShift,depth+1,&pMaxNew,depth+1,&numHybridPointsOld);CHKERRQ(ierr); 879dcca6d9dSJed 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); 880a6ae58d1SMatthew 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); 881607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 882607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 883a6ae58d1SMatthew G. Knepley depthEnd[d] = pMaxNew[d]; 884a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 885607ab7a9SMatthew G. Knepley numSplitPoints[d] = 0; 88618c5995bSMatthew G. Knepley numUnsplitPoints[d] = 0; 887607ab7a9SMatthew G. Knepley numHybridPoints[d] = 0; 888a6ae58d1SMatthew G. Knepley numHybridPointsOld[d] = depthMax[d] < 0 ? 0 : depthEnd[d] - depthMax[d]; 889607ab7a9SMatthew G. Knepley splitPoints[d] = NULL; 89018c5995bSMatthew G. Knepley unsplitPoints[d] = NULL; 89118c5995bSMatthew G. Knepley splitIS[d] = NULL; 89218c5995bSMatthew G. Knepley unsplitIS[d] = NULL; 89359eef20bSToby Isaac /* we are shifting the existing hybrid points with the stratum behind them, so 89459eef20bSToby Isaac * the split comes at the end of the normal points, i.e., at depthMax[d] */ 89559eef20bSToby Isaac depthShift[2*d] = depthMax[d]; 89659eef20bSToby Isaac depthShift[2*d+1] = 0; 897607ab7a9SMatthew G. Knepley } 898cd0c2139SMatthew G Knepley if (label) { 899cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 900cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 901cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 902cd0c2139SMatthew G Knepley } 903cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 904cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 905cd0c2139SMatthew G Knepley 906cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 90718c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr); 90818c5995bSMatthew G. Knepley if (splitIS[dep]) { 90918c5995bSMatthew G. Knepley ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 91018c5995bSMatthew G. Knepley ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 91118c5995bSMatthew G. Knepley } 91218c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr); 91318c5995bSMatthew G. Knepley if (unsplitIS[dep]) { 91418c5995bSMatthew G. Knepley ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr); 91518c5995bSMatthew G. Knepley ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr); 916cd0c2139SMatthew G Knepley } 917cd0c2139SMatthew G Knepley } 918607ab7a9SMatthew G. Knepley /* Calculate number of hybrid points */ 91918c5995bSMatthew 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 */ 9202582d50cSToby Isaac for (d = 0; d <= depth; ++d) depthShift[2*d+1] = numSplitPoints[d] + numHybridPoints[d]; 921*3d3eaba7SBarry Smith ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift);CHKERRQ(ierr); 92259eef20bSToby Isaac /* the end of the points in this stratum that come before the new points: 92359eef20bSToby Isaac * shifting pMaxNew[d] gets the new start of the next stratum, then count back the old hybrid points and the newly 92459eef20bSToby Isaac * added points */ 9252582d50cSToby Isaac for (d = 0; d <= depth; ++d) pMaxNew[d] = DMPlexShiftPoint_Internal(pMaxNew[d],depth,depthShift) - (numHybridPointsOld[d] + numSplitPoints[d] + numHybridPoints[d]); 926cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 927cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 928cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 929cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 930cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 9312582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 9324c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 933cd0c2139SMatthew G Knepley const PetscInt *support; 9344c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, qf, qn, qp, e; 935cd0c2139SMatthew G Knepley 936cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 937cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 938cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 939cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 940cd0c2139SMatthew G Knepley if (dep == depth-1) { 9414c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 9424c367dbcSMatthew G. Knepley 943cd0c2139SMatthew G Knepley /* Add cohesive cells, they are prisms */ 9444c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr); 945cd0c2139SMatthew G Knepley } else if (dep == 0) { 9464c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 947cd0c2139SMatthew G Knepley 948cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 9494c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 950cd0c2139SMatthew G Knepley PetscInt val; 951cd0c2139SMatthew G Knepley 952cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 9534c367dbcSMatthew G. Knepley if (val == 1) ++qf; 9544c367dbcSMatthew G. Knepley if ((val == 1) || (val == (shift + 1))) ++qn; 9554c367dbcSMatthew G. Knepley if ((val == 1) || (val == -(shift + 1))) ++qp; 956cd0c2139SMatthew G Knepley } 9574c367dbcSMatthew G. Knepley /* Split old vertex: Edges into original vertex and new cohesive edge */ 9584c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 9594c367dbcSMatthew G. Knepley /* Split new vertex: Edges into split vertex and new cohesive edge */ 9604c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 9614c367dbcSMatthew G. Knepley /* Add hybrid edge */ 9624c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 9634c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 964cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 9654c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 9664c367dbcSMatthew G. Knepley 967cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 9684c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 969cd0c2139SMatthew G Knepley PetscInt val; 970cd0c2139SMatthew G Knepley 971cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 9724c367dbcSMatthew G. Knepley if (val == dim-1) ++qf; 9734c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 9744c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 975cd0c2139SMatthew G Knepley } 9764c367dbcSMatthew G. Knepley /* Split old edge: Faces into original edge and cohesive face (positive side?) */ 9774c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 9784c367dbcSMatthew G. Knepley /* Split new edge: Faces into split edge and cohesive face (negative side?) */ 9794c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 9804c367dbcSMatthew G. Knepley /* Add hybrid face */ 9814c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 9824c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 983cd0c2139SMatthew G Knepley } 984cd0c2139SMatthew G Knepley } 985cd0c2139SMatthew G Knepley } 98618c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 98718c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 98818c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 9892582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 99018c5995bSMatthew G. Knepley const PetscInt *support; 991da1dd7e4SMatthew G. Knepley PetscInt coneSize, supportSize, qf, e, s; 99218c5995bSMatthew G. Knepley 99318c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 99418c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 99539254ff6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 99618c5995bSMatthew G. Knepley if (dep == 0) { 99718c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 99818c5995bSMatthew G. Knepley 99939254ff6SMatthew G. Knepley /* Unsplit vertex: Edges into original vertex, split edges, and new cohesive edge twice */ 100039254ff6SMatthew G. Knepley for (s = 0, qf = 0; s < supportSize; ++s, ++qf) { 100139254ff6SMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 100239254ff6SMatthew G. Knepley if (e >= 0) ++qf; 100339254ff6SMatthew G. Knepley } 100439254ff6SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 100518c5995bSMatthew G. Knepley /* Add hybrid edge */ 100618c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 1007e1757548SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 1008e1757548SMatthew G. Knepley PetscInt val; 1009e1757548SMatthew G. Knepley 1010e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1011e1757548SMatthew G. Knepley /* Split and unsplit edges produce hybrid faces */ 1012da1dd7e4SMatthew G. Knepley if (val == 1) ++qf; 1013da1dd7e4SMatthew G. Knepley if (val == (shift2 + 1)) ++qf; 1014e1757548SMatthew G. Knepley } 1015e1757548SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 101618c5995bSMatthew G. Knepley } else if (dep == dim-2) { 101718c5995bSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 1018cd0c2139SMatthew G Knepley PetscInt val; 1019cd0c2139SMatthew G Knepley 1020da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 1021cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1022da1dd7e4SMatthew G. Knepley if (val == dim-1) qf += 2; 1023da1dd7e4SMatthew G. Knepley else ++qf; 1024cd0c2139SMatthew G Knepley } 102518c5995bSMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */ 1026da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 102718c5995bSMatthew G. Knepley /* Add hybrid face */ 1028da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 1029da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1030da1dd7e4SMatthew G. Knepley if (val == dim-1) ++qf; 1031da1dd7e4SMatthew G. Knepley } 103218c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 1033da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 1034cd0c2139SMatthew G Knepley } 1035cd0c2139SMatthew G Knepley } 1036cd0c2139SMatthew G Knepley } 1037cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 1038cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 1039cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1040dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 1041dcca6d9dSJed Brown ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),&supportNew);CHKERRQ(ierr); 1042cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 1043cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1044cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 1045cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 10462582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 10474c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 1048cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 10494c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, q, qf, qn, qp, v, e, s; 1050cd0c2139SMatthew G Knepley 1051cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 1052cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 1053cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 1054cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 1055cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 1056cd0c2139SMatthew G Knepley if (dep == depth-1) { 105796a07cd0SMatthew G. Knepley PetscBool hasUnsplit = PETSC_FALSE; 10584c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1059cd0c2139SMatthew G Knepley const PetscInt *supportF; 1060cd0c2139SMatthew G Knepley 1061cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 1062cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 1063cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 1064cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 1065cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 1066cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 10674c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 106818c5995bSMatthew G. Knepley if (v < 0) { 106918c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 107018c5995bSMatthew 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); 10712582d50cSToby Isaac coneNew[2+q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/; 107296a07cd0SMatthew G. Knepley hasUnsplit = PETSC_TRUE; 107318c5995bSMatthew G. Knepley } else { 10744c367dbcSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep-1]; 1075163235baSMatthew G. Knepley if (dep > 1) { 1076163235baSMatthew G. Knepley const PetscInt *econe; 1077163235baSMatthew G. Knepley PetscInt econeSize, r, vs, vu; 1078163235baSMatthew G. Knepley 1079163235baSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[q], &econeSize);CHKERRQ(ierr); 1080163235baSMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[q], &econe);CHKERRQ(ierr); 1081163235baSMatthew G. Knepley for (r = 0; r < econeSize; ++r) { 1082163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numSplitPoints[dep-2], splitPoints[dep-2], &vs);CHKERRQ(ierr); 1083163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numUnsplitPoints[dep-2], unsplitPoints[dep-2], &vu);CHKERRQ(ierr); 1084163235baSMatthew G. Knepley if (vs >= 0) continue; 1085163235baSMatthew 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); 1086163235baSMatthew G. Knepley hasUnsplit = PETSC_TRUE; 1087163235baSMatthew G. Knepley } 1088163235baSMatthew G. Knepley } 1089cd0c2139SMatthew G Knepley } 1090cd0c2139SMatthew G Knepley } 1091cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 1092cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 1093e537020bSMatthew G. Knepley /* Face support */ 1094cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1095cd0c2139SMatthew G Knepley PetscInt val; 1096cd0c2139SMatthew G Knepley 1097cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 1098cd0c2139SMatthew G Knepley if (val < 0) { 1099cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 11004c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr); 1101cd0c2139SMatthew G Knepley } else { 1102cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 11034c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr); 1104e537020bSMatthew G. Knepley /* Get orientation for cohesive face */ 1105e537020bSMatthew G. Knepley { 1106e537020bSMatthew G. Knepley const PetscInt *ncone, *nconeO; 1107e537020bSMatthew G. Knepley PetscInt nconeSize, nc; 1108e537020bSMatthew G. Knepley 1109e537020bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 1110e537020bSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 1111e537020bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 1112e537020bSMatthew G. Knepley for (nc = 0; nc < nconeSize; ++nc) { 1113e537020bSMatthew G. Knepley if (ncone[nc] == oldp) { 1114e537020bSMatthew G. Knepley coneONew[0] = nconeO[nc]; 1115e537020bSMatthew G. Knepley break; 1116cd0c2139SMatthew G Knepley } 1117cd0c2139SMatthew G Knepley } 1118e537020bSMatthew 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]); 1119e537020bSMatthew G. Knepley } 1120e537020bSMatthew G. Knepley } 1121e537020bSMatthew G. Knepley } 11224c367dbcSMatthew G. Knepley /* Cohesive cell: Old and new split face, then new cohesive faces */ 1123fd4b9f15SMatthew G. Knepley coneNew[0] = newp; /* Extracted negative side orientation above */ 11244c367dbcSMatthew G. Knepley coneNew[1] = splitp; 11254c367dbcSMatthew G. Knepley coneONew[1] = coneONew[0]; 1126e537020bSMatthew G. Knepley for (q = 0; q < coneSize; ++q) { 112718c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 112818c5995bSMatthew G. Knepley if (v < 0) { 112918c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 113018c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 113118c5995bSMatthew G. Knepley coneONew[2+q] = 0; 113218c5995bSMatthew G. Knepley } else { 113318c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep]; 113418c5995bSMatthew G. Knepley } 1135e537020bSMatthew G. Knepley coneONew[2+q] = 0; 1136e537020bSMatthew G. Knepley } 11374c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr); 11384c367dbcSMatthew G. Knepley ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr); 113996a07cd0SMatthew G. Knepley /* Label the hybrid cells on the boundary of the split */ 114096a07cd0SMatthew G. Knepley if (hasUnsplit) {ierr = DMLabelSetValue(label, -hybcell, dim);CHKERRQ(ierr);} 1141cd0c2139SMatthew G Knepley } else if (dep == 0) { 11424c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1143cd0c2139SMatthew G Knepley 1144cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 11454c367dbcSMatthew G. Knepley for (e = 0, qn = 0; e < supportSize; ++e) { 1146cd0c2139SMatthew G Knepley PetscInt val; 1147cd0c2139SMatthew G Knepley 1148cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1149cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 11502582d50cSToby Isaac supportNew[qn++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1151cd0c2139SMatthew G Knepley } 1152cd0c2139SMatthew G Knepley } 11534c367dbcSMatthew G. Knepley supportNew[qn] = hybedge; 1154cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1155cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 11564c367dbcSMatthew G. Knepley for (e = 0, qp = 0; e < supportSize; ++e) { 1157cd0c2139SMatthew G Knepley PetscInt val, edge; 1158cd0c2139SMatthew G Knepley 1159cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1160cd0c2139SMatthew G Knepley if (val == 1) { 11614c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 1162cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 11634c367dbcSMatthew G. Knepley supportNew[qp++] = edge + pMaxNew[dep+1]; 1164cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 11652582d50cSToby Isaac supportNew[qp++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1166cd0c2139SMatthew G Knepley } 1167cd0c2139SMatthew G Knepley } 11684c367dbcSMatthew G. Knepley supportNew[qp] = hybedge; 1169cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 11704c367dbcSMatthew G. Knepley /* Hybrid edge: Old and new split vertex */ 1171cd0c2139SMatthew G Knepley coneNew[0] = newp; 1172cd0c2139SMatthew G Knepley coneNew[1] = splitp; 11734c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 11744c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 11754c367dbcSMatthew G. Knepley PetscInt val, edge; 11764c367dbcSMatthew G. Knepley 11774c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 11784c367dbcSMatthew G. Knepley if (val == 1) { 11794c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 11804c367dbcSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 11814c367dbcSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 11824c367dbcSMatthew G. Knepley } 11834c367dbcSMatthew G. Knepley } 11844c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1185cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 11864c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 11874c367dbcSMatthew G. Knepley 1188cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 1189cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 1190cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 11914c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 1192e1757548SMatthew G. Knepley if (v < 0) { 1193e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1194e1757548SMatthew 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); 11952582d50cSToby Isaac coneNew[q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/; 1196e1757548SMatthew G. Knepley } else { 11974c367dbcSMatthew G. Knepley coneNew[q] = v + pMaxNew[dep-1]; 1198cd0c2139SMatthew G Knepley } 1199e1757548SMatthew G. Knepley } 1200cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 1201cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 1202cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 1203cd0c2139SMatthew G Knepley PetscInt val; 1204cd0c2139SMatthew G Knepley 1205cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 12064c367dbcSMatthew G. Knepley if (val == dim-1) { 12072582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 12084c367dbcSMatthew G. Knepley } else if (val == (shift + dim-1)) { 12092582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1210cd0c2139SMatthew G Knepley } 1211cd0c2139SMatthew G Knepley } 1212b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1213cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1214cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 1215cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 1216cd0c2139SMatthew G Knepley PetscInt val, face; 1217cd0c2139SMatthew G Knepley 1218cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1219cd0c2139SMatthew G Knepley if (val == dim-1) { 12204c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1221cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 12224c367dbcSMatthew G. Knepley supportNew[q++] = face + pMaxNew[dep+1]; 1223cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 12242582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1225cd0c2139SMatthew G Knepley } 1226cd0c2139SMatthew G Knepley } 1227b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1228cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 12294c367dbcSMatthew G. Knepley /* Hybrid face */ 12304c367dbcSMatthew G. Knepley coneNew[0] = newp; 12314c367dbcSMatthew G. Knepley coneNew[1] = splitp; 12324c367dbcSMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 12334c367dbcSMatthew G. Knepley PetscInt vertex; 12344c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr); 1235e1757548SMatthew G. Knepley if (vertex < 0) { 1236e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr); 1237e1757548SMatthew 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); 1238e1757548SMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1239e1757548SMatthew G. Knepley } else { 12404c367dbcSMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep]; 12414c367dbcSMatthew G. Knepley } 1242e1757548SMatthew G. Knepley } 12434c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 12444c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 12454c367dbcSMatthew G. Knepley PetscInt val, face; 12464c367dbcSMatthew G. Knepley 12474c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 12484c367dbcSMatthew G. Knepley if (val == dim-1) { 12494c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 12504c367dbcSMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 12514c367dbcSMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 12524c367dbcSMatthew G. Knepley } 12534c367dbcSMatthew G. Knepley } 12544c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1255cd0c2139SMatthew G Knepley } 1256cd0c2139SMatthew G Knepley } 1257cd0c2139SMatthew G Knepley } 125818c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 125918c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 126018c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 12612582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 126218c5995bSMatthew G. Knepley const PetscInt *cone, *support, *ornt; 1263e1757548SMatthew G. Knepley PetscInt coneSize, supportSize, supportSizeNew, q, qf, e, f, s; 126418c5995bSMatthew G. Knepley 126518c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 126618c5995bSMatthew G. Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 126718c5995bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 126818c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 126918c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 127018c5995bSMatthew G. Knepley if (dep == 0) { 127118c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 127218c5995bSMatthew G. Knepley 127318c5995bSMatthew G. Knepley /* Unsplit vertex */ 127418c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 127518c5995bSMatthew G. Knepley for (s = 0, q = 0; s < supportSize; ++s) { 12762582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[s], depth, depthShift) /*support[s] + depthOffset[dep+1]*/; 127718c5995bSMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 127818c5995bSMatthew G. Knepley if (e >= 0) { 127918c5995bSMatthew G. Knepley supportNew[q++] = e + pMaxNew[dep+1]; 128018c5995bSMatthew G. Knepley } 128118c5995bSMatthew G. Knepley } 128218c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 128318c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 128418c5995bSMatthew G. Knepley if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp); 128518c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 128618c5995bSMatthew G. Knepley /* Hybrid edge */ 128718c5995bSMatthew G. Knepley coneNew[0] = newp; 128818c5995bSMatthew G. Knepley coneNew[1] = newp; 128918c5995bSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 129018c5995bSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 129118c5995bSMatthew G. Knepley PetscInt val, edge; 129218c5995bSMatthew G. Knepley 129318c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 129418c5995bSMatthew G. Knepley if (val == 1) { 129518c5995bSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 129618c5995bSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 129718c5995bSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1298e1757548SMatthew G. Knepley } else if (val == (shift2 + 1)) { 1299e1757548SMatthew G. Knepley ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr); 1300e1757548SMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]); 1301e1757548SMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1]; 130218c5995bSMatthew G. Knepley } 130318c5995bSMatthew G. Knepley } 130418c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1305e1757548SMatthew G. Knepley } else if (dep == dim-2) { 1306e1757548SMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 1307e1757548SMatthew G. Knepley 1308da1dd7e4SMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and hybrid face twice */ 1309e1757548SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1310e1757548SMatthew G. Knepley PetscInt val, face; 1311e1757548SMatthew G. Knepley 1312e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1313e1757548SMatthew G. Knepley if (val == dim-1) { 1314e1757548SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1315e1757548SMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]); 13162582d50cSToby Isaac supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/; 1317e1757548SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+1]; 1318e1757548SMatthew G. Knepley } else { 13192582d50cSToby Isaac supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/; 1320e1757548SMatthew G. Knepley } 1321e1757548SMatthew G. Knepley } 1322e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1323e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1324da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 1325da1dd7e4SMatthew 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); 1326e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1327e1757548SMatthew G. Knepley /* Add hybrid face */ 1328e1757548SMatthew G. Knepley coneNew[0] = newp; 1329212cc919SMatthew G. Knepley coneNew[1] = newp; 1330e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[0], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1331e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[0]); 1332212cc919SMatthew G. Knepley coneNew[2] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1333e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1334e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]); 1335e1757548SMatthew G. Knepley coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1336e1757548SMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 1337da1dd7e4SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1338da1dd7e4SMatthew G. Knepley PetscInt val, face; 1339da1dd7e4SMatthew G. Knepley 1340da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1341da1dd7e4SMatthew G. Knepley if (val == dim-1) { 1342da1dd7e4SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1343da1dd7e4SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1344da1dd7e4SMatthew G. Knepley } 1345da1dd7e4SMatthew G. Knepley } 1346da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, hybface, &supportSizeNew);CHKERRQ(ierr); 1347da1dd7e4SMatthew 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); 1348e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1349cd0c2139SMatthew G Knepley } 1350cd0c2139SMatthew G Knepley } 1351cd0c2139SMatthew G Knepley } 1352cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 1353cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1354cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 1355cd0c2139SMatthew G Knepley IS pIS; 1356cd0c2139SMatthew G Knepley PetscInt numPoints; 1357cd0c2139SMatthew G Knepley const PetscInt *points; 1358cd0c2139SMatthew G Knepley 1359cd0c2139SMatthew G Knepley if (dep >= 0) continue; 1360cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 1361cd0c2139SMatthew G Knepley if (!pIS) continue; 1362cd0c2139SMatthew G Knepley dep = -dep - shift; 1363cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 1364cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 1365cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1366cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 13672582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*depthOffset[dep] + oldp*/; 1368cd0c2139SMatthew G Knepley const PetscInt *cone; 1369cd0c2139SMatthew G Knepley PetscInt coneSize, c; 137050cf782dSMatthew G. Knepley /* PetscBool replaced = PETSC_FALSE; */ 1371cd0c2139SMatthew G Knepley 1372cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 1373cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 1374cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 1375cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 1376cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1377e38fbfedSToby Isaac const PetscInt coldp = DMPlexShiftPointInverse_Internal(cone[c],depth,depthShift); 1378cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 1379cd0c2139SMatthew G Knepley 1380cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 1381cd0c2139SMatthew G Knepley if (val == dep-1) { 1382cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 1383cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 1384cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 1385cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 138650cf782dSMatthew G. Knepley /* replaced = PETSC_TRUE; */ 1387cd0c2139SMatthew G Knepley } 1388cd0c2139SMatthew G Knepley } 13894a189a86SMatthew G. Knepley /* Cells with only a vertex or edge on the submesh have no replacement */ 13904a189a86SMatthew G. Knepley /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 1391cd0c2139SMatthew G Knepley } 1392cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 1393cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 1394cd0c2139SMatthew G Knepley } 1395cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 1396cd0c2139SMatthew G Knepley ierr = DMPlexStratify(sdm);CHKERRQ(ierr); 1397cd0c2139SMatthew G Knepley /* Step 8: Coordinates */ 1398cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 139969d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 1400cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 1401cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 1402cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 14032582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[0][v], depth, depthShift) /*depthOffset[0] + splitPoints[0][v]*/; 1404cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 1405cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 1406cd0c2139SMatthew G Knepley 1407cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 1408cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 1409cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 1410cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 1411cd0c2139SMatthew G Knepley } 1412cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 1413cd0c2139SMatthew G Knepley /* Step 9: SF, if I can figure this out we can split the mesh in parallel */ 1414cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1415cd0c2139SMatthew G Knepley /* Step 10: Labels */ 1416cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1417c58f1c22SToby Isaac ierr = DMGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 1418cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1419cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 14202582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[dep][p], depth, depthShift) /*depthOffset[dep] + splitPoints[dep][p]*/; 1421cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 1422cd0c2139SMatthew G Knepley PetscInt l; 1423cd0c2139SMatthew G Knepley 1424cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 1425cd0c2139SMatthew G Knepley DMLabel mlabel; 1426cd0c2139SMatthew G Knepley const char *lname; 1427cd0c2139SMatthew G Knepley PetscInt val; 14289a356370SMatthew G. Knepley PetscBool isDepth; 1429cd0c2139SMatthew G Knepley 1430c58f1c22SToby Isaac ierr = DMGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 14319a356370SMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 14329a356370SMatthew G. Knepley if (isDepth) continue; 1433c58f1c22SToby Isaac ierr = DMGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 1434cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 1435cd0c2139SMatthew G Knepley if (val >= 0) { 1436cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 14379a356370SMatthew G. Knepley #if 0 14389a356370SMatthew G. Knepley /* Do not put cohesive edges into the label */ 1439cd0c2139SMatthew G Knepley if (dep == 0) { 14404c367dbcSMatthew G. Knepley const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1441cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr); 14424c367dbcSMatthew G. Knepley } else if (dep == dim-2) { 14434c367dbcSMatthew G. Knepley const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 14444c367dbcSMatthew G. Knepley ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr); 1445cd0c2139SMatthew G Knepley } 14464c367dbcSMatthew G. Knepley /* Do not put cohesive faces into the label */ 14479a356370SMatthew G. Knepley #endif 1448cd0c2139SMatthew G Knepley } 1449cd0c2139SMatthew G Knepley } 1450cd0c2139SMatthew G Knepley } 1451cd0c2139SMatthew G Knepley } 1452cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1453cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 1454cd0c2139SMatthew G Knepley 1455cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 145618c5995bSMatthew G. Knepley if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 145718c5995bSMatthew G. Knepley ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr); 145818c5995bSMatthew G. Knepley if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);} 145918c5995bSMatthew G. Knepley ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr); 1460cd0c2139SMatthew G Knepley } 1461cd0c2139SMatthew G Knepley if (label) { 1462cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1463cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1464cd0c2139SMatthew G Knepley } 14650d4d4d06SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 14660d4d4d06SMatthew G. Knepley ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr); 146736dbac82SMatthew G. Knepley pMaxNew[d] = pEnd - numHybridPoints[d] - numHybridPointsOld[d]; 14680d4d4d06SMatthew G. Knepley } 14690e49e2e2SMatthew 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); 1470dcbb62e8SMatthew G. Knepley ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr); 14712582d50cSToby Isaac ierr = PetscFree5(depthMax, depthEnd, depthShift, pMaxNew, numHybridPointsOld);CHKERRQ(ierr); 147218c5995bSMatthew G. Knepley ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr); 1473cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1474cd0c2139SMatthew G Knepley } 1475cd0c2139SMatthew G Knepley 1476cd0c2139SMatthew G Knepley #undef __FUNCT__ 1477cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells" 1478cd0c2139SMatthew G Knepley /*@C 1479cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 1480cd0c2139SMatthew G Knepley 1481cd0c2139SMatthew G Knepley Collective on dm 1482cd0c2139SMatthew G Knepley 1483cd0c2139SMatthew G Knepley Input Parameters: 1484cd0c2139SMatthew G Knepley + dm - The original DM 148553156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated) 1486cd0c2139SMatthew G Knepley 1487cd0c2139SMatthew G Knepley Output Parameters: 1488cd0c2139SMatthew G Knepley - dmSplit - The new DM 1489cd0c2139SMatthew G Knepley 1490cd0c2139SMatthew G Knepley Level: developer 1491cd0c2139SMatthew G Knepley 14922be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 1493cd0c2139SMatthew G Knepley @*/ 1494cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 1495cd0c2139SMatthew G Knepley { 1496cd0c2139SMatthew G Knepley DM sdm; 1497cd0c2139SMatthew G Knepley PetscInt dim; 1498cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1499cd0c2139SMatthew G Knepley 1500cd0c2139SMatthew G Knepley PetscFunctionBegin; 1501cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 150253156dfcSMatthew G. Knepley PetscValidPointer(dmSplit, 3); 1503cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 1504cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 1505c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1506c73cfb54SMatthew G. Knepley ierr = DMSetDimension(sdm, dim);CHKERRQ(ierr); 1507cd0c2139SMatthew G Knepley switch (dim) { 1508cd0c2139SMatthew G Knepley case 2: 1509cd0c2139SMatthew G Knepley case 3: 1510cd0c2139SMatthew G Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 1511cd0c2139SMatthew G Knepley break; 1512cd0c2139SMatthew G Knepley default: 1513cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 1514cd0c2139SMatthew G Knepley } 1515cd0c2139SMatthew G Knepley *dmSplit = sdm; 1516cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1517cd0c2139SMatthew G Knepley } 1518cd0c2139SMatthew G Knepley 1519cd0c2139SMatthew G Knepley #undef __FUNCT__ 15200f66a230SMatthew G. Knepley #define __FUNCT__ "GetSurfaceSide_Static" 15210f66a230SMatthew G. Knepley /* Returns the side of the surface for a given cell with a face on the surface */ 15220f66a230SMatthew G. Knepley static PetscErrorCode GetSurfaceSide_Static(DM dm, DM subdm, PetscInt numSubpoints, const PetscInt *subpoints, PetscInt cell, PetscInt face, PetscBool *pos) 15230f66a230SMatthew G. Knepley { 15240f66a230SMatthew G. Knepley const PetscInt *cone, *ornt; 15250f66a230SMatthew G. Knepley PetscInt dim, coneSize, c; 15260f66a230SMatthew G. Knepley PetscErrorCode ierr; 15270f66a230SMatthew G. Knepley 15280f66a230SMatthew G. Knepley PetscFunctionBegin; 15290f66a230SMatthew G. Knepley *pos = PETSC_TRUE; 1530c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 15310f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 15320f66a230SMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 15330f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, cell, &ornt);CHKERRQ(ierr); 15340f66a230SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 15350f66a230SMatthew G. Knepley if (cone[c] == face) { 15360f66a230SMatthew G. Knepley PetscInt o = ornt[c]; 15370f66a230SMatthew G. Knepley 15380f66a230SMatthew G. Knepley if (subdm) { 15390f66a230SMatthew G. Knepley const PetscInt *subcone, *subornt; 15400f66a230SMatthew G. Knepley PetscInt subpoint, subface, subconeSize, sc; 15410f66a230SMatthew G. Knepley 15420f66a230SMatthew G. Knepley ierr = PetscFindInt(cell, numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 15430f66a230SMatthew G. Knepley ierr = PetscFindInt(face, numSubpoints, subpoints, &subface);CHKERRQ(ierr); 15440f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 15450f66a230SMatthew G. Knepley ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 15460f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 15470f66a230SMatthew G. Knepley for (sc = 0; sc < subconeSize; ++sc) { 15480f66a230SMatthew G. Knepley if (subcone[sc] == subface) { 15490f66a230SMatthew G. Knepley o = subornt[0]; 15500f66a230SMatthew G. Knepley break; 15510f66a230SMatthew G. Knepley } 15520f66a230SMatthew G. Knepley } 15530f66a230SMatthew 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); 15540f66a230SMatthew G. Knepley } 15550f66a230SMatthew G. Knepley if (o >= 0) *pos = PETSC_TRUE; 15560f66a230SMatthew G. Knepley else *pos = PETSC_FALSE; 15570f66a230SMatthew G. Knepley break; 15580f66a230SMatthew G. Knepley } 15590f66a230SMatthew G. Knepley } 15600f66a230SMatthew 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); 15610f66a230SMatthew G. Knepley PetscFunctionReturn(0); 15620f66a230SMatthew G. Knepley } 15630f66a230SMatthew G. Knepley 15640f66a230SMatthew G. Knepley #undef __FUNCT__ 15652be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete" 1566cd0c2139SMatthew G Knepley /*@ 15670f66a230SMatthew G. Knepley DMPlexLabelCohesiveComplete - Starting with a label marking points on an internal surface, we add all other mesh pieces 1568cd0c2139SMatthew G Knepley to complete the surface 1569cd0c2139SMatthew G Knepley 1570cd0c2139SMatthew G Knepley Input Parameters: 1571cd0c2139SMatthew G Knepley + dm - The DM 15720f66a230SMatthew G. Knepley . label - A DMLabel marking the surface 15730f66a230SMatthew G. Knepley . blabel - A DMLabel marking the vertices on the boundary which will not be duplicated, or NULL to find them automatically 1574bb55d314SMatthew G. Knepley . flip - Flag to flip the submesh normal and replace points on the other side 157547946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL 1576cd0c2139SMatthew G Knepley 1577cd0c2139SMatthew G Knepley Output Parameter: 1578cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 1579cd0c2139SMatthew G Knepley 15800f66a230SMatthew G. Knepley Note: The vertices in blabel are called "unsplit" in the terminology from hybrid cell creation. 15810f66a230SMatthew G. Knepley 1582cd0c2139SMatthew G Knepley Level: developer 1583cd0c2139SMatthew G Knepley 15842be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 1585cd0c2139SMatthew G Knepley @*/ 15860f66a230SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, DMLabel blabel, PetscBool flip, DM subdm) 1587cd0c2139SMatthew G Knepley { 1588d90583fdSMatthew G. Knepley DMLabel depthLabel; 15898630cb1aSMatthew G. Knepley IS dimIS, subpointIS = NULL, facePosIS, faceNegIS, crossEdgeIS = NULL; 159047946fd8SMatthew G. Knepley const PetscInt *points, *subpoints; 1591bb55d314SMatthew G. Knepley const PetscInt rev = flip ? -1 : 1; 1592370472baSMatthew G. Knepley PetscInt *pMax; 1593370472baSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, dim, depth, pSize, dep, cStart, cEnd, cMax, fStart, fEnd, vStart, vEnd, numPoints, numSubpoints, p, val; 1594cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1595cd0c2139SMatthew G Knepley 1596cd0c2139SMatthew G Knepley PetscFunctionBegin; 1597370472baSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1598370472baSMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1599370472baSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1600370472baSMatthew G. Knepley ierr = PetscMalloc1(pSize,&pMax);CHKERRQ(ierr); 1601370472baSMatthew 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); 1602d90583fdSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 1603c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 160447946fd8SMatthew G. Knepley if (subdm) { 160547946fd8SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 160647946fd8SMatthew G. Knepley if (subpointIS) { 160747946fd8SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 160847946fd8SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 160947946fd8SMatthew G. Knepley } 161047946fd8SMatthew G. Knepley } 1611d7c8f101SMatthew G. Knepley /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */ 1612cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 1613dc86033cSMatthew G. Knepley if (!dimIS) { 1614dc86033cSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 16158630cb1aSMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 1616dc86033cSMatthew G. Knepley PetscFunctionReturn(0); 1617dc86033cSMatthew G. Knepley } 1618cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1619cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1620d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */ 1621cd0c2139SMatthew G Knepley const PetscInt *support; 1622cd0c2139SMatthew G Knepley PetscInt supportSize, s; 1623cd0c2139SMatthew G Knepley 1624cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1625cd0c2139SMatthew G Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 1626cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1627cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 16280f66a230SMatthew G. Knepley const PetscInt *cone; 1629cd0c2139SMatthew G Knepley PetscInt coneSize, c; 16300f66a230SMatthew G. Knepley PetscBool pos; 1631cd0c2139SMatthew G Knepley 16320f66a230SMatthew G. Knepley ierr = GetSurfaceSide_Static(dm, subdm, numSubpoints, subpoints, support[s], points[p], &pos);CHKERRQ(ierr); 16330f66a230SMatthew G. Knepley if (pos) {ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr);} 16340f66a230SMatthew G. Knepley else {ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);} 16350f66a230SMatthew G. Knepley if (rev < 0) pos = !pos ? PETSC_TRUE : PETSC_FALSE; 16360f66a230SMatthew G. Knepley /* Put faces touching the fault in the label */ 1637cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1638cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1639cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1640cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 1641cd0c2139SMatthew G Knepley 1642cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1643cd0c2139SMatthew G Knepley if (val == -1) { 1644cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 1645cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 1646cd0c2139SMatthew G Knepley 1647cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1648cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1649cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 1650a0541d8aSMatthew G. Knepley PetscInt bval = -1; 1651cd0c2139SMatthew G Knepley 1652cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1653a0541d8aSMatthew G. Knepley if (blabel) {ierr = DMLabelGetValue(blabel, clp, &bval);CHKERRQ(ierr);} 1654a0541d8aSMatthew G. Knepley if ((val >= 0) && (val < dim-1) && (bval < 0)) { 1655cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1656cd0c2139SMatthew G Knepley break; 1657cd0c2139SMatthew G Knepley } 1658cd0c2139SMatthew G Knepley } 1659cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1660cd0c2139SMatthew G Knepley } 1661cd0c2139SMatthew G Knepley } 1662cd0c2139SMatthew G Knepley } 1663cd0c2139SMatthew G Knepley } 16640f66a230SMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 16650f66a230SMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 166647946fd8SMatthew G. Knepley if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 166747946fd8SMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 1668a0541d8aSMatthew G. Knepley /* Mark boundary points as unsplit */ 166986200784SMatthew G. Knepley if (blabel) { 1670a0541d8aSMatthew G. Knepley ierr = DMLabelGetStratumIS(blabel, 1, &dimIS);CHKERRQ(ierr); 1671a0541d8aSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1672a0541d8aSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1673a0541d8aSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1674a0541d8aSMatthew G. Knepley const PetscInt point = points[p]; 1675a0541d8aSMatthew G. Knepley PetscInt val, bval; 1676a0541d8aSMatthew G. Knepley 1677a0541d8aSMatthew G. Knepley ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr); 1678a0541d8aSMatthew G. Knepley if (bval >= 0) { 1679f7019248SMatthew G. Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1680f7019248SMatthew G. Knepley if ((val < 0) || (val > dim)) { 1681f7019248SMatthew G. Knepley /* This could be a point added from splitting a vertex on an adjacent fault, otherwise its just wrong */ 1682f7019248SMatthew G. Knepley ierr = DMLabelClearValue(blabel, point, bval);CHKERRQ(ierr); 1683f7019248SMatthew G. Knepley } 1684f7019248SMatthew G. Knepley } 1685f7019248SMatthew G. Knepley } 1686f7019248SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1687f7019248SMatthew G. Knepley const PetscInt point = points[p]; 1688f7019248SMatthew G. Knepley PetscInt val, bval; 1689f7019248SMatthew G. Knepley 1690f7019248SMatthew G. Knepley ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr); 1691f7019248SMatthew G. Knepley if (bval >= 0) { 169286200784SMatthew G. Knepley const PetscInt *cone, *support; 169386200784SMatthew G. Knepley PetscInt coneSize, supportSize, s, valA, valB, valE; 169486200784SMatthew G. Knepley 1695a0541d8aSMatthew G. Knepley /* Mark as unsplit */ 1696a0541d8aSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1697a0541d8aSMatthew 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); 1698a0541d8aSMatthew G. Knepley ierr = DMLabelClearValue(label, point, val);CHKERRQ(ierr); 1699a0541d8aSMatthew G. Knepley ierr = DMLabelSetValue(label, point, shift2+val);CHKERRQ(ierr); 17002c06a818SMatthew G. Knepley /* Check for cross-edge 17012c06a818SMatthew G. Knepley A cross-edge has endpoints which are both on the boundary of the surface, but the edge itself is not. */ 170286200784SMatthew G. Knepley if (val != 0) continue; 170386200784SMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 170486200784SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 170586200784SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 170686200784SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 170786200784SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 170886200784SMatthew G. Knepley if (coneSize != 2) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Edge %D has %D vertices != 2", support[s], coneSize); 170986200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, cone[0], &valA);CHKERRQ(ierr); 171086200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, cone[1], &valB);CHKERRQ(ierr); 171186200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, support[s], &valE);CHKERRQ(ierr); 171209816f77SMatthew G. Knepley if ((valE < 0) && (valA >= 0) && (valB >= 0) && (cone[0] != cone[1])) {ierr = DMLabelSetValue(blabel, support[s], 2);CHKERRQ(ierr);} 171386200784SMatthew G. Knepley } 1714a0541d8aSMatthew G. Knepley } 1715a0541d8aSMatthew G. Knepley } 1716a0541d8aSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1717a0541d8aSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1718a0541d8aSMatthew G. Knepley } 1719cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1720c4d480a2SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 1721cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1722d24f5ce5SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1723d24f5ce5SMatthew G. Knepley cMax = cMax < 0 ? cEnd : cMax; 17240f66a230SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 1725cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 172686200784SMatthew G. Knepley if (blabel) {ierr = DMLabelGetStratumIS(blabel, 2, &crossEdgeIS);CHKERRQ(ierr);} 172786200784SMatthew G. Knepley if (dimIS && crossEdgeIS) { 172886200784SMatthew G. Knepley IS vertIS = dimIS; 172986200784SMatthew G. Knepley 173086200784SMatthew G. Knepley ierr = ISExpand(vertIS, crossEdgeIS, &dimIS);CHKERRQ(ierr); 173186200784SMatthew G. Knepley ierr = ISDestroy(&crossEdgeIS);CHKERRQ(ierr); 173286200784SMatthew G. Knepley ierr = ISDestroy(&vertIS);CHKERRQ(ierr); 173386200784SMatthew G. Knepley } 1734dc86033cSMatthew G. Knepley if (!dimIS) { 1735dc86033cSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1736dc86033cSMatthew G. Knepley PetscFunctionReturn(0); 1737dc86033cSMatthew G. Knepley } 1738cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1739cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1740d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */ 1741cd0c2139SMatthew G Knepley PetscInt *star = NULL; 174286200784SMatthew G. Knepley PetscInt starSize, s; 1743cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1744cd0c2139SMatthew G Knepley 1745d4622b2cSMatthew G. Knepley /* All points connected to the fault are inside a cell, so at the top level we will only check cells */ 1746cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1747cd0c2139SMatthew G Knepley while (again) { 1748cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1749cd0c2139SMatthew G Knepley again = 0; 1750cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1751cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1752cd0c2139SMatthew G Knepley const PetscInt *cone; 1753cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1754cd0c2139SMatthew G Knepley 1755d24f5ce5SMatthew G. Knepley if ((point < cStart) || (point >= cMax)) continue; 1756cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1757cd0c2139SMatthew G Knepley if (val != -1) continue; 1758d4622b2cSMatthew G. Knepley again = again == 1 ? 1 : 2; 1759cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1760cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1761cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1762cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1763cd0c2139SMatthew G Knepley if (val != -1) { 1764d7c8f101SMatthew G. Knepley const PetscInt *ccone; 1765166d9d0cSMatthew G. Knepley PetscInt cconeSize, cc, side; 1766d7c8f101SMatthew G. Knepley 1767db8edaafSMatthew 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); 176837a6de01SMatthew G. Knepley if (val > 0) side = 1; 176937a6de01SMatthew G. Knepley else side = -1; 177037a6de01SMatthew G. Knepley ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr); 1771d7c8f101SMatthew G. Knepley /* Mark cell faces which touch the fault */ 1772d7c8f101SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr); 1773d7c8f101SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr); 1774d7c8f101SMatthew G. Knepley for (cc = 0; cc < cconeSize; ++cc) { 1775d7c8f101SMatthew G. Knepley PetscInt *closure = NULL; 1776d7c8f101SMatthew G. Knepley PetscInt closureSize, cl; 1777d7c8f101SMatthew G. Knepley 1778166d9d0cSMatthew G. Knepley ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr); 1779166d9d0cSMatthew G. Knepley if (val != -1) continue; 1780d7c8f101SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1781d4622b2cSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1782d7c8f101SMatthew G. Knepley const PetscInt clp = closure[cl]; 1783d7c8f101SMatthew G. Knepley 1784d7c8f101SMatthew G. Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1785d7c8f101SMatthew G. Knepley if (val == -1) continue; 1786d7c8f101SMatthew G. Knepley ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr); 178737a6de01SMatthew G. Knepley break; 178837a6de01SMatthew G. Knepley } 1789d7c8f101SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1790cd0c2139SMatthew G Knepley } 1791cd0c2139SMatthew G Knepley again = 1; 1792cd0c2139SMatthew G Knepley break; 1793cd0c2139SMatthew G Knepley } 1794cd0c2139SMatthew G Knepley } 1795cd0c2139SMatthew G Knepley } 1796cd0c2139SMatthew G Knepley } 1797cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1798cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1799cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1800cd0c2139SMatthew G Knepley 1801cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1802cd0c2139SMatthew G Knepley if (val == -1) { 1803cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1804cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1805cd0c2139SMatthew G Knepley PetscBool marked = PETSC_FALSE; 1806cd0c2139SMatthew G Knepley 1807cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1808cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1809cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1810cd0c2139SMatthew G Knepley 1811d24f5ce5SMatthew G. Knepley if ((spoint < cStart) || (spoint >= cMax)) continue; 1812cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1813cd0c2139SMatthew 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); 1814d90583fdSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1815cd0c2139SMatthew G Knepley if (val > 0) { 1816cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1817cd0c2139SMatthew G Knepley } else { 1818cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1819cd0c2139SMatthew G Knepley } 1820cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1821cd0c2139SMatthew G Knepley break; 1822cd0c2139SMatthew G Knepley } 1823cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1824370472baSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1825370472baSMatthew G. Knepley if (point < pMax[dep] && !marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1826cd0c2139SMatthew G Knepley } 1827cd0c2139SMatthew G Knepley } 1828cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1829cd0c2139SMatthew G Knepley } 1830cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1831cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 183218c5995bSMatthew G. Knepley /* If any faces touching the fault divide cells on either side, split them */ 183318c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift+dim-1, &facePosIS);CHKERRQ(ierr); 183418c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr); 183518c5995bSMatthew G. Knepley ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr); 183618c5995bSMatthew G. Knepley ierr = ISDestroy(&facePosIS);CHKERRQ(ierr); 183718c5995bSMatthew G. Knepley ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr); 183818c5995bSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 183918c5995bSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 184018c5995bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 184118c5995bSMatthew G. Knepley const PetscInt point = points[p]; 184218c5995bSMatthew G. Knepley const PetscInt *support; 184318c5995bSMatthew G. Knepley PetscInt supportSize, valA, valB; 184418c5995bSMatthew G. Knepley 184518c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 184618c5995bSMatthew G. Knepley if (supportSize != 2) continue; 184718c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 184818c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr); 184918c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr); 185018c5995bSMatthew G. Knepley if ((valA == -1) || (valB == -1)) continue; 185118c5995bSMatthew G. Knepley if (valA*valB > 0) continue; 185218c5995bSMatthew G. Knepley /* Split the face */ 185318c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr); 185418c5995bSMatthew G. Knepley ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr); 185518c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr); 1856e1757548SMatthew G. Knepley /* Label its closure: 1857e1757548SMatthew G. Knepley unmarked: label as unsplit 1858e1757548SMatthew G. Knepley incident: relabel as split 1859e1757548SMatthew G. Knepley split: do nothing 1860e1757548SMatthew G. Knepley */ 186118c5995bSMatthew G. Knepley { 186218c5995bSMatthew G. Knepley PetscInt *closure = NULL; 186318c5995bSMatthew G. Knepley PetscInt closureSize, cl; 186418c5995bSMatthew G. Knepley 186518c5995bSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 186618c5995bSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 186718c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr); 18688771c1d3SMatthew G. Knepley if (valA == -1) { /* Mark as unsplit */ 186918c5995bSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 187018c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr); 18718771c1d3SMatthew G. Knepley } else if (((valA >= shift) && (valA < shift2)) || ((valA <= -shift) && (valA > -shift2))) { 1872e1757548SMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 1873e1757548SMatthew G. Knepley ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr); 1874e1757548SMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr); 1875e1757548SMatthew G. Knepley } 187618c5995bSMatthew G. Knepley } 187718c5995bSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 187818c5995bSMatthew G. Knepley } 187918c5995bSMatthew G. Knepley } 188018c5995bSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 188118c5995bSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1882370472baSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1883cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1884cd0c2139SMatthew G Knepley } 1885cd0c2139SMatthew G Knepley 1886cd0c2139SMatthew G Knepley #undef __FUNCT__ 18873cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh" 18883cf72582SMatthew G. Knepley /*@C 18893cf72582SMatthew G. Knepley DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface 18903cf72582SMatthew G. Knepley 18913cf72582SMatthew G. Knepley Collective on dm 18923cf72582SMatthew G. Knepley 18933cf72582SMatthew G. Knepley Input Parameters: 18943cf72582SMatthew G. Knepley + dm - The original DM 18953cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices 18963cf72582SMatthew G. Knepley 18973cf72582SMatthew G. Knepley Output Parameters: 18983cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface 18993cf72582SMatthew G. Knepley - dmHybrid - The new DM 19003cf72582SMatthew G. Knepley 19013cf72582SMatthew G. Knepley Level: developer 19023cf72582SMatthew G. Knepley 19033cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate() 19043cf72582SMatthew G. Knepley @*/ 19053cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid) 19063cf72582SMatthew G. Knepley { 19073cf72582SMatthew G. Knepley DM idm; 19083cf72582SMatthew G. Knepley DMLabel subpointMap, hlabel; 19093cf72582SMatthew G. Knepley PetscInt dim; 19103cf72582SMatthew G. Knepley PetscErrorCode ierr; 19113cf72582SMatthew G. Knepley 19123cf72582SMatthew G. Knepley PetscFunctionBegin; 19133cf72582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 19143cf72582SMatthew G. Knepley if (hybridLabel) PetscValidPointer(hybridLabel, 3); 19153cf72582SMatthew G. Knepley PetscValidPointer(dmHybrid, 4); 1916c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 19173cf72582SMatthew G. Knepley ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr); 19183cf72582SMatthew G. Knepley ierr = DMPlexOrient(idm);CHKERRQ(ierr); 19193cf72582SMatthew G. Knepley ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr); 19203cf72582SMatthew G. Knepley ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr); 19213cf72582SMatthew G. Knepley ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr); 19220f66a230SMatthew G. Knepley ierr = DMPlexLabelCohesiveComplete(dm, hlabel, NULL, PETSC_FALSE, idm);CHKERRQ(ierr); 19233cf72582SMatthew G. Knepley ierr = DMDestroy(&idm);CHKERRQ(ierr); 19243cf72582SMatthew G. Knepley ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr); 19253cf72582SMatthew G. Knepley if (hybridLabel) *hybridLabel = hlabel; 192653aa2e23SMatthew G. Knepley else {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);} 1927e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1928e6ccafaeSMatthew G Knepley } 1929e6ccafaeSMatthew G Knepley 1930e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1931efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated" 1932efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 1933efa14ee0SMatthew G Knepley 1934efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 1935efa14ee0SMatthew G Knepley */ 1936830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1937efa14ee0SMatthew G Knepley { 1938fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 1939efa14ee0SMatthew G Knepley const PetscInt *subvertices; 194077d178adSMatthew G. Knepley PetscInt *pStart, *pEnd, *pMax, pSize; 1941efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1942efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1943efa14ee0SMatthew G Knepley 1944efa14ee0SMatthew G Knepley PetscFunctionBegin; 1945efa14ee0SMatthew G Knepley *numFaces = 0; 1946efa14ee0SMatthew G Knepley *nFV = 0; 1947efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1948c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 194977d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1950dcca6d9dSJed Brown ierr = PetscMalloc3(pSize,&pStart,pSize,&pEnd,pSize,&pMax);CHKERRQ(ierr); 1951d92e47f8SMatthew 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); 1952efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 1953efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1954efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1955efa14ee0SMatthew G Knepley } 1956efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1957fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1958efa14ee0SMatthew G Knepley if (subvertexIS) { 1959efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1960efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1961efa14ee0SMatthew G Knepley } 1962efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1963efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 19640298fd71SBarry Smith PetscInt *star = NULL; 1965efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 1966efa14ee0SMatthew G Knepley 1967efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1968efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1969efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1970efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1971efa14ee0SMatthew G Knepley } 1972efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 1973efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 19740298fd71SBarry Smith PetscInt *closure = NULL; 1975efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 1976efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 1977efa14ee0SMatthew G Knepley 1978efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 197965560c7fSMatthew G Knepley if (cellLoc == 2) continue; 198082f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1981efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1982efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1983efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1984efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1985efa14ee0SMatthew G Knepley 1986efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1987efa14ee0SMatthew G Knepley ++numCorners; 1988efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1989830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 1990efa14ee0SMatthew G Knepley } 1991efa14ee0SMatthew G Knepley } 199218ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 199382f516ccSBarry 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); 1994efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 1995007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 1996007baee2SMatthew G. Knepley PetscInt numCells, nc; 1997007baee2SMatthew G. Knepley 1998efa14ee0SMatthew G Knepley ++(*numFaces); 1999efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 2000efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 2001efa14ee0SMatthew G Knepley } 2002007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 2003007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 2004007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 2005007baee2SMatthew G. Knepley } 2006007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 2007efa14ee0SMatthew G Knepley } 2008efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2009efa14ee0SMatthew G Knepley } 2010efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 2011efa14ee0SMatthew G Knepley } 2012efa14ee0SMatthew G Knepley if (subvertexIS) { 2013efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 2014efa14ee0SMatthew G Knepley } 2015efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2016efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 2017efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 2018efa14ee0SMatthew G Knepley } 2019efa14ee0SMatthew G Knepley 2020efa14ee0SMatthew G Knepley #undef __FUNCT__ 2021efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated" 2022830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 2023efa14ee0SMatthew G Knepley { 202434b4c39eSMatthew G. Knepley IS subvertexIS = NULL; 2025efa14ee0SMatthew G Knepley const PetscInt *subvertices; 2026efa14ee0SMatthew G Knepley PetscInt *pStart, *pEnd, *pMax; 2027efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 2028efa14ee0SMatthew G Knepley PetscErrorCode ierr; 2029efa14ee0SMatthew G Knepley 2030efa14ee0SMatthew G Knepley PetscFunctionBegin; 2031c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2032dcca6d9dSJed Brown ierr = PetscMalloc3(dim+1,&pStart,dim+1,&pEnd,dim+1,&pMax);CHKERRQ(ierr); 20330298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 2034efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 2035efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 2036efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 2037efa14ee0SMatthew G Knepley } 2038efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 203934b4c39eSMatthew G. Knepley if (vertexLabel) { 2040830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 2041efa14ee0SMatthew G Knepley if (subvertexIS) { 2042efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 2043efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 2044efa14ee0SMatthew G Knepley } 204534b4c39eSMatthew G. Knepley } 2046efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 2047efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 20480298fd71SBarry Smith PetscInt *star = NULL; 2049efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 2050efa14ee0SMatthew G Knepley 2051efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 2052efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 2053efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 2054efa14ee0SMatthew G Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 2055efa14ee0SMatthew G Knepley } 2056efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 2057efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 20580298fd71SBarry Smith PetscInt *closure = NULL; 2059efa14ee0SMatthew G Knepley PetscInt closureSize, c; 2060efa14ee0SMatthew G Knepley PetscInt faceLoc; 2061efa14ee0SMatthew G Knepley 2062efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 2063efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 206482f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 2065efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2066efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 2067efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 2068efa14ee0SMatthew G Knepley PetscInt vertexLoc; 2069efa14ee0SMatthew G Knepley 2070efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 2071efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 2072830e53efSMatthew G. Knepley if (vertexLoc != value) break; 2073efa14ee0SMatthew G Knepley } 2074efa14ee0SMatthew G Knepley } 2075efa14ee0SMatthew G Knepley if (c == closureSize*2) { 2076efa14ee0SMatthew G Knepley const PetscInt *support; 2077efa14ee0SMatthew G Knepley PetscInt supportSize, s; 2078efa14ee0SMatthew G Knepley 2079efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 2080efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 2081efa14ee0SMatthew G Knepley 2082efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 2083efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 2084efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 2085efa14ee0SMatthew G Knepley break; 2086efa14ee0SMatthew G Knepley } 2087efa14ee0SMatthew G Knepley } 2088efa14ee0SMatthew G Knepley } 2089efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2090efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2091efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 2092efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 2093efa14ee0SMatthew G Knepley } 2094efa14ee0SMatthew G Knepley } 2095efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2096efa14ee0SMatthew G Knepley } 2097efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 2098efa14ee0SMatthew G Knepley } 209934b4c39eSMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);} 2100efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2101efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 2102efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 2103efa14ee0SMatthew G Knepley } 2104efa14ee0SMatthew G Knepley 2105efa14ee0SMatthew G Knepley #undef __FUNCT__ 2106766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated" 210727c04023SMatthew 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) 2108766ab985SMatthew G. Knepley { 210927c04023SMatthew G. Knepley DMLabel label = NULL; 2110766ab985SMatthew G. Knepley const PetscInt *cone; 211127234c99SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize; 2112766ab985SMatthew G. Knepley PetscErrorCode ierr; 2113766ab985SMatthew G. Knepley 2114812bfc34SJed Brown PetscFunctionBegin; 2115c0ed958bSJed Brown *numFaces = 0; 2116c0ed958bSJed Brown *nFV = 0; 2117c58f1c22SToby Isaac if (labelname) {ierr = DMGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 2118fed694aaSMatthew G. Knepley *subCells = NULL; 2119c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2120766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 2121766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2122766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 212327c04023SMatthew G. Knepley if (label) { 212427c04023SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 212527c04023SMatthew G. Knepley PetscInt val; 212627c04023SMatthew G. Knepley 212727c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 212827c04023SMatthew G. Knepley if (val == value) { 212927c04023SMatthew G. Knepley ++(*numFaces); 213027c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 213127c04023SMatthew G. Knepley } 213227c04023SMatthew G. Knepley } 213327c04023SMatthew G. Knepley } else { 2134766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 213527c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 213627c04023SMatthew G. Knepley } 2137766ab985SMatthew G. Knepley *nFV = hasLagrange ? coneSize/3 : coneSize/2; 2138785e854fSJed Brown ierr = PetscMalloc1(*numFaces *2, subCells);CHKERRQ(ierr); 2139766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 2140766ab985SMatthew G. Knepley const PetscInt *cells; 2141766ab985SMatthew G. Knepley PetscInt numCells; 2142766ab985SMatthew G. Knepley 214327c04023SMatthew G. Knepley if (label) { 214427c04023SMatthew G. Knepley PetscInt val; 214527c04023SMatthew G. Knepley 214627c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 214727c04023SMatthew G. Knepley if (val != value) continue; 214827c04023SMatthew G. Knepley } 2149766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2150766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 2151766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 2152766ab985SMatthew G. Knepley } 2153766ab985SMatthew G. Knepley /* Negative face */ 2154766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 215527234c99SMatthew G. Knepley /* Not true in parallel 215627234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 2157766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 2158766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 215927234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 2160766ab985SMatthew G. Knepley } 2161766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 2162766ab985SMatthew G. Knepley /* Positive face is not included */ 2163766ab985SMatthew G. Knepley } 2164766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2165766ab985SMatthew G. Knepley } 2166766ab985SMatthew G. Knepley 2167766ab985SMatthew G. Knepley #undef __FUNCT__ 2168766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated" 21693982b651SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, DMLabel label, PetscInt value, DMLabel subpointMap, DM subdm) 2170766ab985SMatthew G. Knepley { 2171766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 2172766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 2173766ab985SMatthew G. Knepley PetscErrorCode ierr; 2174766ab985SMatthew G. Knepley 2175812bfc34SJed Brown PetscFunctionBegin; 2176c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2177766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 2178766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2179766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 2180dcca6d9dSJed Brown ierr = PetscMalloc2(dim+1,&pStart,dim+1,&pEnd);CHKERRQ(ierr); 2181b3154360SMatthew G. Knepley for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);} 2182766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 2183766ab985SMatthew G. Knepley const PetscInt *cone; 2184766ab985SMatthew G. Knepley PetscInt *closure = NULL; 2185b3154360SMatthew G. Knepley PetscInt fconeSize, coneSize, closureSize, cl, val; 2186766ab985SMatthew G. Knepley 218727c04023SMatthew G. Knepley if (label) { 218827c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 218927c04023SMatthew G. Knepley if (val != value) continue; 219027c04023SMatthew G. Knepley } 2191766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2192766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2193b3154360SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr); 2194b3154360SMatthew G. Knepley if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 2195b3154360SMatthew G. Knepley /* Negative face */ 2196766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2197766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2198766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 2199766ab985SMatthew G. Knepley 2200766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2201766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 2202766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 2203766ab985SMatthew G. Knepley break; 2204766ab985SMatthew G. Knepley } 2205766ab985SMatthew G. Knepley } 2206766ab985SMatthew G. Knepley } 2207766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2208766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 2209766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 2210766ab985SMatthew G. Knepley const PetscInt *support; 2211766ab985SMatthew G. Knepley PetscInt supportSize, s; 2212766ab985SMatthew G. Knepley 2213766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 2214711de394SMatthew G. Knepley /* if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); */ 2215766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 2216766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 2217766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 2218766ab985SMatthew G. Knepley } 2219766ab985SMatthew G. Knepley } 2220766ab985SMatthew G. Knepley } 2221766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 2222766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2223766ab985SMatthew G. Knepley } 2224766ab985SMatthew G. Knepley 2225766ab985SMatthew G. Knepley #undef __FUNCT__ 2226e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation" 2227e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2228e6ccafaeSMatthew G Knepley { 222982f516ccSBarry Smith MPI_Comm comm; 2230e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 2231e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 2232e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 2233e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2234e6ccafaeSMatthew G Knepley 223582f516ccSBarry Smith PetscFunctionBegin; 223682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2237c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &cellDim);CHKERRQ(ierr); 2238e6ccafaeSMatthew G Knepley if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 2239e6ccafaeSMatthew G Knepley 2240ddeab2a6SMatthew G. Knepley if (cellDim == 1 && numCorners == 2) { 2241ddeab2a6SMatthew G. Knepley /* Triangle */ 2242e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 2243e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2244ddeab2a6SMatthew G. Knepley } else if (cellDim == 2 && numCorners == 3) { 2245ddeab2a6SMatthew G. Knepley /* Triangle */ 2246ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2247ddeab2a6SMatthew G. Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2248ddeab2a6SMatthew G. Knepley } else if (cellDim == 3 && numCorners == 4) { 2249ddeab2a6SMatthew G. Knepley /* Tetrahedron */ 2250ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2251ddeab2a6SMatthew G. Knepley posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2252e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 2253e6ccafaeSMatthew G Knepley /* Quadratic line */ 2254e6ccafaeSMatthew G Knepley faceSize = 1; 2255e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2256e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 2257e6ccafaeSMatthew G Knepley /* Quads */ 2258e6ccafaeSMatthew G Knepley faceSize = 2; 2259e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 2260e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2261e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 2262e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2263e6ccafaeSMatthew G Knepley } else { 2264e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 2265e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 2266e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 2267e6ccafaeSMatthew G Knepley } 2268e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 2269e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 2270e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2271e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 2272e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2273e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2274e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 2275e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2276e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2277e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 2278e6ccafaeSMatthew G Knepley }; 2279e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 2280e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2281e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2282e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 2283e6ccafaeSMatthew G Knepley }; 2284e6ccafaeSMatthew G Knepley 2285e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 2286e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 2287e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 2288e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 2289e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2290e6ccafaeSMatthew G Knepley 2291e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 2292e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 2293e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 2294e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 2295e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 2296e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2297e6ccafaeSMatthew G Knepley break; 2298e6ccafaeSMatthew G Knepley } 2299e6ccafaeSMatthew G Knepley } 2300e6ccafaeSMatthew G Knepley } 2301e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2302e6ccafaeSMatthew G Knepley break; 2303e6ccafaeSMatthew G Knepley } 2304e6ccafaeSMatthew G Knepley } 2305e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 2306e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2307e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2308e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 2309e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 2310e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2311e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 2312e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2313e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2314e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 2315e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2316e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2317e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2318e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 2319e6ccafaeSMatthew G Knepley }; 2320e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 2321e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2322e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2323e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2324e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 2325e6ccafaeSMatthew G Knepley }; 2326e6ccafaeSMatthew G Knepley 2327e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 2328e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 2329e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 2330e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 2331e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2332e6ccafaeSMatthew G Knepley 2333e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 2334e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 2335e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 2336e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 2337e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 2338e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2339e6ccafaeSMatthew G Knepley break; 2340e6ccafaeSMatthew G Knepley } 2341e6ccafaeSMatthew G Knepley } 2342e6ccafaeSMatthew G Knepley } 2343e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2344e6ccafaeSMatthew G Knepley break; 2345e6ccafaeSMatthew G Knepley } 2346e6ccafaeSMatthew G Knepley } 2347e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 2348e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2349e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2350e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 2351e6ccafaeSMatthew G Knepley /* Hexes 2352e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2353e6ccafaeSMatthew G Knepley pointing up at the second. 2354e6ccafaeSMatthew G Knepley 2355e6ccafaeSMatthew G Knepley 7---6 2356e6ccafaeSMatthew G Knepley /| /| 2357e6ccafaeSMatthew G Knepley 4---5 | 2358ddeab2a6SMatthew G. Knepley | 1-|-2 2359e6ccafaeSMatthew G Knepley |/ |/ 2360ddeab2a6SMatthew G. Knepley 0---3 2361e6ccafaeSMatthew G Knepley 2362e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2363e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 2364e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 2365e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2366e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 2367e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 2368e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2369ddeab2a6SMatthew G. Knepley 0, 3, 4, 5, /* front */ 2370ddeab2a6SMatthew G. Knepley 2, 3, 5, 6, /* right */ 2371ddeab2a6SMatthew G. Knepley 1, 2, 6, 7, /* back */ 2372ddeab2a6SMatthew G. Knepley 0, 1, 4, 7, /* left */ 2373e6ccafaeSMatthew G Knepley }; 2374e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 2375ddeab2a6SMatthew G. Knepley 1, 2, 3, 0, /* bottom */ 2376e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2377ddeab2a6SMatthew G. Knepley 0, 3, 5, 4, /* front */ 2378ddeab2a6SMatthew G. Knepley 3, 2, 6, 5, /* right */ 2379ddeab2a6SMatthew G. Knepley 2, 1, 7, 6, /* back */ 2380ddeab2a6SMatthew G. Knepley 1, 0, 4, 7, /* left */ 2381e6ccafaeSMatthew G Knepley }; 2382e6ccafaeSMatthew G Knepley 2383e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 2384e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 2385e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2386e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 2387e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2388e6ccafaeSMatthew G Knepley 2389e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 2390e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 2391e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 2392e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 2393e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 2394e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 2395e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 2396e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2397e6ccafaeSMatthew G Knepley break; 2398e6ccafaeSMatthew G Knepley } 2399e6ccafaeSMatthew G Knepley } 2400e6ccafaeSMatthew G Knepley } 2401e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2402e6ccafaeSMatthew G Knepley break; 2403e6ccafaeSMatthew G Knepley } 2404e6ccafaeSMatthew G Knepley } 2405e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2406e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2407e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2408e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 2409e6ccafaeSMatthew G Knepley /* Quadratic tet */ 2410e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 2411e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 2412e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 2413e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2414e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 2415e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2416e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 2417e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 2418e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 2419e6ccafaeSMatthew G Knepley }; 2420e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 2421e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2422e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 2423e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 2424e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 2425e6ccafaeSMatthew G Knepley }; 2426e6ccafaeSMatthew G Knepley 2427e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 2428e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 2429e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 2430e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 2431e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2432e6ccafaeSMatthew G Knepley 2433e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 2434e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 2435e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 2436e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 2437e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 2438e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 2439e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 2440e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2441e6ccafaeSMatthew G Knepley break; 2442e6ccafaeSMatthew G Knepley } 2443e6ccafaeSMatthew G Knepley } 2444e6ccafaeSMatthew G Knepley } 2445e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2446e6ccafaeSMatthew G Knepley break; 2447e6ccafaeSMatthew G Knepley } 2448e6ccafaeSMatthew G Knepley } 2449e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 2450e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2451e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2452e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 2453e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 2454e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2455e6ccafaeSMatthew G Knepley pointing up at the second. 2456e6ccafaeSMatthew G Knepley 2457e6ccafaeSMatthew G Knepley 7---6 2458e6ccafaeSMatthew G Knepley /| /| 2459e6ccafaeSMatthew G Knepley 4---5 | 2460e6ccafaeSMatthew G Knepley | 3-|-2 2461e6ccafaeSMatthew G Knepley |/ |/ 2462e6ccafaeSMatthew G Knepley 0---1 2463e6ccafaeSMatthew G Knepley 2464e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2465e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 2466e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 2467e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2468e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 2469e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 2470e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2471e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 2472e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 2473e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 2474e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 2475e6ccafaeSMatthew G Knepley }; 2476e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 2477e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 2478e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2479e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 2480e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 2481e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 2482e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 2483e6ccafaeSMatthew G Knepley }; 2484e6ccafaeSMatthew G Knepley 2485e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 2486e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 2487e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2488e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 2489e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2490e6ccafaeSMatthew G Knepley 2491e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 2492e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 2493e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 2494e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 2495e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 2496e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 2497e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 2498e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2499e6ccafaeSMatthew G Knepley break; 2500e6ccafaeSMatthew G Knepley } 2501e6ccafaeSMatthew G Knepley } 2502e6ccafaeSMatthew G Knepley } 2503e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2504e6ccafaeSMatthew G Knepley break; 2505e6ccafaeSMatthew G Knepley } 2506e6ccafaeSMatthew G Knepley } 2507e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2508e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2509e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2510e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 2511e6ccafaeSMatthew G Knepley if (!posOrient) { 2512e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 2513e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 2514e6ccafaeSMatthew G Knepley } else { 2515e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 2516e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 2517e6ccafaeSMatthew G Knepley } 2518e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 2519e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2520e6ccafaeSMatthew G Knepley } 2521e6ccafaeSMatthew G Knepley 2522e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2523e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace" 2524e6ccafaeSMatthew G Knepley /* 2525e6ccafaeSMatthew G Knepley Given a cell and a face, as a set of vertices, 2526e6ccafaeSMatthew G Knepley return the oriented face, as a set of vertices, in faceVertices 2527e6ccafaeSMatthew G Knepley The orientation is such that the face normal points out of the cell 2528e6ccafaeSMatthew G Knepley */ 2529e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2530e6ccafaeSMatthew G Knepley { 25310298fd71SBarry Smith const PetscInt *cone = NULL; 2532e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 2533e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 2534e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2535e6ccafaeSMatthew G Knepley 2536e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2537e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 2538e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 2539e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 2540e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2541e6ccafaeSMatthew G Knepley 2542e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 2543e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 2544e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 2545e6ccafaeSMatthew G Knepley } 2546e6ccafaeSMatthew G Knepley } 2547e6ccafaeSMatthew G Knepley if (found) { 2548e6ccafaeSMatthew G Knepley indices[v2] = v; 2549e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 2550e6ccafaeSMatthew G Knepley ++v2; 2551e6ccafaeSMatthew G Knepley } else { 2552e6ccafaeSMatthew G Knepley oppositeVertex = v; 2553e6ccafaeSMatthew G Knepley } 2554e6ccafaeSMatthew G Knepley } 2555e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 2556e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2557e6ccafaeSMatthew G Knepley } 2558e6ccafaeSMatthew G Knepley 2559e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2560cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal" 2561e6ccafaeSMatthew G Knepley /* 2562cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 2563e6ccafaeSMatthew G Knepley 2564e6ccafaeSMatthew G Knepley Not collective 2565e6ccafaeSMatthew G Knepley 2566e6ccafaeSMatthew G Knepley Input Parameters: 2567e6ccafaeSMatthew G Knepley + dm - The DMPlex 2568e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 2569e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 2570e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 2571e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 2572e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 2573e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 2574e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 2575e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 2576e6ccafaeSMatthew G Knepley 2577e6ccafaeSMatthew G Knepley Output Parameters: 2578e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 2579e6ccafaeSMatthew G Knepley 2580e6ccafaeSMatthew G Knepley Level: developer 2581e6ccafaeSMatthew G Knepley */ 2582cd0c2139SMatthew 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) 2583e6ccafaeSMatthew G Knepley { 258482f516ccSBarry Smith MPI_Comm comm; 2585e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 2586e6ccafaeSMatthew G Knepley const PetscInt *faces; 2587e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 2588e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2589e6ccafaeSMatthew G Knepley 2590e6ccafaeSMatthew G Knepley PetscFunctionBegin; 259182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2592e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 2593e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 2594e6ccafaeSMatthew G Knepley #if 0 2595e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 2596e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2597e6ccafaeSMatthew G Knepley #else 2598e6ccafaeSMatthew G Knepley { 2599e6ccafaeSMatthew G Knepley PetscInt f; 2600e6ccafaeSMatthew G Knepley 2601e6ccafaeSMatthew G Knepley numFaces = 0; 2602e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2603e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 2604e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 2605e6ccafaeSMatthew G Knepley 2606e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 2607e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 2608e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 2609e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 2610e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 2611e6ccafaeSMatthew G Knepley PetscInt v; 2612e6ccafaeSMatthew G Knepley 2613e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2614e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 2615e6ccafaeSMatthew G Knepley } 2616e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 2617e6ccafaeSMatthew G Knepley } 2618e6ccafaeSMatthew G Knepley if (d == dof) { 2619e6ccafaeSMatthew G Knepley numFaces = 1; 2620e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 2621e6ccafaeSMatthew G Knepley } 2622e6ccafaeSMatthew G Knepley } 2623e6ccafaeSMatthew G Knepley } 2624e6ccafaeSMatthew G Knepley #endif 2625e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 2626e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 2627e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 2628766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 2629e6ccafaeSMatthew G Knepley } else { 2630e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 2631e6ccafaeSMatthew G Knepley PetscBool posOriented; 2632e6ccafaeSMatthew G Knepley 2633e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2634e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 2635e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 2636e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 2637e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 2638e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 2639e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2640e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 2641e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 2642e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 2643e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 2644e6ccafaeSMatthew G Knepley break; 2645e6ccafaeSMatthew G Knepley } 2646e6ccafaeSMatthew G Knepley } 2647e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 2648e6ccafaeSMatthew G Knepley } 2649e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 2650e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 2651e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2652e6ccafaeSMatthew G Knepley ++(*newFacePoint); 2653e6ccafaeSMatthew G Knepley } 2654ef07cca7SMatthew G. Knepley #if 0 2655e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2656ef07cca7SMatthew G. Knepley #else 2657ef07cca7SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2658ef07cca7SMatthew G. Knepley #endif 2659e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2660e6ccafaeSMatthew G Knepley } 2661e6ccafaeSMatthew G Knepley 2662e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2663e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated" 266453156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2665e6ccafaeSMatthew G Knepley { 266682f516ccSBarry Smith MPI_Comm comm; 266753156dfcSMatthew G. Knepley DMLabel subpointMap; 2668efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 2669efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 2670efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 2671fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 2672efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 2673e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2674e6ccafaeSMatthew G Knepley 2675e6ccafaeSMatthew G Knepley PetscFunctionBegin; 267682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2677efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2678efa14ee0SMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2679efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2680efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 268153156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);} 2682efa14ee0SMatthew G Knepley /* Setup chart */ 2683efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2684efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2685efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2686efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2687e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2688e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 2689efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 2690e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 2691efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2692efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2693efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 2694efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2695e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2696e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2697e6ccafaeSMatthew G Knepley } 2698e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2699e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2700e6ccafaeSMatthew G Knepley } 2701e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2702e6ccafaeSMatthew G Knepley /* Create face cones */ 2703efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 27040298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2705efa14ee0SMatthew G Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2706e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2707e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 2708efa14ee0SMatthew G Knepley const PetscInt subcell = c; 27090298fd71SBarry Smith PetscInt *closure = NULL; 2710efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 2711e6ccafaeSMatthew G Knepley 2712e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2713efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2714efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 2715e6ccafaeSMatthew G Knepley PetscInt subVertex; 2716e6ccafaeSMatthew G Knepley 2717efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 2718efa14ee0SMatthew G Knepley ++numCorners; 2719efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 2720efa14ee0SMatthew G Knepley if (subVertex >= 0) { 2721efa14ee0SMatthew G Knepley closure[faceSize] = point; 272265560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 2723e6ccafaeSMatthew G Knepley ++faceSize; 2724e6ccafaeSMatthew G Knepley } 2725e6ccafaeSMatthew G Knepley } 2726e6ccafaeSMatthew G Knepley } 2727efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 2728efa14ee0SMatthew G Knepley if (faceSize == nFV) { 2729cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 2730e6ccafaeSMatthew G Knepley } 273165560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2732e6ccafaeSMatthew G Knepley } 2733efa14ee0SMatthew G Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2734e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2735e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2736e6ccafaeSMatthew G Knepley /* Build coordinates */ 2737efa14ee0SMatthew G Knepley { 2738efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 2739efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 2740efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 2741285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 274224640c55SToby Isaac const char *name; 2743efa14ee0SMatthew G Knepley 274469d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2745e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 274669d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2747285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2748285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2749285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2750efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2751efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2752efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2753efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2754efa14ee0SMatthew G Knepley PetscInt dof; 2755efa14ee0SMatthew G Knepley 2756efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2757efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2758285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2759e6ccafaeSMatthew G Knepley } 2760e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2761e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2762e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 276324640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 276424640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr); 2765e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 27662eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2767830e53efSMatthew G. Knepley if (coordSize) { 2768e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2769e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2770efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2771efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2772efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2773efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2774e6ccafaeSMatthew G Knepley 2775e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2776e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2777efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2778efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2779efa14ee0SMatthew 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); 2780e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2781e6ccafaeSMatthew G Knepley } 2782e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2783e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 27843b399e24SMatthew G. Knepley } 2785e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2786e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2787e6ccafaeSMatthew G Knepley } 2788efa14ee0SMatthew G Knepley /* Cleanup */ 2789efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2790efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2791efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2792efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2793e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2794e6ccafaeSMatthew G Knepley } 2795e6ccafaeSMatthew G Knepley 2796e6ccafaeSMatthew G Knepley #undef __FUNCT__ 27973982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal" 27983982b651SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 27993982b651SMatthew G. Knepley { 28003982b651SMatthew G. Knepley PetscInt subPoint; 28013982b651SMatthew G. Knepley PetscErrorCode ierr; 28023982b651SMatthew G. Knepley 28033982b651SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 28043982b651SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 28053982b651SMatthew G. Knepley } 28063982b651SMatthew G. Knepley 28073982b651SMatthew G. Knepley #undef __FUNCT__ 28083982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateSubmeshGeneric_Interpolated" 2809bec263e5SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmeshGeneric_Interpolated(DM dm, DMLabel label, PetscInt value, PetscBool isCohesive, PetscInt cellHeight, DM subdm) 2810e6ccafaeSMatthew G Knepley { 281182f516ccSBarry Smith MPI_Comm comm; 281253156dfcSMatthew G. Knepley DMLabel subpointMap; 2813efa14ee0SMatthew G Knepley IS *subpointIS; 2814efa14ee0SMatthew G Knepley const PetscInt **subpoints; 28153982b651SMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *orntNew; 2816efa14ee0SMatthew G Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2817e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2818e6ccafaeSMatthew G Knepley 2819e6ccafaeSMatthew G Knepley PetscFunctionBegin; 282082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2821efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2822e6ccafaeSMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2823efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2824bec263e5SMatthew G. Knepley if (cellHeight) { 28253982b651SMatthew G. Knepley if (isCohesive) {ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);} 28263982b651SMatthew G. Knepley else {ierr = DMPlexMarkSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);} 2827bec263e5SMatthew G. Knepley } else { 2828bec263e5SMatthew G. Knepley DMLabel depth; 2829bec263e5SMatthew G. Knepley IS pointIS; 2830bec263e5SMatthew G. Knepley const PetscInt *points; 2831bec263e5SMatthew G. Knepley PetscInt numPoints; 2832bec263e5SMatthew G. Knepley 2833bec263e5SMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depth);CHKERRQ(ierr); 2834bec263e5SMatthew G. Knepley ierr = DMLabelGetStratumSize(label, value, &numPoints);CHKERRQ(ierr); 2835bec263e5SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, value, &pointIS);CHKERRQ(ierr); 2836bec263e5SMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 2837bec263e5SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 2838bec263e5SMatthew G. Knepley PetscInt *closure = NULL; 2839bec263e5SMatthew G. Knepley PetscInt closureSize, c, pdim; 2840bec263e5SMatthew G. Knepley 2841bec263e5SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2842bec263e5SMatthew G. Knepley for (c = 0; c < closureSize*2; c += 2) { 2843bec263e5SMatthew G. Knepley ierr = DMLabelGetValue(depth, closure[c], &pdim);CHKERRQ(ierr); 2844bec263e5SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, closure[c], pdim);CHKERRQ(ierr); 2845bec263e5SMatthew G. Knepley } 2846bec263e5SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2847bec263e5SMatthew G. Knepley } 2848bec263e5SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 2849bec263e5SMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 2850bec263e5SMatthew G. Knepley } 2851bec263e5SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 2852efa14ee0SMatthew G Knepley /* Setup chart */ 2853c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2854dcca6d9dSJed Brown ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr); 2855e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2856e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2857e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 2858e6ccafaeSMatthew G Knepley } 2859e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2860bec263e5SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, cellHeight);CHKERRQ(ierr); 2861e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2862e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 2863e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2864e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2865e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2866e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2867e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 28680ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2869e6ccafaeSMatthew G Knepley } 2870e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2871e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2872e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2873e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2874e6ccafaeSMatthew G Knepley const PetscInt *cone; 2875e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 2876e6ccafaeSMatthew G Knepley 2877e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2878e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2879bec263e5SMatthew G. Knepley if (cellHeight && (d == dim)) { 2880e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2881e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2882e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2883e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 2884e6ccafaeSMatthew G Knepley } 2885e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2886e6ccafaeSMatthew G Knepley } 2887e6ccafaeSMatthew G Knepley } 2888e6ccafaeSMatthew G Knepley } 2889e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2890e6ccafaeSMatthew G Knepley /* Set cones */ 28910298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 28923982b651SMatthew G. Knepley ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&orntNew);CHKERRQ(ierr); 2893e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2894e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2895e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2896e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 28970e49e2e2SMatthew G. Knepley const PetscInt *cone, *ornt; 2898e6ccafaeSMatthew G Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2899e6ccafaeSMatthew G Knepley 2900e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2901e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2902e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 29030e49e2e2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2904e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2905e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 290601a2673eSMatthew G. Knepley if (subc >= 0) { 290701a2673eSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 29083982b651SMatthew G. Knepley orntNew[coneSizeNew] = ornt[c]; 290901a2673eSMatthew G. Knepley ++coneSizeNew; 291001a2673eSMatthew G. Knepley } 2911e6ccafaeSMatthew G Knepley } 2912e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2913e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 29143982b651SMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, orntNew);CHKERRQ(ierr); 2915e6ccafaeSMatthew G Knepley } 2916e6ccafaeSMatthew G Knepley } 29173982b651SMatthew G. Knepley ierr = PetscFree2(coneNew,orntNew);CHKERRQ(ierr); 2918e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2919e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2920e6ccafaeSMatthew G Knepley /* Build coordinates */ 2921e6ccafaeSMatthew G Knepley { 2922e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 2923e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 2924e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 2925285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 292624640c55SToby Isaac const char *name; 2927e6ccafaeSMatthew G Knepley 292869d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2929e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 293069d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2931285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2932285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2933285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2934e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2935e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2936e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2937e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2938e6ccafaeSMatthew G Knepley PetscInt dof; 2939e6ccafaeSMatthew G Knepley 2940e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2941e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2942285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2943e6ccafaeSMatthew G Knepley } 2944e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2945e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2946e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 294724640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 294824640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr); 2949e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 29502eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2951e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2952e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2953e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2954e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2955e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2956e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2957e6ccafaeSMatthew G Knepley 2958e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2959e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2960e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2961e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2962e6ccafaeSMatthew 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); 2963efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2964e6ccafaeSMatthew G Knepley } 2965e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2966e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2967e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2968e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2969e6ccafaeSMatthew G Knepley } 29703982b651SMatthew G. Knepley /* Build SF: We need this complexity because subpoints might not be selected on the owning process */ 29713982b651SMatthew G. Knepley { 29723982b651SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 29733982b651SMatthew G. Knepley IS subpIS; 29743982b651SMatthew G. Knepley const PetscSFNode *remotePoints; 29753982b651SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 29763982b651SMatthew G. Knepley const PetscInt *localPoints, *subpoints; 29773982b651SMatthew G. Knepley PetscInt *slocalPoints; 29783982b651SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubpoints = 0, numSubroots, numSubleaves = 0, l, sl, ll, pStart, pEnd, p; 29793982b651SMatthew G. Knepley PetscMPIInt rank; 29803982b651SMatthew G. Knepley 29813982b651SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 29823982b651SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 29833982b651SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 29843982b651SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 29853982b651SMatthew G. Knepley ierr = DMPlexGetChart(subdm, NULL, &numSubroots);CHKERRQ(ierr); 29863982b651SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpIS);CHKERRQ(ierr); 29873982b651SMatthew G. Knepley if (subpIS) { 29883982b651SMatthew G. Knepley ierr = ISGetIndices(subpIS, &subpoints);CHKERRQ(ierr); 29893982b651SMatthew G. Knepley ierr = ISGetLocalSize(subpIS, &numSubpoints);CHKERRQ(ierr); 29903982b651SMatthew G. Knepley } 29913982b651SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 29923982b651SMatthew G. Knepley if (numRoots >= 0) { 29933982b651SMatthew G. Knepley ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 29943982b651SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 29953982b651SMatthew G. Knepley newLocalPoints[p].rank = -2; 29963982b651SMatthew G. Knepley newLocalPoints[p].index = -2; 29973982b651SMatthew G. Knepley } 29983982b651SMatthew G. Knepley /* Set subleaves */ 29993982b651SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 30003982b651SMatthew G. Knepley const PetscInt point = localPoints[l]; 30013982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 30023982b651SMatthew G. Knepley 30033982b651SMatthew G. Knepley if (subpoint < 0) continue; 30043982b651SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 30053982b651SMatthew G. Knepley newLocalPoints[point-pStart].index = subpoint; 30063982b651SMatthew G. Knepley ++numSubleaves; 30073982b651SMatthew G. Knepley } 30083982b651SMatthew G. Knepley /* Must put in owned subpoints */ 30093982b651SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 30103982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(p, 0, numSubpoints, subpoints); 30113982b651SMatthew G. Knepley 30123982b651SMatthew G. Knepley if (subpoint < 0) { 30133982b651SMatthew G. Knepley newOwners[p-pStart].rank = -3; 30143982b651SMatthew G. Knepley newOwners[p-pStart].index = -3; 30153982b651SMatthew G. Knepley } else { 30163982b651SMatthew G. Knepley newOwners[p-pStart].rank = rank; 30173982b651SMatthew G. Knepley newOwners[p-pStart].index = subpoint; 30183982b651SMatthew G. Knepley } 30193982b651SMatthew G. Knepley } 30203982b651SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 30213982b651SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 30223982b651SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 30233982b651SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 30243982b651SMatthew G. Knepley ierr = PetscMalloc1(numSubleaves, &slocalPoints);CHKERRQ(ierr); 30253982b651SMatthew G. Knepley ierr = PetscMalloc1(numSubleaves, &sremotePoints);CHKERRQ(ierr); 30263982b651SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 30273982b651SMatthew G. Knepley const PetscInt point = localPoints[l]; 30283982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 30293982b651SMatthew G. Knepley 30303982b651SMatthew G. Knepley if (subpoint < 0) continue; 30313982b651SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 30323982b651SMatthew G. Knepley slocalPoints[sl] = subpoint; 30333982b651SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 30343982b651SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 30353982b651SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 30363982b651SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 30373982b651SMatthew G. Knepley ++sl; 30383982b651SMatthew G. Knepley } 30393982b651SMatthew G. Knepley if (sl + ll != numSubleaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubleaves); 30403982b651SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 30413982b651SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubroots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 30423982b651SMatthew G. Knepley } 30433982b651SMatthew G. Knepley if (subpIS) { 30443982b651SMatthew G. Knepley ierr = ISRestoreIndices(subpIS, &subpoints);CHKERRQ(ierr); 30453982b651SMatthew G. Knepley ierr = ISDestroy(&subpIS);CHKERRQ(ierr); 30463982b651SMatthew G. Knepley } 30473982b651SMatthew G. Knepley } 3048efa14ee0SMatthew G Knepley /* Cleanup */ 3049e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 30500ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 3051e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 3052e6ccafaeSMatthew G Knepley } 3053efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 3054e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3055e6ccafaeSMatthew G Knepley } 3056e6ccafaeSMatthew G Knepley 3057e6ccafaeSMatthew G Knepley #undef __FUNCT__ 30583982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated" 30593982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 30603982b651SMatthew G. Knepley { 30613982b651SMatthew G. Knepley PetscErrorCode ierr; 30623982b651SMatthew G. Knepley 30633982b651SMatthew G. Knepley PetscFunctionBegin; 3064bec263e5SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, vertexLabel, value, PETSC_FALSE, 1, subdm);CHKERRQ(ierr); 30653982b651SMatthew G. Knepley PetscFunctionReturn(0); 30663982b651SMatthew G. Knepley } 30673982b651SMatthew G. Knepley 30683982b651SMatthew G. Knepley #undef __FUNCT__ 3069e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh" 3070d0fa310fSMatthew G. Knepley /*@ 3071e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 3072e6ccafaeSMatthew G Knepley 3073e6ccafaeSMatthew G Knepley Input Parameters: 3074e6ccafaeSMatthew G Knepley + dm - The original mesh 3075830e53efSMatthew G. Knepley . vertexLabel - The DMLabel marking vertices contained in the surface 3076830e53efSMatthew G. Knepley - value - The label value to use 3077e6ccafaeSMatthew G Knepley 3078e6ccafaeSMatthew G Knepley Output Parameter: 3079e6ccafaeSMatthew G Knepley . subdm - The surface mesh 3080e6ccafaeSMatthew G Knepley 3081e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3082e6ccafaeSMatthew G Knepley 3083e6ccafaeSMatthew G Knepley Level: developer 3084e6ccafaeSMatthew G Knepley 3085c58f1c22SToby Isaac .seealso: DMPlexGetSubpointMap(), DMGetLabel(), DMLabelSetValue() 3086830e53efSMatthew G. Knepley @*/ 308753156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm) 3088e6ccafaeSMatthew G Knepley { 3089e6ccafaeSMatthew G Knepley PetscInt dim, depth; 3090e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3091e6ccafaeSMatthew G Knepley 3092e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3093e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3094766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 3095c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3096e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 309782f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 3098e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3099c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr); 3100e6ccafaeSMatthew G Knepley if (depth == dim) { 3101830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 3102e6ccafaeSMatthew G Knepley } else { 3103830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 3104e6ccafaeSMatthew G Knepley } 3105e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3106e6ccafaeSMatthew G Knepley } 3107e6ccafaeSMatthew G Knepley 3108e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3109766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated" 311027c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 3111766ab985SMatthew G. Knepley { 3112766ab985SMatthew G. Knepley MPI_Comm comm; 3113766ab985SMatthew G. Knepley DMLabel subpointMap; 3114766ab985SMatthew G. Knepley IS subvertexIS; 3115766ab985SMatthew G. Knepley const PetscInt *subVertices; 3116fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 3117766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 311887feddfdSMatthew G. Knepley PetscInt cMax, c, f; 3119766ab985SMatthew G. Knepley PetscErrorCode ierr; 3120766ab985SMatthew G. Knepley 3121766ab985SMatthew G. Knepley PetscFunctionBegin; 3122766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 3123766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 3124766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 3125766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 3126766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 312727c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 3128766ab985SMatthew G. Knepley /* Setup chart */ 3129766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 3130766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 3131766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 3132766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 3133766ab985SMatthew G. Knepley /* Set cone sizes */ 3134766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 3135766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 3136766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 3137766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 3138766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 3139766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 3140766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 3141766ab985SMatthew G. Knepley } 3142766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 3143766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 3144766ab985SMatthew G. Knepley } 3145766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 3146766ab985SMatthew G. Knepley /* Create face cones */ 3147766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 314887feddfdSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 3149766ab985SMatthew G. Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 3150766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 3151766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 3152766ab985SMatthew G. Knepley const PetscInt subcell = c; 315387feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 315487feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 3155766ab985SMatthew G. Knepley 315687feddfdSMatthew G. Knepley if (cell < cMax) continue; 315787feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 315887feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 315987feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 316087feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 316187feddfdSMatthew G. Knepley } 316287feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 316387feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 316487feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 316527234c99SMatthew G. Knepley /* Not true in parallel 316627234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 316787feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 316887feddfdSMatthew G. Knepley PetscInt negsubcell; 3169766ab985SMatthew G. Knepley 317087feddfdSMatthew G. Knepley if (cells[p] >= cMax) continue; 317187feddfdSMatthew G. Knepley /* I know this is a crap search */ 317287feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 317387feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 3174766ab985SMatthew G. Knepley } 317587feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 317687feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 3177766ab985SMatthew G. Knepley } 317887feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 317987feddfdSMatthew G. Knepley ++newFacePoint; 3180766ab985SMatthew G. Knepley } 3181766ab985SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 3182766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 3183766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 3184766ab985SMatthew G. Knepley /* Build coordinates */ 3185766ab985SMatthew G. Knepley { 3186766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 3187766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 3188766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 3189285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 319024640c55SToby Isaac const char *name; 3191766ab985SMatthew G. Knepley 319269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3193766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 319469d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 3195285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 3196285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 3197285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 3198766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 3199766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 3200766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 3201766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 3202766ab985SMatthew G. Knepley PetscInt dof; 3203766ab985SMatthew G. Knepley 3204766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3205766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 3206285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 3207766ab985SMatthew G. Knepley } 3208766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 3209766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 3210766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 321124640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 321224640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr); 3213766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 32142eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 3215766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 3216766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3217766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 3218766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 3219766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 3220766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 3221766ab985SMatthew G. Knepley 3222766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3223766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 3224766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 3225766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 3226766ab985SMatthew 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); 3227766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 3228766ab985SMatthew G. Knepley } 3229766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3230766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3231766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 3232766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 3233766ab985SMatthew G. Knepley } 3234aca35d17SMatthew G. Knepley /* Build SF */ 3235aca35d17SMatthew G. Knepley CHKMEMQ; 3236aca35d17SMatthew G. Knepley { 3237aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 3238aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 3239bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 3240aca35d17SMatthew G. Knepley const PetscInt *localPoints; 3241bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 324249c26ae4SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 3243bdcf2095SMatthew G. Knepley PetscMPIInt rank; 3244aca35d17SMatthew G. Knepley 3245bdcf2095SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 3246aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 3247aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 3248aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3249aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3250aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 3251aca35d17SMatthew G. Knepley if (numRoots >= 0) { 3252aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 3253dcca6d9dSJed Brown ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 3254bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 3255bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 3256bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 3257bdcf2095SMatthew G. Knepley } 32589e0823b2SMatthew G. Knepley /* Set subleaves */ 3259aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 3260aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 3261bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 3262aca35d17SMatthew G. Knepley 3263aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 3264bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 3265bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 3266bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 3267bdcf2095SMatthew G. Knepley ++numSubLeaves; 3268aca35d17SMatthew G. Knepley } 32699e0823b2SMatthew G. Knepley /* Must put in owned subpoints */ 32709e0823b2SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 32719e0823b2SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 32729e0823b2SMatthew G. Knepley 32739e0823b2SMatthew G. Knepley if (subPoint < 0) { 32749e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = -3; 32759e0823b2SMatthew G. Knepley newOwners[p-pStart].index = -3; 32769e0823b2SMatthew G. Knepley } else { 32779e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = rank; 32789e0823b2SMatthew G. Knepley newOwners[p-pStart].index = subPoint; 32799e0823b2SMatthew G. Knepley } 3280bdcf2095SMatthew G. Knepley } 3281bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3282bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3283bdcf2095SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3284bdcf2095SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3285785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &slocalPoints);CHKERRQ(ierr); 3286785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &sremotePoints);CHKERRQ(ierr); 328749c26ae4SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 3288bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 3289bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 3290aca35d17SMatthew G. Knepley 3291aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 329249c26ae4SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 3293aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 3294bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 3295bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 3296bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 3297bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 3298aca35d17SMatthew G. Knepley ++sl; 3299aca35d17SMatthew G. Knepley } 3300bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 330149c26ae4SMatthew G. Knepley if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 330249c26ae4SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 3303aca35d17SMatthew G. Knepley } 3304aca35d17SMatthew G. Knepley } 3305aca35d17SMatthew G. Knepley CHKMEMQ; 3306766ab985SMatthew G. Knepley /* Cleanup */ 3307766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 3308766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 3309766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 3310766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3311766ab985SMatthew G. Knepley } 3312766ab985SMatthew G. Knepley 3313766ab985SMatthew G. Knepley #undef __FUNCT__ 3314766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated" 33153982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DM subdm) 3316766ab985SMatthew G. Knepley { 33173982b651SMatthew G. Knepley DMLabel label = NULL; 3318766ab985SMatthew G. Knepley PetscErrorCode ierr; 3319766ab985SMatthew G. Knepley 3320766ab985SMatthew G. Knepley PetscFunctionBegin; 3321c58f1c22SToby Isaac if (labelname) {ierr = DMGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 3322bec263e5SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, label, value, PETSC_TRUE, 1, subdm);CHKERRQ(ierr); 3323766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3324766ab985SMatthew G. Knepley } 3325766ab985SMatthew G. Knepley 3326766ab985SMatthew G. Knepley #undef __FUNCT__ 3327766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh" 3328766ab985SMatthew G. Knepley /* 332927c04023SMatthew 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. 3330766ab985SMatthew G. Knepley 3331766ab985SMatthew G. Knepley Input Parameters: 3332766ab985SMatthew G. Knepley + dm - The original mesh 333327c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 33347afc1a8bSJed Brown . label - A label name, or NULL 333527c04023SMatthew G. Knepley - value - A label value 3336766ab985SMatthew G. Knepley 3337766ab985SMatthew G. Knepley Output Parameter: 3338766ab985SMatthew G. Knepley . subdm - The surface mesh 3339766ab985SMatthew G. Knepley 3340766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3341766ab985SMatthew G. Knepley 3342766ab985SMatthew G. Knepley Level: developer 3343766ab985SMatthew G. Knepley 3344766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 3345766ab985SMatthew G. Knepley */ 334627c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 3347766ab985SMatthew G. Knepley { 3348766ab985SMatthew G. Knepley PetscInt dim, depth; 3349766ab985SMatthew G. Knepley PetscErrorCode ierr; 3350766ab985SMatthew G. Knepley 3351766ab985SMatthew G. Knepley PetscFunctionBegin; 3352766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 335327c04023SMatthew G. Knepley PetscValidPointer(subdm, 5); 3354c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3355766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3356766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 3357766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3358c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr); 3359766ab985SMatthew G. Knepley if (depth == dim) { 3360b3154360SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr); 3361766ab985SMatthew G. Knepley } else { 336227c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 3363e6ccafaeSMatthew G Knepley } 3364e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3365e6ccafaeSMatthew G Knepley } 3366e6ccafaeSMatthew G Knepley 3367e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3368bec263e5SMatthew G. Knepley #define __FUNCT__ "DMPlexFilter" 3369bec263e5SMatthew G. Knepley /*@ 3370bec263e5SMatthew G. Knepley DMPlexFilter - Extract a subset of mesh cells defined by a label as a separate mesh 3371bec263e5SMatthew G. Knepley 3372bec263e5SMatthew G. Knepley Input Parameters: 3373bec263e5SMatthew G. Knepley + dm - The original mesh 3374bec263e5SMatthew G. Knepley . cellLabel - The DMLabel marking cells contained in the new mesh 3375bec263e5SMatthew G. Knepley - value - The label value to use 3376bec263e5SMatthew G. Knepley 3377bec263e5SMatthew G. Knepley Output Parameter: 3378bec263e5SMatthew G. Knepley . subdm - The new mesh 3379bec263e5SMatthew G. Knepley 3380bec263e5SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3381bec263e5SMatthew G. Knepley 3382bec263e5SMatthew G. Knepley Level: developer 3383bec263e5SMatthew G. Knepley 3384c58f1c22SToby Isaac .seealso: DMPlexGetSubpointMap(), DMGetLabel(), DMLabelSetValue() 3385bec263e5SMatthew G. Knepley @*/ 3386bec263e5SMatthew G. Knepley PetscErrorCode DMPlexFilter(DM dm, DMLabel cellLabel, PetscInt value, DM *subdm) 3387bec263e5SMatthew G. Knepley { 3388bec263e5SMatthew G. Knepley PetscInt dim; 3389bec263e5SMatthew G. Knepley PetscErrorCode ierr; 3390bec263e5SMatthew G. Knepley 3391bec263e5SMatthew G. Knepley PetscFunctionBegin; 3392bec263e5SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3393bec263e5SMatthew G. Knepley PetscValidPointer(subdm, 3); 3394bec263e5SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3395bec263e5SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject) dm), subdm);CHKERRQ(ierr); 3396bec263e5SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3397bec263e5SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim);CHKERRQ(ierr); 3398bec263e5SMatthew G. Knepley /* Extract submesh in place, could be empty on some procs, could have inconsistency if procs do not both extract a shared cell */ 3399bec263e5SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, cellLabel, value, PETSC_FALSE, 0, *subdm);CHKERRQ(ierr); 3400bec263e5SMatthew G. Knepley PetscFunctionReturn(0); 3401bec263e5SMatthew G. Knepley } 3402bec263e5SMatthew G. Knepley 3403bec263e5SMatthew G. Knepley #undef __FUNCT__ 3404e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap" 340564beef6dSMatthew G. Knepley /*@ 340664beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 340764beef6dSMatthew G. Knepley 340864beef6dSMatthew G. Knepley Input Parameter: 340964beef6dSMatthew G. Knepley . dm - The submesh DM 341064beef6dSMatthew G. Knepley 341164beef6dSMatthew G. Knepley Output Parameter: 341264beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 341364beef6dSMatthew G. Knepley 341464beef6dSMatthew G. Knepley Level: developer 341564beef6dSMatthew G. Knepley 341664beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 341764beef6dSMatthew G. Knepley @*/ 3418e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 3419e6ccafaeSMatthew G Knepley { 3420e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3421e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3422e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 342365663942SMatthew G. Knepley *subpointMap = ((DM_Plex*) dm->data)->subpointMap; 3424e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3425e6ccafaeSMatthew G Knepley } 3426e6ccafaeSMatthew G Knepley 3427e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3428e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap" 3429e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */ 3430e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 3431e6ccafaeSMatthew G Knepley { 3432e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 3433285d324eSMatthew G. Knepley DMLabel tmp; 3434e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3435e6ccafaeSMatthew G Knepley 3436e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3437e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3438285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 3439e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 3440285d324eSMatthew G. Knepley ++mesh->subpointMap->refct; 3441285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 3442e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3443e6ccafaeSMatthew G Knepley } 3444e6ccafaeSMatthew G Knepley 3445e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3446e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS" 344764beef6dSMatthew G. Knepley /*@ 3448e6ccafaeSMatthew G Knepley DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 3449e6ccafaeSMatthew G Knepley 3450e6ccafaeSMatthew G Knepley Input Parameter: 3451e6ccafaeSMatthew G Knepley . dm - The submesh DM 3452e6ccafaeSMatthew G Knepley 3453e6ccafaeSMatthew G Knepley Output Parameter: 34540298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 3455e6ccafaeSMatthew G Knepley 34563982b651SMatthew G. Knepley Note: This IS is guaranteed to be sorted by the construction of the submesh 345764beef6dSMatthew G. Knepley 345864beef6dSMatthew G. Knepley Level: developer 345964beef6dSMatthew G. Knepley 346064beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 346164beef6dSMatthew G. Knepley @*/ 3462e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 3463e6ccafaeSMatthew G Knepley { 346482f516ccSBarry Smith MPI_Comm comm; 3465e6ccafaeSMatthew G Knepley DMLabel subpointMap; 3466e6ccafaeSMatthew G Knepley IS is; 3467e6ccafaeSMatthew G Knepley const PetscInt *opoints; 3468e6ccafaeSMatthew G Knepley PetscInt *points, *depths; 3469e6ccafaeSMatthew G Knepley PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 3470e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3471e6ccafaeSMatthew G Knepley 3472e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3473e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3474e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 347582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 34760298fd71SBarry Smith *subpointIS = NULL; 3477e6ccafaeSMatthew G Knepley ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 3478e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3479fed694aaSMatthew G. Knepley if (subpointMap && depth >= 0) { 3480e6ccafaeSMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3481e6ccafaeSMatthew G Knepley if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 3482e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3483e6ccafaeSMatthew G Knepley depths[0] = depth; 3484e6ccafaeSMatthew G Knepley depths[1] = 0; 3485e6ccafaeSMatthew G Knepley for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 3486785e854fSJed Brown ierr = PetscMalloc1(pEnd, &points);CHKERRQ(ierr); 3487e6ccafaeSMatthew G Knepley for(d = 0, off = 0; d <= depth; ++d) { 3488e6ccafaeSMatthew G Knepley const PetscInt dep = depths[d]; 3489e6ccafaeSMatthew G Knepley 3490e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 3491e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 34921e21b6fdSMatthew G Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 3493e6ccafaeSMatthew 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); 3494e6ccafaeSMatthew G Knepley } else { 34951e21b6fdSMatthew G Knepley if (!n) { 34961e21b6fdSMatthew G Knepley if (d == 0) { 34971e21b6fdSMatthew G Knepley /* Missing cells */ 34981e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 34991e21b6fdSMatthew G Knepley } else { 35001e21b6fdSMatthew G Knepley /* Missing faces */ 35011e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 35021e21b6fdSMatthew G Knepley } 35031e21b6fdSMatthew G Knepley } 3504e6ccafaeSMatthew G Knepley } 3505e6ccafaeSMatthew G Knepley if (n) { 3506e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 3507e6ccafaeSMatthew G Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 3508e6ccafaeSMatthew G Knepley for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 3509e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 3510e6ccafaeSMatthew G Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 3511e6ccafaeSMatthew G Knepley } 3512e6ccafaeSMatthew G Knepley } 3513e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3514e6ccafaeSMatthew G Knepley if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 3515fed694aaSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 3516e6ccafaeSMatthew G Knepley } 3517e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3518e6ccafaeSMatthew G Knepley } 3519