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 530560a7bSMatthew G. Knepley PetscErrorCode DMPlexMarkBoundaryFaces_Internal(DM dm, PetscInt cellHeight, DMLabel label) 630560a7bSMatthew G. Knepley { 730560a7bSMatthew G. Knepley PetscInt fStart, fEnd, f; 830560a7bSMatthew G. Knepley PetscErrorCode ierr; 930560a7bSMatthew G. Knepley 1030560a7bSMatthew G. Knepley PetscFunctionBegin; 1130560a7bSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1230560a7bSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight+1, &fStart, &fEnd);CHKERRQ(ierr); 1330560a7bSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 1430560a7bSMatthew G. Knepley PetscInt supportSize; 1530560a7bSMatthew G. Knepley 1630560a7bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 1730560a7bSMatthew G. Knepley if (supportSize == 1) {ierr = DMLabelSetValue(label, f, 1);CHKERRQ(ierr);} 1830560a7bSMatthew G. Knepley } 1930560a7bSMatthew G. Knepley PetscFunctionReturn(0); 2030560a7bSMatthew G. Knepley } 2130560a7bSMatthew G. Knepley 22cd0c2139SMatthew G Knepley /*@ 23cd0c2139SMatthew G Knepley DMPlexMarkBoundaryFaces - Mark all faces on the boundary 24cd0c2139SMatthew G Knepley 25cd0c2139SMatthew G Knepley Not Collective 26cd0c2139SMatthew G Knepley 27cd0c2139SMatthew G Knepley Input Parameter: 28cd0c2139SMatthew G Knepley . dm - The original DM 29cd0c2139SMatthew G Knepley 30cd0c2139SMatthew G Knepley Output Parameter: 31cd0c2139SMatthew G Knepley . label - The DMLabel marking boundary faces with value 1 32cd0c2139SMatthew G Knepley 33cd0c2139SMatthew G Knepley Level: developer 34cd0c2139SMatthew G Knepley 35c58f1c22SToby Isaac .seealso: DMLabelCreate(), DMCreateLabel() 3609f723d9SJed Brown @*/ 37cd0c2139SMatthew G Knepley PetscErrorCode DMPlexMarkBoundaryFaces(DM dm, DMLabel label) 38cd0c2139SMatthew G Knepley { 39cd0c2139SMatthew G Knepley PetscErrorCode ierr; 40cd0c2139SMatthew G Knepley 41cd0c2139SMatthew G Knepley PetscFunctionBegin; 4274e03af4SMatthew G. Knepley ierr = DMPlexMarkBoundaryFaces_Internal(dm, 0, label);CHKERRQ(ierr); 43cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 44cd0c2139SMatthew G Knepley } 45cd0c2139SMatthew G Knepley 46b0bf5782SToby Isaac PetscErrorCode DMPlexLabelComplete_Internal(DM dm, DMLabel label, PetscBool completeCells) 47b0bf5782SToby Isaac { 48b0bf5782SToby Isaac IS valueIS; 49b0bf5782SToby Isaac const PetscInt *values; 50b0bf5782SToby Isaac PetscInt numValues, v, cStart, cEnd; 51b0bf5782SToby Isaac PetscErrorCode ierr; 52b0bf5782SToby Isaac 53b0bf5782SToby Isaac PetscFunctionBegin; 54b0bf5782SToby Isaac ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 55b0bf5782SToby Isaac ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 56b0bf5782SToby Isaac ierr = DMPlexGetHeightStratum(dm,0,&cStart,&cEnd);CHKERRQ(ierr); 57b0bf5782SToby Isaac ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 58b0bf5782SToby Isaac for (v = 0; v < numValues; ++v) { 59b0bf5782SToby Isaac IS pointIS; 60b0bf5782SToby Isaac const PetscInt *points; 61b0bf5782SToby Isaac PetscInt numPoints, p; 62b0bf5782SToby Isaac 63b0bf5782SToby Isaac ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 64b0bf5782SToby Isaac ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 65b0bf5782SToby Isaac ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 66b0bf5782SToby Isaac for (p = 0; p < numPoints; ++p) { 67b0bf5782SToby Isaac PetscInt q = points[p]; 68b0bf5782SToby Isaac PetscInt *closure = NULL; 69b0bf5782SToby Isaac PetscInt closureSize, c; 70b0bf5782SToby Isaac 71b0bf5782SToby Isaac if (cStart <= q && q < cEnd && !completeCells) { /* skip cells */ 72b0bf5782SToby Isaac continue; 73b0bf5782SToby Isaac } 74b0bf5782SToby Isaac ierr = DMPlexGetTransitiveClosure(dm, q, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 75b0bf5782SToby Isaac for (c = 0; c < closureSize*2; c += 2) { 76b0bf5782SToby Isaac ierr = DMLabelSetValue(label, closure[c], values[v]);CHKERRQ(ierr); 77b0bf5782SToby Isaac } 78b0bf5782SToby Isaac ierr = DMPlexRestoreTransitiveClosure(dm, q, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 79b0bf5782SToby Isaac } 80b0bf5782SToby Isaac ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 81b0bf5782SToby Isaac ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 82b0bf5782SToby Isaac } 83b0bf5782SToby Isaac ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 84b0bf5782SToby Isaac ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 85b0bf5782SToby Isaac PetscFunctionReturn(0); 86b0bf5782SToby Isaac } 87b0bf5782SToby Isaac 882be2b188SMatthew G Knepley /*@ 892be2b188SMatthew G Knepley DMPlexLabelComplete - Starting with a label marking points on a surface, we add the transitive closure to the surface 902be2b188SMatthew G Knepley 912be2b188SMatthew G Knepley Input Parameters: 922be2b188SMatthew G Knepley + dm - The DM 932be2b188SMatthew G Knepley - label - A DMLabel marking the surface points 942be2b188SMatthew G Knepley 952be2b188SMatthew G Knepley Output Parameter: 962be2b188SMatthew G Knepley . label - A DMLabel marking all surface points in the transitive closure 972be2b188SMatthew G Knepley 982be2b188SMatthew G Knepley Level: developer 992be2b188SMatthew G Knepley 1002be2b188SMatthew G Knepley .seealso: DMPlexLabelCohesiveComplete() 1012be2b188SMatthew G Knepley @*/ 1022be2b188SMatthew G Knepley PetscErrorCode DMPlexLabelComplete(DM dm, DMLabel label) 1032be2b188SMatthew G Knepley { 1042be2b188SMatthew G Knepley PetscErrorCode ierr; 1052be2b188SMatthew G Knepley 1062be2b188SMatthew G Knepley PetscFunctionBegin; 107b0bf5782SToby Isaac ierr = DMPlexLabelComplete_Internal(dm, label, PETSC_TRUE);CHKERRQ(ierr); 1082be2b188SMatthew G Knepley PetscFunctionReturn(0); 1092be2b188SMatthew G Knepley } 1102be2b188SMatthew G Knepley 1116cf0e42fSMatthew G. Knepley /*@ 1126cf0e42fSMatthew G. Knepley DMPlexLabelAddCells - Starting with a label marking faces on a surface, we add a cell for each face 1136cf0e42fSMatthew G. Knepley 1146cf0e42fSMatthew G. Knepley Input Parameters: 1156cf0e42fSMatthew G. Knepley + dm - The DM 1166cf0e42fSMatthew G. Knepley - label - A DMLabel marking the surface points 1176cf0e42fSMatthew G. Knepley 1186cf0e42fSMatthew G. Knepley Output Parameter: 1196cf0e42fSMatthew G. Knepley . label - A DMLabel incorporating cells 1206cf0e42fSMatthew G. Knepley 1216cf0e42fSMatthew G. Knepley Level: developer 1226cf0e42fSMatthew G. Knepley 1236cf0e42fSMatthew G. Knepley Note: The cells allow FEM boundary conditions to be applied using the cell geometry 1246cf0e42fSMatthew G. Knepley 1256cf0e42fSMatthew G. Knepley .seealso: DMPlexLabelComplete(), DMPlexLabelCohesiveComplete() 1266cf0e42fSMatthew G. Knepley @*/ 1276cf0e42fSMatthew G. Knepley PetscErrorCode DMPlexLabelAddCells(DM dm, DMLabel label) 1286cf0e42fSMatthew G. Knepley { 1296cf0e42fSMatthew G. Knepley IS valueIS; 1306cf0e42fSMatthew G. Knepley const PetscInt *values; 13122eabd52SMatthew G. Knepley PetscInt numValues, v, cStart, cEnd, cEndInterior; 1326cf0e42fSMatthew G. Knepley PetscErrorCode ierr; 1336cf0e42fSMatthew G. Knepley 1346cf0e42fSMatthew G. Knepley PetscFunctionBegin; 1356cf0e42fSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 13622eabd52SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cEndInterior, NULL, NULL, NULL);CHKERRQ(ierr); 13722eabd52SMatthew G. Knepley cEnd = cEndInterior < 0 ? cEnd : cEndInterior; 1386cf0e42fSMatthew G. Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 1396cf0e42fSMatthew G. Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 1406cf0e42fSMatthew G. Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 1416cf0e42fSMatthew G. Knepley for (v = 0; v < numValues; ++v) { 1426cf0e42fSMatthew G. Knepley IS pointIS; 1436cf0e42fSMatthew G. Knepley const PetscInt *points; 1446cf0e42fSMatthew G. Knepley PetscInt numPoints, p; 1456cf0e42fSMatthew G. Knepley 1466cf0e42fSMatthew G. Knepley ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 1476cf0e42fSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 1486cf0e42fSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 1496cf0e42fSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1506cf0e42fSMatthew G. Knepley PetscInt *closure = NULL; 15122eabd52SMatthew G. Knepley PetscInt closureSize, point, cl; 1526cf0e42fSMatthew G. Knepley 1536cf0e42fSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 15422eabd52SMatthew G. Knepley for (cl = closureSize-1; cl > 0; --cl) { 15522eabd52SMatthew G. Knepley point = closure[cl*2]; 15622eabd52SMatthew G. Knepley if ((point >= cStart) && (point < cEnd)) {ierr = DMLabelSetValue(label, point, values[v]);CHKERRQ(ierr); break;} 15722eabd52SMatthew G. Knepley } 1586cf0e42fSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 1596cf0e42fSMatthew G. Knepley } 1606cf0e42fSMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 1616cf0e42fSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 1626cf0e42fSMatthew G. Knepley } 1636cf0e42fSMatthew G. Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1646cf0e42fSMatthew G. Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1656cf0e42fSMatthew G. Knepley PetscFunctionReturn(0); 1666cf0e42fSMatthew G. Knepley } 1676cf0e42fSMatthew G. Knepley 168f402d5e4SToby Isaac /*@ 169f402d5e4SToby Isaac DMPlexLabelClearCells - Remove cells from a label 170f402d5e4SToby Isaac 171f402d5e4SToby Isaac Input Parameters: 172f402d5e4SToby Isaac + dm - The DM 173f402d5e4SToby Isaac - label - A DMLabel marking surface points and their adjacent cells 174f402d5e4SToby Isaac 175f402d5e4SToby Isaac Output Parameter: 176f402d5e4SToby Isaac . label - A DMLabel without cells 177f402d5e4SToby Isaac 178f402d5e4SToby Isaac Level: developer 179f402d5e4SToby Isaac 180f402d5e4SToby Isaac Note: This undoes DMPlexLabelAddCells() 181f402d5e4SToby Isaac 182f402d5e4SToby Isaac .seealso: DMPlexLabelComplete(), DMPlexLabelCohesiveComplete(), DMPlexLabelAddCells() 183f402d5e4SToby Isaac @*/ 184f402d5e4SToby Isaac PetscErrorCode DMPlexLabelClearCells(DM dm, DMLabel label) 185f402d5e4SToby Isaac { 186f402d5e4SToby Isaac IS valueIS; 187f402d5e4SToby Isaac const PetscInt *values; 188f402d5e4SToby Isaac PetscInt numValues, v, cStart, cEnd, cEndInterior; 189f402d5e4SToby Isaac PetscErrorCode ierr; 190f402d5e4SToby Isaac 191f402d5e4SToby Isaac PetscFunctionBegin; 192f402d5e4SToby Isaac ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 193f402d5e4SToby Isaac ierr = DMPlexGetHybridBounds(dm, &cEndInterior, NULL, NULL, NULL);CHKERRQ(ierr); 194f402d5e4SToby Isaac cEnd = cEndInterior < 0 ? cEnd : cEndInterior; 195f402d5e4SToby Isaac ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 196f402d5e4SToby Isaac ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 197f402d5e4SToby Isaac ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 198f402d5e4SToby Isaac for (v = 0; v < numValues; ++v) { 199f402d5e4SToby Isaac IS pointIS; 200f402d5e4SToby Isaac const PetscInt *points; 201f402d5e4SToby Isaac PetscInt numPoints, p; 202f402d5e4SToby Isaac 203f402d5e4SToby Isaac ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 204f402d5e4SToby Isaac ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 205f402d5e4SToby Isaac ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 206f402d5e4SToby Isaac for (p = 0; p < numPoints; ++p) { 207f402d5e4SToby Isaac PetscInt point = points[p]; 208f402d5e4SToby Isaac 209f402d5e4SToby Isaac if (point >= cStart && point < cEnd) { 210f402d5e4SToby Isaac ierr = DMLabelClearValue(label,point,values[v]);CHKERRQ(ierr); 211f402d5e4SToby Isaac } 212f402d5e4SToby Isaac } 213f402d5e4SToby Isaac ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 214f402d5e4SToby Isaac ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 215f402d5e4SToby Isaac } 216f402d5e4SToby Isaac ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 217f402d5e4SToby Isaac ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 218f402d5e4SToby Isaac PetscFunctionReturn(0); 219f402d5e4SToby Isaac } 220f402d5e4SToby Isaac 22159eef20bSToby Isaac /* take (oldEnd, added) pairs, ordered by height and convert them to (oldstart, newstart) pairs, ordered by ascending 22259eef20bSToby Isaac * index (skipping first, which is (0,0)) */ 2232582d50cSToby Isaac PETSC_STATIC_INLINE PetscErrorCode DMPlexShiftPointSetUp_Internal(PetscInt depth, PetscInt depthShift[]) 224cd0c2139SMatthew G Knepley { 2252582d50cSToby Isaac PetscInt d, off = 0; 2262582d50cSToby Isaac 2272582d50cSToby Isaac PetscFunctionBegin; 22859eef20bSToby Isaac /* sort by (oldend): yes this is an O(n^2) sort, we expect depth <= 3 */ 2290974a383SToby Isaac for (d = 0; d < depth; d++) { 2302582d50cSToby Isaac PetscInt firstd = d; 2310974a383SToby Isaac PetscInt firstStart = depthShift[2*d]; 2322582d50cSToby Isaac PetscInt e; 2332582d50cSToby Isaac 2342582d50cSToby Isaac for (e = d+1; e <= depth; e++) { 2352582d50cSToby Isaac if (depthShift[2*e] < firstStart) { 2362582d50cSToby Isaac firstd = e; 2372582d50cSToby Isaac firstStart = depthShift[2*d]; 2382582d50cSToby Isaac } 2392582d50cSToby Isaac } 2402582d50cSToby Isaac if (firstd != d) { 2412582d50cSToby Isaac PetscInt swap[2]; 2422582d50cSToby Isaac 2432582d50cSToby Isaac e = firstd; 2442582d50cSToby Isaac swap[0] = depthShift[2*d]; 2452582d50cSToby Isaac swap[1] = depthShift[2*d+1]; 2462582d50cSToby Isaac depthShift[2*d] = depthShift[2*e]; 2472582d50cSToby Isaac depthShift[2*d+1] = depthShift[2*e+1]; 2482582d50cSToby Isaac depthShift[2*e] = swap[0]; 2492582d50cSToby Isaac depthShift[2*e+1] = swap[1]; 2502582d50cSToby Isaac } 2512582d50cSToby Isaac } 2522582d50cSToby Isaac /* convert (oldstart, added) to (oldstart, newstart) */ 2530974a383SToby Isaac for (d = 0; d <= depth; d++) { 2542582d50cSToby Isaac off += depthShift[2*d+1]; 25559eef20bSToby Isaac depthShift[2*d+1] = depthShift[2*d] + off; 2562582d50cSToby Isaac } 2572582d50cSToby Isaac PetscFunctionReturn(0); 2582582d50cSToby Isaac } 2592582d50cSToby Isaac 2602582d50cSToby Isaac /* depthShift is a list of (old, new) pairs */ 2612582d50cSToby Isaac PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthShift[]) 2622582d50cSToby Isaac { 2632582d50cSToby Isaac PetscInt d; 2642582d50cSToby Isaac PetscInt newOff = 0; 2652582d50cSToby Isaac 2662582d50cSToby Isaac for (d = 0; d <= depth; d++) { 2672582d50cSToby Isaac if (p < depthShift[2*d]) return p + newOff; 2682582d50cSToby Isaac else newOff = depthShift[2*d+1] - depthShift[2*d]; 2692582d50cSToby Isaac } 2700974a383SToby Isaac return p + newOff; 2712582d50cSToby Isaac } 2722582d50cSToby Isaac 2732582d50cSToby Isaac /* depthShift is a list of (old, new) pairs */ 2742582d50cSToby Isaac PETSC_STATIC_INLINE PetscInt DMPlexShiftPointInverse_Internal(PetscInt p, PetscInt depth, PetscInt depthShift[]) 2752582d50cSToby Isaac { 2762582d50cSToby Isaac PetscInt d; 2772582d50cSToby Isaac PetscInt newOff = 0; 2782582d50cSToby Isaac 2792582d50cSToby Isaac for (d = 0; d <= depth; d++) { 2802582d50cSToby Isaac if (p < depthShift[2*d+1]) return p + newOff; 2812582d50cSToby Isaac else newOff = depthShift[2*d] - depthShift[2*d+1]; 2822582d50cSToby Isaac } 2830974a383SToby Isaac return p + newOff; 284cd0c2139SMatthew G Knepley } 285cd0c2139SMatthew G Knepley 286cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew) 287cd0c2139SMatthew G Knepley { 288cd0c2139SMatthew G Knepley PetscInt depth = 0, d, pStart, pEnd, p; 289cd0c2139SMatthew G Knepley PetscErrorCode ierr; 290cd0c2139SMatthew G Knepley 291cd0c2139SMatthew G Knepley PetscFunctionBegin; 292cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 293cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 294cd0c2139SMatthew G Knepley /* Step 1: Expand chart */ 295cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2960974a383SToby Isaac pEnd = DMPlexShiftPoint_Internal(pEnd,depth,depthShift); 297cd0c2139SMatthew G Knepley ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr); 298cd0c2139SMatthew G Knepley /* Step 2: Set cone and support sizes */ 299cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 300cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 301cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 3022582d50cSToby Isaac PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthShift); 303cd0c2139SMatthew G Knepley PetscInt size; 304cd0c2139SMatthew G Knepley 305cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 306cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr); 307cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 308cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr); 309cd0c2139SMatthew G Knepley } 310cd0c2139SMatthew G Knepley } 311cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 312cd0c2139SMatthew G Knepley } 313cd0c2139SMatthew G Knepley 314cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew) 315cd0c2139SMatthew G Knepley { 3162582d50cSToby Isaac PetscInt *newpoints; 3172582d50cSToby Isaac PetscInt depth = 0, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, pStart, pEnd, p; 318cd0c2139SMatthew G Knepley PetscErrorCode ierr; 319cd0c2139SMatthew G Knepley 320cd0c2139SMatthew G Knepley PetscFunctionBegin; 321cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 322cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 323cd0c2139SMatthew G Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 324dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dmNew, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 3252582d50cSToby Isaac ierr = PetscMalloc1(PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),&newpoints);CHKERRQ(ierr); 326cd0c2139SMatthew G Knepley /* Step 5: Set cones and supports */ 327cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 328cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 329cd0c2139SMatthew G Knepley const PetscInt *points = NULL, *orientations = NULL; 3302582d50cSToby Isaac PetscInt size,sizeNew, i, newp = DMPlexShiftPoint_Internal(p, depth, depthShift); 331cd0c2139SMatthew G Knepley 332cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 333cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr); 334cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr); 335cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 3362582d50cSToby Isaac newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthShift); 337cd0c2139SMatthew G Knepley } 338cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr); 339cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr); 340cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 341dcbb62e8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmNew, newp, &sizeNew);CHKERRQ(ierr); 342cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr); 343cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 3442582d50cSToby Isaac newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthShift); 345cd0c2139SMatthew G Knepley } 346dcbb62e8SMatthew G. Knepley for (i = size; i < sizeNew; ++i) newpoints[i] = 0; 347cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr); 348cd0c2139SMatthew G Knepley } 3492582d50cSToby Isaac ierr = PetscFree(newpoints);CHKERRQ(ierr); 350cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 351cd0c2139SMatthew G Knepley } 352cd0c2139SMatthew G Knepley 353cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew) 354cd0c2139SMatthew G Knepley { 355cd0c2139SMatthew G Knepley PetscSection coordSection, newCoordSection; 356cd0c2139SMatthew G Knepley Vec coordinates, newCoordinates; 357cd0c2139SMatthew G Knepley PetscScalar *coords, *newCoords; 358f2b8cce1SMatthew G. Knepley PetscInt coordSize, sStart, sEnd; 359f2b8cce1SMatthew G. Knepley PetscInt dim, depth = 0, cStart, cEnd, cStartNew, cEndNew, c, vStart, vEnd, vStartNew, vEndNew, v; 360f2b8cce1SMatthew G. Knepley PetscBool hasCells; 361cd0c2139SMatthew G Knepley PetscErrorCode ierr; 362cd0c2139SMatthew G Knepley 363cd0c2139SMatthew G Knepley PetscFunctionBegin; 364f2b8cce1SMatthew G. Knepley ierr = DMGetCoordinateDim(dm, &dim);CHKERRQ(ierr); 365cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 366cd0c2139SMatthew G Knepley /* Step 8: Convert coordinates */ 367cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 368f2b8cce1SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 369cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr); 370f2b8cce1SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dmNew, 0, &cStartNew, &cEndNew);CHKERRQ(ierr); 37169d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 372cd0c2139SMatthew G Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr); 373cd0c2139SMatthew G Knepley ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr); 374cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr); 375f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetChart(coordSection, &sStart, &sEnd);CHKERRQ(ierr); 376f2b8cce1SMatthew G. Knepley hasCells = sStart == cStart ? PETSC_TRUE : PETSC_FALSE; 377f2b8cce1SMatthew G. Knepley ierr = PetscSectionSetChart(newCoordSection, hasCells ? cStartNew : vStartNew, vEndNew);CHKERRQ(ierr); 378f2b8cce1SMatthew G. Knepley if (hasCells) { 379f2b8cce1SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 380f2b8cce1SMatthew G. Knepley PetscInt cNew = DMPlexShiftPoint_Internal(c, depth, depthShift), dof; 381f2b8cce1SMatthew G. Knepley 382f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, c, &dof);CHKERRQ(ierr); 383f2b8cce1SMatthew G. Knepley ierr = PetscSectionSetDof(newCoordSection, cNew, dof);CHKERRQ(ierr); 384f2b8cce1SMatthew G. Knepley ierr = PetscSectionSetFieldDof(newCoordSection, cNew, 0, dof);CHKERRQ(ierr); 385f2b8cce1SMatthew G. Knepley } 386f2b8cce1SMatthew G. Knepley } 387cd0c2139SMatthew G Knepley for (v = vStartNew; v < vEndNew; ++v) { 388cd0c2139SMatthew G Knepley ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr); 389cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr); 390cd0c2139SMatthew G Knepley } 391cd0c2139SMatthew G Knepley ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr); 39246e270d4SMatthew G. Knepley ierr = DMSetCoordinateSection(dmNew, PETSC_DETERMINE, newCoordSection);CHKERRQ(ierr); 393cd0c2139SMatthew G Knepley ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr); 3948b9ced59SLisandro Dalcin ierr = VecCreate(PETSC_COMM_SELF, &newCoordinates);CHKERRQ(ierr); 395cd0c2139SMatthew G Knepley ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr); 396cd0c2139SMatthew G Knepley ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 3974e90ef8eSMatthew G. Knepley ierr = VecSetBlockSize(newCoordinates, dim);CHKERRQ(ierr); 3982eb5907fSJed Brown ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr); 399cd0c2139SMatthew G Knepley ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr); 400cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 401cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 402cd0c2139SMatthew G Knepley ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr); 403f2b8cce1SMatthew G. Knepley if (hasCells) { 404f2b8cce1SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 405f2b8cce1SMatthew G. Knepley PetscInt cNew = DMPlexShiftPoint_Internal(c, depth, depthShift), dof, off, noff, d; 406f2b8cce1SMatthew G. Knepley 407f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, c, &dof);CHKERRQ(ierr); 408f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, c, &off);CHKERRQ(ierr); 409f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetOffset(newCoordSection, cNew, &noff);CHKERRQ(ierr); 410f2b8cce1SMatthew G. Knepley for (d = 0; d < dof; ++d) newCoords[noff+d] = coords[off+d]; 411f2b8cce1SMatthew G. Knepley } 412f2b8cce1SMatthew G. Knepley } 413cd0c2139SMatthew G Knepley for (v = vStart; v < vEnd; ++v) { 414cd0c2139SMatthew G Knepley PetscInt dof, off, noff, d; 415cd0c2139SMatthew G Knepley 416cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 417cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 4182582d50cSToby Isaac ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthShift), &noff);CHKERRQ(ierr); 419f2b8cce1SMatthew G. Knepley for (d = 0; d < dof; ++d) newCoords[noff+d] = coords[off+d]; 420cd0c2139SMatthew G Knepley } 421cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 422cd0c2139SMatthew G Knepley ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr); 423cd0c2139SMatthew G Knepley ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 424cd0c2139SMatthew G Knepley ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr); 425cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 426cd0c2139SMatthew G Knepley } 427cd0c2139SMatthew G Knepley 428cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew) 429cd0c2139SMatthew G Knepley { 4302582d50cSToby Isaac PetscInt depth = 0; 431cd0c2139SMatthew G Knepley PetscSF sfPoint, sfPointNew; 432cd0c2139SMatthew G Knepley const PetscSFNode *remotePoints; 433cd0c2139SMatthew G Knepley PetscSFNode *gremotePoints; 434cd0c2139SMatthew G Knepley const PetscInt *localPoints; 435cd0c2139SMatthew G Knepley PetscInt *glocalPoints, *newLocation, *newRemoteLocation; 436cd0c2139SMatthew G Knepley PetscInt numRoots, numLeaves, l, pStart, pEnd, totShift = 0; 437cd0c2139SMatthew G Knepley PetscErrorCode ierr; 438cd0c2139SMatthew G Knepley 439cd0c2139SMatthew G Knepley PetscFunctionBegin; 440cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 441cd0c2139SMatthew G Knepley /* Step 9: Convert pointSF */ 442cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 443cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr); 444cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 445cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 4466e21efdcSToby Isaac totShift = DMPlexShiftPoint_Internal(pEnd,depth,depthShift) - pEnd; 447cd0c2139SMatthew G Knepley if (numRoots >= 0) { 448dcca6d9dSJed Brown ierr = PetscMalloc2(numRoots,&newLocation,pEnd-pStart,&newRemoteLocation);CHKERRQ(ierr); 4492582d50cSToby Isaac for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthShift); 450cd0c2139SMatthew G Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 451cd0c2139SMatthew G Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 452785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &glocalPoints);CHKERRQ(ierr); 453785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &gremotePoints);CHKERRQ(ierr); 454cd0c2139SMatthew G Knepley for (l = 0; l < numLeaves; ++l) { 4552582d50cSToby Isaac glocalPoints[l] = DMPlexShiftPoint_Internal(localPoints[l], depth, depthShift); 456cd0c2139SMatthew G Knepley gremotePoints[l].rank = remotePoints[l].rank; 457cd0c2139SMatthew G Knepley gremotePoints[l].index = newRemoteLocation[localPoints[l]]; 458cd0c2139SMatthew G Knepley } 459cd0c2139SMatthew G Knepley ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr); 460cd0c2139SMatthew G Knepley ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 461cd0c2139SMatthew G Knepley } 462cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 463cd0c2139SMatthew G Knepley } 464cd0c2139SMatthew G Knepley 465cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew) 466cd0c2139SMatthew G Knepley { 467cd0c2139SMatthew G Knepley PetscSF sfPoint; 468cd0c2139SMatthew G Knepley DMLabel vtkLabel, ghostLabel; 469cd0c2139SMatthew G Knepley const PetscSFNode *leafRemote; 470cd0c2139SMatthew G Knepley const PetscInt *leafLocal; 4712582d50cSToby Isaac PetscInt depth = 0, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f; 472cd0c2139SMatthew G Knepley PetscMPIInt rank; 473cd0c2139SMatthew G Knepley PetscErrorCode ierr; 474cd0c2139SMatthew G Knepley 475cd0c2139SMatthew G Knepley PetscFunctionBegin; 476cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 477cd0c2139SMatthew G Knepley /* Step 10: Convert labels */ 478c58f1c22SToby Isaac ierr = DMGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 479cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 480cd0c2139SMatthew G Knepley DMLabel label, newlabel; 481cd0c2139SMatthew G Knepley const char *lname; 482cd0c2139SMatthew G Knepley PetscBool isDepth; 483cd0c2139SMatthew G Knepley IS valueIS; 484cd0c2139SMatthew G Knepley const PetscInt *values; 485cd0c2139SMatthew G Knepley PetscInt numValues, val; 486cd0c2139SMatthew G Knepley 487c58f1c22SToby Isaac ierr = DMGetLabelName(dm, l, &lname);CHKERRQ(ierr); 488cd0c2139SMatthew G Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 489cd0c2139SMatthew G Knepley if (isDepth) continue; 490c58f1c22SToby Isaac ierr = DMCreateLabel(dmNew, lname);CHKERRQ(ierr); 491c58f1c22SToby Isaac ierr = DMGetLabel(dm, lname, &label);CHKERRQ(ierr); 492c58f1c22SToby Isaac ierr = DMGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr); 49364a6a1a4SToby Isaac ierr = DMLabelGetDefaultValue(label,&val);CHKERRQ(ierr); 49464a6a1a4SToby Isaac ierr = DMLabelSetDefaultValue(newlabel,val);CHKERRQ(ierr); 495cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 496cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 497cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 498cd0c2139SMatthew G Knepley for (val = 0; val < numValues; ++val) { 499cd0c2139SMatthew G Knepley IS pointIS; 500cd0c2139SMatthew G Knepley const PetscInt *points; 501cd0c2139SMatthew G Knepley PetscInt numPoints, p; 502cd0c2139SMatthew G Knepley 503cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 504cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 505cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 506cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 5072582d50cSToby Isaac const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthShift); 508cd0c2139SMatthew G Knepley 509cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr); 510cd0c2139SMatthew G Knepley } 511cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 512cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 513cd0c2139SMatthew G Knepley } 514cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 515cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 516cd0c2139SMatthew G Knepley } 517cd0c2139SMatthew G Knepley /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */ 518cd0c2139SMatthew G Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 519cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 520cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 521cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr); 522c58f1c22SToby Isaac ierr = DMCreateLabel(dmNew, "vtk");CHKERRQ(ierr); 523c58f1c22SToby Isaac ierr = DMCreateLabel(dmNew, "ghost");CHKERRQ(ierr); 524c58f1c22SToby Isaac ierr = DMGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr); 525c58f1c22SToby Isaac ierr = DMGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr); 526cd0c2139SMatthew G Knepley for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { 527cd0c2139SMatthew G Knepley for (; c < leafLocal[l] && c < cEnd; ++c) { 528cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 529cd0c2139SMatthew G Knepley } 530cd0c2139SMatthew G Knepley if (leafLocal[l] >= cEnd) break; 531cd0c2139SMatthew G Knepley if (leafRemote[l].rank == rank) { 532cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 533cd0c2139SMatthew G Knepley } else { 534cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr); 535cd0c2139SMatthew G Knepley } 536cd0c2139SMatthew G Knepley } 537cd0c2139SMatthew G Knepley for (; c < cEnd; ++c) { 538cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 539cd0c2139SMatthew G Knepley } 540cd0c2139SMatthew G Knepley if (0) { 541cd0c2139SMatthew G Knepley ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 542cd0c2139SMatthew G Knepley } 543cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr); 544cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 545cd0c2139SMatthew G Knepley PetscInt numCells; 546cd0c2139SMatthew G Knepley 547cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr); 548cd0c2139SMatthew G Knepley if (numCells < 2) { 549cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr); 550cd0c2139SMatthew G Knepley } else { 551cd0c2139SMatthew G Knepley const PetscInt *cells = NULL; 552cd0c2139SMatthew G Knepley PetscInt vA, vB; 553cd0c2139SMatthew G Knepley 554cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr); 555cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr); 556cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr); 55790664b96SToby Isaac if (vA != 1 && vB != 1) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);} 558cd0c2139SMatthew G Knepley } 559cd0c2139SMatthew G Knepley } 560cd0c2139SMatthew G Knepley if (0) { 561cd0c2139SMatthew G Knepley ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 562cd0c2139SMatthew G Knepley } 563cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 564cd0c2139SMatthew G Knepley } 565cd0c2139SMatthew G Knepley 566ca04dac2SToby Isaac static PetscErrorCode DMPlexShiftTree_Internal(DM dm, PetscInt depthShift[], DM dmNew) 567ca04dac2SToby Isaac { 568ca04dac2SToby Isaac DM refTree; 569ca04dac2SToby Isaac PetscSection pSec; 570ca04dac2SToby Isaac PetscInt *parents, *childIDs; 571ca04dac2SToby Isaac PetscErrorCode ierr; 572ca04dac2SToby Isaac 573ca04dac2SToby Isaac PetscFunctionBegin; 574ca04dac2SToby Isaac ierr = DMPlexGetReferenceTree(dm,&refTree);CHKERRQ(ierr); 575ca04dac2SToby Isaac ierr = DMPlexSetReferenceTree(dmNew,refTree);CHKERRQ(ierr); 576ca04dac2SToby Isaac ierr = DMPlexGetTree(dm,&pSec,&parents,&childIDs,NULL,NULL);CHKERRQ(ierr); 577ca04dac2SToby Isaac if (pSec) { 5782582d50cSToby Isaac PetscInt p, pStart, pEnd, *parentsShifted, pStartShifted, pEndShifted, depth; 579fb4630b5SToby Isaac PetscInt *childIDsShifted; 580ca04dac2SToby Isaac PetscSection pSecShifted; 581ca04dac2SToby Isaac 582ca04dac2SToby Isaac ierr = PetscSectionGetChart(pSec,&pStart,&pEnd);CHKERRQ(ierr); 583ca04dac2SToby Isaac ierr = DMPlexGetDepth(dm,&depth);CHKERRQ(ierr); 5842582d50cSToby Isaac pStartShifted = DMPlexShiftPoint_Internal(pStart,depth,depthShift); 5852582d50cSToby Isaac pEndShifted = DMPlexShiftPoint_Internal(pEnd,depth,depthShift); 586fb4630b5SToby Isaac ierr = PetscMalloc2(pEndShifted - pStartShifted,&parentsShifted,pEndShifted-pStartShifted,&childIDsShifted);CHKERRQ(ierr); 587ca04dac2SToby Isaac ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dmNew),&pSecShifted);CHKERRQ(ierr); 588ca04dac2SToby Isaac ierr = PetscSectionSetChart(pSecShifted,pStartShifted,pEndShifted);CHKERRQ(ierr); 589ca04dac2SToby Isaac for (p = pStartShifted; p < pEndShifted; p++) { 590fb4630b5SToby Isaac /* start off assuming no children */ 591fb4630b5SToby Isaac ierr = PetscSectionSetDof(pSecShifted,p,0);CHKERRQ(ierr); 592fb4630b5SToby Isaac } 593fb4630b5SToby Isaac for (p = pStart; p < pEnd; p++) { 594fb4630b5SToby Isaac PetscInt dof; 595fb4630b5SToby Isaac PetscInt pNew = DMPlexShiftPoint_Internal(p,depth,depthShift); 596ca04dac2SToby Isaac 597ca04dac2SToby Isaac ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr); 598fb4630b5SToby Isaac ierr = PetscSectionSetDof(pSecShifted,pNew,dof);CHKERRQ(ierr); 599ca04dac2SToby Isaac } 600ca04dac2SToby Isaac ierr = PetscSectionSetUp(pSecShifted);CHKERRQ(ierr); 601fb4630b5SToby Isaac for (p = pStart; p < pEnd; p++) { 602fb4630b5SToby Isaac PetscInt dof; 603fb4630b5SToby Isaac PetscInt pNew = DMPlexShiftPoint_Internal(p,depth,depthShift); 604fb4630b5SToby Isaac 605fb4630b5SToby Isaac ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr); 606fb4630b5SToby Isaac if (dof) { 607fb4630b5SToby Isaac PetscInt off, offNew; 608fb4630b5SToby Isaac 609fb4630b5SToby Isaac ierr = PetscSectionGetOffset(pSec,p,&off);CHKERRQ(ierr); 610fb4630b5SToby Isaac ierr = PetscSectionGetOffset(pSecShifted,pNew,&offNew);CHKERRQ(ierr); 611fb4630b5SToby Isaac parentsShifted[offNew] = DMPlexShiftPoint_Internal(parents[off],depth,depthShift); 612fb4630b5SToby Isaac childIDsShifted[offNew] = childIDs[off]; 613fb4630b5SToby Isaac } 614fb4630b5SToby Isaac } 615fb4630b5SToby Isaac ierr = DMPlexSetTree(dmNew,pSecShifted,parentsShifted,childIDsShifted);CHKERRQ(ierr); 616fb4630b5SToby Isaac ierr = PetscFree2(parentsShifted,childIDsShifted);CHKERRQ(ierr); 617e6885bbbSToby Isaac ierr = PetscSectionDestroy(&pSecShifted);CHKERRQ(ierr); 618ca04dac2SToby Isaac } 619ca04dac2SToby Isaac PetscFunctionReturn(0); 620ca04dac2SToby Isaac } 621ca04dac2SToby Isaac 622cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm) 623cd0c2139SMatthew G Knepley { 624da97024aSMatthew G. Knepley PetscSF sf; 625cd0c2139SMatthew G Knepley IS valueIS; 626da97024aSMatthew G. Knepley const PetscInt *values, *leaves; 627cd0c2139SMatthew G Knepley PetscInt *depthShift; 6282582d50cSToby Isaac PetscInt d, depth = 0, nleaves, loc, Ng, numFS, fs, fStart, fEnd, ghostCell, cEnd, c; 629cd0c2139SMatthew G Knepley PetscErrorCode ierr; 630cd0c2139SMatthew G Knepley 631cd0c2139SMatthew G Knepley PetscFunctionBegin; 632da97024aSMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 633da97024aSMatthew G. Knepley ierr = PetscSFGetGraph(sf, NULL, &nleaves, &leaves, NULL);CHKERRQ(ierr); 634da97024aSMatthew G. Knepley nleaves = PetscMax(0, nleaves); 63546c796b9SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 636cd0c2139SMatthew G Knepley /* Count ghost cells */ 637cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 638cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr); 639cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 6404a6cfa73SMatthew G. Knepley Ng = 0; 641cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 64246c796b9SMatthew G. Knepley IS faceIS; 64346c796b9SMatthew G. Knepley const PetscInt *faces; 64446c796b9SMatthew G. Knepley PetscInt numFaces, f, numBdFaces = 0; 645cd0c2139SMatthew G Knepley 64646c796b9SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 64746c796b9SMatthew G. Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 64846c796b9SMatthew G. Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 64946c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 650ca04dac2SToby Isaac PetscInt numChildren; 651ca04dac2SToby Isaac 652da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 653ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 654ca04dac2SToby Isaac /* non-local and ancestors points don't get to register ghosts */ 655ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 65646c796b9SMatthew G. Knepley if ((faces[f] >= fStart) && (faces[f] < fEnd)) ++numBdFaces; 65746c796b9SMatthew G. Knepley } 6584a6cfa73SMatthew G. Knepley Ng += numBdFaces; 65946c796b9SMatthew G. Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 660cd0c2139SMatthew G Knepley } 661cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 6622582d50cSToby Isaac ierr = PetscMalloc1(2*(depth+1), &depthShift);CHKERRQ(ierr); 6632582d50cSToby Isaac for (d = 0; d <= depth; d++) { 66459eef20bSToby Isaac PetscInt dEnd; 6652582d50cSToby Isaac 6660974a383SToby Isaac ierr = DMPlexGetDepthStratum(dm,d,NULL,&dEnd);CHKERRQ(ierr); 66759eef20bSToby Isaac depthShift[2*d] = dEnd; 6682582d50cSToby Isaac depthShift[2*d+1] = 0; 6692582d50cSToby Isaac } 6702582d50cSToby Isaac if (depth >= 0) depthShift[2*depth+1] = Ng; 6712582d50cSToby Isaac ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift);CHKERRQ(ierr); 672cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 673cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 674cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 6755acea1aeSMatthew G. Knepley ierr = DMPlexSetHybridBounds(gdm, cEnd, PETSC_DETERMINE, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 6764a6cfa73SMatthew G. Knepley for (c = cEnd; c < cEnd + Ng; ++c) { 677cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr); 678cd0c2139SMatthew G Knepley } 679cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 680cd0c2139SMatthew G Knepley IS faceIS; 681cd0c2139SMatthew G Knepley const PetscInt *faces; 682cd0c2139SMatthew G Knepley PetscInt numFaces, f; 683cd0c2139SMatthew G Knepley 684cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 685cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 686cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 687cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 688ca04dac2SToby Isaac PetscInt size, numChildren; 689cd0c2139SMatthew G Knepley 690da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 691ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 692ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 69346c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 694cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr); 6954553fd90SToby Isaac if (size != 1) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "DM has boundary face %d with %d support cells", faces[f], size); 6964a6cfa73SMatthew G. Knepley ierr = DMPlexSetSupportSize(gdm, faces[f] + Ng, 2);CHKERRQ(ierr); 697cd0c2139SMatthew G Knepley } 698cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 699cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 700cd0c2139SMatthew G Knepley } 701cd0c2139SMatthew G Knepley /* Step 4: Setup ghosted DM */ 702cd0c2139SMatthew G Knepley ierr = DMSetUp(gdm);CHKERRQ(ierr); 703cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 704cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 705cd0c2139SMatthew G Knepley ghostCell = cEnd; 706cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 707cd0c2139SMatthew G Knepley IS faceIS; 708cd0c2139SMatthew G Knepley const PetscInt *faces; 709cd0c2139SMatthew G Knepley PetscInt numFaces, f; 710cd0c2139SMatthew G Knepley 711cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 712cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 713cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 71446c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 715ca04dac2SToby Isaac PetscInt newFace = faces[f] + Ng, numChildren; 716cd0c2139SMatthew G Knepley 717da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 718ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 719ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 72046c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 721cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr); 722cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr); 72346c796b9SMatthew G. Knepley ++ghostCell; 724cd0c2139SMatthew G Knepley } 725cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 726cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 727cd0c2139SMatthew G Knepley } 728cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 729cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 730cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 731cd0c2139SMatthew G Knepley ierr = DMPlexStratify(gdm);CHKERRQ(ierr); 732cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 733cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 734cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 735ca04dac2SToby Isaac ierr = DMPlexShiftTree_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 736cd0c2139SMatthew G Knepley ierr = PetscFree(depthShift);CHKERRQ(ierr); 737966c7b3fSMatthew G. Knepley /* Step 7: Periodicity */ 738966c7b3fSMatthew G. Knepley if (dm->maxCell) { 739966c7b3fSMatthew G. Knepley const PetscReal *maxCell, *L; 7405dc8c3f7SMatthew G. Knepley const DMBoundaryType *bd; 7415dc8c3f7SMatthew G. Knepley ierr = DMGetPeriodicity(dm, &maxCell, &L, &bd);CHKERRQ(ierr); 7425dc8c3f7SMatthew G. Knepley ierr = DMSetPeriodicity(gdm, maxCell, L, bd);CHKERRQ(ierr); 743966c7b3fSMatthew G. Knepley } 7444a6cfa73SMatthew G. Knepley if (numGhostCells) *numGhostCells = Ng; 745cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 746cd0c2139SMatthew G Knepley } 747cd0c2139SMatthew G Knepley 748cd0c2139SMatthew G Knepley /*@C 749cd0c2139SMatthew G Knepley DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face 750cd0c2139SMatthew G Knepley 751cd0c2139SMatthew G Knepley Collective on dm 752cd0c2139SMatthew G Knepley 753cd0c2139SMatthew G Knepley Input Parameters: 754cd0c2139SMatthew G Knepley + dm - The original DM 755cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL 756cd0c2139SMatthew G Knepley 757cd0c2139SMatthew G Knepley Output Parameters: 758cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM 759cd0c2139SMatthew G Knepley - dmGhosted - The new DM 760cd0c2139SMatthew G Knepley 761cd0c2139SMatthew G Knepley Note: If no label exists of that name, one will be created marking all boundary faces 762cd0c2139SMatthew G Knepley 763cd0c2139SMatthew G Knepley Level: developer 764cd0c2139SMatthew G Knepley 765cd0c2139SMatthew G Knepley .seealso: DMCreate() 76631266bc0SMatthew G. Knepley @*/ 767cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted) 768cd0c2139SMatthew G Knepley { 769cd0c2139SMatthew G Knepley DM gdm; 770cd0c2139SMatthew G Knepley DMLabel label; 771cd0c2139SMatthew G Knepley const char *name = labelName ? labelName : "Face Sets"; 772cd0c2139SMatthew G Knepley PetscInt dim; 773a42b08eeSMatthew G. Knepley PetscBool flag; 774cd0c2139SMatthew G Knepley PetscErrorCode ierr; 775cd0c2139SMatthew G Knepley 776cd0c2139SMatthew G Knepley PetscFunctionBegin; 777cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 7784a6cfa73SMatthew G. Knepley if (numGhostCells) PetscValidPointer(numGhostCells, 3); 779cd0c2139SMatthew G Knepley PetscValidPointer(dmGhosted, 4); 780cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr); 781cd0c2139SMatthew G Knepley ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr); 782c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 783c73cfb54SMatthew G. Knepley ierr = DMSetDimension(gdm, dim);CHKERRQ(ierr); 784a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseCone(dm, &flag);CHKERRQ(ierr); 785a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseCone(gdm, flag);CHKERRQ(ierr); 786a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseClosure(dm, &flag);CHKERRQ(ierr); 787a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseClosure(gdm, flag);CHKERRQ(ierr); 788c58f1c22SToby Isaac ierr = DMGetLabel(dm, name, &label);CHKERRQ(ierr); 789cd0c2139SMatthew G Knepley if (!label) { 790cd0c2139SMatthew G Knepley /* Get label for boundary faces */ 791c58f1c22SToby Isaac ierr = DMCreateLabel(dm, name);CHKERRQ(ierr); 792c58f1c22SToby Isaac ierr = DMGetLabel(dm, name, &label);CHKERRQ(ierr); 793cd0c2139SMatthew G Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 794cd0c2139SMatthew G Knepley } 795cd0c2139SMatthew G Knepley ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr); 796a6ba4734SToby Isaac ierr = DMCopyBoundary(dm, gdm);CHKERRQ(ierr); 797cd0c2139SMatthew G Knepley *dmGhosted = gdm; 798cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 799cd0c2139SMatthew G Knepley } 800cd0c2139SMatthew G Knepley 801607ab7a9SMatthew G. Knepley /* 802faedd622SMatthew G. Knepley We are adding three kinds of points here: 803607ab7a9SMatthew G. Knepley Replicated: Copies of points which exist in the mesh, such as vertices identified across a fault 804faedd622SMatthew G. Knepley Non-replicated: Points which exist on the fault, but are not replicated 805607ab7a9SMatthew G. Knepley Hybrid: Entirely new points, such as cohesive cells 806a6ae58d1SMatthew G. Knepley 807a6ae58d1SMatthew G. Knepley When creating subsequent cohesive cells, we shift the old hybrid cells to the end of the numbering at 808a6ae58d1SMatthew G. Knepley each depth so that the new split/hybrid points can be inserted as a block. 809607ab7a9SMatthew G. Knepley */ 810cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm) 811cd0c2139SMatthew G Knepley { 812cd0c2139SMatthew G Knepley MPI_Comm comm; 813607ab7a9SMatthew G. Knepley IS valueIS; 814607ab7a9SMatthew G. Knepley PetscInt numSP = 0; /* The number of depths for which we have replicated points */ 815607ab7a9SMatthew G. Knepley const PetscInt *values; /* List of depths for which we have replicated points */ 81618c5995bSMatthew G. Knepley IS *splitIS; 81718c5995bSMatthew G. Knepley IS *unsplitIS; 818607ab7a9SMatthew G. Knepley PetscInt *numSplitPoints; /* The number of replicated points at each depth */ 81918c5995bSMatthew G. Knepley PetscInt *numUnsplitPoints; /* The number of non-replicated points at each depth which still give rise to hybrid points */ 82036dbac82SMatthew G. Knepley PetscInt *numHybridPoints; /* The number of new hybrid points at each depth */ 82136dbac82SMatthew G. Knepley PetscInt *numHybridPointsOld; /* The number of existing hybrid points at each depth */ 822607ab7a9SMatthew G. Knepley const PetscInt **splitPoints; /* Replicated points for each depth */ 82318c5995bSMatthew G. Knepley const PetscInt **unsplitPoints; /* Non-replicated points for each depth */ 824cd0c2139SMatthew G Knepley PetscSection coordSection; 825cd0c2139SMatthew G Knepley Vec coordinates; 826cd0c2139SMatthew G Knepley PetscScalar *coords; 827a6ae58d1SMatthew G. Knepley PetscInt *depthMax; /* The first hybrid point at each depth in the original mesh */ 828a6ae58d1SMatthew G. Knepley PetscInt *depthEnd; /* The point limit at each depth in the original mesh */ 829607ab7a9SMatthew G. Knepley PetscInt *depthShift; /* Number of replicated+hybrid points at each depth */ 830607ab7a9SMatthew G. Knepley PetscInt *pMaxNew; /* The first replicated point at each depth in the new mesh, hybrids come after this */ 831607ab7a9SMatthew G. Knepley PetscInt *coneNew, *coneONew, *supportNew; 83218c5995bSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v; 833cd0c2139SMatthew G Knepley PetscErrorCode ierr; 834cd0c2139SMatthew G Knepley 835cd0c2139SMatthew G Knepley PetscFunctionBegin; 836cd0c2139SMatthew G Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 837c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 838607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 839fd4b9f15SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 840cd0c2139SMatthew G Knepley /* Count split points and add cohesive cells */ 841607ab7a9SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 8422582d50cSToby Isaac ierr = PetscMalloc5(depth+1,&depthMax,depth+1,&depthEnd,2*(depth+1),&depthShift,depth+1,&pMaxNew,depth+1,&numHybridPointsOld);CHKERRQ(ierr); 843dcca6d9dSJed 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); 844a6ae58d1SMatthew 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); 845607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 846607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 847a6ae58d1SMatthew G. Knepley depthEnd[d] = pMaxNew[d]; 848a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 849607ab7a9SMatthew G. Knepley numSplitPoints[d] = 0; 85018c5995bSMatthew G. Knepley numUnsplitPoints[d] = 0; 851607ab7a9SMatthew G. Knepley numHybridPoints[d] = 0; 852a6ae58d1SMatthew G. Knepley numHybridPointsOld[d] = depthMax[d] < 0 ? 0 : depthEnd[d] - depthMax[d]; 853607ab7a9SMatthew G. Knepley splitPoints[d] = NULL; 85418c5995bSMatthew G. Knepley unsplitPoints[d] = NULL; 85518c5995bSMatthew G. Knepley splitIS[d] = NULL; 85618c5995bSMatthew G. Knepley unsplitIS[d] = NULL; 85759eef20bSToby Isaac /* we are shifting the existing hybrid points with the stratum behind them, so 85859eef20bSToby Isaac * the split comes at the end of the normal points, i.e., at depthMax[d] */ 85959eef20bSToby Isaac depthShift[2*d] = depthMax[d]; 86059eef20bSToby Isaac depthShift[2*d+1] = 0; 861607ab7a9SMatthew G. Knepley } 862cd0c2139SMatthew G Knepley if (label) { 863cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 864cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 865cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 866cd0c2139SMatthew G Knepley } 867cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 868cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 869cd0c2139SMatthew G Knepley 870cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 87118c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr); 87218c5995bSMatthew G. Knepley if (splitIS[dep]) { 87318c5995bSMatthew G. Knepley ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 87418c5995bSMatthew G. Knepley ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 87518c5995bSMatthew G. Knepley } 87618c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr); 87718c5995bSMatthew G. Knepley if (unsplitIS[dep]) { 87818c5995bSMatthew G. Knepley ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr); 87918c5995bSMatthew G. Knepley ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr); 880cd0c2139SMatthew G Knepley } 881cd0c2139SMatthew G Knepley } 882607ab7a9SMatthew G. Knepley /* Calculate number of hybrid points */ 88318c5995bSMatthew 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 */ 8842582d50cSToby Isaac for (d = 0; d <= depth; ++d) depthShift[2*d+1] = numSplitPoints[d] + numHybridPoints[d]; 8853d3eaba7SBarry Smith ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift);CHKERRQ(ierr); 88659eef20bSToby Isaac /* the end of the points in this stratum that come before the new points: 88759eef20bSToby Isaac * shifting pMaxNew[d] gets the new start of the next stratum, then count back the old hybrid points and the newly 88859eef20bSToby Isaac * added points */ 8892582d50cSToby Isaac for (d = 0; d <= depth; ++d) pMaxNew[d] = DMPlexShiftPoint_Internal(pMaxNew[d],depth,depthShift) - (numHybridPointsOld[d] + numSplitPoints[d] + numHybridPoints[d]); 890cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 891cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 892cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 893cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 894cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 8952582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 8964c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 897cd0c2139SMatthew G Knepley const PetscInt *support; 8984c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, qf, qn, qp, e; 899cd0c2139SMatthew G Knepley 900cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 901cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 902cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 903cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 904cd0c2139SMatthew G Knepley if (dep == depth-1) { 9054c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 9064c367dbcSMatthew G. Knepley 907cd0c2139SMatthew G Knepley /* Add cohesive cells, they are prisms */ 9084c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr); 909cd0c2139SMatthew G Knepley } else if (dep == 0) { 9104c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 911cd0c2139SMatthew G Knepley 912cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 9134c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 914cd0c2139SMatthew G Knepley PetscInt val; 915cd0c2139SMatthew G Knepley 916cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 9174c367dbcSMatthew G. Knepley if (val == 1) ++qf; 9184c367dbcSMatthew G. Knepley if ((val == 1) || (val == (shift + 1))) ++qn; 9194c367dbcSMatthew G. Knepley if ((val == 1) || (val == -(shift + 1))) ++qp; 920cd0c2139SMatthew G Knepley } 9214c367dbcSMatthew G. Knepley /* Split old vertex: Edges into original vertex and new cohesive edge */ 9224c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 9234c367dbcSMatthew G. Knepley /* Split new vertex: Edges into split vertex and new cohesive edge */ 9244c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 9254c367dbcSMatthew G. Knepley /* Add hybrid edge */ 9264c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 9274c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 928cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 9294c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 9304c367dbcSMatthew G. Knepley 931cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 9324c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 933cd0c2139SMatthew G Knepley PetscInt val; 934cd0c2139SMatthew G Knepley 935cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 9364c367dbcSMatthew G. Knepley if (val == dim-1) ++qf; 9374c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 9384c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 939cd0c2139SMatthew G Knepley } 9404c367dbcSMatthew G. Knepley /* Split old edge: Faces into original edge and cohesive face (positive side?) */ 9414c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 9424c367dbcSMatthew G. Knepley /* Split new edge: Faces into split edge and cohesive face (negative side?) */ 9434c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 9444c367dbcSMatthew G. Knepley /* Add hybrid face */ 9454c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 9464c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 947cd0c2139SMatthew G Knepley } 948cd0c2139SMatthew G Knepley } 949cd0c2139SMatthew G Knepley } 95018c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 95118c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 95218c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 9532582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 95418c5995bSMatthew G. Knepley const PetscInt *support; 955da1dd7e4SMatthew G. Knepley PetscInt coneSize, supportSize, qf, e, s; 95618c5995bSMatthew G. Knepley 95718c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 95818c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 95939254ff6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 96018c5995bSMatthew G. Knepley if (dep == 0) { 96118c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 96218c5995bSMatthew G. Knepley 96339254ff6SMatthew G. Knepley /* Unsplit vertex: Edges into original vertex, split edges, and new cohesive edge twice */ 96439254ff6SMatthew G. Knepley for (s = 0, qf = 0; s < supportSize; ++s, ++qf) { 96539254ff6SMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 96639254ff6SMatthew G. Knepley if (e >= 0) ++qf; 96739254ff6SMatthew G. Knepley } 96839254ff6SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 96918c5995bSMatthew G. Knepley /* Add hybrid edge */ 97018c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 971e1757548SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 972e1757548SMatthew G. Knepley PetscInt val; 973e1757548SMatthew G. Knepley 974e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 975e1757548SMatthew G. Knepley /* Split and unsplit edges produce hybrid faces */ 976da1dd7e4SMatthew G. Knepley if (val == 1) ++qf; 977da1dd7e4SMatthew G. Knepley if (val == (shift2 + 1)) ++qf; 978e1757548SMatthew G. Knepley } 979e1757548SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 98018c5995bSMatthew G. Knepley } else if (dep == dim-2) { 98118c5995bSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 982cd0c2139SMatthew G Knepley PetscInt val; 983cd0c2139SMatthew G Knepley 984da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 985cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 986da1dd7e4SMatthew G. Knepley if (val == dim-1) qf += 2; 987da1dd7e4SMatthew G. Knepley else ++qf; 988cd0c2139SMatthew G Knepley } 98918c5995bSMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */ 990da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 99118c5995bSMatthew G. Knepley /* Add hybrid face */ 992da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 993da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 994da1dd7e4SMatthew G. Knepley if (val == dim-1) ++qf; 995da1dd7e4SMatthew G. Knepley } 99618c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 997da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 998cd0c2139SMatthew G Knepley } 999cd0c2139SMatthew G Knepley } 1000cd0c2139SMatthew G Knepley } 1001cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 1002cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 1003cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1004dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 1005dcca6d9dSJed Brown ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),&supportNew);CHKERRQ(ierr); 1006cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 1007cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1008cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 1009cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 10102582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 10114c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 1012cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 10134c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, q, qf, qn, qp, v, e, s; 1014cd0c2139SMatthew G Knepley 1015cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 1016cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 1017cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 1018cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 1019cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 1020cd0c2139SMatthew G Knepley if (dep == depth-1) { 102196a07cd0SMatthew G. Knepley PetscBool hasUnsplit = PETSC_FALSE; 10224c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1023cd0c2139SMatthew G Knepley const PetscInt *supportF; 1024cd0c2139SMatthew G Knepley 1025cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 1026cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 1027cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 1028cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 1029cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 1030cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 10314c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 103218c5995bSMatthew G. Knepley if (v < 0) { 103318c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 103418c5995bSMatthew 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); 10352582d50cSToby Isaac coneNew[2+q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/; 103696a07cd0SMatthew G. Knepley hasUnsplit = PETSC_TRUE; 103718c5995bSMatthew G. Knepley } else { 10384c367dbcSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep-1]; 1039163235baSMatthew G. Knepley if (dep > 1) { 1040163235baSMatthew G. Knepley const PetscInt *econe; 1041163235baSMatthew G. Knepley PetscInt econeSize, r, vs, vu; 1042163235baSMatthew G. Knepley 1043163235baSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[q], &econeSize);CHKERRQ(ierr); 1044163235baSMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[q], &econe);CHKERRQ(ierr); 1045163235baSMatthew G. Knepley for (r = 0; r < econeSize; ++r) { 1046163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numSplitPoints[dep-2], splitPoints[dep-2], &vs);CHKERRQ(ierr); 1047163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numUnsplitPoints[dep-2], unsplitPoints[dep-2], &vu);CHKERRQ(ierr); 1048163235baSMatthew G. Knepley if (vs >= 0) continue; 1049163235baSMatthew 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); 1050163235baSMatthew G. Knepley hasUnsplit = PETSC_TRUE; 1051163235baSMatthew G. Knepley } 1052163235baSMatthew G. Knepley } 1053cd0c2139SMatthew G Knepley } 1054cd0c2139SMatthew G Knepley } 1055cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 1056cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 1057e537020bSMatthew G. Knepley /* Face support */ 1058cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1059cd0c2139SMatthew G Knepley PetscInt val; 1060cd0c2139SMatthew G Knepley 1061cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 1062cd0c2139SMatthew G Knepley if (val < 0) { 1063cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 10644c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr); 1065cd0c2139SMatthew G Knepley } else { 1066cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 10674c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr); 1068e537020bSMatthew G. Knepley /* Get orientation for cohesive face */ 1069e537020bSMatthew G. Knepley { 1070e537020bSMatthew G. Knepley const PetscInt *ncone, *nconeO; 1071e537020bSMatthew G. Knepley PetscInt nconeSize, nc; 1072e537020bSMatthew G. Knepley 1073e537020bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 1074e537020bSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 1075e537020bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 1076e537020bSMatthew G. Knepley for (nc = 0; nc < nconeSize; ++nc) { 1077e537020bSMatthew G. Knepley if (ncone[nc] == oldp) { 1078e537020bSMatthew G. Knepley coneONew[0] = nconeO[nc]; 1079e537020bSMatthew G. Knepley break; 1080cd0c2139SMatthew G Knepley } 1081cd0c2139SMatthew G Knepley } 1082e537020bSMatthew 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]); 1083e537020bSMatthew G. Knepley } 1084e537020bSMatthew G. Knepley } 1085e537020bSMatthew G. Knepley } 10864c367dbcSMatthew G. Knepley /* Cohesive cell: Old and new split face, then new cohesive faces */ 1087fd4b9f15SMatthew G. Knepley coneNew[0] = newp; /* Extracted negative side orientation above */ 10884c367dbcSMatthew G. Knepley coneNew[1] = splitp; 10894c367dbcSMatthew G. Knepley coneONew[1] = coneONew[0]; 1090e537020bSMatthew G. Knepley for (q = 0; q < coneSize; ++q) { 109118c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 109218c5995bSMatthew G. Knepley if (v < 0) { 109318c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 109418c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 109518c5995bSMatthew G. Knepley coneONew[2+q] = 0; 109618c5995bSMatthew G. Knepley } else { 109718c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep]; 109818c5995bSMatthew G. Knepley } 1099e537020bSMatthew G. Knepley coneONew[2+q] = 0; 1100e537020bSMatthew G. Knepley } 11014c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr); 11024c367dbcSMatthew G. Knepley ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr); 110396a07cd0SMatthew G. Knepley /* Label the hybrid cells on the boundary of the split */ 110496a07cd0SMatthew G. Knepley if (hasUnsplit) {ierr = DMLabelSetValue(label, -hybcell, dim);CHKERRQ(ierr);} 1105cd0c2139SMatthew G Knepley } else if (dep == 0) { 11064c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1107cd0c2139SMatthew G Knepley 1108cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 11094c367dbcSMatthew G. Knepley for (e = 0, qn = 0; e < supportSize; ++e) { 1110cd0c2139SMatthew G Knepley PetscInt val; 1111cd0c2139SMatthew G Knepley 1112cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1113cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 11142582d50cSToby Isaac supportNew[qn++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1115cd0c2139SMatthew G Knepley } 1116cd0c2139SMatthew G Knepley } 11174c367dbcSMatthew G. Knepley supportNew[qn] = hybedge; 1118cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1119cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 11204c367dbcSMatthew G. Knepley for (e = 0, qp = 0; e < supportSize; ++e) { 1121cd0c2139SMatthew G Knepley PetscInt val, edge; 1122cd0c2139SMatthew G Knepley 1123cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1124cd0c2139SMatthew G Knepley if (val == 1) { 11254c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 1126cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 11274c367dbcSMatthew G. Knepley supportNew[qp++] = edge + pMaxNew[dep+1]; 1128cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 11292582d50cSToby Isaac supportNew[qp++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1130cd0c2139SMatthew G Knepley } 1131cd0c2139SMatthew G Knepley } 11324c367dbcSMatthew G. Knepley supportNew[qp] = hybedge; 1133cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 11344c367dbcSMatthew G. Knepley /* Hybrid edge: Old and new split vertex */ 1135cd0c2139SMatthew G Knepley coneNew[0] = newp; 1136cd0c2139SMatthew G Knepley coneNew[1] = splitp; 11374c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 11384c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 11394c367dbcSMatthew G. Knepley PetscInt val, edge; 11404c367dbcSMatthew G. Knepley 11414c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 11424c367dbcSMatthew G. Knepley if (val == 1) { 11434c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 11444c367dbcSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 11454c367dbcSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 11464c367dbcSMatthew G. Knepley } 11474c367dbcSMatthew G. Knepley } 11484c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1149cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 11504c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 11514c367dbcSMatthew G. Knepley 1152cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 1153cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 1154cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 11554c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 1156e1757548SMatthew G. Knepley if (v < 0) { 1157e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1158e1757548SMatthew 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); 11592582d50cSToby Isaac coneNew[q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/; 1160e1757548SMatthew G. Knepley } else { 11614c367dbcSMatthew G. Knepley coneNew[q] = v + pMaxNew[dep-1]; 1162cd0c2139SMatthew G Knepley } 1163e1757548SMatthew G. Knepley } 1164cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 1165cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 1166cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 1167cd0c2139SMatthew G Knepley PetscInt val; 1168cd0c2139SMatthew G Knepley 1169cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 11704c367dbcSMatthew G. Knepley if (val == dim-1) { 11712582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 11724c367dbcSMatthew G. Knepley } else if (val == (shift + dim-1)) { 11732582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1174cd0c2139SMatthew G Knepley } 1175cd0c2139SMatthew G Knepley } 1176b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1177cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1178cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 1179cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 1180cd0c2139SMatthew G Knepley PetscInt val, face; 1181cd0c2139SMatthew G Knepley 1182cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1183cd0c2139SMatthew G Knepley if (val == dim-1) { 11844c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1185cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 11864c367dbcSMatthew G. Knepley supportNew[q++] = face + pMaxNew[dep+1]; 1187cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 11882582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1189cd0c2139SMatthew G Knepley } 1190cd0c2139SMatthew G Knepley } 1191b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1192cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 11934c367dbcSMatthew G. Knepley /* Hybrid face */ 11944c367dbcSMatthew G. Knepley coneNew[0] = newp; 11954c367dbcSMatthew G. Knepley coneNew[1] = splitp; 11964c367dbcSMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 11974c367dbcSMatthew G. Knepley PetscInt vertex; 11984c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr); 1199e1757548SMatthew G. Knepley if (vertex < 0) { 1200e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr); 1201e1757548SMatthew 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); 1202e1757548SMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1203e1757548SMatthew G. Knepley } else { 12044c367dbcSMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep]; 12054c367dbcSMatthew G. Knepley } 1206e1757548SMatthew G. Knepley } 12074c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 12084c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 12094c367dbcSMatthew G. Knepley PetscInt val, face; 12104c367dbcSMatthew G. Knepley 12114c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 12124c367dbcSMatthew G. Knepley if (val == dim-1) { 12134c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 12144c367dbcSMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 12154c367dbcSMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 12164c367dbcSMatthew G. Knepley } 12174c367dbcSMatthew G. Knepley } 12184c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1219cd0c2139SMatthew G Knepley } 1220cd0c2139SMatthew G Knepley } 1221cd0c2139SMatthew G Knepley } 122218c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 122318c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 122418c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 12252582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 122618c5995bSMatthew G. Knepley const PetscInt *cone, *support, *ornt; 1227e1757548SMatthew G. Knepley PetscInt coneSize, supportSize, supportSizeNew, q, qf, e, f, s; 122818c5995bSMatthew G. Knepley 122918c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 123018c5995bSMatthew G. Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 123118c5995bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 123218c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 123318c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 123418c5995bSMatthew G. Knepley if (dep == 0) { 123518c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 123618c5995bSMatthew G. Knepley 123718c5995bSMatthew G. Knepley /* Unsplit vertex */ 123818c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 123918c5995bSMatthew G. Knepley for (s = 0, q = 0; s < supportSize; ++s) { 12402582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[s], depth, depthShift) /*support[s] + depthOffset[dep+1]*/; 124118c5995bSMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 124218c5995bSMatthew G. Knepley if (e >= 0) { 124318c5995bSMatthew G. Knepley supportNew[q++] = e + pMaxNew[dep+1]; 124418c5995bSMatthew G. Knepley } 124518c5995bSMatthew G. Knepley } 124618c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 124718c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 124818c5995bSMatthew G. Knepley if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp); 124918c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 125018c5995bSMatthew G. Knepley /* Hybrid edge */ 125118c5995bSMatthew G. Knepley coneNew[0] = newp; 125218c5995bSMatthew G. Knepley coneNew[1] = newp; 125318c5995bSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 125418c5995bSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 125518c5995bSMatthew G. Knepley PetscInt val, edge; 125618c5995bSMatthew G. Knepley 125718c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 125818c5995bSMatthew G. Knepley if (val == 1) { 125918c5995bSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 126018c5995bSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 126118c5995bSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1262e1757548SMatthew G. Knepley } else if (val == (shift2 + 1)) { 1263e1757548SMatthew G. Knepley ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr); 1264e1757548SMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]); 1265e1757548SMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1]; 126618c5995bSMatthew G. Knepley } 126718c5995bSMatthew G. Knepley } 126818c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1269e1757548SMatthew G. Knepley } else if (dep == dim-2) { 1270e1757548SMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 1271e1757548SMatthew G. Knepley 1272da1dd7e4SMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and hybrid face twice */ 1273e1757548SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1274e1757548SMatthew G. Knepley PetscInt val, face; 1275e1757548SMatthew G. Knepley 1276e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1277e1757548SMatthew G. Knepley if (val == dim-1) { 1278e1757548SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1279e1757548SMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]); 12802582d50cSToby Isaac supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/; 1281e1757548SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+1]; 1282e1757548SMatthew G. Knepley } else { 12832582d50cSToby Isaac supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/; 1284e1757548SMatthew G. Knepley } 1285e1757548SMatthew G. Knepley } 1286e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1287e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1288da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 1289da1dd7e4SMatthew 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); 1290e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1291e1757548SMatthew G. Knepley /* Add hybrid face */ 1292e1757548SMatthew G. Knepley coneNew[0] = newp; 1293212cc919SMatthew G. Knepley coneNew[1] = newp; 1294e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[0], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1295e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[0]); 1296212cc919SMatthew G. Knepley coneNew[2] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1297e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1298e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]); 1299e1757548SMatthew G. Knepley coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1300e1757548SMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 1301da1dd7e4SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1302da1dd7e4SMatthew G. Knepley PetscInt val, face; 1303da1dd7e4SMatthew G. Knepley 1304da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1305da1dd7e4SMatthew G. Knepley if (val == dim-1) { 1306da1dd7e4SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1307da1dd7e4SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1308da1dd7e4SMatthew G. Knepley } 1309da1dd7e4SMatthew G. Knepley } 1310da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, hybface, &supportSizeNew);CHKERRQ(ierr); 1311da1dd7e4SMatthew 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); 1312e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1313cd0c2139SMatthew G Knepley } 1314cd0c2139SMatthew G Knepley } 1315cd0c2139SMatthew G Knepley } 1316cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 1317cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1318cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 1319cd0c2139SMatthew G Knepley IS pIS; 1320cd0c2139SMatthew G Knepley PetscInt numPoints; 1321cd0c2139SMatthew G Knepley const PetscInt *points; 1322cd0c2139SMatthew G Knepley 1323cd0c2139SMatthew G Knepley if (dep >= 0) continue; 1324cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 1325cd0c2139SMatthew G Knepley if (!pIS) continue; 1326cd0c2139SMatthew G Knepley dep = -dep - shift; 1327cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 1328cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 1329cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1330cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 13312582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*depthOffset[dep] + oldp*/; 1332cd0c2139SMatthew G Knepley const PetscInt *cone; 1333cd0c2139SMatthew G Knepley PetscInt coneSize, c; 133450cf782dSMatthew G. Knepley /* PetscBool replaced = PETSC_FALSE; */ 1335cd0c2139SMatthew G Knepley 1336cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 1337cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 1338cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 1339cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 1340cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1341e38fbfedSToby Isaac const PetscInt coldp = DMPlexShiftPointInverse_Internal(cone[c],depth,depthShift); 1342cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 1343cd0c2139SMatthew G Knepley 1344cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 1345cd0c2139SMatthew G Knepley if (val == dep-1) { 1346cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 1347cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 1348cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 1349cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 135050cf782dSMatthew G. Knepley /* replaced = PETSC_TRUE; */ 1351cd0c2139SMatthew G Knepley } 1352cd0c2139SMatthew G Knepley } 13534a189a86SMatthew G. Knepley /* Cells with only a vertex or edge on the submesh have no replacement */ 13544a189a86SMatthew G. Knepley /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 1355cd0c2139SMatthew G Knepley } 1356cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 1357cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 1358cd0c2139SMatthew G Knepley } 1359cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 1360cd0c2139SMatthew G Knepley ierr = DMPlexStratify(sdm);CHKERRQ(ierr); 1361cd0c2139SMatthew G Knepley /* Step 8: Coordinates */ 1362cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 136369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 1364cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 1365cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 1366cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 13672582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[0][v], depth, depthShift) /*depthOffset[0] + splitPoints[0][v]*/; 1368cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 1369cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 1370cd0c2139SMatthew G Knepley 1371cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 1372cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 1373cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 1374cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 1375cd0c2139SMatthew G Knepley } 1376cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 1377cd0c2139SMatthew G Knepley /* Step 9: SF, if I can figure this out we can split the mesh in parallel */ 1378cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1379cd0c2139SMatthew G Knepley /* Step 10: Labels */ 1380cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1381c58f1c22SToby Isaac ierr = DMGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 1382cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1383cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 13842582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[dep][p], depth, depthShift) /*depthOffset[dep] + splitPoints[dep][p]*/; 1385cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 1386cd0c2139SMatthew G Knepley PetscInt l; 1387cd0c2139SMatthew G Knepley 1388cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 1389cd0c2139SMatthew G Knepley DMLabel mlabel; 1390cd0c2139SMatthew G Knepley const char *lname; 1391cd0c2139SMatthew G Knepley PetscInt val; 13929a356370SMatthew G. Knepley PetscBool isDepth; 1393cd0c2139SMatthew G Knepley 1394c58f1c22SToby Isaac ierr = DMGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 13959a356370SMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 13969a356370SMatthew G. Knepley if (isDepth) continue; 1397c58f1c22SToby Isaac ierr = DMGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 1398cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 1399cd0c2139SMatthew G Knepley if (val >= 0) { 1400cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 14019a356370SMatthew G. Knepley #if 0 14029a356370SMatthew G. Knepley /* Do not put cohesive edges into the label */ 1403cd0c2139SMatthew G Knepley if (dep == 0) { 14044c367dbcSMatthew G. Knepley const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1405cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr); 14064c367dbcSMatthew G. Knepley } else if (dep == dim-2) { 14074c367dbcSMatthew G. Knepley const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 14084c367dbcSMatthew G. Knepley ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr); 1409cd0c2139SMatthew G Knepley } 14104c367dbcSMatthew G. Knepley /* Do not put cohesive faces into the label */ 14119a356370SMatthew G. Knepley #endif 1412cd0c2139SMatthew G Knepley } 1413cd0c2139SMatthew G Knepley } 1414cd0c2139SMatthew G Knepley } 1415cd0c2139SMatthew G Knepley } 1416cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1417cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 1418cd0c2139SMatthew G Knepley 1419cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 142018c5995bSMatthew G. Knepley if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 142118c5995bSMatthew G. Knepley ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr); 142218c5995bSMatthew G. Knepley if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);} 142318c5995bSMatthew G. Knepley ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr); 1424cd0c2139SMatthew G Knepley } 1425cd0c2139SMatthew G Knepley if (label) { 1426cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1427cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1428cd0c2139SMatthew G Knepley } 14290d4d4d06SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 14300d4d4d06SMatthew G. Knepley ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr); 143136dbac82SMatthew G. Knepley pMaxNew[d] = pEnd - numHybridPoints[d] - numHybridPointsOld[d]; 14320d4d4d06SMatthew G. Knepley } 14330e49e2e2SMatthew 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); 1434dcbb62e8SMatthew G. Knepley ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr); 14352582d50cSToby Isaac ierr = PetscFree5(depthMax, depthEnd, depthShift, pMaxNew, numHybridPointsOld);CHKERRQ(ierr); 143618c5995bSMatthew G. Knepley ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr); 1437cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1438cd0c2139SMatthew G Knepley } 1439cd0c2139SMatthew G Knepley 1440cd0c2139SMatthew G Knepley /*@C 1441cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 1442cd0c2139SMatthew G Knepley 1443cd0c2139SMatthew G Knepley Collective on dm 1444cd0c2139SMatthew G Knepley 1445cd0c2139SMatthew G Knepley Input Parameters: 1446cd0c2139SMatthew G Knepley + dm - The original DM 144753156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated) 1448cd0c2139SMatthew G Knepley 1449cd0c2139SMatthew G Knepley Output Parameters: 1450cd0c2139SMatthew G Knepley - dmSplit - The new DM 1451cd0c2139SMatthew G Knepley 1452cd0c2139SMatthew G Knepley Level: developer 1453cd0c2139SMatthew G Knepley 14542be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 1455cd0c2139SMatthew G Knepley @*/ 1456cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 1457cd0c2139SMatthew G Knepley { 1458cd0c2139SMatthew G Knepley DM sdm; 1459cd0c2139SMatthew G Knepley PetscInt dim; 1460cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1461cd0c2139SMatthew G Knepley 1462cd0c2139SMatthew G Knepley PetscFunctionBegin; 1463cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 146453156dfcSMatthew G. Knepley PetscValidPointer(dmSplit, 3); 1465cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 1466cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 1467c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1468c73cfb54SMatthew G. Knepley ierr = DMSetDimension(sdm, dim);CHKERRQ(ierr); 1469cd0c2139SMatthew G Knepley switch (dim) { 1470cd0c2139SMatthew G Knepley case 2: 1471cd0c2139SMatthew G Knepley case 3: 1472cd0c2139SMatthew G Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 1473cd0c2139SMatthew G Knepley break; 1474cd0c2139SMatthew G Knepley default: 1475cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 1476cd0c2139SMatthew G Knepley } 1477cd0c2139SMatthew G Knepley *dmSplit = sdm; 1478cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1479cd0c2139SMatthew G Knepley } 1480cd0c2139SMatthew G Knepley 14810f66a230SMatthew G. Knepley /* Returns the side of the surface for a given cell with a face on the surface */ 14820f66a230SMatthew G. Knepley static PetscErrorCode GetSurfaceSide_Static(DM dm, DM subdm, PetscInt numSubpoints, const PetscInt *subpoints, PetscInt cell, PetscInt face, PetscBool *pos) 14830f66a230SMatthew G. Knepley { 14840f66a230SMatthew G. Knepley const PetscInt *cone, *ornt; 14850f66a230SMatthew G. Knepley PetscInt dim, coneSize, c; 14860f66a230SMatthew G. Knepley PetscErrorCode ierr; 14870f66a230SMatthew G. Knepley 14880f66a230SMatthew G. Knepley PetscFunctionBegin; 14890f66a230SMatthew G. Knepley *pos = PETSC_TRUE; 1490c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 14910f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 14920f66a230SMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 14930f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, cell, &ornt);CHKERRQ(ierr); 14940f66a230SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 14950f66a230SMatthew G. Knepley if (cone[c] == face) { 14960f66a230SMatthew G. Knepley PetscInt o = ornt[c]; 14970f66a230SMatthew G. Knepley 14980f66a230SMatthew G. Knepley if (subdm) { 14990f66a230SMatthew G. Knepley const PetscInt *subcone, *subornt; 15000f66a230SMatthew G. Knepley PetscInt subpoint, subface, subconeSize, sc; 15010f66a230SMatthew G. Knepley 15020f66a230SMatthew G. Knepley ierr = PetscFindInt(cell, numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 15030f66a230SMatthew G. Knepley ierr = PetscFindInt(face, numSubpoints, subpoints, &subface);CHKERRQ(ierr); 15040f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 15050f66a230SMatthew G. Knepley ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 15060f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 15070f66a230SMatthew G. Knepley for (sc = 0; sc < subconeSize; ++sc) { 15080f66a230SMatthew G. Knepley if (subcone[sc] == subface) { 15090f66a230SMatthew G. Knepley o = subornt[0]; 15100f66a230SMatthew G. Knepley break; 15110f66a230SMatthew G. Knepley } 15120f66a230SMatthew G. Knepley } 15130f66a230SMatthew 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); 15140f66a230SMatthew G. Knepley } 15150f66a230SMatthew G. Knepley if (o >= 0) *pos = PETSC_TRUE; 15160f66a230SMatthew G. Knepley else *pos = PETSC_FALSE; 15170f66a230SMatthew G. Knepley break; 15180f66a230SMatthew G. Knepley } 15190f66a230SMatthew G. Knepley } 15200f66a230SMatthew 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); 15210f66a230SMatthew G. Knepley PetscFunctionReturn(0); 15220f66a230SMatthew G. Knepley } 15230f66a230SMatthew G. Knepley 1524cd0c2139SMatthew G Knepley /*@ 15250f66a230SMatthew G. Knepley DMPlexLabelCohesiveComplete - Starting with a label marking points on an internal surface, we add all other mesh pieces 1526cd0c2139SMatthew G Knepley to complete the surface 1527cd0c2139SMatthew G Knepley 1528cd0c2139SMatthew G Knepley Input Parameters: 1529cd0c2139SMatthew G Knepley + dm - The DM 15300f66a230SMatthew G. Knepley . label - A DMLabel marking the surface 15310f66a230SMatthew G. Knepley . blabel - A DMLabel marking the vertices on the boundary which will not be duplicated, or NULL to find them automatically 1532bb55d314SMatthew G. Knepley . flip - Flag to flip the submesh normal and replace points on the other side 153347946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL 1534cd0c2139SMatthew G Knepley 1535cd0c2139SMatthew G Knepley Output Parameter: 1536cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 1537cd0c2139SMatthew G Knepley 15380f66a230SMatthew G. Knepley Note: The vertices in blabel are called "unsplit" in the terminology from hybrid cell creation. 15390f66a230SMatthew G. Knepley 1540cd0c2139SMatthew G Knepley Level: developer 1541cd0c2139SMatthew G Knepley 15422be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 1543cd0c2139SMatthew G Knepley @*/ 15440f66a230SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, DMLabel blabel, PetscBool flip, DM subdm) 1545cd0c2139SMatthew G Knepley { 1546d90583fdSMatthew G. Knepley DMLabel depthLabel; 15478630cb1aSMatthew G. Knepley IS dimIS, subpointIS = NULL, facePosIS, faceNegIS, crossEdgeIS = NULL; 154847946fd8SMatthew G. Knepley const PetscInt *points, *subpoints; 1549bb55d314SMatthew G. Knepley const PetscInt rev = flip ? -1 : 1; 1550370472baSMatthew G. Knepley PetscInt *pMax; 1551370472baSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, dim, depth, pSize, dep, cStart, cEnd, cMax, fStart, fEnd, vStart, vEnd, numPoints, numSubpoints, p, val; 1552cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1553cd0c2139SMatthew G Knepley 1554cd0c2139SMatthew G Knepley PetscFunctionBegin; 1555370472baSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1556370472baSMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1557370472baSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1558370472baSMatthew G. Knepley ierr = PetscMalloc1(pSize,&pMax);CHKERRQ(ierr); 1559370472baSMatthew 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); 1560d90583fdSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 1561c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 156247946fd8SMatthew G. Knepley if (subdm) { 156347946fd8SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 156447946fd8SMatthew G. Knepley if (subpointIS) { 156547946fd8SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 156647946fd8SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 156747946fd8SMatthew G. Knepley } 156847946fd8SMatthew G. Knepley } 1569d7c8f101SMatthew G. Knepley /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */ 1570cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 1571dc86033cSMatthew G. Knepley if (!dimIS) { 1572dc86033cSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 15738630cb1aSMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 1574dc86033cSMatthew G. Knepley PetscFunctionReturn(0); 1575dc86033cSMatthew G. Knepley } 1576cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1577cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1578d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */ 1579cd0c2139SMatthew G Knepley const PetscInt *support; 1580cd0c2139SMatthew G Knepley PetscInt supportSize, s; 1581cd0c2139SMatthew G Knepley 1582cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1583cd0c2139SMatthew G Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 1584cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1585cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 15860f66a230SMatthew G. Knepley const PetscInt *cone; 1587cd0c2139SMatthew G Knepley PetscInt coneSize, c; 15880f66a230SMatthew G. Knepley PetscBool pos; 1589cd0c2139SMatthew G Knepley 15900f66a230SMatthew G. Knepley ierr = GetSurfaceSide_Static(dm, subdm, numSubpoints, subpoints, support[s], points[p], &pos);CHKERRQ(ierr); 15910f66a230SMatthew G. Knepley if (pos) {ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr);} 15920f66a230SMatthew G. Knepley else {ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);} 15930f66a230SMatthew G. Knepley if (rev < 0) pos = !pos ? PETSC_TRUE : PETSC_FALSE; 15940f66a230SMatthew G. Knepley /* Put faces touching the fault in the label */ 1595cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1596cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1597cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1598cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 1599cd0c2139SMatthew G Knepley 1600cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1601cd0c2139SMatthew G Knepley if (val == -1) { 1602cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 1603cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 1604cd0c2139SMatthew G Knepley 1605cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1606cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1607cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 1608a0541d8aSMatthew G. Knepley PetscInt bval = -1; 1609cd0c2139SMatthew G Knepley 1610cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1611a0541d8aSMatthew G. Knepley if (blabel) {ierr = DMLabelGetValue(blabel, clp, &bval);CHKERRQ(ierr);} 1612a0541d8aSMatthew G. Knepley if ((val >= 0) && (val < dim-1) && (bval < 0)) { 1613cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1614cd0c2139SMatthew G Knepley break; 1615cd0c2139SMatthew G Knepley } 1616cd0c2139SMatthew G Knepley } 1617cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1618cd0c2139SMatthew G Knepley } 1619cd0c2139SMatthew G Knepley } 1620cd0c2139SMatthew G Knepley } 1621cd0c2139SMatthew G Knepley } 16220f66a230SMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 16230f66a230SMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 162447946fd8SMatthew G. Knepley if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 162547946fd8SMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 1626a0541d8aSMatthew G. Knepley /* Mark boundary points as unsplit */ 162786200784SMatthew G. Knepley if (blabel) { 1628a0541d8aSMatthew G. Knepley ierr = DMLabelGetStratumIS(blabel, 1, &dimIS);CHKERRQ(ierr); 1629a0541d8aSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1630a0541d8aSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1631a0541d8aSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1632a0541d8aSMatthew G. Knepley const PetscInt point = points[p]; 1633a0541d8aSMatthew G. Knepley PetscInt val, bval; 1634a0541d8aSMatthew G. Knepley 1635a0541d8aSMatthew G. Knepley ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr); 1636a0541d8aSMatthew G. Knepley if (bval >= 0) { 1637f7019248SMatthew G. Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1638f7019248SMatthew G. Knepley if ((val < 0) || (val > dim)) { 1639f7019248SMatthew G. Knepley /* This could be a point added from splitting a vertex on an adjacent fault, otherwise its just wrong */ 1640f7019248SMatthew G. Knepley ierr = DMLabelClearValue(blabel, point, bval);CHKERRQ(ierr); 1641f7019248SMatthew G. Knepley } 1642f7019248SMatthew G. Knepley } 1643f7019248SMatthew G. Knepley } 1644f7019248SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1645f7019248SMatthew G. Knepley const PetscInt point = points[p]; 1646f7019248SMatthew G. Knepley PetscInt val, bval; 1647f7019248SMatthew G. Knepley 1648f7019248SMatthew G. Knepley ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr); 1649f7019248SMatthew G. Knepley if (bval >= 0) { 165086200784SMatthew G. Knepley const PetscInt *cone, *support; 165186200784SMatthew G. Knepley PetscInt coneSize, supportSize, s, valA, valB, valE; 165286200784SMatthew G. Knepley 1653a0541d8aSMatthew G. Knepley /* Mark as unsplit */ 1654a0541d8aSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1655a0541d8aSMatthew 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); 1656a0541d8aSMatthew G. Knepley ierr = DMLabelClearValue(label, point, val);CHKERRQ(ierr); 1657a0541d8aSMatthew G. Knepley ierr = DMLabelSetValue(label, point, shift2+val);CHKERRQ(ierr); 16582c06a818SMatthew G. Knepley /* Check for cross-edge 16592c06a818SMatthew G. Knepley A cross-edge has endpoints which are both on the boundary of the surface, but the edge itself is not. */ 166086200784SMatthew G. Knepley if (val != 0) continue; 166186200784SMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 166286200784SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 166386200784SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 166486200784SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 166586200784SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 166686200784SMatthew G. Knepley if (coneSize != 2) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Edge %D has %D vertices != 2", support[s], coneSize); 166786200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, cone[0], &valA);CHKERRQ(ierr); 166886200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, cone[1], &valB);CHKERRQ(ierr); 166986200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, support[s], &valE);CHKERRQ(ierr); 167009816f77SMatthew G. Knepley if ((valE < 0) && (valA >= 0) && (valB >= 0) && (cone[0] != cone[1])) {ierr = DMLabelSetValue(blabel, support[s], 2);CHKERRQ(ierr);} 167186200784SMatthew G. Knepley } 1672a0541d8aSMatthew G. Knepley } 1673a0541d8aSMatthew G. Knepley } 1674a0541d8aSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1675a0541d8aSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1676a0541d8aSMatthew G. Knepley } 1677cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1678c4d480a2SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 1679cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1680d24f5ce5SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1681d24f5ce5SMatthew G. Knepley cMax = cMax < 0 ? cEnd : cMax; 16820f66a230SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 1683cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 168486200784SMatthew G. Knepley if (blabel) {ierr = DMLabelGetStratumIS(blabel, 2, &crossEdgeIS);CHKERRQ(ierr);} 168586200784SMatthew G. Knepley if (dimIS && crossEdgeIS) { 168686200784SMatthew G. Knepley IS vertIS = dimIS; 168786200784SMatthew G. Knepley 168886200784SMatthew G. Knepley ierr = ISExpand(vertIS, crossEdgeIS, &dimIS);CHKERRQ(ierr); 168986200784SMatthew G. Knepley ierr = ISDestroy(&crossEdgeIS);CHKERRQ(ierr); 169086200784SMatthew G. Knepley ierr = ISDestroy(&vertIS);CHKERRQ(ierr); 169186200784SMatthew G. Knepley } 1692dc86033cSMatthew G. Knepley if (!dimIS) { 1693dc86033cSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1694dc86033cSMatthew G. Knepley PetscFunctionReturn(0); 1695dc86033cSMatthew G. Knepley } 1696cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1697cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1698d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */ 1699cd0c2139SMatthew G Knepley PetscInt *star = NULL; 170086200784SMatthew G. Knepley PetscInt starSize, s; 1701cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1702cd0c2139SMatthew G Knepley 1703d4622b2cSMatthew G. Knepley /* All points connected to the fault are inside a cell, so at the top level we will only check cells */ 1704cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1705cd0c2139SMatthew G Knepley while (again) { 1706cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1707cd0c2139SMatthew G Knepley again = 0; 1708cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1709cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1710cd0c2139SMatthew G Knepley const PetscInt *cone; 1711cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1712cd0c2139SMatthew G Knepley 1713d24f5ce5SMatthew G. Knepley if ((point < cStart) || (point >= cMax)) continue; 1714cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1715cd0c2139SMatthew G Knepley if (val != -1) continue; 1716d4622b2cSMatthew G. Knepley again = again == 1 ? 1 : 2; 1717cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1718cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1719cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1720cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1721cd0c2139SMatthew G Knepley if (val != -1) { 1722d7c8f101SMatthew G. Knepley const PetscInt *ccone; 1723166d9d0cSMatthew G. Knepley PetscInt cconeSize, cc, side; 1724d7c8f101SMatthew G. Knepley 1725db8edaafSMatthew 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); 172637a6de01SMatthew G. Knepley if (val > 0) side = 1; 172737a6de01SMatthew G. Knepley else side = -1; 172837a6de01SMatthew G. Knepley ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr); 1729d7c8f101SMatthew G. Knepley /* Mark cell faces which touch the fault */ 1730d7c8f101SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr); 1731d7c8f101SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr); 1732d7c8f101SMatthew G. Knepley for (cc = 0; cc < cconeSize; ++cc) { 1733d7c8f101SMatthew G. Knepley PetscInt *closure = NULL; 1734d7c8f101SMatthew G. Knepley PetscInt closureSize, cl; 1735d7c8f101SMatthew G. Knepley 1736166d9d0cSMatthew G. Knepley ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr); 1737166d9d0cSMatthew G. Knepley if (val != -1) continue; 1738d7c8f101SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1739d4622b2cSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1740d7c8f101SMatthew G. Knepley const PetscInt clp = closure[cl]; 1741d7c8f101SMatthew G. Knepley 1742d7c8f101SMatthew G. Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1743d7c8f101SMatthew G. Knepley if (val == -1) continue; 1744d7c8f101SMatthew G. Knepley ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr); 174537a6de01SMatthew G. Knepley break; 174637a6de01SMatthew G. Knepley } 1747d7c8f101SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1748cd0c2139SMatthew G Knepley } 1749cd0c2139SMatthew G Knepley again = 1; 1750cd0c2139SMatthew G Knepley break; 1751cd0c2139SMatthew G Knepley } 1752cd0c2139SMatthew G Knepley } 1753cd0c2139SMatthew G Knepley } 1754cd0c2139SMatthew G Knepley } 1755cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1756cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1757cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1758cd0c2139SMatthew G Knepley 1759cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1760cd0c2139SMatthew G Knepley if (val == -1) { 1761cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1762cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1763cd0c2139SMatthew G Knepley PetscBool marked = PETSC_FALSE; 1764cd0c2139SMatthew G Knepley 1765cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1766cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1767cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1768cd0c2139SMatthew G Knepley 1769d24f5ce5SMatthew G. Knepley if ((spoint < cStart) || (spoint >= cMax)) continue; 1770cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1771cd0c2139SMatthew 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); 1772d90583fdSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1773cd0c2139SMatthew G Knepley if (val > 0) { 1774cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1775cd0c2139SMatthew G Knepley } else { 1776cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1777cd0c2139SMatthew G Knepley } 1778cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1779cd0c2139SMatthew G Knepley break; 1780cd0c2139SMatthew G Knepley } 1781cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1782370472baSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1783370472baSMatthew G. Knepley if (point < pMax[dep] && !marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1784cd0c2139SMatthew G Knepley } 1785cd0c2139SMatthew G Knepley } 1786cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1787cd0c2139SMatthew G Knepley } 1788cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1789cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 179018c5995bSMatthew G. Knepley /* If any faces touching the fault divide cells on either side, split them */ 179118c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift+dim-1, &facePosIS);CHKERRQ(ierr); 179218c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr); 179318c5995bSMatthew G. Knepley ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr); 179418c5995bSMatthew G. Knepley ierr = ISDestroy(&facePosIS);CHKERRQ(ierr); 179518c5995bSMatthew G. Knepley ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr); 179618c5995bSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 179718c5995bSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 179818c5995bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 179918c5995bSMatthew G. Knepley const PetscInt point = points[p]; 180018c5995bSMatthew G. Knepley const PetscInt *support; 180118c5995bSMatthew G. Knepley PetscInt supportSize, valA, valB; 180218c5995bSMatthew G. Knepley 180318c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 180418c5995bSMatthew G. Knepley if (supportSize != 2) continue; 180518c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 180618c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr); 180718c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr); 180818c5995bSMatthew G. Knepley if ((valA == -1) || (valB == -1)) continue; 180918c5995bSMatthew G. Knepley if (valA*valB > 0) continue; 181018c5995bSMatthew G. Knepley /* Split the face */ 181118c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr); 181218c5995bSMatthew G. Knepley ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr); 181318c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr); 1814e1757548SMatthew G. Knepley /* Label its closure: 1815e1757548SMatthew G. Knepley unmarked: label as unsplit 1816e1757548SMatthew G. Knepley incident: relabel as split 1817e1757548SMatthew G. Knepley split: do nothing 1818e1757548SMatthew G. Knepley */ 181918c5995bSMatthew G. Knepley { 182018c5995bSMatthew G. Knepley PetscInt *closure = NULL; 182118c5995bSMatthew G. Knepley PetscInt closureSize, cl; 182218c5995bSMatthew G. Knepley 182318c5995bSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 182418c5995bSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 182518c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr); 18268771c1d3SMatthew G. Knepley if (valA == -1) { /* Mark as unsplit */ 182718c5995bSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 182818c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr); 18298771c1d3SMatthew G. Knepley } else if (((valA >= shift) && (valA < shift2)) || ((valA <= -shift) && (valA > -shift2))) { 1830e1757548SMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 1831e1757548SMatthew G. Knepley ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr); 1832e1757548SMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr); 1833e1757548SMatthew G. Knepley } 183418c5995bSMatthew G. Knepley } 183518c5995bSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 183618c5995bSMatthew G. Knepley } 183718c5995bSMatthew G. Knepley } 183818c5995bSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 183918c5995bSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1840370472baSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1841cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1842cd0c2139SMatthew G Knepley } 1843cd0c2139SMatthew G Knepley 18443cf72582SMatthew G. Knepley /*@C 18453cf72582SMatthew G. Knepley DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface 18463cf72582SMatthew G. Knepley 18473cf72582SMatthew G. Knepley Collective on dm 18483cf72582SMatthew G. Knepley 18493cf72582SMatthew G. Knepley Input Parameters: 18503cf72582SMatthew G. Knepley + dm - The original DM 18513cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices 18523cf72582SMatthew G. Knepley 18533cf72582SMatthew G. Knepley Output Parameters: 18543cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface 18553cf72582SMatthew G. Knepley - dmHybrid - The new DM 18563cf72582SMatthew G. Knepley 18573cf72582SMatthew G. Knepley Level: developer 18583cf72582SMatthew G. Knepley 18593cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate() 18603cf72582SMatthew G. Knepley @*/ 18613cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid) 18623cf72582SMatthew G. Knepley { 18633cf72582SMatthew G. Knepley DM idm; 18643cf72582SMatthew G. Knepley DMLabel subpointMap, hlabel; 18653cf72582SMatthew G. Knepley PetscInt dim; 18663cf72582SMatthew G. Knepley PetscErrorCode ierr; 18673cf72582SMatthew G. Knepley 18683cf72582SMatthew G. Knepley PetscFunctionBegin; 18693cf72582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 18703cf72582SMatthew G. Knepley if (hybridLabel) PetscValidPointer(hybridLabel, 3); 18713cf72582SMatthew G. Knepley PetscValidPointer(dmHybrid, 4); 1872c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 18733cf72582SMatthew G. Knepley ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr); 18743cf72582SMatthew G. Knepley ierr = DMPlexOrient(idm);CHKERRQ(ierr); 18753cf72582SMatthew G. Knepley ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr); 18763cf72582SMatthew G. Knepley ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr); 18773cf72582SMatthew G. Knepley ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr); 18780f66a230SMatthew G. Knepley ierr = DMPlexLabelCohesiveComplete(dm, hlabel, NULL, PETSC_FALSE, idm);CHKERRQ(ierr); 18793cf72582SMatthew G. Knepley ierr = DMDestroy(&idm);CHKERRQ(ierr); 18803cf72582SMatthew G. Knepley ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr); 18813cf72582SMatthew G. Knepley if (hybridLabel) *hybridLabel = hlabel; 188253aa2e23SMatthew G. Knepley else {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);} 1883cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1884cd0c2139SMatthew G Knepley } 1885cd0c2139SMatthew G Knepley 1886efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 1887efa14ee0SMatthew G Knepley 1888efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 1889efa14ee0SMatthew G Knepley */ 1890830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1891efa14ee0SMatthew G Knepley { 1892fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 1893efa14ee0SMatthew G Knepley const PetscInt *subvertices; 189477d178adSMatthew G. Knepley PetscInt *pStart, *pEnd, *pMax, pSize; 1895efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1896efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1897efa14ee0SMatthew G Knepley 1898efa14ee0SMatthew G Knepley PetscFunctionBegin; 1899efa14ee0SMatthew G Knepley *numFaces = 0; 1900efa14ee0SMatthew G Knepley *nFV = 0; 1901efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1902c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 190377d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1904dcca6d9dSJed Brown ierr = PetscMalloc3(pSize,&pStart,pSize,&pEnd,pSize,&pMax);CHKERRQ(ierr); 1905d92e47f8SMatthew 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); 1906efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 1907efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1908efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1909efa14ee0SMatthew G Knepley } 1910efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1911fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1912efa14ee0SMatthew G Knepley if (subvertexIS) { 1913efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1914efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1915efa14ee0SMatthew G Knepley } 1916efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1917efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 19180298fd71SBarry Smith PetscInt *star = NULL; 1919efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 1920efa14ee0SMatthew G Knepley 1921efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1922efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1923efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1924efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1925efa14ee0SMatthew G Knepley } 1926efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 1927efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 19280298fd71SBarry Smith PetscInt *closure = NULL; 1929efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 1930efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 1931efa14ee0SMatthew G Knepley 1932efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 193365560c7fSMatthew G Knepley if (cellLoc == 2) continue; 193482f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1935efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1936efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1937efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1938efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1939efa14ee0SMatthew G Knepley 1940efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1941efa14ee0SMatthew G Knepley ++numCorners; 1942efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1943830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 1944efa14ee0SMatthew G Knepley } 1945efa14ee0SMatthew G Knepley } 194618ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 194782f516ccSBarry 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); 1948efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 1949007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 1950007baee2SMatthew G. Knepley PetscInt numCells, nc; 1951007baee2SMatthew G. Knepley 1952efa14ee0SMatthew G Knepley ++(*numFaces); 1953efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 1954efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 1955efa14ee0SMatthew G Knepley } 1956007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1957007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 1958007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 1959007baee2SMatthew G. Knepley } 1960007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1961efa14ee0SMatthew G Knepley } 1962efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1963efa14ee0SMatthew G Knepley } 1964efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1965efa14ee0SMatthew G Knepley } 1966efa14ee0SMatthew G Knepley if (subvertexIS) { 1967efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1968efa14ee0SMatthew G Knepley } 1969efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1970efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1971efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1972efa14ee0SMatthew G Knepley } 1973efa14ee0SMatthew G Knepley 1974830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 1975efa14ee0SMatthew G Knepley { 197634b4c39eSMatthew G. Knepley IS subvertexIS = NULL; 1977efa14ee0SMatthew G Knepley const PetscInt *subvertices; 1978efa14ee0SMatthew G Knepley PetscInt *pStart, *pEnd, *pMax; 1979efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 1980efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1981efa14ee0SMatthew G Knepley 1982efa14ee0SMatthew G Knepley PetscFunctionBegin; 1983c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1984dcca6d9dSJed Brown ierr = PetscMalloc3(dim+1,&pStart,dim+1,&pEnd,dim+1,&pMax);CHKERRQ(ierr); 19850298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1986efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 1987efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1988efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1989efa14ee0SMatthew G Knepley } 1990efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 199134b4c39eSMatthew G. Knepley if (vertexLabel) { 1992830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 1993efa14ee0SMatthew G Knepley if (subvertexIS) { 1994efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1995efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1996efa14ee0SMatthew G Knepley } 199734b4c39eSMatthew G. Knepley } 1998efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1999efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 20000298fd71SBarry Smith PetscInt *star = NULL; 2001efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 2002efa14ee0SMatthew G Knepley 2003efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 2004efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 2005efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 2006efa14ee0SMatthew G Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 2007efa14ee0SMatthew G Knepley } 2008efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 2009efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 20100298fd71SBarry Smith PetscInt *closure = NULL; 2011efa14ee0SMatthew G Knepley PetscInt closureSize, c; 2012efa14ee0SMatthew G Knepley PetscInt faceLoc; 2013efa14ee0SMatthew G Knepley 2014efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 2015efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 201682f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 2017efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2018efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 2019efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 2020efa14ee0SMatthew G Knepley PetscInt vertexLoc; 2021efa14ee0SMatthew G Knepley 2022efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 2023efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 2024830e53efSMatthew G. Knepley if (vertexLoc != value) break; 2025efa14ee0SMatthew G Knepley } 2026efa14ee0SMatthew G Knepley } 2027efa14ee0SMatthew G Knepley if (c == closureSize*2) { 2028efa14ee0SMatthew G Knepley const PetscInt *support; 2029efa14ee0SMatthew G Knepley PetscInt supportSize, s; 2030efa14ee0SMatthew G Knepley 2031efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 2032efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 2033efa14ee0SMatthew G Knepley 2034efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 2035efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 2036efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 2037efa14ee0SMatthew G Knepley break; 2038efa14ee0SMatthew G Knepley } 2039efa14ee0SMatthew G Knepley } 2040efa14ee0SMatthew G Knepley } 2041efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2042efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2043efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 2044efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 2045efa14ee0SMatthew G Knepley } 2046efa14ee0SMatthew G Knepley } 2047efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2048efa14ee0SMatthew G Knepley } 2049efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 2050efa14ee0SMatthew G Knepley } 205134b4c39eSMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);} 2052efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2053efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 2054efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 2055efa14ee0SMatthew G Knepley } 2056efa14ee0SMatthew G Knepley 205727c04023SMatthew 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) 2058766ab985SMatthew G. Knepley { 205927c04023SMatthew G. Knepley DMLabel label = NULL; 2060766ab985SMatthew G. Knepley const PetscInt *cone; 20619fc93327SToby Isaac PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize = -1; 2062766ab985SMatthew G. Knepley PetscErrorCode ierr; 2063766ab985SMatthew G. Knepley 2064812bfc34SJed Brown PetscFunctionBegin; 2065c0ed958bSJed Brown *numFaces = 0; 2066c0ed958bSJed Brown *nFV = 0; 2067c58f1c22SToby Isaac if (labelname) {ierr = DMGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 2068fed694aaSMatthew G. Knepley *subCells = NULL; 2069c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2070766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 2071766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2072766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 207327c04023SMatthew G. Knepley if (label) { 207427c04023SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 207527c04023SMatthew G. Knepley PetscInt val; 207627c04023SMatthew G. Knepley 207727c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 207827c04023SMatthew G. Knepley if (val == value) { 207927c04023SMatthew G. Knepley ++(*numFaces); 208027c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 208127c04023SMatthew G. Knepley } 208227c04023SMatthew G. Knepley } 208327c04023SMatthew G. Knepley } else { 2084766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 208527c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 208627c04023SMatthew G. Knepley } 2087785e854fSJed Brown ierr = PetscMalloc1(*numFaces *2, subCells);CHKERRQ(ierr); 20889fc93327SToby Isaac if (!(*numFaces)) PetscFunctionReturn(0); 20899fc93327SToby Isaac *nFV = hasLagrange ? coneSize/3 : coneSize/2; 2090766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 2091766ab985SMatthew G. Knepley const PetscInt *cells; 2092766ab985SMatthew G. Knepley PetscInt numCells; 2093766ab985SMatthew G. Knepley 209427c04023SMatthew G. Knepley if (label) { 209527c04023SMatthew G. Knepley PetscInt val; 209627c04023SMatthew G. Knepley 209727c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 209827c04023SMatthew G. Knepley if (val != value) continue; 209927c04023SMatthew G. Knepley } 2100766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2101766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 2102766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 2103766ab985SMatthew G. Knepley } 2104766ab985SMatthew G. Knepley /* Negative face */ 2105766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 210627234c99SMatthew G. Knepley /* Not true in parallel 210727234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 2108766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 2109766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 211027234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 2111766ab985SMatthew G. Knepley } 2112766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 2113766ab985SMatthew G. Knepley /* Positive face is not included */ 2114766ab985SMatthew G. Knepley } 2115766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2116766ab985SMatthew G. Knepley } 2117766ab985SMatthew G. Knepley 21183982b651SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, DMLabel label, PetscInt value, DMLabel subpointMap, DM subdm) 2119766ab985SMatthew G. Knepley { 2120766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 2121766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 2122766ab985SMatthew G. Knepley PetscErrorCode ierr; 2123766ab985SMatthew G. Knepley 2124812bfc34SJed Brown PetscFunctionBegin; 2125c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2126766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 2127766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2128766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 2129dcca6d9dSJed Brown ierr = PetscMalloc2(dim+1,&pStart,dim+1,&pEnd);CHKERRQ(ierr); 2130b3154360SMatthew G. Knepley for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);} 2131766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 2132766ab985SMatthew G. Knepley const PetscInt *cone; 2133766ab985SMatthew G. Knepley PetscInt *closure = NULL; 2134b3154360SMatthew G. Knepley PetscInt fconeSize, coneSize, closureSize, cl, val; 2135766ab985SMatthew G. Knepley 213627c04023SMatthew G. Knepley if (label) { 213727c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 213827c04023SMatthew G. Knepley if (val != value) continue; 213927c04023SMatthew G. Knepley } 2140766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2141766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2142b3154360SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr); 2143b3154360SMatthew G. Knepley if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 2144b3154360SMatthew G. Knepley /* Negative face */ 2145766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2146766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2147766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 2148766ab985SMatthew G. Knepley 2149766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2150766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 2151766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 2152766ab985SMatthew G. Knepley break; 2153766ab985SMatthew G. Knepley } 2154766ab985SMatthew G. Knepley } 2155766ab985SMatthew G. Knepley } 2156766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2157766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 2158766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 2159766ab985SMatthew G. Knepley const PetscInt *support; 2160766ab985SMatthew G. Knepley PetscInt supportSize, s; 2161766ab985SMatthew G. Knepley 2162766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 2163711de394SMatthew G. Knepley /* if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); */ 2164766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 2165766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 2166766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 2167766ab985SMatthew G. Knepley } 2168766ab985SMatthew G. Knepley } 2169766ab985SMatthew G. Knepley } 2170766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 2171766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2172766ab985SMatthew G. Knepley } 2173766ab985SMatthew G. Knepley 2174e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2175e6ccafaeSMatthew G Knepley { 217682f516ccSBarry Smith MPI_Comm comm; 2177e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 2178e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 2179e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 2180e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2181e6ccafaeSMatthew G Knepley 218282f516ccSBarry Smith PetscFunctionBegin; 218382f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2184c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &cellDim);CHKERRQ(ierr); 2185e6ccafaeSMatthew G Knepley if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 2186e6ccafaeSMatthew G Knepley 2187ddeab2a6SMatthew G. Knepley if (cellDim == 1 && numCorners == 2) { 2188ddeab2a6SMatthew G. Knepley /* Triangle */ 2189e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 2190e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2191ddeab2a6SMatthew G. Knepley } else if (cellDim == 2 && numCorners == 3) { 2192ddeab2a6SMatthew G. Knepley /* Triangle */ 2193ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2194ddeab2a6SMatthew G. Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2195ddeab2a6SMatthew G. Knepley } else if (cellDim == 3 && numCorners == 4) { 2196ddeab2a6SMatthew G. Knepley /* Tetrahedron */ 2197ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2198ddeab2a6SMatthew G. Knepley posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2199e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 2200e6ccafaeSMatthew G Knepley /* Quadratic line */ 2201e6ccafaeSMatthew G Knepley faceSize = 1; 2202e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2203e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 2204e6ccafaeSMatthew G Knepley /* Quads */ 2205e6ccafaeSMatthew G Knepley faceSize = 2; 2206e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 2207e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2208e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 2209e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2210e6ccafaeSMatthew G Knepley } else { 2211e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 2212e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 2213e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 2214e6ccafaeSMatthew G Knepley } 2215e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 2216e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 2217e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2218e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 2219e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2220e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2221e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 2222e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2223e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2224e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 2225e6ccafaeSMatthew G Knepley }; 2226e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 2227e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2228e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2229e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 2230e6ccafaeSMatthew G Knepley }; 2231e6ccafaeSMatthew G Knepley 2232e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 2233e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 2234e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 2235e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 2236e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2237e6ccafaeSMatthew G Knepley 2238e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 2239e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 2240e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 2241e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 2242e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 2243e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2244e6ccafaeSMatthew G Knepley break; 2245e6ccafaeSMatthew G Knepley } 2246e6ccafaeSMatthew G Knepley } 2247e6ccafaeSMatthew G Knepley } 2248e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2249e6ccafaeSMatthew G Knepley break; 2250e6ccafaeSMatthew G Knepley } 2251e6ccafaeSMatthew G Knepley } 2252e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 2253e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2254e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2255e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 2256e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 2257e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2258e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 2259e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2260e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2261e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 2262e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2263e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2264e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2265e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 2266e6ccafaeSMatthew G Knepley }; 2267e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 2268e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2269e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2270e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2271e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 2272e6ccafaeSMatthew G Knepley }; 2273e6ccafaeSMatthew G Knepley 2274e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 2275e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 2276e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 2277e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 2278e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2279e6ccafaeSMatthew G Knepley 2280e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 2281e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 2282e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 2283e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 2284e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 2285e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2286e6ccafaeSMatthew G Knepley break; 2287e6ccafaeSMatthew G Knepley } 2288e6ccafaeSMatthew G Knepley } 2289e6ccafaeSMatthew G Knepley } 2290e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2291e6ccafaeSMatthew G Knepley break; 2292e6ccafaeSMatthew G Knepley } 2293e6ccafaeSMatthew G Knepley } 2294e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 2295e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2296e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2297e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 2298e6ccafaeSMatthew G Knepley /* Hexes 2299e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2300e6ccafaeSMatthew G Knepley pointing up at the second. 2301e6ccafaeSMatthew G Knepley 2302e6ccafaeSMatthew G Knepley 7---6 2303e6ccafaeSMatthew G Knepley /| /| 2304e6ccafaeSMatthew G Knepley 4---5 | 2305ddeab2a6SMatthew G. Knepley | 1-|-2 2306e6ccafaeSMatthew G Knepley |/ |/ 2307ddeab2a6SMatthew G. Knepley 0---3 2308e6ccafaeSMatthew G Knepley 2309e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2310e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 2311e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 2312e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2313e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 2314e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 2315e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2316ddeab2a6SMatthew G. Knepley 0, 3, 4, 5, /* front */ 2317ddeab2a6SMatthew G. Knepley 2, 3, 5, 6, /* right */ 2318ddeab2a6SMatthew G. Knepley 1, 2, 6, 7, /* back */ 2319ddeab2a6SMatthew G. Knepley 0, 1, 4, 7, /* left */ 2320e6ccafaeSMatthew G Knepley }; 2321e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 2322ddeab2a6SMatthew G. Knepley 1, 2, 3, 0, /* bottom */ 2323e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2324ddeab2a6SMatthew G. Knepley 0, 3, 5, 4, /* front */ 2325ddeab2a6SMatthew G. Knepley 3, 2, 6, 5, /* right */ 2326ddeab2a6SMatthew G. Knepley 2, 1, 7, 6, /* back */ 2327ddeab2a6SMatthew G. Knepley 1, 0, 4, 7, /* left */ 2328e6ccafaeSMatthew G Knepley }; 2329e6ccafaeSMatthew G Knepley 2330e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 2331e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 2332e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2333e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 2334e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2335e6ccafaeSMatthew G Knepley 2336e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 2337e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 2338e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 2339e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 2340e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 2341e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 2342e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 2343e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2344e6ccafaeSMatthew G Knepley break; 2345e6ccafaeSMatthew G Knepley } 2346e6ccafaeSMatthew G Knepley } 2347e6ccafaeSMatthew G Knepley } 2348e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2349e6ccafaeSMatthew G Knepley break; 2350e6ccafaeSMatthew G Knepley } 2351e6ccafaeSMatthew G Knepley } 2352e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2353e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2354e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2355e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 2356e6ccafaeSMatthew G Knepley /* Quadratic tet */ 2357e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 2358e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 2359e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 2360e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2361e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 2362e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2363e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 2364e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 2365e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 2366e6ccafaeSMatthew G Knepley }; 2367e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 2368e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2369e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 2370e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 2371e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 2372e6ccafaeSMatthew G Knepley }; 2373e6ccafaeSMatthew G Knepley 2374e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 2375e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 2376e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 2377e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 2378e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2379e6ccafaeSMatthew G Knepley 2380e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 2381e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 2382e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 2383e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 2384e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 2385e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 2386e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 2387e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2388e6ccafaeSMatthew G Knepley break; 2389e6ccafaeSMatthew G Knepley } 2390e6ccafaeSMatthew G Knepley } 2391e6ccafaeSMatthew G Knepley } 2392e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2393e6ccafaeSMatthew G Knepley break; 2394e6ccafaeSMatthew G Knepley } 2395e6ccafaeSMatthew G Knepley } 2396e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 2397e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2398e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2399e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 2400e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 2401e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2402e6ccafaeSMatthew G Knepley pointing up at the second. 2403e6ccafaeSMatthew G Knepley 2404e6ccafaeSMatthew G Knepley 7---6 2405e6ccafaeSMatthew G Knepley /| /| 2406e6ccafaeSMatthew G Knepley 4---5 | 2407e6ccafaeSMatthew G Knepley | 3-|-2 2408e6ccafaeSMatthew G Knepley |/ |/ 2409e6ccafaeSMatthew G Knepley 0---1 2410e6ccafaeSMatthew G Knepley 2411e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2412e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 2413e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 2414e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2415e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 2416e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 2417e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2418e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 2419e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 2420e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 2421e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 2422e6ccafaeSMatthew G Knepley }; 2423e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 2424e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 2425e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2426e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 2427e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 2428e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 2429e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 2430e6ccafaeSMatthew G Knepley }; 2431e6ccafaeSMatthew G Knepley 2432e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 2433e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 2434e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2435e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 2436e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2437e6ccafaeSMatthew G Knepley 2438e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 2439e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 2440e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 2441e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 2442e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 2443e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 2444e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 2445e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2446e6ccafaeSMatthew G Knepley break; 2447e6ccafaeSMatthew G Knepley } 2448e6ccafaeSMatthew G Knepley } 2449e6ccafaeSMatthew G Knepley } 2450e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2451e6ccafaeSMatthew G Knepley break; 2452e6ccafaeSMatthew G Knepley } 2453e6ccafaeSMatthew G Knepley } 2454e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2455e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2456e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2457e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 2458e6ccafaeSMatthew G Knepley if (!posOrient) { 2459e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 2460e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 2461e6ccafaeSMatthew G Knepley } else { 2462e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 2463e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 2464e6ccafaeSMatthew G Knepley } 2465e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 2466e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2467e6ccafaeSMatthew G Knepley } 2468e6ccafaeSMatthew G Knepley 2469e6ccafaeSMatthew G Knepley /* 2470e6ccafaeSMatthew G Knepley Given a cell and a face, as a set of vertices, 2471e6ccafaeSMatthew G Knepley return the oriented face, as a set of vertices, in faceVertices 2472e6ccafaeSMatthew G Knepley The orientation is such that the face normal points out of the cell 2473e6ccafaeSMatthew G Knepley */ 2474e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2475e6ccafaeSMatthew G Knepley { 24760298fd71SBarry Smith const PetscInt *cone = NULL; 2477e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 2478e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 2479e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2480e6ccafaeSMatthew G Knepley 2481e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2482e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 2483e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 2484e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 2485e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2486e6ccafaeSMatthew G Knepley 2487e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 2488e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 2489e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 2490e6ccafaeSMatthew G Knepley } 2491e6ccafaeSMatthew G Knepley } 2492e6ccafaeSMatthew G Knepley if (found) { 2493e6ccafaeSMatthew G Knepley indices[v2] = v; 2494e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 2495e6ccafaeSMatthew G Knepley ++v2; 2496e6ccafaeSMatthew G Knepley } else { 2497e6ccafaeSMatthew G Knepley oppositeVertex = v; 2498e6ccafaeSMatthew G Knepley } 2499e6ccafaeSMatthew G Knepley } 2500e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 2501e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2502e6ccafaeSMatthew G Knepley } 2503e6ccafaeSMatthew G Knepley 2504e6ccafaeSMatthew G Knepley /* 2505cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 2506e6ccafaeSMatthew G Knepley 2507e6ccafaeSMatthew G Knepley Not collective 2508e6ccafaeSMatthew G Knepley 2509e6ccafaeSMatthew G Knepley Input Parameters: 2510e6ccafaeSMatthew G Knepley + dm - The DMPlex 2511e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 2512e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 2513e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 2514e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 2515e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 2516e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 2517e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 2518e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 2519e6ccafaeSMatthew G Knepley 2520e6ccafaeSMatthew G Knepley Output Parameters: 2521e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 2522e6ccafaeSMatthew G Knepley 2523e6ccafaeSMatthew G Knepley Level: developer 2524e6ccafaeSMatthew G Knepley */ 2525cd0c2139SMatthew 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) 2526e6ccafaeSMatthew G Knepley { 252782f516ccSBarry Smith MPI_Comm comm; 2528e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 2529e6ccafaeSMatthew G Knepley const PetscInt *faces; 2530e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 2531e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2532e6ccafaeSMatthew G Knepley 2533e6ccafaeSMatthew G Knepley PetscFunctionBegin; 253482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2535e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 2536e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 2537e6ccafaeSMatthew G Knepley #if 0 2538e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 2539e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2540e6ccafaeSMatthew G Knepley #else 2541e6ccafaeSMatthew G Knepley { 2542e6ccafaeSMatthew G Knepley PetscInt f; 2543e6ccafaeSMatthew G Knepley 2544e6ccafaeSMatthew G Knepley numFaces = 0; 2545e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2546e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 2547e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 2548e6ccafaeSMatthew G Knepley 2549e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 2550e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 2551e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 2552e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 2553e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 2554e6ccafaeSMatthew G Knepley PetscInt v; 2555e6ccafaeSMatthew G Knepley 2556e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2557e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 2558e6ccafaeSMatthew G Knepley } 2559e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 2560e6ccafaeSMatthew G Knepley } 2561e6ccafaeSMatthew G Knepley if (d == dof) { 2562e6ccafaeSMatthew G Knepley numFaces = 1; 2563e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 2564e6ccafaeSMatthew G Knepley } 2565e6ccafaeSMatthew G Knepley } 2566e6ccafaeSMatthew G Knepley } 2567e6ccafaeSMatthew G Knepley #endif 2568e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 2569e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 2570e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 2571766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 2572e6ccafaeSMatthew G Knepley } else { 2573e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 2574e6ccafaeSMatthew G Knepley PetscBool posOriented; 2575e6ccafaeSMatthew G Knepley 2576e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2577e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 2578e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 2579e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 2580e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 2581e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 2582e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2583e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 2584e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 2585e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 2586e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 2587e6ccafaeSMatthew G Knepley break; 2588e6ccafaeSMatthew G Knepley } 2589e6ccafaeSMatthew G Knepley } 2590e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 2591e6ccafaeSMatthew G Knepley } 2592e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 2593e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 2594e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2595e6ccafaeSMatthew G Knepley ++(*newFacePoint); 2596e6ccafaeSMatthew G Knepley } 2597ef07cca7SMatthew G. Knepley #if 0 2598e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2599ef07cca7SMatthew G. Knepley #else 2600ef07cca7SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2601ef07cca7SMatthew G. Knepley #endif 2602e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2603e6ccafaeSMatthew G Knepley } 2604e6ccafaeSMatthew G Knepley 260553156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2606e6ccafaeSMatthew G Knepley { 260782f516ccSBarry Smith MPI_Comm comm; 260853156dfcSMatthew G. Knepley DMLabel subpointMap; 2609efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 2610efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 2611efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 2612fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 2613efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 2614e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2615e6ccafaeSMatthew G Knepley 2616e6ccafaeSMatthew G Knepley PetscFunctionBegin; 261782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2618efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2619efa14ee0SMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2620efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2621efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 262253156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);} 2623efa14ee0SMatthew G Knepley /* Setup chart */ 2624efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2625efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2626efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2627efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2628e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2629e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 2630efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 2631e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 2632efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2633efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2634efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 2635efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2636e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2637e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2638e6ccafaeSMatthew G Knepley } 2639e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2640e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2641e6ccafaeSMatthew G Knepley } 2642e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2643e6ccafaeSMatthew G Knepley /* Create face cones */ 2644efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 26450298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2646efa14ee0SMatthew G Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2647e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2648e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 2649efa14ee0SMatthew G Knepley const PetscInt subcell = c; 26500298fd71SBarry Smith PetscInt *closure = NULL; 2651efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 2652e6ccafaeSMatthew G Knepley 2653e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2654efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2655efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 2656e6ccafaeSMatthew G Knepley PetscInt subVertex; 2657e6ccafaeSMatthew G Knepley 2658efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 2659efa14ee0SMatthew G Knepley ++numCorners; 2660efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 2661efa14ee0SMatthew G Knepley if (subVertex >= 0) { 2662efa14ee0SMatthew G Knepley closure[faceSize] = point; 266365560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 2664e6ccafaeSMatthew G Knepley ++faceSize; 2665e6ccafaeSMatthew G Knepley } 2666e6ccafaeSMatthew G Knepley } 2667e6ccafaeSMatthew G Knepley } 2668efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 2669efa14ee0SMatthew G Knepley if (faceSize == nFV) { 2670cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 2671e6ccafaeSMatthew G Knepley } 267265560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2673e6ccafaeSMatthew G Knepley } 2674efa14ee0SMatthew G Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2675e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2676e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2677e6ccafaeSMatthew G Knepley /* Build coordinates */ 2678efa14ee0SMatthew G Knepley { 2679efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 2680efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 2681efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 2682285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 268324640c55SToby Isaac const char *name; 2684efa14ee0SMatthew G Knepley 268569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2686e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 268769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2688285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2689285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2690285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2691efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2692efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2693efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2694efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2695efa14ee0SMatthew G Knepley PetscInt dof; 2696efa14ee0SMatthew G Knepley 2697efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2698efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2699285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2700e6ccafaeSMatthew G Knepley } 2701e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2702e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 27038b9ced59SLisandro Dalcin ierr = VecCreate(PETSC_COMM_SELF, &subCoordinates);CHKERRQ(ierr); 270424640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 270524640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr); 2706e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 27072eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2708830e53efSMatthew G. Knepley if (coordSize) { 2709e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2710e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2711efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2712efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2713efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2714efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2715e6ccafaeSMatthew G Knepley 2716e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2717e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2718efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2719efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2720efa14ee0SMatthew 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); 2721e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2722e6ccafaeSMatthew G Knepley } 2723e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2724e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 27253b399e24SMatthew G. Knepley } 2726e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2727e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2728e6ccafaeSMatthew G Knepley } 2729efa14ee0SMatthew G Knepley /* Cleanup */ 2730efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2731efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2732efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2733efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2734e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2735e6ccafaeSMatthew G Knepley } 2736e6ccafaeSMatthew G Knepley 27373982b651SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 27383982b651SMatthew G. Knepley { 27393982b651SMatthew G. Knepley PetscInt subPoint; 27403982b651SMatthew G. Knepley PetscErrorCode ierr; 27413982b651SMatthew G. Knepley 27423982b651SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 27433982b651SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 27443982b651SMatthew G. Knepley } 27453982b651SMatthew G. Knepley 2746bec263e5SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmeshGeneric_Interpolated(DM dm, DMLabel label, PetscInt value, PetscBool isCohesive, PetscInt cellHeight, DM subdm) 2747e6ccafaeSMatthew G Knepley { 274882f516ccSBarry Smith MPI_Comm comm; 274953156dfcSMatthew G. Knepley DMLabel subpointMap; 2750efa14ee0SMatthew G Knepley IS *subpointIS; 2751efa14ee0SMatthew G Knepley const PetscInt **subpoints; 27523982b651SMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *orntNew; 27530d366550SMatthew G. Knepley PetscInt totSubPoints = 0, maxConeSize, cMax, cEnd, dim, p, d, v; 27540d366550SMatthew G. Knepley PetscMPIInt rank; 2755e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2756e6ccafaeSMatthew G Knepley 2757e6ccafaeSMatthew G Knepley PetscFunctionBegin; 275882f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 27590d366550SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2760efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2761e6ccafaeSMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2762efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2763bec263e5SMatthew G. Knepley if (cellHeight) { 27643982b651SMatthew G. Knepley if (isCohesive) {ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);} 27653982b651SMatthew G. Knepley else {ierr = DMPlexMarkSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);} 2766bec263e5SMatthew G. Knepley } else { 2767bec263e5SMatthew G. Knepley DMLabel depth; 2768bec263e5SMatthew G. Knepley IS pointIS; 2769bec263e5SMatthew G. Knepley const PetscInt *points; 2770bec263e5SMatthew G. Knepley PetscInt numPoints; 2771bec263e5SMatthew G. Knepley 2772bec263e5SMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depth);CHKERRQ(ierr); 2773bec263e5SMatthew G. Knepley ierr = DMLabelGetStratumSize(label, value, &numPoints);CHKERRQ(ierr); 2774bec263e5SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, value, &pointIS);CHKERRQ(ierr); 2775bec263e5SMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 2776bec263e5SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 2777bec263e5SMatthew G. Knepley PetscInt *closure = NULL; 2778bec263e5SMatthew G. Knepley PetscInt closureSize, c, pdim; 2779bec263e5SMatthew G. Knepley 2780bec263e5SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2781bec263e5SMatthew G. Knepley for (c = 0; c < closureSize*2; c += 2) { 2782bec263e5SMatthew G. Knepley ierr = DMLabelGetValue(depth, closure[c], &pdim);CHKERRQ(ierr); 2783bec263e5SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, closure[c], pdim);CHKERRQ(ierr); 2784bec263e5SMatthew G. Knepley } 2785bec263e5SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2786bec263e5SMatthew G. Knepley } 2787bec263e5SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 2788bec263e5SMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 2789bec263e5SMatthew G. Knepley } 2790bec263e5SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 27910d366550SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 27920d366550SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 27930d366550SMatthew G. Knepley cMax = (cMax < 0) ? cEnd : cMax; 2794efa14ee0SMatthew G Knepley /* Setup chart */ 2795c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2796dcca6d9dSJed Brown ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr); 2797e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2798e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2799e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 2800e6ccafaeSMatthew G Knepley } 2801e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2802bec263e5SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, cellHeight);CHKERRQ(ierr); 2803e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2804e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 2805e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2806e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2807e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2808e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2809e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 28100ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2811e6ccafaeSMatthew G Knepley } 2812e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2813e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2814e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2815e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2816e6ccafaeSMatthew G Knepley const PetscInt *cone; 2817e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 2818e6ccafaeSMatthew G Knepley 28190d366550SMatthew G. Knepley #if 0 28200d366550SMatthew G. Knepley if ((point >= cMax) && (point < cEnd)) { 28210d366550SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "[%d]Cohesive cell %D (%D) is hanging off of our submesh\n", rank, point, subpoint);CHKERRQ(ierr); 28220d366550SMatthew G. Knepley } 28230d366550SMatthew G. Knepley if (d == dim-1) { 28240d366550SMatthew G. Knepley const PetscInt *support, *cone, *ornt; 28250d366550SMatthew G. Knepley PetscInt supportSize, coneSize, s, subc; 28260d366550SMatthew G. Knepley 28270d366550SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "[%d]Face %D (%D) in submesh\n", rank, point, subpoint);CHKERRQ(ierr); 28280d366550SMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 28290d366550SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 28300d366550SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 28310d366550SMatthew G. Knepley if ((support[s] < cMax) || (support[s] >= cEnd)) continue; 28320d366550SMatthew G. Knepley ierr = PetscFindInt(support[s], numSubPoints[d+1], subpoints[d+1], &subc);CHKERRQ(ierr); 28330d366550SMatthew G. Knepley if (subc >= 0) { 28340d366550SMatthew G. Knepley const PetscInt ccell = subpoints[d+1][subc]; 28350d366550SMatthew G. Knepley 28360d366550SMatthew G. Knepley ierr = DMPlexGetCone(dm, ccell, &cone); 28370d366550SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, ccell, &coneSize); 28380d366550SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, ccell, &ornt); 28390d366550SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 28400d366550SMatthew G. Knepley if (cone[c] == point) { 28410d366550SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "[%d] has orientation %D in cohesive cell %D\n", rank, ornt[c], ccell);CHKERRQ(ierr); 28420d366550SMatthew G. Knepley break; 28430d366550SMatthew G. Knepley } 28440d366550SMatthew G. Knepley } 28450d366550SMatthew G. Knepley } 28460d366550SMatthew G. Knepley } 28470d366550SMatthew G. Knepley } 28480d366550SMatthew G. Knepley #endif 2849e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2850e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2851bec263e5SMatthew G. Knepley if (cellHeight && (d == dim)) { 2852e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2853e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2854e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2855e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 2856e6ccafaeSMatthew G Knepley } 2857e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2858e6ccafaeSMatthew G Knepley } 2859e6ccafaeSMatthew G Knepley } 2860e6ccafaeSMatthew G Knepley } 2861e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2862e6ccafaeSMatthew G Knepley /* Set cones */ 28630298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 28643982b651SMatthew G. Knepley ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&orntNew);CHKERRQ(ierr); 2865e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2866e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2867e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2868e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 28690e49e2e2SMatthew G. Knepley const PetscInt *cone, *ornt; 28700d366550SMatthew G. Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc, fornt = 0; 2871e6ccafaeSMatthew G Knepley 28720d366550SMatthew G. Knepley if (d == dim-1) { 28730d366550SMatthew G. Knepley const PetscInt *support, *cone, *ornt; 28740d366550SMatthew G. Knepley PetscInt supportSize, coneSize, s, subc; 28750d366550SMatthew G. Knepley 28760d366550SMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 28770d366550SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 28780d366550SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 28790d366550SMatthew G. Knepley if ((support[s] < cMax) || (support[s] >= cEnd)) continue; 28800d366550SMatthew G. Knepley ierr = PetscFindInt(support[s], numSubPoints[d+1], subpoints[d+1], &subc);CHKERRQ(ierr); 28810d366550SMatthew G. Knepley if (subc >= 0) { 28820d366550SMatthew G. Knepley const PetscInt ccell = subpoints[d+1][subc]; 28830d366550SMatthew G. Knepley 28840d366550SMatthew G. Knepley ierr = DMPlexGetCone(dm, ccell, &cone); 28850d366550SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, ccell, &coneSize); 28860d366550SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, ccell, &ornt); 28870d366550SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 28880d366550SMatthew G. Knepley if (cone[c] == point) { 28890d366550SMatthew G. Knepley fornt = ornt[c]; 28900d366550SMatthew G. Knepley break; 28910d366550SMatthew G. Knepley } 28920d366550SMatthew G. Knepley } 28930d366550SMatthew G. Knepley break; 28940d366550SMatthew G. Knepley } 28950d366550SMatthew G. Knepley } 28960d366550SMatthew G. Knepley } 2897e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2898e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2899e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 29000e49e2e2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2901e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2902e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 290301a2673eSMatthew G. Knepley if (subc >= 0) { 290401a2673eSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 29053982b651SMatthew G. Knepley orntNew[coneSizeNew] = ornt[c]; 290601a2673eSMatthew G. Knepley ++coneSizeNew; 290701a2673eSMatthew G. Knepley } 2908e6ccafaeSMatthew G Knepley } 2909e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 29100d366550SMatthew G. Knepley if (fornt < 0) { 29110d366550SMatthew G. Knepley /* This should be replaced by a call to DMPlexReverseCell() */ 29120d366550SMatthew G. Knepley #if 0 29130d366550SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "[%d]Reorienting face %D (subface %D)\n", rank, point, subpoint);CHKERRQ(ierr); 2914*a129c400SMatthew G. Knepley for (c = 0; c < coneSizeNew; ++c) { 2915*a129c400SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "[%d] Old Cone point %d in %d: %d (%d)\n", rank, c, subpoint, coneNew[c], orntNew[c]);CHKERRQ(ierr); 2916*a129c400SMatthew G. Knepley } 29170d366550SMatthew G. Knepley #endif 2918*a129c400SMatthew G. Knepley #if 0 2919*a129c400SMatthew G. Knepley ierr = DMPlexReverseCell(subdm, subpoint);CHKERRQ(ierr); 2920*a129c400SMatthew G. Knepley #else 2921c0b40891SMatthew G. Knepley for (c = 0; c < coneSizeNew/2 + coneSizeNew%2; ++c) { 2922*a129c400SMatthew G. Knepley PetscInt faceSize, tmp; 29230d366550SMatthew G. Knepley 29240d366550SMatthew G. Knepley tmp = coneNew[c]; 29250d366550SMatthew G. Knepley coneNew[c] = coneNew[coneSizeNew-1-c]; 29260d366550SMatthew G. Knepley coneNew[coneSizeNew-1-c] = tmp; 2927*a129c400SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[c], &faceSize);CHKERRQ(ierr); 2928*a129c400SMatthew G. Knepley tmp = orntNew[c] >= 0 ? -(faceSize-orntNew[c]) : faceSize+orntNew[c]; 2929*a129c400SMatthew G. Knepley orntNew[c] = orntNew[coneSizeNew-1-c] >= 0 ? -(faceSize-orntNew[coneSizeNew-1-c]) : faceSize+orntNew[coneSizeNew-1-c]; 29300d366550SMatthew G. Knepley orntNew[coneSizeNew-1-c] = tmp; 29310d366550SMatthew G. Knepley } 29320d366550SMatthew G. Knepley } 2933e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 29343982b651SMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, orntNew);CHKERRQ(ierr); 2935*a129c400SMatthew G. Knepley #endif 2936*a129c400SMatthew G. Knepley #if 0 2937*a129c400SMatthew G. Knepley if (fornt < 0) { 2938*a129c400SMatthew G. Knepley for (c = 0; c < coneSizeNew; ++c) { 2939*a129c400SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "[%d] New Cone point %d in %d: %d (%d)\n", rank, c, subpoint, coneNew[c], orntNew[c]);CHKERRQ(ierr); 2940*a129c400SMatthew G. Knepley } 2941*a129c400SMatthew G. Knepley } 2942*a129c400SMatthew G. Knepley #endif 2943e6ccafaeSMatthew G Knepley } 2944e6ccafaeSMatthew G Knepley } 29453982b651SMatthew G. Knepley ierr = PetscFree2(coneNew,orntNew);CHKERRQ(ierr); 2946e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2947e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2948e6ccafaeSMatthew G Knepley /* Build coordinates */ 2949e6ccafaeSMatthew G Knepley { 2950e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 2951e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 2952e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 2953285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 295424640c55SToby Isaac const char *name; 2955e6ccafaeSMatthew G Knepley 295669d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2957e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 295869d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2959285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2960285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2961285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2962e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2963e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2964e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2965e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2966e6ccafaeSMatthew G Knepley PetscInt dof; 2967e6ccafaeSMatthew G Knepley 2968e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2969e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2970285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2971e6ccafaeSMatthew G Knepley } 2972e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2973e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 29748b9ced59SLisandro Dalcin ierr = VecCreate(PETSC_COMM_SELF, &subCoordinates);CHKERRQ(ierr); 297524640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 297624640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr); 2977e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 29782eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2979e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2980e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2981e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2982e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2983e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2984e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2985e6ccafaeSMatthew G Knepley 2986e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2987e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2988e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2989e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2990e6ccafaeSMatthew 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); 2991efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2992e6ccafaeSMatthew G Knepley } 2993e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2994e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2995e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2996e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2997e6ccafaeSMatthew G Knepley } 29983982b651SMatthew G. Knepley /* Build SF: We need this complexity because subpoints might not be selected on the owning process */ 29993982b651SMatthew G. Knepley { 30003982b651SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 30013982b651SMatthew G. Knepley IS subpIS; 30023982b651SMatthew G. Knepley const PetscSFNode *remotePoints; 30033982b651SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 30043982b651SMatthew G. Knepley const PetscInt *localPoints, *subpoints; 30053982b651SMatthew G. Knepley PetscInt *slocalPoints; 30063982b651SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubpoints = 0, numSubroots, numSubleaves = 0, l, sl, ll, pStart, pEnd, p; 30073982b651SMatthew G. Knepley PetscMPIInt rank; 30083982b651SMatthew G. Knepley 30093982b651SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 30103982b651SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 30113982b651SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 30123982b651SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 30133982b651SMatthew G. Knepley ierr = DMPlexGetChart(subdm, NULL, &numSubroots);CHKERRQ(ierr); 30143982b651SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpIS);CHKERRQ(ierr); 30153982b651SMatthew G. Knepley if (subpIS) { 30163982b651SMatthew G. Knepley ierr = ISGetIndices(subpIS, &subpoints);CHKERRQ(ierr); 30173982b651SMatthew G. Knepley ierr = ISGetLocalSize(subpIS, &numSubpoints);CHKERRQ(ierr); 30183982b651SMatthew G. Knepley } 30193982b651SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 30203982b651SMatthew G. Knepley if (numRoots >= 0) { 30213982b651SMatthew G. Knepley ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 30223982b651SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 30233982b651SMatthew G. Knepley newLocalPoints[p].rank = -2; 30243982b651SMatthew G. Knepley newLocalPoints[p].index = -2; 30253982b651SMatthew G. Knepley } 30263982b651SMatthew G. Knepley /* Set subleaves */ 30273982b651SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 30283982b651SMatthew G. Knepley const PetscInt point = localPoints[l]; 30293982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 30303982b651SMatthew G. Knepley 30313982b651SMatthew G. Knepley if (subpoint < 0) continue; 30323982b651SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 30333982b651SMatthew G. Knepley newLocalPoints[point-pStart].index = subpoint; 30343982b651SMatthew G. Knepley ++numSubleaves; 30353982b651SMatthew G. Knepley } 30363982b651SMatthew G. Knepley /* Must put in owned subpoints */ 30373982b651SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 30383982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(p, 0, numSubpoints, subpoints); 30393982b651SMatthew G. Knepley 30403982b651SMatthew G. Knepley if (subpoint < 0) { 30413982b651SMatthew G. Knepley newOwners[p-pStart].rank = -3; 30423982b651SMatthew G. Knepley newOwners[p-pStart].index = -3; 30433982b651SMatthew G. Knepley } else { 30443982b651SMatthew G. Knepley newOwners[p-pStart].rank = rank; 30453982b651SMatthew G. Knepley newOwners[p-pStart].index = subpoint; 30463982b651SMatthew G. Knepley } 30473982b651SMatthew G. Knepley } 30483982b651SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 30493982b651SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 30503982b651SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 30513982b651SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 30523982b651SMatthew G. Knepley ierr = PetscMalloc1(numSubleaves, &slocalPoints);CHKERRQ(ierr); 30533982b651SMatthew G. Knepley ierr = PetscMalloc1(numSubleaves, &sremotePoints);CHKERRQ(ierr); 30543982b651SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 30553982b651SMatthew G. Knepley const PetscInt point = localPoints[l]; 30563982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 30573982b651SMatthew G. Knepley 30583982b651SMatthew G. Knepley if (subpoint < 0) continue; 30593982b651SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 30603982b651SMatthew G. Knepley slocalPoints[sl] = subpoint; 30613982b651SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 30623982b651SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 30633982b651SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 30643982b651SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 30653982b651SMatthew G. Knepley ++sl; 30663982b651SMatthew G. Knepley } 30673982b651SMatthew G. Knepley if (sl + ll != numSubleaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubleaves); 30683982b651SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 30693982b651SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubroots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 30703982b651SMatthew G. Knepley } 30713982b651SMatthew G. Knepley if (subpIS) { 30723982b651SMatthew G. Knepley ierr = ISRestoreIndices(subpIS, &subpoints);CHKERRQ(ierr); 30733982b651SMatthew G. Knepley ierr = ISDestroy(&subpIS);CHKERRQ(ierr); 30743982b651SMatthew G. Knepley } 30753982b651SMatthew G. Knepley } 3076efa14ee0SMatthew G Knepley /* Cleanup */ 3077e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 30780ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 3079e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 3080e6ccafaeSMatthew G Knepley } 3081efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 3082e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3083e6ccafaeSMatthew G Knepley } 3084e6ccafaeSMatthew G Knepley 30853982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 30863982b651SMatthew G. Knepley { 30873982b651SMatthew G. Knepley PetscErrorCode ierr; 30883982b651SMatthew G. Knepley 30893982b651SMatthew G. Knepley PetscFunctionBegin; 3090bec263e5SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, vertexLabel, value, PETSC_FALSE, 1, subdm);CHKERRQ(ierr); 30913982b651SMatthew G. Knepley PetscFunctionReturn(0); 30923982b651SMatthew G. Knepley } 30933982b651SMatthew G. Knepley 3094d0fa310fSMatthew G. Knepley /*@ 3095e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 3096e6ccafaeSMatthew G Knepley 3097e6ccafaeSMatthew G Knepley Input Parameters: 3098e6ccafaeSMatthew G Knepley + dm - The original mesh 3099830e53efSMatthew G. Knepley . vertexLabel - The DMLabel marking vertices contained in the surface 3100830e53efSMatthew G. Knepley - value - The label value to use 3101e6ccafaeSMatthew G Knepley 3102e6ccafaeSMatthew G Knepley Output Parameter: 3103e6ccafaeSMatthew G Knepley . subdm - The surface mesh 3104e6ccafaeSMatthew G Knepley 3105e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3106e6ccafaeSMatthew G Knepley 3107e6ccafaeSMatthew G Knepley Level: developer 3108e6ccafaeSMatthew G Knepley 3109c58f1c22SToby Isaac .seealso: DMPlexGetSubpointMap(), DMGetLabel(), DMLabelSetValue() 3110830e53efSMatthew G. Knepley @*/ 311153156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm) 3112e6ccafaeSMatthew G Knepley { 3113e6ccafaeSMatthew G Knepley PetscInt dim, depth; 3114e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3115e6ccafaeSMatthew G Knepley 3116e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3117e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3118766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 3119c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3120e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 312182f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 3122e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3123c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr); 3124e6ccafaeSMatthew G Knepley if (depth == dim) { 3125830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 3126e6ccafaeSMatthew G Knepley } else { 3127830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 3128e6ccafaeSMatthew G Knepley } 3129e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3130e6ccafaeSMatthew G Knepley } 3131e6ccafaeSMatthew G Knepley 313227c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 3133766ab985SMatthew G. Knepley { 3134766ab985SMatthew G. Knepley MPI_Comm comm; 3135766ab985SMatthew G. Knepley DMLabel subpointMap; 3136766ab985SMatthew G. Knepley IS subvertexIS; 3137766ab985SMatthew G. Knepley const PetscInt *subVertices; 3138fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 3139766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 314087feddfdSMatthew G. Knepley PetscInt cMax, c, f; 3141766ab985SMatthew G. Knepley PetscErrorCode ierr; 3142766ab985SMatthew G. Knepley 3143766ab985SMatthew G. Knepley PetscFunctionBegin; 3144766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 3145766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 3146766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 3147766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 3148766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 314927c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 3150766ab985SMatthew G. Knepley /* Setup chart */ 3151766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 3152766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 3153766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 3154766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 3155766ab985SMatthew G. Knepley /* Set cone sizes */ 3156766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 3157766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 3158766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 3159766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 3160766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 3161766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 3162766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 3163766ab985SMatthew G. Knepley } 3164766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 3165766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 3166766ab985SMatthew G. Knepley } 3167766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 3168766ab985SMatthew G. Knepley /* Create face cones */ 3169766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 317087feddfdSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 3171766ab985SMatthew G. Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 3172766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 3173766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 3174766ab985SMatthew G. Knepley const PetscInt subcell = c; 317587feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 317687feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 3177766ab985SMatthew G. Knepley 317887feddfdSMatthew G. Knepley if (cell < cMax) continue; 317987feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 318087feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 318187feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 318287feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 318387feddfdSMatthew G. Knepley } 318487feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 318587feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 318687feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 318727234c99SMatthew G. Knepley /* Not true in parallel 318827234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 318987feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 319087feddfdSMatthew G. Knepley PetscInt negsubcell; 3191766ab985SMatthew G. Knepley 319287feddfdSMatthew G. Knepley if (cells[p] >= cMax) continue; 319387feddfdSMatthew G. Knepley /* I know this is a crap search */ 319487feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 319587feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 3196766ab985SMatthew G. Knepley } 319787feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 319887feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 3199766ab985SMatthew G. Knepley } 320087feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 320187feddfdSMatthew G. Knepley ++newFacePoint; 3202766ab985SMatthew G. Knepley } 3203766ab985SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 3204766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 3205766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 3206766ab985SMatthew G. Knepley /* Build coordinates */ 3207766ab985SMatthew G. Knepley { 3208766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 3209766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 3210766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 3211285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 321224640c55SToby Isaac const char *name; 3213766ab985SMatthew G. Knepley 321469d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3215766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 321669d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 3217285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 3218285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 3219285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 3220766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 3221766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 3222766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 3223766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 3224766ab985SMatthew G. Knepley PetscInt dof; 3225766ab985SMatthew G. Knepley 3226766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3227766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 3228285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 3229766ab985SMatthew G. Knepley } 3230766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 3231766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 32328b9ced59SLisandro Dalcin ierr = VecCreate(PETSC_COMM_SELF, &subCoordinates);CHKERRQ(ierr); 323324640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 323424640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr); 3235766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 32362eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 3237766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 3238766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3239766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 3240766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 3241766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 3242766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 3243766ab985SMatthew G. Knepley 3244766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3245766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 3246766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 3247766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 3248766ab985SMatthew 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); 3249766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 3250766ab985SMatthew G. Knepley } 3251766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3252766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3253766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 3254766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 3255766ab985SMatthew G. Knepley } 3256aca35d17SMatthew G. Knepley /* Build SF */ 3257aca35d17SMatthew G. Knepley CHKMEMQ; 3258aca35d17SMatthew G. Knepley { 3259aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 3260aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 3261bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 3262aca35d17SMatthew G. Knepley const PetscInt *localPoints; 3263bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 326449c26ae4SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 3265bdcf2095SMatthew G. Knepley PetscMPIInt rank; 3266aca35d17SMatthew G. Knepley 3267bdcf2095SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 3268aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 3269aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 3270aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3271aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3272aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 3273aca35d17SMatthew G. Knepley if (numRoots >= 0) { 3274aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 3275dcca6d9dSJed Brown ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 3276bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 3277bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 3278bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 3279bdcf2095SMatthew G. Knepley } 32809e0823b2SMatthew G. Knepley /* Set subleaves */ 3281aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 3282aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 3283bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 3284aca35d17SMatthew G. Knepley 3285aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 3286bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 3287bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 3288bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 3289bdcf2095SMatthew G. Knepley ++numSubLeaves; 3290aca35d17SMatthew G. Knepley } 32919e0823b2SMatthew G. Knepley /* Must put in owned subpoints */ 32929e0823b2SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 32939e0823b2SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 32949e0823b2SMatthew G. Knepley 32959e0823b2SMatthew G. Knepley if (subPoint < 0) { 32969e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = -3; 32979e0823b2SMatthew G. Knepley newOwners[p-pStart].index = -3; 32989e0823b2SMatthew G. Knepley } else { 32999e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = rank; 33009e0823b2SMatthew G. Knepley newOwners[p-pStart].index = subPoint; 33019e0823b2SMatthew G. Knepley } 3302bdcf2095SMatthew G. Knepley } 3303bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3304bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3305bdcf2095SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3306bdcf2095SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3307785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &slocalPoints);CHKERRQ(ierr); 3308785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &sremotePoints);CHKERRQ(ierr); 330949c26ae4SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 3310bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 3311bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 3312aca35d17SMatthew G. Knepley 3313aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 331449c26ae4SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 3315aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 3316bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 3317bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 3318bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 3319bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 3320aca35d17SMatthew G. Knepley ++sl; 3321aca35d17SMatthew G. Knepley } 3322bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 332349c26ae4SMatthew G. Knepley if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 332449c26ae4SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 3325aca35d17SMatthew G. Knepley } 3326aca35d17SMatthew G. Knepley } 3327aca35d17SMatthew G. Knepley CHKMEMQ; 3328766ab985SMatthew G. Knepley /* Cleanup */ 3329766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 3330766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 3331766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 3332766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3333766ab985SMatthew G. Knepley } 3334766ab985SMatthew G. Knepley 33353982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DM subdm) 3336766ab985SMatthew G. Knepley { 33373982b651SMatthew G. Knepley DMLabel label = NULL; 3338766ab985SMatthew G. Knepley PetscErrorCode ierr; 3339766ab985SMatthew G. Knepley 3340766ab985SMatthew G. Knepley PetscFunctionBegin; 3341c58f1c22SToby Isaac if (labelname) {ierr = DMGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 3342bec263e5SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, label, value, PETSC_TRUE, 1, subdm);CHKERRQ(ierr); 3343766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3344766ab985SMatthew G. Knepley } 3345766ab985SMatthew G. Knepley 3346766ab985SMatthew G. Knepley /* 334727c04023SMatthew 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. 3348766ab985SMatthew G. Knepley 3349766ab985SMatthew G. Knepley Input Parameters: 3350766ab985SMatthew G. Knepley + dm - The original mesh 335127c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 33527afc1a8bSJed Brown . label - A label name, or NULL 335327c04023SMatthew G. Knepley - value - A label value 3354766ab985SMatthew G. Knepley 3355766ab985SMatthew G. Knepley Output Parameter: 3356766ab985SMatthew G. Knepley . subdm - The surface mesh 3357766ab985SMatthew G. Knepley 3358766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3359766ab985SMatthew G. Knepley 3360766ab985SMatthew G. Knepley Level: developer 3361766ab985SMatthew G. Knepley 3362766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 3363766ab985SMatthew G. Knepley */ 336427c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 3365766ab985SMatthew G. Knepley { 3366766ab985SMatthew G. Knepley PetscInt dim, depth; 3367766ab985SMatthew G. Knepley PetscErrorCode ierr; 3368766ab985SMatthew G. Knepley 3369766ab985SMatthew G. Knepley PetscFunctionBegin; 3370766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 337127c04023SMatthew G. Knepley PetscValidPointer(subdm, 5); 3372c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3373766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3374766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 3375766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3376c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr); 3377766ab985SMatthew G. Knepley if (depth == dim) { 3378b3154360SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr); 3379766ab985SMatthew G. Knepley } else { 338027c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 3381e6ccafaeSMatthew G Knepley } 3382e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3383e6ccafaeSMatthew G Knepley } 3384e6ccafaeSMatthew G Knepley 3385bec263e5SMatthew G. Knepley /*@ 3386bec263e5SMatthew G. Knepley DMPlexFilter - Extract a subset of mesh cells defined by a label as a separate mesh 3387bec263e5SMatthew G. Knepley 3388bec263e5SMatthew G. Knepley Input Parameters: 3389bec263e5SMatthew G. Knepley + dm - The original mesh 3390bec263e5SMatthew G. Knepley . cellLabel - The DMLabel marking cells contained in the new mesh 3391bec263e5SMatthew G. Knepley - value - The label value to use 3392bec263e5SMatthew G. Knepley 3393bec263e5SMatthew G. Knepley Output Parameter: 3394bec263e5SMatthew G. Knepley . subdm - The new mesh 3395bec263e5SMatthew G. Knepley 3396bec263e5SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3397bec263e5SMatthew G. Knepley 3398bec263e5SMatthew G. Knepley Level: developer 3399bec263e5SMatthew G. Knepley 3400c58f1c22SToby Isaac .seealso: DMPlexGetSubpointMap(), DMGetLabel(), DMLabelSetValue() 3401bec263e5SMatthew G. Knepley @*/ 3402bec263e5SMatthew G. Knepley PetscErrorCode DMPlexFilter(DM dm, DMLabel cellLabel, PetscInt value, DM *subdm) 3403bec263e5SMatthew G. Knepley { 3404bec263e5SMatthew G. Knepley PetscInt dim; 3405bec263e5SMatthew G. Knepley PetscErrorCode ierr; 3406bec263e5SMatthew G. Knepley 3407bec263e5SMatthew G. Knepley PetscFunctionBegin; 3408bec263e5SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3409bec263e5SMatthew G. Knepley PetscValidPointer(subdm, 3); 3410bec263e5SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3411bec263e5SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject) dm), subdm);CHKERRQ(ierr); 3412bec263e5SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3413bec263e5SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim);CHKERRQ(ierr); 3414bec263e5SMatthew G. Knepley /* Extract submesh in place, could be empty on some procs, could have inconsistency if procs do not both extract a shared cell */ 3415bec263e5SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, cellLabel, value, PETSC_FALSE, 0, *subdm);CHKERRQ(ierr); 3416bec263e5SMatthew G. Knepley PetscFunctionReturn(0); 3417bec263e5SMatthew G. Knepley } 3418bec263e5SMatthew G. Knepley 341964beef6dSMatthew G. Knepley /*@ 342064beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 342164beef6dSMatthew G. Knepley 342264beef6dSMatthew G. Knepley Input Parameter: 342364beef6dSMatthew G. Knepley . dm - The submesh DM 342464beef6dSMatthew G. Knepley 342564beef6dSMatthew G. Knepley Output Parameter: 342664beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 342764beef6dSMatthew G. Knepley 342864beef6dSMatthew G. Knepley Level: developer 342964beef6dSMatthew G. Knepley 343064beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 343164beef6dSMatthew G. Knepley @*/ 3432e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 3433e6ccafaeSMatthew G Knepley { 3434e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3435e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3436e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 343765663942SMatthew G. Knepley *subpointMap = ((DM_Plex*) dm->data)->subpointMap; 3438e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3439e6ccafaeSMatthew G Knepley } 3440e6ccafaeSMatthew G Knepley 3441e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */ 3442e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 3443e6ccafaeSMatthew G Knepley { 3444e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 3445285d324eSMatthew G. Knepley DMLabel tmp; 3446e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3447e6ccafaeSMatthew G Knepley 3448e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3449e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3450285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 3451e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 3452285d324eSMatthew G. Knepley ++mesh->subpointMap->refct; 3453285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 3454e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3455e6ccafaeSMatthew G Knepley } 3456e6ccafaeSMatthew G Knepley 345764beef6dSMatthew G. Knepley /*@ 3458e6ccafaeSMatthew G Knepley DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 3459e6ccafaeSMatthew G Knepley 3460e6ccafaeSMatthew G Knepley Input Parameter: 3461e6ccafaeSMatthew G Knepley . dm - The submesh DM 3462e6ccafaeSMatthew G Knepley 3463e6ccafaeSMatthew G Knepley Output Parameter: 34640298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 3465e6ccafaeSMatthew G Knepley 34663982b651SMatthew G. Knepley Note: This IS is guaranteed to be sorted by the construction of the submesh 346764beef6dSMatthew G. Knepley 346864beef6dSMatthew G. Knepley Level: developer 346964beef6dSMatthew G. Knepley 347064beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 347164beef6dSMatthew G. Knepley @*/ 3472e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 3473e6ccafaeSMatthew G Knepley { 347482f516ccSBarry Smith MPI_Comm comm; 3475e6ccafaeSMatthew G Knepley DMLabel subpointMap; 3476e6ccafaeSMatthew G Knepley IS is; 3477e6ccafaeSMatthew G Knepley const PetscInt *opoints; 3478e6ccafaeSMatthew G Knepley PetscInt *points, *depths; 3479e6ccafaeSMatthew G Knepley PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 3480e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3481e6ccafaeSMatthew G Knepley 3482e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3483e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3484e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 348582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 34860298fd71SBarry Smith *subpointIS = NULL; 3487e6ccafaeSMatthew G Knepley ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 3488e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3489fed694aaSMatthew G. Knepley if (subpointMap && depth >= 0) { 3490e6ccafaeSMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3491e6ccafaeSMatthew G Knepley if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 3492e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3493e6ccafaeSMatthew G Knepley depths[0] = depth; 3494e6ccafaeSMatthew G Knepley depths[1] = 0; 3495e6ccafaeSMatthew G Knepley for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 3496785e854fSJed Brown ierr = PetscMalloc1(pEnd, &points);CHKERRQ(ierr); 3497e6ccafaeSMatthew G Knepley for(d = 0, off = 0; d <= depth; ++d) { 3498e6ccafaeSMatthew G Knepley const PetscInt dep = depths[d]; 3499e6ccafaeSMatthew G Knepley 3500e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 3501e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 35021e21b6fdSMatthew G Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 3503e6ccafaeSMatthew 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); 3504e6ccafaeSMatthew G Knepley } else { 35051e21b6fdSMatthew G Knepley if (!n) { 35061e21b6fdSMatthew G Knepley if (d == 0) { 35071e21b6fdSMatthew G Knepley /* Missing cells */ 35081e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 35091e21b6fdSMatthew G Knepley } else { 35101e21b6fdSMatthew G Knepley /* Missing faces */ 35111e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 35121e21b6fdSMatthew G Knepley } 35131e21b6fdSMatthew G Knepley } 3514e6ccafaeSMatthew G Knepley } 3515e6ccafaeSMatthew G Knepley if (n) { 3516e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 3517e6ccafaeSMatthew G Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 3518e6ccafaeSMatthew G Knepley for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 3519e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 3520e6ccafaeSMatthew G Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 3521e6ccafaeSMatthew G Knepley } 3522e6ccafaeSMatthew G Knepley } 3523e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3524e6ccafaeSMatthew G Knepley if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 3525fed694aaSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 3526e6ccafaeSMatthew G Knepley } 3527e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3528e6ccafaeSMatthew G Knepley } 3529