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; 49b0bf5782SToby Isaac const PetscInt *values; 50b0bf5782SToby Isaac PetscInt numValues, v, cStart, cEnd; 51*26279d81SSanderA PetscMPIInt size; 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); 86*26279d81SSanderA ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 87*26279d81SSanderA if (size != 1) { 88*26279d81SSanderA PetscSF sfPoint; 89*26279d81SSanderA DMLabel lblRoots, lblLeaves; 90*26279d81SSanderA IS valueIS, pointIS; 91*26279d81SSanderA const PetscInt *values; 92*26279d81SSanderA PetscInt numValues, v; 93*26279d81SSanderA PetscErrorCode ierr; 94*26279d81SSanderA 95*26279d81SSanderA ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 96*26279d81SSanderA /* Pull point contributions from remote leaves into local roots */ 97*26279d81SSanderA ierr = DMLabelGather(label, sfPoint, &lblLeaves);CHKERRQ(ierr); 98*26279d81SSanderA ierr = DMLabelGetValueIS(lblLeaves, &valueIS);CHKERRQ(ierr); 99*26279d81SSanderA ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 100*26279d81SSanderA ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 101*26279d81SSanderA for (v = 0; v < numValues; ++v) { 102*26279d81SSanderA const PetscInt value = values[v]; 103*26279d81SSanderA 104*26279d81SSanderA ierr = DMLabelGetStratumIS(lblLeaves, value, &pointIS);CHKERRQ(ierr); 105*26279d81SSanderA ierr = DMLabelInsertIS(label, pointIS, value);CHKERRQ(ierr); 106*26279d81SSanderA ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 107*26279d81SSanderA } 108*26279d81SSanderA ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 109*26279d81SSanderA ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 110*26279d81SSanderA ierr = DMLabelDestroy(&lblLeaves);CHKERRQ(ierr); 111*26279d81SSanderA /* Push point contributions from roots into remote leaves */ 112*26279d81SSanderA ierr = DMLabelDistribute(label, sfPoint, &lblRoots);CHKERRQ(ierr); 113*26279d81SSanderA ierr = DMLabelGetValueIS(lblRoots, &valueIS);CHKERRQ(ierr); 114*26279d81SSanderA ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 115*26279d81SSanderA ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 116*26279d81SSanderA for (v = 0; v < numValues; ++v) { 117*26279d81SSanderA const PetscInt value = values[v]; 118*26279d81SSanderA 119*26279d81SSanderA ierr = DMLabelGetStratumIS(lblRoots, value, &pointIS);CHKERRQ(ierr); 120*26279d81SSanderA ierr = DMLabelInsertIS(label, pointIS, value);CHKERRQ(ierr); 121*26279d81SSanderA ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 122*26279d81SSanderA } 123*26279d81SSanderA ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 124*26279d81SSanderA ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 125*26279d81SSanderA ierr = DMLabelDestroy(&lblRoots);CHKERRQ(ierr); 126*26279d81SSanderA } 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; 331cd0c2139SMatthew G Knepley PetscErrorCode ierr; 332cd0c2139SMatthew G Knepley 333cd0c2139SMatthew G Knepley PetscFunctionBegin; 334cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 335cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 336cd0c2139SMatthew G Knepley /* Step 1: Expand chart */ 337cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3380974a383SToby Isaac pEnd = DMPlexShiftPoint_Internal(pEnd,depth,depthShift); 339cd0c2139SMatthew G Knepley ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr); 340cd0c2139SMatthew G Knepley /* Step 2: Set cone and support sizes */ 341cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 342cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 343cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 3442582d50cSToby Isaac PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthShift); 345cd0c2139SMatthew G Knepley PetscInt size; 346cd0c2139SMatthew G Knepley 347cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 348cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr); 349cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 350cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr); 351cd0c2139SMatthew G Knepley } 352cd0c2139SMatthew G Knepley } 353cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 354cd0c2139SMatthew G Knepley } 355cd0c2139SMatthew G Knepley 356cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew) 357cd0c2139SMatthew G Knepley { 3582582d50cSToby Isaac PetscInt *newpoints; 3592582d50cSToby Isaac PetscInt depth = 0, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, pStart, pEnd, p; 360cd0c2139SMatthew G Knepley PetscErrorCode ierr; 361cd0c2139SMatthew G Knepley 362cd0c2139SMatthew G Knepley PetscFunctionBegin; 363cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 364cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 365cd0c2139SMatthew G Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 366dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dmNew, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 3672582d50cSToby Isaac ierr = PetscMalloc1(PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),&newpoints);CHKERRQ(ierr); 368cd0c2139SMatthew G Knepley /* Step 5: Set cones and supports */ 369cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 370cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 371cd0c2139SMatthew G Knepley const PetscInt *points = NULL, *orientations = NULL; 3722582d50cSToby Isaac PetscInt size,sizeNew, i, newp = DMPlexShiftPoint_Internal(p, depth, depthShift); 373cd0c2139SMatthew G Knepley 374cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 375cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr); 376cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr); 377cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 3782582d50cSToby Isaac newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthShift); 379cd0c2139SMatthew G Knepley } 380cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr); 381cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr); 382cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 383dcbb62e8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmNew, newp, &sizeNew);CHKERRQ(ierr); 384cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr); 385cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 3862582d50cSToby Isaac newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthShift); 387cd0c2139SMatthew G Knepley } 388dcbb62e8SMatthew G. Knepley for (i = size; i < sizeNew; ++i) newpoints[i] = 0; 389cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr); 390cd0c2139SMatthew G Knepley } 3912582d50cSToby Isaac ierr = PetscFree(newpoints);CHKERRQ(ierr); 392cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 393cd0c2139SMatthew G Knepley } 394cd0c2139SMatthew G Knepley 395cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew) 396cd0c2139SMatthew G Knepley { 397cd0c2139SMatthew G Knepley PetscSection coordSection, newCoordSection; 398cd0c2139SMatthew G Knepley Vec coordinates, newCoordinates; 399cd0c2139SMatthew G Knepley PetscScalar *coords, *newCoords; 400f2b8cce1SMatthew G. Knepley PetscInt coordSize, sStart, sEnd; 401f2b8cce1SMatthew G. Knepley PetscInt dim, depth = 0, cStart, cEnd, cStartNew, cEndNew, c, vStart, vEnd, vStartNew, vEndNew, v; 402f2b8cce1SMatthew G. Knepley PetscBool hasCells; 403cd0c2139SMatthew G Knepley PetscErrorCode ierr; 404cd0c2139SMatthew G Knepley 405cd0c2139SMatthew G Knepley PetscFunctionBegin; 406f2b8cce1SMatthew G. Knepley ierr = DMGetCoordinateDim(dm, &dim);CHKERRQ(ierr); 407cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 408cd0c2139SMatthew G Knepley /* Step 8: Convert coordinates */ 409cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 410f2b8cce1SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 411cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr); 412f2b8cce1SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dmNew, 0, &cStartNew, &cEndNew);CHKERRQ(ierr); 41369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 414cd0c2139SMatthew G Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr); 415cd0c2139SMatthew G Knepley ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr); 416cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr); 417f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetChart(coordSection, &sStart, &sEnd);CHKERRQ(ierr); 418f2b8cce1SMatthew G. Knepley hasCells = sStart == cStart ? PETSC_TRUE : PETSC_FALSE; 419f2b8cce1SMatthew G. Knepley ierr = PetscSectionSetChart(newCoordSection, hasCells ? cStartNew : vStartNew, vEndNew);CHKERRQ(ierr); 420f2b8cce1SMatthew G. Knepley if (hasCells) { 421f2b8cce1SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 422f2b8cce1SMatthew G. Knepley PetscInt cNew = DMPlexShiftPoint_Internal(c, depth, depthShift), dof; 423f2b8cce1SMatthew G. Knepley 424f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, c, &dof);CHKERRQ(ierr); 425f2b8cce1SMatthew G. Knepley ierr = PetscSectionSetDof(newCoordSection, cNew, dof);CHKERRQ(ierr); 426f2b8cce1SMatthew G. Knepley ierr = PetscSectionSetFieldDof(newCoordSection, cNew, 0, dof);CHKERRQ(ierr); 427f2b8cce1SMatthew G. Knepley } 428f2b8cce1SMatthew G. Knepley } 429cd0c2139SMatthew G Knepley for (v = vStartNew; v < vEndNew; ++v) { 430cd0c2139SMatthew G Knepley ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr); 431cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr); 432cd0c2139SMatthew G Knepley } 433cd0c2139SMatthew G Knepley ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr); 43446e270d4SMatthew G. Knepley ierr = DMSetCoordinateSection(dmNew, PETSC_DETERMINE, newCoordSection);CHKERRQ(ierr); 435cd0c2139SMatthew G Knepley ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr); 4368b9ced59SLisandro Dalcin ierr = VecCreate(PETSC_COMM_SELF, &newCoordinates);CHKERRQ(ierr); 437cd0c2139SMatthew G Knepley ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr); 438cd0c2139SMatthew G Knepley ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 4394e90ef8eSMatthew G. Knepley ierr = VecSetBlockSize(newCoordinates, dim);CHKERRQ(ierr); 4402eb5907fSJed Brown ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr); 441cd0c2139SMatthew G Knepley ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr); 442cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 443cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 444cd0c2139SMatthew G Knepley ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr); 445f2b8cce1SMatthew G. Knepley if (hasCells) { 446f2b8cce1SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 447f2b8cce1SMatthew G. Knepley PetscInt cNew = DMPlexShiftPoint_Internal(c, depth, depthShift), dof, off, noff, d; 448f2b8cce1SMatthew G. Knepley 449f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, c, &dof);CHKERRQ(ierr); 450f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, c, &off);CHKERRQ(ierr); 451f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetOffset(newCoordSection, cNew, &noff);CHKERRQ(ierr); 452f2b8cce1SMatthew G. Knepley for (d = 0; d < dof; ++d) newCoords[noff+d] = coords[off+d]; 453f2b8cce1SMatthew G. Knepley } 454f2b8cce1SMatthew G. Knepley } 455cd0c2139SMatthew G Knepley for (v = vStart; v < vEnd; ++v) { 456cd0c2139SMatthew G Knepley PetscInt dof, off, noff, d; 457cd0c2139SMatthew G Knepley 458cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 459cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 4602582d50cSToby Isaac ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthShift), &noff);CHKERRQ(ierr); 461f2b8cce1SMatthew G. Knepley for (d = 0; d < dof; ++d) newCoords[noff+d] = coords[off+d]; 462cd0c2139SMatthew G Knepley } 463cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 464cd0c2139SMatthew G Knepley ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr); 465cd0c2139SMatthew G Knepley ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 466cd0c2139SMatthew G Knepley ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr); 467cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 468cd0c2139SMatthew G Knepley } 469cd0c2139SMatthew G Knepley 470cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew) 471cd0c2139SMatthew G Knepley { 4722582d50cSToby Isaac PetscInt depth = 0; 473cd0c2139SMatthew G Knepley PetscSF sfPoint, sfPointNew; 474cd0c2139SMatthew G Knepley const PetscSFNode *remotePoints; 475cd0c2139SMatthew G Knepley PetscSFNode *gremotePoints; 476cd0c2139SMatthew G Knepley const PetscInt *localPoints; 477cd0c2139SMatthew G Knepley PetscInt *glocalPoints, *newLocation, *newRemoteLocation; 478cd0c2139SMatthew G Knepley PetscInt numRoots, numLeaves, l, pStart, pEnd, totShift = 0; 479cd0c2139SMatthew G Knepley PetscErrorCode ierr; 480cd0c2139SMatthew G Knepley 481cd0c2139SMatthew G Knepley PetscFunctionBegin; 482cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 483cd0c2139SMatthew G Knepley /* Step 9: Convert pointSF */ 484cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 485cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr); 486cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 487cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 4886e21efdcSToby Isaac totShift = DMPlexShiftPoint_Internal(pEnd,depth,depthShift) - pEnd; 489cd0c2139SMatthew G Knepley if (numRoots >= 0) { 490dcca6d9dSJed Brown ierr = PetscMalloc2(numRoots,&newLocation,pEnd-pStart,&newRemoteLocation);CHKERRQ(ierr); 4912582d50cSToby Isaac for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthShift); 492cd0c2139SMatthew G Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 493cd0c2139SMatthew G Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 494785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &glocalPoints);CHKERRQ(ierr); 495785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &gremotePoints);CHKERRQ(ierr); 496cd0c2139SMatthew G Knepley for (l = 0; l < numLeaves; ++l) { 4972582d50cSToby Isaac glocalPoints[l] = DMPlexShiftPoint_Internal(localPoints[l], depth, depthShift); 498cd0c2139SMatthew G Knepley gremotePoints[l].rank = remotePoints[l].rank; 499cd0c2139SMatthew G Knepley gremotePoints[l].index = newRemoteLocation[localPoints[l]]; 500cd0c2139SMatthew G Knepley } 501cd0c2139SMatthew G Knepley ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr); 502cd0c2139SMatthew G Knepley ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 503cd0c2139SMatthew G Knepley } 504cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 505cd0c2139SMatthew G Knepley } 506cd0c2139SMatthew G Knepley 507cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew) 508cd0c2139SMatthew G Knepley { 509cd0c2139SMatthew G Knepley PetscSF sfPoint; 510cd0c2139SMatthew G Knepley DMLabel vtkLabel, ghostLabel; 511cd0c2139SMatthew G Knepley const PetscSFNode *leafRemote; 512cd0c2139SMatthew G Knepley const PetscInt *leafLocal; 5132582d50cSToby Isaac PetscInt depth = 0, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f; 514cd0c2139SMatthew G Knepley PetscMPIInt rank; 515cd0c2139SMatthew G Knepley PetscErrorCode ierr; 516cd0c2139SMatthew G Knepley 517cd0c2139SMatthew G Knepley PetscFunctionBegin; 518cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 519cd0c2139SMatthew G Knepley /* Step 10: Convert labels */ 520c58f1c22SToby Isaac ierr = DMGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 521cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 522cd0c2139SMatthew G Knepley DMLabel label, newlabel; 523cd0c2139SMatthew G Knepley const char *lname; 524cd0c2139SMatthew G Knepley PetscBool isDepth; 525cd0c2139SMatthew G Knepley IS valueIS; 526cd0c2139SMatthew G Knepley const PetscInt *values; 527cd0c2139SMatthew G Knepley PetscInt numValues, val; 528cd0c2139SMatthew G Knepley 529c58f1c22SToby Isaac ierr = DMGetLabelName(dm, l, &lname);CHKERRQ(ierr); 530cd0c2139SMatthew G Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 531cd0c2139SMatthew G Knepley if (isDepth) continue; 532c58f1c22SToby Isaac ierr = DMCreateLabel(dmNew, lname);CHKERRQ(ierr); 533c58f1c22SToby Isaac ierr = DMGetLabel(dm, lname, &label);CHKERRQ(ierr); 534c58f1c22SToby Isaac ierr = DMGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr); 53564a6a1a4SToby Isaac ierr = DMLabelGetDefaultValue(label,&val);CHKERRQ(ierr); 53664a6a1a4SToby Isaac ierr = DMLabelSetDefaultValue(newlabel,val);CHKERRQ(ierr); 537cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 538cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 539cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 540cd0c2139SMatthew G Knepley for (val = 0; val < numValues; ++val) { 541cd0c2139SMatthew G Knepley IS pointIS; 542cd0c2139SMatthew G Knepley const PetscInt *points; 543cd0c2139SMatthew G Knepley PetscInt numPoints, p; 544cd0c2139SMatthew G Knepley 545cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 546cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 547cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 548cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 5492582d50cSToby Isaac const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthShift); 550cd0c2139SMatthew G Knepley 551cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr); 552cd0c2139SMatthew G Knepley } 553cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 554cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 555cd0c2139SMatthew G Knepley } 556cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 557cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 558cd0c2139SMatthew G Knepley } 559cd0c2139SMatthew G Knepley /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */ 560cd0c2139SMatthew G Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 561cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 562cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 563cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr); 564c58f1c22SToby Isaac ierr = DMCreateLabel(dmNew, "vtk");CHKERRQ(ierr); 565c58f1c22SToby Isaac ierr = DMCreateLabel(dmNew, "ghost");CHKERRQ(ierr); 566c58f1c22SToby Isaac ierr = DMGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr); 567c58f1c22SToby Isaac ierr = DMGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr); 568cd0c2139SMatthew G Knepley for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { 569cd0c2139SMatthew G Knepley for (; c < leafLocal[l] && c < cEnd; ++c) { 570cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 571cd0c2139SMatthew G Knepley } 572cd0c2139SMatthew G Knepley if (leafLocal[l] >= cEnd) break; 573cd0c2139SMatthew G Knepley if (leafRemote[l].rank == rank) { 574cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 575cd0c2139SMatthew G Knepley } else { 576cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr); 577cd0c2139SMatthew G Knepley } 578cd0c2139SMatthew G Knepley } 579cd0c2139SMatthew G Knepley for (; c < cEnd; ++c) { 580cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 581cd0c2139SMatthew G Knepley } 582cd0c2139SMatthew G Knepley if (0) { 583cd0c2139SMatthew G Knepley ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 584cd0c2139SMatthew G Knepley } 585cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr); 586cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 587cd0c2139SMatthew G Knepley PetscInt numCells; 588cd0c2139SMatthew G Knepley 589cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr); 590cd0c2139SMatthew G Knepley if (numCells < 2) { 591cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr); 592cd0c2139SMatthew G Knepley } else { 593cd0c2139SMatthew G Knepley const PetscInt *cells = NULL; 594cd0c2139SMatthew G Knepley PetscInt vA, vB; 595cd0c2139SMatthew G Knepley 596cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr); 597cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr); 598cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr); 59990664b96SToby Isaac if (vA != 1 && vB != 1) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);} 600cd0c2139SMatthew G Knepley } 601cd0c2139SMatthew G Knepley } 602cd0c2139SMatthew G Knepley if (0) { 603cd0c2139SMatthew G Knepley ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 604cd0c2139SMatthew G Knepley } 605cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 606cd0c2139SMatthew G Knepley } 607cd0c2139SMatthew G Knepley 608ca04dac2SToby Isaac static PetscErrorCode DMPlexShiftTree_Internal(DM dm, PetscInt depthShift[], DM dmNew) 609ca04dac2SToby Isaac { 610ca04dac2SToby Isaac DM refTree; 611ca04dac2SToby Isaac PetscSection pSec; 612ca04dac2SToby Isaac PetscInt *parents, *childIDs; 613ca04dac2SToby Isaac PetscErrorCode ierr; 614ca04dac2SToby Isaac 615ca04dac2SToby Isaac PetscFunctionBegin; 616ca04dac2SToby Isaac ierr = DMPlexGetReferenceTree(dm,&refTree);CHKERRQ(ierr); 617ca04dac2SToby Isaac ierr = DMPlexSetReferenceTree(dmNew,refTree);CHKERRQ(ierr); 618ca04dac2SToby Isaac ierr = DMPlexGetTree(dm,&pSec,&parents,&childIDs,NULL,NULL);CHKERRQ(ierr); 619ca04dac2SToby Isaac if (pSec) { 6202582d50cSToby Isaac PetscInt p, pStart, pEnd, *parentsShifted, pStartShifted, pEndShifted, depth; 621fb4630b5SToby Isaac PetscInt *childIDsShifted; 622ca04dac2SToby Isaac PetscSection pSecShifted; 623ca04dac2SToby Isaac 624ca04dac2SToby Isaac ierr = PetscSectionGetChart(pSec,&pStart,&pEnd);CHKERRQ(ierr); 625ca04dac2SToby Isaac ierr = DMPlexGetDepth(dm,&depth);CHKERRQ(ierr); 6262582d50cSToby Isaac pStartShifted = DMPlexShiftPoint_Internal(pStart,depth,depthShift); 6272582d50cSToby Isaac pEndShifted = DMPlexShiftPoint_Internal(pEnd,depth,depthShift); 628fb4630b5SToby Isaac ierr = PetscMalloc2(pEndShifted - pStartShifted,&parentsShifted,pEndShifted-pStartShifted,&childIDsShifted);CHKERRQ(ierr); 629ca04dac2SToby Isaac ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dmNew),&pSecShifted);CHKERRQ(ierr); 630ca04dac2SToby Isaac ierr = PetscSectionSetChart(pSecShifted,pStartShifted,pEndShifted);CHKERRQ(ierr); 631ca04dac2SToby Isaac for (p = pStartShifted; p < pEndShifted; p++) { 632fb4630b5SToby Isaac /* start off assuming no children */ 633fb4630b5SToby Isaac ierr = PetscSectionSetDof(pSecShifted,p,0);CHKERRQ(ierr); 634fb4630b5SToby Isaac } 635fb4630b5SToby Isaac for (p = pStart; p < pEnd; p++) { 636fb4630b5SToby Isaac PetscInt dof; 637fb4630b5SToby Isaac PetscInt pNew = DMPlexShiftPoint_Internal(p,depth,depthShift); 638ca04dac2SToby Isaac 639ca04dac2SToby Isaac ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr); 640fb4630b5SToby Isaac ierr = PetscSectionSetDof(pSecShifted,pNew,dof);CHKERRQ(ierr); 641ca04dac2SToby Isaac } 642ca04dac2SToby Isaac ierr = PetscSectionSetUp(pSecShifted);CHKERRQ(ierr); 643fb4630b5SToby Isaac for (p = pStart; p < pEnd; p++) { 644fb4630b5SToby Isaac PetscInt dof; 645fb4630b5SToby Isaac PetscInt pNew = DMPlexShiftPoint_Internal(p,depth,depthShift); 646fb4630b5SToby Isaac 647fb4630b5SToby Isaac ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr); 648fb4630b5SToby Isaac if (dof) { 649fb4630b5SToby Isaac PetscInt off, offNew; 650fb4630b5SToby Isaac 651fb4630b5SToby Isaac ierr = PetscSectionGetOffset(pSec,p,&off);CHKERRQ(ierr); 652fb4630b5SToby Isaac ierr = PetscSectionGetOffset(pSecShifted,pNew,&offNew);CHKERRQ(ierr); 653fb4630b5SToby Isaac parentsShifted[offNew] = DMPlexShiftPoint_Internal(parents[off],depth,depthShift); 654fb4630b5SToby Isaac childIDsShifted[offNew] = childIDs[off]; 655fb4630b5SToby Isaac } 656fb4630b5SToby Isaac } 657fb4630b5SToby Isaac ierr = DMPlexSetTree(dmNew,pSecShifted,parentsShifted,childIDsShifted);CHKERRQ(ierr); 658fb4630b5SToby Isaac ierr = PetscFree2(parentsShifted,childIDsShifted);CHKERRQ(ierr); 659e6885bbbSToby Isaac ierr = PetscSectionDestroy(&pSecShifted);CHKERRQ(ierr); 660ca04dac2SToby Isaac } 661ca04dac2SToby Isaac PetscFunctionReturn(0); 662ca04dac2SToby Isaac } 663ca04dac2SToby Isaac 664cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm) 665cd0c2139SMatthew G Knepley { 666da97024aSMatthew G. Knepley PetscSF sf; 667cd0c2139SMatthew G Knepley IS valueIS; 668da97024aSMatthew G. Knepley const PetscInt *values, *leaves; 669cd0c2139SMatthew G Knepley PetscInt *depthShift; 6702582d50cSToby Isaac PetscInt d, depth = 0, nleaves, loc, Ng, numFS, fs, fStart, fEnd, ghostCell, cEnd, c; 671cd0c2139SMatthew G Knepley PetscErrorCode ierr; 672cd0c2139SMatthew G Knepley 673cd0c2139SMatthew G Knepley PetscFunctionBegin; 674da97024aSMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 675da97024aSMatthew G. Knepley ierr = PetscSFGetGraph(sf, NULL, &nleaves, &leaves, NULL);CHKERRQ(ierr); 676da97024aSMatthew G. Knepley nleaves = PetscMax(0, nleaves); 67746c796b9SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 678cd0c2139SMatthew G Knepley /* Count ghost cells */ 679cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 680cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr); 681cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 6824a6cfa73SMatthew G. Knepley Ng = 0; 683cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 68446c796b9SMatthew G. Knepley IS faceIS; 68546c796b9SMatthew G. Knepley const PetscInt *faces; 68646c796b9SMatthew G. Knepley PetscInt numFaces, f, numBdFaces = 0; 687cd0c2139SMatthew G Knepley 68846c796b9SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 68946c796b9SMatthew G. Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 69046c796b9SMatthew G. Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 69146c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 692ca04dac2SToby Isaac PetscInt numChildren; 693ca04dac2SToby Isaac 694da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 695ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 696ca04dac2SToby Isaac /* non-local and ancestors points don't get to register ghosts */ 697ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 69846c796b9SMatthew G. Knepley if ((faces[f] >= fStart) && (faces[f] < fEnd)) ++numBdFaces; 69946c796b9SMatthew G. Knepley } 7004a6cfa73SMatthew G. Knepley Ng += numBdFaces; 70146c796b9SMatthew G. Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 702cd0c2139SMatthew G Knepley } 703cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 7042582d50cSToby Isaac ierr = PetscMalloc1(2*(depth+1), &depthShift);CHKERRQ(ierr); 7052582d50cSToby Isaac for (d = 0; d <= depth; d++) { 70659eef20bSToby Isaac PetscInt dEnd; 7072582d50cSToby Isaac 7080974a383SToby Isaac ierr = DMPlexGetDepthStratum(dm,d,NULL,&dEnd);CHKERRQ(ierr); 70959eef20bSToby Isaac depthShift[2*d] = dEnd; 7102582d50cSToby Isaac depthShift[2*d+1] = 0; 7112582d50cSToby Isaac } 7122582d50cSToby Isaac if (depth >= 0) depthShift[2*depth+1] = Ng; 7132582d50cSToby Isaac ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift);CHKERRQ(ierr); 714cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 715cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 716cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 7175acea1aeSMatthew G. Knepley ierr = DMPlexSetHybridBounds(gdm, cEnd, PETSC_DETERMINE, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 7184a6cfa73SMatthew G. Knepley for (c = cEnd; c < cEnd + Ng; ++c) { 719cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr); 720cd0c2139SMatthew G Knepley } 721cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 722cd0c2139SMatthew G Knepley IS faceIS; 723cd0c2139SMatthew G Knepley const PetscInt *faces; 724cd0c2139SMatthew G Knepley PetscInt numFaces, f; 725cd0c2139SMatthew G Knepley 726cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 727cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 728cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 729cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 730ca04dac2SToby Isaac PetscInt size, numChildren; 731cd0c2139SMatthew G Knepley 732da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 733ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 734ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 73546c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 736cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr); 7374553fd90SToby Isaac if (size != 1) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "DM has boundary face %d with %d support cells", faces[f], size); 7384a6cfa73SMatthew G. Knepley ierr = DMPlexSetSupportSize(gdm, faces[f] + Ng, 2);CHKERRQ(ierr); 739cd0c2139SMatthew G Knepley } 740cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 741cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 742cd0c2139SMatthew G Knepley } 743cd0c2139SMatthew G Knepley /* Step 4: Setup ghosted DM */ 744cd0c2139SMatthew G Knepley ierr = DMSetUp(gdm);CHKERRQ(ierr); 745cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 746cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 747cd0c2139SMatthew G Knepley ghostCell = cEnd; 748cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 749cd0c2139SMatthew G Knepley IS faceIS; 750cd0c2139SMatthew G Knepley const PetscInt *faces; 751cd0c2139SMatthew G Knepley PetscInt numFaces, f; 752cd0c2139SMatthew G Knepley 753cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 754cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 755cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 75646c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 757ca04dac2SToby Isaac PetscInt newFace = faces[f] + Ng, numChildren; 758cd0c2139SMatthew G Knepley 759da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 760ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 761ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 76246c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 763cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr); 764cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr); 76546c796b9SMatthew G. Knepley ++ghostCell; 766cd0c2139SMatthew G Knepley } 767cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 768cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 769cd0c2139SMatthew G Knepley } 770cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 771cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 772cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 773cd0c2139SMatthew G Knepley ierr = DMPlexStratify(gdm);CHKERRQ(ierr); 774cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 775cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 776cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 777ca04dac2SToby Isaac ierr = DMPlexShiftTree_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 778cd0c2139SMatthew G Knepley ierr = PetscFree(depthShift);CHKERRQ(ierr); 779966c7b3fSMatthew G. Knepley /* Step 7: Periodicity */ 780966c7b3fSMatthew G. Knepley if (dm->maxCell) { 781966c7b3fSMatthew G. Knepley const PetscReal *maxCell, *L; 7825dc8c3f7SMatthew G. Knepley const DMBoundaryType *bd; 7835dc8c3f7SMatthew G. Knepley ierr = DMGetPeriodicity(dm, &maxCell, &L, &bd);CHKERRQ(ierr); 7845dc8c3f7SMatthew G. Knepley ierr = DMSetPeriodicity(gdm, maxCell, L, bd);CHKERRQ(ierr); 785966c7b3fSMatthew G. Knepley } 7864a6cfa73SMatthew G. Knepley if (numGhostCells) *numGhostCells = Ng; 787cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 788cd0c2139SMatthew G Knepley } 789cd0c2139SMatthew G Knepley 790cd0c2139SMatthew G Knepley /*@C 791cd0c2139SMatthew G Knepley DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face 792cd0c2139SMatthew G Knepley 793cd0c2139SMatthew G Knepley Collective on dm 794cd0c2139SMatthew G Knepley 795cd0c2139SMatthew G Knepley Input Parameters: 796cd0c2139SMatthew G Knepley + dm - The original DM 797cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL 798cd0c2139SMatthew G Knepley 799cd0c2139SMatthew G Knepley Output Parameters: 800cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM 801cd0c2139SMatthew G Knepley - dmGhosted - The new DM 802cd0c2139SMatthew G Knepley 803cd0c2139SMatthew G Knepley Note: If no label exists of that name, one will be created marking all boundary faces 804cd0c2139SMatthew G Knepley 805cd0c2139SMatthew G Knepley Level: developer 806cd0c2139SMatthew G Knepley 807cd0c2139SMatthew G Knepley .seealso: DMCreate() 80831266bc0SMatthew G. Knepley @*/ 809cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted) 810cd0c2139SMatthew G Knepley { 811cd0c2139SMatthew G Knepley DM gdm; 812cd0c2139SMatthew G Knepley DMLabel label; 813cd0c2139SMatthew G Knepley const char *name = labelName ? labelName : "Face Sets"; 814cd0c2139SMatthew G Knepley PetscInt dim; 815a42b08eeSMatthew G. Knepley PetscBool flag; 816cd0c2139SMatthew G Knepley PetscErrorCode ierr; 817cd0c2139SMatthew G Knepley 818cd0c2139SMatthew G Knepley PetscFunctionBegin; 819cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 8204a6cfa73SMatthew G. Knepley if (numGhostCells) PetscValidPointer(numGhostCells, 3); 821cd0c2139SMatthew G Knepley PetscValidPointer(dmGhosted, 4); 822cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr); 823cd0c2139SMatthew G Knepley ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr); 824c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 825c73cfb54SMatthew G. Knepley ierr = DMSetDimension(gdm, dim);CHKERRQ(ierr); 826a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseCone(dm, &flag);CHKERRQ(ierr); 827a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseCone(gdm, flag);CHKERRQ(ierr); 828a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseClosure(dm, &flag);CHKERRQ(ierr); 829a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseClosure(gdm, flag);CHKERRQ(ierr); 830c58f1c22SToby Isaac ierr = DMGetLabel(dm, name, &label);CHKERRQ(ierr); 831cd0c2139SMatthew G Knepley if (!label) { 832cd0c2139SMatthew G Knepley /* Get label for boundary faces */ 833c58f1c22SToby Isaac ierr = DMCreateLabel(dm, name);CHKERRQ(ierr); 834c58f1c22SToby Isaac ierr = DMGetLabel(dm, name, &label);CHKERRQ(ierr); 835cd0c2139SMatthew G Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 836cd0c2139SMatthew G Knepley } 837cd0c2139SMatthew G Knepley ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr); 838a6ba4734SToby Isaac ierr = DMCopyBoundary(dm, gdm);CHKERRQ(ierr); 839cd0c2139SMatthew G Knepley *dmGhosted = gdm; 840cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 841cd0c2139SMatthew G Knepley } 842cd0c2139SMatthew G Knepley 843607ab7a9SMatthew G. Knepley /* 844faedd622SMatthew G. Knepley We are adding three kinds of points here: 845607ab7a9SMatthew G. Knepley Replicated: Copies of points which exist in the mesh, such as vertices identified across a fault 846faedd622SMatthew G. Knepley Non-replicated: Points which exist on the fault, but are not replicated 847607ab7a9SMatthew G. Knepley Hybrid: Entirely new points, such as cohesive cells 848a6ae58d1SMatthew G. Knepley 849a6ae58d1SMatthew G. Knepley When creating subsequent cohesive cells, we shift the old hybrid cells to the end of the numbering at 850a6ae58d1SMatthew G. Knepley each depth so that the new split/hybrid points can be inserted as a block. 851607ab7a9SMatthew G. Knepley */ 852cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm) 853cd0c2139SMatthew G Knepley { 854cd0c2139SMatthew G Knepley MPI_Comm comm; 855607ab7a9SMatthew G. Knepley IS valueIS; 856607ab7a9SMatthew G. Knepley PetscInt numSP = 0; /* The number of depths for which we have replicated points */ 857607ab7a9SMatthew G. Knepley const PetscInt *values; /* List of depths for which we have replicated points */ 85818c5995bSMatthew G. Knepley IS *splitIS; 85918c5995bSMatthew G. Knepley IS *unsplitIS; 860607ab7a9SMatthew G. Knepley PetscInt *numSplitPoints; /* The number of replicated points at each depth */ 86118c5995bSMatthew G. Knepley PetscInt *numUnsplitPoints; /* The number of non-replicated points at each depth which still give rise to hybrid points */ 86236dbac82SMatthew G. Knepley PetscInt *numHybridPoints; /* The number of new hybrid points at each depth */ 86336dbac82SMatthew G. Knepley PetscInt *numHybridPointsOld; /* The number of existing hybrid points at each depth */ 864607ab7a9SMatthew G. Knepley const PetscInt **splitPoints; /* Replicated points for each depth */ 86518c5995bSMatthew G. Knepley const PetscInt **unsplitPoints; /* Non-replicated points for each depth */ 866cd0c2139SMatthew G Knepley PetscSection coordSection; 867cd0c2139SMatthew G Knepley Vec coordinates; 868cd0c2139SMatthew G Knepley PetscScalar *coords; 869a6ae58d1SMatthew G. Knepley PetscInt *depthMax; /* The first hybrid point at each depth in the original mesh */ 870a6ae58d1SMatthew G. Knepley PetscInt *depthEnd; /* The point limit at each depth in the original mesh */ 871607ab7a9SMatthew G. Knepley PetscInt *depthShift; /* Number of replicated+hybrid points at each depth */ 872607ab7a9SMatthew G. Knepley PetscInt *pMaxNew; /* The first replicated point at each depth in the new mesh, hybrids come after this */ 873607ab7a9SMatthew G. Knepley PetscInt *coneNew, *coneONew, *supportNew; 87418c5995bSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v; 875cd0c2139SMatthew G Knepley PetscErrorCode ierr; 876cd0c2139SMatthew G Knepley 877cd0c2139SMatthew G Knepley PetscFunctionBegin; 878cd0c2139SMatthew G Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 879c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 880607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 881fd4b9f15SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 882cd0c2139SMatthew G Knepley /* Count split points and add cohesive cells */ 883607ab7a9SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 8842582d50cSToby Isaac ierr = PetscMalloc5(depth+1,&depthMax,depth+1,&depthEnd,2*(depth+1),&depthShift,depth+1,&pMaxNew,depth+1,&numHybridPointsOld);CHKERRQ(ierr); 885dcca6d9dSJed 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); 886a6ae58d1SMatthew 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); 887607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 888607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 889a6ae58d1SMatthew G. Knepley depthEnd[d] = pMaxNew[d]; 890a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 891607ab7a9SMatthew G. Knepley numSplitPoints[d] = 0; 89218c5995bSMatthew G. Knepley numUnsplitPoints[d] = 0; 893607ab7a9SMatthew G. Knepley numHybridPoints[d] = 0; 894a6ae58d1SMatthew G. Knepley numHybridPointsOld[d] = depthMax[d] < 0 ? 0 : depthEnd[d] - depthMax[d]; 895607ab7a9SMatthew G. Knepley splitPoints[d] = NULL; 89618c5995bSMatthew G. Knepley unsplitPoints[d] = NULL; 89718c5995bSMatthew G. Knepley splitIS[d] = NULL; 89818c5995bSMatthew G. Knepley unsplitIS[d] = NULL; 89959eef20bSToby Isaac /* we are shifting the existing hybrid points with the stratum behind them, so 90059eef20bSToby Isaac * the split comes at the end of the normal points, i.e., at depthMax[d] */ 90159eef20bSToby Isaac depthShift[2*d] = depthMax[d]; 90259eef20bSToby Isaac depthShift[2*d+1] = 0; 903607ab7a9SMatthew G. Knepley } 904cd0c2139SMatthew G Knepley if (label) { 905cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 906cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 907cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 908cd0c2139SMatthew G Knepley } 909cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 910cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 911cd0c2139SMatthew G Knepley 912cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 91318c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr); 91418c5995bSMatthew G. Knepley if (splitIS[dep]) { 91518c5995bSMatthew G. Knepley ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 91618c5995bSMatthew G. Knepley ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 91718c5995bSMatthew G. Knepley } 91818c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr); 91918c5995bSMatthew G. Knepley if (unsplitIS[dep]) { 92018c5995bSMatthew G. Knepley ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr); 92118c5995bSMatthew G. Knepley ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr); 922cd0c2139SMatthew G Knepley } 923cd0c2139SMatthew G Knepley } 924607ab7a9SMatthew G. Knepley /* Calculate number of hybrid points */ 92518c5995bSMatthew 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 */ 9262582d50cSToby Isaac for (d = 0; d <= depth; ++d) depthShift[2*d+1] = numSplitPoints[d] + numHybridPoints[d]; 9273d3eaba7SBarry Smith ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift);CHKERRQ(ierr); 92859eef20bSToby Isaac /* the end of the points in this stratum that come before the new points: 92959eef20bSToby Isaac * shifting pMaxNew[d] gets the new start of the next stratum, then count back the old hybrid points and the newly 93059eef20bSToby Isaac * added points */ 9312582d50cSToby Isaac for (d = 0; d <= depth; ++d) pMaxNew[d] = DMPlexShiftPoint_Internal(pMaxNew[d],depth,depthShift) - (numHybridPointsOld[d] + numSplitPoints[d] + numHybridPoints[d]); 932cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 933cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 934cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 935cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 936cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 9372582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 9384c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 939cd0c2139SMatthew G Knepley const PetscInt *support; 9404c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, qf, qn, qp, e; 941cd0c2139SMatthew G Knepley 942cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 943cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 944cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 945cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 946cd0c2139SMatthew G Knepley if (dep == depth-1) { 9474c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 9484c367dbcSMatthew G. Knepley 949cd0c2139SMatthew G Knepley /* Add cohesive cells, they are prisms */ 9504c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr); 951cd0c2139SMatthew G Knepley } else if (dep == 0) { 9524c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 953cd0c2139SMatthew G Knepley 954cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 9554c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 956cd0c2139SMatthew G Knepley PetscInt val; 957cd0c2139SMatthew G Knepley 958cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 9594c367dbcSMatthew G. Knepley if (val == 1) ++qf; 9604c367dbcSMatthew G. Knepley if ((val == 1) || (val == (shift + 1))) ++qn; 9614c367dbcSMatthew G. Knepley if ((val == 1) || (val == -(shift + 1))) ++qp; 962cd0c2139SMatthew G Knepley } 9634c367dbcSMatthew G. Knepley /* Split old vertex: Edges into original vertex and new cohesive edge */ 9644c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 9654c367dbcSMatthew G. Knepley /* Split new vertex: Edges into split vertex and new cohesive edge */ 9664c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 9674c367dbcSMatthew G. Knepley /* Add hybrid edge */ 9684c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 9694c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 970cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 9714c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 9724c367dbcSMatthew G. Knepley 973cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 9744c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 975cd0c2139SMatthew G Knepley PetscInt val; 976cd0c2139SMatthew G Knepley 977cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 9784c367dbcSMatthew G. Knepley if (val == dim-1) ++qf; 9794c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 9804c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 981cd0c2139SMatthew G Knepley } 9824c367dbcSMatthew G. Knepley /* Split old edge: Faces into original edge and cohesive face (positive side?) */ 9834c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 9844c367dbcSMatthew G. Knepley /* Split new edge: Faces into split edge and cohesive face (negative side?) */ 9854c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 9864c367dbcSMatthew G. Knepley /* Add hybrid face */ 9874c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 9884c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 989cd0c2139SMatthew G Knepley } 990cd0c2139SMatthew G Knepley } 991cd0c2139SMatthew G Knepley } 99218c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 99318c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 99418c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 9952582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 99618c5995bSMatthew G. Knepley const PetscInt *support; 997da1dd7e4SMatthew G. Knepley PetscInt coneSize, supportSize, qf, e, s; 99818c5995bSMatthew G. Knepley 99918c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 100018c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 100139254ff6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 100218c5995bSMatthew G. Knepley if (dep == 0) { 100318c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 100418c5995bSMatthew G. Knepley 100539254ff6SMatthew G. Knepley /* Unsplit vertex: Edges into original vertex, split edges, and new cohesive edge twice */ 100639254ff6SMatthew G. Knepley for (s = 0, qf = 0; s < supportSize; ++s, ++qf) { 100739254ff6SMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 100839254ff6SMatthew G. Knepley if (e >= 0) ++qf; 100939254ff6SMatthew G. Knepley } 101039254ff6SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 101118c5995bSMatthew G. Knepley /* Add hybrid edge */ 101218c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 1013e1757548SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 1014e1757548SMatthew G. Knepley PetscInt val; 1015e1757548SMatthew G. Knepley 1016e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1017e1757548SMatthew G. Knepley /* Split and unsplit edges produce hybrid faces */ 1018da1dd7e4SMatthew G. Knepley if (val == 1) ++qf; 1019da1dd7e4SMatthew G. Knepley if (val == (shift2 + 1)) ++qf; 1020e1757548SMatthew G. Knepley } 1021e1757548SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 102218c5995bSMatthew G. Knepley } else if (dep == dim-2) { 102318c5995bSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 1024cd0c2139SMatthew G Knepley PetscInt val; 1025cd0c2139SMatthew G Knepley 1026da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 1027cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1028da1dd7e4SMatthew G. Knepley if (val == dim-1) qf += 2; 1029da1dd7e4SMatthew G. Knepley else ++qf; 1030cd0c2139SMatthew G Knepley } 103118c5995bSMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */ 1032da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 103318c5995bSMatthew G. Knepley /* Add hybrid face */ 1034da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 1035da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1036da1dd7e4SMatthew G. Knepley if (val == dim-1) ++qf; 1037da1dd7e4SMatthew G. Knepley } 103818c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 1039da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 1040cd0c2139SMatthew G Knepley } 1041cd0c2139SMatthew G Knepley } 1042cd0c2139SMatthew G Knepley } 1043cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 1044cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 1045cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1046dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 1047dcca6d9dSJed Brown ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),&supportNew);CHKERRQ(ierr); 1048cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 1049cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1050cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 1051cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 10522582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 10534c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 1054cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 10554c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, q, qf, qn, qp, v, e, s; 1056cd0c2139SMatthew G Knepley 1057cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 1058cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 1059cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 1060cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 1061cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 1062cd0c2139SMatthew G Knepley if (dep == depth-1) { 106396a07cd0SMatthew G. Knepley PetscBool hasUnsplit = PETSC_FALSE; 10644c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1065cd0c2139SMatthew G Knepley const PetscInt *supportF; 1066cd0c2139SMatthew G Knepley 1067cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 1068cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 1069cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 1070cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 1071cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 1072cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 10734c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 107418c5995bSMatthew G. Knepley if (v < 0) { 107518c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 107618c5995bSMatthew 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); 10772582d50cSToby Isaac coneNew[2+q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/; 107896a07cd0SMatthew G. Knepley hasUnsplit = PETSC_TRUE; 107918c5995bSMatthew G. Knepley } else { 10804c367dbcSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep-1]; 1081163235baSMatthew G. Knepley if (dep > 1) { 1082163235baSMatthew G. Knepley const PetscInt *econe; 1083163235baSMatthew G. Knepley PetscInt econeSize, r, vs, vu; 1084163235baSMatthew G. Knepley 1085163235baSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[q], &econeSize);CHKERRQ(ierr); 1086163235baSMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[q], &econe);CHKERRQ(ierr); 1087163235baSMatthew G. Knepley for (r = 0; r < econeSize; ++r) { 1088163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numSplitPoints[dep-2], splitPoints[dep-2], &vs);CHKERRQ(ierr); 1089163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numUnsplitPoints[dep-2], unsplitPoints[dep-2], &vu);CHKERRQ(ierr); 1090163235baSMatthew G. Knepley if (vs >= 0) continue; 1091163235baSMatthew 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); 1092163235baSMatthew G. Knepley hasUnsplit = PETSC_TRUE; 1093163235baSMatthew G. Knepley } 1094163235baSMatthew G. Knepley } 1095cd0c2139SMatthew G Knepley } 1096cd0c2139SMatthew G Knepley } 1097cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 1098cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 1099e537020bSMatthew G. Knepley /* Face support */ 1100cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1101cd0c2139SMatthew G Knepley PetscInt val; 1102cd0c2139SMatthew G Knepley 1103cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 1104cd0c2139SMatthew G Knepley if (val < 0) { 1105cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 11064c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr); 1107cd0c2139SMatthew G Knepley } else { 1108cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 11094c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr); 1110e537020bSMatthew G. Knepley /* Get orientation for cohesive face */ 1111e537020bSMatthew G. Knepley { 1112e537020bSMatthew G. Knepley const PetscInt *ncone, *nconeO; 1113e537020bSMatthew G. Knepley PetscInt nconeSize, nc; 1114e537020bSMatthew G. Knepley 1115e537020bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 1116e537020bSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 1117e537020bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 1118e537020bSMatthew G. Knepley for (nc = 0; nc < nconeSize; ++nc) { 1119e537020bSMatthew G. Knepley if (ncone[nc] == oldp) { 1120e537020bSMatthew G. Knepley coneONew[0] = nconeO[nc]; 1121e537020bSMatthew G. Knepley break; 1122cd0c2139SMatthew G Knepley } 1123cd0c2139SMatthew G Knepley } 1124e537020bSMatthew 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]); 1125e537020bSMatthew G. Knepley } 1126e537020bSMatthew G. Knepley } 1127e537020bSMatthew G. Knepley } 11284c367dbcSMatthew G. Knepley /* Cohesive cell: Old and new split face, then new cohesive faces */ 1129fd4b9f15SMatthew G. Knepley coneNew[0] = newp; /* Extracted negative side orientation above */ 11304c367dbcSMatthew G. Knepley coneNew[1] = splitp; 11314c367dbcSMatthew G. Knepley coneONew[1] = coneONew[0]; 1132e537020bSMatthew G. Knepley for (q = 0; q < coneSize; ++q) { 113318c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 113418c5995bSMatthew G. Knepley if (v < 0) { 113518c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 113618c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 113718c5995bSMatthew G. Knepley coneONew[2+q] = 0; 113818c5995bSMatthew G. Knepley } else { 113918c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep]; 114018c5995bSMatthew G. Knepley } 1141e537020bSMatthew G. Knepley coneONew[2+q] = 0; 1142e537020bSMatthew G. Knepley } 11434c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr); 11444c367dbcSMatthew G. Knepley ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr); 114596a07cd0SMatthew G. Knepley /* Label the hybrid cells on the boundary of the split */ 114696a07cd0SMatthew G. Knepley if (hasUnsplit) {ierr = DMLabelSetValue(label, -hybcell, dim);CHKERRQ(ierr);} 1147cd0c2139SMatthew G Knepley } else if (dep == 0) { 11484c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1149cd0c2139SMatthew G Knepley 1150cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 11514c367dbcSMatthew G. Knepley for (e = 0, qn = 0; e < supportSize; ++e) { 1152cd0c2139SMatthew G Knepley PetscInt val; 1153cd0c2139SMatthew G Knepley 1154cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1155cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 11562582d50cSToby Isaac supportNew[qn++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1157cd0c2139SMatthew G Knepley } 1158cd0c2139SMatthew G Knepley } 11594c367dbcSMatthew G. Knepley supportNew[qn] = hybedge; 1160cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1161cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 11624c367dbcSMatthew G. Knepley for (e = 0, qp = 0; e < supportSize; ++e) { 1163cd0c2139SMatthew G Knepley PetscInt val, edge; 1164cd0c2139SMatthew G Knepley 1165cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1166cd0c2139SMatthew G Knepley if (val == 1) { 11674c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 1168cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 11694c367dbcSMatthew G. Knepley supportNew[qp++] = edge + pMaxNew[dep+1]; 1170cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 11712582d50cSToby Isaac supportNew[qp++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1172cd0c2139SMatthew G Knepley } 1173cd0c2139SMatthew G Knepley } 11744c367dbcSMatthew G. Knepley supportNew[qp] = hybedge; 1175cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 11764c367dbcSMatthew G. Knepley /* Hybrid edge: Old and new split vertex */ 1177cd0c2139SMatthew G Knepley coneNew[0] = newp; 1178cd0c2139SMatthew G Knepley coneNew[1] = splitp; 11794c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 11804c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 11814c367dbcSMatthew G. Knepley PetscInt val, edge; 11824c367dbcSMatthew G. Knepley 11834c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 11844c367dbcSMatthew G. Knepley if (val == 1) { 11854c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 11864c367dbcSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 11874c367dbcSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 11884c367dbcSMatthew G. Knepley } 11894c367dbcSMatthew G. Knepley } 11904c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1191cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 11924c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 11934c367dbcSMatthew G. Knepley 1194cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 1195cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 1196cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 11974c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 1198e1757548SMatthew G. Knepley if (v < 0) { 1199e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1200e1757548SMatthew 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); 12012582d50cSToby Isaac coneNew[q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/; 1202e1757548SMatthew G. Knepley } else { 12034c367dbcSMatthew G. Knepley coneNew[q] = v + pMaxNew[dep-1]; 1204cd0c2139SMatthew G Knepley } 1205e1757548SMatthew G. Knepley } 1206cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 1207cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 1208cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 1209cd0c2139SMatthew G Knepley PetscInt val; 1210cd0c2139SMatthew G Knepley 1211cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 12124c367dbcSMatthew G. Knepley if (val == dim-1) { 12132582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 12144c367dbcSMatthew G. Knepley } else if (val == (shift + dim-1)) { 12152582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1216cd0c2139SMatthew G Knepley } 1217cd0c2139SMatthew G Knepley } 1218b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1219cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1220cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 1221cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 1222cd0c2139SMatthew G Knepley PetscInt val, face; 1223cd0c2139SMatthew G Knepley 1224cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1225cd0c2139SMatthew G Knepley if (val == dim-1) { 12264c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1227cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 12284c367dbcSMatthew G. Knepley supportNew[q++] = face + pMaxNew[dep+1]; 1229cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 12302582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1231cd0c2139SMatthew G Knepley } 1232cd0c2139SMatthew G Knepley } 1233b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1234cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 12354c367dbcSMatthew G. Knepley /* Hybrid face */ 12364c367dbcSMatthew G. Knepley coneNew[0] = newp; 12374c367dbcSMatthew G. Knepley coneNew[1] = splitp; 12384c367dbcSMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 12394c367dbcSMatthew G. Knepley PetscInt vertex; 12404c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr); 1241e1757548SMatthew G. Knepley if (vertex < 0) { 1242e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr); 1243e1757548SMatthew 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); 1244e1757548SMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1245e1757548SMatthew G. Knepley } else { 12464c367dbcSMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep]; 12474c367dbcSMatthew G. Knepley } 1248e1757548SMatthew G. Knepley } 12494c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 12504c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 12514c367dbcSMatthew G. Knepley PetscInt val, face; 12524c367dbcSMatthew G. Knepley 12534c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 12544c367dbcSMatthew G. Knepley if (val == dim-1) { 12554c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 12564c367dbcSMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 12574c367dbcSMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 12584c367dbcSMatthew G. Knepley } 12594c367dbcSMatthew G. Knepley } 12604c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1261cd0c2139SMatthew G Knepley } 1262cd0c2139SMatthew G Knepley } 1263cd0c2139SMatthew G Knepley } 126418c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 126518c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 126618c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 12672582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 126818c5995bSMatthew G. Knepley const PetscInt *cone, *support, *ornt; 1269e1757548SMatthew G. Knepley PetscInt coneSize, supportSize, supportSizeNew, q, qf, e, f, s; 127018c5995bSMatthew G. Knepley 127118c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 127218c5995bSMatthew G. Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 127318c5995bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 127418c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 127518c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 127618c5995bSMatthew G. Knepley if (dep == 0) { 127718c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 127818c5995bSMatthew G. Knepley 127918c5995bSMatthew G. Knepley /* Unsplit vertex */ 128018c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 128118c5995bSMatthew G. Knepley for (s = 0, q = 0; s < supportSize; ++s) { 12822582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[s], depth, depthShift) /*support[s] + depthOffset[dep+1]*/; 128318c5995bSMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 128418c5995bSMatthew G. Knepley if (e >= 0) { 128518c5995bSMatthew G. Knepley supportNew[q++] = e + pMaxNew[dep+1]; 128618c5995bSMatthew G. Knepley } 128718c5995bSMatthew G. Knepley } 128818c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 128918c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 129018c5995bSMatthew G. Knepley if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp); 129118c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 129218c5995bSMatthew G. Knepley /* Hybrid edge */ 129318c5995bSMatthew G. Knepley coneNew[0] = newp; 129418c5995bSMatthew G. Knepley coneNew[1] = newp; 129518c5995bSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 129618c5995bSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 129718c5995bSMatthew G. Knepley PetscInt val, edge; 129818c5995bSMatthew G. Knepley 129918c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 130018c5995bSMatthew G. Knepley if (val == 1) { 130118c5995bSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 130218c5995bSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 130318c5995bSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1304e1757548SMatthew G. Knepley } else if (val == (shift2 + 1)) { 1305e1757548SMatthew G. Knepley ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr); 1306e1757548SMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]); 1307e1757548SMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1]; 130818c5995bSMatthew G. Knepley } 130918c5995bSMatthew G. Knepley } 131018c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1311e1757548SMatthew G. Knepley } else if (dep == dim-2) { 1312e1757548SMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 1313e1757548SMatthew G. Knepley 1314da1dd7e4SMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and hybrid face twice */ 1315e1757548SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1316e1757548SMatthew G. Knepley PetscInt val, face; 1317e1757548SMatthew G. Knepley 1318e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1319e1757548SMatthew G. Knepley if (val == dim-1) { 1320e1757548SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1321e1757548SMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]); 13222582d50cSToby Isaac supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/; 1323e1757548SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+1]; 1324e1757548SMatthew G. Knepley } else { 13252582d50cSToby Isaac supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/; 1326e1757548SMatthew G. Knepley } 1327e1757548SMatthew G. Knepley } 1328e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1329e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1330da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 1331da1dd7e4SMatthew 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); 1332e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1333e1757548SMatthew G. Knepley /* Add hybrid face */ 1334e1757548SMatthew G. Knepley coneNew[0] = newp; 1335212cc919SMatthew G. Knepley coneNew[1] = newp; 1336e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[0], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1337e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[0]); 1338212cc919SMatthew G. Knepley coneNew[2] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1339e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1340e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]); 1341e1757548SMatthew G. Knepley coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1342e1757548SMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 1343da1dd7e4SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1344da1dd7e4SMatthew G. Knepley PetscInt val, face; 1345da1dd7e4SMatthew G. Knepley 1346da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1347da1dd7e4SMatthew G. Knepley if (val == dim-1) { 1348da1dd7e4SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1349da1dd7e4SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1350da1dd7e4SMatthew G. Knepley } 1351da1dd7e4SMatthew G. Knepley } 1352da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, hybface, &supportSizeNew);CHKERRQ(ierr); 1353da1dd7e4SMatthew 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); 1354e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1355cd0c2139SMatthew G Knepley } 1356cd0c2139SMatthew G Knepley } 1357cd0c2139SMatthew G Knepley } 1358cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 1359cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1360cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 1361cd0c2139SMatthew G Knepley IS pIS; 1362cd0c2139SMatthew G Knepley PetscInt numPoints; 1363cd0c2139SMatthew G Knepley const PetscInt *points; 1364cd0c2139SMatthew G Knepley 1365cd0c2139SMatthew G Knepley if (dep >= 0) continue; 1366cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 1367cd0c2139SMatthew G Knepley if (!pIS) continue; 1368cd0c2139SMatthew G Knepley dep = -dep - shift; 1369cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 1370cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 1371cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1372cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 13732582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*depthOffset[dep] + oldp*/; 1374cd0c2139SMatthew G Knepley const PetscInt *cone; 1375cd0c2139SMatthew G Knepley PetscInt coneSize, c; 137650cf782dSMatthew G. Knepley /* PetscBool replaced = PETSC_FALSE; */ 1377cd0c2139SMatthew G Knepley 1378cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 1379cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 1380cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 1381cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 1382cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1383e38fbfedSToby Isaac const PetscInt coldp = DMPlexShiftPointInverse_Internal(cone[c],depth,depthShift); 1384cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 1385cd0c2139SMatthew G Knepley 1386cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 1387cd0c2139SMatthew G Knepley if (val == dep-1) { 1388cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 1389cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 1390cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 1391cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 139250cf782dSMatthew G. Knepley /* replaced = PETSC_TRUE; */ 1393cd0c2139SMatthew G Knepley } 1394cd0c2139SMatthew G Knepley } 13954a189a86SMatthew G. Knepley /* Cells with only a vertex or edge on the submesh have no replacement */ 13964a189a86SMatthew G. Knepley /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 1397cd0c2139SMatthew G Knepley } 1398cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 1399cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 1400cd0c2139SMatthew G Knepley } 1401cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 1402cd0c2139SMatthew G Knepley ierr = DMPlexStratify(sdm);CHKERRQ(ierr); 1403cd0c2139SMatthew G Knepley /* Step 8: Coordinates */ 1404cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 140569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 1406cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 1407cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 1408cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 14092582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[0][v], depth, depthShift) /*depthOffset[0] + splitPoints[0][v]*/; 1410cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 1411cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 1412cd0c2139SMatthew G Knepley 1413cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 1414cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 1415cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 1416cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 1417cd0c2139SMatthew G Knepley } 1418cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 1419cd0c2139SMatthew G Knepley /* Step 9: SF, if I can figure this out we can split the mesh in parallel */ 1420cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1421cd0c2139SMatthew G Knepley /* Step 10: Labels */ 1422cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1423c58f1c22SToby Isaac ierr = DMGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 1424cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1425cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 14262582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[dep][p], depth, depthShift) /*depthOffset[dep] + splitPoints[dep][p]*/; 1427cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 1428cd0c2139SMatthew G Knepley PetscInt l; 1429cd0c2139SMatthew G Knepley 1430cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 1431cd0c2139SMatthew G Knepley DMLabel mlabel; 1432cd0c2139SMatthew G Knepley const char *lname; 1433cd0c2139SMatthew G Knepley PetscInt val; 14349a356370SMatthew G. Knepley PetscBool isDepth; 1435cd0c2139SMatthew G Knepley 1436c58f1c22SToby Isaac ierr = DMGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 14379a356370SMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 14389a356370SMatthew G. Knepley if (isDepth) continue; 1439c58f1c22SToby Isaac ierr = DMGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 1440cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 1441cd0c2139SMatthew G Knepley if (val >= 0) { 1442cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 14439a356370SMatthew G. Knepley #if 0 14449a356370SMatthew G. Knepley /* Do not put cohesive edges into the label */ 1445cd0c2139SMatthew G Knepley if (dep == 0) { 14464c367dbcSMatthew G. Knepley const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1447cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr); 14484c367dbcSMatthew G. Knepley } else if (dep == dim-2) { 14494c367dbcSMatthew G. Knepley const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 14504c367dbcSMatthew G. Knepley ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr); 1451cd0c2139SMatthew G Knepley } 14524c367dbcSMatthew G. Knepley /* Do not put cohesive faces into the label */ 14539a356370SMatthew G. Knepley #endif 1454cd0c2139SMatthew G Knepley } 1455cd0c2139SMatthew G Knepley } 1456cd0c2139SMatthew G Knepley } 1457cd0c2139SMatthew G Knepley } 1458cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1459cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 1460cd0c2139SMatthew G Knepley 1461cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 146218c5995bSMatthew G. Knepley if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 146318c5995bSMatthew G. Knepley ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr); 146418c5995bSMatthew G. Knepley if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);} 146518c5995bSMatthew G. Knepley ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr); 1466cd0c2139SMatthew G Knepley } 1467cd0c2139SMatthew G Knepley if (label) { 1468cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1469cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1470cd0c2139SMatthew G Knepley } 14710d4d4d06SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 14720d4d4d06SMatthew G. Knepley ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr); 147336dbac82SMatthew G. Knepley pMaxNew[d] = pEnd - numHybridPoints[d] - numHybridPointsOld[d]; 14740d4d4d06SMatthew G. Knepley } 14750e49e2e2SMatthew 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); 1476dcbb62e8SMatthew G. Knepley ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr); 14772582d50cSToby Isaac ierr = PetscFree5(depthMax, depthEnd, depthShift, pMaxNew, numHybridPointsOld);CHKERRQ(ierr); 147818c5995bSMatthew G. Knepley ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr); 1479cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1480cd0c2139SMatthew G Knepley } 1481cd0c2139SMatthew G Knepley 1482cd0c2139SMatthew G Knepley /*@C 1483cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 1484cd0c2139SMatthew G Knepley 1485cd0c2139SMatthew G Knepley Collective on dm 1486cd0c2139SMatthew G Knepley 1487cd0c2139SMatthew G Knepley Input Parameters: 1488cd0c2139SMatthew G Knepley + dm - The original DM 148953156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated) 1490cd0c2139SMatthew G Knepley 1491cd0c2139SMatthew G Knepley Output Parameters: 1492cd0c2139SMatthew G Knepley - dmSplit - The new DM 1493cd0c2139SMatthew G Knepley 1494cd0c2139SMatthew G Knepley Level: developer 1495cd0c2139SMatthew G Knepley 14962be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 1497cd0c2139SMatthew G Knepley @*/ 1498cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 1499cd0c2139SMatthew G Knepley { 1500cd0c2139SMatthew G Knepley DM sdm; 1501cd0c2139SMatthew G Knepley PetscInt dim; 1502cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1503cd0c2139SMatthew G Knepley 1504cd0c2139SMatthew G Knepley PetscFunctionBegin; 1505cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 150653156dfcSMatthew G. Knepley PetscValidPointer(dmSplit, 3); 1507cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 1508cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 1509c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1510c73cfb54SMatthew G. Knepley ierr = DMSetDimension(sdm, dim);CHKERRQ(ierr); 1511cd0c2139SMatthew G Knepley switch (dim) { 1512cd0c2139SMatthew G Knepley case 2: 1513cd0c2139SMatthew G Knepley case 3: 1514cd0c2139SMatthew G Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 1515cd0c2139SMatthew G Knepley break; 1516cd0c2139SMatthew G Knepley default: 1517cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 1518cd0c2139SMatthew G Knepley } 1519cd0c2139SMatthew G Knepley *dmSplit = sdm; 1520cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1521cd0c2139SMatthew G Knepley } 1522cd0c2139SMatthew G Knepley 15230f66a230SMatthew G. Knepley /* Returns the side of the surface for a given cell with a face on the surface */ 15240f66a230SMatthew G. Knepley static PetscErrorCode GetSurfaceSide_Static(DM dm, DM subdm, PetscInt numSubpoints, const PetscInt *subpoints, PetscInt cell, PetscInt face, PetscBool *pos) 15250f66a230SMatthew G. Knepley { 15260f66a230SMatthew G. Knepley const PetscInt *cone, *ornt; 15270f66a230SMatthew G. Knepley PetscInt dim, coneSize, c; 15280f66a230SMatthew G. Knepley PetscErrorCode ierr; 15290f66a230SMatthew G. Knepley 15300f66a230SMatthew G. Knepley PetscFunctionBegin; 15310f66a230SMatthew G. Knepley *pos = PETSC_TRUE; 1532c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 15330f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 15340f66a230SMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 15350f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, cell, &ornt);CHKERRQ(ierr); 15360f66a230SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 15370f66a230SMatthew G. Knepley if (cone[c] == face) { 15380f66a230SMatthew G. Knepley PetscInt o = ornt[c]; 15390f66a230SMatthew G. Knepley 15400f66a230SMatthew G. Knepley if (subdm) { 15410f66a230SMatthew G. Knepley const PetscInt *subcone, *subornt; 15420f66a230SMatthew G. Knepley PetscInt subpoint, subface, subconeSize, sc; 15430f66a230SMatthew G. Knepley 15440f66a230SMatthew G. Knepley ierr = PetscFindInt(cell, numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 15450f66a230SMatthew G. Knepley ierr = PetscFindInt(face, numSubpoints, subpoints, &subface);CHKERRQ(ierr); 15460f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 15470f66a230SMatthew G. Knepley ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 15480f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 15490f66a230SMatthew G. Knepley for (sc = 0; sc < subconeSize; ++sc) { 15500f66a230SMatthew G. Knepley if (subcone[sc] == subface) { 15510f66a230SMatthew G. Knepley o = subornt[0]; 15520f66a230SMatthew G. Knepley break; 15530f66a230SMatthew G. Knepley } 15540f66a230SMatthew G. Knepley } 15550f66a230SMatthew 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); 15560f66a230SMatthew G. Knepley } 15570f66a230SMatthew G. Knepley if (o >= 0) *pos = PETSC_TRUE; 15580f66a230SMatthew G. Knepley else *pos = PETSC_FALSE; 15590f66a230SMatthew G. Knepley break; 15600f66a230SMatthew G. Knepley } 15610f66a230SMatthew G. Knepley } 15620f66a230SMatthew 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); 15630f66a230SMatthew G. Knepley PetscFunctionReturn(0); 15640f66a230SMatthew G. Knepley } 15650f66a230SMatthew G. Knepley 1566cd0c2139SMatthew G Knepley /*@ 15670f66a230SMatthew G. Knepley DMPlexLabelCohesiveComplete - Starting with a label marking points on an internal surface, we add all other mesh pieces 1568cd0c2139SMatthew G Knepley to complete the surface 1569cd0c2139SMatthew G Knepley 1570cd0c2139SMatthew G Knepley Input Parameters: 1571cd0c2139SMatthew G Knepley + dm - The DM 15720f66a230SMatthew G. Knepley . label - A DMLabel marking the surface 15730f66a230SMatthew G. Knepley . blabel - A DMLabel marking the vertices on the boundary which will not be duplicated, or NULL to find them automatically 1574bb55d314SMatthew G. Knepley . flip - Flag to flip the submesh normal and replace points on the other side 157547946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL 1576cd0c2139SMatthew G Knepley 1577cd0c2139SMatthew G Knepley Output Parameter: 1578cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 1579cd0c2139SMatthew G Knepley 15800f66a230SMatthew G. Knepley Note: The vertices in blabel are called "unsplit" in the terminology from hybrid cell creation. 15810f66a230SMatthew G. Knepley 1582cd0c2139SMatthew G Knepley Level: developer 1583cd0c2139SMatthew G Knepley 15842be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 1585cd0c2139SMatthew G Knepley @*/ 15860f66a230SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, DMLabel blabel, PetscBool flip, DM subdm) 1587cd0c2139SMatthew G Knepley { 1588d90583fdSMatthew G. Knepley DMLabel depthLabel; 15898630cb1aSMatthew G. Knepley IS dimIS, subpointIS = NULL, facePosIS, faceNegIS, crossEdgeIS = NULL; 159047946fd8SMatthew G. Knepley const PetscInt *points, *subpoints; 1591bb55d314SMatthew G. Knepley const PetscInt rev = flip ? -1 : 1; 1592370472baSMatthew G. Knepley PetscInt *pMax; 1593370472baSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, dim, depth, pSize, dep, cStart, cEnd, cMax, fStart, fEnd, vStart, vEnd, numPoints, numSubpoints, p, val; 1594cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1595cd0c2139SMatthew G Knepley 1596cd0c2139SMatthew G Knepley PetscFunctionBegin; 1597370472baSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1598370472baSMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1599370472baSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1600370472baSMatthew G. Knepley ierr = PetscMalloc1(pSize,&pMax);CHKERRQ(ierr); 1601370472baSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &pMax[depth] : NULL, depth>1 ? &pMax[depth-1] : NULL, depth>2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1602d90583fdSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 1603c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 160447946fd8SMatthew G. Knepley if (subdm) { 160547946fd8SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 160647946fd8SMatthew G. Knepley if (subpointIS) { 160747946fd8SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 160847946fd8SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 160947946fd8SMatthew G. Knepley } 161047946fd8SMatthew G. Knepley } 1611d7c8f101SMatthew G. Knepley /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */ 1612cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 1613dc86033cSMatthew G. Knepley if (!dimIS) { 1614dc86033cSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 16158630cb1aSMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 1616dc86033cSMatthew G. Knepley PetscFunctionReturn(0); 1617dc86033cSMatthew G. Knepley } 1618cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1619cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1620d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */ 1621cd0c2139SMatthew G Knepley const PetscInt *support; 1622cd0c2139SMatthew G Knepley PetscInt supportSize, s; 1623cd0c2139SMatthew G Knepley 1624cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1625cd0c2139SMatthew G Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 1626cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1627cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 16280f66a230SMatthew G. Knepley const PetscInt *cone; 1629cd0c2139SMatthew G Knepley PetscInt coneSize, c; 16300f66a230SMatthew G. Knepley PetscBool pos; 1631cd0c2139SMatthew G Knepley 16320f66a230SMatthew G. Knepley ierr = GetSurfaceSide_Static(dm, subdm, numSubpoints, subpoints, support[s], points[p], &pos);CHKERRQ(ierr); 16330f66a230SMatthew G. Knepley if (pos) {ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr);} 16340f66a230SMatthew G. Knepley else {ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);} 16350f66a230SMatthew G. Knepley if (rev < 0) pos = !pos ? PETSC_TRUE : PETSC_FALSE; 16360f66a230SMatthew G. Knepley /* Put faces touching the fault in the label */ 1637cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1638cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1639cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1640cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 1641cd0c2139SMatthew G Knepley 1642cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1643cd0c2139SMatthew G Knepley if (val == -1) { 1644cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 1645cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 1646cd0c2139SMatthew G Knepley 1647cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1648cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1649cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 1650a0541d8aSMatthew G. Knepley PetscInt bval = -1; 1651cd0c2139SMatthew G Knepley 1652cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1653a0541d8aSMatthew G. Knepley if (blabel) {ierr = DMLabelGetValue(blabel, clp, &bval);CHKERRQ(ierr);} 1654a0541d8aSMatthew G. Knepley if ((val >= 0) && (val < dim-1) && (bval < 0)) { 1655cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1656cd0c2139SMatthew G Knepley break; 1657cd0c2139SMatthew G Knepley } 1658cd0c2139SMatthew G Knepley } 1659cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1660cd0c2139SMatthew G Knepley } 1661cd0c2139SMatthew G Knepley } 1662cd0c2139SMatthew G Knepley } 1663cd0c2139SMatthew G Knepley } 16640f66a230SMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 16650f66a230SMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 166647946fd8SMatthew G. Knepley if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 166747946fd8SMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 1668a0541d8aSMatthew G. Knepley /* Mark boundary points as unsplit */ 166986200784SMatthew G. Knepley if (blabel) { 1670a0541d8aSMatthew G. Knepley ierr = DMLabelGetStratumIS(blabel, 1, &dimIS);CHKERRQ(ierr); 1671a0541d8aSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1672a0541d8aSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1673a0541d8aSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1674a0541d8aSMatthew G. Knepley const PetscInt point = points[p]; 1675a0541d8aSMatthew G. Knepley PetscInt val, bval; 1676a0541d8aSMatthew G. Knepley 1677a0541d8aSMatthew G. Knepley ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr); 1678a0541d8aSMatthew G. Knepley if (bval >= 0) { 1679f7019248SMatthew G. Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1680f7019248SMatthew G. Knepley if ((val < 0) || (val > dim)) { 1681f7019248SMatthew G. Knepley /* This could be a point added from splitting a vertex on an adjacent fault, otherwise its just wrong */ 1682f7019248SMatthew G. Knepley ierr = DMLabelClearValue(blabel, point, bval);CHKERRQ(ierr); 1683f7019248SMatthew G. Knepley } 1684f7019248SMatthew G. Knepley } 1685f7019248SMatthew G. Knepley } 1686f7019248SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1687f7019248SMatthew G. Knepley const PetscInt point = points[p]; 1688f7019248SMatthew G. Knepley PetscInt val, bval; 1689f7019248SMatthew G. Knepley 1690f7019248SMatthew G. Knepley ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr); 1691f7019248SMatthew G. Knepley if (bval >= 0) { 169286200784SMatthew G. Knepley const PetscInt *cone, *support; 169386200784SMatthew G. Knepley PetscInt coneSize, supportSize, s, valA, valB, valE; 169486200784SMatthew G. Knepley 1695a0541d8aSMatthew G. Knepley /* Mark as unsplit */ 1696a0541d8aSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1697a0541d8aSMatthew G. Knepley if ((val < 0) || (val > dim)) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d has label value %d, should be part of the fault", point, val); 1698a0541d8aSMatthew G. Knepley ierr = DMLabelClearValue(label, point, val);CHKERRQ(ierr); 1699a0541d8aSMatthew G. Knepley ierr = DMLabelSetValue(label, point, shift2+val);CHKERRQ(ierr); 17002c06a818SMatthew G. Knepley /* Check for cross-edge 17012c06a818SMatthew G. Knepley A cross-edge has endpoints which are both on the boundary of the surface, but the edge itself is not. */ 170286200784SMatthew G. Knepley if (val != 0) continue; 170386200784SMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 170486200784SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 170586200784SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 170686200784SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 170786200784SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 170886200784SMatthew G. Knepley if (coneSize != 2) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Edge %D has %D vertices != 2", support[s], coneSize); 170986200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, cone[0], &valA);CHKERRQ(ierr); 171086200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, cone[1], &valB);CHKERRQ(ierr); 171186200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, support[s], &valE);CHKERRQ(ierr); 171209816f77SMatthew G. Knepley if ((valE < 0) && (valA >= 0) && (valB >= 0) && (cone[0] != cone[1])) {ierr = DMLabelSetValue(blabel, support[s], 2);CHKERRQ(ierr);} 171386200784SMatthew G. Knepley } 1714a0541d8aSMatthew G. Knepley } 1715a0541d8aSMatthew G. Knepley } 1716a0541d8aSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1717a0541d8aSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1718a0541d8aSMatthew G. Knepley } 1719cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1720c4d480a2SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 1721cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1722d24f5ce5SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1723d24f5ce5SMatthew G. Knepley cMax = cMax < 0 ? cEnd : cMax; 17240f66a230SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 1725cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 172686200784SMatthew G. Knepley if (blabel) {ierr = DMLabelGetStratumIS(blabel, 2, &crossEdgeIS);CHKERRQ(ierr);} 172786200784SMatthew G. Knepley if (dimIS && crossEdgeIS) { 172886200784SMatthew G. Knepley IS vertIS = dimIS; 172986200784SMatthew G. Knepley 173086200784SMatthew G. Knepley ierr = ISExpand(vertIS, crossEdgeIS, &dimIS);CHKERRQ(ierr); 173186200784SMatthew G. Knepley ierr = ISDestroy(&crossEdgeIS);CHKERRQ(ierr); 173286200784SMatthew G. Knepley ierr = ISDestroy(&vertIS);CHKERRQ(ierr); 173386200784SMatthew G. Knepley } 1734dc86033cSMatthew G. Knepley if (!dimIS) { 1735dc86033cSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1736dc86033cSMatthew G. Knepley PetscFunctionReturn(0); 1737dc86033cSMatthew G. Knepley } 1738cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1739cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1740d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */ 1741cd0c2139SMatthew G Knepley PetscInt *star = NULL; 174286200784SMatthew G. Knepley PetscInt starSize, s; 1743cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1744cd0c2139SMatthew G Knepley 1745d4622b2cSMatthew G. Knepley /* All points connected to the fault are inside a cell, so at the top level we will only check cells */ 1746cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1747cd0c2139SMatthew G Knepley while (again) { 1748cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1749cd0c2139SMatthew G Knepley again = 0; 1750cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1751cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1752cd0c2139SMatthew G Knepley const PetscInt *cone; 1753cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1754cd0c2139SMatthew G Knepley 1755d24f5ce5SMatthew G. Knepley if ((point < cStart) || (point >= cMax)) continue; 1756cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1757cd0c2139SMatthew G Knepley if (val != -1) continue; 1758d4622b2cSMatthew G. Knepley again = again == 1 ? 1 : 2; 1759cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1760cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1761cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1762cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1763cd0c2139SMatthew G Knepley if (val != -1) { 1764d7c8f101SMatthew G. Knepley const PetscInt *ccone; 1765166d9d0cSMatthew G. Knepley PetscInt cconeSize, cc, side; 1766d7c8f101SMatthew G. Knepley 1767db8edaafSMatthew G. Knepley if (PetscAbs(val) < shift) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d on cell %d has an invalid label %d", cone[c], point, val); 176837a6de01SMatthew G. Knepley if (val > 0) side = 1; 176937a6de01SMatthew G. Knepley else side = -1; 177037a6de01SMatthew G. Knepley ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr); 1771d7c8f101SMatthew G. Knepley /* Mark cell faces which touch the fault */ 1772d7c8f101SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr); 1773d7c8f101SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr); 1774d7c8f101SMatthew G. Knepley for (cc = 0; cc < cconeSize; ++cc) { 1775d7c8f101SMatthew G. Knepley PetscInt *closure = NULL; 1776d7c8f101SMatthew G. Knepley PetscInt closureSize, cl; 1777d7c8f101SMatthew G. Knepley 1778166d9d0cSMatthew G. Knepley ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr); 1779166d9d0cSMatthew G. Knepley if (val != -1) continue; 1780d7c8f101SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1781d4622b2cSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1782d7c8f101SMatthew G. Knepley const PetscInt clp = closure[cl]; 1783d7c8f101SMatthew G. Knepley 1784d7c8f101SMatthew G. Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1785d7c8f101SMatthew G. Knepley if (val == -1) continue; 1786d7c8f101SMatthew G. Knepley ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr); 178737a6de01SMatthew G. Knepley break; 178837a6de01SMatthew G. Knepley } 1789d7c8f101SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1790cd0c2139SMatthew G Knepley } 1791cd0c2139SMatthew G Knepley again = 1; 1792cd0c2139SMatthew G Knepley break; 1793cd0c2139SMatthew G Knepley } 1794cd0c2139SMatthew G Knepley } 1795cd0c2139SMatthew G Knepley } 1796cd0c2139SMatthew G Knepley } 1797cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1798cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1799cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1800cd0c2139SMatthew G Knepley 1801cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1802cd0c2139SMatthew G Knepley if (val == -1) { 1803cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1804cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1805cd0c2139SMatthew G Knepley PetscBool marked = PETSC_FALSE; 1806cd0c2139SMatthew G Knepley 1807cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1808cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1809cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1810cd0c2139SMatthew G Knepley 1811d24f5ce5SMatthew G. Knepley if ((spoint < cStart) || (spoint >= cMax)) continue; 1812cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1813cd0c2139SMatthew G Knepley if (val == -1) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d in star of %d does not have a valid label", spoint, point); 1814d90583fdSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1815cd0c2139SMatthew G Knepley if (val > 0) { 1816cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1817cd0c2139SMatthew G Knepley } else { 1818cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1819cd0c2139SMatthew G Knepley } 1820cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1821cd0c2139SMatthew G Knepley break; 1822cd0c2139SMatthew G Knepley } 1823cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1824370472baSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1825370472baSMatthew G. Knepley if (point < pMax[dep] && !marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1826cd0c2139SMatthew G Knepley } 1827cd0c2139SMatthew G Knepley } 1828cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1829cd0c2139SMatthew G Knepley } 1830cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1831cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 183218c5995bSMatthew G. Knepley /* If any faces touching the fault divide cells on either side, split them */ 183318c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift+dim-1, &facePosIS);CHKERRQ(ierr); 183418c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr); 183518c5995bSMatthew G. Knepley ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr); 183618c5995bSMatthew G. Knepley ierr = ISDestroy(&facePosIS);CHKERRQ(ierr); 183718c5995bSMatthew G. Knepley ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr); 183818c5995bSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 183918c5995bSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 184018c5995bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 184118c5995bSMatthew G. Knepley const PetscInt point = points[p]; 184218c5995bSMatthew G. Knepley const PetscInt *support; 184318c5995bSMatthew G. Knepley PetscInt supportSize, valA, valB; 184418c5995bSMatthew G. Knepley 184518c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 184618c5995bSMatthew G. Knepley if (supportSize != 2) continue; 184718c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 184818c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr); 184918c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr); 185018c5995bSMatthew G. Knepley if ((valA == -1) || (valB == -1)) continue; 185118c5995bSMatthew G. Knepley if (valA*valB > 0) continue; 185218c5995bSMatthew G. Knepley /* Split the face */ 185318c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr); 185418c5995bSMatthew G. Knepley ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr); 185518c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr); 1856e1757548SMatthew G. Knepley /* Label its closure: 1857e1757548SMatthew G. Knepley unmarked: label as unsplit 1858e1757548SMatthew G. Knepley incident: relabel as split 1859e1757548SMatthew G. Knepley split: do nothing 1860e1757548SMatthew G. Knepley */ 186118c5995bSMatthew G. Knepley { 186218c5995bSMatthew G. Knepley PetscInt *closure = NULL; 186318c5995bSMatthew G. Knepley PetscInt closureSize, cl; 186418c5995bSMatthew G. Knepley 186518c5995bSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 186618c5995bSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 186718c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr); 18688771c1d3SMatthew G. Knepley if (valA == -1) { /* Mark as unsplit */ 186918c5995bSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 187018c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr); 18718771c1d3SMatthew G. Knepley } else if (((valA >= shift) && (valA < shift2)) || ((valA <= -shift) && (valA > -shift2))) { 1872e1757548SMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 1873e1757548SMatthew G. Knepley ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr); 1874e1757548SMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr); 1875e1757548SMatthew G. Knepley } 187618c5995bSMatthew G. Knepley } 187718c5995bSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 187818c5995bSMatthew G. Knepley } 187918c5995bSMatthew G. Knepley } 188018c5995bSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 188118c5995bSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1882370472baSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1883cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1884cd0c2139SMatthew G Knepley } 1885cd0c2139SMatthew G Knepley 1886c08575a3SMatthew G. Knepley /*@ 18873cf72582SMatthew G. Knepley DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface 18883cf72582SMatthew G. Knepley 18893cf72582SMatthew G. Knepley Collective on dm 18903cf72582SMatthew G. Knepley 18913cf72582SMatthew G. Knepley Input Parameters: 18923cf72582SMatthew G. Knepley + dm - The original DM 18933cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices 18943cf72582SMatthew G. Knepley 18953cf72582SMatthew G. Knepley Output Parameters: 18963cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface 18973cf72582SMatthew G. Knepley - dmHybrid - The new DM 18983cf72582SMatthew G. Knepley 18993cf72582SMatthew G. Knepley Level: developer 19003cf72582SMatthew G. Knepley 19013cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate() 19023cf72582SMatthew G. Knepley @*/ 19033cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid) 19043cf72582SMatthew G. Knepley { 19053cf72582SMatthew G. Knepley DM idm; 19063cf72582SMatthew G. Knepley DMLabel subpointMap, hlabel; 19073cf72582SMatthew G. Knepley PetscInt dim; 19083cf72582SMatthew G. Knepley PetscErrorCode ierr; 19093cf72582SMatthew G. Knepley 19103cf72582SMatthew G. Knepley PetscFunctionBegin; 19113cf72582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 19123cf72582SMatthew G. Knepley if (hybridLabel) PetscValidPointer(hybridLabel, 3); 19133cf72582SMatthew G. Knepley PetscValidPointer(dmHybrid, 4); 1914c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 19153cf72582SMatthew G. Knepley ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr); 19163cf72582SMatthew G. Knepley ierr = DMPlexOrient(idm);CHKERRQ(ierr); 19173cf72582SMatthew G. Knepley ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr); 19183cf72582SMatthew G. Knepley ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr); 19193cf72582SMatthew G. Knepley ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr); 19200f66a230SMatthew G. Knepley ierr = DMPlexLabelCohesiveComplete(dm, hlabel, NULL, PETSC_FALSE, idm);CHKERRQ(ierr); 19213cf72582SMatthew G. Knepley ierr = DMDestroy(&idm);CHKERRQ(ierr); 19223cf72582SMatthew G. Knepley ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr); 19233cf72582SMatthew G. Knepley if (hybridLabel) *hybridLabel = hlabel; 192453aa2e23SMatthew G. Knepley else {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);} 1925cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1926cd0c2139SMatthew G Knepley } 1927cd0c2139SMatthew G Knepley 1928efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 1929efa14ee0SMatthew G Knepley 1930efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 1931efa14ee0SMatthew G Knepley */ 1932830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1933efa14ee0SMatthew G Knepley { 1934fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 1935efa14ee0SMatthew G Knepley const PetscInt *subvertices; 193677d178adSMatthew G. Knepley PetscInt *pStart, *pEnd, *pMax, pSize; 1937efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1938efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1939efa14ee0SMatthew G Knepley 1940efa14ee0SMatthew G Knepley PetscFunctionBegin; 1941efa14ee0SMatthew G Knepley *numFaces = 0; 1942efa14ee0SMatthew G Knepley *nFV = 0; 1943efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1944c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 194577d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1946dcca6d9dSJed Brown ierr = PetscMalloc3(pSize,&pStart,pSize,&pEnd,pSize,&pMax);CHKERRQ(ierr); 1947d92e47f8SMatthew 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); 1948efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 1949efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1950efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1951efa14ee0SMatthew G Knepley } 1952efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1953fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1954efa14ee0SMatthew G Knepley if (subvertexIS) { 1955efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1956efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1957efa14ee0SMatthew G Knepley } 1958efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1959efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 19600298fd71SBarry Smith PetscInt *star = NULL; 1961efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 1962efa14ee0SMatthew G Knepley 1963efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1964efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1965efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1966efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1967efa14ee0SMatthew G Knepley } 1968efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 1969efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 19700298fd71SBarry Smith PetscInt *closure = NULL; 1971efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 1972efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 1973efa14ee0SMatthew G Knepley 1974efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 197565560c7fSMatthew G Knepley if (cellLoc == 2) continue; 197682f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1977efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1978efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1979efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1980efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1981efa14ee0SMatthew G Knepley 1982efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1983efa14ee0SMatthew G Knepley ++numCorners; 1984efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1985830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 1986efa14ee0SMatthew G Knepley } 1987efa14ee0SMatthew G Knepley } 198818ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 198982f516ccSBarry 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); 1990efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 1991007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 1992007baee2SMatthew G. Knepley PetscInt numCells, nc; 1993007baee2SMatthew G. Knepley 1994efa14ee0SMatthew G Knepley ++(*numFaces); 1995efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 1996efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 1997efa14ee0SMatthew G Knepley } 1998007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1999007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 2000007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 2001007baee2SMatthew G. Knepley } 2002007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 2003efa14ee0SMatthew G Knepley } 2004efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2005efa14ee0SMatthew G Knepley } 2006efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 2007efa14ee0SMatthew G Knepley } 2008efa14ee0SMatthew G Knepley if (subvertexIS) { 2009efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 2010efa14ee0SMatthew G Knepley } 2011efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2012efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 2013efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 2014efa14ee0SMatthew G Knepley } 2015efa14ee0SMatthew G Knepley 2016830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 2017efa14ee0SMatthew G Knepley { 201834b4c39eSMatthew G. Knepley IS subvertexIS = NULL; 2019efa14ee0SMatthew G Knepley const PetscInt *subvertices; 2020efa14ee0SMatthew G Knepley PetscInt *pStart, *pEnd, *pMax; 2021efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 2022efa14ee0SMatthew G Knepley PetscErrorCode ierr; 2023efa14ee0SMatthew G Knepley 2024efa14ee0SMatthew G Knepley PetscFunctionBegin; 2025c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2026dcca6d9dSJed Brown ierr = PetscMalloc3(dim+1,&pStart,dim+1,&pEnd,dim+1,&pMax);CHKERRQ(ierr); 20270298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 2028efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 2029efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 2030efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 2031efa14ee0SMatthew G Knepley } 2032efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 203334b4c39eSMatthew G. Knepley if (vertexLabel) { 2034830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 2035efa14ee0SMatthew G Knepley if (subvertexIS) { 2036efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 2037efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 2038efa14ee0SMatthew G Knepley } 203934b4c39eSMatthew G. Knepley } 2040efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 2041efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 20420298fd71SBarry Smith PetscInt *star = NULL; 2043efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 2044efa14ee0SMatthew G Knepley 2045efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 2046efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 2047efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 2048efa14ee0SMatthew G Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 2049efa14ee0SMatthew G Knepley } 2050efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 2051efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 20520298fd71SBarry Smith PetscInt *closure = NULL; 2053efa14ee0SMatthew G Knepley PetscInt closureSize, c; 2054efa14ee0SMatthew G Knepley PetscInt faceLoc; 2055efa14ee0SMatthew G Knepley 2056efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 2057efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 205882f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 2059efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2060efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 2061efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 2062efa14ee0SMatthew G Knepley PetscInt vertexLoc; 2063efa14ee0SMatthew G Knepley 2064efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 2065efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 2066830e53efSMatthew G. Knepley if (vertexLoc != value) break; 2067efa14ee0SMatthew G Knepley } 2068efa14ee0SMatthew G Knepley } 2069efa14ee0SMatthew G Knepley if (c == closureSize*2) { 2070efa14ee0SMatthew G Knepley const PetscInt *support; 2071efa14ee0SMatthew G Knepley PetscInt supportSize, s; 2072efa14ee0SMatthew G Knepley 2073efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 2074efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 2075efa14ee0SMatthew G Knepley 2076efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 2077efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 2078efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 2079efa14ee0SMatthew G Knepley break; 2080efa14ee0SMatthew G Knepley } 2081efa14ee0SMatthew G Knepley } 2082efa14ee0SMatthew G Knepley } 2083efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2084efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2085efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 2086efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 2087efa14ee0SMatthew G Knepley } 2088efa14ee0SMatthew G Knepley } 2089efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2090efa14ee0SMatthew G Knepley } 2091efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 2092efa14ee0SMatthew G Knepley } 209334b4c39eSMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);} 2094efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2095efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 2096efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 2097efa14ee0SMatthew G Knepley } 2098efa14ee0SMatthew G Knepley 209927c04023SMatthew 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) 2100766ab985SMatthew G. Knepley { 210127c04023SMatthew G. Knepley DMLabel label = NULL; 2102766ab985SMatthew G. Knepley const PetscInt *cone; 21039fc93327SToby Isaac PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize = -1; 2104766ab985SMatthew G. Knepley PetscErrorCode ierr; 2105766ab985SMatthew G. Knepley 2106812bfc34SJed Brown PetscFunctionBegin; 2107c0ed958bSJed Brown *numFaces = 0; 2108c0ed958bSJed Brown *nFV = 0; 2109c58f1c22SToby Isaac if (labelname) {ierr = DMGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 2110fed694aaSMatthew G. Knepley *subCells = NULL; 2111c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2112766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 2113766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2114766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 211527c04023SMatthew G. Knepley if (label) { 211627c04023SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 211727c04023SMatthew G. Knepley PetscInt val; 211827c04023SMatthew G. Knepley 211927c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 212027c04023SMatthew G. Knepley if (val == value) { 212127c04023SMatthew G. Knepley ++(*numFaces); 212227c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 212327c04023SMatthew G. Knepley } 212427c04023SMatthew G. Knepley } 212527c04023SMatthew G. Knepley } else { 2126766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 212727c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 212827c04023SMatthew G. Knepley } 2129785e854fSJed Brown ierr = PetscMalloc1(*numFaces *2, subCells);CHKERRQ(ierr); 21309fc93327SToby Isaac if (!(*numFaces)) PetscFunctionReturn(0); 21319fc93327SToby Isaac *nFV = hasLagrange ? coneSize/3 : coneSize/2; 2132766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 2133766ab985SMatthew G. Knepley const PetscInt *cells; 2134766ab985SMatthew G. Knepley PetscInt numCells; 2135766ab985SMatthew G. Knepley 213627c04023SMatthew G. Knepley if (label) { 213727c04023SMatthew G. Knepley PetscInt val; 213827c04023SMatthew G. Knepley 213927c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 214027c04023SMatthew G. Knepley if (val != value) continue; 214127c04023SMatthew G. Knepley } 2142766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2143766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 2144766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 2145766ab985SMatthew G. Knepley } 2146766ab985SMatthew G. Knepley /* Negative face */ 2147766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 214827234c99SMatthew G. Knepley /* Not true in parallel 214927234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 2150766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 2151766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 215227234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 2153766ab985SMatthew G. Knepley } 2154766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 2155766ab985SMatthew G. Knepley /* Positive face is not included */ 2156766ab985SMatthew G. Knepley } 2157766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2158766ab985SMatthew G. Knepley } 2159766ab985SMatthew G. Knepley 21603982b651SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, DMLabel label, PetscInt value, DMLabel subpointMap, DM subdm) 2161766ab985SMatthew G. Knepley { 2162766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 2163766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 2164766ab985SMatthew G. Knepley PetscErrorCode ierr; 2165766ab985SMatthew G. Knepley 2166812bfc34SJed Brown PetscFunctionBegin; 2167c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2168766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 2169766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2170766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 2171dcca6d9dSJed Brown ierr = PetscMalloc2(dim+1,&pStart,dim+1,&pEnd);CHKERRQ(ierr); 2172b3154360SMatthew G. Knepley for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);} 2173766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 2174766ab985SMatthew G. Knepley const PetscInt *cone; 2175766ab985SMatthew G. Knepley PetscInt *closure = NULL; 2176b3154360SMatthew G. Knepley PetscInt fconeSize, coneSize, closureSize, cl, val; 2177766ab985SMatthew G. Knepley 217827c04023SMatthew G. Knepley if (label) { 217927c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 218027c04023SMatthew G. Knepley if (val != value) continue; 218127c04023SMatthew G. Knepley } 2182766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2183766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2184b3154360SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr); 2185b3154360SMatthew G. Knepley if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 2186b3154360SMatthew G. Knepley /* Negative face */ 2187766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2188766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2189766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 2190766ab985SMatthew G. Knepley 2191766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2192766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 2193766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 2194766ab985SMatthew G. Knepley break; 2195766ab985SMatthew G. Knepley } 2196766ab985SMatthew G. Knepley } 2197766ab985SMatthew G. Knepley } 2198766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2199766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 2200766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 2201766ab985SMatthew G. Knepley const PetscInt *support; 2202766ab985SMatthew G. Knepley PetscInt supportSize, s; 2203766ab985SMatthew G. Knepley 2204766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 2205711de394SMatthew G. Knepley /* if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); */ 2206766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 2207766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 2208766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 2209766ab985SMatthew G. Knepley } 2210766ab985SMatthew G. Knepley } 2211766ab985SMatthew G. Knepley } 2212766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 2213766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2214766ab985SMatthew G. Knepley } 2215766ab985SMatthew G. Knepley 2216c08575a3SMatthew G. Knepley static PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2217e6ccafaeSMatthew G Knepley { 221882f516ccSBarry Smith MPI_Comm comm; 2219e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 2220e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 2221e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 2222e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2223e6ccafaeSMatthew G Knepley 222482f516ccSBarry Smith PetscFunctionBegin; 222582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2226c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &cellDim);CHKERRQ(ierr); 2227e6ccafaeSMatthew G Knepley if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 2228e6ccafaeSMatthew G Knepley 2229ddeab2a6SMatthew G. Knepley if (cellDim == 1 && numCorners == 2) { 2230ddeab2a6SMatthew G. Knepley /* Triangle */ 2231e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 2232e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2233ddeab2a6SMatthew G. Knepley } else if (cellDim == 2 && numCorners == 3) { 2234ddeab2a6SMatthew G. Knepley /* Triangle */ 2235ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2236ddeab2a6SMatthew G. Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2237ddeab2a6SMatthew G. Knepley } else if (cellDim == 3 && numCorners == 4) { 2238ddeab2a6SMatthew G. Knepley /* Tetrahedron */ 2239ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2240ddeab2a6SMatthew G. Knepley posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2241e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 2242e6ccafaeSMatthew G Knepley /* Quadratic line */ 2243e6ccafaeSMatthew G Knepley faceSize = 1; 2244e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2245e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 2246e6ccafaeSMatthew G Knepley /* Quads */ 2247e6ccafaeSMatthew G Knepley faceSize = 2; 2248e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 2249e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2250e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 2251e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2252e6ccafaeSMatthew G Knepley } else { 2253e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 2254e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 2255e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 2256e6ccafaeSMatthew G Knepley } 2257e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 2258e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 2259e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2260e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 2261e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2262e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2263e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 2264e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2265e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2266e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 2267e6ccafaeSMatthew G Knepley }; 2268e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 2269e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2270e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2271e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 2272e6ccafaeSMatthew G Knepley }; 2273e6ccafaeSMatthew G Knepley 2274e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 2275e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 2276e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 2277e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 2278e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2279e6ccafaeSMatthew G Knepley 2280e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 2281e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 2282e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 2283e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 2284e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 2285e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2286e6ccafaeSMatthew G Knepley break; 2287e6ccafaeSMatthew G Knepley } 2288e6ccafaeSMatthew G Knepley } 2289e6ccafaeSMatthew G Knepley } 2290e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2291e6ccafaeSMatthew G Knepley break; 2292e6ccafaeSMatthew G Knepley } 2293e6ccafaeSMatthew G Knepley } 2294e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 2295e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2296e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2297e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 2298e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 2299e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2300e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 2301e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2302e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2303e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 2304e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2305e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2306e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2307e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 2308e6ccafaeSMatthew G Knepley }; 2309e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 2310e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2311e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2312e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2313e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 2314e6ccafaeSMatthew G Knepley }; 2315e6ccafaeSMatthew G Knepley 2316e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 2317e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 2318e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 2319e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 2320e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2321e6ccafaeSMatthew G Knepley 2322e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 2323e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 2324e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 2325e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 2326e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 2327e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2328e6ccafaeSMatthew G Knepley break; 2329e6ccafaeSMatthew G Knepley } 2330e6ccafaeSMatthew G Knepley } 2331e6ccafaeSMatthew G Knepley } 2332e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2333e6ccafaeSMatthew G Knepley break; 2334e6ccafaeSMatthew G Knepley } 2335e6ccafaeSMatthew G Knepley } 2336e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 2337e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2338e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2339e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 2340e6ccafaeSMatthew G Knepley /* Hexes 2341e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2342e6ccafaeSMatthew G Knepley pointing up at the second. 2343e6ccafaeSMatthew G Knepley 2344e6ccafaeSMatthew G Knepley 7---6 2345e6ccafaeSMatthew G Knepley /| /| 2346e6ccafaeSMatthew G Knepley 4---5 | 2347ddeab2a6SMatthew G. Knepley | 1-|-2 2348e6ccafaeSMatthew G Knepley |/ |/ 2349ddeab2a6SMatthew G. Knepley 0---3 2350e6ccafaeSMatthew G Knepley 2351e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2352e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 2353e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 2354e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2355e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 2356e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 2357e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2358ddeab2a6SMatthew G. Knepley 0, 3, 4, 5, /* front */ 2359ddeab2a6SMatthew G. Knepley 2, 3, 5, 6, /* right */ 2360ddeab2a6SMatthew G. Knepley 1, 2, 6, 7, /* back */ 2361ddeab2a6SMatthew G. Knepley 0, 1, 4, 7, /* left */ 2362e6ccafaeSMatthew G Knepley }; 2363e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 2364ddeab2a6SMatthew G. Knepley 1, 2, 3, 0, /* bottom */ 2365e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2366ddeab2a6SMatthew G. Knepley 0, 3, 5, 4, /* front */ 2367ddeab2a6SMatthew G. Knepley 3, 2, 6, 5, /* right */ 2368ddeab2a6SMatthew G. Knepley 2, 1, 7, 6, /* back */ 2369ddeab2a6SMatthew G. Knepley 1, 0, 4, 7, /* left */ 2370e6ccafaeSMatthew G Knepley }; 2371e6ccafaeSMatthew G Knepley 2372e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 2373e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 2374e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2375e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 2376e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2377e6ccafaeSMatthew G Knepley 2378e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 2379e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 2380e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 2381e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 2382e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 2383e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 2384e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 2385e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2386e6ccafaeSMatthew G Knepley break; 2387e6ccafaeSMatthew G Knepley } 2388e6ccafaeSMatthew G Knepley } 2389e6ccafaeSMatthew G Knepley } 2390e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2391e6ccafaeSMatthew G Knepley break; 2392e6ccafaeSMatthew G Knepley } 2393e6ccafaeSMatthew G Knepley } 2394e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2395e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2396e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2397e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 2398e6ccafaeSMatthew G Knepley /* Quadratic tet */ 2399e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 2400e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 2401e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 2402e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2403e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 2404e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2405e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 2406e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 2407e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 2408e6ccafaeSMatthew G Knepley }; 2409e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 2410e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2411e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 2412e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 2413e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 2414e6ccafaeSMatthew G Knepley }; 2415e6ccafaeSMatthew G Knepley 2416e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 2417e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 2418e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 2419e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 2420e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2421e6ccafaeSMatthew G Knepley 2422e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 2423e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 2424e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 2425e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 2426e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 2427e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 2428e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 2429e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2430e6ccafaeSMatthew G Knepley break; 2431e6ccafaeSMatthew G Knepley } 2432e6ccafaeSMatthew G Knepley } 2433e6ccafaeSMatthew G Knepley } 2434e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2435e6ccafaeSMatthew G Knepley break; 2436e6ccafaeSMatthew G Knepley } 2437e6ccafaeSMatthew G Knepley } 2438e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 2439e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2440e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2441e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 2442e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 2443e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2444e6ccafaeSMatthew G Knepley pointing up at the second. 2445e6ccafaeSMatthew G Knepley 2446e6ccafaeSMatthew G Knepley 7---6 2447e6ccafaeSMatthew G Knepley /| /| 2448e6ccafaeSMatthew G Knepley 4---5 | 2449e6ccafaeSMatthew G Knepley | 3-|-2 2450e6ccafaeSMatthew G Knepley |/ |/ 2451e6ccafaeSMatthew G Knepley 0---1 2452e6ccafaeSMatthew G Knepley 2453e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2454e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 2455e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 2456e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2457e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 2458e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 2459e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2460e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 2461e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 2462e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 2463e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 2464e6ccafaeSMatthew G Knepley }; 2465e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 2466e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 2467e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2468e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 2469e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 2470e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 2471e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 2472e6ccafaeSMatthew G Knepley }; 2473e6ccafaeSMatthew G Knepley 2474e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 2475e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 2476e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2477e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 2478e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2479e6ccafaeSMatthew G Knepley 2480e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 2481e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 2482e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 2483e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 2484e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 2485e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 2486e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 2487e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2488e6ccafaeSMatthew G Knepley break; 2489e6ccafaeSMatthew G Knepley } 2490e6ccafaeSMatthew G Knepley } 2491e6ccafaeSMatthew G Knepley } 2492e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2493e6ccafaeSMatthew G Knepley break; 2494e6ccafaeSMatthew G Knepley } 2495e6ccafaeSMatthew G Knepley } 2496e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2497e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2498e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2499e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 2500e6ccafaeSMatthew G Knepley if (!posOrient) { 2501e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 2502e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 2503e6ccafaeSMatthew G Knepley } else { 2504e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 2505e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 2506e6ccafaeSMatthew G Knepley } 2507e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 2508e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2509e6ccafaeSMatthew G Knepley } 2510e6ccafaeSMatthew G Knepley 2511c08575a3SMatthew G. Knepley /*@ 2512c08575a3SMatthew G. Knepley DMPlexGetOrientedFace - Given a cell and a face, as a set of vertices, return the oriented face, as a set of vertices, 2513c08575a3SMatthew G. Knepley in faceVertices. The orientation is such that the face normal points out of the cell 2514c08575a3SMatthew G. Knepley 2515c08575a3SMatthew G. Knepley Not collective 2516c08575a3SMatthew G. Knepley 2517c08575a3SMatthew G. Knepley Input Parameters: 2518c08575a3SMatthew G. Knepley + dm - The original mesh 2519c08575a3SMatthew G. Knepley . cell - The cell mesh point 2520c08575a3SMatthew G. Knepley . faceSize - The number of vertices on the face 2521c08575a3SMatthew G. Knepley . face - The face vertices 2522c08575a3SMatthew G. Knepley . numCorners - The number of vertices on the cell 2523c08575a3SMatthew G. Knepley . indices - Local numbering of face vertices in cell cone 2524c08575a3SMatthew G. Knepley - origVertices - Original face vertices 2525c08575a3SMatthew G. Knepley 2526c08575a3SMatthew G. Knepley Output Parameter: 2527c08575a3SMatthew G. Knepley + faceVertices - The face vertices properly oriented 2528c08575a3SMatthew G. Knepley - posOriented - PETSC_TRUE if the face was oriented with outward normal 2529c08575a3SMatthew G. Knepley 2530c08575a3SMatthew G. Knepley Level: developer 2531c08575a3SMatthew G. Knepley 2532c08575a3SMatthew G. Knepley .seealso: DMPlexGetCone() 2533c08575a3SMatthew G. Knepley @*/ 2534e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2535e6ccafaeSMatthew G Knepley { 25360298fd71SBarry Smith const PetscInt *cone = NULL; 2537e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 2538e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 2539e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2540e6ccafaeSMatthew G Knepley 2541e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2542e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 2543e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 2544e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 2545e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2546e6ccafaeSMatthew G Knepley 2547e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 2548e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 2549e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 2550e6ccafaeSMatthew G Knepley } 2551e6ccafaeSMatthew G Knepley } 2552e6ccafaeSMatthew G Knepley if (found) { 2553e6ccafaeSMatthew G Knepley indices[v2] = v; 2554e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 2555e6ccafaeSMatthew G Knepley ++v2; 2556e6ccafaeSMatthew G Knepley } else { 2557e6ccafaeSMatthew G Knepley oppositeVertex = v; 2558e6ccafaeSMatthew G Knepley } 2559e6ccafaeSMatthew G Knepley } 2560e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 2561e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2562e6ccafaeSMatthew G Knepley } 2563e6ccafaeSMatthew G Knepley 2564e6ccafaeSMatthew G Knepley /* 2565cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 2566e6ccafaeSMatthew G Knepley 2567e6ccafaeSMatthew G Knepley Not collective 2568e6ccafaeSMatthew G Knepley 2569e6ccafaeSMatthew G Knepley Input Parameters: 2570e6ccafaeSMatthew G Knepley + dm - The DMPlex 2571e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 2572e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 2573e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 2574e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 2575e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 2576e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 2577e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 2578e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 2579e6ccafaeSMatthew G Knepley 2580e6ccafaeSMatthew G Knepley Output Parameters: 2581e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 2582e6ccafaeSMatthew G Knepley 2583e6ccafaeSMatthew G Knepley Level: developer 2584e6ccafaeSMatthew G Knepley */ 2585cd0c2139SMatthew 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) 2586e6ccafaeSMatthew G Knepley { 258782f516ccSBarry Smith MPI_Comm comm; 2588e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 2589e6ccafaeSMatthew G Knepley const PetscInt *faces; 2590e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 2591e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2592e6ccafaeSMatthew G Knepley 2593e6ccafaeSMatthew G Knepley PetscFunctionBegin; 259482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2595e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 2596e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 2597e6ccafaeSMatthew G Knepley #if 0 2598e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 2599e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2600e6ccafaeSMatthew G Knepley #else 2601e6ccafaeSMatthew G Knepley { 2602e6ccafaeSMatthew G Knepley PetscInt f; 2603e6ccafaeSMatthew G Knepley 2604e6ccafaeSMatthew G Knepley numFaces = 0; 2605e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2606e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 2607e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 2608e6ccafaeSMatthew G Knepley 2609e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 2610e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 2611e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 2612e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 2613e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 2614e6ccafaeSMatthew G Knepley PetscInt v; 2615e6ccafaeSMatthew G Knepley 2616e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2617e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 2618e6ccafaeSMatthew G Knepley } 2619e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 2620e6ccafaeSMatthew G Knepley } 2621e6ccafaeSMatthew G Knepley if (d == dof) { 2622e6ccafaeSMatthew G Knepley numFaces = 1; 2623e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 2624e6ccafaeSMatthew G Knepley } 2625e6ccafaeSMatthew G Knepley } 2626e6ccafaeSMatthew G Knepley } 2627e6ccafaeSMatthew G Knepley #endif 2628e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 2629e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 2630e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 2631766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 2632e6ccafaeSMatthew G Knepley } else { 2633e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 2634e6ccafaeSMatthew G Knepley PetscBool posOriented; 2635e6ccafaeSMatthew G Knepley 2636e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2637e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 2638e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 2639e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 2640e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 2641e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 2642e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2643e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 2644e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 2645e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 2646e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 2647e6ccafaeSMatthew G Knepley break; 2648e6ccafaeSMatthew G Knepley } 2649e6ccafaeSMatthew G Knepley } 2650e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 2651e6ccafaeSMatthew G Knepley } 2652e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 2653e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 2654e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2655e6ccafaeSMatthew G Knepley ++(*newFacePoint); 2656e6ccafaeSMatthew G Knepley } 2657ef07cca7SMatthew G. Knepley #if 0 2658e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2659ef07cca7SMatthew G. Knepley #else 2660ef07cca7SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2661ef07cca7SMatthew G. Knepley #endif 2662e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2663e6ccafaeSMatthew G Knepley } 2664e6ccafaeSMatthew G Knepley 266553156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2666e6ccafaeSMatthew G Knepley { 266782f516ccSBarry Smith MPI_Comm comm; 266853156dfcSMatthew G. Knepley DMLabel subpointMap; 2669efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 2670efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 2671efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 2672fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 2673efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 2674e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2675e6ccafaeSMatthew G Knepley 2676e6ccafaeSMatthew G Knepley PetscFunctionBegin; 267782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2678efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2679efa14ee0SMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2680efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2681efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 268253156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);} 2683efa14ee0SMatthew G Knepley /* Setup chart */ 2684efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2685efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2686efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2687efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2688e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2689e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 2690efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 2691e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 2692efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2693efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2694efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 2695efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2696e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2697e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2698e6ccafaeSMatthew G Knepley } 2699e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2700e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2701e6ccafaeSMatthew G Knepley } 2702e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2703e6ccafaeSMatthew G Knepley /* Create face cones */ 2704efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 27050298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2706efa14ee0SMatthew G Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2707e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2708e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 2709efa14ee0SMatthew G Knepley const PetscInt subcell = c; 27100298fd71SBarry Smith PetscInt *closure = NULL; 2711efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 2712e6ccafaeSMatthew G Knepley 2713e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2714efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2715efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 2716e6ccafaeSMatthew G Knepley PetscInt subVertex; 2717e6ccafaeSMatthew G Knepley 2718efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 2719efa14ee0SMatthew G Knepley ++numCorners; 2720efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 2721efa14ee0SMatthew G Knepley if (subVertex >= 0) { 2722efa14ee0SMatthew G Knepley closure[faceSize] = point; 272365560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 2724e6ccafaeSMatthew G Knepley ++faceSize; 2725e6ccafaeSMatthew G Knepley } 2726e6ccafaeSMatthew G Knepley } 2727e6ccafaeSMatthew G Knepley } 2728efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 2729efa14ee0SMatthew G Knepley if (faceSize == nFV) { 2730cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 2731e6ccafaeSMatthew G Knepley } 273265560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2733e6ccafaeSMatthew G Knepley } 2734efa14ee0SMatthew G Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2735e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2736e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2737e6ccafaeSMatthew G Knepley /* Build coordinates */ 2738efa14ee0SMatthew G Knepley { 2739efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 2740efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 2741efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 2742285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 274324640c55SToby Isaac const char *name; 2744efa14ee0SMatthew G Knepley 274569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2746e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 274769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2748285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2749285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2750285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2751efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2752efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2753efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2754efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2755efa14ee0SMatthew G Knepley PetscInt dof; 2756efa14ee0SMatthew G Knepley 2757efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2758efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2759285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2760e6ccafaeSMatthew G Knepley } 2761e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2762e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 27638b9ced59SLisandro Dalcin ierr = VecCreate(PETSC_COMM_SELF, &subCoordinates);CHKERRQ(ierr); 276424640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 276524640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr); 2766e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 27672eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2768830e53efSMatthew G. Knepley if (coordSize) { 2769e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2770e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2771efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2772efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2773efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2774efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2775e6ccafaeSMatthew G Knepley 2776e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2777e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2778efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2779efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2780efa14ee0SMatthew 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); 2781e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2782e6ccafaeSMatthew G Knepley } 2783e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2784e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 27853b399e24SMatthew G. Knepley } 2786e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2787e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2788e6ccafaeSMatthew G Knepley } 2789efa14ee0SMatthew G Knepley /* Cleanup */ 2790efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2791efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2792efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2793efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2794e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2795e6ccafaeSMatthew G Knepley } 2796e6ccafaeSMatthew G Knepley 27973982b651SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 27983982b651SMatthew G. Knepley { 27993982b651SMatthew G. Knepley PetscInt subPoint; 28003982b651SMatthew G. Knepley PetscErrorCode ierr; 28013982b651SMatthew G. Knepley 28023982b651SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 28033982b651SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 28043982b651SMatthew G. Knepley } 28053982b651SMatthew G. Knepley 2806bec263e5SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmeshGeneric_Interpolated(DM dm, DMLabel label, PetscInt value, PetscBool isCohesive, PetscInt cellHeight, DM subdm) 2807e6ccafaeSMatthew G Knepley { 280882f516ccSBarry Smith MPI_Comm comm; 280953156dfcSMatthew G. Knepley DMLabel subpointMap; 2810efa14ee0SMatthew G Knepley IS *subpointIS; 2811efa14ee0SMatthew G Knepley const PetscInt **subpoints; 28123982b651SMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *orntNew; 2813efa14ee0SMatthew G Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2814e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2815e6ccafaeSMatthew G Knepley 2816e6ccafaeSMatthew G Knepley PetscFunctionBegin; 281782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);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); 2849efa14ee0SMatthew G Knepley /* Setup chart */ 2850c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2851dcca6d9dSJed Brown ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr); 2852e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2853e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2854e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 2855e6ccafaeSMatthew G Knepley } 2856e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2857bec263e5SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, cellHeight);CHKERRQ(ierr); 2858e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2859e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 2860e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2861e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2862e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2863e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2864e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 28650ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2866e6ccafaeSMatthew G Knepley } 2867e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2868e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2869e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2870e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2871e6ccafaeSMatthew G Knepley const PetscInt *cone; 2872e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 2873e6ccafaeSMatthew G Knepley 2874e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2875e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2876bec263e5SMatthew G. Knepley if (cellHeight && (d == dim)) { 2877e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2878e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2879e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2880e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 2881e6ccafaeSMatthew G Knepley } 2882e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2883e6ccafaeSMatthew G Knepley } 2884e6ccafaeSMatthew G Knepley } 2885e6ccafaeSMatthew G Knepley } 2886e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2887e6ccafaeSMatthew G Knepley /* Set cones */ 28880298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 28893982b651SMatthew G. Knepley ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&orntNew);CHKERRQ(ierr); 2890e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2891e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2892e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2893e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 28940e49e2e2SMatthew G. Knepley const PetscInt *cone, *ornt; 2895e6ccafaeSMatthew G Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2896e6ccafaeSMatthew G Knepley 2897e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2898e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2899e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 29000e49e2e2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2901e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2902e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 290301a2673eSMatthew G. Knepley if (subc >= 0) { 290401a2673eSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 29053982b651SMatthew G. Knepley orntNew[coneSizeNew] = ornt[c]; 290601a2673eSMatthew G. Knepley ++coneSizeNew; 290701a2673eSMatthew G. Knepley } 2908e6ccafaeSMatthew G Knepley } 2909e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2910e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 29113982b651SMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, orntNew);CHKERRQ(ierr); 2912e6ccafaeSMatthew G Knepley } 2913e6ccafaeSMatthew G Knepley } 29143982b651SMatthew G. Knepley ierr = PetscFree2(coneNew,orntNew);CHKERRQ(ierr); 2915e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2916e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2917e6ccafaeSMatthew G Knepley /* Build coordinates */ 2918e6ccafaeSMatthew G Knepley { 2919e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 2920e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 2921e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 2922285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 292324640c55SToby Isaac const char *name; 2924e6ccafaeSMatthew G Knepley 292569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2926e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 292769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2928285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2929285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2930285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2931e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2932e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2933e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2934e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2935e6ccafaeSMatthew G Knepley PetscInt dof; 2936e6ccafaeSMatthew G Knepley 2937e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2938e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2939285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2940e6ccafaeSMatthew G Knepley } 2941e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2942e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 29438b9ced59SLisandro Dalcin ierr = VecCreate(PETSC_COMM_SELF, &subCoordinates);CHKERRQ(ierr); 294424640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 294524640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr); 2946e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 29472eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2948e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2949e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2950e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2951e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2952e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2953e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2954e6ccafaeSMatthew G Knepley 2955e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2956e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2957e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2958e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2959e6ccafaeSMatthew 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); 2960efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2961e6ccafaeSMatthew G Knepley } 2962e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2963e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2964e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2965e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2966e6ccafaeSMatthew G Knepley } 29673982b651SMatthew G. Knepley /* Build SF: We need this complexity because subpoints might not be selected on the owning process */ 29683982b651SMatthew G. Knepley { 29693982b651SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 29703982b651SMatthew G. Knepley IS subpIS; 29713982b651SMatthew G. Knepley const PetscSFNode *remotePoints; 29723982b651SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 29733982b651SMatthew G. Knepley const PetscInt *localPoints, *subpoints; 29743982b651SMatthew G. Knepley PetscInt *slocalPoints; 29753982b651SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubpoints = 0, numSubroots, numSubleaves = 0, l, sl, ll, pStart, pEnd, p; 29763982b651SMatthew G. Knepley PetscMPIInt rank; 29773982b651SMatthew G. Knepley 29783982b651SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 29793982b651SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 29803982b651SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 29813982b651SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 29823982b651SMatthew G. Knepley ierr = DMPlexGetChart(subdm, NULL, &numSubroots);CHKERRQ(ierr); 29833982b651SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpIS);CHKERRQ(ierr); 29843982b651SMatthew G. Knepley if (subpIS) { 29853982b651SMatthew G. Knepley ierr = ISGetIndices(subpIS, &subpoints);CHKERRQ(ierr); 29863982b651SMatthew G. Knepley ierr = ISGetLocalSize(subpIS, &numSubpoints);CHKERRQ(ierr); 29873982b651SMatthew G. Knepley } 29883982b651SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 29893982b651SMatthew G. Knepley if (numRoots >= 0) { 29903982b651SMatthew G. Knepley ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 29913982b651SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 29923982b651SMatthew G. Knepley newLocalPoints[p].rank = -2; 29933982b651SMatthew G. Knepley newLocalPoints[p].index = -2; 29943982b651SMatthew G. Knepley } 29953982b651SMatthew G. Knepley /* Set subleaves */ 29963982b651SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 29973982b651SMatthew G. Knepley const PetscInt point = localPoints[l]; 29983982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 29993982b651SMatthew G. Knepley 30003982b651SMatthew G. Knepley if (subpoint < 0) continue; 30013982b651SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 30023982b651SMatthew G. Knepley newLocalPoints[point-pStart].index = subpoint; 30033982b651SMatthew G. Knepley ++numSubleaves; 30043982b651SMatthew G. Knepley } 30053982b651SMatthew G. Knepley /* Must put in owned subpoints */ 30063982b651SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 30073982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(p, 0, numSubpoints, subpoints); 30083982b651SMatthew G. Knepley 30093982b651SMatthew G. Knepley if (subpoint < 0) { 30103982b651SMatthew G. Knepley newOwners[p-pStart].rank = -3; 30113982b651SMatthew G. Knepley newOwners[p-pStart].index = -3; 30123982b651SMatthew G. Knepley } else { 30133982b651SMatthew G. Knepley newOwners[p-pStart].rank = rank; 30143982b651SMatthew G. Knepley newOwners[p-pStart].index = subpoint; 30153982b651SMatthew G. Knepley } 30163982b651SMatthew G. Knepley } 30173982b651SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 30183982b651SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 30193982b651SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 30203982b651SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 30213982b651SMatthew G. Knepley ierr = PetscMalloc1(numSubleaves, &slocalPoints);CHKERRQ(ierr); 30223982b651SMatthew G. Knepley ierr = PetscMalloc1(numSubleaves, &sremotePoints);CHKERRQ(ierr); 30233982b651SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 30243982b651SMatthew G. Knepley const PetscInt point = localPoints[l]; 30253982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 30263982b651SMatthew G. Knepley 30273982b651SMatthew G. Knepley if (subpoint < 0) continue; 30283982b651SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 30293982b651SMatthew G. Knepley slocalPoints[sl] = subpoint; 30303982b651SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 30313982b651SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 30323982b651SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 30333982b651SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 30343982b651SMatthew G. Knepley ++sl; 30353982b651SMatthew G. Knepley } 30363982b651SMatthew G. Knepley if (sl + ll != numSubleaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubleaves); 30373982b651SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 30383982b651SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubroots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 30393982b651SMatthew G. Knepley } 30403982b651SMatthew G. Knepley if (subpIS) { 30413982b651SMatthew G. Knepley ierr = ISRestoreIndices(subpIS, &subpoints);CHKERRQ(ierr); 30423982b651SMatthew G. Knepley ierr = ISDestroy(&subpIS);CHKERRQ(ierr); 30433982b651SMatthew G. Knepley } 30443982b651SMatthew G. Knepley } 3045efa14ee0SMatthew G Knepley /* Cleanup */ 3046e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 30470ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 3048e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 3049e6ccafaeSMatthew G Knepley } 3050efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 3051e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3052e6ccafaeSMatthew G Knepley } 3053e6ccafaeSMatthew G Knepley 30543982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 30553982b651SMatthew G. Knepley { 30563982b651SMatthew G. Knepley PetscErrorCode ierr; 30573982b651SMatthew G. Knepley 30583982b651SMatthew G. Knepley PetscFunctionBegin; 3059bec263e5SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, vertexLabel, value, PETSC_FALSE, 1, subdm);CHKERRQ(ierr); 30603982b651SMatthew G. Knepley PetscFunctionReturn(0); 30613982b651SMatthew G. Knepley } 30623982b651SMatthew G. Knepley 3063d0fa310fSMatthew G. Knepley /*@ 3064e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 3065e6ccafaeSMatthew G Knepley 3066e6ccafaeSMatthew G Knepley Input Parameters: 3067e6ccafaeSMatthew G Knepley + dm - The original mesh 3068830e53efSMatthew G. Knepley . vertexLabel - The DMLabel marking vertices contained in the surface 3069830e53efSMatthew G. Knepley - value - The label value to use 3070e6ccafaeSMatthew G Knepley 3071e6ccafaeSMatthew G Knepley Output Parameter: 3072e6ccafaeSMatthew G Knepley . subdm - The surface mesh 3073e6ccafaeSMatthew G Knepley 3074e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3075e6ccafaeSMatthew G Knepley 3076e6ccafaeSMatthew G Knepley Level: developer 3077e6ccafaeSMatthew G Knepley 3078c58f1c22SToby Isaac .seealso: DMPlexGetSubpointMap(), DMGetLabel(), DMLabelSetValue() 3079830e53efSMatthew G. Knepley @*/ 308053156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm) 3081e6ccafaeSMatthew G Knepley { 3082e6ccafaeSMatthew G Knepley PetscInt dim, depth; 3083e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3084e6ccafaeSMatthew G Knepley 3085e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3086e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3087766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 3088c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3089e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 309082f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 3091e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3092c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr); 3093e6ccafaeSMatthew G Knepley if (depth == dim) { 3094830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 3095e6ccafaeSMatthew G Knepley } else { 3096830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 3097e6ccafaeSMatthew G Knepley } 3098e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3099e6ccafaeSMatthew G Knepley } 3100e6ccafaeSMatthew G Knepley 310127c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 3102766ab985SMatthew G. Knepley { 3103766ab985SMatthew G. Knepley MPI_Comm comm; 3104766ab985SMatthew G. Knepley DMLabel subpointMap; 3105766ab985SMatthew G. Knepley IS subvertexIS; 3106766ab985SMatthew G. Knepley const PetscInt *subVertices; 3107fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 3108766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 310987feddfdSMatthew G. Knepley PetscInt cMax, c, f; 3110766ab985SMatthew G. Knepley PetscErrorCode ierr; 3111766ab985SMatthew G. Knepley 3112766ab985SMatthew G. Knepley PetscFunctionBegin; 3113766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 3114766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 3115766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 3116766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 3117766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 311827c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 3119766ab985SMatthew G. Knepley /* Setup chart */ 3120766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 3121766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 3122766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 3123766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 3124766ab985SMatthew G. Knepley /* Set cone sizes */ 3125766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 3126766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 3127766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 3128766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 3129766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 3130766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 3131766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 3132766ab985SMatthew G. Knepley } 3133766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 3134766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 3135766ab985SMatthew G. Knepley } 3136766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 3137766ab985SMatthew G. Knepley /* Create face cones */ 3138766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 313987feddfdSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 3140766ab985SMatthew G. Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 3141766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 3142766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 3143766ab985SMatthew G. Knepley const PetscInt subcell = c; 314487feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 314587feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 3146766ab985SMatthew G. Knepley 314787feddfdSMatthew G. Knepley if (cell < cMax) continue; 314887feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 314987feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 315087feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 315187feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 315287feddfdSMatthew G. Knepley } 315387feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 315487feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 315587feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 315627234c99SMatthew G. Knepley /* Not true in parallel 315727234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 315887feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 315987feddfdSMatthew G. Knepley PetscInt negsubcell; 3160766ab985SMatthew G. Knepley 316187feddfdSMatthew G. Knepley if (cells[p] >= cMax) continue; 316287feddfdSMatthew G. Knepley /* I know this is a crap search */ 316387feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 316487feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 3165766ab985SMatthew G. Knepley } 316687feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 316787feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 3168766ab985SMatthew G. Knepley } 316987feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 317087feddfdSMatthew G. Knepley ++newFacePoint; 3171766ab985SMatthew G. Knepley } 3172766ab985SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 3173766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 3174766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 3175766ab985SMatthew G. Knepley /* Build coordinates */ 3176766ab985SMatthew G. Knepley { 3177766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 3178766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 3179766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 3180285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 318124640c55SToby Isaac const char *name; 3182766ab985SMatthew G. Knepley 318369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3184766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 318569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 3186285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 3187285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 3188285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 3189766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 3190766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 3191766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 3192766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 3193766ab985SMatthew G. Knepley PetscInt dof; 3194766ab985SMatthew G. Knepley 3195766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3196766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 3197285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 3198766ab985SMatthew G. Knepley } 3199766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 3200766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 32018b9ced59SLisandro Dalcin ierr = VecCreate(PETSC_COMM_SELF, &subCoordinates);CHKERRQ(ierr); 320224640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 320324640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr); 3204766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 32052eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 3206766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 3207766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3208766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 3209766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 3210766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 3211766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 3212766ab985SMatthew G. Knepley 3213766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3214766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 3215766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 3216766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 3217766ab985SMatthew 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); 3218766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 3219766ab985SMatthew G. Knepley } 3220766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3221766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3222766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 3223766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 3224766ab985SMatthew G. Knepley } 3225aca35d17SMatthew G. Knepley /* Build SF */ 3226aca35d17SMatthew G. Knepley CHKMEMQ; 3227aca35d17SMatthew G. Knepley { 3228aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 3229aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 3230bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 3231aca35d17SMatthew G. Knepley const PetscInt *localPoints; 3232bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 323349c26ae4SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 3234bdcf2095SMatthew G. Knepley PetscMPIInt rank; 3235aca35d17SMatthew G. Knepley 3236bdcf2095SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 3237aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 3238aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 3239aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3240aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3241aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 3242aca35d17SMatthew G. Knepley if (numRoots >= 0) { 3243aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 3244dcca6d9dSJed Brown ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 3245bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 3246bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 3247bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 3248bdcf2095SMatthew G. Knepley } 32499e0823b2SMatthew G. Knepley /* Set subleaves */ 3250aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 3251aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 3252bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 3253aca35d17SMatthew G. Knepley 3254aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 3255bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 3256bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 3257bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 3258bdcf2095SMatthew G. Knepley ++numSubLeaves; 3259aca35d17SMatthew G. Knepley } 32609e0823b2SMatthew G. Knepley /* Must put in owned subpoints */ 32619e0823b2SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 32629e0823b2SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 32639e0823b2SMatthew G. Knepley 32649e0823b2SMatthew G. Knepley if (subPoint < 0) { 32659e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = -3; 32669e0823b2SMatthew G. Knepley newOwners[p-pStart].index = -3; 32679e0823b2SMatthew G. Knepley } else { 32689e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = rank; 32699e0823b2SMatthew G. Knepley newOwners[p-pStart].index = subPoint; 32709e0823b2SMatthew G. Knepley } 3271bdcf2095SMatthew G. Knepley } 3272bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3273bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3274bdcf2095SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3275bdcf2095SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3276785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &slocalPoints);CHKERRQ(ierr); 3277785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &sremotePoints);CHKERRQ(ierr); 327849c26ae4SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 3279bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 3280bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 3281aca35d17SMatthew G. Knepley 3282aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 328349c26ae4SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 3284aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 3285bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 3286bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 3287bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 3288bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 3289aca35d17SMatthew G. Knepley ++sl; 3290aca35d17SMatthew G. Knepley } 3291bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 329249c26ae4SMatthew G. Knepley if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 329349c26ae4SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 3294aca35d17SMatthew G. Knepley } 3295aca35d17SMatthew G. Knepley } 3296aca35d17SMatthew G. Knepley CHKMEMQ; 3297766ab985SMatthew G. Knepley /* Cleanup */ 3298766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 3299766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 3300766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 3301766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3302766ab985SMatthew G. Knepley } 3303766ab985SMatthew G. Knepley 33043982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DM subdm) 3305766ab985SMatthew G. Knepley { 33063982b651SMatthew G. Knepley DMLabel label = NULL; 3307766ab985SMatthew G. Knepley PetscErrorCode ierr; 3308766ab985SMatthew G. Knepley 3309766ab985SMatthew G. Knepley PetscFunctionBegin; 3310c58f1c22SToby Isaac if (labelname) {ierr = DMGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 3311bec263e5SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, label, value, PETSC_TRUE, 1, subdm);CHKERRQ(ierr); 3312766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3313766ab985SMatthew G. Knepley } 3314766ab985SMatthew G. Knepley 3315c08575a3SMatthew G. Knepley /*@C 331627c04023SMatthew 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. 3317766ab985SMatthew G. Knepley 3318766ab985SMatthew G. Knepley Input Parameters: 3319766ab985SMatthew G. Knepley + dm - The original mesh 332027c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 33217afc1a8bSJed Brown . label - A label name, or NULL 332227c04023SMatthew G. Knepley - value - A label value 3323766ab985SMatthew G. Knepley 3324766ab985SMatthew G. Knepley Output Parameter: 3325766ab985SMatthew G. Knepley . subdm - The surface mesh 3326766ab985SMatthew G. Knepley 3327766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3328766ab985SMatthew G. Knepley 3329766ab985SMatthew G. Knepley Level: developer 3330766ab985SMatthew G. Knepley 3331766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 3332c08575a3SMatthew G. Knepley @*/ 333327c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 3334766ab985SMatthew G. Knepley { 3335766ab985SMatthew G. Knepley PetscInt dim, depth; 3336766ab985SMatthew G. Knepley PetscErrorCode ierr; 3337766ab985SMatthew G. Knepley 3338766ab985SMatthew G. Knepley PetscFunctionBegin; 3339766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 334027c04023SMatthew G. Knepley PetscValidPointer(subdm, 5); 3341c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3342766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3343766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 3344766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3345c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr); 3346766ab985SMatthew G. Knepley if (depth == dim) { 3347b3154360SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr); 3348766ab985SMatthew G. Knepley } else { 334927c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 3350e6ccafaeSMatthew G Knepley } 3351e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3352e6ccafaeSMatthew G Knepley } 3353e6ccafaeSMatthew G Knepley 3354bec263e5SMatthew G. Knepley /*@ 3355bec263e5SMatthew G. Knepley DMPlexFilter - Extract a subset of mesh cells defined by a label as a separate mesh 3356bec263e5SMatthew G. Knepley 3357bec263e5SMatthew G. Knepley Input Parameters: 3358bec263e5SMatthew G. Knepley + dm - The original mesh 3359bec263e5SMatthew G. Knepley . cellLabel - The DMLabel marking cells contained in the new mesh 3360bec263e5SMatthew G. Knepley - value - The label value to use 3361bec263e5SMatthew G. Knepley 3362bec263e5SMatthew G. Knepley Output Parameter: 3363bec263e5SMatthew G. Knepley . subdm - The new mesh 3364bec263e5SMatthew G. Knepley 3365bec263e5SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3366bec263e5SMatthew G. Knepley 3367bec263e5SMatthew G. Knepley Level: developer 3368bec263e5SMatthew G. Knepley 3369c58f1c22SToby Isaac .seealso: DMPlexGetSubpointMap(), DMGetLabel(), DMLabelSetValue() 3370bec263e5SMatthew G. Knepley @*/ 3371bec263e5SMatthew G. Knepley PetscErrorCode DMPlexFilter(DM dm, DMLabel cellLabel, PetscInt value, DM *subdm) 3372bec263e5SMatthew G. Knepley { 3373bec263e5SMatthew G. Knepley PetscInt dim; 3374bec263e5SMatthew G. Knepley PetscErrorCode ierr; 3375bec263e5SMatthew G. Knepley 3376bec263e5SMatthew G. Knepley PetscFunctionBegin; 3377bec263e5SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3378bec263e5SMatthew G. Knepley PetscValidPointer(subdm, 3); 3379bec263e5SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3380bec263e5SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject) dm), subdm);CHKERRQ(ierr); 3381bec263e5SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3382bec263e5SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim);CHKERRQ(ierr); 3383bec263e5SMatthew G. Knepley /* Extract submesh in place, could be empty on some procs, could have inconsistency if procs do not both extract a shared cell */ 3384bec263e5SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, cellLabel, value, PETSC_FALSE, 0, *subdm);CHKERRQ(ierr); 3385bec263e5SMatthew G. Knepley PetscFunctionReturn(0); 3386bec263e5SMatthew G. Knepley } 3387bec263e5SMatthew G. Knepley 338864beef6dSMatthew G. Knepley /*@ 338964beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 339064beef6dSMatthew G. Knepley 339164beef6dSMatthew G. Knepley Input Parameter: 339264beef6dSMatthew G. Knepley . dm - The submesh DM 339364beef6dSMatthew G. Knepley 339464beef6dSMatthew G. Knepley Output Parameter: 339564beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 339664beef6dSMatthew G. Knepley 339764beef6dSMatthew G. Knepley Level: developer 339864beef6dSMatthew G. Knepley 339964beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 340064beef6dSMatthew G. Knepley @*/ 3401e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 3402e6ccafaeSMatthew G Knepley { 3403e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3404e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3405e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 340665663942SMatthew G. Knepley *subpointMap = ((DM_Plex*) dm->data)->subpointMap; 3407e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3408e6ccafaeSMatthew G Knepley } 3409e6ccafaeSMatthew G Knepley 3410c08575a3SMatthew G. Knepley /*@ 3411c08575a3SMatthew G. Knepley DMPlexSetSubpointMap - Sets the DMLabel with point dimension as values 3412c08575a3SMatthew G. Knepley 3413c08575a3SMatthew G. Knepley Input Parameters: 3414c08575a3SMatthew G. Knepley + dm - The submesh DM 3415c08575a3SMatthew G. Knepley - subpointMap - The DMLabel of all the points from the original mesh in this submesh 3416c08575a3SMatthew G. Knepley 3417c08575a3SMatthew G. Knepley Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() 3418c08575a3SMatthew G. Knepley 3419c08575a3SMatthew G. Knepley Level: developer 3420c08575a3SMatthew G. Knepley 3421c08575a3SMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 3422c08575a3SMatthew G. Knepley @*/ 3423e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 3424e6ccafaeSMatthew G Knepley { 3425e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 3426285d324eSMatthew G. Knepley DMLabel tmp; 3427e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3428e6ccafaeSMatthew G Knepley 3429e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3430e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3431285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 3432e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 3433285d324eSMatthew G. Knepley ++mesh->subpointMap->refct; 3434285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 3435e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3436e6ccafaeSMatthew G Knepley } 3437e6ccafaeSMatthew G Knepley 343864beef6dSMatthew G. Knepley /*@ 3439e6ccafaeSMatthew G Knepley DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 3440e6ccafaeSMatthew G Knepley 3441e6ccafaeSMatthew G Knepley Input Parameter: 3442e6ccafaeSMatthew G Knepley . dm - The submesh DM 3443e6ccafaeSMatthew G Knepley 3444e6ccafaeSMatthew G Knepley Output Parameter: 34450298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 3446e6ccafaeSMatthew G Knepley 34473982b651SMatthew G. Knepley Note: This IS is guaranteed to be sorted by the construction of the submesh 344864beef6dSMatthew G. Knepley 344964beef6dSMatthew G. Knepley Level: developer 345064beef6dSMatthew G. Knepley 345164beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 345264beef6dSMatthew G. Knepley @*/ 3453e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 3454e6ccafaeSMatthew G Knepley { 345582f516ccSBarry Smith MPI_Comm comm; 3456e6ccafaeSMatthew G Knepley DMLabel subpointMap; 3457e6ccafaeSMatthew G Knepley IS is; 3458e6ccafaeSMatthew G Knepley const PetscInt *opoints; 3459e6ccafaeSMatthew G Knepley PetscInt *points, *depths; 3460e6ccafaeSMatthew G Knepley PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 3461e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3462e6ccafaeSMatthew G Knepley 3463e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3464e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3465e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 346682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 34670298fd71SBarry Smith *subpointIS = NULL; 3468e6ccafaeSMatthew G Knepley ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 3469e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3470fed694aaSMatthew G. Knepley if (subpointMap && depth >= 0) { 3471e6ccafaeSMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3472e6ccafaeSMatthew G Knepley if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 3473e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3474e6ccafaeSMatthew G Knepley depths[0] = depth; 3475e6ccafaeSMatthew G Knepley depths[1] = 0; 3476e6ccafaeSMatthew G Knepley for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 3477785e854fSJed Brown ierr = PetscMalloc1(pEnd, &points);CHKERRQ(ierr); 3478e6ccafaeSMatthew G Knepley for(d = 0, off = 0; d <= depth; ++d) { 3479e6ccafaeSMatthew G Knepley const PetscInt dep = depths[d]; 3480e6ccafaeSMatthew G Knepley 3481e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 3482e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 34831e21b6fdSMatthew G Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 3484e6ccafaeSMatthew 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); 3485e6ccafaeSMatthew G Knepley } else { 34861e21b6fdSMatthew G Knepley if (!n) { 34871e21b6fdSMatthew G Knepley if (d == 0) { 34881e21b6fdSMatthew G Knepley /* Missing cells */ 34891e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 34901e21b6fdSMatthew G Knepley } else { 34911e21b6fdSMatthew G Knepley /* Missing faces */ 34921e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 34931e21b6fdSMatthew G Knepley } 34941e21b6fdSMatthew G Knepley } 3495e6ccafaeSMatthew G Knepley } 3496e6ccafaeSMatthew G Knepley if (n) { 3497e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 3498e6ccafaeSMatthew G Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 3499e6ccafaeSMatthew G Knepley for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 3500e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 3501e6ccafaeSMatthew G Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 3502e6ccafaeSMatthew G Knepley } 3503e6ccafaeSMatthew G Knepley } 3504e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3505e6ccafaeSMatthew G Knepley if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 3506fed694aaSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 3507e6ccafaeSMatthew G Knepley } 3508e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3509e6ccafaeSMatthew G Knepley } 3510