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 5c08575a3SMatthew G. Knepley static 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 46c08575a3SMatthew G. Knepley static PetscErrorCode DMPlexLabelComplete_Internal(DM dm, DMLabel label, PetscBool completeCells) 47b0bf5782SToby Isaac { 48b0bf5782SToby Isaac IS valueIS; 49ac51f24eSSander Arens PetscSF sfPoint; 50b0bf5782SToby Isaac const PetscInt *values; 51ac51f24eSSander Arens PetscInt numValues, v, cStart, cEnd, nroots; 52b0bf5782SToby Isaac PetscErrorCode ierr; 53b0bf5782SToby Isaac 54b0bf5782SToby Isaac PetscFunctionBegin; 55b0bf5782SToby Isaac ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 56b0bf5782SToby Isaac ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 57b0bf5782SToby Isaac ierr = DMPlexGetHeightStratum(dm,0,&cStart,&cEnd);CHKERRQ(ierr); 58b0bf5782SToby Isaac ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 59b0bf5782SToby Isaac for (v = 0; v < numValues; ++v) { 60b0bf5782SToby Isaac IS pointIS; 61b0bf5782SToby Isaac const PetscInt *points; 62b0bf5782SToby Isaac PetscInt numPoints, p; 63b0bf5782SToby Isaac 64b0bf5782SToby Isaac ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 65b0bf5782SToby Isaac ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 66b0bf5782SToby Isaac ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 67b0bf5782SToby Isaac for (p = 0; p < numPoints; ++p) { 68b0bf5782SToby Isaac PetscInt q = points[p]; 69b0bf5782SToby Isaac PetscInt *closure = NULL; 70b0bf5782SToby Isaac PetscInt closureSize, c; 71b0bf5782SToby Isaac 72b0bf5782SToby Isaac if (cStart <= q && q < cEnd && !completeCells) { /* skip cells */ 73b0bf5782SToby Isaac continue; 74b0bf5782SToby Isaac } 75b0bf5782SToby Isaac ierr = DMPlexGetTransitiveClosure(dm, q, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 76b0bf5782SToby Isaac for (c = 0; c < closureSize*2; c += 2) { 77b0bf5782SToby Isaac ierr = DMLabelSetValue(label, closure[c], values[v]);CHKERRQ(ierr); 78b0bf5782SToby Isaac } 79b0bf5782SToby Isaac ierr = DMPlexRestoreTransitiveClosure(dm, q, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 80b0bf5782SToby Isaac } 81b0bf5782SToby Isaac ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 82b0bf5782SToby Isaac ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 83b0bf5782SToby Isaac } 84b0bf5782SToby Isaac ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 85b0bf5782SToby Isaac ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 86ac51f24eSSander Arens ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 87ac51f24eSSander Arens ierr = PetscSFGetGraph(sfPoint, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 88ac51f24eSSander Arens if (nroots >= 0) { 8926279d81SSanderA DMLabel lblRoots, lblLeaves; 9026279d81SSanderA IS valueIS, pointIS; 9126279d81SSanderA const PetscInt *values; 9226279d81SSanderA PetscInt numValues, v; 9326279d81SSanderA PetscErrorCode ierr; 9426279d81SSanderA 9526279d81SSanderA ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 9626279d81SSanderA /* Pull point contributions from remote leaves into local roots */ 9726279d81SSanderA ierr = DMLabelGather(label, sfPoint, &lblLeaves);CHKERRQ(ierr); 9826279d81SSanderA ierr = DMLabelGetValueIS(lblLeaves, &valueIS);CHKERRQ(ierr); 9926279d81SSanderA ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 10026279d81SSanderA ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 10126279d81SSanderA for (v = 0; v < numValues; ++v) { 10226279d81SSanderA const PetscInt value = values[v]; 10326279d81SSanderA 10426279d81SSanderA ierr = DMLabelGetStratumIS(lblLeaves, value, &pointIS);CHKERRQ(ierr); 10526279d81SSanderA ierr = DMLabelInsertIS(label, pointIS, value);CHKERRQ(ierr); 10626279d81SSanderA ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 10726279d81SSanderA } 10826279d81SSanderA ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 10926279d81SSanderA ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 11026279d81SSanderA ierr = DMLabelDestroy(&lblLeaves);CHKERRQ(ierr); 11126279d81SSanderA /* Push point contributions from roots into remote leaves */ 11226279d81SSanderA ierr = DMLabelDistribute(label, sfPoint, &lblRoots);CHKERRQ(ierr); 11326279d81SSanderA ierr = DMLabelGetValueIS(lblRoots, &valueIS);CHKERRQ(ierr); 11426279d81SSanderA ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 11526279d81SSanderA ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 11626279d81SSanderA for (v = 0; v < numValues; ++v) { 11726279d81SSanderA const PetscInt value = values[v]; 11826279d81SSanderA 11926279d81SSanderA ierr = DMLabelGetStratumIS(lblRoots, value, &pointIS);CHKERRQ(ierr); 12026279d81SSanderA ierr = DMLabelInsertIS(label, pointIS, value);CHKERRQ(ierr); 12126279d81SSanderA ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 12226279d81SSanderA } 12326279d81SSanderA ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 12426279d81SSanderA ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 12526279d81SSanderA ierr = DMLabelDestroy(&lblRoots);CHKERRQ(ierr); 12626279d81SSanderA } 127b0bf5782SToby Isaac PetscFunctionReturn(0); 128b0bf5782SToby Isaac } 129b0bf5782SToby Isaac 1302be2b188SMatthew G Knepley /*@ 1312be2b188SMatthew G Knepley DMPlexLabelComplete - Starting with a label marking points on a surface, we add the transitive closure to the surface 1322be2b188SMatthew G Knepley 1332be2b188SMatthew G Knepley Input Parameters: 1342be2b188SMatthew G Knepley + dm - The DM 1352be2b188SMatthew G Knepley - label - A DMLabel marking the surface points 1362be2b188SMatthew G Knepley 1372be2b188SMatthew G Knepley Output Parameter: 1382be2b188SMatthew G Knepley . label - A DMLabel marking all surface points in the transitive closure 1392be2b188SMatthew G Knepley 1402be2b188SMatthew G Knepley Level: developer 1412be2b188SMatthew G Knepley 1422be2b188SMatthew G Knepley .seealso: DMPlexLabelCohesiveComplete() 1432be2b188SMatthew G Knepley @*/ 1442be2b188SMatthew G Knepley PetscErrorCode DMPlexLabelComplete(DM dm, DMLabel label) 1452be2b188SMatthew G Knepley { 1462be2b188SMatthew G Knepley PetscErrorCode ierr; 1472be2b188SMatthew G Knepley 1482be2b188SMatthew G Knepley PetscFunctionBegin; 149b0bf5782SToby Isaac ierr = DMPlexLabelComplete_Internal(dm, label, PETSC_TRUE);CHKERRQ(ierr); 1502be2b188SMatthew G Knepley PetscFunctionReturn(0); 1512be2b188SMatthew G Knepley } 1522be2b188SMatthew G Knepley 1536cf0e42fSMatthew G. Knepley /*@ 1546cf0e42fSMatthew G. Knepley DMPlexLabelAddCells - Starting with a label marking faces on a surface, we add a cell for each face 1556cf0e42fSMatthew G. Knepley 1566cf0e42fSMatthew G. Knepley Input Parameters: 1576cf0e42fSMatthew G. Knepley + dm - The DM 1586cf0e42fSMatthew G. Knepley - label - A DMLabel marking the surface points 1596cf0e42fSMatthew G. Knepley 1606cf0e42fSMatthew G. Knepley Output Parameter: 1616cf0e42fSMatthew G. Knepley . label - A DMLabel incorporating cells 1626cf0e42fSMatthew G. Knepley 1636cf0e42fSMatthew G. Knepley Level: developer 1646cf0e42fSMatthew G. Knepley 1656cf0e42fSMatthew G. Knepley Note: The cells allow FEM boundary conditions to be applied using the cell geometry 1666cf0e42fSMatthew G. Knepley 1676cf0e42fSMatthew G. Knepley .seealso: DMPlexLabelComplete(), DMPlexLabelCohesiveComplete() 1686cf0e42fSMatthew G. Knepley @*/ 1696cf0e42fSMatthew G. Knepley PetscErrorCode DMPlexLabelAddCells(DM dm, DMLabel label) 1706cf0e42fSMatthew G. Knepley { 1716cf0e42fSMatthew G. Knepley IS valueIS; 1726cf0e42fSMatthew G. Knepley const PetscInt *values; 17322eabd52SMatthew G. Knepley PetscInt numValues, v, cStart, cEnd, cEndInterior; 1746cf0e42fSMatthew G. Knepley PetscErrorCode ierr; 1756cf0e42fSMatthew G. Knepley 1766cf0e42fSMatthew G. Knepley PetscFunctionBegin; 1776cf0e42fSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 17822eabd52SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cEndInterior, NULL, NULL, NULL);CHKERRQ(ierr); 17922eabd52SMatthew G. Knepley cEnd = cEndInterior < 0 ? cEnd : cEndInterior; 1806cf0e42fSMatthew G. Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 1816cf0e42fSMatthew G. Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 1826cf0e42fSMatthew G. Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 1836cf0e42fSMatthew G. Knepley for (v = 0; v < numValues; ++v) { 1846cf0e42fSMatthew G. Knepley IS pointIS; 1856cf0e42fSMatthew G. Knepley const PetscInt *points; 1866cf0e42fSMatthew G. Knepley PetscInt numPoints, p; 1876cf0e42fSMatthew G. Knepley 1886cf0e42fSMatthew G. Knepley ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 1896cf0e42fSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 1906cf0e42fSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 1916cf0e42fSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1926cf0e42fSMatthew G. Knepley PetscInt *closure = NULL; 19322eabd52SMatthew G. Knepley PetscInt closureSize, point, cl; 1946cf0e42fSMatthew G. Knepley 1956cf0e42fSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 19622eabd52SMatthew G. Knepley for (cl = closureSize-1; cl > 0; --cl) { 19722eabd52SMatthew G. Knepley point = closure[cl*2]; 19822eabd52SMatthew G. Knepley if ((point >= cStart) && (point < cEnd)) {ierr = DMLabelSetValue(label, point, values[v]);CHKERRQ(ierr); break;} 19922eabd52SMatthew G. Knepley } 2006cf0e42fSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 2016cf0e42fSMatthew G. Knepley } 2026cf0e42fSMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 2036cf0e42fSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 2046cf0e42fSMatthew G. Knepley } 2056cf0e42fSMatthew G. Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 2066cf0e42fSMatthew G. Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 2076cf0e42fSMatthew G. Knepley PetscFunctionReturn(0); 2086cf0e42fSMatthew G. Knepley } 2096cf0e42fSMatthew G. Knepley 210f402d5e4SToby Isaac /*@ 211f402d5e4SToby Isaac DMPlexLabelClearCells - Remove cells from a label 212f402d5e4SToby Isaac 213f402d5e4SToby Isaac Input Parameters: 214f402d5e4SToby Isaac + dm - The DM 215f402d5e4SToby Isaac - label - A DMLabel marking surface points and their adjacent cells 216f402d5e4SToby Isaac 217f402d5e4SToby Isaac Output Parameter: 218f402d5e4SToby Isaac . label - A DMLabel without cells 219f402d5e4SToby Isaac 220f402d5e4SToby Isaac Level: developer 221f402d5e4SToby Isaac 222f402d5e4SToby Isaac Note: This undoes DMPlexLabelAddCells() 223f402d5e4SToby Isaac 224f402d5e4SToby Isaac .seealso: DMPlexLabelComplete(), DMPlexLabelCohesiveComplete(), DMPlexLabelAddCells() 225f402d5e4SToby Isaac @*/ 226f402d5e4SToby Isaac PetscErrorCode DMPlexLabelClearCells(DM dm, DMLabel label) 227f402d5e4SToby Isaac { 228f402d5e4SToby Isaac IS valueIS; 229f402d5e4SToby Isaac const PetscInt *values; 230f402d5e4SToby Isaac PetscInt numValues, v, cStart, cEnd, cEndInterior; 231f402d5e4SToby Isaac PetscErrorCode ierr; 232f402d5e4SToby Isaac 233f402d5e4SToby Isaac PetscFunctionBegin; 234f402d5e4SToby Isaac ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 235f402d5e4SToby Isaac ierr = DMPlexGetHybridBounds(dm, &cEndInterior, NULL, NULL, NULL);CHKERRQ(ierr); 236f402d5e4SToby Isaac cEnd = cEndInterior < 0 ? cEnd : cEndInterior; 237f402d5e4SToby Isaac ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 238f402d5e4SToby Isaac ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 239f402d5e4SToby Isaac ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 240f402d5e4SToby Isaac for (v = 0; v < numValues; ++v) { 241f402d5e4SToby Isaac IS pointIS; 242f402d5e4SToby Isaac const PetscInt *points; 243f402d5e4SToby Isaac PetscInt numPoints, p; 244f402d5e4SToby Isaac 245f402d5e4SToby Isaac ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 246f402d5e4SToby Isaac ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 247f402d5e4SToby Isaac ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 248f402d5e4SToby Isaac for (p = 0; p < numPoints; ++p) { 249f402d5e4SToby Isaac PetscInt point = points[p]; 250f402d5e4SToby Isaac 251f402d5e4SToby Isaac if (point >= cStart && point < cEnd) { 252f402d5e4SToby Isaac ierr = DMLabelClearValue(label,point,values[v]);CHKERRQ(ierr); 253f402d5e4SToby Isaac } 254f402d5e4SToby Isaac } 255f402d5e4SToby Isaac ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 256f402d5e4SToby Isaac ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 257f402d5e4SToby Isaac } 258f402d5e4SToby Isaac ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 259f402d5e4SToby Isaac ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 260f402d5e4SToby Isaac PetscFunctionReturn(0); 261f402d5e4SToby Isaac } 262f402d5e4SToby Isaac 26359eef20bSToby Isaac /* take (oldEnd, added) pairs, ordered by height and convert them to (oldstart, newstart) pairs, ordered by ascending 26459eef20bSToby Isaac * index (skipping first, which is (0,0)) */ 2652582d50cSToby Isaac PETSC_STATIC_INLINE PetscErrorCode DMPlexShiftPointSetUp_Internal(PetscInt depth, PetscInt depthShift[]) 266cd0c2139SMatthew G Knepley { 2672582d50cSToby Isaac PetscInt d, off = 0; 2682582d50cSToby Isaac 2692582d50cSToby Isaac PetscFunctionBegin; 27059eef20bSToby Isaac /* sort by (oldend): yes this is an O(n^2) sort, we expect depth <= 3 */ 2710974a383SToby Isaac for (d = 0; d < depth; d++) { 2722582d50cSToby Isaac PetscInt firstd = d; 2730974a383SToby Isaac PetscInt firstStart = depthShift[2*d]; 2742582d50cSToby Isaac PetscInt e; 2752582d50cSToby Isaac 2762582d50cSToby Isaac for (e = d+1; e <= depth; e++) { 2772582d50cSToby Isaac if (depthShift[2*e] < firstStart) { 2782582d50cSToby Isaac firstd = e; 2792582d50cSToby Isaac firstStart = depthShift[2*d]; 2802582d50cSToby Isaac } 2812582d50cSToby Isaac } 2822582d50cSToby Isaac if (firstd != d) { 2832582d50cSToby Isaac PetscInt swap[2]; 2842582d50cSToby Isaac 2852582d50cSToby Isaac e = firstd; 2862582d50cSToby Isaac swap[0] = depthShift[2*d]; 2872582d50cSToby Isaac swap[1] = depthShift[2*d+1]; 2882582d50cSToby Isaac depthShift[2*d] = depthShift[2*e]; 2892582d50cSToby Isaac depthShift[2*d+1] = depthShift[2*e+1]; 2902582d50cSToby Isaac depthShift[2*e] = swap[0]; 2912582d50cSToby Isaac depthShift[2*e+1] = swap[1]; 2922582d50cSToby Isaac } 2932582d50cSToby Isaac } 2942582d50cSToby Isaac /* convert (oldstart, added) to (oldstart, newstart) */ 2950974a383SToby Isaac for (d = 0; d <= depth; d++) { 2962582d50cSToby Isaac off += depthShift[2*d+1]; 29759eef20bSToby Isaac depthShift[2*d+1] = depthShift[2*d] + off; 2982582d50cSToby Isaac } 2992582d50cSToby Isaac PetscFunctionReturn(0); 3002582d50cSToby Isaac } 3012582d50cSToby Isaac 3022582d50cSToby Isaac /* depthShift is a list of (old, new) pairs */ 3032582d50cSToby Isaac PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthShift[]) 3042582d50cSToby Isaac { 3052582d50cSToby Isaac PetscInt d; 3062582d50cSToby Isaac PetscInt newOff = 0; 3072582d50cSToby Isaac 3082582d50cSToby Isaac for (d = 0; d <= depth; d++) { 3092582d50cSToby Isaac if (p < depthShift[2*d]) return p + newOff; 3102582d50cSToby Isaac else newOff = depthShift[2*d+1] - depthShift[2*d]; 3112582d50cSToby Isaac } 3120974a383SToby Isaac return p + newOff; 3132582d50cSToby Isaac } 3142582d50cSToby Isaac 3152582d50cSToby Isaac /* depthShift is a list of (old, new) pairs */ 3162582d50cSToby Isaac PETSC_STATIC_INLINE PetscInt DMPlexShiftPointInverse_Internal(PetscInt p, PetscInt depth, PetscInt depthShift[]) 3172582d50cSToby Isaac { 3182582d50cSToby Isaac PetscInt d; 3192582d50cSToby Isaac PetscInt newOff = 0; 3202582d50cSToby Isaac 3212582d50cSToby Isaac for (d = 0; d <= depth; d++) { 3222582d50cSToby Isaac if (p < depthShift[2*d+1]) return p + newOff; 3232582d50cSToby Isaac else newOff = depthShift[2*d] - depthShift[2*d+1]; 3242582d50cSToby Isaac } 3250974a383SToby Isaac return p + newOff; 326cd0c2139SMatthew G Knepley } 327cd0c2139SMatthew G Knepley 328cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew) 329cd0c2139SMatthew G Knepley { 330cd0c2139SMatthew G Knepley PetscInt depth = 0, d, pStart, pEnd, p; 331*fa8e8ae5SToby Isaac DMLabel depthLabel; 332cd0c2139SMatthew G Knepley PetscErrorCode ierr; 333cd0c2139SMatthew G Knepley 334cd0c2139SMatthew G Knepley PetscFunctionBegin; 335cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 336cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 337cd0c2139SMatthew G Knepley /* Step 1: Expand chart */ 338cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3390974a383SToby Isaac pEnd = DMPlexShiftPoint_Internal(pEnd,depth,depthShift); 340cd0c2139SMatthew G Knepley ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr); 341*fa8e8ae5SToby Isaac ierr = DMCreateLabel(dmNew,"depth");CHKERRQ(ierr); 342*fa8e8ae5SToby Isaac ierr = DMPlexGetDepthLabel(dmNew,&depthLabel);CHKERRQ(ierr); 343cd0c2139SMatthew G Knepley /* Step 2: Set cone and support sizes */ 344cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 345*fa8e8ae5SToby Isaac PetscInt pStartNew, pEndNew; 346*fa8e8ae5SToby Isaac IS pIS; 347*fa8e8ae5SToby Isaac 348cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 349*fa8e8ae5SToby Isaac pStartNew = DMPlexShiftPoint_Internal(pStart, depth, depthShift); 350*fa8e8ae5SToby Isaac pEndNew = DMPlexShiftPoint_Internal(pEnd, depth, depthShift); 351*fa8e8ae5SToby Isaac ierr = ISCreateStride(PETSC_COMM_SELF, pEndNew - pStartNew, pStartNew, 1, &pIS);CHKERRQ(ierr); 352*fa8e8ae5SToby Isaac ierr = DMLabelSetStratumIS(depthLabel, d, pIS);CHKERRQ(ierr); 353*fa8e8ae5SToby Isaac ierr = ISDestroy(&pIS);CHKERRQ(ierr); 354cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 3552582d50cSToby Isaac PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthShift); 356cd0c2139SMatthew G Knepley PetscInt size; 357cd0c2139SMatthew G Knepley 358cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 359cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr); 360cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 361cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr); 362cd0c2139SMatthew G Knepley } 363cd0c2139SMatthew G Knepley } 364cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 365cd0c2139SMatthew G Knepley } 366cd0c2139SMatthew G Knepley 367cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew) 368cd0c2139SMatthew G Knepley { 3692582d50cSToby Isaac PetscInt *newpoints; 3702582d50cSToby Isaac PetscInt depth = 0, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, pStart, pEnd, p; 371cd0c2139SMatthew G Knepley PetscErrorCode ierr; 372cd0c2139SMatthew G Knepley 373cd0c2139SMatthew G Knepley PetscFunctionBegin; 374cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 375cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 376cd0c2139SMatthew G Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 377dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dmNew, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 3782582d50cSToby Isaac ierr = PetscMalloc1(PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),&newpoints);CHKERRQ(ierr); 379cd0c2139SMatthew G Knepley /* Step 5: Set cones and supports */ 380cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 381cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 382cd0c2139SMatthew G Knepley const PetscInt *points = NULL, *orientations = NULL; 3832582d50cSToby Isaac PetscInt size,sizeNew, i, newp = DMPlexShiftPoint_Internal(p, depth, depthShift); 384cd0c2139SMatthew G Knepley 385cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 386cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr); 387cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr); 388cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 3892582d50cSToby Isaac newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthShift); 390cd0c2139SMatthew G Knepley } 391cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr); 392cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr); 393cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 394dcbb62e8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmNew, newp, &sizeNew);CHKERRQ(ierr); 395cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr); 396cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 3972582d50cSToby Isaac newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthShift); 398cd0c2139SMatthew G Knepley } 399dcbb62e8SMatthew G. Knepley for (i = size; i < sizeNew; ++i) newpoints[i] = 0; 400cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr); 401cd0c2139SMatthew G Knepley } 4022582d50cSToby Isaac ierr = PetscFree(newpoints);CHKERRQ(ierr); 403cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 404cd0c2139SMatthew G Knepley } 405cd0c2139SMatthew G Knepley 406cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew) 407cd0c2139SMatthew G Knepley { 408cd0c2139SMatthew G Knepley PetscSection coordSection, newCoordSection; 409cd0c2139SMatthew G Knepley Vec coordinates, newCoordinates; 410cd0c2139SMatthew G Knepley PetscScalar *coords, *newCoords; 411f2b8cce1SMatthew G. Knepley PetscInt coordSize, sStart, sEnd; 412f2b8cce1SMatthew G. Knepley PetscInt dim, depth = 0, cStart, cEnd, cStartNew, cEndNew, c, vStart, vEnd, vStartNew, vEndNew, v; 413f2b8cce1SMatthew G. Knepley PetscBool hasCells; 414cd0c2139SMatthew G Knepley PetscErrorCode ierr; 415cd0c2139SMatthew G Knepley 416cd0c2139SMatthew G Knepley PetscFunctionBegin; 417f2b8cce1SMatthew G. Knepley ierr = DMGetCoordinateDim(dm, &dim);CHKERRQ(ierr); 418c0e8cf5fSMatthew G. Knepley ierr = DMSetCoordinateDim(dmNew, dim);CHKERRQ(ierr); 419cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 420cd0c2139SMatthew G Knepley /* Step 8: Convert coordinates */ 421cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 422f2b8cce1SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 423cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr); 424f2b8cce1SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dmNew, 0, &cStartNew, &cEndNew);CHKERRQ(ierr); 42569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 426cd0c2139SMatthew G Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr); 427cd0c2139SMatthew G Knepley ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr); 428cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr); 429f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetChart(coordSection, &sStart, &sEnd);CHKERRQ(ierr); 430f2b8cce1SMatthew G. Knepley hasCells = sStart == cStart ? PETSC_TRUE : PETSC_FALSE; 431f2b8cce1SMatthew G. Knepley ierr = PetscSectionSetChart(newCoordSection, hasCells ? cStartNew : vStartNew, vEndNew);CHKERRQ(ierr); 432f2b8cce1SMatthew G. Knepley if (hasCells) { 433f2b8cce1SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 434f2b8cce1SMatthew G. Knepley PetscInt cNew = DMPlexShiftPoint_Internal(c, depth, depthShift), dof; 435f2b8cce1SMatthew G. Knepley 436f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, c, &dof);CHKERRQ(ierr); 437f2b8cce1SMatthew G. Knepley ierr = PetscSectionSetDof(newCoordSection, cNew, dof);CHKERRQ(ierr); 438f2b8cce1SMatthew G. Knepley ierr = PetscSectionSetFieldDof(newCoordSection, cNew, 0, dof);CHKERRQ(ierr); 439f2b8cce1SMatthew G. Knepley } 440f2b8cce1SMatthew G. Knepley } 441cd0c2139SMatthew G Knepley for (v = vStartNew; v < vEndNew; ++v) { 442cd0c2139SMatthew G Knepley ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr); 443cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr); 444cd0c2139SMatthew G Knepley } 445cd0c2139SMatthew G Knepley ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr); 44646e270d4SMatthew G. Knepley ierr = DMSetCoordinateSection(dmNew, PETSC_DETERMINE, newCoordSection);CHKERRQ(ierr); 447cd0c2139SMatthew G Knepley ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr); 4488b9ced59SLisandro Dalcin ierr = VecCreate(PETSC_COMM_SELF, &newCoordinates);CHKERRQ(ierr); 449cd0c2139SMatthew G Knepley ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr); 450cd0c2139SMatthew G Knepley ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 4514e90ef8eSMatthew G. Knepley ierr = VecSetBlockSize(newCoordinates, dim);CHKERRQ(ierr); 4522eb5907fSJed Brown ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr); 453cd0c2139SMatthew G Knepley ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr); 454cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 455cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 456cd0c2139SMatthew G Knepley ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr); 457f2b8cce1SMatthew G. Knepley if (hasCells) { 458f2b8cce1SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 459f2b8cce1SMatthew G. Knepley PetscInt cNew = DMPlexShiftPoint_Internal(c, depth, depthShift), dof, off, noff, d; 460f2b8cce1SMatthew G. Knepley 461f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, c, &dof);CHKERRQ(ierr); 462f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, c, &off);CHKERRQ(ierr); 463f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetOffset(newCoordSection, cNew, &noff);CHKERRQ(ierr); 464f2b8cce1SMatthew G. Knepley for (d = 0; d < dof; ++d) newCoords[noff+d] = coords[off+d]; 465f2b8cce1SMatthew G. Knepley } 466f2b8cce1SMatthew G. Knepley } 467cd0c2139SMatthew G Knepley for (v = vStart; v < vEnd; ++v) { 468cd0c2139SMatthew G Knepley PetscInt dof, off, noff, d; 469cd0c2139SMatthew G Knepley 470cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 471cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 4722582d50cSToby Isaac ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthShift), &noff);CHKERRQ(ierr); 473f2b8cce1SMatthew G. Knepley for (d = 0; d < dof; ++d) newCoords[noff+d] = coords[off+d]; 474cd0c2139SMatthew G Knepley } 475cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 476cd0c2139SMatthew G Knepley ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr); 477cd0c2139SMatthew G Knepley ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 478cd0c2139SMatthew G Knepley ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr); 479cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 480cd0c2139SMatthew G Knepley } 481cd0c2139SMatthew G Knepley 482cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew) 483cd0c2139SMatthew G Knepley { 4842582d50cSToby Isaac PetscInt depth = 0; 485cd0c2139SMatthew G Knepley PetscSF sfPoint, sfPointNew; 486cd0c2139SMatthew G Knepley const PetscSFNode *remotePoints; 487cd0c2139SMatthew G Knepley PetscSFNode *gremotePoints; 488cd0c2139SMatthew G Knepley const PetscInt *localPoints; 489cd0c2139SMatthew G Knepley PetscInt *glocalPoints, *newLocation, *newRemoteLocation; 490cd0c2139SMatthew G Knepley PetscInt numRoots, numLeaves, l, pStart, pEnd, totShift = 0; 491cd0c2139SMatthew G Knepley PetscErrorCode ierr; 492cd0c2139SMatthew G Knepley 493cd0c2139SMatthew G Knepley PetscFunctionBegin; 494cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 495cd0c2139SMatthew G Knepley /* Step 9: Convert pointSF */ 496cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 497cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr); 498cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 499cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 5006e21efdcSToby Isaac totShift = DMPlexShiftPoint_Internal(pEnd,depth,depthShift) - pEnd; 501cd0c2139SMatthew G Knepley if (numRoots >= 0) { 502dcca6d9dSJed Brown ierr = PetscMalloc2(numRoots,&newLocation,pEnd-pStart,&newRemoteLocation);CHKERRQ(ierr); 5032582d50cSToby Isaac for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthShift); 504cd0c2139SMatthew G Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 505cd0c2139SMatthew G Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 506785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &glocalPoints);CHKERRQ(ierr); 507785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &gremotePoints);CHKERRQ(ierr); 508cd0c2139SMatthew G Knepley for (l = 0; l < numLeaves; ++l) { 5092582d50cSToby Isaac glocalPoints[l] = DMPlexShiftPoint_Internal(localPoints[l], depth, depthShift); 510cd0c2139SMatthew G Knepley gremotePoints[l].rank = remotePoints[l].rank; 511cd0c2139SMatthew G Knepley gremotePoints[l].index = newRemoteLocation[localPoints[l]]; 512cd0c2139SMatthew G Knepley } 513cd0c2139SMatthew G Knepley ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr); 514cd0c2139SMatthew G Knepley ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 515cd0c2139SMatthew G Knepley } 516cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 517cd0c2139SMatthew G Knepley } 518cd0c2139SMatthew G Knepley 519cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew) 520cd0c2139SMatthew G Knepley { 521cd0c2139SMatthew G Knepley PetscSF sfPoint; 522cd0c2139SMatthew G Knepley DMLabel vtkLabel, ghostLabel; 523cd0c2139SMatthew G Knepley const PetscSFNode *leafRemote; 524cd0c2139SMatthew G Knepley const PetscInt *leafLocal; 5252582d50cSToby Isaac PetscInt depth = 0, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f; 526cd0c2139SMatthew G Knepley PetscMPIInt rank; 527cd0c2139SMatthew G Knepley PetscErrorCode ierr; 528cd0c2139SMatthew G Knepley 529cd0c2139SMatthew G Knepley PetscFunctionBegin; 530cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 531cd0c2139SMatthew G Knepley /* Step 10: Convert labels */ 532c58f1c22SToby Isaac ierr = DMGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 533cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 534cd0c2139SMatthew G Knepley DMLabel label, newlabel; 535cd0c2139SMatthew G Knepley const char *lname; 536*fa8e8ae5SToby Isaac PetscBool isDepth, isDim; 537cd0c2139SMatthew G Knepley IS valueIS; 538cd0c2139SMatthew G Knepley const PetscInt *values; 539cd0c2139SMatthew G Knepley PetscInt numValues, val; 540cd0c2139SMatthew G Knepley 541c58f1c22SToby Isaac ierr = DMGetLabelName(dm, l, &lname);CHKERRQ(ierr); 542cd0c2139SMatthew G Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 543cd0c2139SMatthew G Knepley if (isDepth) continue; 544*fa8e8ae5SToby Isaac ierr = PetscStrcmp(lname, "dim", &isDim);CHKERRQ(ierr); 545*fa8e8ae5SToby Isaac if (isDim) continue; 546c58f1c22SToby Isaac ierr = DMCreateLabel(dmNew, lname);CHKERRQ(ierr); 547c58f1c22SToby Isaac ierr = DMGetLabel(dm, lname, &label);CHKERRQ(ierr); 548c58f1c22SToby Isaac ierr = DMGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr); 54964a6a1a4SToby Isaac ierr = DMLabelGetDefaultValue(label,&val);CHKERRQ(ierr); 55064a6a1a4SToby Isaac ierr = DMLabelSetDefaultValue(newlabel,val);CHKERRQ(ierr); 551cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 552cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 553cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 554cd0c2139SMatthew G Knepley for (val = 0; val < numValues; ++val) { 555cd0c2139SMatthew G Knepley IS pointIS; 556cd0c2139SMatthew G Knepley const PetscInt *points; 557cd0c2139SMatthew G Knepley PetscInt numPoints, p; 558cd0c2139SMatthew G Knepley 559cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 560cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 561cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 562cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 5632582d50cSToby Isaac const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthShift); 564cd0c2139SMatthew G Knepley 565cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr); 566cd0c2139SMatthew G Knepley } 567cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 568cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 569cd0c2139SMatthew G Knepley } 570cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 571cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 572cd0c2139SMatthew G Knepley } 573cd0c2139SMatthew G Knepley /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */ 574cd0c2139SMatthew G Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 575cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 576cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 577cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr); 578c58f1c22SToby Isaac ierr = DMCreateLabel(dmNew, "vtk");CHKERRQ(ierr); 579c58f1c22SToby Isaac ierr = DMCreateLabel(dmNew, "ghost");CHKERRQ(ierr); 580c58f1c22SToby Isaac ierr = DMGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr); 581c58f1c22SToby Isaac ierr = DMGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr); 582cd0c2139SMatthew G Knepley for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { 583cd0c2139SMatthew G Knepley for (; c < leafLocal[l] && c < cEnd; ++c) { 584cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 585cd0c2139SMatthew G Knepley } 586cd0c2139SMatthew G Knepley if (leafLocal[l] >= cEnd) break; 587cd0c2139SMatthew G Knepley if (leafRemote[l].rank == rank) { 588cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 589cd0c2139SMatthew G Knepley } else { 590cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr); 591cd0c2139SMatthew G Knepley } 592cd0c2139SMatthew G Knepley } 593cd0c2139SMatthew G Knepley for (; c < cEnd; ++c) { 594cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 595cd0c2139SMatthew G Knepley } 596cd0c2139SMatthew G Knepley if (0) { 597cd0c2139SMatthew G Knepley ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 598cd0c2139SMatthew G Knepley } 599cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr); 600cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 601cd0c2139SMatthew G Knepley PetscInt numCells; 602cd0c2139SMatthew G Knepley 603cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr); 604cd0c2139SMatthew G Knepley if (numCells < 2) { 605cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr); 606cd0c2139SMatthew G Knepley } else { 607cd0c2139SMatthew G Knepley const PetscInt *cells = NULL; 608cd0c2139SMatthew G Knepley PetscInt vA, vB; 609cd0c2139SMatthew G Knepley 610cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr); 611cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr); 612cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr); 61390664b96SToby Isaac if (vA != 1 && vB != 1) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);} 614cd0c2139SMatthew G Knepley } 615cd0c2139SMatthew G Knepley } 616cd0c2139SMatthew G Knepley if (0) { 617cd0c2139SMatthew G Knepley ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 618cd0c2139SMatthew G Knepley } 619cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 620cd0c2139SMatthew G Knepley } 621cd0c2139SMatthew G Knepley 622ca04dac2SToby Isaac static PetscErrorCode DMPlexShiftTree_Internal(DM dm, PetscInt depthShift[], DM dmNew) 623ca04dac2SToby Isaac { 624ca04dac2SToby Isaac DM refTree; 625ca04dac2SToby Isaac PetscSection pSec; 626ca04dac2SToby Isaac PetscInt *parents, *childIDs; 627ca04dac2SToby Isaac PetscErrorCode ierr; 628ca04dac2SToby Isaac 629ca04dac2SToby Isaac PetscFunctionBegin; 630ca04dac2SToby Isaac ierr = DMPlexGetReferenceTree(dm,&refTree);CHKERRQ(ierr); 631ca04dac2SToby Isaac ierr = DMPlexSetReferenceTree(dmNew,refTree);CHKERRQ(ierr); 632ca04dac2SToby Isaac ierr = DMPlexGetTree(dm,&pSec,&parents,&childIDs,NULL,NULL);CHKERRQ(ierr); 633ca04dac2SToby Isaac if (pSec) { 6342582d50cSToby Isaac PetscInt p, pStart, pEnd, *parentsShifted, pStartShifted, pEndShifted, depth; 635fb4630b5SToby Isaac PetscInt *childIDsShifted; 636ca04dac2SToby Isaac PetscSection pSecShifted; 637ca04dac2SToby Isaac 638ca04dac2SToby Isaac ierr = PetscSectionGetChart(pSec,&pStart,&pEnd);CHKERRQ(ierr); 639ca04dac2SToby Isaac ierr = DMPlexGetDepth(dm,&depth);CHKERRQ(ierr); 6402582d50cSToby Isaac pStartShifted = DMPlexShiftPoint_Internal(pStart,depth,depthShift); 6412582d50cSToby Isaac pEndShifted = DMPlexShiftPoint_Internal(pEnd,depth,depthShift); 642fb4630b5SToby Isaac ierr = PetscMalloc2(pEndShifted - pStartShifted,&parentsShifted,pEndShifted-pStartShifted,&childIDsShifted);CHKERRQ(ierr); 643ca04dac2SToby Isaac ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dmNew),&pSecShifted);CHKERRQ(ierr); 644ca04dac2SToby Isaac ierr = PetscSectionSetChart(pSecShifted,pStartShifted,pEndShifted);CHKERRQ(ierr); 645ca04dac2SToby Isaac for (p = pStartShifted; p < pEndShifted; p++) { 646fb4630b5SToby Isaac /* start off assuming no children */ 647fb4630b5SToby Isaac ierr = PetscSectionSetDof(pSecShifted,p,0);CHKERRQ(ierr); 648fb4630b5SToby Isaac } 649fb4630b5SToby Isaac for (p = pStart; p < pEnd; p++) { 650fb4630b5SToby Isaac PetscInt dof; 651fb4630b5SToby Isaac PetscInt pNew = DMPlexShiftPoint_Internal(p,depth,depthShift); 652ca04dac2SToby Isaac 653ca04dac2SToby Isaac ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr); 654fb4630b5SToby Isaac ierr = PetscSectionSetDof(pSecShifted,pNew,dof);CHKERRQ(ierr); 655ca04dac2SToby Isaac } 656ca04dac2SToby Isaac ierr = PetscSectionSetUp(pSecShifted);CHKERRQ(ierr); 657fb4630b5SToby Isaac for (p = pStart; p < pEnd; p++) { 658fb4630b5SToby Isaac PetscInt dof; 659fb4630b5SToby Isaac PetscInt pNew = DMPlexShiftPoint_Internal(p,depth,depthShift); 660fb4630b5SToby Isaac 661fb4630b5SToby Isaac ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr); 662fb4630b5SToby Isaac if (dof) { 663fb4630b5SToby Isaac PetscInt off, offNew; 664fb4630b5SToby Isaac 665fb4630b5SToby Isaac ierr = PetscSectionGetOffset(pSec,p,&off);CHKERRQ(ierr); 666fb4630b5SToby Isaac ierr = PetscSectionGetOffset(pSecShifted,pNew,&offNew);CHKERRQ(ierr); 667fb4630b5SToby Isaac parentsShifted[offNew] = DMPlexShiftPoint_Internal(parents[off],depth,depthShift); 668fb4630b5SToby Isaac childIDsShifted[offNew] = childIDs[off]; 669fb4630b5SToby Isaac } 670fb4630b5SToby Isaac } 671fb4630b5SToby Isaac ierr = DMPlexSetTree(dmNew,pSecShifted,parentsShifted,childIDsShifted);CHKERRQ(ierr); 672fb4630b5SToby Isaac ierr = PetscFree2(parentsShifted,childIDsShifted);CHKERRQ(ierr); 673e6885bbbSToby Isaac ierr = PetscSectionDestroy(&pSecShifted);CHKERRQ(ierr); 674ca04dac2SToby Isaac } 675ca04dac2SToby Isaac PetscFunctionReturn(0); 676ca04dac2SToby Isaac } 677ca04dac2SToby Isaac 678cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm) 679cd0c2139SMatthew G Knepley { 680da97024aSMatthew G. Knepley PetscSF sf; 681cd0c2139SMatthew G Knepley IS valueIS; 682da97024aSMatthew G. Knepley const PetscInt *values, *leaves; 683cd0c2139SMatthew G Knepley PetscInt *depthShift; 6842582d50cSToby Isaac PetscInt d, depth = 0, nleaves, loc, Ng, numFS, fs, fStart, fEnd, ghostCell, cEnd, c; 68590b157c4SStefano Zampini PetscBool isper; 68690b157c4SStefano Zampini const PetscReal *maxCell, *L; 68790b157c4SStefano Zampini const DMBoundaryType *bd; 688cd0c2139SMatthew G Knepley PetscErrorCode ierr; 689cd0c2139SMatthew G Knepley 690cd0c2139SMatthew G Knepley PetscFunctionBegin; 691da97024aSMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 692da97024aSMatthew G. Knepley ierr = PetscSFGetGraph(sf, NULL, &nleaves, &leaves, NULL);CHKERRQ(ierr); 693da97024aSMatthew G. Knepley nleaves = PetscMax(0, nleaves); 69446c796b9SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 695cd0c2139SMatthew G Knepley /* Count ghost cells */ 696cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 697cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr); 698cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 6994a6cfa73SMatthew G. Knepley Ng = 0; 700cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 70146c796b9SMatthew G. Knepley IS faceIS; 70246c796b9SMatthew G. Knepley const PetscInt *faces; 70346c796b9SMatthew G. Knepley PetscInt numFaces, f, numBdFaces = 0; 704cd0c2139SMatthew G Knepley 70546c796b9SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 70646c796b9SMatthew G. Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 70746c796b9SMatthew G. Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 70846c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 709ca04dac2SToby Isaac PetscInt numChildren; 710ca04dac2SToby Isaac 711da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 712ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 713ca04dac2SToby Isaac /* non-local and ancestors points don't get to register ghosts */ 714ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 71546c796b9SMatthew G. Knepley if ((faces[f] >= fStart) && (faces[f] < fEnd)) ++numBdFaces; 71646c796b9SMatthew G. Knepley } 7174a6cfa73SMatthew G. Knepley Ng += numBdFaces; 71846c796b9SMatthew G. Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 719cd0c2139SMatthew G Knepley } 720cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 7212582d50cSToby Isaac ierr = PetscMalloc1(2*(depth+1), &depthShift);CHKERRQ(ierr); 7222582d50cSToby Isaac for (d = 0; d <= depth; d++) { 72359eef20bSToby Isaac PetscInt dEnd; 7242582d50cSToby Isaac 7250974a383SToby Isaac ierr = DMPlexGetDepthStratum(dm,d,NULL,&dEnd);CHKERRQ(ierr); 72659eef20bSToby Isaac depthShift[2*d] = dEnd; 7272582d50cSToby Isaac depthShift[2*d+1] = 0; 7282582d50cSToby Isaac } 7292582d50cSToby Isaac if (depth >= 0) depthShift[2*depth+1] = Ng; 7302582d50cSToby Isaac ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift);CHKERRQ(ierr); 731cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 732cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 733cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 7345acea1aeSMatthew G. Knepley ierr = DMPlexSetHybridBounds(gdm, cEnd, PETSC_DETERMINE, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 7354a6cfa73SMatthew G. Knepley for (c = cEnd; c < cEnd + Ng; ++c) { 736cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr); 737cd0c2139SMatthew G Knepley } 738cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 739cd0c2139SMatthew G Knepley IS faceIS; 740cd0c2139SMatthew G Knepley const PetscInt *faces; 741cd0c2139SMatthew G Knepley PetscInt numFaces, f; 742cd0c2139SMatthew G Knepley 743cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 744cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 745cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 746cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 747ca04dac2SToby Isaac PetscInt size, numChildren; 748cd0c2139SMatthew G Knepley 749da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 750ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 751ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 75246c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 753cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr); 7544553fd90SToby Isaac if (size != 1) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "DM has boundary face %d with %d support cells", faces[f], size); 7554a6cfa73SMatthew G. Knepley ierr = DMPlexSetSupportSize(gdm, faces[f] + Ng, 2);CHKERRQ(ierr); 756cd0c2139SMatthew G Knepley } 757cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 758cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 759cd0c2139SMatthew G Knepley } 760cd0c2139SMatthew G Knepley /* Step 4: Setup ghosted DM */ 761cd0c2139SMatthew G Knepley ierr = DMSetUp(gdm);CHKERRQ(ierr); 762cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 763cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 764cd0c2139SMatthew G Knepley ghostCell = cEnd; 765cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 766cd0c2139SMatthew G Knepley IS faceIS; 767cd0c2139SMatthew G Knepley const PetscInt *faces; 768cd0c2139SMatthew G Knepley PetscInt numFaces, f; 769cd0c2139SMatthew G Knepley 770cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 771cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 772cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 77346c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 774ca04dac2SToby Isaac PetscInt newFace = faces[f] + Ng, numChildren; 775cd0c2139SMatthew G Knepley 776da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 777ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 778ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 77946c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 780cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr); 781cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr); 78246c796b9SMatthew G. Knepley ++ghostCell; 783cd0c2139SMatthew G Knepley } 784cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 785cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 786cd0c2139SMatthew G Knepley } 787cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 788cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 789cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 790cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 791cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 792ca04dac2SToby Isaac ierr = DMPlexShiftTree_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 793cd0c2139SMatthew G Knepley ierr = PetscFree(depthShift);CHKERRQ(ierr); 794966c7b3fSMatthew G. Knepley /* Step 7: Periodicity */ 79590b157c4SStefano Zampini ierr = DMGetPeriodicity(dm, &isper, &maxCell, &L, &bd);CHKERRQ(ierr); 79690b157c4SStefano Zampini ierr = DMSetPeriodicity(gdm, isper, maxCell, L, bd);CHKERRQ(ierr); 7974a6cfa73SMatthew G. Knepley if (numGhostCells) *numGhostCells = Ng; 798cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 799cd0c2139SMatthew G Knepley } 800cd0c2139SMatthew G Knepley 801cd0c2139SMatthew G Knepley /*@C 802cd0c2139SMatthew G Knepley DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face 803cd0c2139SMatthew G Knepley 804cd0c2139SMatthew G Knepley Collective on dm 805cd0c2139SMatthew G Knepley 806cd0c2139SMatthew G Knepley Input Parameters: 807cd0c2139SMatthew G Knepley + dm - The original DM 808cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL 809cd0c2139SMatthew G Knepley 810cd0c2139SMatthew G Knepley Output Parameters: 811cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM 812cd0c2139SMatthew G Knepley - dmGhosted - The new DM 813cd0c2139SMatthew G Knepley 814cd0c2139SMatthew G Knepley Note: If no label exists of that name, one will be created marking all boundary faces 815cd0c2139SMatthew G Knepley 816cd0c2139SMatthew G Knepley Level: developer 817cd0c2139SMatthew G Knepley 818cd0c2139SMatthew G Knepley .seealso: DMCreate() 81931266bc0SMatthew G. Knepley @*/ 820cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted) 821cd0c2139SMatthew G Knepley { 822cd0c2139SMatthew G Knepley DM gdm; 823cd0c2139SMatthew G Knepley DMLabel label; 824cd0c2139SMatthew G Knepley const char *name = labelName ? labelName : "Face Sets"; 825cd0c2139SMatthew G Knepley PetscInt dim; 826a42b08eeSMatthew G. Knepley PetscBool flag; 827cd0c2139SMatthew G Knepley PetscErrorCode ierr; 828cd0c2139SMatthew G Knepley 829cd0c2139SMatthew G Knepley PetscFunctionBegin; 830cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 8314a6cfa73SMatthew G. Knepley if (numGhostCells) PetscValidPointer(numGhostCells, 3); 832cd0c2139SMatthew G Knepley PetscValidPointer(dmGhosted, 4); 833cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr); 834cd0c2139SMatthew G Knepley ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr); 835c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 836c73cfb54SMatthew G. Knepley ierr = DMSetDimension(gdm, dim);CHKERRQ(ierr); 837a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseCone(dm, &flag);CHKERRQ(ierr); 838a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseCone(gdm, flag);CHKERRQ(ierr); 839a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseClosure(dm, &flag);CHKERRQ(ierr); 840a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseClosure(gdm, flag);CHKERRQ(ierr); 841c58f1c22SToby Isaac ierr = DMGetLabel(dm, name, &label);CHKERRQ(ierr); 842cd0c2139SMatthew G Knepley if (!label) { 843cd0c2139SMatthew G Knepley /* Get label for boundary faces */ 844c58f1c22SToby Isaac ierr = DMCreateLabel(dm, name);CHKERRQ(ierr); 845c58f1c22SToby Isaac ierr = DMGetLabel(dm, name, &label);CHKERRQ(ierr); 846cd0c2139SMatthew G Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 847cd0c2139SMatthew G Knepley } 848cd0c2139SMatthew G Knepley ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr); 849a6ba4734SToby Isaac ierr = DMCopyBoundary(dm, gdm);CHKERRQ(ierr); 850cd0c2139SMatthew G Knepley *dmGhosted = gdm; 851cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 852cd0c2139SMatthew G Knepley } 853cd0c2139SMatthew G Knepley 854607ab7a9SMatthew G. Knepley /* 855faedd622SMatthew G. Knepley We are adding three kinds of points here: 856607ab7a9SMatthew G. Knepley Replicated: Copies of points which exist in the mesh, such as vertices identified across a fault 857faedd622SMatthew G. Knepley Non-replicated: Points which exist on the fault, but are not replicated 858607ab7a9SMatthew G. Knepley Hybrid: Entirely new points, such as cohesive cells 859a6ae58d1SMatthew G. Knepley 860a6ae58d1SMatthew G. Knepley When creating subsequent cohesive cells, we shift the old hybrid cells to the end of the numbering at 861a6ae58d1SMatthew G. Knepley each depth so that the new split/hybrid points can be inserted as a block. 862607ab7a9SMatthew G. Knepley */ 863cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm) 864cd0c2139SMatthew G Knepley { 865cd0c2139SMatthew G Knepley MPI_Comm comm; 866607ab7a9SMatthew G. Knepley IS valueIS; 867607ab7a9SMatthew G. Knepley PetscInt numSP = 0; /* The number of depths for which we have replicated points */ 868607ab7a9SMatthew G. Knepley const PetscInt *values; /* List of depths for which we have replicated points */ 86918c5995bSMatthew G. Knepley IS *splitIS; 87018c5995bSMatthew G. Knepley IS *unsplitIS; 871607ab7a9SMatthew G. Knepley PetscInt *numSplitPoints; /* The number of replicated points at each depth */ 87218c5995bSMatthew G. Knepley PetscInt *numUnsplitPoints; /* The number of non-replicated points at each depth which still give rise to hybrid points */ 87336dbac82SMatthew G. Knepley PetscInt *numHybridPoints; /* The number of new hybrid points at each depth */ 87436dbac82SMatthew G. Knepley PetscInt *numHybridPointsOld; /* The number of existing hybrid points at each depth */ 875607ab7a9SMatthew G. Knepley const PetscInt **splitPoints; /* Replicated points for each depth */ 87618c5995bSMatthew G. Knepley const PetscInt **unsplitPoints; /* Non-replicated points for each depth */ 877cd0c2139SMatthew G Knepley PetscSection coordSection; 878cd0c2139SMatthew G Knepley Vec coordinates; 879cd0c2139SMatthew G Knepley PetscScalar *coords; 880a6ae58d1SMatthew G. Knepley PetscInt *depthMax; /* The first hybrid point at each depth in the original mesh */ 881a6ae58d1SMatthew G. Knepley PetscInt *depthEnd; /* The point limit at each depth in the original mesh */ 882607ab7a9SMatthew G. Knepley PetscInt *depthShift; /* Number of replicated+hybrid points at each depth */ 883607ab7a9SMatthew G. Knepley PetscInt *pMaxNew; /* The first replicated point at each depth in the new mesh, hybrids come after this */ 884607ab7a9SMatthew G. Knepley PetscInt *coneNew, *coneONew, *supportNew; 88518c5995bSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v; 886cd0c2139SMatthew G Knepley PetscErrorCode ierr; 887cd0c2139SMatthew G Knepley 888cd0c2139SMatthew G Knepley PetscFunctionBegin; 889cd0c2139SMatthew G Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 890c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 891607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 892fd4b9f15SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 893cd0c2139SMatthew G Knepley /* Count split points and add cohesive cells */ 894607ab7a9SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 8952582d50cSToby Isaac ierr = PetscMalloc5(depth+1,&depthMax,depth+1,&depthEnd,2*(depth+1),&depthShift,depth+1,&pMaxNew,depth+1,&numHybridPointsOld);CHKERRQ(ierr); 896dcca6d9dSJed 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); 897a6ae58d1SMatthew 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); 898607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 899607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 900a6ae58d1SMatthew G. Knepley depthEnd[d] = pMaxNew[d]; 901a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 902607ab7a9SMatthew G. Knepley numSplitPoints[d] = 0; 90318c5995bSMatthew G. Knepley numUnsplitPoints[d] = 0; 904607ab7a9SMatthew G. Knepley numHybridPoints[d] = 0; 905a6ae58d1SMatthew G. Knepley numHybridPointsOld[d] = depthMax[d] < 0 ? 0 : depthEnd[d] - depthMax[d]; 906607ab7a9SMatthew G. Knepley splitPoints[d] = NULL; 90718c5995bSMatthew G. Knepley unsplitPoints[d] = NULL; 90818c5995bSMatthew G. Knepley splitIS[d] = NULL; 90918c5995bSMatthew G. Knepley unsplitIS[d] = NULL; 91059eef20bSToby Isaac /* we are shifting the existing hybrid points with the stratum behind them, so 91159eef20bSToby Isaac * the split comes at the end of the normal points, i.e., at depthMax[d] */ 91259eef20bSToby Isaac depthShift[2*d] = depthMax[d]; 91359eef20bSToby Isaac depthShift[2*d+1] = 0; 914607ab7a9SMatthew G. Knepley } 915cd0c2139SMatthew G Knepley if (label) { 916cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 917cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 918cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 919cd0c2139SMatthew G Knepley } 920cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 921cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 922cd0c2139SMatthew G Knepley 923cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 92418c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr); 92518c5995bSMatthew G. Knepley if (splitIS[dep]) { 92618c5995bSMatthew G. Knepley ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 92718c5995bSMatthew G. Knepley ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 92818c5995bSMatthew G. Knepley } 92918c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr); 93018c5995bSMatthew G. Knepley if (unsplitIS[dep]) { 93118c5995bSMatthew G. Knepley ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr); 93218c5995bSMatthew G. Knepley ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr); 933cd0c2139SMatthew G Knepley } 934cd0c2139SMatthew G Knepley } 935607ab7a9SMatthew G. Knepley /* Calculate number of hybrid points */ 93618c5995bSMatthew 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 */ 9372582d50cSToby Isaac for (d = 0; d <= depth; ++d) depthShift[2*d+1] = numSplitPoints[d] + numHybridPoints[d]; 9383d3eaba7SBarry Smith ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift);CHKERRQ(ierr); 93959eef20bSToby Isaac /* the end of the points in this stratum that come before the new points: 94059eef20bSToby Isaac * shifting pMaxNew[d] gets the new start of the next stratum, then count back the old hybrid points and the newly 94159eef20bSToby Isaac * added points */ 9422582d50cSToby Isaac for (d = 0; d <= depth; ++d) pMaxNew[d] = DMPlexShiftPoint_Internal(pMaxNew[d],depth,depthShift) - (numHybridPointsOld[d] + numSplitPoints[d] + numHybridPoints[d]); 943cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 944cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 945cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 946cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 947cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 9482582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 9494c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 950cd0c2139SMatthew G Knepley const PetscInt *support; 9514c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, qf, qn, qp, e; 952cd0c2139SMatthew G Knepley 953cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 954cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 955cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 956cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 957cd0c2139SMatthew G Knepley if (dep == depth-1) { 9584c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 9594c367dbcSMatthew G. Knepley 960cd0c2139SMatthew G Knepley /* Add cohesive cells, they are prisms */ 9614c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr); 962cd0c2139SMatthew G Knepley } else if (dep == 0) { 9634c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 964cd0c2139SMatthew G Knepley 965cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 9664c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 967cd0c2139SMatthew G Knepley PetscInt val; 968cd0c2139SMatthew G Knepley 969cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 9704c367dbcSMatthew G. Knepley if (val == 1) ++qf; 9714c367dbcSMatthew G. Knepley if ((val == 1) || (val == (shift + 1))) ++qn; 9724c367dbcSMatthew G. Knepley if ((val == 1) || (val == -(shift + 1))) ++qp; 973cd0c2139SMatthew G Knepley } 9744c367dbcSMatthew G. Knepley /* Split old vertex: Edges into original vertex and new cohesive edge */ 9754c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 9764c367dbcSMatthew G. Knepley /* Split new vertex: Edges into split vertex and new cohesive edge */ 9774c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 9784c367dbcSMatthew G. Knepley /* Add hybrid edge */ 9794c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 9804c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 981cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 9824c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 9834c367dbcSMatthew G. Knepley 984cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 9854c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 986cd0c2139SMatthew G Knepley PetscInt val; 987cd0c2139SMatthew G Knepley 988cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 9894c367dbcSMatthew G. Knepley if (val == dim-1) ++qf; 9904c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 9914c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 992cd0c2139SMatthew G Knepley } 9934c367dbcSMatthew G. Knepley /* Split old edge: Faces into original edge and cohesive face (positive side?) */ 9944c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 9954c367dbcSMatthew G. Knepley /* Split new edge: Faces into split edge and cohesive face (negative side?) */ 9964c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 9974c367dbcSMatthew G. Knepley /* Add hybrid face */ 9984c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 9994c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 1000cd0c2139SMatthew G Knepley } 1001cd0c2139SMatthew G Knepley } 1002cd0c2139SMatthew G Knepley } 100318c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 100418c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 100518c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 10062582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 100718c5995bSMatthew G. Knepley const PetscInt *support; 1008da1dd7e4SMatthew G. Knepley PetscInt coneSize, supportSize, qf, e, s; 100918c5995bSMatthew G. Knepley 101018c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 101118c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 101239254ff6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 101318c5995bSMatthew G. Knepley if (dep == 0) { 101418c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 101518c5995bSMatthew G. Knepley 101639254ff6SMatthew G. Knepley /* Unsplit vertex: Edges into original vertex, split edges, and new cohesive edge twice */ 101739254ff6SMatthew G. Knepley for (s = 0, qf = 0; s < supportSize; ++s, ++qf) { 101839254ff6SMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 101939254ff6SMatthew G. Knepley if (e >= 0) ++qf; 102039254ff6SMatthew G. Knepley } 102139254ff6SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 102218c5995bSMatthew G. Knepley /* Add hybrid edge */ 102318c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 1024e1757548SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 1025e1757548SMatthew G. Knepley PetscInt val; 1026e1757548SMatthew G. Knepley 1027e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1028e1757548SMatthew G. Knepley /* Split and unsplit edges produce hybrid faces */ 1029da1dd7e4SMatthew G. Knepley if (val == 1) ++qf; 1030da1dd7e4SMatthew G. Knepley if (val == (shift2 + 1)) ++qf; 1031e1757548SMatthew G. Knepley } 1032e1757548SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 103318c5995bSMatthew G. Knepley } else if (dep == dim-2) { 103418c5995bSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 1035cd0c2139SMatthew G Knepley PetscInt val; 1036cd0c2139SMatthew G Knepley 1037da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 1038cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1039da1dd7e4SMatthew G. Knepley if (val == dim-1) qf += 2; 1040da1dd7e4SMatthew G. Knepley else ++qf; 1041cd0c2139SMatthew G Knepley } 104218c5995bSMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */ 1043da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 104418c5995bSMatthew G. Knepley /* Add hybrid face */ 1045da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 1046da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1047da1dd7e4SMatthew G. Knepley if (val == dim-1) ++qf; 1048da1dd7e4SMatthew G. Knepley } 104918c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 1050da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 1051cd0c2139SMatthew G Knepley } 1052cd0c2139SMatthew G Knepley } 1053cd0c2139SMatthew G Knepley } 1054cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 1055cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 1056cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1057dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 1058dcca6d9dSJed Brown ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),&supportNew);CHKERRQ(ierr); 1059cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 1060cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1061cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 1062cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 10632582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 10644c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 1065cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 10664c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, q, qf, qn, qp, v, e, s; 1067cd0c2139SMatthew G Knepley 1068cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 1069cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 1070cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 1071cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 1072cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 1073cd0c2139SMatthew G Knepley if (dep == depth-1) { 107496a07cd0SMatthew G. Knepley PetscBool hasUnsplit = PETSC_FALSE; 10754c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1076cd0c2139SMatthew G Knepley const PetscInt *supportF; 1077cd0c2139SMatthew G Knepley 1078cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 1079cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 1080cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 1081cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 1082cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 1083cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 10844c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 108518c5995bSMatthew G. Knepley if (v < 0) { 108618c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 108718c5995bSMatthew 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); 10882582d50cSToby Isaac coneNew[2+q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/; 108996a07cd0SMatthew G. Knepley hasUnsplit = PETSC_TRUE; 109018c5995bSMatthew G. Knepley } else { 10914c367dbcSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep-1]; 1092163235baSMatthew G. Knepley if (dep > 1) { 1093163235baSMatthew G. Knepley const PetscInt *econe; 1094163235baSMatthew G. Knepley PetscInt econeSize, r, vs, vu; 1095163235baSMatthew G. Knepley 1096163235baSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[q], &econeSize);CHKERRQ(ierr); 1097163235baSMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[q], &econe);CHKERRQ(ierr); 1098163235baSMatthew G. Knepley for (r = 0; r < econeSize; ++r) { 1099163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numSplitPoints[dep-2], splitPoints[dep-2], &vs);CHKERRQ(ierr); 1100163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numUnsplitPoints[dep-2], unsplitPoints[dep-2], &vu);CHKERRQ(ierr); 1101163235baSMatthew G. Knepley if (vs >= 0) continue; 1102163235baSMatthew 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); 1103163235baSMatthew G. Knepley hasUnsplit = PETSC_TRUE; 1104163235baSMatthew G. Knepley } 1105163235baSMatthew G. Knepley } 1106cd0c2139SMatthew G Knepley } 1107cd0c2139SMatthew G Knepley } 1108cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 1109cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 1110e537020bSMatthew G. Knepley /* Face support */ 1111cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1112cd0c2139SMatthew G Knepley PetscInt val; 1113cd0c2139SMatthew G Knepley 1114cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 1115cd0c2139SMatthew G Knepley if (val < 0) { 1116cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 11174c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr); 1118cd0c2139SMatthew G Knepley } else { 1119cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 11204c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr); 1121e537020bSMatthew G. Knepley /* Get orientation for cohesive face */ 1122e537020bSMatthew G. Knepley { 1123e537020bSMatthew G. Knepley const PetscInt *ncone, *nconeO; 1124e537020bSMatthew G. Knepley PetscInt nconeSize, nc; 1125e537020bSMatthew G. Knepley 1126e537020bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 1127e537020bSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 1128e537020bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 1129e537020bSMatthew G. Knepley for (nc = 0; nc < nconeSize; ++nc) { 1130e537020bSMatthew G. Knepley if (ncone[nc] == oldp) { 1131e537020bSMatthew G. Knepley coneONew[0] = nconeO[nc]; 1132e537020bSMatthew G. Knepley break; 1133cd0c2139SMatthew G Knepley } 1134cd0c2139SMatthew G Knepley } 1135e537020bSMatthew 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]); 1136e537020bSMatthew G. Knepley } 1137e537020bSMatthew G. Knepley } 1138e537020bSMatthew G. Knepley } 11394c367dbcSMatthew G. Knepley /* Cohesive cell: Old and new split face, then new cohesive faces */ 1140fd4b9f15SMatthew G. Knepley coneNew[0] = newp; /* Extracted negative side orientation above */ 11414c367dbcSMatthew G. Knepley coneNew[1] = splitp; 11424c367dbcSMatthew G. Knepley coneONew[1] = coneONew[0]; 1143e537020bSMatthew G. Knepley for (q = 0; q < coneSize; ++q) { 114418c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 114518c5995bSMatthew G. Knepley if (v < 0) { 114618c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 114718c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 114818c5995bSMatthew G. Knepley coneONew[2+q] = 0; 114918c5995bSMatthew G. Knepley } else { 115018c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep]; 115118c5995bSMatthew G. Knepley } 1152e537020bSMatthew G. Knepley coneONew[2+q] = 0; 1153e537020bSMatthew G. Knepley } 11544c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr); 11554c367dbcSMatthew G. Knepley ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr); 115696a07cd0SMatthew G. Knepley /* Label the hybrid cells on the boundary of the split */ 115796a07cd0SMatthew G. Knepley if (hasUnsplit) {ierr = DMLabelSetValue(label, -hybcell, dim);CHKERRQ(ierr);} 1158cd0c2139SMatthew G Knepley } else if (dep == 0) { 11594c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1160cd0c2139SMatthew G Knepley 1161cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 11624c367dbcSMatthew G. Knepley for (e = 0, qn = 0; e < supportSize; ++e) { 1163cd0c2139SMatthew G Knepley PetscInt val; 1164cd0c2139SMatthew G Knepley 1165cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1166cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 11672582d50cSToby Isaac supportNew[qn++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1168cd0c2139SMatthew G Knepley } 1169cd0c2139SMatthew G Knepley } 11704c367dbcSMatthew G. Knepley supportNew[qn] = hybedge; 1171cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1172cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 11734c367dbcSMatthew G. Knepley for (e = 0, qp = 0; e < supportSize; ++e) { 1174cd0c2139SMatthew G Knepley PetscInt val, edge; 1175cd0c2139SMatthew G Knepley 1176cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1177cd0c2139SMatthew G Knepley if (val == 1) { 11784c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 1179cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 11804c367dbcSMatthew G. Knepley supportNew[qp++] = edge + pMaxNew[dep+1]; 1181cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 11822582d50cSToby Isaac supportNew[qp++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1183cd0c2139SMatthew G Knepley } 1184cd0c2139SMatthew G Knepley } 11854c367dbcSMatthew G. Knepley supportNew[qp] = hybedge; 1186cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 11874c367dbcSMatthew G. Knepley /* Hybrid edge: Old and new split vertex */ 1188cd0c2139SMatthew G Knepley coneNew[0] = newp; 1189cd0c2139SMatthew G Knepley coneNew[1] = splitp; 11904c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 11914c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 11924c367dbcSMatthew G. Knepley PetscInt val, edge; 11934c367dbcSMatthew G. Knepley 11944c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 11954c367dbcSMatthew G. Knepley if (val == 1) { 11964c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 11974c367dbcSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 11984c367dbcSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 11994c367dbcSMatthew G. Knepley } 12004c367dbcSMatthew G. Knepley } 12014c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1202cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 12034c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 12044c367dbcSMatthew G. Knepley 1205cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 1206cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 1207cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 12084c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 1209e1757548SMatthew G. Knepley if (v < 0) { 1210e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1211e1757548SMatthew 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); 12122582d50cSToby Isaac coneNew[q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/; 1213e1757548SMatthew G. Knepley } else { 12144c367dbcSMatthew G. Knepley coneNew[q] = v + pMaxNew[dep-1]; 1215cd0c2139SMatthew G Knepley } 1216e1757548SMatthew G. Knepley } 1217cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 1218cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 1219cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 1220cd0c2139SMatthew G Knepley PetscInt val; 1221cd0c2139SMatthew G Knepley 1222cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 12234c367dbcSMatthew G. Knepley if (val == dim-1) { 12242582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 12254c367dbcSMatthew G. Knepley } else if (val == (shift + dim-1)) { 12262582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1227cd0c2139SMatthew G Knepley } 1228cd0c2139SMatthew G Knepley } 1229b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1230cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1231cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 1232cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 1233cd0c2139SMatthew G Knepley PetscInt val, face; 1234cd0c2139SMatthew G Knepley 1235cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1236cd0c2139SMatthew G Knepley if (val == dim-1) { 12374c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1238cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 12394c367dbcSMatthew G. Knepley supportNew[q++] = face + pMaxNew[dep+1]; 1240cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 12412582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1242cd0c2139SMatthew G Knepley } 1243cd0c2139SMatthew G Knepley } 1244b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1245cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 12464c367dbcSMatthew G. Knepley /* Hybrid face */ 12474c367dbcSMatthew G. Knepley coneNew[0] = newp; 12484c367dbcSMatthew G. Knepley coneNew[1] = splitp; 12494c367dbcSMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 12504c367dbcSMatthew G. Knepley PetscInt vertex; 12514c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr); 1252e1757548SMatthew G. Knepley if (vertex < 0) { 1253e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr); 1254e1757548SMatthew 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); 1255e1757548SMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1256e1757548SMatthew G. Knepley } else { 12574c367dbcSMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep]; 12584c367dbcSMatthew G. Knepley } 1259e1757548SMatthew G. Knepley } 12604c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 12614c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 12624c367dbcSMatthew G. Knepley PetscInt val, face; 12634c367dbcSMatthew G. Knepley 12644c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 12654c367dbcSMatthew G. Knepley if (val == dim-1) { 12664c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 12674c367dbcSMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 12684c367dbcSMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 12694c367dbcSMatthew G. Knepley } 12704c367dbcSMatthew G. Knepley } 12714c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1272cd0c2139SMatthew G Knepley } 1273cd0c2139SMatthew G Knepley } 1274cd0c2139SMatthew G Knepley } 127518c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 127618c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 127718c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 12782582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 127918c5995bSMatthew G. Knepley const PetscInt *cone, *support, *ornt; 1280e1757548SMatthew G. Knepley PetscInt coneSize, supportSize, supportSizeNew, q, qf, e, f, s; 128118c5995bSMatthew G. Knepley 128218c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 128318c5995bSMatthew G. Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 128418c5995bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 128518c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 128618c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 128718c5995bSMatthew G. Knepley if (dep == 0) { 128818c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 128918c5995bSMatthew G. Knepley 129018c5995bSMatthew G. Knepley /* Unsplit vertex */ 129118c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 129218c5995bSMatthew G. Knepley for (s = 0, q = 0; s < supportSize; ++s) { 12932582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[s], depth, depthShift) /*support[s] + depthOffset[dep+1]*/; 129418c5995bSMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 129518c5995bSMatthew G. Knepley if (e >= 0) { 129618c5995bSMatthew G. Knepley supportNew[q++] = e + pMaxNew[dep+1]; 129718c5995bSMatthew G. Knepley } 129818c5995bSMatthew G. Knepley } 129918c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 130018c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 130118c5995bSMatthew G. Knepley if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp); 130218c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 130318c5995bSMatthew G. Knepley /* Hybrid edge */ 130418c5995bSMatthew G. Knepley coneNew[0] = newp; 130518c5995bSMatthew G. Knepley coneNew[1] = newp; 130618c5995bSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 130718c5995bSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 130818c5995bSMatthew G. Knepley PetscInt val, edge; 130918c5995bSMatthew G. Knepley 131018c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 131118c5995bSMatthew G. Knepley if (val == 1) { 131218c5995bSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 131318c5995bSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 131418c5995bSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1315e1757548SMatthew G. Knepley } else if (val == (shift2 + 1)) { 1316e1757548SMatthew G. Knepley ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr); 1317e1757548SMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]); 1318e1757548SMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1]; 131918c5995bSMatthew G. Knepley } 132018c5995bSMatthew G. Knepley } 132118c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1322e1757548SMatthew G. Knepley } else if (dep == dim-2) { 1323e1757548SMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 1324e1757548SMatthew G. Knepley 1325da1dd7e4SMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and hybrid face twice */ 1326e1757548SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1327e1757548SMatthew G. Knepley PetscInt val, face; 1328e1757548SMatthew G. Knepley 1329e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1330e1757548SMatthew G. Knepley if (val == dim-1) { 1331e1757548SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1332e1757548SMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]); 13332582d50cSToby Isaac supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/; 1334e1757548SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+1]; 1335e1757548SMatthew G. Knepley } else { 13362582d50cSToby Isaac supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/; 1337e1757548SMatthew G. Knepley } 1338e1757548SMatthew G. Knepley } 1339e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1340e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1341da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 1342da1dd7e4SMatthew 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); 1343e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1344e1757548SMatthew G. Knepley /* Add hybrid face */ 1345e1757548SMatthew G. Knepley coneNew[0] = newp; 1346212cc919SMatthew G. Knepley coneNew[1] = newp; 1347e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[0], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1348e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[0]); 1349212cc919SMatthew G. Knepley coneNew[2] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1350e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1351e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]); 1352e1757548SMatthew G. Knepley coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1353e1757548SMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 1354da1dd7e4SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1355da1dd7e4SMatthew G. Knepley PetscInt val, face; 1356da1dd7e4SMatthew G. Knepley 1357da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1358da1dd7e4SMatthew G. Knepley if (val == dim-1) { 1359da1dd7e4SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1360da1dd7e4SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1361da1dd7e4SMatthew G. Knepley } 1362da1dd7e4SMatthew G. Knepley } 1363da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, hybface, &supportSizeNew);CHKERRQ(ierr); 1364da1dd7e4SMatthew 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); 1365e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1366cd0c2139SMatthew G Knepley } 1367cd0c2139SMatthew G Knepley } 1368cd0c2139SMatthew G Knepley } 1369cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 1370cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1371cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 1372cd0c2139SMatthew G Knepley IS pIS; 1373cd0c2139SMatthew G Knepley PetscInt numPoints; 1374cd0c2139SMatthew G Knepley const PetscInt *points; 1375cd0c2139SMatthew G Knepley 1376cd0c2139SMatthew G Knepley if (dep >= 0) continue; 1377cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 1378cd0c2139SMatthew G Knepley if (!pIS) continue; 1379cd0c2139SMatthew G Knepley dep = -dep - shift; 1380cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 1381cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 1382cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1383cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 13842582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*depthOffset[dep] + oldp*/; 1385cd0c2139SMatthew G Knepley const PetscInt *cone; 1386cd0c2139SMatthew G Knepley PetscInt coneSize, c; 138750cf782dSMatthew G. Knepley /* PetscBool replaced = PETSC_FALSE; */ 1388cd0c2139SMatthew G Knepley 1389cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 1390cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 1391cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 1392cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 1393cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1394e38fbfedSToby Isaac const PetscInt coldp = DMPlexShiftPointInverse_Internal(cone[c],depth,depthShift); 1395cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 1396cd0c2139SMatthew G Knepley 1397cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 1398cd0c2139SMatthew G Knepley if (val == dep-1) { 1399cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 1400cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 1401cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 1402cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 140350cf782dSMatthew G. Knepley /* replaced = PETSC_TRUE; */ 1404cd0c2139SMatthew G Knepley } 1405cd0c2139SMatthew G Knepley } 14064a189a86SMatthew G. Knepley /* Cells with only a vertex or edge on the submesh have no replacement */ 14074a189a86SMatthew G. Knepley /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 1408cd0c2139SMatthew G Knepley } 1409cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 1410cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 1411cd0c2139SMatthew G Knepley } 1412*fa8e8ae5SToby Isaac /* Step 7: Coordinates */ 1413cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 141469d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 1415cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 1416cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 1417cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 14182582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[0][v], depth, depthShift) /*depthOffset[0] + splitPoints[0][v]*/; 1419cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 1420cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 1421cd0c2139SMatthew G Knepley 1422cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 1423cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 1424cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 1425cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 1426cd0c2139SMatthew G Knepley } 1427cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 1428*fa8e8ae5SToby Isaac /* Step 8: SF, if I can figure this out we can split the mesh in parallel */ 1429cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1430*fa8e8ae5SToby Isaac /* Step 9: Labels */ 1431cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1432c58f1c22SToby Isaac ierr = DMGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 1433cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1434cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 14352582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[dep][p], depth, depthShift) /*depthOffset[dep] + splitPoints[dep][p]*/; 1436cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 1437cd0c2139SMatthew G Knepley PetscInt l; 1438cd0c2139SMatthew G Knepley 1439cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 1440cd0c2139SMatthew G Knepley DMLabel mlabel; 1441cd0c2139SMatthew G Knepley const char *lname; 1442cd0c2139SMatthew G Knepley PetscInt val; 14439a356370SMatthew G. Knepley PetscBool isDepth; 1444cd0c2139SMatthew G Knepley 1445c58f1c22SToby Isaac ierr = DMGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 14469a356370SMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 14479a356370SMatthew G. Knepley if (isDepth) continue; 1448c58f1c22SToby Isaac ierr = DMGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 1449cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 1450cd0c2139SMatthew G Knepley if (val >= 0) { 1451cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 1452cd0c2139SMatthew G Knepley } 1453cd0c2139SMatthew G Knepley } 1454cd0c2139SMatthew G Knepley } 1455cd0c2139SMatthew G Knepley } 1456cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1457cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 1458cd0c2139SMatthew G Knepley 1459cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 146018c5995bSMatthew G. Knepley if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 146118c5995bSMatthew G. Knepley ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr); 146218c5995bSMatthew G. Knepley if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);} 146318c5995bSMatthew G. Knepley ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr); 1464cd0c2139SMatthew G Knepley } 1465cd0c2139SMatthew G Knepley if (label) { 1466cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1467cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1468cd0c2139SMatthew G Knepley } 14690d4d4d06SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 14700d4d4d06SMatthew G. Knepley ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr); 147136dbac82SMatthew G. Knepley pMaxNew[d] = pEnd - numHybridPoints[d] - numHybridPointsOld[d]; 14720d4d4d06SMatthew G. Knepley } 14730e49e2e2SMatthew 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); 1474dcbb62e8SMatthew G. Knepley ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr); 14752582d50cSToby Isaac ierr = PetscFree5(depthMax, depthEnd, depthShift, pMaxNew, numHybridPointsOld);CHKERRQ(ierr); 147618c5995bSMatthew G. Knepley ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr); 1477cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1478cd0c2139SMatthew G Knepley } 1479cd0c2139SMatthew G Knepley 1480cd0c2139SMatthew G Knepley /*@C 1481cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 1482cd0c2139SMatthew G Knepley 1483cd0c2139SMatthew G Knepley Collective on dm 1484cd0c2139SMatthew G Knepley 1485cd0c2139SMatthew G Knepley Input Parameters: 1486cd0c2139SMatthew G Knepley + dm - The original DM 148753156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated) 1488cd0c2139SMatthew G Knepley 1489cd0c2139SMatthew G Knepley Output Parameters: 1490cd0c2139SMatthew G Knepley - dmSplit - The new DM 1491cd0c2139SMatthew G Knepley 1492cd0c2139SMatthew G Knepley Level: developer 1493cd0c2139SMatthew G Knepley 14942be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 1495cd0c2139SMatthew G Knepley @*/ 1496cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 1497cd0c2139SMatthew G Knepley { 1498cd0c2139SMatthew G Knepley DM sdm; 1499cd0c2139SMatthew G Knepley PetscInt dim; 1500cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1501cd0c2139SMatthew G Knepley 1502cd0c2139SMatthew G Knepley PetscFunctionBegin; 1503cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 150453156dfcSMatthew G. Knepley PetscValidPointer(dmSplit, 3); 1505cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 1506cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 1507c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1508c73cfb54SMatthew G. Knepley ierr = DMSetDimension(sdm, dim);CHKERRQ(ierr); 1509cd0c2139SMatthew G Knepley switch (dim) { 1510cd0c2139SMatthew G Knepley case 2: 1511cd0c2139SMatthew G Knepley case 3: 1512cd0c2139SMatthew G Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 1513cd0c2139SMatthew G Knepley break; 1514cd0c2139SMatthew G Knepley default: 1515cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 1516cd0c2139SMatthew G Knepley } 1517cd0c2139SMatthew G Knepley *dmSplit = sdm; 1518cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1519cd0c2139SMatthew G Knepley } 1520cd0c2139SMatthew G Knepley 15210f66a230SMatthew G. Knepley /* Returns the side of the surface for a given cell with a face on the surface */ 15220f66a230SMatthew G. Knepley static PetscErrorCode GetSurfaceSide_Static(DM dm, DM subdm, PetscInt numSubpoints, const PetscInt *subpoints, PetscInt cell, PetscInt face, PetscBool *pos) 15230f66a230SMatthew G. Knepley { 15240f66a230SMatthew G. Knepley const PetscInt *cone, *ornt; 15250f66a230SMatthew G. Knepley PetscInt dim, coneSize, c; 15260f66a230SMatthew G. Knepley PetscErrorCode ierr; 15270f66a230SMatthew G. Knepley 15280f66a230SMatthew G. Knepley PetscFunctionBegin; 15290f66a230SMatthew G. Knepley *pos = PETSC_TRUE; 1530c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 15310f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 15320f66a230SMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 15330f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, cell, &ornt);CHKERRQ(ierr); 15340f66a230SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 15350f66a230SMatthew G. Knepley if (cone[c] == face) { 15360f66a230SMatthew G. Knepley PetscInt o = ornt[c]; 15370f66a230SMatthew G. Knepley 15380f66a230SMatthew G. Knepley if (subdm) { 15390f66a230SMatthew G. Knepley const PetscInt *subcone, *subornt; 15400f66a230SMatthew G. Knepley PetscInt subpoint, subface, subconeSize, sc; 15410f66a230SMatthew G. Knepley 15420f66a230SMatthew G. Knepley ierr = PetscFindInt(cell, numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 15430f66a230SMatthew G. Knepley ierr = PetscFindInt(face, numSubpoints, subpoints, &subface);CHKERRQ(ierr); 15440f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 15450f66a230SMatthew G. Knepley ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 15460f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 15470f66a230SMatthew G. Knepley for (sc = 0; sc < subconeSize; ++sc) { 15480f66a230SMatthew G. Knepley if (subcone[sc] == subface) { 15490f66a230SMatthew G. Knepley o = subornt[0]; 15500f66a230SMatthew G. Knepley break; 15510f66a230SMatthew G. Knepley } 15520f66a230SMatthew G. Knepley } 15530f66a230SMatthew G. Knepley if (sc >= subconeSize) SETERRQ4(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find subpoint %d (%d) in cone for subpoint %d (%d)", subface, face, subpoint, cell); 15540f66a230SMatthew G. Knepley } 15550f66a230SMatthew G. Knepley if (o >= 0) *pos = PETSC_TRUE; 15560f66a230SMatthew G. Knepley else *pos = PETSC_FALSE; 15570f66a230SMatthew G. Knepley break; 15580f66a230SMatthew G. Knepley } 15590f66a230SMatthew G. Knepley } 15600f66a230SMatthew G. Knepley if (c == coneSize) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Cell %d in split face %d support does not have it in the cone", cell, face); 15610f66a230SMatthew G. Knepley PetscFunctionReturn(0); 15620f66a230SMatthew G. Knepley } 15630f66a230SMatthew G. Knepley 1564cd0c2139SMatthew G Knepley /*@ 15650f66a230SMatthew G. Knepley DMPlexLabelCohesiveComplete - Starting with a label marking points on an internal surface, we add all other mesh pieces 1566cd0c2139SMatthew G Knepley to complete the surface 1567cd0c2139SMatthew G Knepley 1568cd0c2139SMatthew G Knepley Input Parameters: 1569cd0c2139SMatthew G Knepley + dm - The DM 15700f66a230SMatthew G. Knepley . label - A DMLabel marking the surface 15710f66a230SMatthew G. Knepley . blabel - A DMLabel marking the vertices on the boundary which will not be duplicated, or NULL to find them automatically 1572bb55d314SMatthew G. Knepley . flip - Flag to flip the submesh normal and replace points on the other side 157347946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL 1574cd0c2139SMatthew G Knepley 1575cd0c2139SMatthew G Knepley Output Parameter: 1576cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 1577cd0c2139SMatthew G Knepley 15780f66a230SMatthew G. Knepley Note: The vertices in blabel are called "unsplit" in the terminology from hybrid cell creation. 15790f66a230SMatthew G. Knepley 1580cd0c2139SMatthew G Knepley Level: developer 1581cd0c2139SMatthew G Knepley 15822be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 1583cd0c2139SMatthew G Knepley @*/ 15840f66a230SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, DMLabel blabel, PetscBool flip, DM subdm) 1585cd0c2139SMatthew G Knepley { 1586d90583fdSMatthew G. Knepley DMLabel depthLabel; 15878630cb1aSMatthew G. Knepley IS dimIS, subpointIS = NULL, facePosIS, faceNegIS, crossEdgeIS = NULL; 158847946fd8SMatthew G. Knepley const PetscInt *points, *subpoints; 1589bb55d314SMatthew G. Knepley const PetscInt rev = flip ? -1 : 1; 1590370472baSMatthew G. Knepley PetscInt *pMax; 1591370472baSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, dim, depth, pSize, dep, cStart, cEnd, cMax, fStart, fEnd, vStart, vEnd, numPoints, numSubpoints, p, val; 1592cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1593cd0c2139SMatthew G Knepley 1594cd0c2139SMatthew G Knepley PetscFunctionBegin; 1595370472baSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1596370472baSMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1597370472baSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1598370472baSMatthew G. Knepley ierr = PetscMalloc1(pSize,&pMax);CHKERRQ(ierr); 1599370472baSMatthew 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); 1600d90583fdSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 1601c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 160247946fd8SMatthew G. Knepley if (subdm) { 160347946fd8SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 160447946fd8SMatthew G. Knepley if (subpointIS) { 160547946fd8SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 160647946fd8SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 160747946fd8SMatthew G. Knepley } 160847946fd8SMatthew G. Knepley } 1609d7c8f101SMatthew G. Knepley /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */ 1610cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 1611dc86033cSMatthew G. Knepley if (!dimIS) { 1612dc86033cSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 16138630cb1aSMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 1614dc86033cSMatthew G. Knepley PetscFunctionReturn(0); 1615dc86033cSMatthew G. Knepley } 1616cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1617cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1618d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */ 1619cd0c2139SMatthew G Knepley const PetscInt *support; 1620cd0c2139SMatthew G Knepley PetscInt supportSize, s; 1621cd0c2139SMatthew G Knepley 1622cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1623cd0c2139SMatthew G Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 1624cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1625cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 16260f66a230SMatthew G. Knepley const PetscInt *cone; 1627cd0c2139SMatthew G Knepley PetscInt coneSize, c; 16280f66a230SMatthew G. Knepley PetscBool pos; 1629cd0c2139SMatthew G Knepley 16300f66a230SMatthew G. Knepley ierr = GetSurfaceSide_Static(dm, subdm, numSubpoints, subpoints, support[s], points[p], &pos);CHKERRQ(ierr); 16310f66a230SMatthew G. Knepley if (pos) {ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr);} 16320f66a230SMatthew G. Knepley else {ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);} 16330f66a230SMatthew G. Knepley if (rev < 0) pos = !pos ? PETSC_TRUE : PETSC_FALSE; 16340f66a230SMatthew G. Knepley /* Put faces touching the fault in the label */ 1635cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1636cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1637cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1638cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 1639cd0c2139SMatthew G Knepley 1640cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1641cd0c2139SMatthew G Knepley if (val == -1) { 1642cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 1643cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 1644cd0c2139SMatthew G Knepley 1645cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1646cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1647cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 1648a0541d8aSMatthew G. Knepley PetscInt bval = -1; 1649cd0c2139SMatthew G Knepley 1650cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1651a0541d8aSMatthew G. Knepley if (blabel) {ierr = DMLabelGetValue(blabel, clp, &bval);CHKERRQ(ierr);} 1652a0541d8aSMatthew G. Knepley if ((val >= 0) && (val < dim-1) && (bval < 0)) { 1653cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1654cd0c2139SMatthew G Knepley break; 1655cd0c2139SMatthew G Knepley } 1656cd0c2139SMatthew G Knepley } 1657cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1658cd0c2139SMatthew G Knepley } 1659cd0c2139SMatthew G Knepley } 1660cd0c2139SMatthew G Knepley } 1661cd0c2139SMatthew G Knepley } 16620f66a230SMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 16630f66a230SMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 166447946fd8SMatthew G. Knepley if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 166547946fd8SMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 1666a0541d8aSMatthew G. Knepley /* Mark boundary points as unsplit */ 166786200784SMatthew G. Knepley if (blabel) { 1668a0541d8aSMatthew G. Knepley ierr = DMLabelGetStratumIS(blabel, 1, &dimIS);CHKERRQ(ierr); 1669a0541d8aSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1670a0541d8aSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1671a0541d8aSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1672a0541d8aSMatthew G. Knepley const PetscInt point = points[p]; 1673a0541d8aSMatthew G. Knepley PetscInt val, bval; 1674a0541d8aSMatthew G. Knepley 1675a0541d8aSMatthew G. Knepley ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr); 1676a0541d8aSMatthew G. Knepley if (bval >= 0) { 1677f7019248SMatthew G. Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1678f7019248SMatthew G. Knepley if ((val < 0) || (val > dim)) { 1679f7019248SMatthew G. Knepley /* This could be a point added from splitting a vertex on an adjacent fault, otherwise its just wrong */ 1680f7019248SMatthew G. Knepley ierr = DMLabelClearValue(blabel, point, bval);CHKERRQ(ierr); 1681f7019248SMatthew G. Knepley } 1682f7019248SMatthew G. Knepley } 1683f7019248SMatthew G. Knepley } 1684f7019248SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1685f7019248SMatthew G. Knepley const PetscInt point = points[p]; 1686f7019248SMatthew G. Knepley PetscInt val, bval; 1687f7019248SMatthew G. Knepley 1688f7019248SMatthew G. Knepley ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr); 1689f7019248SMatthew G. Knepley if (bval >= 0) { 169086200784SMatthew G. Knepley const PetscInt *cone, *support; 169186200784SMatthew G. Knepley PetscInt coneSize, supportSize, s, valA, valB, valE; 169286200784SMatthew G. Knepley 1693a0541d8aSMatthew G. Knepley /* Mark as unsplit */ 1694a0541d8aSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1695a0541d8aSMatthew 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); 1696a0541d8aSMatthew G. Knepley ierr = DMLabelClearValue(label, point, val);CHKERRQ(ierr); 1697a0541d8aSMatthew G. Knepley ierr = DMLabelSetValue(label, point, shift2+val);CHKERRQ(ierr); 16982c06a818SMatthew G. Knepley /* Check for cross-edge 16992c06a818SMatthew G. Knepley A cross-edge has endpoints which are both on the boundary of the surface, but the edge itself is not. */ 170086200784SMatthew G. Knepley if (val != 0) continue; 170186200784SMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 170286200784SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 170386200784SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 170486200784SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 170586200784SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 170686200784SMatthew G. Knepley if (coneSize != 2) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Edge %D has %D vertices != 2", support[s], coneSize); 170786200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, cone[0], &valA);CHKERRQ(ierr); 170886200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, cone[1], &valB);CHKERRQ(ierr); 170986200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, support[s], &valE);CHKERRQ(ierr); 171009816f77SMatthew G. Knepley if ((valE < 0) && (valA >= 0) && (valB >= 0) && (cone[0] != cone[1])) {ierr = DMLabelSetValue(blabel, support[s], 2);CHKERRQ(ierr);} 171186200784SMatthew G. Knepley } 1712a0541d8aSMatthew G. Knepley } 1713a0541d8aSMatthew G. Knepley } 1714a0541d8aSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1715a0541d8aSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1716a0541d8aSMatthew G. Knepley } 1717cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1718c4d480a2SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 1719cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1720d24f5ce5SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1721d24f5ce5SMatthew G. Knepley cMax = cMax < 0 ? cEnd : cMax; 17220f66a230SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 1723cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 172486200784SMatthew G. Knepley if (blabel) {ierr = DMLabelGetStratumIS(blabel, 2, &crossEdgeIS);CHKERRQ(ierr);} 172586200784SMatthew G. Knepley if (dimIS && crossEdgeIS) { 172686200784SMatthew G. Knepley IS vertIS = dimIS; 172786200784SMatthew G. Knepley 172886200784SMatthew G. Knepley ierr = ISExpand(vertIS, crossEdgeIS, &dimIS);CHKERRQ(ierr); 172986200784SMatthew G. Knepley ierr = ISDestroy(&crossEdgeIS);CHKERRQ(ierr); 173086200784SMatthew G. Knepley ierr = ISDestroy(&vertIS);CHKERRQ(ierr); 173186200784SMatthew G. Knepley } 1732dc86033cSMatthew G. Knepley if (!dimIS) { 1733dc86033cSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1734dc86033cSMatthew G. Knepley PetscFunctionReturn(0); 1735dc86033cSMatthew G. Knepley } 1736cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1737cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1738d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */ 1739cd0c2139SMatthew G Knepley PetscInt *star = NULL; 174086200784SMatthew G. Knepley PetscInt starSize, s; 1741cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1742cd0c2139SMatthew G Knepley 1743d4622b2cSMatthew G. Knepley /* All points connected to the fault are inside a cell, so at the top level we will only check cells */ 1744cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1745cd0c2139SMatthew G Knepley while (again) { 1746cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1747cd0c2139SMatthew G Knepley again = 0; 1748cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1749cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1750cd0c2139SMatthew G Knepley const PetscInt *cone; 1751cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1752cd0c2139SMatthew G Knepley 1753d24f5ce5SMatthew G. Knepley if ((point < cStart) || (point >= cMax)) continue; 1754cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1755cd0c2139SMatthew G Knepley if (val != -1) continue; 1756d4622b2cSMatthew G. Knepley again = again == 1 ? 1 : 2; 1757cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1758cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1759cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1760cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1761cd0c2139SMatthew G Knepley if (val != -1) { 1762d7c8f101SMatthew G. Knepley const PetscInt *ccone; 1763166d9d0cSMatthew G. Knepley PetscInt cconeSize, cc, side; 1764d7c8f101SMatthew G. Knepley 1765db8edaafSMatthew 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); 176637a6de01SMatthew G. Knepley if (val > 0) side = 1; 176737a6de01SMatthew G. Knepley else side = -1; 176837a6de01SMatthew G. Knepley ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr); 1769d7c8f101SMatthew G. Knepley /* Mark cell faces which touch the fault */ 1770d7c8f101SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr); 1771d7c8f101SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr); 1772d7c8f101SMatthew G. Knepley for (cc = 0; cc < cconeSize; ++cc) { 1773d7c8f101SMatthew G. Knepley PetscInt *closure = NULL; 1774d7c8f101SMatthew G. Knepley PetscInt closureSize, cl; 1775d7c8f101SMatthew G. Knepley 1776166d9d0cSMatthew G. Knepley ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr); 1777166d9d0cSMatthew G. Knepley if (val != -1) continue; 1778d7c8f101SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1779d4622b2cSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1780d7c8f101SMatthew G. Knepley const PetscInt clp = closure[cl]; 1781d7c8f101SMatthew G. Knepley 1782d7c8f101SMatthew G. Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1783d7c8f101SMatthew G. Knepley if (val == -1) continue; 1784d7c8f101SMatthew G. Knepley ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr); 178537a6de01SMatthew G. Knepley break; 178637a6de01SMatthew G. Knepley } 1787d7c8f101SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1788cd0c2139SMatthew G Knepley } 1789cd0c2139SMatthew G Knepley again = 1; 1790cd0c2139SMatthew G Knepley break; 1791cd0c2139SMatthew G Knepley } 1792cd0c2139SMatthew G Knepley } 1793cd0c2139SMatthew G Knepley } 1794cd0c2139SMatthew G Knepley } 1795cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1796cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1797cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1798cd0c2139SMatthew G Knepley 1799cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1800cd0c2139SMatthew G Knepley if (val == -1) { 1801cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1802cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1803cd0c2139SMatthew G Knepley PetscBool marked = PETSC_FALSE; 1804cd0c2139SMatthew G Knepley 1805cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1806cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1807cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1808cd0c2139SMatthew G Knepley 1809d24f5ce5SMatthew G. Knepley if ((spoint < cStart) || (spoint >= cMax)) continue; 1810cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1811cd0c2139SMatthew 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); 1812d90583fdSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1813cd0c2139SMatthew G Knepley if (val > 0) { 1814cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1815cd0c2139SMatthew G Knepley } else { 1816cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1817cd0c2139SMatthew G Knepley } 1818cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1819cd0c2139SMatthew G Knepley break; 1820cd0c2139SMatthew G Knepley } 1821cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1822370472baSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1823370472baSMatthew G. Knepley if (point < pMax[dep] && !marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1824cd0c2139SMatthew G Knepley } 1825cd0c2139SMatthew G Knepley } 1826cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1827cd0c2139SMatthew G Knepley } 1828cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1829cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 183018c5995bSMatthew G. Knepley /* If any faces touching the fault divide cells on either side, split them */ 183118c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift+dim-1, &facePosIS);CHKERRQ(ierr); 183218c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr); 183318c5995bSMatthew G. Knepley ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr); 183418c5995bSMatthew G. Knepley ierr = ISDestroy(&facePosIS);CHKERRQ(ierr); 183518c5995bSMatthew G. Knepley ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr); 183618c5995bSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 183718c5995bSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 183818c5995bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 183918c5995bSMatthew G. Knepley const PetscInt point = points[p]; 184018c5995bSMatthew G. Knepley const PetscInt *support; 184118c5995bSMatthew G. Knepley PetscInt supportSize, valA, valB; 184218c5995bSMatthew G. Knepley 184318c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 184418c5995bSMatthew G. Knepley if (supportSize != 2) continue; 184518c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 184618c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr); 184718c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr); 184818c5995bSMatthew G. Knepley if ((valA == -1) || (valB == -1)) continue; 184918c5995bSMatthew G. Knepley if (valA*valB > 0) continue; 185018c5995bSMatthew G. Knepley /* Split the face */ 185118c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr); 185218c5995bSMatthew G. Knepley ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr); 185318c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr); 1854e1757548SMatthew G. Knepley /* Label its closure: 1855e1757548SMatthew G. Knepley unmarked: label as unsplit 1856e1757548SMatthew G. Knepley incident: relabel as split 1857e1757548SMatthew G. Knepley split: do nothing 1858e1757548SMatthew G. Knepley */ 185918c5995bSMatthew G. Knepley { 186018c5995bSMatthew G. Knepley PetscInt *closure = NULL; 186118c5995bSMatthew G. Knepley PetscInt closureSize, cl; 186218c5995bSMatthew G. Knepley 186318c5995bSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 186418c5995bSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 186518c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr); 18668771c1d3SMatthew G. Knepley if (valA == -1) { /* Mark as unsplit */ 186718c5995bSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 186818c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr); 18698771c1d3SMatthew G. Knepley } else if (((valA >= shift) && (valA < shift2)) || ((valA <= -shift) && (valA > -shift2))) { 1870e1757548SMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 1871e1757548SMatthew G. Knepley ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr); 1872e1757548SMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr); 1873e1757548SMatthew G. Knepley } 187418c5995bSMatthew G. Knepley } 187518c5995bSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 187618c5995bSMatthew G. Knepley } 187718c5995bSMatthew G. Knepley } 187818c5995bSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 187918c5995bSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1880370472baSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1881cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1882cd0c2139SMatthew G Knepley } 1883cd0c2139SMatthew G Knepley 1884c08575a3SMatthew G. Knepley /*@ 18853cf72582SMatthew G. Knepley DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface 18863cf72582SMatthew G. Knepley 18873cf72582SMatthew G. Knepley Collective on dm 18883cf72582SMatthew G. Knepley 18893cf72582SMatthew G. Knepley Input Parameters: 18903cf72582SMatthew G. Knepley + dm - The original DM 18913cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices 18923cf72582SMatthew G. Knepley 18933cf72582SMatthew G. Knepley Output Parameters: 18943cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface 18953cf72582SMatthew G. Knepley - dmHybrid - The new DM 18963cf72582SMatthew G. Knepley 18973cf72582SMatthew G. Knepley Level: developer 18983cf72582SMatthew G. Knepley 18993cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate() 19003cf72582SMatthew G. Knepley @*/ 19013cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid) 19023cf72582SMatthew G. Knepley { 19033cf72582SMatthew G. Knepley DM idm; 19043cf72582SMatthew G. Knepley DMLabel subpointMap, hlabel; 19053cf72582SMatthew G. Knepley PetscInt dim; 19063cf72582SMatthew G. Knepley PetscErrorCode ierr; 19073cf72582SMatthew G. Knepley 19083cf72582SMatthew G. Knepley PetscFunctionBegin; 19093cf72582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 19103cf72582SMatthew G. Knepley if (hybridLabel) PetscValidPointer(hybridLabel, 3); 19113cf72582SMatthew G. Knepley PetscValidPointer(dmHybrid, 4); 1912c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 19133cf72582SMatthew G. Knepley ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr); 19143cf72582SMatthew G. Knepley ierr = DMPlexOrient(idm);CHKERRQ(ierr); 19153cf72582SMatthew G. Knepley ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr); 19163cf72582SMatthew G. Knepley ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr); 19173cf72582SMatthew G. Knepley ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr); 19180f66a230SMatthew G. Knepley ierr = DMPlexLabelCohesiveComplete(dm, hlabel, NULL, PETSC_FALSE, idm);CHKERRQ(ierr); 19193cf72582SMatthew G. Knepley ierr = DMDestroy(&idm);CHKERRQ(ierr); 19203cf72582SMatthew G. Knepley ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr); 19213cf72582SMatthew G. Knepley if (hybridLabel) *hybridLabel = hlabel; 192253aa2e23SMatthew G. Knepley else {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);} 1923cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1924cd0c2139SMatthew G Knepley } 1925cd0c2139SMatthew G Knepley 1926efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 1927efa14ee0SMatthew G Knepley 1928efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 1929efa14ee0SMatthew G Knepley */ 1930830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1931efa14ee0SMatthew G Knepley { 1932fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 1933efa14ee0SMatthew G Knepley const PetscInt *subvertices; 193477d178adSMatthew G. Knepley PetscInt *pStart, *pEnd, *pMax, pSize; 1935efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1936efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1937efa14ee0SMatthew G Knepley 1938efa14ee0SMatthew G Knepley PetscFunctionBegin; 1939efa14ee0SMatthew G Knepley *numFaces = 0; 1940efa14ee0SMatthew G Knepley *nFV = 0; 1941efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1942c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 194377d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1944dcca6d9dSJed Brown ierr = PetscMalloc3(pSize,&pStart,pSize,&pEnd,pSize,&pMax);CHKERRQ(ierr); 1945d92e47f8SMatthew 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); 1946efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 1947efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1948efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1949efa14ee0SMatthew G Knepley } 1950efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1951fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1952efa14ee0SMatthew G Knepley if (subvertexIS) { 1953efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1954efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1955efa14ee0SMatthew G Knepley } 1956efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1957efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 19580298fd71SBarry Smith PetscInt *star = NULL; 1959efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 1960efa14ee0SMatthew G Knepley 1961efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1962efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1963efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1964efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1965efa14ee0SMatthew G Knepley } 1966efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 1967efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 19680298fd71SBarry Smith PetscInt *closure = NULL; 1969efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 1970efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 1971efa14ee0SMatthew G Knepley 1972efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 197365560c7fSMatthew G Knepley if (cellLoc == 2) continue; 197482f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1975efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1976efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1977efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1978efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1979efa14ee0SMatthew G Knepley 1980efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1981efa14ee0SMatthew G Knepley ++numCorners; 1982efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1983830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 1984efa14ee0SMatthew G Knepley } 1985efa14ee0SMatthew G Knepley } 198618ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 198782f516ccSBarry 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); 1988efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 1989007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 1990007baee2SMatthew G. Knepley PetscInt numCells, nc; 1991007baee2SMatthew G. Knepley 1992efa14ee0SMatthew G Knepley ++(*numFaces); 1993efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 1994efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 1995efa14ee0SMatthew G Knepley } 1996007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1997007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 1998007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 1999007baee2SMatthew G. Knepley } 2000007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 2001efa14ee0SMatthew G Knepley } 2002efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2003efa14ee0SMatthew G Knepley } 2004efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 2005efa14ee0SMatthew G Knepley } 2006efa14ee0SMatthew G Knepley if (subvertexIS) { 2007efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 2008efa14ee0SMatthew G Knepley } 2009efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2010efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 2011efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 2012efa14ee0SMatthew G Knepley } 2013efa14ee0SMatthew G Knepley 2014830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 2015efa14ee0SMatthew G Knepley { 201634b4c39eSMatthew G. Knepley IS subvertexIS = NULL; 2017efa14ee0SMatthew G Knepley const PetscInt *subvertices; 2018efa14ee0SMatthew G Knepley PetscInt *pStart, *pEnd, *pMax; 2019efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 2020efa14ee0SMatthew G Knepley PetscErrorCode ierr; 2021efa14ee0SMatthew G Knepley 2022efa14ee0SMatthew G Knepley PetscFunctionBegin; 2023c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2024dcca6d9dSJed Brown ierr = PetscMalloc3(dim+1,&pStart,dim+1,&pEnd,dim+1,&pMax);CHKERRQ(ierr); 20250298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 2026efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 2027efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 2028efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 2029efa14ee0SMatthew G Knepley } 2030efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 203134b4c39eSMatthew G. Knepley if (vertexLabel) { 2032830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 2033efa14ee0SMatthew G Knepley if (subvertexIS) { 2034efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 2035efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 2036efa14ee0SMatthew G Knepley } 203734b4c39eSMatthew G. Knepley } 2038efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 2039efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 20400298fd71SBarry Smith PetscInt *star = NULL; 2041efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 2042efa14ee0SMatthew G Knepley 2043efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 2044efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 2045efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 2046efa14ee0SMatthew G Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 2047efa14ee0SMatthew G Knepley } 2048efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 2049efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 20500298fd71SBarry Smith PetscInt *closure = NULL; 2051efa14ee0SMatthew G Knepley PetscInt closureSize, c; 2052efa14ee0SMatthew G Knepley PetscInt faceLoc; 2053efa14ee0SMatthew G Knepley 2054efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 2055efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 205682f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 2057efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2058efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 2059efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 2060efa14ee0SMatthew G Knepley PetscInt vertexLoc; 2061efa14ee0SMatthew G Knepley 2062efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 2063efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 2064830e53efSMatthew G. Knepley if (vertexLoc != value) break; 2065efa14ee0SMatthew G Knepley } 2066efa14ee0SMatthew G Knepley } 2067efa14ee0SMatthew G Knepley if (c == closureSize*2) { 2068efa14ee0SMatthew G Knepley const PetscInt *support; 2069efa14ee0SMatthew G Knepley PetscInt supportSize, s; 2070efa14ee0SMatthew G Knepley 2071efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 2072efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 2073efa14ee0SMatthew G Knepley 2074efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 2075efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 2076efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 2077efa14ee0SMatthew G Knepley break; 2078efa14ee0SMatthew G Knepley } 2079efa14ee0SMatthew G Knepley } 2080efa14ee0SMatthew G Knepley } 2081efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2082efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2083efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 2084efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 2085efa14ee0SMatthew G Knepley } 2086efa14ee0SMatthew G Knepley } 2087efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2088efa14ee0SMatthew G Knepley } 2089efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 2090efa14ee0SMatthew G Knepley } 209134b4c39eSMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);} 2092efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2093efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 2094efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 2095efa14ee0SMatthew G Knepley } 2096efa14ee0SMatthew G Knepley 209727c04023SMatthew 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) 2098766ab985SMatthew G. Knepley { 209927c04023SMatthew G. Knepley DMLabel label = NULL; 2100766ab985SMatthew G. Knepley const PetscInt *cone; 21019fc93327SToby Isaac PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize = -1; 2102766ab985SMatthew G. Knepley PetscErrorCode ierr; 2103766ab985SMatthew G. Knepley 2104812bfc34SJed Brown PetscFunctionBegin; 2105c0ed958bSJed Brown *numFaces = 0; 2106c0ed958bSJed Brown *nFV = 0; 2107c58f1c22SToby Isaac if (labelname) {ierr = DMGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 2108fed694aaSMatthew G. Knepley *subCells = NULL; 2109c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2110766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 2111766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2112766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 211327c04023SMatthew G. Knepley if (label) { 211427c04023SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 211527c04023SMatthew G. Knepley PetscInt val; 211627c04023SMatthew G. Knepley 211727c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 211827c04023SMatthew G. Knepley if (val == value) { 211927c04023SMatthew G. Knepley ++(*numFaces); 212027c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 212127c04023SMatthew G. Knepley } 212227c04023SMatthew G. Knepley } 212327c04023SMatthew G. Knepley } else { 2124766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 212527c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 212627c04023SMatthew G. Knepley } 2127785e854fSJed Brown ierr = PetscMalloc1(*numFaces *2, subCells);CHKERRQ(ierr); 21289fc93327SToby Isaac if (!(*numFaces)) PetscFunctionReturn(0); 21299fc93327SToby Isaac *nFV = hasLagrange ? coneSize/3 : coneSize/2; 2130766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 2131766ab985SMatthew G. Knepley const PetscInt *cells; 2132766ab985SMatthew G. Knepley PetscInt numCells; 2133766ab985SMatthew G. Knepley 213427c04023SMatthew G. Knepley if (label) { 213527c04023SMatthew G. Knepley PetscInt val; 213627c04023SMatthew G. Knepley 213727c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 213827c04023SMatthew G. Knepley if (val != value) continue; 213927c04023SMatthew G. Knepley } 2140766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2141766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 2142766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 2143766ab985SMatthew G. Knepley } 2144766ab985SMatthew G. Knepley /* Negative face */ 2145766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 214627234c99SMatthew G. Knepley /* Not true in parallel 214727234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 2148766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 2149766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 215027234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 2151766ab985SMatthew G. Knepley } 2152766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 2153766ab985SMatthew G. Knepley /* Positive face is not included */ 2154766ab985SMatthew G. Knepley } 2155766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2156766ab985SMatthew G. Knepley } 2157766ab985SMatthew G. Knepley 21583982b651SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, DMLabel label, PetscInt value, DMLabel subpointMap, DM subdm) 2159766ab985SMatthew G. Knepley { 2160766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 2161766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 2162766ab985SMatthew G. Knepley PetscErrorCode ierr; 2163766ab985SMatthew G. Knepley 2164812bfc34SJed Brown PetscFunctionBegin; 2165c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2166766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 2167766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2168766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 2169dcca6d9dSJed Brown ierr = PetscMalloc2(dim+1,&pStart,dim+1,&pEnd);CHKERRQ(ierr); 2170b3154360SMatthew G. Knepley for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);} 2171766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 2172766ab985SMatthew G. Knepley const PetscInt *cone; 2173766ab985SMatthew G. Knepley PetscInt *closure = NULL; 2174b3154360SMatthew G. Knepley PetscInt fconeSize, coneSize, closureSize, cl, val; 2175766ab985SMatthew G. Knepley 217627c04023SMatthew G. Knepley if (label) { 217727c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 217827c04023SMatthew G. Knepley if (val != value) continue; 217927c04023SMatthew G. Knepley } 2180766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2181766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2182b3154360SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr); 2183b3154360SMatthew G. Knepley if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 2184b3154360SMatthew G. Knepley /* Negative face */ 2185766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2186766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2187766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 2188766ab985SMatthew G. Knepley 2189766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2190766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 2191766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 2192766ab985SMatthew G. Knepley break; 2193766ab985SMatthew G. Knepley } 2194766ab985SMatthew G. Knepley } 2195766ab985SMatthew G. Knepley } 2196766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2197766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 2198766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 2199766ab985SMatthew G. Knepley const PetscInt *support; 2200766ab985SMatthew G. Knepley PetscInt supportSize, s; 2201766ab985SMatthew G. Knepley 2202766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 2203711de394SMatthew G. Knepley /* if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); */ 2204766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 2205766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 2206766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 2207766ab985SMatthew G. Knepley } 2208766ab985SMatthew G. Knepley } 2209766ab985SMatthew G. Knepley } 2210766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 2211766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2212766ab985SMatthew G. Knepley } 2213766ab985SMatthew G. Knepley 2214c08575a3SMatthew G. Knepley static PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2215e6ccafaeSMatthew G Knepley { 221682f516ccSBarry Smith MPI_Comm comm; 2217e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 2218e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 2219e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 2220e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2221e6ccafaeSMatthew G Knepley 222282f516ccSBarry Smith PetscFunctionBegin; 222382f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2224c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &cellDim);CHKERRQ(ierr); 2225e6ccafaeSMatthew G Knepley if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 2226e6ccafaeSMatthew G Knepley 2227ddeab2a6SMatthew G. Knepley if (cellDim == 1 && numCorners == 2) { 2228ddeab2a6SMatthew G. Knepley /* Triangle */ 2229e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 2230e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2231ddeab2a6SMatthew G. Knepley } else if (cellDim == 2 && numCorners == 3) { 2232ddeab2a6SMatthew G. Knepley /* Triangle */ 2233ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2234ddeab2a6SMatthew G. Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2235ddeab2a6SMatthew G. Knepley } else if (cellDim == 3 && numCorners == 4) { 2236ddeab2a6SMatthew G. Knepley /* Tetrahedron */ 2237ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2238ddeab2a6SMatthew G. Knepley posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2239e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 2240e6ccafaeSMatthew G Knepley /* Quadratic line */ 2241e6ccafaeSMatthew G Knepley faceSize = 1; 2242e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2243e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 2244e6ccafaeSMatthew G Knepley /* Quads */ 2245e6ccafaeSMatthew G Knepley faceSize = 2; 2246e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 2247e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2248e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 2249e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2250e6ccafaeSMatthew G Knepley } else { 2251e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 2252e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 2253e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 2254e6ccafaeSMatthew G Knepley } 2255e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 2256e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 2257e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2258e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 2259e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2260e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2261e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 2262e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2263e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2264e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 2265e6ccafaeSMatthew G Knepley }; 2266e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 2267e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2268e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2269e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 2270e6ccafaeSMatthew G Knepley }; 2271e6ccafaeSMatthew G Knepley 2272e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 2273e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 2274e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 2275e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 2276e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2277e6ccafaeSMatthew G Knepley 2278e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 2279e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 2280e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 2281e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 2282e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 2283e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2284e6ccafaeSMatthew G Knepley break; 2285e6ccafaeSMatthew G Knepley } 2286e6ccafaeSMatthew G Knepley } 2287e6ccafaeSMatthew G Knepley } 2288e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2289e6ccafaeSMatthew G Knepley break; 2290e6ccafaeSMatthew G Knepley } 2291e6ccafaeSMatthew G Knepley } 2292e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 2293e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2294e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2295e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 2296e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 2297e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2298e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 2299e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2300e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2301e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 2302e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2303e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2304e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2305e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 2306e6ccafaeSMatthew G Knepley }; 2307e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 2308e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2309e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2310e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2311e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 2312e6ccafaeSMatthew G Knepley }; 2313e6ccafaeSMatthew G Knepley 2314e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 2315e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 2316e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 2317e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 2318e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2319e6ccafaeSMatthew G Knepley 2320e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 2321e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 2322e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 2323e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 2324e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 2325e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2326e6ccafaeSMatthew G Knepley break; 2327e6ccafaeSMatthew G Knepley } 2328e6ccafaeSMatthew G Knepley } 2329e6ccafaeSMatthew G Knepley } 2330e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2331e6ccafaeSMatthew G Knepley break; 2332e6ccafaeSMatthew G Knepley } 2333e6ccafaeSMatthew G Knepley } 2334e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 2335e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2336e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2337e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 2338e6ccafaeSMatthew G Knepley /* Hexes 2339e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2340e6ccafaeSMatthew G Knepley pointing up at the second. 2341e6ccafaeSMatthew G Knepley 2342e6ccafaeSMatthew G Knepley 7---6 2343e6ccafaeSMatthew G Knepley /| /| 2344e6ccafaeSMatthew G Knepley 4---5 | 2345ddeab2a6SMatthew G. Knepley | 1-|-2 2346e6ccafaeSMatthew G Knepley |/ |/ 2347ddeab2a6SMatthew G. Knepley 0---3 2348e6ccafaeSMatthew G Knepley 2349e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2350e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 2351e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 2352e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2353e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 2354e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 2355e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2356ddeab2a6SMatthew G. Knepley 0, 3, 4, 5, /* front */ 2357ddeab2a6SMatthew G. Knepley 2, 3, 5, 6, /* right */ 2358ddeab2a6SMatthew G. Knepley 1, 2, 6, 7, /* back */ 2359ddeab2a6SMatthew G. Knepley 0, 1, 4, 7, /* left */ 2360e6ccafaeSMatthew G Knepley }; 2361e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 2362ddeab2a6SMatthew G. Knepley 1, 2, 3, 0, /* bottom */ 2363e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2364ddeab2a6SMatthew G. Knepley 0, 3, 5, 4, /* front */ 2365ddeab2a6SMatthew G. Knepley 3, 2, 6, 5, /* right */ 2366ddeab2a6SMatthew G. Knepley 2, 1, 7, 6, /* back */ 2367ddeab2a6SMatthew G. Knepley 1, 0, 4, 7, /* left */ 2368e6ccafaeSMatthew G Knepley }; 2369e6ccafaeSMatthew G Knepley 2370e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 2371e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 2372e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2373e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 2374e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2375e6ccafaeSMatthew G Knepley 2376e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 2377e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 2378e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 2379e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 2380e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 2381e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 2382e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 2383e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2384e6ccafaeSMatthew G Knepley break; 2385e6ccafaeSMatthew G Knepley } 2386e6ccafaeSMatthew G Knepley } 2387e6ccafaeSMatthew G Knepley } 2388e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2389e6ccafaeSMatthew G Knepley break; 2390e6ccafaeSMatthew G Knepley } 2391e6ccafaeSMatthew G Knepley } 2392e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2393e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2394e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2395e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 2396e6ccafaeSMatthew G Knepley /* Quadratic tet */ 2397e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 2398e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 2399e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 2400e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2401e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 2402e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2403e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 2404e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 2405e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 2406e6ccafaeSMatthew G Knepley }; 2407e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 2408e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2409e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 2410e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 2411e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 2412e6ccafaeSMatthew G Knepley }; 2413e6ccafaeSMatthew G Knepley 2414e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 2415e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 2416e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 2417e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 2418e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2419e6ccafaeSMatthew G Knepley 2420e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 2421e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 2422e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 2423e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 2424e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 2425e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 2426e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 2427e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2428e6ccafaeSMatthew G Knepley break; 2429e6ccafaeSMatthew G Knepley } 2430e6ccafaeSMatthew G Knepley } 2431e6ccafaeSMatthew G Knepley } 2432e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2433e6ccafaeSMatthew G Knepley break; 2434e6ccafaeSMatthew G Knepley } 2435e6ccafaeSMatthew G Knepley } 2436e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 2437e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2438e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2439e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 2440e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 2441e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2442e6ccafaeSMatthew G Knepley pointing up at the second. 2443e6ccafaeSMatthew G Knepley 2444e6ccafaeSMatthew G Knepley 7---6 2445e6ccafaeSMatthew G Knepley /| /| 2446e6ccafaeSMatthew G Knepley 4---5 | 2447e6ccafaeSMatthew G Knepley | 3-|-2 2448e6ccafaeSMatthew G Knepley |/ |/ 2449e6ccafaeSMatthew G Knepley 0---1 2450e6ccafaeSMatthew G Knepley 2451e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2452e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 2453e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 2454e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2455e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 2456e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 2457e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2458e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 2459e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 2460e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 2461e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 2462e6ccafaeSMatthew G Knepley }; 2463e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 2464e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 2465e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2466e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 2467e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 2468e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 2469e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 2470e6ccafaeSMatthew G Knepley }; 2471e6ccafaeSMatthew G Knepley 2472e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 2473e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 2474e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2475e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 2476e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2477e6ccafaeSMatthew G Knepley 2478e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 2479e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 2480e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 2481e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 2482e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 2483e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 2484e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 2485e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2486e6ccafaeSMatthew G Knepley break; 2487e6ccafaeSMatthew G Knepley } 2488e6ccafaeSMatthew G Knepley } 2489e6ccafaeSMatthew G Knepley } 2490e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2491e6ccafaeSMatthew G Knepley break; 2492e6ccafaeSMatthew G Knepley } 2493e6ccafaeSMatthew G Knepley } 2494e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2495e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2496e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2497e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 2498e6ccafaeSMatthew G Knepley if (!posOrient) { 2499e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 2500e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 2501e6ccafaeSMatthew G Knepley } else { 2502e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 2503e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 2504e6ccafaeSMatthew G Knepley } 2505e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 2506e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2507e6ccafaeSMatthew G Knepley } 2508e6ccafaeSMatthew G Knepley 2509c08575a3SMatthew G. Knepley /*@ 2510c08575a3SMatthew G. Knepley DMPlexGetOrientedFace - Given a cell and a face, as a set of vertices, return the oriented face, as a set of vertices, 2511c08575a3SMatthew G. Knepley in faceVertices. The orientation is such that the face normal points out of the cell 2512c08575a3SMatthew G. Knepley 2513c08575a3SMatthew G. Knepley Not collective 2514c08575a3SMatthew G. Knepley 2515c08575a3SMatthew G. Knepley Input Parameters: 2516c08575a3SMatthew G. Knepley + dm - The original mesh 2517c08575a3SMatthew G. Knepley . cell - The cell mesh point 2518c08575a3SMatthew G. Knepley . faceSize - The number of vertices on the face 2519c08575a3SMatthew G. Knepley . face - The face vertices 2520c08575a3SMatthew G. Knepley . numCorners - The number of vertices on the cell 2521c08575a3SMatthew G. Knepley . indices - Local numbering of face vertices in cell cone 2522c08575a3SMatthew G. Knepley - origVertices - Original face vertices 2523c08575a3SMatthew G. Knepley 2524c08575a3SMatthew G. Knepley Output Parameter: 2525c08575a3SMatthew G. Knepley + faceVertices - The face vertices properly oriented 2526c08575a3SMatthew G. Knepley - posOriented - PETSC_TRUE if the face was oriented with outward normal 2527c08575a3SMatthew G. Knepley 2528c08575a3SMatthew G. Knepley Level: developer 2529c08575a3SMatthew G. Knepley 2530c08575a3SMatthew G. Knepley .seealso: DMPlexGetCone() 2531c08575a3SMatthew G. Knepley @*/ 2532e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2533e6ccafaeSMatthew G Knepley { 25340298fd71SBarry Smith const PetscInt *cone = NULL; 2535e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 2536e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 2537e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2538e6ccafaeSMatthew G Knepley 2539e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2540e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 2541e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 2542e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 2543e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2544e6ccafaeSMatthew G Knepley 2545e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 2546e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 2547e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 2548e6ccafaeSMatthew G Knepley } 2549e6ccafaeSMatthew G Knepley } 2550e6ccafaeSMatthew G Knepley if (found) { 2551e6ccafaeSMatthew G Knepley indices[v2] = v; 2552e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 2553e6ccafaeSMatthew G Knepley ++v2; 2554e6ccafaeSMatthew G Knepley } else { 2555e6ccafaeSMatthew G Knepley oppositeVertex = v; 2556e6ccafaeSMatthew G Knepley } 2557e6ccafaeSMatthew G Knepley } 2558e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 2559e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2560e6ccafaeSMatthew G Knepley } 2561e6ccafaeSMatthew G Knepley 2562e6ccafaeSMatthew G Knepley /* 2563cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 2564e6ccafaeSMatthew G Knepley 2565e6ccafaeSMatthew G Knepley Not collective 2566e6ccafaeSMatthew G Knepley 2567e6ccafaeSMatthew G Knepley Input Parameters: 2568e6ccafaeSMatthew G Knepley + dm - The DMPlex 2569e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 2570e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 2571e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 2572e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 2573e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 2574e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 2575e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 2576e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 2577e6ccafaeSMatthew G Knepley 2578e6ccafaeSMatthew G Knepley Output Parameters: 2579e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 2580e6ccafaeSMatthew G Knepley 2581e6ccafaeSMatthew G Knepley Level: developer 2582e6ccafaeSMatthew G Knepley */ 2583cd0c2139SMatthew 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) 2584e6ccafaeSMatthew G Knepley { 258582f516ccSBarry Smith MPI_Comm comm; 2586e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 2587e6ccafaeSMatthew G Knepley const PetscInt *faces; 2588e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 2589e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2590e6ccafaeSMatthew G Knepley 2591e6ccafaeSMatthew G Knepley PetscFunctionBegin; 259282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2593e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 2594e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 2595e6ccafaeSMatthew G Knepley #if 0 2596e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 2597e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2598e6ccafaeSMatthew G Knepley #else 2599e6ccafaeSMatthew G Knepley { 2600e6ccafaeSMatthew G Knepley PetscInt f; 2601e6ccafaeSMatthew G Knepley 2602e6ccafaeSMatthew G Knepley numFaces = 0; 260369291d52SBarry Smith ierr = DMGetWorkArray(subdm, 1, MPIU_INT, (void **) &faces);CHKERRQ(ierr); 2604e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 2605e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 2606e6ccafaeSMatthew G Knepley 2607e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 2608e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 2609e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 2610e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 2611e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 2612e6ccafaeSMatthew G Knepley PetscInt v; 2613e6ccafaeSMatthew G Knepley 2614e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2615e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 2616e6ccafaeSMatthew G Knepley } 2617e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 2618e6ccafaeSMatthew G Knepley } 2619e6ccafaeSMatthew G Knepley if (d == dof) { 2620e6ccafaeSMatthew G Knepley numFaces = 1; 2621e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 2622e6ccafaeSMatthew G Knepley } 2623e6ccafaeSMatthew G Knepley } 2624e6ccafaeSMatthew G Knepley } 2625e6ccafaeSMatthew G Knepley #endif 2626e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 2627e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 2628e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 2629766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 2630e6ccafaeSMatthew G Knepley } else { 2631e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 2632e6ccafaeSMatthew G Knepley PetscBool posOriented; 2633e6ccafaeSMatthew G Knepley 263469291d52SBarry Smith ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), MPIU_INT, &orientedVertices);CHKERRQ(ierr); 2635e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 2636e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 2637e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 2638e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 2639e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 2640e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2641e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 2642e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 2643e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 2644e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 2645e6ccafaeSMatthew G Knepley break; 2646e6ccafaeSMatthew G Knepley } 2647e6ccafaeSMatthew G Knepley } 2648e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 2649e6ccafaeSMatthew G Knepley } 2650e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 2651e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 265269291d52SBarry Smith ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), MPIU_INT, &orientedVertices);CHKERRQ(ierr); 2653e6ccafaeSMatthew G Knepley ++(*newFacePoint); 2654e6ccafaeSMatthew G Knepley } 2655ef07cca7SMatthew G. Knepley #if 0 2656e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2657ef07cca7SMatthew G. Knepley #else 265869291d52SBarry Smith ierr = DMRestoreWorkArray(subdm, 1, MPIU_INT, (void **) &faces);CHKERRQ(ierr); 2659ef07cca7SMatthew G. Knepley #endif 2660e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2661e6ccafaeSMatthew G Knepley } 2662e6ccafaeSMatthew G Knepley 266353156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2664e6ccafaeSMatthew G Knepley { 266582f516ccSBarry Smith MPI_Comm comm; 266653156dfcSMatthew G. Knepley DMLabel subpointMap; 2667efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 2668efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 2669efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 2670fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 2671efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 2672e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2673e6ccafaeSMatthew G Knepley 2674e6ccafaeSMatthew G Knepley PetscFunctionBegin; 267582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2676efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2677efa14ee0SMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2678efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2679efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 268053156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);} 2681efa14ee0SMatthew G Knepley /* Setup chart */ 2682efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2683efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2684efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2685efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2686e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2687e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 2688efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 2689e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 2690efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2691efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2692efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 2693efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2694e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2695e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2696e6ccafaeSMatthew G Knepley } 2697e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2698e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2699e6ccafaeSMatthew G Knepley } 2700e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2701e6ccafaeSMatthew G Knepley /* Create face cones */ 2702efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 27030298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 270469291d52SBarry Smith ierr = DMGetWorkArray(subdm, maxConeSize, MPIU_INT, (void**) &subface);CHKERRQ(ierr); 2705e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2706e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 2707efa14ee0SMatthew G Knepley const PetscInt subcell = c; 27080298fd71SBarry Smith PetscInt *closure = NULL; 2709efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 2710e6ccafaeSMatthew G Knepley 2711e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2712efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2713efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 2714e6ccafaeSMatthew G Knepley PetscInt subVertex; 2715e6ccafaeSMatthew G Knepley 2716efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 2717efa14ee0SMatthew G Knepley ++numCorners; 2718efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 2719efa14ee0SMatthew G Knepley if (subVertex >= 0) { 2720efa14ee0SMatthew G Knepley closure[faceSize] = point; 272165560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 2722e6ccafaeSMatthew G Knepley ++faceSize; 2723e6ccafaeSMatthew G Knepley } 2724e6ccafaeSMatthew G Knepley } 2725e6ccafaeSMatthew G Knepley } 2726efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 2727efa14ee0SMatthew G Knepley if (faceSize == nFV) { 2728cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 2729e6ccafaeSMatthew G Knepley } 273065560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2731e6ccafaeSMatthew G Knepley } 273269291d52SBarry Smith ierr = DMRestoreWorkArray(subdm, maxConeSize, MPIU_INT, (void**) &subface);CHKERRQ(ierr); 2733e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2734e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2735e6ccafaeSMatthew G Knepley /* Build coordinates */ 2736efa14ee0SMatthew G Knepley { 2737efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 2738efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 2739efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 2740285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 274124640c55SToby Isaac const char *name; 2742efa14ee0SMatthew G Knepley 274369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2744e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 274569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2746285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2747285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2748285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2749efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2750efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2751efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2752efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2753efa14ee0SMatthew G Knepley PetscInt dof; 2754efa14ee0SMatthew G Knepley 2755efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2756efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2757285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2758e6ccafaeSMatthew G Knepley } 2759e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2760e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 27618b9ced59SLisandro Dalcin ierr = VecCreate(PETSC_COMM_SELF, &subCoordinates);CHKERRQ(ierr); 276224640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 276324640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr); 2764e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 27652eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2766830e53efSMatthew G. Knepley if (coordSize) { 2767e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2768e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2769efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2770efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2771efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2772efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2773e6ccafaeSMatthew G Knepley 2774e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2775e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2776efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2777efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2778efa14ee0SMatthew 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); 2779e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2780e6ccafaeSMatthew G Knepley } 2781e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2782e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 27833b399e24SMatthew G. Knepley } 2784e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2785e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2786e6ccafaeSMatthew G Knepley } 2787efa14ee0SMatthew G Knepley /* Cleanup */ 2788efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2789efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2790efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2791efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2792e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2793e6ccafaeSMatthew G Knepley } 2794e6ccafaeSMatthew G Knepley 27953982b651SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 27963982b651SMatthew G. Knepley { 27973982b651SMatthew G. Knepley PetscInt subPoint; 27983982b651SMatthew G. Knepley PetscErrorCode ierr; 27993982b651SMatthew G. Knepley 28003982b651SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 28013982b651SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 28023982b651SMatthew G. Knepley } 28033982b651SMatthew G. Knepley 2804bec263e5SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmeshGeneric_Interpolated(DM dm, DMLabel label, PetscInt value, PetscBool isCohesive, PetscInt cellHeight, DM subdm) 2805e6ccafaeSMatthew G Knepley { 280682f516ccSBarry Smith MPI_Comm comm; 280753156dfcSMatthew G. Knepley DMLabel subpointMap; 2808efa14ee0SMatthew G Knepley IS *subpointIS; 2809efa14ee0SMatthew G Knepley const PetscInt **subpoints; 28103982b651SMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *orntNew; 28110d366550SMatthew G. Knepley PetscInt totSubPoints = 0, maxConeSize, cMax, cEnd, dim, p, d, v; 28120d366550SMatthew G. Knepley PetscMPIInt rank; 2813e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2814e6ccafaeSMatthew G Knepley 2815e6ccafaeSMatthew G Knepley PetscFunctionBegin; 281682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 28170d366550SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2818efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2819e6ccafaeSMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2820efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2821bec263e5SMatthew G. Knepley if (cellHeight) { 28223982b651SMatthew G. Knepley if (isCohesive) {ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);} 28233982b651SMatthew G. Knepley else {ierr = DMPlexMarkSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);} 2824bec263e5SMatthew G. Knepley } else { 2825bec263e5SMatthew G. Knepley DMLabel depth; 2826bec263e5SMatthew G. Knepley IS pointIS; 2827bec263e5SMatthew G. Knepley const PetscInt *points; 2828bec263e5SMatthew G. Knepley PetscInt numPoints; 2829bec263e5SMatthew G. Knepley 2830bec263e5SMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depth);CHKERRQ(ierr); 2831bec263e5SMatthew G. Knepley ierr = DMLabelGetStratumSize(label, value, &numPoints);CHKERRQ(ierr); 2832bec263e5SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, value, &pointIS);CHKERRQ(ierr); 2833bec263e5SMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 2834bec263e5SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 2835bec263e5SMatthew G. Knepley PetscInt *closure = NULL; 2836bec263e5SMatthew G. Knepley PetscInt closureSize, c, pdim; 2837bec263e5SMatthew G. Knepley 2838bec263e5SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2839bec263e5SMatthew G. Knepley for (c = 0; c < closureSize*2; c += 2) { 2840bec263e5SMatthew G. Knepley ierr = DMLabelGetValue(depth, closure[c], &pdim);CHKERRQ(ierr); 2841bec263e5SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, closure[c], pdim);CHKERRQ(ierr); 2842bec263e5SMatthew G. Knepley } 2843bec263e5SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2844bec263e5SMatthew G. Knepley } 2845bec263e5SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 2846bec263e5SMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 2847bec263e5SMatthew G. Knepley } 2848bec263e5SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 28490d366550SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 28500d366550SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 28510d366550SMatthew G. Knepley cMax = (cMax < 0) ? cEnd : cMax; 2852efa14ee0SMatthew G Knepley /* Setup chart */ 2853c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2854dcca6d9dSJed Brown ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr); 2855e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2856e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2857e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 2858e6ccafaeSMatthew G Knepley } 2859e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2860bec263e5SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, cellHeight);CHKERRQ(ierr); 2861e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2862e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 2863e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2864e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2865e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2866e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2867e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 28680ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2869e6ccafaeSMatthew G Knepley } 2870e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2871e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2872e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2873e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2874e6ccafaeSMatthew G Knepley const PetscInt *cone; 2875e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 2876e6ccafaeSMatthew G Knepley 2877e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2878e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2879bec263e5SMatthew G. Knepley if (cellHeight && (d == dim)) { 2880e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2881e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2882e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2883e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 2884e6ccafaeSMatthew G Knepley } 2885e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2886e6ccafaeSMatthew G Knepley } 2887e6ccafaeSMatthew G Knepley } 2888e6ccafaeSMatthew G Knepley } 2889e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2890e6ccafaeSMatthew G Knepley /* Set cones */ 28910298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 28923982b651SMatthew G. Knepley ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&orntNew);CHKERRQ(ierr); 2893e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2894e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2895e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2896e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 28970e49e2e2SMatthew G. Knepley const PetscInt *cone, *ornt; 28980d366550SMatthew G. Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc, fornt = 0; 2899e6ccafaeSMatthew G Knepley 29000d366550SMatthew G. Knepley if (d == dim-1) { 29010d366550SMatthew G. Knepley const PetscInt *support, *cone, *ornt; 29020d366550SMatthew G. Knepley PetscInt supportSize, coneSize, s, subc; 29030d366550SMatthew G. Knepley 29040d366550SMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 29050d366550SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 29060d366550SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 29070d366550SMatthew G. Knepley if ((support[s] < cMax) || (support[s] >= cEnd)) continue; 29080d366550SMatthew G. Knepley ierr = PetscFindInt(support[s], numSubPoints[d+1], subpoints[d+1], &subc);CHKERRQ(ierr); 29090d366550SMatthew G. Knepley if (subc >= 0) { 29100d366550SMatthew G. Knepley const PetscInt ccell = subpoints[d+1][subc]; 29110d366550SMatthew G. Knepley 29127f79407eSBarry Smith ierr = DMPlexGetCone(dm, ccell, &cone);CHKERRQ(ierr); 29137f79407eSBarry Smith ierr = DMPlexGetConeSize(dm, ccell, &coneSize);CHKERRQ(ierr); 29147f79407eSBarry Smith ierr = DMPlexGetConeOrientation(dm, ccell, &ornt);CHKERRQ(ierr); 29150d366550SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 29160d366550SMatthew G. Knepley if (cone[c] == point) { 29170d366550SMatthew G. Knepley fornt = ornt[c]; 29180d366550SMatthew G. Knepley break; 29190d366550SMatthew G. Knepley } 29200d366550SMatthew G. Knepley } 29210d366550SMatthew G. Knepley break; 29220d366550SMatthew G. Knepley } 29230d366550SMatthew G. Knepley } 29240d366550SMatthew G. Knepley } 2925e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2926e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2927e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 29280e49e2e2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2929e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2930e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 293101a2673eSMatthew G. Knepley if (subc >= 0) { 293201a2673eSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 29333982b651SMatthew G. Knepley orntNew[coneSizeNew] = ornt[c]; 293401a2673eSMatthew G. Knepley ++coneSizeNew; 293501a2673eSMatthew G. Knepley } 2936e6ccafaeSMatthew G Knepley } 2937e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 29380d366550SMatthew G. Knepley if (fornt < 0) { 29390d366550SMatthew G. Knepley /* This should be replaced by a call to DMPlexReverseCell() */ 29400d366550SMatthew G. Knepley #if 0 2941a129c400SMatthew G. Knepley ierr = DMPlexReverseCell(subdm, subpoint);CHKERRQ(ierr); 2942a129c400SMatthew G. Knepley #else 2943c0b40891SMatthew G. Knepley for (c = 0; c < coneSizeNew/2 + coneSizeNew%2; ++c) { 2944a129c400SMatthew G. Knepley PetscInt faceSize, tmp; 29450d366550SMatthew G. Knepley 29460d366550SMatthew G. Knepley tmp = coneNew[c]; 29470d366550SMatthew G. Knepley coneNew[c] = coneNew[coneSizeNew-1-c]; 29480d366550SMatthew G. Knepley coneNew[coneSizeNew-1-c] = tmp; 2949a129c400SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[c], &faceSize);CHKERRQ(ierr); 2950a129c400SMatthew G. Knepley tmp = orntNew[c] >= 0 ? -(faceSize-orntNew[c]) : faceSize+orntNew[c]; 2951a129c400SMatthew G. Knepley orntNew[c] = orntNew[coneSizeNew-1-c] >= 0 ? -(faceSize-orntNew[coneSizeNew-1-c]) : faceSize+orntNew[coneSizeNew-1-c]; 29520d366550SMatthew G. Knepley orntNew[coneSizeNew-1-c] = tmp; 29530d366550SMatthew G. Knepley } 29540d366550SMatthew G. Knepley } 2955e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 29563982b651SMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, orntNew);CHKERRQ(ierr); 2957a129c400SMatthew G. Knepley #endif 2958e6ccafaeSMatthew G Knepley } 2959e6ccafaeSMatthew G Knepley } 29603982b651SMatthew G. Knepley ierr = PetscFree2(coneNew,orntNew);CHKERRQ(ierr); 2961e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2962e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2963e6ccafaeSMatthew G Knepley /* Build coordinates */ 2964e6ccafaeSMatthew G Knepley { 2965e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 2966e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 2967e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 2968c0e8cf5fSMatthew G. Knepley PetscInt cdim, numComp, coordSize; 296924640c55SToby Isaac const char *name; 2970e6ccafaeSMatthew G Knepley 2971c0e8cf5fSMatthew G. Knepley ierr = DMGetCoordinateDim(dm, &cdim);CHKERRQ(ierr); 297269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2973e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 297469d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2975285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2976285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2977285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2978e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2979e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2980e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2981e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2982e6ccafaeSMatthew G Knepley PetscInt dof; 2983e6ccafaeSMatthew G Knepley 2984e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2985e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2986285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2987e6ccafaeSMatthew G Knepley } 2988e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2989e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 29908b9ced59SLisandro Dalcin ierr = VecCreate(PETSC_COMM_SELF, &subCoordinates);CHKERRQ(ierr); 299124640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 299224640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr); 2993e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2994c0e8cf5fSMatthew G. Knepley ierr = VecSetBlockSize(subCoordinates, cdim);CHKERRQ(ierr); 29952eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2996e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2997e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2998e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2999e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 3000e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 3001e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 3002e6ccafaeSMatthew G Knepley 3003e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3004e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 3005e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 3006e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 3007e6ccafaeSMatthew 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); 3008efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 3009e6ccafaeSMatthew G Knepley } 3010e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3011e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3012e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 3013e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 3014e6ccafaeSMatthew G Knepley } 30153982b651SMatthew G. Knepley /* Build SF: We need this complexity because subpoints might not be selected on the owning process */ 30163982b651SMatthew G. Knepley { 30173982b651SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 30183982b651SMatthew G. Knepley IS subpIS; 30193982b651SMatthew G. Knepley const PetscSFNode *remotePoints; 30203982b651SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 30213982b651SMatthew G. Knepley const PetscInt *localPoints, *subpoints; 30223982b651SMatthew G. Knepley PetscInt *slocalPoints; 30233982b651SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubpoints = 0, numSubroots, numSubleaves = 0, l, sl, ll, pStart, pEnd, p; 30243982b651SMatthew G. Knepley PetscMPIInt rank; 30253982b651SMatthew G. Knepley 30263982b651SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 30273982b651SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 30283982b651SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 30293982b651SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 30303982b651SMatthew G. Knepley ierr = DMPlexGetChart(subdm, NULL, &numSubroots);CHKERRQ(ierr); 30313982b651SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpIS);CHKERRQ(ierr); 30323982b651SMatthew G. Knepley if (subpIS) { 30333982b651SMatthew G. Knepley ierr = ISGetIndices(subpIS, &subpoints);CHKERRQ(ierr); 30343982b651SMatthew G. Knepley ierr = ISGetLocalSize(subpIS, &numSubpoints);CHKERRQ(ierr); 30353982b651SMatthew G. Knepley } 30363982b651SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 30373982b651SMatthew G. Knepley if (numRoots >= 0) { 30383982b651SMatthew G. Knepley ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 30393982b651SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 30403982b651SMatthew G. Knepley newLocalPoints[p].rank = -2; 30413982b651SMatthew G. Knepley newLocalPoints[p].index = -2; 30423982b651SMatthew G. Knepley } 30433982b651SMatthew G. Knepley /* Set subleaves */ 30443982b651SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 30453982b651SMatthew G. Knepley const PetscInt point = localPoints[l]; 30463982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 30473982b651SMatthew G. Knepley 30483982b651SMatthew G. Knepley if (subpoint < 0) continue; 30493982b651SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 30503982b651SMatthew G. Knepley newLocalPoints[point-pStart].index = subpoint; 30513982b651SMatthew G. Knepley ++numSubleaves; 30523982b651SMatthew G. Knepley } 30533982b651SMatthew G. Knepley /* Must put in owned subpoints */ 30543982b651SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 30553982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(p, 0, numSubpoints, subpoints); 30563982b651SMatthew G. Knepley 30573982b651SMatthew G. Knepley if (subpoint < 0) { 30583982b651SMatthew G. Knepley newOwners[p-pStart].rank = -3; 30593982b651SMatthew G. Knepley newOwners[p-pStart].index = -3; 30603982b651SMatthew G. Knepley } else { 30613982b651SMatthew G. Knepley newOwners[p-pStart].rank = rank; 30623982b651SMatthew G. Knepley newOwners[p-pStart].index = subpoint; 30633982b651SMatthew G. Knepley } 30643982b651SMatthew G. Knepley } 30653982b651SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 30663982b651SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 30673982b651SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 30683982b651SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 30693982b651SMatthew G. Knepley ierr = PetscMalloc1(numSubleaves, &slocalPoints);CHKERRQ(ierr); 30703982b651SMatthew G. Knepley ierr = PetscMalloc1(numSubleaves, &sremotePoints);CHKERRQ(ierr); 30713982b651SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 30723982b651SMatthew G. Knepley const PetscInt point = localPoints[l]; 30733982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 30743982b651SMatthew G. Knepley 30753982b651SMatthew G. Knepley if (subpoint < 0) continue; 30763982b651SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 30773982b651SMatthew G. Knepley slocalPoints[sl] = subpoint; 30783982b651SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 30793982b651SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 30803982b651SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 30813982b651SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 30823982b651SMatthew G. Knepley ++sl; 30833982b651SMatthew G. Knepley } 30843982b651SMatthew G. Knepley if (sl + ll != numSubleaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubleaves); 30853982b651SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 30863982b651SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubroots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 30873982b651SMatthew G. Knepley } 30883982b651SMatthew G. Knepley if (subpIS) { 30893982b651SMatthew G. Knepley ierr = ISRestoreIndices(subpIS, &subpoints);CHKERRQ(ierr); 30903982b651SMatthew G. Knepley ierr = ISDestroy(&subpIS);CHKERRQ(ierr); 30913982b651SMatthew G. Knepley } 30923982b651SMatthew G. Knepley } 3093efa14ee0SMatthew G Knepley /* Cleanup */ 3094e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 30950ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 3096e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 3097e6ccafaeSMatthew G Knepley } 3098efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 3099e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3100e6ccafaeSMatthew G Knepley } 3101e6ccafaeSMatthew G Knepley 31023982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 31033982b651SMatthew G. Knepley { 31043982b651SMatthew G. Knepley PetscErrorCode ierr; 31053982b651SMatthew G. Knepley 31063982b651SMatthew G. Knepley PetscFunctionBegin; 3107bec263e5SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, vertexLabel, value, PETSC_FALSE, 1, subdm);CHKERRQ(ierr); 31083982b651SMatthew G. Knepley PetscFunctionReturn(0); 31093982b651SMatthew G. Knepley } 31103982b651SMatthew G. Knepley 3111d0fa310fSMatthew G. Knepley /*@ 3112e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 3113e6ccafaeSMatthew G Knepley 3114e6ccafaeSMatthew G Knepley Input Parameters: 3115e6ccafaeSMatthew G Knepley + dm - The original mesh 3116830e53efSMatthew G. Knepley . vertexLabel - The DMLabel marking vertices contained in the surface 3117830e53efSMatthew G. Knepley - value - The label value to use 3118e6ccafaeSMatthew G Knepley 3119e6ccafaeSMatthew G Knepley Output Parameter: 3120e6ccafaeSMatthew G Knepley . subdm - The surface mesh 3121e6ccafaeSMatthew G Knepley 3122e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3123e6ccafaeSMatthew G Knepley 3124e6ccafaeSMatthew G Knepley Level: developer 3125e6ccafaeSMatthew G Knepley 3126c58f1c22SToby Isaac .seealso: DMPlexGetSubpointMap(), DMGetLabel(), DMLabelSetValue() 3127830e53efSMatthew G. Knepley @*/ 312853156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm) 3129e6ccafaeSMatthew G Knepley { 3130dd2763adSMatthew G. Knepley PetscInt dim, cdim, depth; 3131e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3132e6ccafaeSMatthew G Knepley 3133e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3134e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3135766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 3136c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3137e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 313882f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 3139e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3140c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr); 3141dd2763adSMatthew G. Knepley ierr = DMGetCoordinateDim(dm, &cdim);CHKERRQ(ierr); 3142dd2763adSMatthew G. Knepley ierr = DMSetCoordinateDim(*subdm, cdim);CHKERRQ(ierr); 3143e6ccafaeSMatthew G Knepley if (depth == dim) { 3144830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 3145e6ccafaeSMatthew G Knepley } else { 3146830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 3147e6ccafaeSMatthew G Knepley } 3148e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3149e6ccafaeSMatthew G Knepley } 3150e6ccafaeSMatthew G Knepley 315127c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 3152766ab985SMatthew G. Knepley { 3153766ab985SMatthew G. Knepley MPI_Comm comm; 3154766ab985SMatthew G. Knepley DMLabel subpointMap; 3155766ab985SMatthew G. Knepley IS subvertexIS; 3156766ab985SMatthew G. Knepley const PetscInt *subVertices; 3157fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 3158766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 315987feddfdSMatthew G. Knepley PetscInt cMax, c, f; 3160766ab985SMatthew G. Knepley PetscErrorCode ierr; 3161766ab985SMatthew G. Knepley 3162766ab985SMatthew G. Knepley PetscFunctionBegin; 3163766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 3164766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 3165766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 3166766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 3167766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 316827c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 3169766ab985SMatthew G. Knepley /* Setup chart */ 3170766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 3171766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 3172766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 3173766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 3174766ab985SMatthew G. Knepley /* Set cone sizes */ 3175766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 3176766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 3177766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 3178766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 3179766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 3180766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 3181766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 3182766ab985SMatthew G. Knepley } 3183766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 3184766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 3185766ab985SMatthew G. Knepley } 3186766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 3187766ab985SMatthew G. Knepley /* Create face cones */ 3188766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 318987feddfdSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 319069291d52SBarry Smith ierr = DMGetWorkArray(subdm, maxConeSize, MPIU_INT, (void**) &subface);CHKERRQ(ierr); 3191766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 3192766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 3193766ab985SMatthew G. Knepley const PetscInt subcell = c; 319487feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 319587feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 3196766ab985SMatthew G. Knepley 319787feddfdSMatthew G. Knepley if (cell < cMax) continue; 319887feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 319987feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 320087feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 320187feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 320287feddfdSMatthew G. Knepley } 320387feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 320487feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 320587feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 320627234c99SMatthew G. Knepley /* Not true in parallel 320727234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 320887feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 320987feddfdSMatthew G. Knepley PetscInt negsubcell; 3210766ab985SMatthew G. Knepley 321187feddfdSMatthew G. Knepley if (cells[p] >= cMax) continue; 321287feddfdSMatthew G. Knepley /* I know this is a crap search */ 321387feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 321487feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 3215766ab985SMatthew G. Knepley } 321687feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 321787feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 3218766ab985SMatthew G. Knepley } 321987feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 322087feddfdSMatthew G. Knepley ++newFacePoint; 3221766ab985SMatthew G. Knepley } 322269291d52SBarry Smith ierr = DMRestoreWorkArray(subdm, maxConeSize, MPIU_INT, (void**) &subface);CHKERRQ(ierr); 3223766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 3224766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 3225766ab985SMatthew G. Knepley /* Build coordinates */ 3226766ab985SMatthew G. Knepley { 3227766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 3228766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 3229766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 3230c0e8cf5fSMatthew G. Knepley PetscInt cdim, numComp, coordSize, v; 323124640c55SToby Isaac const char *name; 3232766ab985SMatthew G. Knepley 3233c0e8cf5fSMatthew G. Knepley ierr = DMGetCoordinateDim(dm, &cdim);CHKERRQ(ierr); 323469d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3235766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 323669d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 3237285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 3238285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 3239285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 3240766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 3241766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 3242766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 3243766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 3244766ab985SMatthew G. Knepley PetscInt dof; 3245766ab985SMatthew G. Knepley 3246766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3247766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 3248285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 3249766ab985SMatthew G. Knepley } 3250766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 3251766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 32528b9ced59SLisandro Dalcin ierr = VecCreate(PETSC_COMM_SELF, &subCoordinates);CHKERRQ(ierr); 325324640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 325424640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr); 3255766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 3256c0e8cf5fSMatthew G. Knepley ierr = VecSetBlockSize(subCoordinates, cdim);CHKERRQ(ierr); 32572eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 3258766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 3259766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3260766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 3261766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 3262766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 3263766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 3264766ab985SMatthew G. Knepley 3265766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3266766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 3267766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 3268766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 3269766ab985SMatthew 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); 3270766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 3271766ab985SMatthew G. Knepley } 3272766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3273766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3274766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 3275766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 3276766ab985SMatthew G. Knepley } 3277aca35d17SMatthew G. Knepley /* Build SF */ 3278aca35d17SMatthew G. Knepley CHKMEMQ; 3279aca35d17SMatthew G. Knepley { 3280aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 3281aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 3282bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 3283aca35d17SMatthew G. Knepley const PetscInt *localPoints; 3284bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 328549c26ae4SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 3286bdcf2095SMatthew G. Knepley PetscMPIInt rank; 3287aca35d17SMatthew G. Knepley 3288bdcf2095SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 3289aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 3290aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 3291aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3292aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3293aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 3294aca35d17SMatthew G. Knepley if (numRoots >= 0) { 3295aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 3296dcca6d9dSJed Brown ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 3297bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 3298bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 3299bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 3300bdcf2095SMatthew G. Knepley } 33019e0823b2SMatthew G. Knepley /* Set subleaves */ 3302aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 3303aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 3304bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 3305aca35d17SMatthew G. Knepley 3306aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 3307bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 3308bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 3309bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 3310bdcf2095SMatthew G. Knepley ++numSubLeaves; 3311aca35d17SMatthew G. Knepley } 33129e0823b2SMatthew G. Knepley /* Must put in owned subpoints */ 33139e0823b2SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 33149e0823b2SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 33159e0823b2SMatthew G. Knepley 33169e0823b2SMatthew G. Knepley if (subPoint < 0) { 33179e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = -3; 33189e0823b2SMatthew G. Knepley newOwners[p-pStart].index = -3; 33199e0823b2SMatthew G. Knepley } else { 33209e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = rank; 33219e0823b2SMatthew G. Knepley newOwners[p-pStart].index = subPoint; 33229e0823b2SMatthew G. Knepley } 3323bdcf2095SMatthew G. Knepley } 3324bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3325bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3326bdcf2095SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3327bdcf2095SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3328785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &slocalPoints);CHKERRQ(ierr); 3329785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &sremotePoints);CHKERRQ(ierr); 333049c26ae4SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 3331bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 3332bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 3333aca35d17SMatthew G. Knepley 3334aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 333549c26ae4SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 3336aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 3337bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 3338bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 3339bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 3340bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 3341aca35d17SMatthew G. Knepley ++sl; 3342aca35d17SMatthew G. Knepley } 3343bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 334449c26ae4SMatthew G. Knepley if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 334549c26ae4SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 3346aca35d17SMatthew G. Knepley } 3347aca35d17SMatthew G. Knepley } 3348aca35d17SMatthew G. Knepley CHKMEMQ; 3349766ab985SMatthew G. Knepley /* Cleanup */ 3350766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 3351766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 3352766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 3353766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3354766ab985SMatthew G. Knepley } 3355766ab985SMatthew G. Knepley 33563982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DM subdm) 3357766ab985SMatthew G. Knepley { 33583982b651SMatthew G. Knepley DMLabel label = NULL; 3359766ab985SMatthew G. Knepley PetscErrorCode ierr; 3360766ab985SMatthew G. Knepley 3361766ab985SMatthew G. Knepley PetscFunctionBegin; 3362c58f1c22SToby Isaac if (labelname) {ierr = DMGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 3363bec263e5SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, label, value, PETSC_TRUE, 1, subdm);CHKERRQ(ierr); 3364766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3365766ab985SMatthew G. Knepley } 3366766ab985SMatthew G. Knepley 3367c08575a3SMatthew G. Knepley /*@C 336827c04023SMatthew 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. 3369766ab985SMatthew G. Knepley 3370766ab985SMatthew G. Knepley Input Parameters: 3371766ab985SMatthew G. Knepley + dm - The original mesh 337227c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 33737afc1a8bSJed Brown . label - A label name, or NULL 337427c04023SMatthew G. Knepley - value - A label value 3375766ab985SMatthew G. Knepley 3376766ab985SMatthew G. Knepley Output Parameter: 3377766ab985SMatthew G. Knepley . subdm - The surface mesh 3378766ab985SMatthew G. Knepley 3379766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3380766ab985SMatthew G. Knepley 3381766ab985SMatthew G. Knepley Level: developer 3382766ab985SMatthew G. Knepley 3383766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 3384c08575a3SMatthew G. Knepley @*/ 338527c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 3386766ab985SMatthew G. Knepley { 3387c0e8cf5fSMatthew G. Knepley PetscInt dim, cdim, depth; 3388766ab985SMatthew G. Knepley PetscErrorCode ierr; 3389766ab985SMatthew G. Knepley 3390766ab985SMatthew G. Knepley PetscFunctionBegin; 3391766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 339227c04023SMatthew G. Knepley PetscValidPointer(subdm, 5); 3393c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3394766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3395766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 3396766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3397c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr); 3398c0e8cf5fSMatthew G. Knepley ierr = DMGetCoordinateDim(dm, &cdim);CHKERRQ(ierr); 3399c0e8cf5fSMatthew G. Knepley ierr = DMSetCoordinateDim(*subdm, cdim);CHKERRQ(ierr); 3400766ab985SMatthew G. Knepley if (depth == dim) { 3401b3154360SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr); 3402766ab985SMatthew G. Knepley } else { 340327c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 3404e6ccafaeSMatthew G Knepley } 3405e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3406e6ccafaeSMatthew G Knepley } 3407e6ccafaeSMatthew G Knepley 3408bec263e5SMatthew G. Knepley /*@ 3409bec263e5SMatthew G. Knepley DMPlexFilter - Extract a subset of mesh cells defined by a label as a separate mesh 3410bec263e5SMatthew G. Knepley 3411bec263e5SMatthew G. Knepley Input Parameters: 3412bec263e5SMatthew G. Knepley + dm - The original mesh 3413bec263e5SMatthew G. Knepley . cellLabel - The DMLabel marking cells contained in the new mesh 3414bec263e5SMatthew G. Knepley - value - The label value to use 3415bec263e5SMatthew G. Knepley 3416bec263e5SMatthew G. Knepley Output Parameter: 3417bec263e5SMatthew G. Knepley . subdm - The new mesh 3418bec263e5SMatthew G. Knepley 3419bec263e5SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3420bec263e5SMatthew G. Knepley 3421bec263e5SMatthew G. Knepley Level: developer 3422bec263e5SMatthew G. Knepley 3423c58f1c22SToby Isaac .seealso: DMPlexGetSubpointMap(), DMGetLabel(), DMLabelSetValue() 3424bec263e5SMatthew G. Knepley @*/ 3425bec263e5SMatthew G. Knepley PetscErrorCode DMPlexFilter(DM dm, DMLabel cellLabel, PetscInt value, DM *subdm) 3426bec263e5SMatthew G. Knepley { 3427bec263e5SMatthew G. Knepley PetscInt dim; 3428bec263e5SMatthew G. Knepley PetscErrorCode ierr; 3429bec263e5SMatthew G. Knepley 3430bec263e5SMatthew G. Knepley PetscFunctionBegin; 3431bec263e5SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3432bec263e5SMatthew G. Knepley PetscValidPointer(subdm, 3); 3433bec263e5SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3434bec263e5SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject) dm), subdm);CHKERRQ(ierr); 3435bec263e5SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3436bec263e5SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim);CHKERRQ(ierr); 3437bec263e5SMatthew G. Knepley /* Extract submesh in place, could be empty on some procs, could have inconsistency if procs do not both extract a shared cell */ 3438bec263e5SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, cellLabel, value, PETSC_FALSE, 0, *subdm);CHKERRQ(ierr); 3439bec263e5SMatthew G. Knepley PetscFunctionReturn(0); 3440bec263e5SMatthew G. Knepley } 3441bec263e5SMatthew G. Knepley 344264beef6dSMatthew G. Knepley /*@ 344364beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 344464beef6dSMatthew G. Knepley 344564beef6dSMatthew G. Knepley Input Parameter: 344664beef6dSMatthew G. Knepley . dm - The submesh DM 344764beef6dSMatthew G. Knepley 344864beef6dSMatthew G. Knepley Output Parameter: 344964beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 345064beef6dSMatthew G. Knepley 345164beef6dSMatthew G. Knepley Level: developer 345264beef6dSMatthew G. Knepley 345364beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 345464beef6dSMatthew G. Knepley @*/ 3455e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 3456e6ccafaeSMatthew G Knepley { 3457e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3458e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3459e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 346065663942SMatthew G. Knepley *subpointMap = ((DM_Plex*) dm->data)->subpointMap; 3461e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3462e6ccafaeSMatthew G Knepley } 3463e6ccafaeSMatthew G Knepley 3464c08575a3SMatthew G. Knepley /*@ 3465c08575a3SMatthew G. Knepley DMPlexSetSubpointMap - Sets the DMLabel with point dimension as values 3466c08575a3SMatthew G. Knepley 3467c08575a3SMatthew G. Knepley Input Parameters: 3468c08575a3SMatthew G. Knepley + dm - The submesh DM 3469c08575a3SMatthew G. Knepley - subpointMap - The DMLabel of all the points from the original mesh in this submesh 3470c08575a3SMatthew G. Knepley 3471c08575a3SMatthew G. Knepley Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() 3472c08575a3SMatthew G. Knepley 3473c08575a3SMatthew G. Knepley Level: developer 3474c08575a3SMatthew G. Knepley 3475c08575a3SMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 3476c08575a3SMatthew G. Knepley @*/ 3477e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 3478e6ccafaeSMatthew G Knepley { 3479e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 3480285d324eSMatthew G. Knepley DMLabel tmp; 3481e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3482e6ccafaeSMatthew G Knepley 3483e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3484e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3485285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 3486e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 3487285d324eSMatthew G. Knepley ++mesh->subpointMap->refct; 3488285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 3489e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3490e6ccafaeSMatthew G Knepley } 3491e6ccafaeSMatthew G Knepley 349264beef6dSMatthew G. Knepley /*@ 3493e6ccafaeSMatthew G Knepley DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 3494e6ccafaeSMatthew G Knepley 3495e6ccafaeSMatthew G Knepley Input Parameter: 3496e6ccafaeSMatthew G Knepley . dm - The submesh DM 3497e6ccafaeSMatthew G Knepley 3498e6ccafaeSMatthew G Knepley Output Parameter: 34990298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 3500e6ccafaeSMatthew G Knepley 35013982b651SMatthew G. Knepley Note: This IS is guaranteed to be sorted by the construction of the submesh 350264beef6dSMatthew G. Knepley 350364beef6dSMatthew G. Knepley Level: developer 350464beef6dSMatthew G. Knepley 350564beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 350664beef6dSMatthew G. Knepley @*/ 3507e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 3508e6ccafaeSMatthew G Knepley { 350982f516ccSBarry Smith MPI_Comm comm; 3510e6ccafaeSMatthew G Knepley DMLabel subpointMap; 3511e6ccafaeSMatthew G Knepley IS is; 3512e6ccafaeSMatthew G Knepley const PetscInt *opoints; 3513e6ccafaeSMatthew G Knepley PetscInt *points, *depths; 3514e6ccafaeSMatthew G Knepley PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 3515e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3516e6ccafaeSMatthew G Knepley 3517e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3518e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3519e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 352082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 35210298fd71SBarry Smith *subpointIS = NULL; 3522e6ccafaeSMatthew G Knepley ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 3523e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3524fed694aaSMatthew G. Knepley if (subpointMap && depth >= 0) { 3525e6ccafaeSMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3526e6ccafaeSMatthew G Knepley if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 352769291d52SBarry Smith ierr = DMGetWorkArray(dm, depth+1, MPIU_INT, &depths);CHKERRQ(ierr); 3528e6ccafaeSMatthew G Knepley depths[0] = depth; 3529e6ccafaeSMatthew G Knepley depths[1] = 0; 3530e6ccafaeSMatthew G Knepley for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 3531785e854fSJed Brown ierr = PetscMalloc1(pEnd, &points);CHKERRQ(ierr); 3532e6ccafaeSMatthew G Knepley for(d = 0, off = 0; d <= depth; ++d) { 3533e6ccafaeSMatthew G Knepley const PetscInt dep = depths[d]; 3534e6ccafaeSMatthew G Knepley 3535e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 3536e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 35371e21b6fdSMatthew G Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 3538e6ccafaeSMatthew 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); 3539e6ccafaeSMatthew G Knepley } else { 35401e21b6fdSMatthew G Knepley if (!n) { 35411e21b6fdSMatthew G Knepley if (d == 0) { 35421e21b6fdSMatthew G Knepley /* Missing cells */ 35431e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 35441e21b6fdSMatthew G Knepley } else { 35451e21b6fdSMatthew G Knepley /* Missing faces */ 35461e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 35471e21b6fdSMatthew G Knepley } 35481e21b6fdSMatthew G Knepley } 3549e6ccafaeSMatthew G Knepley } 3550e6ccafaeSMatthew G Knepley if (n) { 3551e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 3552e6ccafaeSMatthew G Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 3553e6ccafaeSMatthew G Knepley for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 3554e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 3555e6ccafaeSMatthew G Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 3556e6ccafaeSMatthew G Knepley } 3557e6ccafaeSMatthew G Knepley } 355869291d52SBarry Smith ierr = DMRestoreWorkArray(dm, depth+1, MPIU_INT, &depths);CHKERRQ(ierr); 3559e6ccafaeSMatthew G Knepley if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 3560fed694aaSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 3561e6ccafaeSMatthew G Knepley } 3562e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3563e6ccafaeSMatthew G Knepley } 3564