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 5412e9a14SMatthew G. Knepley static PetscErrorCode DMPlexCellIsHybrid_Internal(DM dm, PetscInt p, PetscBool *isHybrid) 6412e9a14SMatthew G. Knepley { 7412e9a14SMatthew G. Knepley DMPolytopeType ct; 8412e9a14SMatthew G. Knepley PetscErrorCode ierr; 9412e9a14SMatthew G. Knepley 10412e9a14SMatthew G. Knepley PetscFunctionBegin; 11412e9a14SMatthew G. Knepley ierr = DMPlexGetCellType(dm, p, &ct);CHKERRQ(ierr); 12412e9a14SMatthew G. Knepley switch (ct) { 13412e9a14SMatthew G. Knepley case DM_POLYTOPE_POINT_PRISM_TENSOR: 14412e9a14SMatthew G. Knepley case DM_POLYTOPE_SEG_PRISM_TENSOR: 15412e9a14SMatthew G. Knepley case DM_POLYTOPE_TRI_PRISM_TENSOR: 16412e9a14SMatthew G. Knepley case DM_POLYTOPE_QUAD_PRISM_TENSOR: 17412e9a14SMatthew G. Knepley *isHybrid = PETSC_TRUE; 18412e9a14SMatthew G. Knepley default: *isHybrid = PETSC_FALSE; 19412e9a14SMatthew G. Knepley } 20412e9a14SMatthew G. Knepley PetscFunctionReturn(0); 21412e9a14SMatthew G. Knepley } 22412e9a14SMatthew G. Knepley 23412e9a14SMatthew G. Knepley static PetscErrorCode DMPlexGetTensorPrismBounds_Internal(DM dm, PetscInt dim, PetscInt *cStart, PetscInt *cEnd) 24412e9a14SMatthew G. Knepley { 25412e9a14SMatthew G. Knepley DMLabel ctLabel; 26412e9a14SMatthew G. Knepley PetscErrorCode ierr; 27412e9a14SMatthew G. Knepley 28412e9a14SMatthew G. Knepley PetscFunctionBegin; 29412e9a14SMatthew G. Knepley if (cStart) *cStart = -1; 30412e9a14SMatthew G. Knepley if (cEnd) *cEnd = -1; 31412e9a14SMatthew G. Knepley ierr = DMPlexGetCellTypeLabel(dm, &ctLabel);CHKERRQ(ierr); 32412e9a14SMatthew G. Knepley switch (dim) { 33412e9a14SMatthew G. Knepley case 1: ierr = DMLabelGetStratumBounds(ctLabel, DM_POLYTOPE_POINT_PRISM_TENSOR, cStart, cEnd);CHKERRQ(ierr);break; 34412e9a14SMatthew G. Knepley case 2: ierr = DMLabelGetStratumBounds(ctLabel, DM_POLYTOPE_SEG_PRISM_TENSOR, cStart, cEnd);CHKERRQ(ierr);break; 35412e9a14SMatthew G. Knepley case 3: 36412e9a14SMatthew G. Knepley ierr = DMLabelGetStratumBounds(ctLabel, DM_POLYTOPE_TRI_PRISM_TENSOR, cStart, cEnd);CHKERRQ(ierr); 37412e9a14SMatthew G. Knepley if (*cStart < 0) {ierr = DMLabelGetStratumBounds(ctLabel, DM_POLYTOPE_QUAD_PRISM_TENSOR, cStart, cEnd);CHKERRQ(ierr);} 38412e9a14SMatthew G. Knepley break; 39412e9a14SMatthew G. Knepley default: PetscFunctionReturn(0); 40412e9a14SMatthew G. Knepley } 41412e9a14SMatthew G. Knepley PetscFunctionReturn(0); 42412e9a14SMatthew G. Knepley } 43412e9a14SMatthew G. Knepley 44e752be1aSMatthew G. Knepley static PetscErrorCode DMPlexMarkBoundaryFaces_Internal(DM dm, PetscInt val, PetscInt cellHeight, DMLabel label) 4530560a7bSMatthew G. Knepley { 4630560a7bSMatthew G. Knepley PetscInt fStart, fEnd, f; 4730560a7bSMatthew G. Knepley PetscErrorCode ierr; 4830560a7bSMatthew G. Knepley 4930560a7bSMatthew G. Knepley PetscFunctionBegin; 5030560a7bSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight+1, &fStart, &fEnd);CHKERRQ(ierr); 5130560a7bSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 5230560a7bSMatthew G. Knepley PetscInt supportSize; 5330560a7bSMatthew G. Knepley 5430560a7bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 55e752be1aSMatthew G. Knepley if (supportSize == 1) { 56e752be1aSMatthew G. Knepley if (val < 0) { 57e752be1aSMatthew G. Knepley PetscInt *closure = NULL; 58e752be1aSMatthew G. Knepley PetscInt clSize, cl, cval; 59e752be1aSMatthew G. Knepley 60e752be1aSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, f, PETSC_TRUE, &clSize, &closure);CHKERRQ(ierr); 61e752be1aSMatthew G. Knepley for (cl = 0; cl < clSize*2; cl += 2) { 62e752be1aSMatthew G. Knepley ierr = DMLabelGetValue(label, closure[cl], &cval);CHKERRQ(ierr); 63e752be1aSMatthew G. Knepley if (cval < 0) continue; 64e752be1aSMatthew G. Knepley ierr = DMLabelSetValue(label, f, cval);CHKERRQ(ierr); 65e752be1aSMatthew G. Knepley break; 66e752be1aSMatthew G. Knepley } 67e752be1aSMatthew G. Knepley if (cl == clSize*2) {ierr = DMLabelSetValue(label, f, 1);CHKERRQ(ierr);} 68e752be1aSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, f, PETSC_TRUE, &clSize, &closure);CHKERRQ(ierr); 69e752be1aSMatthew G. Knepley } else { 70e752be1aSMatthew G. Knepley ierr = DMLabelSetValue(label, f, val);CHKERRQ(ierr); 71e752be1aSMatthew G. Knepley } 72e752be1aSMatthew G. Knepley } 7330560a7bSMatthew G. Knepley } 7430560a7bSMatthew G. Knepley PetscFunctionReturn(0); 7530560a7bSMatthew G. Knepley } 7630560a7bSMatthew G. Knepley 77cd0c2139SMatthew G Knepley /*@ 78cd0c2139SMatthew G Knepley DMPlexMarkBoundaryFaces - Mark all faces on the boundary 79cd0c2139SMatthew G Knepley 80cd0c2139SMatthew G Knepley Not Collective 81cd0c2139SMatthew G Knepley 82cd0c2139SMatthew G Knepley Input Parameter: 83e752be1aSMatthew G. Knepley + dm - The original DM 84e752be1aSMatthew G. Knepley - val - The marker value, or PETSC_DETERMINE to use some value in the closure (or 1 if none are found) 85cd0c2139SMatthew G Knepley 86cd0c2139SMatthew G Knepley Output Parameter: 87e752be1aSMatthew G. Knepley . label - The DMLabel marking boundary faces with the given value 88cd0c2139SMatthew G Knepley 89cd0c2139SMatthew G Knepley Level: developer 90cd0c2139SMatthew G Knepley 91c58f1c22SToby Isaac .seealso: DMLabelCreate(), DMCreateLabel() 9209f723d9SJed Brown @*/ 93e752be1aSMatthew G. Knepley PetscErrorCode DMPlexMarkBoundaryFaces(DM dm, PetscInt val, DMLabel label) 94cd0c2139SMatthew G Knepley { 95827c4036SVaclav Hapla DMPlexInterpolatedFlag flg; 96cd0c2139SMatthew G Knepley PetscErrorCode ierr; 97cd0c2139SMatthew G Knepley 98cd0c2139SMatthew G Knepley PetscFunctionBegin; 99827c4036SVaclav Hapla PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 100827c4036SVaclav Hapla ierr = DMPlexIsInterpolated(dm, &flg);CHKERRQ(ierr); 101827c4036SVaclav Hapla if (flg != DMPLEX_INTERPOLATED_FULL) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "DM is not fully interpolated on this rank"); 102e752be1aSMatthew G. Knepley ierr = DMPlexMarkBoundaryFaces_Internal(dm, val, 0, label);CHKERRQ(ierr); 103cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 104cd0c2139SMatthew G Knepley } 105cd0c2139SMatthew G Knepley 106c08575a3SMatthew G. Knepley static PetscErrorCode DMPlexLabelComplete_Internal(DM dm, DMLabel label, PetscBool completeCells) 107b0bf5782SToby Isaac { 108b0bf5782SToby Isaac IS valueIS; 109ac51f24eSSander Arens PetscSF sfPoint; 110b0bf5782SToby Isaac const PetscInt *values; 111ac51f24eSSander Arens PetscInt numValues, v, cStart, cEnd, nroots; 112b0bf5782SToby Isaac PetscErrorCode ierr; 113b0bf5782SToby Isaac 114b0bf5782SToby Isaac PetscFunctionBegin; 115b0bf5782SToby Isaac ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 116b0bf5782SToby Isaac ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 117b0bf5782SToby Isaac ierr = DMPlexGetHeightStratum(dm,0,&cStart,&cEnd);CHKERRQ(ierr); 118b0bf5782SToby Isaac ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 119b0bf5782SToby Isaac for (v = 0; v < numValues; ++v) { 120b0bf5782SToby Isaac IS pointIS; 121b0bf5782SToby Isaac const PetscInt *points; 122b0bf5782SToby Isaac PetscInt numPoints, p; 123b0bf5782SToby Isaac 124b0bf5782SToby Isaac ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 125b0bf5782SToby Isaac ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 126b0bf5782SToby Isaac ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 127b0bf5782SToby Isaac for (p = 0; p < numPoints; ++p) { 128b0bf5782SToby Isaac PetscInt q = points[p]; 129b0bf5782SToby Isaac PetscInt *closure = NULL; 130b0bf5782SToby Isaac PetscInt closureSize, c; 131b0bf5782SToby Isaac 132b0bf5782SToby Isaac if (cStart <= q && q < cEnd && !completeCells) { /* skip cells */ 133b0bf5782SToby Isaac continue; 134b0bf5782SToby Isaac } 135b0bf5782SToby Isaac ierr = DMPlexGetTransitiveClosure(dm, q, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 136b0bf5782SToby Isaac for (c = 0; c < closureSize*2; c += 2) { 137b0bf5782SToby Isaac ierr = DMLabelSetValue(label, closure[c], values[v]);CHKERRQ(ierr); 138b0bf5782SToby Isaac } 139b0bf5782SToby Isaac ierr = DMPlexRestoreTransitiveClosure(dm, q, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 140b0bf5782SToby Isaac } 141b0bf5782SToby Isaac ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 142b0bf5782SToby Isaac ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 143b0bf5782SToby Isaac } 144b0bf5782SToby Isaac ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 145b0bf5782SToby Isaac ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 146ac51f24eSSander Arens ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 147ac51f24eSSander Arens ierr = PetscSFGetGraph(sfPoint, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 148ac51f24eSSander Arens if (nroots >= 0) { 14926279d81SSanderA DMLabel lblRoots, lblLeaves; 15026279d81SSanderA IS valueIS, pointIS; 15126279d81SSanderA const PetscInt *values; 15226279d81SSanderA PetscInt numValues, v; 15326279d81SSanderA PetscErrorCode ierr; 15426279d81SSanderA 15526279d81SSanderA /* Pull point contributions from remote leaves into local roots */ 15626279d81SSanderA ierr = DMLabelGather(label, sfPoint, &lblLeaves);CHKERRQ(ierr); 15726279d81SSanderA ierr = DMLabelGetValueIS(lblLeaves, &valueIS);CHKERRQ(ierr); 15826279d81SSanderA ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 15926279d81SSanderA ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 16026279d81SSanderA for (v = 0; v < numValues; ++v) { 16126279d81SSanderA const PetscInt value = values[v]; 16226279d81SSanderA 16326279d81SSanderA ierr = DMLabelGetStratumIS(lblLeaves, value, &pointIS);CHKERRQ(ierr); 16426279d81SSanderA ierr = DMLabelInsertIS(label, pointIS, value);CHKERRQ(ierr); 16526279d81SSanderA ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 16626279d81SSanderA } 16726279d81SSanderA ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 16826279d81SSanderA ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 16926279d81SSanderA ierr = DMLabelDestroy(&lblLeaves);CHKERRQ(ierr); 17026279d81SSanderA /* Push point contributions from roots into remote leaves */ 17126279d81SSanderA ierr = DMLabelDistribute(label, sfPoint, &lblRoots);CHKERRQ(ierr); 17226279d81SSanderA ierr = DMLabelGetValueIS(lblRoots, &valueIS);CHKERRQ(ierr); 17326279d81SSanderA ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 17426279d81SSanderA ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 17526279d81SSanderA for (v = 0; v < numValues; ++v) { 17626279d81SSanderA const PetscInt value = values[v]; 17726279d81SSanderA 17826279d81SSanderA ierr = DMLabelGetStratumIS(lblRoots, value, &pointIS);CHKERRQ(ierr); 17926279d81SSanderA ierr = DMLabelInsertIS(label, pointIS, value);CHKERRQ(ierr); 18026279d81SSanderA ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 18126279d81SSanderA } 18226279d81SSanderA ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 18326279d81SSanderA ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 18426279d81SSanderA ierr = DMLabelDestroy(&lblRoots);CHKERRQ(ierr); 18526279d81SSanderA } 186b0bf5782SToby Isaac PetscFunctionReturn(0); 187b0bf5782SToby Isaac } 188b0bf5782SToby Isaac 1892be2b188SMatthew G Knepley /*@ 1902be2b188SMatthew G Knepley DMPlexLabelComplete - Starting with a label marking points on a surface, we add the transitive closure to the surface 1912be2b188SMatthew G Knepley 1922be2b188SMatthew G Knepley Input Parameters: 1932be2b188SMatthew G Knepley + dm - The DM 1942be2b188SMatthew G Knepley - label - A DMLabel marking the surface points 1952be2b188SMatthew G Knepley 1962be2b188SMatthew G Knepley Output Parameter: 1972be2b188SMatthew G Knepley . label - A DMLabel marking all surface points in the transitive closure 1982be2b188SMatthew G Knepley 1992be2b188SMatthew G Knepley Level: developer 2002be2b188SMatthew G Knepley 2012be2b188SMatthew G Knepley .seealso: DMPlexLabelCohesiveComplete() 2022be2b188SMatthew G Knepley @*/ 2032be2b188SMatthew G Knepley PetscErrorCode DMPlexLabelComplete(DM dm, DMLabel label) 2042be2b188SMatthew G Knepley { 2052be2b188SMatthew G Knepley PetscErrorCode ierr; 2062be2b188SMatthew G Knepley 2072be2b188SMatthew G Knepley PetscFunctionBegin; 208b0bf5782SToby Isaac ierr = DMPlexLabelComplete_Internal(dm, label, PETSC_TRUE);CHKERRQ(ierr); 2092be2b188SMatthew G Knepley PetscFunctionReturn(0); 2102be2b188SMatthew G Knepley } 2112be2b188SMatthew G Knepley 2126cf0e42fSMatthew G. Knepley /*@ 213a6e0b375SMatthew G. Knepley DMPlexLabelAddCells - Starting with a label marking points on a surface, we add a cell for each point 2146cf0e42fSMatthew G. Knepley 2156cf0e42fSMatthew G. Knepley Input Parameters: 2166cf0e42fSMatthew G. Knepley + dm - The DM 2176cf0e42fSMatthew G. Knepley - label - A DMLabel marking the surface points 2186cf0e42fSMatthew G. Knepley 2196cf0e42fSMatthew G. Knepley Output Parameter: 2206cf0e42fSMatthew G. Knepley . label - A DMLabel incorporating cells 2216cf0e42fSMatthew G. Knepley 2226cf0e42fSMatthew G. Knepley Level: developer 2236cf0e42fSMatthew G. Knepley 2246cf0e42fSMatthew G. Knepley Note: The cells allow FEM boundary conditions to be applied using the cell geometry 2256cf0e42fSMatthew G. Knepley 226a6e0b375SMatthew G. Knepley .seealso: DMPlexLabelAddFaceCells(), DMPlexLabelComplete(), DMPlexLabelCohesiveComplete() 2276cf0e42fSMatthew G. Knepley @*/ 2286cf0e42fSMatthew G. Knepley PetscErrorCode DMPlexLabelAddCells(DM dm, DMLabel label) 2296cf0e42fSMatthew G. Knepley { 2306cf0e42fSMatthew G. Knepley IS valueIS; 2316cf0e42fSMatthew G. Knepley const PetscInt *values; 232485ad865SMatthew G. Knepley PetscInt numValues, v, cStart, cEnd; 2336cf0e42fSMatthew G. Knepley PetscErrorCode ierr; 2346cf0e42fSMatthew G. Knepley 2356cf0e42fSMatthew G. Knepley PetscFunctionBegin; 236412e9a14SMatthew G. Knepley ierr = DMPlexGetSimplexOrBoxCells(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 2376cf0e42fSMatthew G. Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 2386cf0e42fSMatthew G. Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 2396cf0e42fSMatthew G. Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 2406cf0e42fSMatthew G. Knepley for (v = 0; v < numValues; ++v) { 2416cf0e42fSMatthew G. Knepley IS pointIS; 2426cf0e42fSMatthew G. Knepley const PetscInt *points; 2436cf0e42fSMatthew G. Knepley PetscInt numPoints, p; 2446cf0e42fSMatthew G. Knepley 2456cf0e42fSMatthew G. Knepley ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 2466cf0e42fSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 2476cf0e42fSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 2486cf0e42fSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 2496cf0e42fSMatthew G. Knepley PetscInt *closure = NULL; 250a6e0b375SMatthew G. Knepley PetscInt closureSize, cl; 2516cf0e42fSMatthew G. Knepley 2526cf0e42fSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 25322eabd52SMatthew G. Knepley for (cl = closureSize-1; cl > 0; --cl) { 254a6e0b375SMatthew G. Knepley const PetscInt cell = closure[cl*2]; 255a6e0b375SMatthew G. Knepley if ((cell >= cStart) && (cell < cEnd)) {ierr = DMLabelSetValue(label, cell, values[v]);CHKERRQ(ierr); break;} 25622eabd52SMatthew G. Knepley } 2576cf0e42fSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 2586cf0e42fSMatthew G. Knepley } 2596cf0e42fSMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 2606cf0e42fSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 2616cf0e42fSMatthew G. Knepley } 2626cf0e42fSMatthew G. Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 2636cf0e42fSMatthew G. Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 2646cf0e42fSMatthew G. Knepley PetscFunctionReturn(0); 2656cf0e42fSMatthew G. Knepley } 2666cf0e42fSMatthew G. Knepley 267f402d5e4SToby Isaac /*@ 268a6e0b375SMatthew G. Knepley DMPlexLabelAddFaceCells - Starting with a label marking faces on a surface, we add a cell for each face 269a6e0b375SMatthew G. Knepley 270a6e0b375SMatthew G. Knepley Input Parameters: 271a6e0b375SMatthew G. Knepley + dm - The DM 272a6e0b375SMatthew G. Knepley - label - A DMLabel marking the surface points 273a6e0b375SMatthew G. Knepley 274a6e0b375SMatthew G. Knepley Output Parameter: 275a6e0b375SMatthew G. Knepley . label - A DMLabel incorporating cells 276a6e0b375SMatthew G. Knepley 277a6e0b375SMatthew G. Knepley Level: developer 278a6e0b375SMatthew G. Knepley 279a6e0b375SMatthew G. Knepley Note: The cells allow FEM boundary conditions to be applied using the cell geometry 280a6e0b375SMatthew G. Knepley 281a6e0b375SMatthew G. Knepley .seealso: DMPlexLabelAddCells(), DMPlexLabelComplete(), DMPlexLabelCohesiveComplete() 282a6e0b375SMatthew G. Knepley @*/ 283a6e0b375SMatthew G. Knepley PetscErrorCode DMPlexLabelAddFaceCells(DM dm, DMLabel label) 284a6e0b375SMatthew G. Knepley { 285a6e0b375SMatthew G. Knepley IS valueIS; 286a6e0b375SMatthew G. Knepley const PetscInt *values; 287a6e0b375SMatthew G. Knepley PetscInt numValues, v, cStart, cEnd, fStart, fEnd; 288a6e0b375SMatthew G. Knepley PetscErrorCode ierr; 289a6e0b375SMatthew G. Knepley 290a6e0b375SMatthew G. Knepley PetscFunctionBegin; 291412e9a14SMatthew G. Knepley ierr = DMPlexGetSimplexOrBoxCells(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 292a6e0b375SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 293a6e0b375SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 294a6e0b375SMatthew G. Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 295a6e0b375SMatthew G. Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 296a6e0b375SMatthew G. Knepley for (v = 0; v < numValues; ++v) { 297a6e0b375SMatthew G. Knepley IS pointIS; 298a6e0b375SMatthew G. Knepley const PetscInt *points; 299a6e0b375SMatthew G. Knepley PetscInt numPoints, p; 300a6e0b375SMatthew G. Knepley 301a6e0b375SMatthew G. Knepley ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 302a6e0b375SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 303a6e0b375SMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 304a6e0b375SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 305a6e0b375SMatthew G. Knepley const PetscInt face = points[p]; 306a6e0b375SMatthew G. Knepley PetscInt *closure = NULL; 307a6e0b375SMatthew G. Knepley PetscInt closureSize, cl; 308a6e0b375SMatthew G. Knepley 309a6e0b375SMatthew G. Knepley if ((face < fStart) || (face >= fEnd)) continue; 310a6e0b375SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 311a6e0b375SMatthew G. Knepley for (cl = closureSize-1; cl > 0; --cl) { 312a6e0b375SMatthew G. Knepley const PetscInt cell = closure[cl*2]; 313a6e0b375SMatthew G. Knepley if ((cell >= cStart) && (cell < cEnd)) {ierr = DMLabelSetValue(label, cell, values[v]);CHKERRQ(ierr); break;} 314a6e0b375SMatthew G. Knepley } 315a6e0b375SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 316a6e0b375SMatthew G. Knepley } 317a6e0b375SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 318a6e0b375SMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 319a6e0b375SMatthew G. Knepley } 320a6e0b375SMatthew G. Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 321a6e0b375SMatthew G. Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 322a6e0b375SMatthew G. Knepley PetscFunctionReturn(0); 323a6e0b375SMatthew G. Knepley } 324a6e0b375SMatthew G. Knepley 325a6e0b375SMatthew G. Knepley /*@ 326f402d5e4SToby Isaac DMPlexLabelClearCells - Remove cells from a label 327f402d5e4SToby Isaac 328f402d5e4SToby Isaac Input Parameters: 329f402d5e4SToby Isaac + dm - The DM 330f402d5e4SToby Isaac - label - A DMLabel marking surface points and their adjacent cells 331f402d5e4SToby Isaac 332f402d5e4SToby Isaac Output Parameter: 333f402d5e4SToby Isaac . label - A DMLabel without cells 334f402d5e4SToby Isaac 335f402d5e4SToby Isaac Level: developer 336f402d5e4SToby Isaac 337a6e0b375SMatthew G. Knepley Note: This undoes DMPlexLabelAddCells() or DMPlexLabelAddFaceCells() 338f402d5e4SToby Isaac 339f402d5e4SToby Isaac .seealso: DMPlexLabelComplete(), DMPlexLabelCohesiveComplete(), DMPlexLabelAddCells() 340f402d5e4SToby Isaac @*/ 341f402d5e4SToby Isaac PetscErrorCode DMPlexLabelClearCells(DM dm, DMLabel label) 342f402d5e4SToby Isaac { 343f402d5e4SToby Isaac IS valueIS; 344f402d5e4SToby Isaac const PetscInt *values; 345485ad865SMatthew G. Knepley PetscInt numValues, v, cStart, cEnd; 346f402d5e4SToby Isaac PetscErrorCode ierr; 347f402d5e4SToby Isaac 348f402d5e4SToby Isaac PetscFunctionBegin; 349412e9a14SMatthew G. Knepley ierr = DMPlexGetSimplexOrBoxCells(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 350f402d5e4SToby Isaac ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 351f402d5e4SToby Isaac ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 352f402d5e4SToby Isaac ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 353f402d5e4SToby Isaac for (v = 0; v < numValues; ++v) { 354f402d5e4SToby Isaac IS pointIS; 355f402d5e4SToby Isaac const PetscInt *points; 356f402d5e4SToby Isaac PetscInt numPoints, p; 357f402d5e4SToby Isaac 358f402d5e4SToby Isaac ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 359f402d5e4SToby Isaac ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 360f402d5e4SToby Isaac ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 361f402d5e4SToby Isaac for (p = 0; p < numPoints; ++p) { 362f402d5e4SToby Isaac PetscInt point = points[p]; 363f402d5e4SToby Isaac 364f402d5e4SToby Isaac if (point >= cStart && point < cEnd) { 365f402d5e4SToby Isaac ierr = DMLabelClearValue(label,point,values[v]);CHKERRQ(ierr); 366f402d5e4SToby Isaac } 367f402d5e4SToby Isaac } 368f402d5e4SToby Isaac ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 369f402d5e4SToby Isaac ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 370f402d5e4SToby Isaac } 371f402d5e4SToby Isaac ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 372f402d5e4SToby Isaac ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 373f402d5e4SToby Isaac PetscFunctionReturn(0); 374f402d5e4SToby Isaac } 375f402d5e4SToby Isaac 37659eef20bSToby Isaac /* take (oldEnd, added) pairs, ordered by height and convert them to (oldstart, newstart) pairs, ordered by ascending 37759eef20bSToby Isaac * index (skipping first, which is (0,0)) */ 3782582d50cSToby Isaac PETSC_STATIC_INLINE PetscErrorCode DMPlexShiftPointSetUp_Internal(PetscInt depth, PetscInt depthShift[]) 379cd0c2139SMatthew G Knepley { 3802582d50cSToby Isaac PetscInt d, off = 0; 3812582d50cSToby Isaac 3822582d50cSToby Isaac PetscFunctionBegin; 38359eef20bSToby Isaac /* sort by (oldend): yes this is an O(n^2) sort, we expect depth <= 3 */ 3840974a383SToby Isaac for (d = 0; d < depth; d++) { 3852582d50cSToby Isaac PetscInt firstd = d; 3860974a383SToby Isaac PetscInt firstStart = depthShift[2*d]; 3872582d50cSToby Isaac PetscInt e; 3882582d50cSToby Isaac 3892582d50cSToby Isaac for (e = d+1; e <= depth; e++) { 3902582d50cSToby Isaac if (depthShift[2*e] < firstStart) { 3912582d50cSToby Isaac firstd = e; 3922582d50cSToby Isaac firstStart = depthShift[2*d]; 3932582d50cSToby Isaac } 3942582d50cSToby Isaac } 3952582d50cSToby Isaac if (firstd != d) { 3962582d50cSToby Isaac PetscInt swap[2]; 3972582d50cSToby Isaac 3982582d50cSToby Isaac e = firstd; 3992582d50cSToby Isaac swap[0] = depthShift[2*d]; 4002582d50cSToby Isaac swap[1] = depthShift[2*d+1]; 4012582d50cSToby Isaac depthShift[2*d] = depthShift[2*e]; 4022582d50cSToby Isaac depthShift[2*d+1] = depthShift[2*e+1]; 4032582d50cSToby Isaac depthShift[2*e] = swap[0]; 4042582d50cSToby Isaac depthShift[2*e+1] = swap[1]; 4052582d50cSToby Isaac } 4062582d50cSToby Isaac } 4072582d50cSToby Isaac /* convert (oldstart, added) to (oldstart, newstart) */ 4080974a383SToby Isaac for (d = 0; d <= depth; d++) { 4092582d50cSToby Isaac off += depthShift[2*d+1]; 41059eef20bSToby Isaac depthShift[2*d+1] = depthShift[2*d] + off; 4112582d50cSToby Isaac } 4122582d50cSToby Isaac PetscFunctionReturn(0); 4132582d50cSToby Isaac } 4142582d50cSToby Isaac 4152582d50cSToby Isaac /* depthShift is a list of (old, new) pairs */ 4162582d50cSToby Isaac PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthShift[]) 4172582d50cSToby Isaac { 4182582d50cSToby Isaac PetscInt d; 4192582d50cSToby Isaac PetscInt newOff = 0; 4202582d50cSToby Isaac 4212582d50cSToby Isaac for (d = 0; d <= depth; d++) { 4222582d50cSToby Isaac if (p < depthShift[2*d]) return p + newOff; 4232582d50cSToby Isaac else newOff = depthShift[2*d+1] - depthShift[2*d]; 4242582d50cSToby Isaac } 4250974a383SToby Isaac return p + newOff; 4262582d50cSToby Isaac } 4272582d50cSToby Isaac 4282582d50cSToby Isaac /* depthShift is a list of (old, new) pairs */ 4292582d50cSToby Isaac PETSC_STATIC_INLINE PetscInt DMPlexShiftPointInverse_Internal(PetscInt p, PetscInt depth, PetscInt depthShift[]) 4302582d50cSToby Isaac { 4312582d50cSToby Isaac PetscInt d; 4322582d50cSToby Isaac PetscInt newOff = 0; 4332582d50cSToby Isaac 4342582d50cSToby Isaac for (d = 0; d <= depth; d++) { 4352582d50cSToby Isaac if (p < depthShift[2*d+1]) return p + newOff; 4362582d50cSToby Isaac else newOff = depthShift[2*d] - depthShift[2*d+1]; 4372582d50cSToby Isaac } 4380974a383SToby Isaac return p + newOff; 439cd0c2139SMatthew G Knepley } 440cd0c2139SMatthew G Knepley 441cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew) 442cd0c2139SMatthew G Knepley { 443cd0c2139SMatthew G Knepley PetscInt depth = 0, d, pStart, pEnd, p; 444fa8e8ae5SToby Isaac DMLabel depthLabel; 445cd0c2139SMatthew G Knepley PetscErrorCode ierr; 446cd0c2139SMatthew G Knepley 447cd0c2139SMatthew G Knepley PetscFunctionBegin; 448cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 449cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 450cd0c2139SMatthew G Knepley /* Step 1: Expand chart */ 451cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 4520974a383SToby Isaac pEnd = DMPlexShiftPoint_Internal(pEnd,depth,depthShift); 453cd0c2139SMatthew G Knepley ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr); 454fa8e8ae5SToby Isaac ierr = DMCreateLabel(dmNew,"depth");CHKERRQ(ierr); 455fa8e8ae5SToby Isaac ierr = DMPlexGetDepthLabel(dmNew,&depthLabel);CHKERRQ(ierr); 456412e9a14SMatthew G. Knepley ierr = DMCreateLabel(dmNew, "celltype");CHKERRQ(ierr); 457cd0c2139SMatthew G Knepley /* Step 2: Set cone and support sizes */ 458cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 459fa8e8ae5SToby Isaac PetscInt pStartNew, pEndNew; 460fa8e8ae5SToby Isaac IS pIS; 461fa8e8ae5SToby Isaac 462cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 463fa8e8ae5SToby Isaac pStartNew = DMPlexShiftPoint_Internal(pStart, depth, depthShift); 464fa8e8ae5SToby Isaac pEndNew = DMPlexShiftPoint_Internal(pEnd, depth, depthShift); 465fa8e8ae5SToby Isaac ierr = ISCreateStride(PETSC_COMM_SELF, pEndNew - pStartNew, pStartNew, 1, &pIS);CHKERRQ(ierr); 466fa8e8ae5SToby Isaac ierr = DMLabelSetStratumIS(depthLabel, d, pIS);CHKERRQ(ierr); 467fa8e8ae5SToby Isaac ierr = ISDestroy(&pIS);CHKERRQ(ierr); 468cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 4692582d50cSToby Isaac PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthShift); 470cd0c2139SMatthew G Knepley PetscInt size; 471412e9a14SMatthew G. Knepley DMPolytopeType ct; 472cd0c2139SMatthew G Knepley 473cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 474cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr); 475cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 476cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr); 477412e9a14SMatthew G. Knepley ierr = DMPlexGetCellType(dm, p, &ct);CHKERRQ(ierr); 478412e9a14SMatthew G. Knepley ierr = DMPlexSetCellType(dmNew, newp, ct);CHKERRQ(ierr); 479cd0c2139SMatthew G Knepley } 480cd0c2139SMatthew G Knepley } 481cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 482cd0c2139SMatthew G Knepley } 483cd0c2139SMatthew G Knepley 484cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew) 485cd0c2139SMatthew G Knepley { 4862582d50cSToby Isaac PetscInt *newpoints; 4872582d50cSToby Isaac PetscInt depth = 0, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, pStart, pEnd, p; 488cd0c2139SMatthew G Knepley PetscErrorCode ierr; 489cd0c2139SMatthew G Knepley 490cd0c2139SMatthew G Knepley PetscFunctionBegin; 491cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 492cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 493cd0c2139SMatthew G Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 494dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dmNew, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 4952582d50cSToby Isaac ierr = PetscMalloc1(PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),&newpoints);CHKERRQ(ierr); 496cd0c2139SMatthew G Knepley /* Step 5: Set cones and supports */ 497cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 498cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 499cd0c2139SMatthew G Knepley const PetscInt *points = NULL, *orientations = NULL; 5002582d50cSToby Isaac PetscInt size,sizeNew, i, newp = DMPlexShiftPoint_Internal(p, depth, depthShift); 501cd0c2139SMatthew G Knepley 502cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 503cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr); 504cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr); 505cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 5062582d50cSToby Isaac newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthShift); 507cd0c2139SMatthew G Knepley } 508cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr); 509cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr); 510cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 511dcbb62e8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmNew, newp, &sizeNew);CHKERRQ(ierr); 512cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr); 513cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 5142582d50cSToby Isaac newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthShift); 515cd0c2139SMatthew G Knepley } 516dcbb62e8SMatthew G. Knepley for (i = size; i < sizeNew; ++i) newpoints[i] = 0; 517cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr); 518cd0c2139SMatthew G Knepley } 5192582d50cSToby Isaac ierr = PetscFree(newpoints);CHKERRQ(ierr); 520cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 521cd0c2139SMatthew G Knepley } 522cd0c2139SMatthew G Knepley 523cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew) 524cd0c2139SMatthew G Knepley { 525cd0c2139SMatthew G Knepley PetscSection coordSection, newCoordSection; 526cd0c2139SMatthew G Knepley Vec coordinates, newCoordinates; 527cd0c2139SMatthew G Knepley PetscScalar *coords, *newCoords; 528f2b8cce1SMatthew G. Knepley PetscInt coordSize, sStart, sEnd; 529f2b8cce1SMatthew G. Knepley PetscInt dim, depth = 0, cStart, cEnd, cStartNew, cEndNew, c, vStart, vEnd, vStartNew, vEndNew, v; 530f2b8cce1SMatthew G. Knepley PetscBool hasCells; 531cd0c2139SMatthew G Knepley PetscErrorCode ierr; 532cd0c2139SMatthew G Knepley 533cd0c2139SMatthew G Knepley PetscFunctionBegin; 534f2b8cce1SMatthew G. Knepley ierr = DMGetCoordinateDim(dm, &dim);CHKERRQ(ierr); 535c0e8cf5fSMatthew G. Knepley ierr = DMSetCoordinateDim(dmNew, dim);CHKERRQ(ierr); 536cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 537cd0c2139SMatthew G Knepley /* Step 8: Convert coordinates */ 538cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 539f2b8cce1SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 540cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr); 541f2b8cce1SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dmNew, 0, &cStartNew, &cEndNew);CHKERRQ(ierr); 54269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 543cd0c2139SMatthew G Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr); 544cd0c2139SMatthew G Knepley ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr); 545cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr); 546f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetChart(coordSection, &sStart, &sEnd);CHKERRQ(ierr); 547f2b8cce1SMatthew G. Knepley hasCells = sStart == cStart ? PETSC_TRUE : PETSC_FALSE; 548f2b8cce1SMatthew G. Knepley ierr = PetscSectionSetChart(newCoordSection, hasCells ? cStartNew : vStartNew, vEndNew);CHKERRQ(ierr); 549f2b8cce1SMatthew G. Knepley if (hasCells) { 550f2b8cce1SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 551f2b8cce1SMatthew G. Knepley PetscInt cNew = DMPlexShiftPoint_Internal(c, depth, depthShift), dof; 552f2b8cce1SMatthew G. Knepley 553f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, c, &dof);CHKERRQ(ierr); 554f2b8cce1SMatthew G. Knepley ierr = PetscSectionSetDof(newCoordSection, cNew, dof);CHKERRQ(ierr); 555f2b8cce1SMatthew G. Knepley ierr = PetscSectionSetFieldDof(newCoordSection, cNew, 0, dof);CHKERRQ(ierr); 556f2b8cce1SMatthew G. Knepley } 557f2b8cce1SMatthew G. Knepley } 558cd0c2139SMatthew G Knepley for (v = vStartNew; v < vEndNew; ++v) { 559cd0c2139SMatthew G Knepley ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr); 560cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr); 561cd0c2139SMatthew G Knepley } 562cd0c2139SMatthew G Knepley ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr); 56346e270d4SMatthew G. Knepley ierr = DMSetCoordinateSection(dmNew, PETSC_DETERMINE, newCoordSection);CHKERRQ(ierr); 564cd0c2139SMatthew G Knepley ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr); 5658b9ced59SLisandro Dalcin ierr = VecCreate(PETSC_COMM_SELF, &newCoordinates);CHKERRQ(ierr); 566cd0c2139SMatthew G Knepley ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr); 567cd0c2139SMatthew G Knepley ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 5684e90ef8eSMatthew G. Knepley ierr = VecSetBlockSize(newCoordinates, dim);CHKERRQ(ierr); 5692eb5907fSJed Brown ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr); 570cd0c2139SMatthew G Knepley ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr); 571cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 572cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 573cd0c2139SMatthew G Knepley ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr); 574f2b8cce1SMatthew G. Knepley if (hasCells) { 575f2b8cce1SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 576f2b8cce1SMatthew G. Knepley PetscInt cNew = DMPlexShiftPoint_Internal(c, depth, depthShift), dof, off, noff, d; 577f2b8cce1SMatthew G. Knepley 578f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, c, &dof);CHKERRQ(ierr); 579f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, c, &off);CHKERRQ(ierr); 580f2b8cce1SMatthew G. Knepley ierr = PetscSectionGetOffset(newCoordSection, cNew, &noff);CHKERRQ(ierr); 581f2b8cce1SMatthew G. Knepley for (d = 0; d < dof; ++d) newCoords[noff+d] = coords[off+d]; 582f2b8cce1SMatthew G. Knepley } 583f2b8cce1SMatthew G. Knepley } 584cd0c2139SMatthew G Knepley for (v = vStart; v < vEnd; ++v) { 585cd0c2139SMatthew G Knepley PetscInt dof, off, noff, d; 586cd0c2139SMatthew G Knepley 587cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 588cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 5892582d50cSToby Isaac ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthShift), &noff);CHKERRQ(ierr); 590f2b8cce1SMatthew G. Knepley for (d = 0; d < dof; ++d) newCoords[noff+d] = coords[off+d]; 591cd0c2139SMatthew G Knepley } 592cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 593cd0c2139SMatthew G Knepley ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr); 594cd0c2139SMatthew G Knepley ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 595cd0c2139SMatthew G Knepley ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr); 596cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 597cd0c2139SMatthew G Knepley } 598cd0c2139SMatthew G Knepley 599cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew) 600cd0c2139SMatthew G Knepley { 6012582d50cSToby Isaac PetscInt depth = 0; 602cd0c2139SMatthew G Knepley PetscSF sfPoint, sfPointNew; 603cd0c2139SMatthew G Knepley const PetscSFNode *remotePoints; 604cd0c2139SMatthew G Knepley PetscSFNode *gremotePoints; 605cd0c2139SMatthew G Knepley const PetscInt *localPoints; 606cd0c2139SMatthew G Knepley PetscInt *glocalPoints, *newLocation, *newRemoteLocation; 607cd0c2139SMatthew G Knepley PetscInt numRoots, numLeaves, l, pStart, pEnd, totShift = 0; 608cd0c2139SMatthew G Knepley PetscErrorCode ierr; 609cd0c2139SMatthew G Knepley 610cd0c2139SMatthew G Knepley PetscFunctionBegin; 611cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 612cd0c2139SMatthew G Knepley /* Step 9: Convert pointSF */ 613cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 614cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr); 615cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 616cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 6176e21efdcSToby Isaac totShift = DMPlexShiftPoint_Internal(pEnd,depth,depthShift) - pEnd; 618cd0c2139SMatthew G Knepley if (numRoots >= 0) { 619dcca6d9dSJed Brown ierr = PetscMalloc2(numRoots,&newLocation,pEnd-pStart,&newRemoteLocation);CHKERRQ(ierr); 6202582d50cSToby Isaac for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthShift); 621*ad227feaSJunchao Zhang ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation,MPI_REPLACE);CHKERRQ(ierr); 622*ad227feaSJunchao Zhang ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation,MPI_REPLACE);CHKERRQ(ierr); 623785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &glocalPoints);CHKERRQ(ierr); 624785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &gremotePoints);CHKERRQ(ierr); 625cd0c2139SMatthew G Knepley for (l = 0; l < numLeaves; ++l) { 6262582d50cSToby Isaac glocalPoints[l] = DMPlexShiftPoint_Internal(localPoints[l], depth, depthShift); 627cd0c2139SMatthew G Knepley gremotePoints[l].rank = remotePoints[l].rank; 628cd0c2139SMatthew G Knepley gremotePoints[l].index = newRemoteLocation[localPoints[l]]; 629cd0c2139SMatthew G Knepley } 630cd0c2139SMatthew G Knepley ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr); 631cd0c2139SMatthew G Knepley ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 632cd0c2139SMatthew G Knepley } 633cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 634cd0c2139SMatthew G Knepley } 635cd0c2139SMatthew G Knepley 636cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew) 637cd0c2139SMatthew G Knepley { 638cd0c2139SMatthew G Knepley PetscSF sfPoint; 639cd0c2139SMatthew G Knepley DMLabel vtkLabel, ghostLabel; 640cd0c2139SMatthew G Knepley const PetscSFNode *leafRemote; 641cd0c2139SMatthew G Knepley const PetscInt *leafLocal; 6422582d50cSToby Isaac PetscInt depth = 0, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f; 643cd0c2139SMatthew G Knepley PetscMPIInt rank; 644cd0c2139SMatthew G Knepley PetscErrorCode ierr; 645cd0c2139SMatthew G Knepley 646cd0c2139SMatthew G Knepley PetscFunctionBegin; 647cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 648cd0c2139SMatthew G Knepley /* Step 10: Convert labels */ 649c58f1c22SToby Isaac ierr = DMGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 650cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 651cd0c2139SMatthew G Knepley DMLabel label, newlabel; 652cd0c2139SMatthew G Knepley const char *lname; 653fa8e8ae5SToby Isaac PetscBool isDepth, isDim; 654cd0c2139SMatthew G Knepley IS valueIS; 655cd0c2139SMatthew G Knepley const PetscInt *values; 656cd0c2139SMatthew G Knepley PetscInt numValues, val; 657cd0c2139SMatthew G Knepley 658c58f1c22SToby Isaac ierr = DMGetLabelName(dm, l, &lname);CHKERRQ(ierr); 659cd0c2139SMatthew G Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 660cd0c2139SMatthew G Knepley if (isDepth) continue; 661fa8e8ae5SToby Isaac ierr = PetscStrcmp(lname, "dim", &isDim);CHKERRQ(ierr); 662fa8e8ae5SToby Isaac if (isDim) continue; 663c58f1c22SToby Isaac ierr = DMCreateLabel(dmNew, lname);CHKERRQ(ierr); 664c58f1c22SToby Isaac ierr = DMGetLabel(dm, lname, &label);CHKERRQ(ierr); 665c58f1c22SToby Isaac ierr = DMGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr); 66664a6a1a4SToby Isaac ierr = DMLabelGetDefaultValue(label,&val);CHKERRQ(ierr); 66764a6a1a4SToby Isaac ierr = DMLabelSetDefaultValue(newlabel,val);CHKERRQ(ierr); 668cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 669cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 670cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 671cd0c2139SMatthew G Knepley for (val = 0; val < numValues; ++val) { 672cd0c2139SMatthew G Knepley IS pointIS; 673cd0c2139SMatthew G Knepley const PetscInt *points; 674cd0c2139SMatthew G Knepley PetscInt numPoints, p; 675cd0c2139SMatthew G Knepley 676cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 677cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 678cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 679cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 6802582d50cSToby Isaac const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthShift); 681cd0c2139SMatthew G Knepley 682cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr); 683cd0c2139SMatthew G Knepley } 684cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 685cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 686cd0c2139SMatthew G Knepley } 687cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 688cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 689cd0c2139SMatthew G Knepley } 690cd0c2139SMatthew G Knepley /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */ 691ffc4695bSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRMPI(ierr); 692cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 693cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 694cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr); 695c58f1c22SToby Isaac ierr = DMCreateLabel(dmNew, "vtk");CHKERRQ(ierr); 696c58f1c22SToby Isaac ierr = DMCreateLabel(dmNew, "ghost");CHKERRQ(ierr); 697c58f1c22SToby Isaac ierr = DMGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr); 698c58f1c22SToby Isaac ierr = DMGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr); 699cd0c2139SMatthew G Knepley for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { 700cd0c2139SMatthew G Knepley for (; c < leafLocal[l] && c < cEnd; ++c) { 701cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 702cd0c2139SMatthew G Knepley } 703cd0c2139SMatthew G Knepley if (leafLocal[l] >= cEnd) break; 704cd0c2139SMatthew G Knepley if (leafRemote[l].rank == rank) { 705cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 706cd0c2139SMatthew G Knepley } else { 707cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr); 708cd0c2139SMatthew G Knepley } 709cd0c2139SMatthew G Knepley } 710cd0c2139SMatthew G Knepley for (; c < cEnd; ++c) { 711cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 712cd0c2139SMatthew G Knepley } 713cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr); 714cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 715cd0c2139SMatthew G Knepley PetscInt numCells; 716cd0c2139SMatthew G Knepley 717cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr); 718cd0c2139SMatthew G Knepley if (numCells < 2) { 719cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr); 720cd0c2139SMatthew G Knepley } else { 721cd0c2139SMatthew G Knepley const PetscInt *cells = NULL; 722cd0c2139SMatthew G Knepley PetscInt vA, vB; 723cd0c2139SMatthew G Knepley 724cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr); 725cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr); 726cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr); 72790664b96SToby Isaac if (vA != 1 && vB != 1) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);} 728cd0c2139SMatthew G Knepley } 729cd0c2139SMatthew G Knepley } 730cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 731cd0c2139SMatthew G Knepley } 732cd0c2139SMatthew G Knepley 733ca04dac2SToby Isaac static PetscErrorCode DMPlexShiftTree_Internal(DM dm, PetscInt depthShift[], DM dmNew) 734ca04dac2SToby Isaac { 735ca04dac2SToby Isaac DM refTree; 736ca04dac2SToby Isaac PetscSection pSec; 737ca04dac2SToby Isaac PetscInt *parents, *childIDs; 738ca04dac2SToby Isaac PetscErrorCode ierr; 739ca04dac2SToby Isaac 740ca04dac2SToby Isaac PetscFunctionBegin; 741ca04dac2SToby Isaac ierr = DMPlexGetReferenceTree(dm,&refTree);CHKERRQ(ierr); 742ca04dac2SToby Isaac ierr = DMPlexSetReferenceTree(dmNew,refTree);CHKERRQ(ierr); 743ca04dac2SToby Isaac ierr = DMPlexGetTree(dm,&pSec,&parents,&childIDs,NULL,NULL);CHKERRQ(ierr); 744ca04dac2SToby Isaac if (pSec) { 7452582d50cSToby Isaac PetscInt p, pStart, pEnd, *parentsShifted, pStartShifted, pEndShifted, depth; 746fb4630b5SToby Isaac PetscInt *childIDsShifted; 747ca04dac2SToby Isaac PetscSection pSecShifted; 748ca04dac2SToby Isaac 749ca04dac2SToby Isaac ierr = PetscSectionGetChart(pSec,&pStart,&pEnd);CHKERRQ(ierr); 750ca04dac2SToby Isaac ierr = DMPlexGetDepth(dm,&depth);CHKERRQ(ierr); 7512582d50cSToby Isaac pStartShifted = DMPlexShiftPoint_Internal(pStart,depth,depthShift); 7522582d50cSToby Isaac pEndShifted = DMPlexShiftPoint_Internal(pEnd,depth,depthShift); 753fb4630b5SToby Isaac ierr = PetscMalloc2(pEndShifted - pStartShifted,&parentsShifted,pEndShifted-pStartShifted,&childIDsShifted);CHKERRQ(ierr); 754ca04dac2SToby Isaac ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dmNew),&pSecShifted);CHKERRQ(ierr); 755ca04dac2SToby Isaac ierr = PetscSectionSetChart(pSecShifted,pStartShifted,pEndShifted);CHKERRQ(ierr); 756ca04dac2SToby Isaac for (p = pStartShifted; p < pEndShifted; p++) { 757fb4630b5SToby Isaac /* start off assuming no children */ 758fb4630b5SToby Isaac ierr = PetscSectionSetDof(pSecShifted,p,0);CHKERRQ(ierr); 759fb4630b5SToby Isaac } 760fb4630b5SToby Isaac for (p = pStart; p < pEnd; p++) { 761fb4630b5SToby Isaac PetscInt dof; 762fb4630b5SToby Isaac PetscInt pNew = DMPlexShiftPoint_Internal(p,depth,depthShift); 763ca04dac2SToby Isaac 764ca04dac2SToby Isaac ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr); 765fb4630b5SToby Isaac ierr = PetscSectionSetDof(pSecShifted,pNew,dof);CHKERRQ(ierr); 766ca04dac2SToby Isaac } 767ca04dac2SToby Isaac ierr = PetscSectionSetUp(pSecShifted);CHKERRQ(ierr); 768fb4630b5SToby Isaac for (p = pStart; p < pEnd; p++) { 769fb4630b5SToby Isaac PetscInt dof; 770fb4630b5SToby Isaac PetscInt pNew = DMPlexShiftPoint_Internal(p,depth,depthShift); 771fb4630b5SToby Isaac 772fb4630b5SToby Isaac ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr); 773fb4630b5SToby Isaac if (dof) { 774fb4630b5SToby Isaac PetscInt off, offNew; 775fb4630b5SToby Isaac 776fb4630b5SToby Isaac ierr = PetscSectionGetOffset(pSec,p,&off);CHKERRQ(ierr); 777fb4630b5SToby Isaac ierr = PetscSectionGetOffset(pSecShifted,pNew,&offNew);CHKERRQ(ierr); 778fb4630b5SToby Isaac parentsShifted[offNew] = DMPlexShiftPoint_Internal(parents[off],depth,depthShift); 779fb4630b5SToby Isaac childIDsShifted[offNew] = childIDs[off]; 780fb4630b5SToby Isaac } 781fb4630b5SToby Isaac } 782fb4630b5SToby Isaac ierr = DMPlexSetTree(dmNew,pSecShifted,parentsShifted,childIDsShifted);CHKERRQ(ierr); 783fb4630b5SToby Isaac ierr = PetscFree2(parentsShifted,childIDsShifted);CHKERRQ(ierr); 784e6885bbbSToby Isaac ierr = PetscSectionDestroy(&pSecShifted);CHKERRQ(ierr); 785ca04dac2SToby Isaac } 786ca04dac2SToby Isaac PetscFunctionReturn(0); 787ca04dac2SToby Isaac } 788ca04dac2SToby Isaac 789cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm) 790cd0c2139SMatthew G Knepley { 791da97024aSMatthew G. Knepley PetscSF sf; 792cd0c2139SMatthew G Knepley IS valueIS; 793da97024aSMatthew G. Knepley const PetscInt *values, *leaves; 794cd0c2139SMatthew G Knepley PetscInt *depthShift; 7952582d50cSToby Isaac PetscInt d, depth = 0, nleaves, loc, Ng, numFS, fs, fStart, fEnd, ghostCell, cEnd, c; 79690b157c4SStefano Zampini PetscBool isper; 79790b157c4SStefano Zampini const PetscReal *maxCell, *L; 79890b157c4SStefano Zampini const DMBoundaryType *bd; 799cd0c2139SMatthew G Knepley PetscErrorCode ierr; 800cd0c2139SMatthew G Knepley 801cd0c2139SMatthew G Knepley PetscFunctionBegin; 802da97024aSMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 803da97024aSMatthew G. Knepley ierr = PetscSFGetGraph(sf, NULL, &nleaves, &leaves, NULL);CHKERRQ(ierr); 804da97024aSMatthew G. Knepley nleaves = PetscMax(0, nleaves); 80546c796b9SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 806cd0c2139SMatthew G Knepley /* Count ghost cells */ 807cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 808cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr); 809cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 8104a6cfa73SMatthew G. Knepley Ng = 0; 811cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 81246c796b9SMatthew G. Knepley IS faceIS; 81346c796b9SMatthew G. Knepley const PetscInt *faces; 81446c796b9SMatthew G. Knepley PetscInt numFaces, f, numBdFaces = 0; 815cd0c2139SMatthew G Knepley 81646c796b9SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 81746c796b9SMatthew G. Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 81846c796b9SMatthew G. Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 81946c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 820ca04dac2SToby Isaac PetscInt numChildren; 821ca04dac2SToby Isaac 822da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 823ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 824ca04dac2SToby Isaac /* non-local and ancestors points don't get to register ghosts */ 825ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 82646c796b9SMatthew G. Knepley if ((faces[f] >= fStart) && (faces[f] < fEnd)) ++numBdFaces; 82746c796b9SMatthew G. Knepley } 8284a6cfa73SMatthew G. Knepley Ng += numBdFaces; 829ba2698f1SMatthew G. Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 83046c796b9SMatthew G. Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 831cd0c2139SMatthew G Knepley } 832cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 8332582d50cSToby Isaac ierr = PetscMalloc1(2*(depth+1), &depthShift);CHKERRQ(ierr); 8342582d50cSToby Isaac for (d = 0; d <= depth; d++) { 83559eef20bSToby Isaac PetscInt dEnd; 8362582d50cSToby Isaac 8370974a383SToby Isaac ierr = DMPlexGetDepthStratum(dm,d,NULL,&dEnd);CHKERRQ(ierr); 83859eef20bSToby Isaac depthShift[2*d] = dEnd; 8392582d50cSToby Isaac depthShift[2*d+1] = 0; 8402582d50cSToby Isaac } 8412582d50cSToby Isaac if (depth >= 0) depthShift[2*depth+1] = Ng; 8422582d50cSToby Isaac ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift);CHKERRQ(ierr); 843cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 844cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 845cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 8464a6cfa73SMatthew G. Knepley for (c = cEnd; c < cEnd + Ng; ++c) { 847cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr); 848cd0c2139SMatthew G Knepley } 849cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 850cd0c2139SMatthew G Knepley IS faceIS; 851cd0c2139SMatthew G Knepley const PetscInt *faces; 852cd0c2139SMatthew G Knepley PetscInt numFaces, f; 853cd0c2139SMatthew G Knepley 854cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 855cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 856cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 857cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 858ca04dac2SToby Isaac PetscInt size, numChildren; 859cd0c2139SMatthew G Knepley 860da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 861ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 862ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 86346c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 864cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr); 8654553fd90SToby Isaac if (size != 1) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "DM has boundary face %d with %d support cells", faces[f], size); 8664a6cfa73SMatthew G. Knepley ierr = DMPlexSetSupportSize(gdm, faces[f] + Ng, 2);CHKERRQ(ierr); 867cd0c2139SMatthew G Knepley } 868cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 869cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 870cd0c2139SMatthew G Knepley } 871cd0c2139SMatthew G Knepley /* Step 4: Setup ghosted DM */ 872cd0c2139SMatthew G Knepley ierr = DMSetUp(gdm);CHKERRQ(ierr); 873cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 874cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 875cd0c2139SMatthew G Knepley ghostCell = cEnd; 876cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 877cd0c2139SMatthew G Knepley IS faceIS; 878cd0c2139SMatthew G Knepley const PetscInt *faces; 879cd0c2139SMatthew G Knepley PetscInt numFaces, f; 880cd0c2139SMatthew G Knepley 881cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 882cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 883cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 88446c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 885ca04dac2SToby Isaac PetscInt newFace = faces[f] + Ng, numChildren; 886cd0c2139SMatthew G Knepley 887da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 888ca04dac2SToby Isaac ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr); 889ca04dac2SToby Isaac if (loc >= 0 || numChildren) continue; 89046c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 891cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr); 892cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr); 89346c796b9SMatthew G. Knepley ++ghostCell; 894cd0c2139SMatthew G Knepley } 895cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 896cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 897cd0c2139SMatthew G Knepley } 898cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 899cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 900cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 901cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 902cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 903ca04dac2SToby Isaac ierr = DMPlexShiftTree_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 904cd0c2139SMatthew G Knepley ierr = PetscFree(depthShift);CHKERRQ(ierr); 905412e9a14SMatthew G. Knepley for (c = cEnd; c < cEnd + Ng; ++c) { 906412e9a14SMatthew G. Knepley ierr = DMPlexSetCellType(gdm, c, DM_POLYTOPE_FV_GHOST);CHKERRQ(ierr); 907412e9a14SMatthew G. Knepley } 908966c7b3fSMatthew G. Knepley /* Step 7: Periodicity */ 90990b157c4SStefano Zampini ierr = DMGetPeriodicity(dm, &isper, &maxCell, &L, &bd);CHKERRQ(ierr); 91090b157c4SStefano Zampini ierr = DMSetPeriodicity(gdm, isper, maxCell, L, bd);CHKERRQ(ierr); 9114a6cfa73SMatthew G. Knepley if (numGhostCells) *numGhostCells = Ng; 912cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 913cd0c2139SMatthew G Knepley } 914cd0c2139SMatthew G Knepley 915cd0c2139SMatthew G Knepley /*@C 916cd0c2139SMatthew G Knepley DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face 917cd0c2139SMatthew G Knepley 918cd0c2139SMatthew G Knepley Collective on dm 919cd0c2139SMatthew G Knepley 920cd0c2139SMatthew G Knepley Input Parameters: 921cd0c2139SMatthew G Knepley + dm - The original DM 922cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL 923cd0c2139SMatthew G Knepley 924cd0c2139SMatthew G Knepley Output Parameters: 925cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM 926cd0c2139SMatthew G Knepley - dmGhosted - The new DM 927cd0c2139SMatthew G Knepley 928cd0c2139SMatthew G Knepley Note: If no label exists of that name, one will be created marking all boundary faces 929cd0c2139SMatthew G Knepley 930cd0c2139SMatthew G Knepley Level: developer 931cd0c2139SMatthew G Knepley 932cd0c2139SMatthew G Knepley .seealso: DMCreate() 93331266bc0SMatthew G. Knepley @*/ 934cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted) 935cd0c2139SMatthew G Knepley { 936cd0c2139SMatthew G Knepley DM gdm; 937cd0c2139SMatthew G Knepley DMLabel label; 938cd0c2139SMatthew G Knepley const char *name = labelName ? labelName : "Face Sets"; 939412e9a14SMatthew G. Knepley PetscInt dim, Ng = 0; 940b0441da4SMatthew G. Knepley PetscBool useCone, useClosure; 941cd0c2139SMatthew G Knepley PetscErrorCode ierr; 942cd0c2139SMatthew G Knepley 943cd0c2139SMatthew G Knepley PetscFunctionBegin; 944cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 9454a6cfa73SMatthew G. Knepley if (numGhostCells) PetscValidPointer(numGhostCells, 3); 946cd0c2139SMatthew G Knepley PetscValidPointer(dmGhosted, 4); 947cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr); 948cd0c2139SMatthew G Knepley ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr); 949c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 950c73cfb54SMatthew G. Knepley ierr = DMSetDimension(gdm, dim);CHKERRQ(ierr); 951b0441da4SMatthew G. Knepley ierr = DMGetBasicAdjacency(dm, &useCone, &useClosure);CHKERRQ(ierr); 952b0441da4SMatthew G. Knepley ierr = DMSetBasicAdjacency(gdm, useCone, useClosure);CHKERRQ(ierr); 953c58f1c22SToby Isaac ierr = DMGetLabel(dm, name, &label);CHKERRQ(ierr); 954cd0c2139SMatthew G Knepley if (!label) { 955cd0c2139SMatthew G Knepley /* Get label for boundary faces */ 956c58f1c22SToby Isaac ierr = DMCreateLabel(dm, name);CHKERRQ(ierr); 957c58f1c22SToby Isaac ierr = DMGetLabel(dm, name, &label);CHKERRQ(ierr); 958e752be1aSMatthew G. Knepley ierr = DMPlexMarkBoundaryFaces(dm, 1, label);CHKERRQ(ierr); 959cd0c2139SMatthew G Knepley } 960d80ece95SMatthew G. Knepley ierr = DMPlexConstructGhostCells_Internal(dm, label, &Ng, gdm);CHKERRQ(ierr); 961a6ba4734SToby Isaac ierr = DMCopyBoundary(dm, gdm);CHKERRQ(ierr); 962b0441da4SMatthew G. Knepley ierr = DMCopyDisc(dm, gdm);CHKERRQ(ierr); 963cad26855SMatthew G. Knepley gdm->setfromoptionscalled = dm->setfromoptionscalled; 964d80ece95SMatthew G. Knepley if (numGhostCells) *numGhostCells = Ng; 965cd0c2139SMatthew G Knepley *dmGhosted = gdm; 966cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 967cd0c2139SMatthew G Knepley } 968cd0c2139SMatthew G Knepley 969607ab7a9SMatthew G. Knepley /* 970faedd622SMatthew G. Knepley We are adding three kinds of points here: 971607ab7a9SMatthew G. Knepley Replicated: Copies of points which exist in the mesh, such as vertices identified across a fault 972faedd622SMatthew G. Knepley Non-replicated: Points which exist on the fault, but are not replicated 973607ab7a9SMatthew G. Knepley Hybrid: Entirely new points, such as cohesive cells 974a6ae58d1SMatthew G. Knepley 975a6ae58d1SMatthew G. Knepley When creating subsequent cohesive cells, we shift the old hybrid cells to the end of the numbering at 976a6ae58d1SMatthew G. Knepley each depth so that the new split/hybrid points can be inserted as a block. 977607ab7a9SMatthew G. Knepley */ 9787db7e0a7SMatthew G. Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DMLabel splitLabel, DM sdm) 979cd0c2139SMatthew G Knepley { 980cd0c2139SMatthew G Knepley MPI_Comm comm; 981607ab7a9SMatthew G. Knepley IS valueIS; 982607ab7a9SMatthew G. Knepley PetscInt numSP = 0; /* The number of depths for which we have replicated points */ 983607ab7a9SMatthew G. Knepley const PetscInt *values; /* List of depths for which we have replicated points */ 98418c5995bSMatthew G. Knepley IS *splitIS; 98518c5995bSMatthew G. Knepley IS *unsplitIS; 986607ab7a9SMatthew G. Knepley PetscInt *numSplitPoints; /* The number of replicated points at each depth */ 98718c5995bSMatthew G. Knepley PetscInt *numUnsplitPoints; /* The number of non-replicated points at each depth which still give rise to hybrid points */ 98836dbac82SMatthew G. Knepley PetscInt *numHybridPoints; /* The number of new hybrid points at each depth */ 98936dbac82SMatthew G. Knepley PetscInt *numHybridPointsOld; /* The number of existing hybrid points at each depth */ 990607ab7a9SMatthew G. Knepley const PetscInt **splitPoints; /* Replicated points for each depth */ 99118c5995bSMatthew G. Knepley const PetscInt **unsplitPoints; /* Non-replicated points for each depth */ 992cd0c2139SMatthew G Knepley PetscSection coordSection; 993cd0c2139SMatthew G Knepley Vec coordinates; 994cd0c2139SMatthew G Knepley PetscScalar *coords; 995a6ae58d1SMatthew G. Knepley PetscInt *depthMax; /* The first hybrid point at each depth in the original mesh */ 996a6ae58d1SMatthew G. Knepley PetscInt *depthEnd; /* The point limit at each depth in the original mesh */ 997607ab7a9SMatthew G. Knepley PetscInt *depthShift; /* Number of replicated+hybrid points at each depth */ 998607ab7a9SMatthew G. Knepley PetscInt *pMaxNew; /* The first replicated point at each depth in the new mesh, hybrids come after this */ 999607ab7a9SMatthew G. Knepley PetscInt *coneNew, *coneONew, *supportNew; 100018c5995bSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v; 1001cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1002cd0c2139SMatthew G Knepley 1003cd0c2139SMatthew G Knepley PetscFunctionBegin; 1004cd0c2139SMatthew G Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1005c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1006607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1007fd4b9f15SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 1008412e9a14SMatthew G. Knepley /* We do not want this label automatically computed, instead we compute it here */ 1009412e9a14SMatthew G. Knepley ierr = DMCreateLabel(sdm, "celltype");CHKERRQ(ierr); 1010cd0c2139SMatthew G Knepley /* Count split points and add cohesive cells */ 1011607ab7a9SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 10122582d50cSToby Isaac ierr = PetscMalloc5(depth+1,&depthMax,depth+1,&depthEnd,2*(depth+1),&depthShift,depth+1,&pMaxNew,depth+1,&numHybridPointsOld);CHKERRQ(ierr); 1013dcca6d9dSJed 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); 1014607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 1015607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 1016412e9a14SMatthew G. Knepley ierr = DMPlexGetTensorPrismBounds_Internal(dm, d, &depthMax[d], NULL);CHKERRQ(ierr); 1017a6ae58d1SMatthew G. Knepley depthEnd[d] = pMaxNew[d]; 1018a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 1019607ab7a9SMatthew G. Knepley numSplitPoints[d] = 0; 102018c5995bSMatthew G. Knepley numUnsplitPoints[d] = 0; 1021607ab7a9SMatthew G. Knepley numHybridPoints[d] = 0; 1022a6ae58d1SMatthew G. Knepley numHybridPointsOld[d] = depthMax[d] < 0 ? 0 : depthEnd[d] - depthMax[d]; 1023607ab7a9SMatthew G. Knepley splitPoints[d] = NULL; 102418c5995bSMatthew G. Knepley unsplitPoints[d] = NULL; 102518c5995bSMatthew G. Knepley splitIS[d] = NULL; 102618c5995bSMatthew G. Knepley unsplitIS[d] = NULL; 102759eef20bSToby Isaac /* we are shifting the existing hybrid points with the stratum behind them, so 102859eef20bSToby Isaac * the split comes at the end of the normal points, i.e., at depthMax[d] */ 102959eef20bSToby Isaac depthShift[2*d] = depthMax[d]; 103059eef20bSToby Isaac depthShift[2*d+1] = 0; 1031607ab7a9SMatthew G. Knepley } 1032cd0c2139SMatthew G Knepley if (label) { 1033cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 1034cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 1035cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 1036cd0c2139SMatthew G Knepley } 1037cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1038cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 1039cd0c2139SMatthew G Knepley 1040cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 104118c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr); 104218c5995bSMatthew G. Knepley if (splitIS[dep]) { 104318c5995bSMatthew G. Knepley ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 104418c5995bSMatthew G. Knepley ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 104518c5995bSMatthew G. Knepley } 104618c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr); 104718c5995bSMatthew G. Knepley if (unsplitIS[dep]) { 104818c5995bSMatthew G. Knepley ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr); 104918c5995bSMatthew G. Knepley ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr); 1050cd0c2139SMatthew G Knepley } 1051cd0c2139SMatthew G Knepley } 1052607ab7a9SMatthew G. Knepley /* Calculate number of hybrid points */ 105318c5995bSMatthew 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 */ 10542582d50cSToby Isaac for (d = 0; d <= depth; ++d) depthShift[2*d+1] = numSplitPoints[d] + numHybridPoints[d]; 10553d3eaba7SBarry Smith ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift);CHKERRQ(ierr); 105659eef20bSToby Isaac /* the end of the points in this stratum that come before the new points: 105759eef20bSToby Isaac * shifting pMaxNew[d] gets the new start of the next stratum, then count back the old hybrid points and the newly 105859eef20bSToby Isaac * added points */ 10592582d50cSToby Isaac for (d = 0; d <= depth; ++d) pMaxNew[d] = DMPlexShiftPoint_Internal(pMaxNew[d],depth,depthShift) - (numHybridPointsOld[d] + numSplitPoints[d] + numHybridPoints[d]); 1060cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1061cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 1062cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1063cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 1064cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 10652582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 10664c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 1067cd0c2139SMatthew G Knepley const PetscInt *support; 10684c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, qf, qn, qp, e; 1069cd0c2139SMatthew G Knepley 1070cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 1071cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 1072cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 1073cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 1074cd0c2139SMatthew G Knepley if (dep == depth-1) { 10754c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 10764c367dbcSMatthew G. Knepley 1077cd0c2139SMatthew G Knepley /* Add cohesive cells, they are prisms */ 10784c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr); 1079412e9a14SMatthew G. Knepley switch (coneSize) { 1080412e9a14SMatthew G. Knepley case 2: ierr = DMPlexSetCellType(sdm, hybcell, DM_POLYTOPE_SEG_PRISM_TENSOR);CHKERRQ(ierr);break; 1081412e9a14SMatthew G. Knepley case 3: ierr = DMPlexSetCellType(sdm, hybcell, DM_POLYTOPE_TRI_PRISM_TENSOR);CHKERRQ(ierr);break; 1082412e9a14SMatthew G. Knepley case 4: ierr = DMPlexSetCellType(sdm, hybcell, DM_POLYTOPE_QUAD_PRISM_TENSOR);CHKERRQ(ierr);break; 1083412e9a14SMatthew G. Knepley } 1084cd0c2139SMatthew G Knepley } else if (dep == 0) { 10854c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1086cd0c2139SMatthew G Knepley 1087cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 10884c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 1089cd0c2139SMatthew G Knepley PetscInt val; 1090cd0c2139SMatthew G Knepley 1091cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 10924c367dbcSMatthew G. Knepley if (val == 1) ++qf; 10934c367dbcSMatthew G. Knepley if ((val == 1) || (val == (shift + 1))) ++qn; 10944c367dbcSMatthew G. Knepley if ((val == 1) || (val == -(shift + 1))) ++qp; 1095cd0c2139SMatthew G Knepley } 10964c367dbcSMatthew G. Knepley /* Split old vertex: Edges into original vertex and new cohesive edge */ 10974c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 10984c367dbcSMatthew G. Knepley /* Split new vertex: Edges into split vertex and new cohesive edge */ 10994c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 11004c367dbcSMatthew G. Knepley /* Add hybrid edge */ 11014c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 11024c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 1103412e9a14SMatthew G. Knepley ierr = DMPlexSetCellType(sdm, hybedge, DM_POLYTOPE_POINT_PRISM_TENSOR);CHKERRQ(ierr); 1104cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 11054c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 11064c367dbcSMatthew G. Knepley 1107cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 11084c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 1109cd0c2139SMatthew G Knepley PetscInt val; 1110cd0c2139SMatthew G Knepley 1111cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 11124c367dbcSMatthew G. Knepley if (val == dim-1) ++qf; 11134c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 11144c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 1115cd0c2139SMatthew G Knepley } 11164c367dbcSMatthew G. Knepley /* Split old edge: Faces into original edge and cohesive face (positive side?) */ 11174c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 11184c367dbcSMatthew G. Knepley /* Split new edge: Faces into split edge and cohesive face (negative side?) */ 11194c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 11204c367dbcSMatthew G. Knepley /* Add hybrid face */ 11214c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 11224c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 1123412e9a14SMatthew G. Knepley ierr = DMPlexSetCellType(sdm, hybface, DM_POLYTOPE_SEG_PRISM_TENSOR);CHKERRQ(ierr); 1124cd0c2139SMatthew G Knepley } 1125cd0c2139SMatthew G Knepley } 1126cd0c2139SMatthew G Knepley } 112718c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 112818c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 112918c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 11302582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 113118c5995bSMatthew G. Knepley const PetscInt *support; 1132da1dd7e4SMatthew G. Knepley PetscInt coneSize, supportSize, qf, e, s; 113318c5995bSMatthew G. Knepley 113418c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 113518c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 113639254ff6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 113718c5995bSMatthew G. Knepley if (dep == 0) { 113818c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 113918c5995bSMatthew G. Knepley 114039254ff6SMatthew G. Knepley /* Unsplit vertex: Edges into original vertex, split edges, and new cohesive edge twice */ 114139254ff6SMatthew G. Knepley for (s = 0, qf = 0; s < supportSize; ++s, ++qf) { 114239254ff6SMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 114339254ff6SMatthew G. Knepley if (e >= 0) ++qf; 114439254ff6SMatthew G. Knepley } 114539254ff6SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 114618c5995bSMatthew G. Knepley /* Add hybrid edge */ 114718c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 1148e1757548SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 1149e1757548SMatthew G. Knepley PetscInt val; 1150e1757548SMatthew G. Knepley 1151e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1152e1757548SMatthew G. Knepley /* Split and unsplit edges produce hybrid faces */ 1153da1dd7e4SMatthew G. Knepley if (val == 1) ++qf; 1154da1dd7e4SMatthew G. Knepley if (val == (shift2 + 1)) ++qf; 1155e1757548SMatthew G. Knepley } 1156e1757548SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 1157412e9a14SMatthew G. Knepley ierr = DMPlexSetCellType(sdm, hybedge, DM_POLYTOPE_POINT_PRISM_TENSOR);CHKERRQ(ierr); 115818c5995bSMatthew G. Knepley } else if (dep == dim-2) { 115918c5995bSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 1160cd0c2139SMatthew G Knepley PetscInt val; 1161cd0c2139SMatthew G Knepley 1162da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 1163cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1164da1dd7e4SMatthew G. Knepley if (val == dim-1) qf += 2; 1165da1dd7e4SMatthew G. Knepley else ++qf; 1166cd0c2139SMatthew G Knepley } 116718c5995bSMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */ 1168da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 116918c5995bSMatthew G. Knepley /* Add hybrid face */ 1170da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 1171da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1172da1dd7e4SMatthew G. Knepley if (val == dim-1) ++qf; 1173da1dd7e4SMatthew G. Knepley } 117418c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 1175da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 1176412e9a14SMatthew G. Knepley ierr = DMPlexSetCellType(sdm, hybface, DM_POLYTOPE_SEG_PRISM_TENSOR);CHKERRQ(ierr); 1177cd0c2139SMatthew G Knepley } 1178cd0c2139SMatthew G Knepley } 1179cd0c2139SMatthew G Knepley } 1180cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 1181cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 1182cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1183dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 1184dcca6d9dSJed Brown ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),&supportNew);CHKERRQ(ierr); 1185cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 1186cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1187cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 1188cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 11892582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 11904c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 1191cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 11924c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, q, qf, qn, qp, v, e, s; 1193cd0c2139SMatthew G Knepley 1194cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 1195cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 1196cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 1197cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 1198cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 1199cd0c2139SMatthew G Knepley if (dep == depth-1) { 120096a07cd0SMatthew G. Knepley PetscBool hasUnsplit = PETSC_FALSE; 12014c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1202cd0c2139SMatthew G Knepley const PetscInt *supportF; 1203cd0c2139SMatthew G Knepley 1204cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 1205cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 1206cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 1207cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 1208cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 1209cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 12104c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 121118c5995bSMatthew G. Knepley if (v < 0) { 121218c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 121318c5995bSMatthew 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); 12142582d50cSToby Isaac coneNew[2+q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/; 121596a07cd0SMatthew G. Knepley hasUnsplit = PETSC_TRUE; 121618c5995bSMatthew G. Knepley } else { 12174c367dbcSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep-1]; 1218163235baSMatthew G. Knepley if (dep > 1) { 1219163235baSMatthew G. Knepley const PetscInt *econe; 1220163235baSMatthew G. Knepley PetscInt econeSize, r, vs, vu; 1221163235baSMatthew G. Knepley 1222163235baSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[q], &econeSize);CHKERRQ(ierr); 1223163235baSMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[q], &econe);CHKERRQ(ierr); 1224163235baSMatthew G. Knepley for (r = 0; r < econeSize; ++r) { 1225163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numSplitPoints[dep-2], splitPoints[dep-2], &vs);CHKERRQ(ierr); 1226163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numUnsplitPoints[dep-2], unsplitPoints[dep-2], &vu);CHKERRQ(ierr); 1227163235baSMatthew G. Knepley if (vs >= 0) continue; 1228163235baSMatthew 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); 1229163235baSMatthew G. Knepley hasUnsplit = PETSC_TRUE; 1230163235baSMatthew G. Knepley } 1231163235baSMatthew G. Knepley } 1232cd0c2139SMatthew G Knepley } 1233cd0c2139SMatthew G Knepley } 1234cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 1235cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 1236e537020bSMatthew G. Knepley /* Face support */ 1237cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1238cd0c2139SMatthew G Knepley PetscInt val; 1239cd0c2139SMatthew G Knepley 1240cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 1241cd0c2139SMatthew G Knepley if (val < 0) { 1242cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 12434c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr); 1244cd0c2139SMatthew G Knepley } else { 1245cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 12464c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr); 1247e537020bSMatthew G. Knepley /* Get orientation for cohesive face */ 1248e537020bSMatthew G. Knepley { 1249e537020bSMatthew G. Knepley const PetscInt *ncone, *nconeO; 1250e537020bSMatthew G. Knepley PetscInt nconeSize, nc; 1251e537020bSMatthew G. Knepley 1252e537020bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 1253e537020bSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 1254e537020bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 1255e537020bSMatthew G. Knepley for (nc = 0; nc < nconeSize; ++nc) { 1256e537020bSMatthew G. Knepley if (ncone[nc] == oldp) { 1257e537020bSMatthew G. Knepley coneONew[0] = nconeO[nc]; 1258e537020bSMatthew G. Knepley break; 1259cd0c2139SMatthew G Knepley } 1260cd0c2139SMatthew G Knepley } 1261e537020bSMatthew 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]); 1262e537020bSMatthew G. Knepley } 1263e537020bSMatthew G. Knepley } 1264e537020bSMatthew G. Knepley } 12654c367dbcSMatthew G. Knepley /* Cohesive cell: Old and new split face, then new cohesive faces */ 1266fd4b9f15SMatthew G. Knepley coneNew[0] = newp; /* Extracted negative side orientation above */ 12674c367dbcSMatthew G. Knepley coneNew[1] = splitp; 12684c367dbcSMatthew G. Knepley coneONew[1] = coneONew[0]; 1269e537020bSMatthew G. Knepley for (q = 0; q < coneSize; ++q) { 1270412e9a14SMatthew G. Knepley /* Hybrid faces must follow order from oriented end face */ 1271412e9a14SMatthew G. Knepley const PetscInt o = coneONew[0]; 1272412e9a14SMatthew G. Knepley const PetscInt qo = o < 0 ? (-(o+1)+coneSize-q)%coneSize : (q+o)%coneSize; 1273412e9a14SMatthew G. Knepley 1274412e9a14SMatthew G. Knepley ierr = PetscFindInt(cone[qo], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 127518c5995bSMatthew G. Knepley if (v < 0) { 1276412e9a14SMatthew G. Knepley ierr = PetscFindInt(cone[qo], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 127718c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 127818c5995bSMatthew G. Knepley } else { 127918c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep]; 128018c5995bSMatthew G. Knepley } 1281412e9a14SMatthew G. Knepley coneONew[2+q] = ((o < 0) + (ornt[qo] < 0))%2 ? -1 : 0; 1282e537020bSMatthew G. Knepley } 12834c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr); 12844c367dbcSMatthew G. Knepley ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr); 128596a07cd0SMatthew G. Knepley /* Label the hybrid cells on the boundary of the split */ 128696a07cd0SMatthew G. Knepley if (hasUnsplit) {ierr = DMLabelSetValue(label, -hybcell, dim);CHKERRQ(ierr);} 1287cd0c2139SMatthew G Knepley } else if (dep == 0) { 12884c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1289cd0c2139SMatthew G Knepley 1290cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 12914c367dbcSMatthew G. Knepley for (e = 0, qn = 0; e < supportSize; ++e) { 1292cd0c2139SMatthew G Knepley PetscInt val; 1293cd0c2139SMatthew G Knepley 1294cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1295cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 12962582d50cSToby Isaac supportNew[qn++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1297cd0c2139SMatthew G Knepley } 1298cd0c2139SMatthew G Knepley } 12994c367dbcSMatthew G. Knepley supportNew[qn] = hybedge; 1300cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1301cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 13024c367dbcSMatthew G. Knepley for (e = 0, qp = 0; e < supportSize; ++e) { 1303cd0c2139SMatthew G Knepley PetscInt val, edge; 1304cd0c2139SMatthew G Knepley 1305cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1306cd0c2139SMatthew G Knepley if (val == 1) { 13074c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 1308cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 13094c367dbcSMatthew G. Knepley supportNew[qp++] = edge + pMaxNew[dep+1]; 1310cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 13112582d50cSToby Isaac supportNew[qp++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1312cd0c2139SMatthew G Knepley } 1313cd0c2139SMatthew G Knepley } 13144c367dbcSMatthew G. Knepley supportNew[qp] = hybedge; 1315cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 13164c367dbcSMatthew G. Knepley /* Hybrid edge: Old and new split vertex */ 1317cd0c2139SMatthew G Knepley coneNew[0] = newp; 1318cd0c2139SMatthew G Knepley coneNew[1] = splitp; 13194c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 13204c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 13214c367dbcSMatthew G. Knepley PetscInt val, edge; 13224c367dbcSMatthew G. Knepley 13234c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 13244c367dbcSMatthew G. Knepley if (val == 1) { 13254c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 13264c367dbcSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 13274c367dbcSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 13284c367dbcSMatthew G. Knepley } 13294c367dbcSMatthew G. Knepley } 13304c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1331cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 13324c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 13334c367dbcSMatthew G. Knepley 1334cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 1335cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 1336cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 13374c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 1338e1757548SMatthew G. Knepley if (v < 0) { 1339e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1340e1757548SMatthew 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); 13412582d50cSToby Isaac coneNew[q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/; 1342e1757548SMatthew G. Knepley } else { 13434c367dbcSMatthew G. Knepley coneNew[q] = v + pMaxNew[dep-1]; 1344cd0c2139SMatthew G Knepley } 1345e1757548SMatthew G. Knepley } 1346cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 1347cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 1348cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 1349cd0c2139SMatthew G Knepley PetscInt val; 1350cd0c2139SMatthew G Knepley 1351cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 13524c367dbcSMatthew G. Knepley if (val == dim-1) { 13532582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 13544c367dbcSMatthew G. Knepley } else if (val == (shift + dim-1)) { 13552582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1356cd0c2139SMatthew G Knepley } 1357cd0c2139SMatthew G Knepley } 1358b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1359cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1360cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 1361cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 1362cd0c2139SMatthew G Knepley PetscInt val, face; 1363cd0c2139SMatthew G Knepley 1364cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1365cd0c2139SMatthew G Knepley if (val == dim-1) { 13664c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1367cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 13684c367dbcSMatthew G. Knepley supportNew[q++] = face + pMaxNew[dep+1]; 1369cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 13702582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/; 1371cd0c2139SMatthew G Knepley } 1372cd0c2139SMatthew G Knepley } 1373b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1374cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 13754c367dbcSMatthew G. Knepley /* Hybrid face */ 13764c367dbcSMatthew G. Knepley coneNew[0] = newp; 13774c367dbcSMatthew G. Knepley coneNew[1] = splitp; 13784c367dbcSMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 13794c367dbcSMatthew G. Knepley PetscInt vertex; 13804c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr); 1381e1757548SMatthew G. Knepley if (vertex < 0) { 1382e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr); 1383e1757548SMatthew 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); 1384e1757548SMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1385e1757548SMatthew G. Knepley } else { 13864c367dbcSMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep]; 13874c367dbcSMatthew G. Knepley } 1388e1757548SMatthew G. Knepley } 13894c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 13904c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 13914c367dbcSMatthew G. Knepley PetscInt val, face; 13924c367dbcSMatthew G. Knepley 13934c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 13944c367dbcSMatthew G. Knepley if (val == dim-1) { 13954c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 13964c367dbcSMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 13974c367dbcSMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 13984c367dbcSMatthew G. Knepley } 13994c367dbcSMatthew G. Knepley } 14004c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1401cd0c2139SMatthew G Knepley } 1402cd0c2139SMatthew G Knepley } 1403cd0c2139SMatthew G Knepley } 140418c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 140518c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 140618c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 14072582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/; 140818c5995bSMatthew G. Knepley const PetscInt *cone, *support, *ornt; 1409e1757548SMatthew G. Knepley PetscInt coneSize, supportSize, supportSizeNew, q, qf, e, f, s; 141018c5995bSMatthew G. Knepley 141118c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 141218c5995bSMatthew G. Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 141318c5995bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 141418c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 141518c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 141618c5995bSMatthew G. Knepley if (dep == 0) { 141718c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 141818c5995bSMatthew G. Knepley 141918c5995bSMatthew G. Knepley /* Unsplit vertex */ 142018c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 142118c5995bSMatthew G. Knepley for (s = 0, q = 0; s < supportSize; ++s) { 14222582d50cSToby Isaac supportNew[q++] = DMPlexShiftPoint_Internal(support[s], depth, depthShift) /*support[s] + depthOffset[dep+1]*/; 142318c5995bSMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 142418c5995bSMatthew G. Knepley if (e >= 0) { 142518c5995bSMatthew G. Knepley supportNew[q++] = e + pMaxNew[dep+1]; 142618c5995bSMatthew G. Knepley } 142718c5995bSMatthew G. Knepley } 142818c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 142918c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 143018c5995bSMatthew G. Knepley if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp); 143118c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 143218c5995bSMatthew G. Knepley /* Hybrid edge */ 143318c5995bSMatthew G. Knepley coneNew[0] = newp; 143418c5995bSMatthew G. Knepley coneNew[1] = newp; 143518c5995bSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 143618c5995bSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 143718c5995bSMatthew G. Knepley PetscInt val, edge; 143818c5995bSMatthew G. Knepley 143918c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 144018c5995bSMatthew G. Knepley if (val == 1) { 144118c5995bSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 144218c5995bSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 144318c5995bSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1444e1757548SMatthew G. Knepley } else if (val == (shift2 + 1)) { 1445e1757548SMatthew G. Knepley ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr); 1446e1757548SMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]); 1447e1757548SMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1]; 144818c5995bSMatthew G. Knepley } 144918c5995bSMatthew G. Knepley } 145018c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1451e1757548SMatthew G. Knepley } else if (dep == dim-2) { 1452e1757548SMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 1453e1757548SMatthew G. Knepley 1454da1dd7e4SMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and hybrid face twice */ 1455e1757548SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1456e1757548SMatthew G. Knepley PetscInt val, face; 1457e1757548SMatthew G. Knepley 1458e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1459e1757548SMatthew G. Knepley if (val == dim-1) { 1460e1757548SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1461e1757548SMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]); 14622582d50cSToby Isaac supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/; 1463e1757548SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+1]; 1464e1757548SMatthew G. Knepley } else { 14652582d50cSToby Isaac supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/; 1466e1757548SMatthew G. Knepley } 1467e1757548SMatthew G. Knepley } 1468e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1469e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1470da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 1471da1dd7e4SMatthew 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); 1472e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1473e1757548SMatthew G. Knepley /* Add hybrid face */ 1474e1757548SMatthew G. Knepley coneNew[0] = newp; 1475212cc919SMatthew G. Knepley coneNew[1] = newp; 1476e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[0], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1477e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[0]); 1478212cc919SMatthew G. Knepley coneNew[2] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1479e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1480e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]); 1481e1757548SMatthew G. Knepley coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1482e1757548SMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 1483da1dd7e4SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1484da1dd7e4SMatthew G. Knepley PetscInt val, face; 1485da1dd7e4SMatthew G. Knepley 1486da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1487da1dd7e4SMatthew G. Knepley if (val == dim-1) { 1488da1dd7e4SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1489da1dd7e4SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1490da1dd7e4SMatthew G. Knepley } 1491da1dd7e4SMatthew G. Knepley } 1492da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, hybface, &supportSizeNew);CHKERRQ(ierr); 1493da1dd7e4SMatthew 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); 1494e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1495cd0c2139SMatthew G Knepley } 1496cd0c2139SMatthew G Knepley } 1497cd0c2139SMatthew G Knepley } 1498cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 1499cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1500cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 1501cd0c2139SMatthew G Knepley IS pIS; 1502cd0c2139SMatthew G Knepley PetscInt numPoints; 1503cd0c2139SMatthew G Knepley const PetscInt *points; 1504cd0c2139SMatthew G Knepley 1505cd0c2139SMatthew G Knepley if (dep >= 0) continue; 1506cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 1507cd0c2139SMatthew G Knepley if (!pIS) continue; 1508cd0c2139SMatthew G Knepley dep = -dep - shift; 1509cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 1510cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 1511cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1512cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 15132582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*depthOffset[dep] + oldp*/; 1514cd0c2139SMatthew G Knepley const PetscInt *cone; 1515cd0c2139SMatthew G Knepley PetscInt coneSize, c; 151650cf782dSMatthew G. Knepley /* PetscBool replaced = PETSC_FALSE; */ 1517cd0c2139SMatthew G Knepley 1518cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 1519cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 1520cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 1521cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 1522cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1523e38fbfedSToby Isaac const PetscInt coldp = DMPlexShiftPointInverse_Internal(cone[c],depth,depthShift); 1524cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 1525cd0c2139SMatthew G Knepley 1526cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 1527cd0c2139SMatthew G Knepley if (val == dep-1) { 1528cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 1529cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 1530cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 1531cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 153250cf782dSMatthew G. Knepley /* replaced = PETSC_TRUE; */ 1533cd0c2139SMatthew G Knepley } 1534cd0c2139SMatthew G Knepley } 15354a189a86SMatthew G. Knepley /* Cells with only a vertex or edge on the submesh have no replacement */ 15364a189a86SMatthew G. Knepley /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 1537cd0c2139SMatthew G Knepley } 1538cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 1539cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 1540cd0c2139SMatthew G Knepley } 1541fa8e8ae5SToby Isaac /* Step 7: Coordinates */ 1542cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 154369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 1544cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 1545cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 1546cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 15472582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[0][v], depth, depthShift) /*depthOffset[0] + splitPoints[0][v]*/; 1548cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 1549cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 1550cd0c2139SMatthew G Knepley 1551cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 1552cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 1553cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 1554cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 1555cd0c2139SMatthew G Knepley } 1556cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 1557fa8e8ae5SToby Isaac /* Step 8: SF, if I can figure this out we can split the mesh in parallel */ 1558cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1559fa8e8ae5SToby Isaac /* Step 9: Labels */ 1560cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1561c58f1c22SToby Isaac ierr = DMGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 1562cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1563cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 15642582d50cSToby Isaac const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[dep][p], depth, depthShift) /*depthOffset[dep] + splitPoints[dep][p]*/; 1565cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 1566cd0c2139SMatthew G Knepley PetscInt l; 1567cd0c2139SMatthew G Knepley 15687db7e0a7SMatthew G. Knepley if (splitLabel) { 15697db7e0a7SMatthew G. Knepley const PetscInt val = 100 + dep; 15707db7e0a7SMatthew G. Knepley 15717db7e0a7SMatthew G. Knepley ierr = DMLabelSetValue(splitLabel, newp, val);CHKERRQ(ierr); 15727db7e0a7SMatthew G. Knepley ierr = DMLabelSetValue(splitLabel, splitp, -val);CHKERRQ(ierr); 15737db7e0a7SMatthew G. Knepley } 1574cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 1575cd0c2139SMatthew G Knepley DMLabel mlabel; 1576cd0c2139SMatthew G Knepley const char *lname; 1577cd0c2139SMatthew G Knepley PetscInt val; 15789a356370SMatthew G. Knepley PetscBool isDepth; 1579cd0c2139SMatthew G Knepley 1580c58f1c22SToby Isaac ierr = DMGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 15819a356370SMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 15829a356370SMatthew G. Knepley if (isDepth) continue; 1583c58f1c22SToby Isaac ierr = DMGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 1584cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 1585cd0c2139SMatthew G Knepley if (val >= 0) { 1586cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 1587cd0c2139SMatthew G Knepley } 1588cd0c2139SMatthew G Knepley } 1589cd0c2139SMatthew G Knepley } 1590cd0c2139SMatthew G Knepley } 1591cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1592cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 1593cd0c2139SMatthew G Knepley 1594cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 159518c5995bSMatthew G. Knepley if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 159618c5995bSMatthew G. Knepley ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr); 159718c5995bSMatthew G. Knepley if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);} 159818c5995bSMatthew G. Knepley ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr); 1599cd0c2139SMatthew G Knepley } 1600cd0c2139SMatthew G Knepley if (label) { 1601cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1602cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1603cd0c2139SMatthew G Knepley } 16040d4d4d06SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 16050d4d4d06SMatthew G. Knepley ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr); 160636dbac82SMatthew G. Knepley pMaxNew[d] = pEnd - numHybridPoints[d] - numHybridPointsOld[d]; 16070d4d4d06SMatthew G. Knepley } 1608dcbb62e8SMatthew G. Knepley ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr); 16092582d50cSToby Isaac ierr = PetscFree5(depthMax, depthEnd, depthShift, pMaxNew, numHybridPointsOld);CHKERRQ(ierr); 161018c5995bSMatthew G. Knepley ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr); 1611cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1612cd0c2139SMatthew G Knepley } 1613cd0c2139SMatthew G Knepley 1614cd0c2139SMatthew G Knepley /*@C 1615cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 1616cd0c2139SMatthew G Knepley 1617cd0c2139SMatthew G Knepley Collective on dm 1618cd0c2139SMatthew G Knepley 1619cd0c2139SMatthew G Knepley Input Parameters: 1620cd0c2139SMatthew G Knepley + dm - The original DM 162153156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated) 1622cd0c2139SMatthew G Knepley 1623cd0c2139SMatthew G Knepley Output Parameters: 16247db7e0a7SMatthew G. Knepley + splitLabel - The label containing the split points, or NULL if no output is desired 1625cd0c2139SMatthew G Knepley - dmSplit - The new DM 1626cd0c2139SMatthew G Knepley 1627cd0c2139SMatthew G Knepley Level: developer 1628cd0c2139SMatthew G Knepley 16292be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 1630cd0c2139SMatthew G Knepley @*/ 16317db7e0a7SMatthew G. Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DMLabel splitLabel, DM *dmSplit) 1632cd0c2139SMatthew G Knepley { 1633cd0c2139SMatthew G Knepley DM sdm; 1634cd0c2139SMatthew G Knepley PetscInt dim; 1635cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1636cd0c2139SMatthew G Knepley 1637cd0c2139SMatthew G Knepley PetscFunctionBegin; 1638cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 163953156dfcSMatthew G. Knepley PetscValidPointer(dmSplit, 3); 1640cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 1641cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 1642c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1643c73cfb54SMatthew G. Knepley ierr = DMSetDimension(sdm, dim);CHKERRQ(ierr); 1644cd0c2139SMatthew G Knepley switch (dim) { 1645cd0c2139SMatthew G Knepley case 2: 1646cd0c2139SMatthew G Knepley case 3: 16477db7e0a7SMatthew G. Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, splitLabel, sdm);CHKERRQ(ierr); 1648cd0c2139SMatthew G Knepley break; 1649cd0c2139SMatthew G Knepley default: 1650cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 1651cd0c2139SMatthew G Knepley } 1652cd0c2139SMatthew G Knepley *dmSplit = sdm; 1653cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1654cd0c2139SMatthew G Knepley } 1655cd0c2139SMatthew G Knepley 16560f66a230SMatthew G. Knepley /* Returns the side of the surface for a given cell with a face on the surface */ 16570f66a230SMatthew G. Knepley static PetscErrorCode GetSurfaceSide_Static(DM dm, DM subdm, PetscInt numSubpoints, const PetscInt *subpoints, PetscInt cell, PetscInt face, PetscBool *pos) 16580f66a230SMatthew G. Knepley { 16590f66a230SMatthew G. Knepley const PetscInt *cone, *ornt; 16600f66a230SMatthew G. Knepley PetscInt dim, coneSize, c; 16610f66a230SMatthew G. Knepley PetscErrorCode ierr; 16620f66a230SMatthew G. Knepley 16630f66a230SMatthew G. Knepley PetscFunctionBegin; 16640f66a230SMatthew G. Knepley *pos = PETSC_TRUE; 1665c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 16660f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 16670f66a230SMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 16680f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, cell, &ornt);CHKERRQ(ierr); 16690f66a230SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 16700f66a230SMatthew G. Knepley if (cone[c] == face) { 16710f66a230SMatthew G. Knepley PetscInt o = ornt[c]; 16720f66a230SMatthew G. Knepley 16730f66a230SMatthew G. Knepley if (subdm) { 16740f66a230SMatthew G. Knepley const PetscInt *subcone, *subornt; 16750f66a230SMatthew G. Knepley PetscInt subpoint, subface, subconeSize, sc; 16760f66a230SMatthew G. Knepley 16770f66a230SMatthew G. Knepley ierr = PetscFindInt(cell, numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 16780f66a230SMatthew G. Knepley ierr = PetscFindInt(face, numSubpoints, subpoints, &subface);CHKERRQ(ierr); 16790f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 16800f66a230SMatthew G. Knepley ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 16810f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 16820f66a230SMatthew G. Knepley for (sc = 0; sc < subconeSize; ++sc) { 16830f66a230SMatthew G. Knepley if (subcone[sc] == subface) { 16840f66a230SMatthew G. Knepley o = subornt[0]; 16850f66a230SMatthew G. Knepley break; 16860f66a230SMatthew G. Knepley } 16870f66a230SMatthew G. Knepley } 16880f66a230SMatthew 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); 16890f66a230SMatthew G. Knepley } 16900f66a230SMatthew G. Knepley if (o >= 0) *pos = PETSC_TRUE; 16910f66a230SMatthew G. Knepley else *pos = PETSC_FALSE; 16920f66a230SMatthew G. Knepley break; 16930f66a230SMatthew G. Knepley } 16940f66a230SMatthew G. Knepley } 16950f66a230SMatthew 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); 16960f66a230SMatthew G. Knepley PetscFunctionReturn(0); 16970f66a230SMatthew G. Knepley } 16980f66a230SMatthew G. Knepley 1699cd0c2139SMatthew G Knepley /*@ 17000f66a230SMatthew G. Knepley DMPlexLabelCohesiveComplete - Starting with a label marking points on an internal surface, we add all other mesh pieces 1701cd0c2139SMatthew G Knepley to complete the surface 1702cd0c2139SMatthew G Knepley 1703cd0c2139SMatthew G Knepley Input Parameters: 1704cd0c2139SMatthew G Knepley + dm - The DM 17050f66a230SMatthew G. Knepley . label - A DMLabel marking the surface 17060f66a230SMatthew G. Knepley . blabel - A DMLabel marking the vertices on the boundary which will not be duplicated, or NULL to find them automatically 1707bb55d314SMatthew G. Knepley . flip - Flag to flip the submesh normal and replace points on the other side 170847946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL 1709cd0c2139SMatthew G Knepley 1710cd0c2139SMatthew G Knepley Output Parameter: 1711cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 1712cd0c2139SMatthew G Knepley 17130f66a230SMatthew G. Knepley Note: The vertices in blabel are called "unsplit" in the terminology from hybrid cell creation. 17140f66a230SMatthew G. Knepley 1715cd0c2139SMatthew G Knepley Level: developer 1716cd0c2139SMatthew G Knepley 17172be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 1718cd0c2139SMatthew G Knepley @*/ 17190f66a230SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, DMLabel blabel, PetscBool flip, DM subdm) 1720cd0c2139SMatthew G Knepley { 1721d90583fdSMatthew G. Knepley DMLabel depthLabel; 17228630cb1aSMatthew G. Knepley IS dimIS, subpointIS = NULL, facePosIS, faceNegIS, crossEdgeIS = NULL; 172347946fd8SMatthew G. Knepley const PetscInt *points, *subpoints; 1724bb55d314SMatthew G. Knepley const PetscInt rev = flip ? -1 : 1; 1725412e9a14SMatthew G. Knepley PetscInt shift = 100, shift2 = 200, dim, depth, dep, cStart, cEnd, vStart, vEnd, numPoints, numSubpoints, p, val; 1726cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1727cd0c2139SMatthew G Knepley 1728cd0c2139SMatthew G Knepley PetscFunctionBegin; 1729370472baSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1730370472baSMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1731d90583fdSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 173247946fd8SMatthew G. Knepley if (subdm) { 173397d8846cSMatthew Knepley ierr = DMPlexGetSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 173447946fd8SMatthew G. Knepley if (subpointIS) { 173547946fd8SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 173647946fd8SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 173747946fd8SMatthew G. Knepley } 173847946fd8SMatthew G. Knepley } 1739d7c8f101SMatthew G. Knepley /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */ 1740cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 174197d8846cSMatthew Knepley if (!dimIS) PetscFunctionReturn(0); 1742cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1743cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1744d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */ 1745cd0c2139SMatthew G Knepley const PetscInt *support; 1746cd0c2139SMatthew G Knepley PetscInt supportSize, s; 1747cd0c2139SMatthew G Knepley 1748cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1749c4419245SMatthew G. Knepley #if 0 1750c4419245SMatthew G. Knepley if (supportSize != 2) { 1751c4419245SMatthew G. Knepley const PetscInt *lp; 1752c4419245SMatthew G. Knepley PetscInt Nlp, pind; 1753c4419245SMatthew G. Knepley 1754c4419245SMatthew G. Knepley /* Check that for a cell with a single support face, that face is in the SF */ 1755c4419245SMatthew G. Knepley /* THis check only works for the remote side. We would need root side information */ 1756c4419245SMatthew G. Knepley ierr = PetscSFGetGraph(dm->sf, NULL, &Nlp, &lp, NULL);CHKERRQ(ierr); 1757c4419245SMatthew G. Knepley ierr = PetscFindInt(points[p], Nlp, lp, &pind);CHKERRQ(ierr); 1758c4419245SMatthew G. Knepley if (pind < 0) SETERRQ2(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports, and the face is not shared with another process", points[p], supportSize); 1759c4419245SMatthew G. Knepley } 1760c4419245SMatthew G. Knepley #endif 1761cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1762cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 17630f66a230SMatthew G. Knepley const PetscInt *cone; 1764cd0c2139SMatthew G Knepley PetscInt coneSize, c; 17650f66a230SMatthew G. Knepley PetscBool pos; 1766cd0c2139SMatthew G Knepley 17670f66a230SMatthew G. Knepley ierr = GetSurfaceSide_Static(dm, subdm, numSubpoints, subpoints, support[s], points[p], &pos);CHKERRQ(ierr); 17680f66a230SMatthew G. Knepley if (pos) {ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr);} 17690f66a230SMatthew G. Knepley else {ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);} 17700f66a230SMatthew G. Knepley if (rev < 0) pos = !pos ? PETSC_TRUE : PETSC_FALSE; 17710f66a230SMatthew G. Knepley /* Put faces touching the fault in the label */ 1772cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1773cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1774cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1775cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 1776cd0c2139SMatthew G Knepley 1777cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1778cd0c2139SMatthew G Knepley if (val == -1) { 1779cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 1780cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 1781cd0c2139SMatthew G Knepley 1782cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1783cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1784cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 1785a0541d8aSMatthew G. Knepley PetscInt bval = -1; 1786cd0c2139SMatthew G Knepley 1787cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1788a0541d8aSMatthew G. Knepley if (blabel) {ierr = DMLabelGetValue(blabel, clp, &bval);CHKERRQ(ierr);} 1789a0541d8aSMatthew G. Knepley if ((val >= 0) && (val < dim-1) && (bval < 0)) { 1790cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1791cd0c2139SMatthew G Knepley break; 1792cd0c2139SMatthew G Knepley } 1793cd0c2139SMatthew G Knepley } 1794cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1795cd0c2139SMatthew G Knepley } 1796cd0c2139SMatthew G Knepley } 1797cd0c2139SMatthew G Knepley } 1798cd0c2139SMatthew G Knepley } 17990f66a230SMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 18000f66a230SMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 180147946fd8SMatthew G. Knepley if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 1802a0541d8aSMatthew G. Knepley /* Mark boundary points as unsplit */ 180386200784SMatthew G. Knepley if (blabel) { 1804a0541d8aSMatthew G. Knepley ierr = DMLabelGetStratumIS(blabel, 1, &dimIS);CHKERRQ(ierr); 1805a0541d8aSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1806a0541d8aSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1807a0541d8aSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1808a0541d8aSMatthew G. Knepley const PetscInt point = points[p]; 1809a0541d8aSMatthew G. Knepley PetscInt val, bval; 1810a0541d8aSMatthew G. Knepley 1811a0541d8aSMatthew G. Knepley ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr); 1812a0541d8aSMatthew G. Knepley if (bval >= 0) { 1813f7019248SMatthew G. Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1814f7019248SMatthew G. Knepley if ((val < 0) || (val > dim)) { 1815f7019248SMatthew G. Knepley /* This could be a point added from splitting a vertex on an adjacent fault, otherwise its just wrong */ 1816f7019248SMatthew G. Knepley ierr = DMLabelClearValue(blabel, point, bval);CHKERRQ(ierr); 1817f7019248SMatthew G. Knepley } 1818f7019248SMatthew G. Knepley } 1819f7019248SMatthew G. Knepley } 1820f7019248SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1821f7019248SMatthew G. Knepley const PetscInt point = points[p]; 1822f7019248SMatthew G. Knepley PetscInt val, bval; 1823f7019248SMatthew G. Knepley 1824f7019248SMatthew G. Knepley ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr); 1825f7019248SMatthew G. Knepley if (bval >= 0) { 182686200784SMatthew G. Knepley const PetscInt *cone, *support; 182786200784SMatthew G. Knepley PetscInt coneSize, supportSize, s, valA, valB, valE; 182886200784SMatthew G. Knepley 1829a0541d8aSMatthew G. Knepley /* Mark as unsplit */ 1830a0541d8aSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1831a0541d8aSMatthew 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); 1832a0541d8aSMatthew G. Knepley ierr = DMLabelClearValue(label, point, val);CHKERRQ(ierr); 1833a0541d8aSMatthew G. Knepley ierr = DMLabelSetValue(label, point, shift2+val);CHKERRQ(ierr); 18342c06a818SMatthew G. Knepley /* Check for cross-edge 18352c06a818SMatthew G. Knepley A cross-edge has endpoints which are both on the boundary of the surface, but the edge itself is not. */ 183686200784SMatthew G. Knepley if (val != 0) continue; 183786200784SMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 183886200784SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 183986200784SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 184086200784SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 184186200784SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 184286200784SMatthew G. Knepley if (coneSize != 2) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Edge %D has %D vertices != 2", support[s], coneSize); 184386200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, cone[0], &valA);CHKERRQ(ierr); 184486200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, cone[1], &valB);CHKERRQ(ierr); 184586200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, support[s], &valE);CHKERRQ(ierr); 184609816f77SMatthew G. Knepley if ((valE < 0) && (valA >= 0) && (valB >= 0) && (cone[0] != cone[1])) {ierr = DMLabelSetValue(blabel, support[s], 2);CHKERRQ(ierr);} 184786200784SMatthew G. Knepley } 1848a0541d8aSMatthew G. Knepley } 1849a0541d8aSMatthew G. Knepley } 1850a0541d8aSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1851a0541d8aSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1852a0541d8aSMatthew G. Knepley } 1853cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1854c4d480a2SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 1855412e9a14SMatthew G. Knepley ierr = DMPlexGetSimplexOrBoxCells(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1856cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 185786200784SMatthew G. Knepley if (blabel) {ierr = DMLabelGetStratumIS(blabel, 2, &crossEdgeIS);CHKERRQ(ierr);} 185886200784SMatthew G. Knepley if (dimIS && crossEdgeIS) { 185986200784SMatthew G. Knepley IS vertIS = dimIS; 186086200784SMatthew G. Knepley 186186200784SMatthew G. Knepley ierr = ISExpand(vertIS, crossEdgeIS, &dimIS);CHKERRQ(ierr); 186286200784SMatthew G. Knepley ierr = ISDestroy(&crossEdgeIS);CHKERRQ(ierr); 186386200784SMatthew G. Knepley ierr = ISDestroy(&vertIS);CHKERRQ(ierr); 186486200784SMatthew G. Knepley } 1865dc86033cSMatthew G. Knepley if (!dimIS) { 1866dc86033cSMatthew G. Knepley PetscFunctionReturn(0); 1867dc86033cSMatthew G. Knepley } 1868cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1869cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1870d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */ 1871cd0c2139SMatthew G Knepley PetscInt *star = NULL; 187286200784SMatthew G. Knepley PetscInt starSize, s; 1873cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1874cd0c2139SMatthew G Knepley 1875d4622b2cSMatthew G. Knepley /* All points connected to the fault are inside a cell, so at the top level we will only check cells */ 1876cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1877cd0c2139SMatthew G Knepley while (again) { 1878cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1879cd0c2139SMatthew G Knepley again = 0; 1880cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1881cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1882cd0c2139SMatthew G Knepley const PetscInt *cone; 1883cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1884cd0c2139SMatthew G Knepley 1885412e9a14SMatthew G. Knepley if ((point < cStart) || (point >= cEnd)) continue; 1886cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1887cd0c2139SMatthew G Knepley if (val != -1) continue; 1888d4622b2cSMatthew G. Knepley again = again == 1 ? 1 : 2; 1889cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1890cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1891cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1892cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1893cd0c2139SMatthew G Knepley if (val != -1) { 1894d7c8f101SMatthew G. Knepley const PetscInt *ccone; 1895166d9d0cSMatthew G. Knepley PetscInt cconeSize, cc, side; 1896d7c8f101SMatthew G. Knepley 1897db8edaafSMatthew 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); 189837a6de01SMatthew G. Knepley if (val > 0) side = 1; 189937a6de01SMatthew G. Knepley else side = -1; 190037a6de01SMatthew G. Knepley ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr); 1901d7c8f101SMatthew G. Knepley /* Mark cell faces which touch the fault */ 1902d7c8f101SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr); 1903d7c8f101SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr); 1904d7c8f101SMatthew G. Knepley for (cc = 0; cc < cconeSize; ++cc) { 1905d7c8f101SMatthew G. Knepley PetscInt *closure = NULL; 1906d7c8f101SMatthew G. Knepley PetscInt closureSize, cl; 1907d7c8f101SMatthew G. Knepley 1908166d9d0cSMatthew G. Knepley ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr); 1909166d9d0cSMatthew G. Knepley if (val != -1) continue; 1910d7c8f101SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1911d4622b2cSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1912d7c8f101SMatthew G. Knepley const PetscInt clp = closure[cl]; 1913d7c8f101SMatthew G. Knepley 1914d7c8f101SMatthew G. Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1915d7c8f101SMatthew G. Knepley if (val == -1) continue; 1916d7c8f101SMatthew G. Knepley ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr); 191737a6de01SMatthew G. Knepley break; 191837a6de01SMatthew G. Knepley } 1919d7c8f101SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1920cd0c2139SMatthew G Knepley } 1921cd0c2139SMatthew G Knepley again = 1; 1922cd0c2139SMatthew G Knepley break; 1923cd0c2139SMatthew G Knepley } 1924cd0c2139SMatthew G Knepley } 1925cd0c2139SMatthew G Knepley } 1926cd0c2139SMatthew G Knepley } 1927cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1928cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1929cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1930cd0c2139SMatthew G Knepley 1931cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1932cd0c2139SMatthew G Knepley if (val == -1) { 1933cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1934cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1935412e9a14SMatthew G. Knepley PetscBool marked = PETSC_FALSE, isHybrid; 1936cd0c2139SMatthew G Knepley 1937cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1938cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1939cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1940cd0c2139SMatthew G Knepley 1941412e9a14SMatthew G. Knepley if ((spoint < cStart) || (spoint >= cEnd)) continue; 1942cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1943cd0c2139SMatthew 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); 1944d90583fdSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1945cd0c2139SMatthew G Knepley if (val > 0) { 1946cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1947cd0c2139SMatthew G Knepley } else { 1948cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1949cd0c2139SMatthew G Knepley } 1950cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1951cd0c2139SMatthew G Knepley break; 1952cd0c2139SMatthew G Knepley } 1953cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1954412e9a14SMatthew G. Knepley ierr = DMPlexCellIsHybrid_Internal(dm, point, &isHybrid);CHKERRQ(ierr); 1955412e9a14SMatthew G. Knepley if (!isHybrid && !marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1956cd0c2139SMatthew G Knepley } 1957cd0c2139SMatthew G Knepley } 1958cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1959cd0c2139SMatthew G Knepley } 1960cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1961cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 196218c5995bSMatthew G. Knepley /* If any faces touching the fault divide cells on either side, split them */ 196318c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift+dim-1, &facePosIS);CHKERRQ(ierr); 196418c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr); 196518c5995bSMatthew G. Knepley ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr); 196618c5995bSMatthew G. Knepley ierr = ISDestroy(&facePosIS);CHKERRQ(ierr); 196718c5995bSMatthew G. Knepley ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr); 196818c5995bSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 196918c5995bSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 197018c5995bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 197118c5995bSMatthew G. Knepley const PetscInt point = points[p]; 197218c5995bSMatthew G. Knepley const PetscInt *support; 197318c5995bSMatthew G. Knepley PetscInt supportSize, valA, valB; 197418c5995bSMatthew G. Knepley 197518c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 197618c5995bSMatthew G. Knepley if (supportSize != 2) continue; 197718c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 197818c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr); 197918c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr); 198018c5995bSMatthew G. Knepley if ((valA == -1) || (valB == -1)) continue; 198118c5995bSMatthew G. Knepley if (valA*valB > 0) continue; 198218c5995bSMatthew G. Knepley /* Split the face */ 198318c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr); 198418c5995bSMatthew G. Knepley ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr); 198518c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr); 1986e1757548SMatthew G. Knepley /* Label its closure: 1987e1757548SMatthew G. Knepley unmarked: label as unsplit 1988e1757548SMatthew G. Knepley incident: relabel as split 1989e1757548SMatthew G. Knepley split: do nothing 1990e1757548SMatthew G. Knepley */ 199118c5995bSMatthew G. Knepley { 199218c5995bSMatthew G. Knepley PetscInt *closure = NULL; 199318c5995bSMatthew G. Knepley PetscInt closureSize, cl; 199418c5995bSMatthew G. Knepley 199518c5995bSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 199618c5995bSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 199718c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr); 19988771c1d3SMatthew G. Knepley if (valA == -1) { /* Mark as unsplit */ 199918c5995bSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 200018c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr); 20018771c1d3SMatthew G. Knepley } else if (((valA >= shift) && (valA < shift2)) || ((valA <= -shift) && (valA > -shift2))) { 2002e1757548SMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 2003e1757548SMatthew G. Knepley ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr); 2004e1757548SMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr); 2005e1757548SMatthew G. Knepley } 200618c5995bSMatthew G. Knepley } 200718c5995bSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 200818c5995bSMatthew G. Knepley } 200918c5995bSMatthew G. Knepley } 201018c5995bSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 201118c5995bSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 2012cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 2013cd0c2139SMatthew G Knepley } 2014cd0c2139SMatthew G Knepley 2015720e594eSMatthew G. Knepley /* Check that no cell have all vertices on the fault */ 2016720e594eSMatthew G. Knepley PetscErrorCode DMPlexCheckValidSubmesh_Private(DM dm, DMLabel label, DM subdm) 2017720e594eSMatthew G. Knepley { 2018720e594eSMatthew G. Knepley IS subpointIS; 2019720e594eSMatthew G. Knepley const PetscInt *dmpoints; 2020720e594eSMatthew G. Knepley PetscInt defaultValue, cStart, cEnd, c, vStart, vEnd; 2021720e594eSMatthew G. Knepley PetscErrorCode ierr; 2022720e594eSMatthew G. Knepley 2023720e594eSMatthew G. Knepley PetscFunctionBegin; 2024720e594eSMatthew G. Knepley if (!label) PetscFunctionReturn(0); 2025720e594eSMatthew G. Knepley ierr = DMLabelGetDefaultValue(label, &defaultValue);CHKERRQ(ierr); 202697d8846cSMatthew Knepley ierr = DMPlexGetSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 2027720e594eSMatthew G. Knepley if (!subpointIS) PetscFunctionReturn(0); 2028720e594eSMatthew G. Knepley ierr = DMPlexGetHeightStratum(subdm, 0, &cStart, &cEnd);CHKERRQ(ierr); 2029720e594eSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 2030720e594eSMatthew G. Knepley ierr = ISGetIndices(subpointIS, &dmpoints);CHKERRQ(ierr); 2031720e594eSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2032720e594eSMatthew G. Knepley PetscBool invalidCell = PETSC_TRUE; 2033720e594eSMatthew G. Knepley PetscInt *closure = NULL; 2034720e594eSMatthew G. Knepley PetscInt closureSize, cl; 2035720e594eSMatthew G. Knepley 2036720e594eSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, dmpoints[c], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2037720e594eSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2038720e594eSMatthew G. Knepley PetscInt value = 0; 2039720e594eSMatthew G. Knepley 2040720e594eSMatthew G. Knepley if ((closure[cl] < vStart) || (closure[cl] >= vEnd)) continue; 2041720e594eSMatthew G. Knepley ierr = DMLabelGetValue(label, closure[cl], &value);CHKERRQ(ierr); 2042720e594eSMatthew G. Knepley if (value == defaultValue) {invalidCell = PETSC_FALSE; break;} 2043720e594eSMatthew G. Knepley } 2044720e594eSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, dmpoints[c], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2045720e594eSMatthew G. Knepley if (invalidCell) { 2046720e594eSMatthew G. Knepley ierr = ISRestoreIndices(subpointIS, &dmpoints);CHKERRQ(ierr); 2047720e594eSMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 2048720e594eSMatthew G. Knepley ierr = DMDestroy(&subdm);CHKERRQ(ierr); 2049720e594eSMatthew G. Knepley SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Ambiguous submesh. Cell %D has all of its vertices on the submesh.", dmpoints[c]); 2050720e594eSMatthew G. Knepley } 2051720e594eSMatthew G. Knepley } 2052720e594eSMatthew G. Knepley ierr = ISRestoreIndices(subpointIS, &dmpoints);CHKERRQ(ierr); 2053720e594eSMatthew G. Knepley PetscFunctionReturn(0); 2054720e594eSMatthew G. Knepley } 2055720e594eSMatthew G. Knepley 2056720e594eSMatthew G. Knepley 2057c08575a3SMatthew G. Knepley /*@ 20583cf72582SMatthew G. Knepley DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface 20593cf72582SMatthew G. Knepley 20603cf72582SMatthew G. Knepley Collective on dm 20613cf72582SMatthew G. Knepley 20623cf72582SMatthew G. Knepley Input Parameters: 20633cf72582SMatthew G. Knepley + dm - The original DM 2064720e594eSMatthew G. Knepley . label - The label specifying the interface vertices 2065720e594eSMatthew G. Knepley - bdlabel - The optional label specifying the interface boundary vertices 20663cf72582SMatthew G. Knepley 20673cf72582SMatthew G. Knepley Output Parameters: 20687db7e0a7SMatthew G. Knepley + hybridLabel - The label fully marking the interface, or NULL if no output is desired 20697db7e0a7SMatthew G. Knepley . splitLabel - The label containing the split points, or NULL if no output is desired 2070720e594eSMatthew G. Knepley . dmInterface - The new interface DM, or NULL 2071720e594eSMatthew G. Knepley - dmHybrid - The new DM with cohesive cells 20723cf72582SMatthew G. Knepley 20736eccb800SMatthew Knepley Note: The hybridLabel indicates what parts of the original mesh impinged on the on division surface. For points 20746eccb800SMatthew Knepley directly on the division surface, they are labeled with their dimension, so an edge 7 on the division surface would be 20756eccb800SMatthew Knepley 7 (1) in hybridLabel. For points that impinge from the positive side, they are labeled with 100+dim, so an edge 6 with 20766eccb800SMatthew Knepley one vertex 3 on the surface would be 6 (101) and 3 (0) in hybridLabel. If an edge 9 from the negative side of the 20776eccb800SMatthew Knepley surface also hits vertex 3, it would be 9 (-101) in hybridLabel. 20786eccb800SMatthew Knepley 20796eccb800SMatthew Knepley The splitLabel indicates what points in the new hybrid mesh were the result of splitting points in the original 20806eccb800SMatthew Knepley mesh. The label value is +=100+dim for each point. For example, if two edges 10 and 14 in the hybrid resulting from 20816eccb800SMatthew Knepley splitting an edge in the original mesh, you would have 10 (101) and 14 (-101) in the splitLabel. 20826eccb800SMatthew Knepley 20836eccb800SMatthew Knepley The dmInterface is a DM built from the original division surface. It has a label which can be retrieved using 20846eccb800SMatthew Knepley DMPlexGetSubpointMap() which maps each point back to the point in the surface of the original mesh. 20856eccb800SMatthew Knepley 20863cf72582SMatthew G. Knepley Level: developer 20873cf72582SMatthew G. Knepley 20886eccb800SMatthew Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMPlexGetSubpointMap(), DMCreate() 20893cf72582SMatthew G. Knepley @*/ 20907db7e0a7SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel bdlabel, DMLabel *hybridLabel, DMLabel *splitLabel, DM *dmInterface, DM *dmHybrid) 20913cf72582SMatthew G. Knepley { 20923cf72582SMatthew G. Knepley DM idm; 20937db7e0a7SMatthew G. Knepley DMLabel subpointMap, hlabel, slabel = NULL; 20943cf72582SMatthew G. Knepley PetscInt dim; 20953cf72582SMatthew G. Knepley PetscErrorCode ierr; 20963cf72582SMatthew G. Knepley 20973cf72582SMatthew G. Knepley PetscFunctionBegin; 20983cf72582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2099720e594eSMatthew G. Knepley if (bdlabel) PetscValidPointer(bdlabel, 3); 2100720e594eSMatthew G. Knepley if (hybridLabel) PetscValidPointer(hybridLabel, 4); 21017db7e0a7SMatthew G. Knepley if (splitLabel) PetscValidPointer(splitLabel, 5); 21027db7e0a7SMatthew G. Knepley if (dmInterface) PetscValidPointer(dmInterface, 6); 21037db7e0a7SMatthew G. Knepley PetscValidPointer(dmHybrid, 7); 2104c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2105158acfadSMatthew G. Knepley ierr = DMPlexCreateSubmesh(dm, label, 1, PETSC_FALSE, &idm);CHKERRQ(ierr); 2106720e594eSMatthew G. Knepley ierr = DMPlexCheckValidSubmesh_Private(dm, label, idm);CHKERRQ(ierr); 21073cf72582SMatthew G. Knepley ierr = DMPlexOrient(idm);CHKERRQ(ierr); 21083cf72582SMatthew G. Knepley ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr); 21093cf72582SMatthew G. Knepley ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr); 21103cf72582SMatthew G. Knepley ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr); 21117db7e0a7SMatthew G. Knepley if (splitLabel) { 21127db7e0a7SMatthew G. Knepley const char *name; 21137db7e0a7SMatthew G. Knepley char sname[PETSC_MAX_PATH_LEN]; 21147db7e0a7SMatthew G. Knepley 2115d67d17b1SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) hlabel, &name);CHKERRQ(ierr); 21167db7e0a7SMatthew G. Knepley ierr = PetscStrncpy(sname, name, PETSC_MAX_PATH_LEN);CHKERRQ(ierr); 21177db7e0a7SMatthew G. Knepley ierr = PetscStrcat(sname, " split");CHKERRQ(ierr); 2118d67d17b1SMatthew G. Knepley ierr = DMLabelCreate(PETSC_COMM_SELF, sname, &slabel);CHKERRQ(ierr); 21197db7e0a7SMatthew G. Knepley } 2120720e594eSMatthew G. Knepley ierr = DMPlexLabelCohesiveComplete(dm, hlabel, bdlabel, PETSC_FALSE, idm);CHKERRQ(ierr); 2121720e594eSMatthew G. Knepley if (dmInterface) {*dmInterface = idm;} 2122720e594eSMatthew G. Knepley else {ierr = DMDestroy(&idm);CHKERRQ(ierr);} 21237db7e0a7SMatthew G. Knepley ierr = DMPlexConstructCohesiveCells(dm, hlabel, slabel, dmHybrid);CHKERRQ(ierr); 21243cf72582SMatthew G. Knepley if (hybridLabel) *hybridLabel = hlabel; 212553aa2e23SMatthew G. Knepley else {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);} 21267db7e0a7SMatthew G. Knepley if (splitLabel) *splitLabel = slabel; 2127cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 2128cd0c2139SMatthew G Knepley } 2129cd0c2139SMatthew G Knepley 2130efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 2131efa14ee0SMatthew G Knepley 2132efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 2133efa14ee0SMatthew G Knepley */ 2134830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 2135efa14ee0SMatthew G Knepley { 2136fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 2137efa14ee0SMatthew G Knepley const PetscInt *subvertices; 2138412e9a14SMatthew G. Knepley PetscInt *pStart, *pEnd, pSize; 2139efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 2140efa14ee0SMatthew G Knepley PetscErrorCode ierr; 2141efa14ee0SMatthew G Knepley 2142efa14ee0SMatthew G Knepley PetscFunctionBegin; 2143efa14ee0SMatthew G Knepley *numFaces = 0; 2144efa14ee0SMatthew G Knepley *nFV = 0; 2145efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2146c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 214777d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 2148412e9a14SMatthew G. Knepley ierr = PetscMalloc2(pSize, &pStart, pSize, &pEnd);CHKERRQ(ierr); 2149efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 2150412e9a14SMatthew G. Knepley ierr = DMPlexGetSimplexOrBoxCells(dm, depth-d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 2151efa14ee0SMatthew G Knepley } 2152efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 2153fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 2154efa14ee0SMatthew G Knepley if (subvertexIS) { 2155efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 2156efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 2157efa14ee0SMatthew G Knepley } 2158efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 2159efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 21600298fd71SBarry Smith PetscInt *star = NULL; 2161efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 2162efa14ee0SMatthew G Knepley 2163efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 2164efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 2165efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 2166efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 2167efa14ee0SMatthew G Knepley } 2168efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 2169efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 21700298fd71SBarry Smith PetscInt *closure = NULL; 2171efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 2172efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 2173efa14ee0SMatthew G Knepley 2174efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 217565560c7fSMatthew G Knepley if (cellLoc == 2) continue; 217682f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 2177efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2178efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2179efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 2180efa14ee0SMatthew G Knepley PetscInt vertexLoc; 2181efa14ee0SMatthew G Knepley 2182efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 2183efa14ee0SMatthew G Knepley ++numCorners; 2184efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 2185830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 2186efa14ee0SMatthew G Knepley } 2187efa14ee0SMatthew G Knepley } 218818ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 218982f516ccSBarry 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); 2190efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 2191007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 2192007baee2SMatthew G. Knepley PetscInt numCells, nc; 2193007baee2SMatthew G. Knepley 2194efa14ee0SMatthew G Knepley ++(*numFaces); 2195efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 2196efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 2197efa14ee0SMatthew G Knepley } 2198007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 2199007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 2200007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 2201007baee2SMatthew G. Knepley } 2202007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 2203efa14ee0SMatthew G Knepley } 2204efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2205efa14ee0SMatthew G Knepley } 2206efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 2207efa14ee0SMatthew G Knepley } 2208efa14ee0SMatthew G Knepley if (subvertexIS) { 2209efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 2210efa14ee0SMatthew G Knepley } 2211efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2212412e9a14SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 2213efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 2214efa14ee0SMatthew G Knepley } 2215efa14ee0SMatthew G Knepley 2216158acfadSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, PetscBool markedFaces, DMLabel subpointMap, DM subdm) 2217efa14ee0SMatthew G Knepley { 221834b4c39eSMatthew G. Knepley IS subvertexIS = NULL; 2219efa14ee0SMatthew G Knepley const PetscInt *subvertices; 2220412e9a14SMatthew G. Knepley PetscInt *pStart, *pEnd; 2221efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 2222efa14ee0SMatthew G Knepley PetscErrorCode ierr; 2223efa14ee0SMatthew G Knepley 2224efa14ee0SMatthew G Knepley PetscFunctionBegin; 2225c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2226412e9a14SMatthew G. Knepley ierr = PetscMalloc2(dim+1, &pStart, dim+1, &pEnd);CHKERRQ(ierr); 2227efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 2228412e9a14SMatthew G. Knepley ierr = DMPlexGetSimplexOrBoxCells(dm, dim-d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 2229efa14ee0SMatthew G Knepley } 2230efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 223134b4c39eSMatthew G. Knepley if (vertexLabel) { 2232830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 2233efa14ee0SMatthew G Knepley if (subvertexIS) { 2234efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 2235efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 2236efa14ee0SMatthew G Knepley } 223734b4c39eSMatthew G. Knepley } 2238efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 2239efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 22400298fd71SBarry Smith PetscInt *star = NULL; 2241efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 2242efa14ee0SMatthew G Knepley 2243efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 2244efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 2245efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 2246158acfadSMatthew G. Knepley PetscInt faceLoc; 2247158acfadSMatthew G. Knepley 2248158acfadSMatthew G. Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) { 2249158acfadSMatthew G. Knepley if (markedFaces) { 2250158acfadSMatthew G. Knepley ierr = DMLabelGetValue(vertexLabel, point, &faceLoc);CHKERRQ(ierr); 2251158acfadSMatthew G. Knepley if (faceLoc < 0) continue; 2252158acfadSMatthew G. Knepley } 2253158acfadSMatthew G. Knepley star[numFaces++] = point; 2254158acfadSMatthew G. Knepley } 2255efa14ee0SMatthew G Knepley } 2256efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 2257efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 22580298fd71SBarry Smith PetscInt *closure = NULL; 2259efa14ee0SMatthew G Knepley PetscInt closureSize, c; 2260efa14ee0SMatthew G Knepley PetscInt faceLoc; 2261efa14ee0SMatthew G Knepley 2262efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 2263efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 226482f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 2265efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2266efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 2267efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 2268efa14ee0SMatthew G Knepley PetscInt vertexLoc; 2269efa14ee0SMatthew G Knepley 2270efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 2271efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 2272830e53efSMatthew G. Knepley if (vertexLoc != value) break; 2273efa14ee0SMatthew G Knepley } 2274efa14ee0SMatthew G Knepley } 2275efa14ee0SMatthew G Knepley if (c == closureSize*2) { 2276efa14ee0SMatthew G Knepley const PetscInt *support; 2277efa14ee0SMatthew G Knepley PetscInt supportSize, s; 2278efa14ee0SMatthew G Knepley 2279efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 2280efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 2281efa14ee0SMatthew G Knepley 2282efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 2283efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 2284efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 2285efa14ee0SMatthew G Knepley break; 2286efa14ee0SMatthew G Knepley } 2287efa14ee0SMatthew G Knepley } 2288efa14ee0SMatthew G Knepley } 2289efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2290efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2291efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 2292efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 2293efa14ee0SMatthew G Knepley } 2294efa14ee0SMatthew G Knepley } 2295efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2296efa14ee0SMatthew G Knepley } 2297efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 2298efa14ee0SMatthew G Knepley } 229934b4c39eSMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);} 2300efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2301412e9a14SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 2302efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 2303efa14ee0SMatthew G Knepley } 2304efa14ee0SMatthew G Knepley 230527c04023SMatthew 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) 2306766ab985SMatthew G. Knepley { 230727c04023SMatthew G. Knepley DMLabel label = NULL; 2308766ab985SMatthew G. Knepley const PetscInt *cone; 23099fc93327SToby Isaac PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize = -1; 2310766ab985SMatthew G. Knepley PetscErrorCode ierr; 2311766ab985SMatthew G. Knepley 2312812bfc34SJed Brown PetscFunctionBegin; 2313c0ed958bSJed Brown *numFaces = 0; 2314c0ed958bSJed Brown *nFV = 0; 2315c58f1c22SToby Isaac if (labelname) {ierr = DMGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 2316fed694aaSMatthew G. Knepley *subCells = NULL; 2317c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2318412e9a14SMatthew G. Knepley ierr = DMPlexGetTensorPrismBounds_Internal(dm, dim, &cMax, &cEnd);CHKERRQ(ierr); 2319766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 232027c04023SMatthew G. Knepley if (label) { 232127c04023SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 232227c04023SMatthew G. Knepley PetscInt val; 232327c04023SMatthew G. Knepley 232427c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 232527c04023SMatthew G. Knepley if (val == value) { 232627c04023SMatthew G. Knepley ++(*numFaces); 232727c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 232827c04023SMatthew G. Knepley } 232927c04023SMatthew G. Knepley } 233027c04023SMatthew G. Knepley } else { 2331766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 233227c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 233327c04023SMatthew G. Knepley } 2334785e854fSJed Brown ierr = PetscMalloc1(*numFaces *2, subCells);CHKERRQ(ierr); 23359fc93327SToby Isaac if (!(*numFaces)) PetscFunctionReturn(0); 23369fc93327SToby Isaac *nFV = hasLagrange ? coneSize/3 : coneSize/2; 2337766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 2338766ab985SMatthew G. Knepley const PetscInt *cells; 2339766ab985SMatthew G. Knepley PetscInt numCells; 2340766ab985SMatthew G. Knepley 234127c04023SMatthew G. Knepley if (label) { 234227c04023SMatthew G. Knepley PetscInt val; 234327c04023SMatthew G. Knepley 234427c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 234527c04023SMatthew G. Knepley if (val != value) continue; 234627c04023SMatthew G. Knepley } 2347766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2348766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 2349766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 2350766ab985SMatthew G. Knepley } 2351766ab985SMatthew G. Knepley /* Negative face */ 2352766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 235327234c99SMatthew G. Knepley /* Not true in parallel 235427234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 2355766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 2356766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 235727234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 2358766ab985SMatthew G. Knepley } 2359766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 2360766ab985SMatthew G. Knepley /* Positive face is not included */ 2361766ab985SMatthew G. Knepley } 2362766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2363766ab985SMatthew G. Knepley } 2364766ab985SMatthew G. Knepley 23653982b651SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, DMLabel label, PetscInt value, DMLabel subpointMap, DM subdm) 2366766ab985SMatthew G. Knepley { 2367766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 2368766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 2369766ab985SMatthew G. Knepley PetscErrorCode ierr; 2370766ab985SMatthew G. Knepley 2371812bfc34SJed Brown PetscFunctionBegin; 2372c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2373412e9a14SMatthew G. Knepley ierr = DMPlexGetTensorPrismBounds_Internal(dm, dim, &cMax, &cEnd);CHKERRQ(ierr); 2374766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 2375dcca6d9dSJed Brown ierr = PetscMalloc2(dim+1,&pStart,dim+1,&pEnd);CHKERRQ(ierr); 2376b3154360SMatthew G. Knepley for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);} 2377766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 2378766ab985SMatthew G. Knepley const PetscInt *cone; 2379766ab985SMatthew G. Knepley PetscInt *closure = NULL; 2380b3154360SMatthew G. Knepley PetscInt fconeSize, coneSize, closureSize, cl, val; 2381766ab985SMatthew G. Knepley 238227c04023SMatthew G. Knepley if (label) { 238327c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 238427c04023SMatthew G. Knepley if (val != value) continue; 238527c04023SMatthew G. Knepley } 2386766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2387766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2388b3154360SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr); 2389b3154360SMatthew G. Knepley if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 2390b3154360SMatthew G. Knepley /* Negative face */ 2391766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2392766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2393766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 2394766ab985SMatthew G. Knepley 2395766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2396766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 2397766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 2398766ab985SMatthew G. Knepley break; 2399766ab985SMatthew G. Knepley } 2400766ab985SMatthew G. Knepley } 2401766ab985SMatthew G. Knepley } 2402766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2403766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 2404766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 2405766ab985SMatthew G. Knepley const PetscInt *support; 2406766ab985SMatthew G. Knepley PetscInt supportSize, s; 2407766ab985SMatthew G. Knepley 2408766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 2409711de394SMatthew G. Knepley /* if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); */ 2410766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 2411766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 2412766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 2413766ab985SMatthew G. Knepley } 2414766ab985SMatthew G. Knepley } 2415766ab985SMatthew G. Knepley } 2416766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 2417766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2418766ab985SMatthew G. Knepley } 2419766ab985SMatthew G. Knepley 2420c08575a3SMatthew G. Knepley static PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2421e6ccafaeSMatthew G Knepley { 242282f516ccSBarry Smith MPI_Comm comm; 2423e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 2424e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 2425e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 2426e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2427e6ccafaeSMatthew G Knepley 242882f516ccSBarry Smith PetscFunctionBegin; 242982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2430c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &cellDim);CHKERRQ(ierr); 2431367003a6SStefano Zampini if (debug) {ierr = PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 2432e6ccafaeSMatthew G Knepley 2433ddeab2a6SMatthew G. Knepley if (cellDim == 1 && numCorners == 2) { 2434ddeab2a6SMatthew G. Knepley /* Triangle */ 2435e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 2436e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2437ddeab2a6SMatthew G. Knepley } else if (cellDim == 2 && numCorners == 3) { 2438ddeab2a6SMatthew G. Knepley /* Triangle */ 2439ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2440ddeab2a6SMatthew G. Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2441ddeab2a6SMatthew G. Knepley } else if (cellDim == 3 && numCorners == 4) { 2442ddeab2a6SMatthew G. Knepley /* Tetrahedron */ 2443ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2444ddeab2a6SMatthew G. Knepley posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2445e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 2446e6ccafaeSMatthew G Knepley /* Quadratic line */ 2447e6ccafaeSMatthew G Knepley faceSize = 1; 2448e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2449e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 2450e6ccafaeSMatthew G Knepley /* Quads */ 2451e6ccafaeSMatthew G Knepley faceSize = 2; 2452e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 2453e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2454e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 2455e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2456e6ccafaeSMatthew G Knepley } else { 2457e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 2458e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 2459e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 2460e6ccafaeSMatthew G Knepley } 2461e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 2462e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 2463e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2464e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 2465e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2466e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2467e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 2468e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2469e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2470e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 2471e6ccafaeSMatthew G Knepley }; 2472e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 2473e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2474e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2475e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 2476e6ccafaeSMatthew G Knepley }; 2477e6ccafaeSMatthew G Knepley 2478e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 2479e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 2480e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 2481e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 2482e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2483e6ccafaeSMatthew G Knepley 2484e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 2485e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 2486e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 2487e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 2488e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 2489e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2490e6ccafaeSMatthew G Knepley break; 2491e6ccafaeSMatthew G Knepley } 2492e6ccafaeSMatthew G Knepley } 2493e6ccafaeSMatthew G Knepley } 2494e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2495e6ccafaeSMatthew G Knepley break; 2496e6ccafaeSMatthew G Knepley } 2497e6ccafaeSMatthew G Knepley } 2498e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 2499e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2500e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2501e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 2502e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 2503e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2504e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 2505e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2506e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2507e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 2508e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2509e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2510e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2511e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 2512e6ccafaeSMatthew G Knepley }; 2513e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 2514e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2515e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2516e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2517e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 2518e6ccafaeSMatthew G Knepley }; 2519e6ccafaeSMatthew G Knepley 2520e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 2521e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 2522e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 2523e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 2524e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2525e6ccafaeSMatthew G Knepley 2526e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 2527e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 2528e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 2529e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 2530e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 2531e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2532e6ccafaeSMatthew G Knepley break; 2533e6ccafaeSMatthew G Knepley } 2534e6ccafaeSMatthew G Knepley } 2535e6ccafaeSMatthew G Knepley } 2536e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2537e6ccafaeSMatthew G Knepley break; 2538e6ccafaeSMatthew G Knepley } 2539e6ccafaeSMatthew G Knepley } 2540e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 2541e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2542e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2543e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 2544e6ccafaeSMatthew G Knepley /* Hexes 2545e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2546e6ccafaeSMatthew G Knepley pointing up at the second. 2547e6ccafaeSMatthew G Knepley 2548e6ccafaeSMatthew G Knepley 7---6 2549e6ccafaeSMatthew G Knepley /| /| 2550e6ccafaeSMatthew G Knepley 4---5 | 2551ddeab2a6SMatthew G. Knepley | 1-|-2 2552e6ccafaeSMatthew G Knepley |/ |/ 2553ddeab2a6SMatthew G. Knepley 0---3 2554e6ccafaeSMatthew G Knepley 2555e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2556e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 2557e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 2558e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2559e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 2560e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 2561e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2562ddeab2a6SMatthew G. Knepley 0, 3, 4, 5, /* front */ 2563ddeab2a6SMatthew G. Knepley 2, 3, 5, 6, /* right */ 2564ddeab2a6SMatthew G. Knepley 1, 2, 6, 7, /* back */ 2565ddeab2a6SMatthew G. Knepley 0, 1, 4, 7, /* left */ 2566e6ccafaeSMatthew G Knepley }; 2567e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 2568ddeab2a6SMatthew G. Knepley 1, 2, 3, 0, /* bottom */ 2569e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2570ddeab2a6SMatthew G. Knepley 0, 3, 5, 4, /* front */ 2571ddeab2a6SMatthew G. Knepley 3, 2, 6, 5, /* right */ 2572ddeab2a6SMatthew G. Knepley 2, 1, 7, 6, /* back */ 2573ddeab2a6SMatthew G. Knepley 1, 0, 4, 7, /* left */ 2574e6ccafaeSMatthew G Knepley }; 2575e6ccafaeSMatthew G Knepley 2576e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 2577e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 2578e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2579e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 2580e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2581e6ccafaeSMatthew G Knepley 2582e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 2583e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 2584e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 2585e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 2586e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 2587e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 2588e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 2589e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2590e6ccafaeSMatthew G Knepley break; 2591e6ccafaeSMatthew G Knepley } 2592e6ccafaeSMatthew G Knepley } 2593e6ccafaeSMatthew G Knepley } 2594e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2595e6ccafaeSMatthew G Knepley break; 2596e6ccafaeSMatthew G Knepley } 2597e6ccafaeSMatthew G Knepley } 2598e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2599e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2600e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2601e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 2602e6ccafaeSMatthew G Knepley /* Quadratic tet */ 2603e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 2604e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 2605e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 2606e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2607e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 2608e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2609e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 2610e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 2611e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 2612e6ccafaeSMatthew G Knepley }; 2613e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 2614e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2615e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 2616e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 2617e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 2618e6ccafaeSMatthew G Knepley }; 2619e6ccafaeSMatthew G Knepley 2620e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 2621e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 2622e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 2623e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 2624e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2625e6ccafaeSMatthew G Knepley 2626e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 2627e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 2628e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 2629e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 2630e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 2631e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 2632e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 2633e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2634e6ccafaeSMatthew G Knepley break; 2635e6ccafaeSMatthew G Knepley } 2636e6ccafaeSMatthew G Knepley } 2637e6ccafaeSMatthew G Knepley } 2638e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2639e6ccafaeSMatthew G Knepley break; 2640e6ccafaeSMatthew G Knepley } 2641e6ccafaeSMatthew G Knepley } 2642e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 2643e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2644e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2645e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 2646e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 2647e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2648e6ccafaeSMatthew G Knepley pointing up at the second. 2649e6ccafaeSMatthew G Knepley 2650e6ccafaeSMatthew G Knepley 7---6 2651e6ccafaeSMatthew G Knepley /| /| 2652e6ccafaeSMatthew G Knepley 4---5 | 2653e6ccafaeSMatthew G Knepley | 3-|-2 2654e6ccafaeSMatthew G Knepley |/ |/ 2655e6ccafaeSMatthew G Knepley 0---1 2656e6ccafaeSMatthew G Knepley 2657e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2658e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 2659e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 2660e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2661e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 2662e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 2663e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2664e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 2665e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 2666e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 2667e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 2668e6ccafaeSMatthew G Knepley }; 2669e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 2670e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 2671e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2672e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 2673e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 2674e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 2675e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 2676e6ccafaeSMatthew G Knepley }; 2677e6ccafaeSMatthew G Knepley 2678e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 2679e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 2680e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2681e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 2682e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2683e6ccafaeSMatthew G Knepley 2684e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 2685e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 2686e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 2687e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 2688e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 2689e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 2690e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 2691e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2692e6ccafaeSMatthew G Knepley break; 2693e6ccafaeSMatthew G Knepley } 2694e6ccafaeSMatthew G Knepley } 2695e6ccafaeSMatthew G Knepley } 2696e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2697e6ccafaeSMatthew G Knepley break; 2698e6ccafaeSMatthew G Knepley } 2699e6ccafaeSMatthew G Knepley } 2700e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2701e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2702e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2703e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 2704e6ccafaeSMatthew G Knepley if (!posOrient) { 2705e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 2706e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 2707e6ccafaeSMatthew G Knepley } else { 2708e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 2709e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 2710e6ccafaeSMatthew G Knepley } 2711e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 2712e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2713e6ccafaeSMatthew G Knepley } 2714e6ccafaeSMatthew G Knepley 2715c08575a3SMatthew G. Knepley /*@ 2716c08575a3SMatthew G. Knepley DMPlexGetOrientedFace - Given a cell and a face, as a set of vertices, return the oriented face, as a set of vertices, 2717c08575a3SMatthew G. Knepley in faceVertices. The orientation is such that the face normal points out of the cell 2718c08575a3SMatthew G. Knepley 2719c08575a3SMatthew G. Knepley Not collective 2720c08575a3SMatthew G. Knepley 2721c08575a3SMatthew G. Knepley Input Parameters: 2722c08575a3SMatthew G. Knepley + dm - The original mesh 2723c08575a3SMatthew G. Knepley . cell - The cell mesh point 2724c08575a3SMatthew G. Knepley . faceSize - The number of vertices on the face 2725c08575a3SMatthew G. Knepley . face - The face vertices 2726c08575a3SMatthew G. Knepley . numCorners - The number of vertices on the cell 2727c08575a3SMatthew G. Knepley . indices - Local numbering of face vertices in cell cone 2728c08575a3SMatthew G. Knepley - origVertices - Original face vertices 2729c08575a3SMatthew G. Knepley 2730c08575a3SMatthew G. Knepley Output Parameter: 2731c08575a3SMatthew G. Knepley + faceVertices - The face vertices properly oriented 2732c08575a3SMatthew G. Knepley - posOriented - PETSC_TRUE if the face was oriented with outward normal 2733c08575a3SMatthew G. Knepley 2734c08575a3SMatthew G. Knepley Level: developer 2735c08575a3SMatthew G. Knepley 2736c08575a3SMatthew G. Knepley .seealso: DMPlexGetCone() 2737c08575a3SMatthew G. Knepley @*/ 2738e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2739e6ccafaeSMatthew G Knepley { 27400298fd71SBarry Smith const PetscInt *cone = NULL; 2741e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 2742e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 2743e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2744e6ccafaeSMatthew G Knepley 2745e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2746e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 2747e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 2748e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 2749e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2750e6ccafaeSMatthew G Knepley 2751e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 2752e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 2753e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 2754e6ccafaeSMatthew G Knepley } 2755e6ccafaeSMatthew G Knepley } 2756e6ccafaeSMatthew G Knepley if (found) { 2757e6ccafaeSMatthew G Knepley indices[v2] = v; 2758e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 2759e6ccafaeSMatthew G Knepley ++v2; 2760e6ccafaeSMatthew G Knepley } else { 2761e6ccafaeSMatthew G Knepley oppositeVertex = v; 2762e6ccafaeSMatthew G Knepley } 2763e6ccafaeSMatthew G Knepley } 2764e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 2765e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2766e6ccafaeSMatthew G Knepley } 2767e6ccafaeSMatthew G Knepley 2768e6ccafaeSMatthew G Knepley /* 2769cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 2770e6ccafaeSMatthew G Knepley 2771e6ccafaeSMatthew G Knepley Not collective 2772e6ccafaeSMatthew G Knepley 2773e6ccafaeSMatthew G Knepley Input Parameters: 2774e6ccafaeSMatthew G Knepley + dm - The DMPlex 2775e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 2776e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 2777e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 2778e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 2779e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 2780e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 2781e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 2782e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 2783e6ccafaeSMatthew G Knepley 2784e6ccafaeSMatthew G Knepley Output Parameters: 2785e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 2786e6ccafaeSMatthew G Knepley 2787e6ccafaeSMatthew G Knepley Level: developer 2788e6ccafaeSMatthew G Knepley */ 2789cd0c2139SMatthew 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) 2790e6ccafaeSMatthew G Knepley { 279182f516ccSBarry Smith MPI_Comm comm; 2792e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 2793e6ccafaeSMatthew G Knepley const PetscInt *faces; 2794e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 2795e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2796e6ccafaeSMatthew G Knepley 2797e6ccafaeSMatthew G Knepley PetscFunctionBegin; 279882f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2799e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 2800e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 2801e6ccafaeSMatthew G Knepley #if 0 2802e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 2803e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2804e6ccafaeSMatthew G Knepley #else 2805e6ccafaeSMatthew G Knepley { 2806e6ccafaeSMatthew G Knepley PetscInt f; 2807e6ccafaeSMatthew G Knepley 2808e6ccafaeSMatthew G Knepley numFaces = 0; 280969291d52SBarry Smith ierr = DMGetWorkArray(subdm, 1, MPIU_INT, (void **) &faces);CHKERRQ(ierr); 2810e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 2811e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 2812e6ccafaeSMatthew G Knepley 2813e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 2814e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 2815e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 2816e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 2817e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 2818e6ccafaeSMatthew G Knepley PetscInt v; 2819e6ccafaeSMatthew G Knepley 2820e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2821e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 2822e6ccafaeSMatthew G Knepley } 2823e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 2824e6ccafaeSMatthew G Knepley } 2825e6ccafaeSMatthew G Knepley if (d == dof) { 2826e6ccafaeSMatthew G Knepley numFaces = 1; 2827e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 2828e6ccafaeSMatthew G Knepley } 2829e6ccafaeSMatthew G Knepley } 2830e6ccafaeSMatthew G Knepley } 2831e6ccafaeSMatthew G Knepley #endif 2832e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 2833e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 2834e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 2835766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 2836e6ccafaeSMatthew G Knepley } else { 2837e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 2838e6ccafaeSMatthew G Knepley PetscBool posOriented; 2839e6ccafaeSMatthew G Knepley 284069291d52SBarry Smith ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), MPIU_INT, &orientedVertices);CHKERRQ(ierr); 2841e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 2842e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 2843e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 2844e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 2845e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 2846e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2847e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 2848e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 2849e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 2850e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 2851e6ccafaeSMatthew G Knepley break; 2852e6ccafaeSMatthew G Knepley } 2853e6ccafaeSMatthew G Knepley } 2854e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 2855e6ccafaeSMatthew G Knepley } 2856e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 2857e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 285869291d52SBarry Smith ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), MPIU_INT, &orientedVertices);CHKERRQ(ierr); 2859e6ccafaeSMatthew G Knepley ++(*newFacePoint); 2860e6ccafaeSMatthew G Knepley } 2861ef07cca7SMatthew G. Knepley #if 0 2862e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2863ef07cca7SMatthew G. Knepley #else 286469291d52SBarry Smith ierr = DMRestoreWorkArray(subdm, 1, MPIU_INT, (void **) &faces);CHKERRQ(ierr); 2865ef07cca7SMatthew G. Knepley #endif 2866e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2867e6ccafaeSMatthew G Knepley } 2868e6ccafaeSMatthew G Knepley 286953156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2870e6ccafaeSMatthew G Knepley { 287182f516ccSBarry Smith MPI_Comm comm; 287253156dfcSMatthew G. Knepley DMLabel subpointMap; 2873efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 2874efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 2875efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 2876fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 2877efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 2878e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2879e6ccafaeSMatthew G Knepley 2880e6ccafaeSMatthew G Knepley PetscFunctionBegin; 288182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2882efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2883d67d17b1SMatthew G. Knepley ierr = DMLabelCreate(PETSC_COMM_SELF, "subpoint_map", &subpointMap);CHKERRQ(ierr); 2884efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2885efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 288653156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);} 2887efa14ee0SMatthew G Knepley /* Setup chart */ 2888efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2889efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2890efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2891efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2892e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2893e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 2894efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 2895e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 2896efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2897efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2898efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 2899efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2900e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2901e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2902e6ccafaeSMatthew G Knepley } 2903e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2904e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2905e6ccafaeSMatthew G Knepley } 2906e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2907e6ccafaeSMatthew G Knepley /* Create face cones */ 2908efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 29090298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 291069291d52SBarry Smith ierr = DMGetWorkArray(subdm, maxConeSize, MPIU_INT, (void**) &subface);CHKERRQ(ierr); 2911e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2912e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 2913efa14ee0SMatthew G Knepley const PetscInt subcell = c; 29140298fd71SBarry Smith PetscInt *closure = NULL; 2915efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 2916e6ccafaeSMatthew G Knepley 2917e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2918efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2919efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 2920e6ccafaeSMatthew G Knepley PetscInt subVertex; 2921e6ccafaeSMatthew G Knepley 2922efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 2923efa14ee0SMatthew G Knepley ++numCorners; 2924efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 2925efa14ee0SMatthew G Knepley if (subVertex >= 0) { 2926efa14ee0SMatthew G Knepley closure[faceSize] = point; 292765560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 2928e6ccafaeSMatthew G Knepley ++faceSize; 2929e6ccafaeSMatthew G Knepley } 2930e6ccafaeSMatthew G Knepley } 2931e6ccafaeSMatthew G Knepley } 2932efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 2933efa14ee0SMatthew G Knepley if (faceSize == nFV) { 2934cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 2935e6ccafaeSMatthew G Knepley } 293665560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2937e6ccafaeSMatthew G Knepley } 293869291d52SBarry Smith ierr = DMRestoreWorkArray(subdm, maxConeSize, MPIU_INT, (void**) &subface);CHKERRQ(ierr); 2939e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2940e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2941e6ccafaeSMatthew G Knepley /* Build coordinates */ 2942efa14ee0SMatthew G Knepley { 2943efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 2944efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 2945efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 2946285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 294724640c55SToby Isaac const char *name; 2948efa14ee0SMatthew G Knepley 294969d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2950e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 295169d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2952285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2953285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2954285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2955efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2956efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2957efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2958efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2959efa14ee0SMatthew G Knepley PetscInt dof; 2960efa14ee0SMatthew G Knepley 2961efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2962efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2963285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2964e6ccafaeSMatthew G Knepley } 2965e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2966e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 29678b9ced59SLisandro Dalcin ierr = VecCreate(PETSC_COMM_SELF, &subCoordinates);CHKERRQ(ierr); 296824640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 296924640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr); 2970e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 29712eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2972830e53efSMatthew G. Knepley if (coordSize) { 2973e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2974e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2975efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2976efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2977efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2978efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2979e6ccafaeSMatthew G Knepley 2980e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2981e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2982efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2983efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2984efa14ee0SMatthew 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); 2985e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2986e6ccafaeSMatthew G Knepley } 2987e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2988e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 29893b399e24SMatthew G. Knepley } 2990e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2991e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2992e6ccafaeSMatthew G Knepley } 2993efa14ee0SMatthew G Knepley /* Cleanup */ 2994efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2995efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2996efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2997efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2998e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2999e6ccafaeSMatthew G Knepley } 3000e6ccafaeSMatthew G Knepley 30013982b651SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 30023982b651SMatthew G. Knepley { 30033982b651SMatthew G. Knepley PetscInt subPoint; 30043982b651SMatthew G. Knepley PetscErrorCode ierr; 30053982b651SMatthew G. Knepley 30063982b651SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 30073982b651SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 30083982b651SMatthew G. Knepley } 30093982b651SMatthew G. Knepley 3010158acfadSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmeshGeneric_Interpolated(DM dm, DMLabel label, PetscInt value, PetscBool markedFaces, PetscBool isCohesive, PetscInt cellHeight, DM subdm) 3011e6ccafaeSMatthew G Knepley { 301282f516ccSBarry Smith MPI_Comm comm; 301353156dfcSMatthew G. Knepley DMLabel subpointMap; 3014efa14ee0SMatthew G Knepley IS *subpointIS; 3015efa14ee0SMatthew G Knepley const PetscInt **subpoints; 30163982b651SMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *orntNew; 3017412e9a14SMatthew G. Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 30180d366550SMatthew G. Knepley PetscMPIInt rank; 3019e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3020e6ccafaeSMatthew G Knepley 3021e6ccafaeSMatthew G Knepley PetscFunctionBegin; 302282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3023ffc4695bSBarry Smith ierr = MPI_Comm_rank(comm, &rank);CHKERRMPI(ierr); 3024efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 3025d67d17b1SMatthew G. Knepley ierr = DMLabelCreate(PETSC_COMM_SELF, "subpoint_map", &subpointMap);CHKERRQ(ierr); 3026efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 3027bec263e5SMatthew G. Knepley if (cellHeight) { 30283982b651SMatthew G. Knepley if (isCohesive) {ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);} 3029158acfadSMatthew G. Knepley else {ierr = DMPlexMarkSubmesh_Interpolated(dm, label, value, markedFaces, subpointMap, subdm);CHKERRQ(ierr);} 3030bec263e5SMatthew G. Knepley } else { 3031bec263e5SMatthew G. Knepley DMLabel depth; 3032bec263e5SMatthew G. Knepley IS pointIS; 3033bec263e5SMatthew G. Knepley const PetscInt *points; 3034b85c8bf9SMatthew G. Knepley PetscInt numPoints=0; 3035bec263e5SMatthew G. Knepley 3036bec263e5SMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depth);CHKERRQ(ierr); 3037bec263e5SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, value, &pointIS);CHKERRQ(ierr); 3038b85c8bf9SMatthew G. Knepley if (pointIS) { 3039bec263e5SMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 3040b85c8bf9SMatthew G. Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 3041b85c8bf9SMatthew G. Knepley } 3042bec263e5SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 3043bec263e5SMatthew G. Knepley PetscInt *closure = NULL; 3044bec263e5SMatthew G. Knepley PetscInt closureSize, c, pdim; 3045bec263e5SMatthew G. Knepley 3046bec263e5SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3047bec263e5SMatthew G. Knepley for (c = 0; c < closureSize*2; c += 2) { 3048bec263e5SMatthew G. Knepley ierr = DMLabelGetValue(depth, closure[c], &pdim);CHKERRQ(ierr); 3049bec263e5SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, closure[c], pdim);CHKERRQ(ierr); 3050bec263e5SMatthew G. Knepley } 3051bec263e5SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3052bec263e5SMatthew G. Knepley } 3053b85c8bf9SMatthew G. Knepley if (pointIS) {ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);} 3054bec263e5SMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 3055bec263e5SMatthew G. Knepley } 3056efa14ee0SMatthew G Knepley /* Setup chart */ 3057c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3058dcca6d9dSJed Brown ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr); 3059e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 3060e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 3061e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 3062e6ccafaeSMatthew G Knepley } 3063e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 3064bec263e5SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, cellHeight);CHKERRQ(ierr); 3065e6ccafaeSMatthew G Knepley /* Set cone sizes */ 3066e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 3067e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 3068e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 3069e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 3070e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 3071e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 30720ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 3073e6ccafaeSMatthew G Knepley } 3074412e9a14SMatthew G. Knepley /* We do not want this label automatically computed, instead we compute it here */ 3075412e9a14SMatthew G. Knepley ierr = DMCreateLabel(subdm, "celltype");CHKERRQ(ierr); 3076e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 3077e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 3078e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 3079e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 3080e6ccafaeSMatthew G Knepley const PetscInt *cone; 3081e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 3082412e9a14SMatthew G. Knepley DMPolytopeType ct; 3083e6ccafaeSMatthew G Knepley 3084e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 3085e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 3086412e9a14SMatthew G. Knepley ierr = DMPlexGetCellType(dm, point, &ct);CHKERRQ(ierr); 3087412e9a14SMatthew G. Knepley ierr = DMPlexSetCellType(subdm, subpoint, ct);CHKERRQ(ierr); 3088bec263e5SMatthew G. Knepley if (cellHeight && (d == dim)) { 3089e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 3090e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 3091e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 3092e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 3093e6ccafaeSMatthew G Knepley } 3094e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 3095412e9a14SMatthew G. Knepley ierr = DMPlexSetCellType(subdm, subpoint, DM_POLYTOPE_FV_GHOST);CHKERRQ(ierr); 3096e6ccafaeSMatthew G Knepley } 3097e6ccafaeSMatthew G Knepley } 3098e6ccafaeSMatthew G Knepley } 3099d67d17b1SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 3100e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 3101e6ccafaeSMatthew G Knepley /* Set cones */ 31020298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 31033982b651SMatthew G. Knepley ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&orntNew);CHKERRQ(ierr); 3104e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 3105e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 3106e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 3107e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 31080e49e2e2SMatthew G. Knepley const PetscInt *cone, *ornt; 31090d366550SMatthew G. Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc, fornt = 0; 3110e6ccafaeSMatthew G Knepley 31110d366550SMatthew G. Knepley if (d == dim-1) { 31120d366550SMatthew G. Knepley const PetscInt *support, *cone, *ornt; 31130d366550SMatthew G. Knepley PetscInt supportSize, coneSize, s, subc; 31140d366550SMatthew G. Knepley 31150d366550SMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 31160d366550SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 31170d366550SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 3118412e9a14SMatthew G. Knepley PetscBool isHybrid; 3119412e9a14SMatthew G. Knepley 3120412e9a14SMatthew G. Knepley ierr = DMPlexCellIsHybrid_Internal(dm, support[s], &isHybrid);CHKERRQ(ierr); 3121412e9a14SMatthew G. Knepley if (!isHybrid) continue; 31220d366550SMatthew G. Knepley ierr = PetscFindInt(support[s], numSubPoints[d+1], subpoints[d+1], &subc);CHKERRQ(ierr); 31230d366550SMatthew G. Knepley if (subc >= 0) { 31240d366550SMatthew G. Knepley const PetscInt ccell = subpoints[d+1][subc]; 31250d366550SMatthew G. Knepley 31267f79407eSBarry Smith ierr = DMPlexGetCone(dm, ccell, &cone);CHKERRQ(ierr); 31277f79407eSBarry Smith ierr = DMPlexGetConeSize(dm, ccell, &coneSize);CHKERRQ(ierr); 31287f79407eSBarry Smith ierr = DMPlexGetConeOrientation(dm, ccell, &ornt);CHKERRQ(ierr); 31290d366550SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 31300d366550SMatthew G. Knepley if (cone[c] == point) { 31310d366550SMatthew G. Knepley fornt = ornt[c]; 31320d366550SMatthew G. Knepley break; 31330d366550SMatthew G. Knepley } 31340d366550SMatthew G. Knepley } 31350d366550SMatthew G. Knepley break; 31360d366550SMatthew G. Knepley } 31370d366550SMatthew G. Knepley } 31380d366550SMatthew G. Knepley } 3139e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 3140e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 3141e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 31420e49e2e2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 3143e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 3144e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 314501a2673eSMatthew G. Knepley if (subc >= 0) { 314601a2673eSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 31473982b651SMatthew G. Knepley orntNew[coneSizeNew] = ornt[c]; 314801a2673eSMatthew G. Knepley ++coneSizeNew; 314901a2673eSMatthew G. Knepley } 3150e6ccafaeSMatthew G Knepley } 3151e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 31520d366550SMatthew G. Knepley if (fornt < 0) { 31530d366550SMatthew G. Knepley /* This should be replaced by a call to DMPlexReverseCell() */ 31540d366550SMatthew G. Knepley #if 0 3155a129c400SMatthew G. Knepley ierr = DMPlexReverseCell(subdm, subpoint);CHKERRQ(ierr); 3156a129c400SMatthew G. Knepley #else 3157c0b40891SMatthew G. Knepley for (c = 0; c < coneSizeNew/2 + coneSizeNew%2; ++c) { 3158a129c400SMatthew G. Knepley PetscInt faceSize, tmp; 31590d366550SMatthew G. Knepley 31600d366550SMatthew G. Knepley tmp = coneNew[c]; 31610d366550SMatthew G. Knepley coneNew[c] = coneNew[coneSizeNew-1-c]; 31620d366550SMatthew G. Knepley coneNew[coneSizeNew-1-c] = tmp; 3163a129c400SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[c], &faceSize);CHKERRQ(ierr); 3164a129c400SMatthew G. Knepley tmp = orntNew[c] >= 0 ? -(faceSize-orntNew[c]) : faceSize+orntNew[c]; 3165a129c400SMatthew G. Knepley orntNew[c] = orntNew[coneSizeNew-1-c] >= 0 ? -(faceSize-orntNew[coneSizeNew-1-c]) : faceSize+orntNew[coneSizeNew-1-c]; 31660d366550SMatthew G. Knepley orntNew[coneSizeNew-1-c] = tmp; 31670d366550SMatthew G. Knepley } 31680d366550SMatthew G. Knepley } 3169e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 31703982b651SMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, orntNew);CHKERRQ(ierr); 3171a129c400SMatthew G. Knepley #endif 3172e6ccafaeSMatthew G Knepley } 3173e6ccafaeSMatthew G Knepley } 31743982b651SMatthew G. Knepley ierr = PetscFree2(coneNew,orntNew);CHKERRQ(ierr); 3175e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 3176e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 3177e6ccafaeSMatthew G Knepley /* Build coordinates */ 3178e6ccafaeSMatthew G Knepley { 3179e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 3180e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 3181e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 3182c0e8cf5fSMatthew G. Knepley PetscInt cdim, numComp, coordSize; 318324640c55SToby Isaac const char *name; 3184e6ccafaeSMatthew G Knepley 3185c0e8cf5fSMatthew G. Knepley ierr = DMGetCoordinateDim(dm, &cdim);CHKERRQ(ierr); 318669d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3187e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 318869d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 3189285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 3190285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 3191285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 3192e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 3193e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 3194e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 3195e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 3196e6ccafaeSMatthew G Knepley PetscInt dof; 3197e6ccafaeSMatthew G Knepley 3198e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3199e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 3200285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 3201e6ccafaeSMatthew G Knepley } 3202e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 3203e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 32048b9ced59SLisandro Dalcin ierr = VecCreate(PETSC_COMM_SELF, &subCoordinates);CHKERRQ(ierr); 320524640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 320624640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr); 3207e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 3208c0e8cf5fSMatthew G. Knepley ierr = VecSetBlockSize(subCoordinates, cdim);CHKERRQ(ierr); 32092eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 3210e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 3211e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3212e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 3213e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 3214e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 3215e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 3216e6ccafaeSMatthew G Knepley 3217e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3218e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 3219e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 3220e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 3221e6ccafaeSMatthew 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); 3222efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 3223e6ccafaeSMatthew G Knepley } 3224e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3225e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3226e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 3227e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 3228e6ccafaeSMatthew G Knepley } 32293982b651SMatthew G. Knepley /* Build SF: We need this complexity because subpoints might not be selected on the owning process */ 32303982b651SMatthew G. Knepley { 32313982b651SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 32323982b651SMatthew G. Knepley IS subpIS; 32333982b651SMatthew G. Knepley const PetscSFNode *remotePoints; 32343982b651SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 32353982b651SMatthew G. Knepley const PetscInt *localPoints, *subpoints; 32363982b651SMatthew G. Knepley PetscInt *slocalPoints; 32373982b651SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubpoints = 0, numSubroots, numSubleaves = 0, l, sl, ll, pStart, pEnd, p; 32383982b651SMatthew G. Knepley PetscMPIInt rank; 32393982b651SMatthew G. Knepley 3240ffc4695bSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRMPI(ierr); 32413982b651SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 32423982b651SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 32433982b651SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 32443982b651SMatthew G. Knepley ierr = DMPlexGetChart(subdm, NULL, &numSubroots);CHKERRQ(ierr); 324597d8846cSMatthew Knepley ierr = DMPlexGetSubpointIS(subdm, &subpIS);CHKERRQ(ierr); 32463982b651SMatthew G. Knepley if (subpIS) { 32473982b651SMatthew G. Knepley ierr = ISGetIndices(subpIS, &subpoints);CHKERRQ(ierr); 32483982b651SMatthew G. Knepley ierr = ISGetLocalSize(subpIS, &numSubpoints);CHKERRQ(ierr); 32493982b651SMatthew G. Knepley } 32503982b651SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 32513982b651SMatthew G. Knepley if (numRoots >= 0) { 32523982b651SMatthew G. Knepley ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 32533982b651SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 32543982b651SMatthew G. Knepley newLocalPoints[p].rank = -2; 32553982b651SMatthew G. Knepley newLocalPoints[p].index = -2; 32563982b651SMatthew G. Knepley } 32573982b651SMatthew G. Knepley /* Set subleaves */ 32583982b651SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 32593982b651SMatthew G. Knepley const PetscInt point = localPoints[l]; 32603982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 32613982b651SMatthew G. Knepley 32623982b651SMatthew G. Knepley if (subpoint < 0) continue; 32633982b651SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 32643982b651SMatthew G. Knepley newLocalPoints[point-pStart].index = subpoint; 32653982b651SMatthew G. Knepley ++numSubleaves; 32663982b651SMatthew G. Knepley } 32673982b651SMatthew G. Knepley /* Must put in owned subpoints */ 32683982b651SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 32693982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(p, 0, numSubpoints, subpoints); 32703982b651SMatthew G. Knepley 32713982b651SMatthew G. Knepley if (subpoint < 0) { 32723982b651SMatthew G. Knepley newOwners[p-pStart].rank = -3; 32733982b651SMatthew G. Knepley newOwners[p-pStart].index = -3; 32743982b651SMatthew G. Knepley } else { 32753982b651SMatthew G. Knepley newOwners[p-pStart].rank = rank; 32763982b651SMatthew G. Knepley newOwners[p-pStart].index = subpoint; 32773982b651SMatthew G. Knepley } 32783982b651SMatthew G. Knepley } 32793982b651SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 32803982b651SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3281*ad227feaSJunchao Zhang ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints,MPI_REPLACE);CHKERRQ(ierr); 3282*ad227feaSJunchao Zhang ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints,MPI_REPLACE);CHKERRQ(ierr); 32833982b651SMatthew G. Knepley ierr = PetscMalloc1(numSubleaves, &slocalPoints);CHKERRQ(ierr); 32843982b651SMatthew G. Knepley ierr = PetscMalloc1(numSubleaves, &sremotePoints);CHKERRQ(ierr); 32853982b651SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 32863982b651SMatthew G. Knepley const PetscInt point = localPoints[l]; 32873982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 32883982b651SMatthew G. Knepley 32893982b651SMatthew G. Knepley if (subpoint < 0) continue; 32903982b651SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 32913982b651SMatthew G. Knepley slocalPoints[sl] = subpoint; 32923982b651SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 32933982b651SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 32943982b651SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 32953982b651SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 32963982b651SMatthew G. Knepley ++sl; 32973982b651SMatthew G. Knepley } 32983982b651SMatthew G. Knepley if (sl + ll != numSubleaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubleaves); 32993982b651SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 33003982b651SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubroots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 33013982b651SMatthew G. Knepley } 33023982b651SMatthew G. Knepley if (subpIS) { 33033982b651SMatthew G. Knepley ierr = ISRestoreIndices(subpIS, &subpoints);CHKERRQ(ierr); 33043982b651SMatthew G. Knepley } 33053982b651SMatthew G. Knepley } 3306efa14ee0SMatthew G Knepley /* Cleanup */ 3307e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 33080ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 3309e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 3310e6ccafaeSMatthew G Knepley } 3311efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 3312e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3313e6ccafaeSMatthew G Knepley } 3314e6ccafaeSMatthew G Knepley 3315158acfadSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, PetscBool markedFaces, DM subdm) 33163982b651SMatthew G. Knepley { 33173982b651SMatthew G. Knepley PetscErrorCode ierr; 33183982b651SMatthew G. Knepley 33193982b651SMatthew G. Knepley PetscFunctionBegin; 3320158acfadSMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, vertexLabel, value, markedFaces, PETSC_FALSE, 1, subdm);CHKERRQ(ierr); 33213982b651SMatthew G. Knepley PetscFunctionReturn(0); 33223982b651SMatthew G. Knepley } 33233982b651SMatthew G. Knepley 3324d0fa310fSMatthew G. Knepley /*@ 3325e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 3326e6ccafaeSMatthew G Knepley 3327e6ccafaeSMatthew G Knepley Input Parameters: 3328e6ccafaeSMatthew G Knepley + dm - The original mesh 3329158acfadSMatthew G. Knepley . vertexLabel - The DMLabel marking points contained in the surface 3330158acfadSMatthew G. Knepley . value - The label value to use 3331158acfadSMatthew G. Knepley - markedFaces - PETSC_TRUE if surface faces are marked in addition to vertices, PETSC_FALSE if only vertices are marked 3332e6ccafaeSMatthew G Knepley 3333e6ccafaeSMatthew G Knepley Output Parameter: 3334e6ccafaeSMatthew G Knepley . subdm - The surface mesh 3335e6ccafaeSMatthew G Knepley 3336e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3337e6ccafaeSMatthew G Knepley 3338e6ccafaeSMatthew G Knepley Level: developer 3339e6ccafaeSMatthew G Knepley 3340c58f1c22SToby Isaac .seealso: DMPlexGetSubpointMap(), DMGetLabel(), DMLabelSetValue() 3341830e53efSMatthew G. Knepley @*/ 3342158acfadSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, PetscBool markedFaces, DM *subdm) 3343e6ccafaeSMatthew G Knepley { 3344827c4036SVaclav Hapla DMPlexInterpolatedFlag interpolated; 3345827c4036SVaclav Hapla PetscInt dim, cdim; 3346e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3347e6ccafaeSMatthew G Knepley 3348e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3349e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3350766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 3351c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 335282f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 3353e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3354c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr); 3355dd2763adSMatthew G. Knepley ierr = DMGetCoordinateDim(dm, &cdim);CHKERRQ(ierr); 3356dd2763adSMatthew G. Knepley ierr = DMSetCoordinateDim(*subdm, cdim);CHKERRQ(ierr); 3357827c4036SVaclav Hapla ierr = DMPlexIsInterpolated(dm, &interpolated);CHKERRQ(ierr); 3358827c4036SVaclav Hapla if (interpolated == DMPLEX_INTERPOLATED_PARTIAL) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Not for partially interpolated meshes"); 3359827c4036SVaclav Hapla if (interpolated) { 3360158acfadSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, markedFaces, *subdm);CHKERRQ(ierr); 3361e6ccafaeSMatthew G Knepley } else { 3362830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 3363e6ccafaeSMatthew G Knepley } 3364e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3365e6ccafaeSMatthew G Knepley } 3366e6ccafaeSMatthew G Knepley 336727c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 3368766ab985SMatthew G. Knepley { 3369766ab985SMatthew G. Knepley MPI_Comm comm; 3370766ab985SMatthew G. Knepley DMLabel subpointMap; 3371766ab985SMatthew G. Knepley IS subvertexIS; 3372766ab985SMatthew G. Knepley const PetscInt *subVertices; 3373fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 3374766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 3375412e9a14SMatthew G. Knepley PetscInt c, f; 3376766ab985SMatthew G. Knepley PetscErrorCode ierr; 3377766ab985SMatthew G. Knepley 3378766ab985SMatthew G. Knepley PetscFunctionBegin; 3379766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 3380766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 3381d67d17b1SMatthew G. Knepley ierr = DMLabelCreate(PETSC_COMM_SELF, "subpoint_map", &subpointMap);CHKERRQ(ierr); 3382766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 3383766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 338427c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 3385766ab985SMatthew G. Knepley /* Setup chart */ 3386766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 3387766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 3388766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 3389766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 3390766ab985SMatthew G. Knepley /* Set cone sizes */ 3391766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 3392766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 3393766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 3394766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 3395766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 3396766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 3397766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 3398766ab985SMatthew G. Knepley } 3399766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 3400766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 3401766ab985SMatthew G. Knepley } 3402766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 3403766ab985SMatthew G. Knepley /* Create face cones */ 3404766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 340569291d52SBarry Smith ierr = DMGetWorkArray(subdm, maxConeSize, MPIU_INT, (void**) &subface);CHKERRQ(ierr); 3406766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 3407766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 3408766ab985SMatthew G. Knepley const PetscInt subcell = c; 340987feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 3410412e9a14SMatthew G. Knepley PetscBool isHybrid; 341187feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 3412766ab985SMatthew G. Knepley 3413412e9a14SMatthew G. Knepley ierr = DMPlexCellIsHybrid_Internal(dm, cell, &isHybrid);CHKERRQ(ierr); 3414412e9a14SMatthew G. Knepley if (!isHybrid) continue; 341587feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 341687feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 341787feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 341887feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 341987feddfdSMatthew G. Knepley } 342087feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 342187feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 342287feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 342327234c99SMatthew G. Knepley /* Not true in parallel 342427234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 342587feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 342687feddfdSMatthew G. Knepley PetscInt negsubcell; 3427412e9a14SMatthew G. Knepley PetscBool isHybrid; 3428766ab985SMatthew G. Knepley 3429412e9a14SMatthew G. Knepley ierr = DMPlexCellIsHybrid_Internal(dm, cells[p], &isHybrid);CHKERRQ(ierr); 3430412e9a14SMatthew G. Knepley if (isHybrid) continue; 343187feddfdSMatthew G. Knepley /* I know this is a crap search */ 343287feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 343387feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 3434766ab985SMatthew G. Knepley } 343587feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 343687feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 3437766ab985SMatthew G. Knepley } 343887feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 343987feddfdSMatthew G. Knepley ++newFacePoint; 3440766ab985SMatthew G. Knepley } 344169291d52SBarry Smith ierr = DMRestoreWorkArray(subdm, maxConeSize, MPIU_INT, (void**) &subface);CHKERRQ(ierr); 3442766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 3443766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 3444766ab985SMatthew G. Knepley /* Build coordinates */ 3445766ab985SMatthew G. Knepley { 3446766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 3447766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 3448766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 3449c0e8cf5fSMatthew G. Knepley PetscInt cdim, numComp, coordSize, v; 345024640c55SToby Isaac const char *name; 3451766ab985SMatthew G. Knepley 3452c0e8cf5fSMatthew G. Knepley ierr = DMGetCoordinateDim(dm, &cdim);CHKERRQ(ierr); 345369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3454766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 345569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 3456285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 3457285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 3458285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 3459766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 3460766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 3461766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 3462766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 3463766ab985SMatthew G. Knepley PetscInt dof; 3464766ab985SMatthew G. Knepley 3465766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3466766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 3467285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 3468766ab985SMatthew G. Knepley } 3469766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 3470766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 34718b9ced59SLisandro Dalcin ierr = VecCreate(PETSC_COMM_SELF, &subCoordinates);CHKERRQ(ierr); 347224640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 347324640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)subCoordinates,name);CHKERRQ(ierr); 3474766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 3475c0e8cf5fSMatthew G. Knepley ierr = VecSetBlockSize(subCoordinates, cdim);CHKERRQ(ierr); 34762eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 3477766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 3478766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3479766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 3480766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 3481766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 3482766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 3483766ab985SMatthew G. Knepley 3484766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3485766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 3486766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 3487766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 3488766ab985SMatthew 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); 3489766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 3490766ab985SMatthew G. Knepley } 3491766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3492766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3493766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 3494766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 3495766ab985SMatthew G. Knepley } 3496aca35d17SMatthew G. Knepley /* Build SF */ 3497aca35d17SMatthew G. Knepley CHKMEMQ; 3498aca35d17SMatthew G. Knepley { 3499aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 3500aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 3501bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 3502aca35d17SMatthew G. Knepley const PetscInt *localPoints; 3503bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 350449c26ae4SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 3505bdcf2095SMatthew G. Knepley PetscMPIInt rank; 3506aca35d17SMatthew G. Knepley 3507ffc4695bSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRMPI(ierr); 3508aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 3509aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 3510aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3511aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3512aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 3513aca35d17SMatthew G. Knepley if (numRoots >= 0) { 3514aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 3515dcca6d9dSJed Brown ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 3516bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 3517bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 3518bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 3519bdcf2095SMatthew G. Knepley } 35209e0823b2SMatthew G. Knepley /* Set subleaves */ 3521aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 3522aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 3523bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 3524aca35d17SMatthew G. Knepley 3525aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 3526bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 3527bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 3528bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 3529bdcf2095SMatthew G. Knepley ++numSubLeaves; 3530aca35d17SMatthew G. Knepley } 35319e0823b2SMatthew G. Knepley /* Must put in owned subpoints */ 35329e0823b2SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 35339e0823b2SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 35349e0823b2SMatthew G. Knepley 35359e0823b2SMatthew G. Knepley if (subPoint < 0) { 35369e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = -3; 35379e0823b2SMatthew G. Knepley newOwners[p-pStart].index = -3; 35389e0823b2SMatthew G. Knepley } else { 35399e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = rank; 35409e0823b2SMatthew G. Knepley newOwners[p-pStart].index = subPoint; 35419e0823b2SMatthew G. Knepley } 3542bdcf2095SMatthew G. Knepley } 3543bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3544bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3545*ad227feaSJunchao Zhang ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints,MPI_REPLACE);CHKERRQ(ierr); 3546*ad227feaSJunchao Zhang ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints,MPI_REPLACE);CHKERRQ(ierr); 3547785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &slocalPoints);CHKERRQ(ierr); 3548785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &sremotePoints);CHKERRQ(ierr); 354949c26ae4SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 3550bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 3551bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 3552aca35d17SMatthew G. Knepley 3553aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 355449c26ae4SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 3555aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 3556bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 3557bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 3558bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 3559bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 3560aca35d17SMatthew G. Knepley ++sl; 3561aca35d17SMatthew G. Knepley } 3562bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 356349c26ae4SMatthew G. Knepley if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 356449c26ae4SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 3565aca35d17SMatthew G. Knepley } 3566aca35d17SMatthew G. Knepley } 3567aca35d17SMatthew G. Knepley CHKMEMQ; 3568766ab985SMatthew G. Knepley /* Cleanup */ 3569766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 3570766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 3571766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 3572766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3573766ab985SMatthew G. Knepley } 3574766ab985SMatthew G. Knepley 35753982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DM subdm) 3576766ab985SMatthew G. Knepley { 35773982b651SMatthew G. Knepley DMLabel label = NULL; 3578766ab985SMatthew G. Knepley PetscErrorCode ierr; 3579766ab985SMatthew G. Knepley 3580766ab985SMatthew G. Knepley PetscFunctionBegin; 3581c58f1c22SToby Isaac if (labelname) {ierr = DMGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 3582158acfadSMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, label, value, PETSC_FALSE, PETSC_TRUE, 1, subdm);CHKERRQ(ierr); 3583766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3584766ab985SMatthew G. Knepley } 3585766ab985SMatthew G. Knepley 3586c08575a3SMatthew G. Knepley /*@C 358727c04023SMatthew 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. 3588766ab985SMatthew G. Knepley 3589766ab985SMatthew G. Knepley Input Parameters: 3590766ab985SMatthew G. Knepley + dm - The original mesh 359127c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 35927afc1a8bSJed Brown . label - A label name, or NULL 359327c04023SMatthew G. Knepley - value - A label value 3594766ab985SMatthew G. Knepley 3595766ab985SMatthew G. Knepley Output Parameter: 3596766ab985SMatthew G. Knepley . subdm - The surface mesh 3597766ab985SMatthew G. Knepley 3598766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3599766ab985SMatthew G. Knepley 3600766ab985SMatthew G. Knepley Level: developer 3601766ab985SMatthew G. Knepley 3602766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 3603c08575a3SMatthew G. Knepley @*/ 360427c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 3605766ab985SMatthew G. Knepley { 3606c0e8cf5fSMatthew G. Knepley PetscInt dim, cdim, depth; 3607766ab985SMatthew G. Knepley PetscErrorCode ierr; 3608766ab985SMatthew G. Knepley 3609766ab985SMatthew G. Knepley PetscFunctionBegin; 3610766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 361127c04023SMatthew G. Knepley PetscValidPointer(subdm, 5); 3612c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3613766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3614766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 3615766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3616c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr); 3617c0e8cf5fSMatthew G. Knepley ierr = DMGetCoordinateDim(dm, &cdim);CHKERRQ(ierr); 3618c0e8cf5fSMatthew G. Knepley ierr = DMSetCoordinateDim(*subdm, cdim);CHKERRQ(ierr); 3619766ab985SMatthew G. Knepley if (depth == dim) { 3620b3154360SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr); 3621766ab985SMatthew G. Knepley } else { 362227c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 3623e6ccafaeSMatthew G Knepley } 3624e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3625e6ccafaeSMatthew G Knepley } 3626e6ccafaeSMatthew G Knepley 3627bec263e5SMatthew G. Knepley /*@ 3628bec263e5SMatthew G. Knepley DMPlexFilter - Extract a subset of mesh cells defined by a label as a separate mesh 3629bec263e5SMatthew G. Knepley 3630bec263e5SMatthew G. Knepley Input Parameters: 3631bec263e5SMatthew G. Knepley + dm - The original mesh 3632bec263e5SMatthew G. Knepley . cellLabel - The DMLabel marking cells contained in the new mesh 3633bec263e5SMatthew G. Knepley - value - The label value to use 3634bec263e5SMatthew G. Knepley 3635bec263e5SMatthew G. Knepley Output Parameter: 3636bec263e5SMatthew G. Knepley . subdm - The new mesh 3637bec263e5SMatthew G. Knepley 3638bec263e5SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3639bec263e5SMatthew G. Knepley 3640bec263e5SMatthew G. Knepley Level: developer 3641bec263e5SMatthew G. Knepley 3642c58f1c22SToby Isaac .seealso: DMPlexGetSubpointMap(), DMGetLabel(), DMLabelSetValue() 3643bec263e5SMatthew G. Knepley @*/ 3644bec263e5SMatthew G. Knepley PetscErrorCode DMPlexFilter(DM dm, DMLabel cellLabel, PetscInt value, DM *subdm) 3645bec263e5SMatthew G. Knepley { 3646bec263e5SMatthew G. Knepley PetscInt dim; 3647bec263e5SMatthew G. Knepley PetscErrorCode ierr; 3648bec263e5SMatthew G. Knepley 3649bec263e5SMatthew G. Knepley PetscFunctionBegin; 3650bec263e5SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3651bec263e5SMatthew G. Knepley PetscValidPointer(subdm, 3); 3652bec263e5SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3653bec263e5SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject) dm), subdm);CHKERRQ(ierr); 3654bec263e5SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3655bec263e5SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim);CHKERRQ(ierr); 3656bec263e5SMatthew G. Knepley /* Extract submesh in place, could be empty on some procs, could have inconsistency if procs do not both extract a shared cell */ 3657158acfadSMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, cellLabel, value, PETSC_FALSE, PETSC_FALSE, 0, *subdm);CHKERRQ(ierr); 3658bec263e5SMatthew G. Knepley PetscFunctionReturn(0); 3659bec263e5SMatthew G. Knepley } 3660bec263e5SMatthew G. Knepley 366164beef6dSMatthew G. Knepley /*@ 366264beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 366364beef6dSMatthew G. Knepley 366464beef6dSMatthew G. Knepley Input Parameter: 366564beef6dSMatthew G. Knepley . dm - The submesh DM 366664beef6dSMatthew G. Knepley 366764beef6dSMatthew G. Knepley Output Parameter: 366864beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 366964beef6dSMatthew G. Knepley 367064beef6dSMatthew G. Knepley Level: developer 367164beef6dSMatthew G. Knepley 367297d8846cSMatthew Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointIS() 367364beef6dSMatthew G. Knepley @*/ 3674e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 3675e6ccafaeSMatthew G Knepley { 3676e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3677e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3678e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 367965663942SMatthew G. Knepley *subpointMap = ((DM_Plex*) dm->data)->subpointMap; 3680e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3681e6ccafaeSMatthew G Knepley } 3682e6ccafaeSMatthew G Knepley 3683c08575a3SMatthew G. Knepley /*@ 3684c08575a3SMatthew G. Knepley DMPlexSetSubpointMap - Sets the DMLabel with point dimension as values 3685c08575a3SMatthew G. Knepley 3686c08575a3SMatthew G. Knepley Input Parameters: 3687c08575a3SMatthew G. Knepley + dm - The submesh DM 3688c08575a3SMatthew G. Knepley - subpointMap - The DMLabel of all the points from the original mesh in this submesh 3689c08575a3SMatthew G. Knepley 3690c08575a3SMatthew G. Knepley Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() 3691c08575a3SMatthew G. Knepley 3692c08575a3SMatthew G. Knepley Level: developer 3693c08575a3SMatthew G. Knepley 369497d8846cSMatthew Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointIS() 3695c08575a3SMatthew G. Knepley @*/ 3696e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 3697e6ccafaeSMatthew G Knepley { 3698e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 3699285d324eSMatthew G. Knepley DMLabel tmp; 3700e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3701e6ccafaeSMatthew G Knepley 3702e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3703e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3704285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 3705e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 3706d67d17b1SMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->subpointMap);CHKERRQ(ierr); 3707285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 3708e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3709e6ccafaeSMatthew G Knepley } 3710e6ccafaeSMatthew G Knepley 371197d8846cSMatthew Knepley static PetscErrorCode DMPlexCreateSubpointIS_Internal(DM dm, IS *subpointIS) 371297d8846cSMatthew Knepley { 371397d8846cSMatthew Knepley DMLabel spmap; 371497d8846cSMatthew Knepley PetscInt depth, d; 371597d8846cSMatthew Knepley PetscErrorCode ierr; 371697d8846cSMatthew Knepley 371797d8846cSMatthew Knepley PetscFunctionBegin; 371897d8846cSMatthew Knepley ierr = DMPlexGetSubpointMap(dm, &spmap);CHKERRQ(ierr); 371997d8846cSMatthew Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 372097d8846cSMatthew Knepley if (spmap && depth >= 0) { 372197d8846cSMatthew Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 372297d8846cSMatthew Knepley PetscInt *points, *depths; 372397d8846cSMatthew Knepley PetscInt pStart, pEnd, p, off; 372497d8846cSMatthew Knepley 372597d8846cSMatthew Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 372697d8846cSMatthew Knepley if (pStart) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 372797d8846cSMatthew Knepley ierr = PetscMalloc1(pEnd, &points);CHKERRQ(ierr); 372897d8846cSMatthew Knepley ierr = DMGetWorkArray(dm, depth+1, MPIU_INT, &depths);CHKERRQ(ierr); 372997d8846cSMatthew Knepley depths[0] = depth; 373097d8846cSMatthew Knepley depths[1] = 0; 373197d8846cSMatthew Knepley for (d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 373297d8846cSMatthew Knepley for (d = 0, off = 0; d <= depth; ++d) { 373397d8846cSMatthew Knepley const PetscInt dep = depths[d]; 373497d8846cSMatthew Knepley PetscInt depStart, depEnd, n; 373597d8846cSMatthew Knepley 373697d8846cSMatthew Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 373797d8846cSMatthew Knepley ierr = DMLabelGetStratumSize(spmap, dep, &n);CHKERRQ(ierr); 373897d8846cSMatthew Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 373997d8846cSMatthew Knepley if (n != depEnd-depStart) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d at depth %d should be %d", n, dep, depEnd-depStart); 374097d8846cSMatthew Knepley } else { 374197d8846cSMatthew Knepley if (!n) { 374297d8846cSMatthew Knepley if (d == 0) { 374397d8846cSMatthew Knepley /* Missing cells */ 374497d8846cSMatthew Knepley for (p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 374597d8846cSMatthew Knepley } else { 374697d8846cSMatthew Knepley /* Missing faces */ 374797d8846cSMatthew Knepley for (p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 374897d8846cSMatthew Knepley } 374997d8846cSMatthew Knepley } 375097d8846cSMatthew Knepley } 375197d8846cSMatthew Knepley if (n) { 375297d8846cSMatthew Knepley IS is; 375397d8846cSMatthew Knepley const PetscInt *opoints; 375497d8846cSMatthew Knepley 375597d8846cSMatthew Knepley ierr = DMLabelGetStratumIS(spmap, dep, &is);CHKERRQ(ierr); 375697d8846cSMatthew Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 375797d8846cSMatthew Knepley for (p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 375897d8846cSMatthew Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 375997d8846cSMatthew Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 376097d8846cSMatthew Knepley } 376197d8846cSMatthew Knepley } 376297d8846cSMatthew Knepley ierr = DMRestoreWorkArray(dm, depth+1, MPIU_INT, &depths);CHKERRQ(ierr); 376397d8846cSMatthew Knepley if (off != pEnd) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 376497d8846cSMatthew Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 376597d8846cSMatthew Knepley ierr = PetscObjectStateGet((PetscObject) spmap, &mesh->subpointState);CHKERRQ(ierr); 376697d8846cSMatthew Knepley } 376797d8846cSMatthew Knepley PetscFunctionReturn(0); 376897d8846cSMatthew Knepley } 376997d8846cSMatthew Knepley 377064beef6dSMatthew G. Knepley /*@ 377197d8846cSMatthew Knepley DMPlexGetSubpointIS - Returns an IS covering the entire subdm chart with the original points as data 3772e6ccafaeSMatthew G Knepley 3773e6ccafaeSMatthew G Knepley Input Parameter: 3774e6ccafaeSMatthew G Knepley . dm - The submesh DM 3775e6ccafaeSMatthew G Knepley 3776e6ccafaeSMatthew G Knepley Output Parameter: 37770298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 3778e6ccafaeSMatthew G Knepley 37793982b651SMatthew G. Knepley Note: This IS is guaranteed to be sorted by the construction of the submesh 378064beef6dSMatthew G. Knepley 378164beef6dSMatthew G. Knepley Level: developer 378264beef6dSMatthew G. Knepley 378364beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 378464beef6dSMatthew G. Knepley @*/ 378597d8846cSMatthew Knepley PetscErrorCode DMPlexGetSubpointIS(DM dm, IS *subpointIS) 3786e6ccafaeSMatthew G Knepley { 378797d8846cSMatthew Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 378897d8846cSMatthew Knepley DMLabel spmap; 378997d8846cSMatthew Knepley PetscObjectState state; 3790e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3791e6ccafaeSMatthew G Knepley 3792e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3793e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3794e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 379597d8846cSMatthew Knepley ierr = DMPlexGetSubpointMap(dm, &spmap);CHKERRQ(ierr); 379697d8846cSMatthew Knepley ierr = PetscObjectStateGet((PetscObject) spmap, &state);CHKERRQ(ierr); 379797d8846cSMatthew Knepley if (state != mesh->subpointState || !mesh->subpointIS) {ierr = DMPlexCreateSubpointIS_Internal(dm, &mesh->subpointIS);CHKERRQ(ierr);} 379897d8846cSMatthew Knepley *subpointIS = mesh->subpointIS; 3799e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3800e6ccafaeSMatthew G Knepley } 3801559a1558SMatthew G. Knepley 3802559a1558SMatthew G. Knepley /*@ 3803a6e0b375SMatthew G. Knepley DMGetEnclosureRelation - Get the relationship between dmA and dmB 3804559a1558SMatthew G. Knepley 3805559a1558SMatthew G. Knepley Input Parameters: 3806a6e0b375SMatthew G. Knepley + dmA - The first DM 3807a6e0b375SMatthew G. Knepley - dmB - The second DM 3808559a1558SMatthew G. Knepley 3809559a1558SMatthew G. Knepley Output Parameter: 3810a6e0b375SMatthew G. Knepley . rel - The relation of dmA to dmB 3811559a1558SMatthew G. Knepley 3812a6e0b375SMatthew G. Knepley Level: intermediate 3813559a1558SMatthew G. Knepley 3814a6e0b375SMatthew G. Knepley .seealso: DMPlexGetEnclosurePoint() 3815559a1558SMatthew G. Knepley @*/ 3816a6e0b375SMatthew G. Knepley PetscErrorCode DMGetEnclosureRelation(DM dmA, DM dmB, DMEnclosureType *rel) 3817559a1558SMatthew G. Knepley { 3818a6e0b375SMatthew G. Knepley DM plexA, plexB, sdm; 3819559a1558SMatthew G. Knepley DMLabel spmap; 3820a6e0b375SMatthew G. Knepley PetscInt pStartA, pEndA, pStartB, pEndB, NpA, NpB; 3821559a1558SMatthew G. Knepley PetscErrorCode ierr; 3822559a1558SMatthew G. Knepley 382344171101SMatthew G. Knepley PetscFunctionBegin; 3824a6e0b375SMatthew G. Knepley PetscValidPointer(rel, 3); 3825a6e0b375SMatthew G. Knepley *rel = DM_ENC_NONE; 3826a6e0b375SMatthew G. Knepley if (!dmA || !dmB) PetscFunctionReturn(0); 3827a6e0b375SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 3828a6e0b375SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 1); 3829a6e0b375SMatthew G. Knepley if (dmA == dmB) {*rel = DM_ENC_EQUALITY; PetscFunctionReturn(0);} 3830a6e0b375SMatthew G. Knepley ierr = DMConvert(dmA, DMPLEX, &plexA);CHKERRQ(ierr); 3831a6e0b375SMatthew G. Knepley ierr = DMConvert(dmB, DMPLEX, &plexB);CHKERRQ(ierr); 3832a6e0b375SMatthew G. Knepley ierr = DMPlexGetChart(plexA, &pStartA, &pEndA);CHKERRQ(ierr); 3833a6e0b375SMatthew G. Knepley ierr = DMPlexGetChart(plexB, &pStartB, &pEndB);CHKERRQ(ierr); 3834a6e0b375SMatthew G. Knepley /* Assumption 1: subDMs have smaller charts than the DMs that they originate from 3835a6e0b375SMatthew G. Knepley - The degenerate case of a subdomain which includes all of the domain on some process can be treated as equality */ 3836a6e0b375SMatthew G. Knepley if ((pStartA == pStartB) && (pEndA == pEndB)) { 3837a6e0b375SMatthew G. Knepley *rel = DM_ENC_EQUALITY; 3838a6e0b375SMatthew G. Knepley goto end; 3839559a1558SMatthew G. Knepley } 3840a6e0b375SMatthew G. Knepley NpA = pEndA - pStartA; 3841a6e0b375SMatthew G. Knepley NpB = pEndB - pStartB; 3842a6e0b375SMatthew G. Knepley if (NpA == NpB) goto end; 3843a6e0b375SMatthew G. Knepley sdm = NpA > NpB ? plexB : plexA; /* The other is the original, enclosing dm */ 3844a6e0b375SMatthew G. Knepley ierr = DMPlexGetSubpointMap(sdm, &spmap);CHKERRQ(ierr); 3845a6e0b375SMatthew G. Knepley if (!spmap) goto end; 3846a6e0b375SMatthew G. Knepley /* TODO Check the space mapped to by subpointMap is same size as dm */ 3847a6e0b375SMatthew G. Knepley if (NpA > NpB) { 3848a6e0b375SMatthew G. Knepley *rel = DM_ENC_SUPERMESH; 3849a6e0b375SMatthew G. Knepley } else { 3850a6e0b375SMatthew G. Knepley *rel = DM_ENC_SUBMESH; 3851a6e0b375SMatthew G. Knepley } 3852a6e0b375SMatthew G. Knepley end: 3853a6e0b375SMatthew G. Knepley ierr = DMDestroy(&plexA);CHKERRQ(ierr); 3854a6e0b375SMatthew G. Knepley ierr = DMDestroy(&plexB);CHKERRQ(ierr); 3855559a1558SMatthew G. Knepley PetscFunctionReturn(0); 3856559a1558SMatthew G. Knepley } 385744171101SMatthew G. Knepley 385844171101SMatthew G. Knepley /*@ 3859a6e0b375SMatthew G. Knepley DMGetEnclosurePoint - Get the point pA in dmA which corresponds to the point pB in dmB 386044171101SMatthew G. Knepley 386144171101SMatthew G. Knepley Input Parameters: 3862a6e0b375SMatthew G. Knepley + dmA - The first DM 3863a6e0b375SMatthew G. Knepley . dmB - The second DM 3864a6e0b375SMatthew G. Knepley . etype - The type of enclosure relation that dmA has to dmB 3865a6e0b375SMatthew G. Knepley - pB - A point of dmB 386644171101SMatthew G. Knepley 386744171101SMatthew G. Knepley Output Parameter: 3868a6e0b375SMatthew G. Knepley . pA - The corresponding point of dmA 386944171101SMatthew G. Knepley 3870a6e0b375SMatthew G. Knepley Level: intermediate 387144171101SMatthew G. Knepley 3872a6e0b375SMatthew G. Knepley .seealso: DMGetEnclosureRelation() 387344171101SMatthew G. Knepley @*/ 3874a6e0b375SMatthew G. Knepley PetscErrorCode DMGetEnclosurePoint(DM dmA, DM dmB, DMEnclosureType etype, PetscInt pB, PetscInt *pA) 387544171101SMatthew G. Knepley { 3876a6e0b375SMatthew G. Knepley DM sdm; 3877a6e0b375SMatthew G. Knepley IS subpointIS; 3878a6e0b375SMatthew G. Knepley const PetscInt *subpoints; 3879a6e0b375SMatthew G. Knepley PetscInt numSubpoints; 388044171101SMatthew G. Knepley PetscErrorCode ierr; 388144171101SMatthew G. Knepley 388244171101SMatthew G. Knepley PetscFunctionBegin; 3883a6e0b375SMatthew G. Knepley /* TODO Cache the IS, making it look like an index */ 3884a6e0b375SMatthew G. Knepley switch (etype) { 3885a6e0b375SMatthew G. Knepley case DM_ENC_SUPERMESH: 3886a6e0b375SMatthew G. Knepley sdm = dmB; 388797d8846cSMatthew Knepley ierr = DMPlexGetSubpointIS(sdm, &subpointIS);CHKERRQ(ierr); 3888a6e0b375SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 3889a6e0b375SMatthew G. Knepley *pA = subpoints[pB]; 3890a6e0b375SMatthew G. Knepley ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr); 3891a6e0b375SMatthew G. Knepley break; 3892a6e0b375SMatthew G. Knepley case DM_ENC_SUBMESH: 3893a6e0b375SMatthew G. Knepley sdm = dmA; 389497d8846cSMatthew Knepley ierr = DMPlexGetSubpointIS(sdm, &subpointIS);CHKERRQ(ierr); 3895a6e0b375SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 3896a6e0b375SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 3897a6e0b375SMatthew G. Knepley ierr = PetscFindInt(pB, numSubpoints, subpoints, pA);CHKERRQ(ierr); 3898a6e0b375SMatthew G. Knepley if (*pA < 0) { 3899a6e0b375SMatthew G. Knepley ierr = DMViewFromOptions(dmA, NULL, "-dm_enc_A_view");CHKERRQ(ierr); 3900a6e0b375SMatthew G. Knepley ierr = DMViewFromOptions(dmB, NULL, "-dm_enc_B_view");CHKERRQ(ierr); 3901a6e0b375SMatthew G. Knepley SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Point %d not found in submesh", pB); 3902a6e0b375SMatthew G. Knepley } 3903a6e0b375SMatthew G. Knepley ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr); 3904a6e0b375SMatthew G. Knepley break; 3905a6e0b375SMatthew G. Knepley case DM_ENC_EQUALITY: 3906a6e0b375SMatthew G. Knepley case DM_ENC_NONE: 3907a6e0b375SMatthew G. Knepley *pA = pB;break; 3908a6e0b375SMatthew G. Knepley case DM_ENC_UNKNOWN: 3909a6e0b375SMatthew G. Knepley { 3910a6e0b375SMatthew G. Knepley DMEnclosureType enc; 391144171101SMatthew G. Knepley 3912a6e0b375SMatthew G. Knepley ierr = DMGetEnclosureRelation(dmA, dmB, &enc);CHKERRQ(ierr); 3913a6e0b375SMatthew G. Knepley ierr = DMGetEnclosurePoint(dmA, dmB, enc, pB, pA);CHKERRQ(ierr); 3914a6e0b375SMatthew G. Knepley } 3915a6e0b375SMatthew G. Knepley break; 3916a6e0b375SMatthew G. Knepley default: SETERRQ1(PetscObjectComm((PetscObject) dmA), PETSC_ERR_ARG_OUTOFRANGE, "Invalid enclosure type %d", (int) etype); 391744171101SMatthew G. Knepley } 391844171101SMatthew G. Knepley PetscFunctionReturn(0); 391944171101SMatthew G. Knepley } 3920