175d3a19aSMatthew G. Knepley #include <petsc-private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 275d3a19aSMatthew G. Knepley #include <petscsf.h> 375d3a19aSMatthew G. Knepley 475d3a19aSMatthew G. Knepley #undef __FUNCT__ 575d3a19aSMatthew G. Knepley #define __FUNCT__ "GetDepthStart_Private" 675d3a19aSMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode GetDepthStart_Private(PetscInt depth, PetscInt depthSize[], PetscInt *cStart, PetscInt *fStart, PetscInt *eStart, PetscInt *vStart) 775d3a19aSMatthew G. Knepley { 875d3a19aSMatthew G. Knepley PetscFunctionBegin; 975d3a19aSMatthew G. Knepley if (cStart) *cStart = 0; 1075d3a19aSMatthew G. Knepley if (vStart) *vStart = depthSize[depth]; 1175d3a19aSMatthew G. Knepley if (fStart) *fStart = depthSize[depth] + depthSize[0]; 1275d3a19aSMatthew G. Knepley if (eStart) *eStart = depthSize[depth] + depthSize[0] + depthSize[depth-1]; 1375d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 1475d3a19aSMatthew G. Knepley } 1575d3a19aSMatthew G. Knepley 1675d3a19aSMatthew G. Knepley #undef __FUNCT__ 1775d3a19aSMatthew G. Knepley #define __FUNCT__ "GetDepthEnd_Private" 1875d3a19aSMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode GetDepthEnd_Private(PetscInt depth, PetscInt depthSize[], PetscInt *cEnd, PetscInt *fEnd, PetscInt *eEnd, PetscInt *vEnd) 1975d3a19aSMatthew G. Knepley { 2075d3a19aSMatthew G. Knepley PetscFunctionBegin; 2175d3a19aSMatthew G. Knepley if (cEnd) *cEnd = depthSize[depth]; 2275d3a19aSMatthew G. Knepley if (vEnd) *vEnd = depthSize[depth] + depthSize[0]; 2375d3a19aSMatthew G. Knepley if (fEnd) *fEnd = depthSize[depth] + depthSize[0] + depthSize[depth-1]; 2475d3a19aSMatthew G. Knepley if (eEnd) *eEnd = depthSize[depth] + depthSize[0] + depthSize[depth-1] + depthSize[1]; 2575d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 2675d3a19aSMatthew G. Knepley } 2775d3a19aSMatthew G. Knepley 2875d3a19aSMatthew G. Knepley #undef __FUNCT__ 29b5da9499SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumHybridFaces_Internal" 30b5da9499SMatthew G. Knepley /* This is a stopgap since we do not currently keep track of faces for hybrid cells */ 31b5da9499SMatthew G. Knepley static PetscErrorCode DMPlexGetNumHybridFaces_Internal(DM dm, PetscInt *numHybridFaces) 32b5da9499SMatthew G. Knepley { 33b5da9499SMatthew G. Knepley PetscInt eStart, eEnd, eMax, cEnd, cMax, c, hEdges = 0; 34b5da9499SMatthew G. Knepley PetscErrorCode ierr; 35b5da9499SMatthew G. Knepley 36b5da9499SMatthew G. Knepley PetscFunctionBegin; 37b5da9499SMatthew G. Knepley *numHybridFaces = 0; 38b5da9499SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr); 39b5da9499SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 40b5da9499SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, &eMax, NULL);CHKERRQ(ierr); 41b5da9499SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 42b5da9499SMatthew G. Knepley /* Count interior edges in hybrid cells */ 43b5da9499SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 44b5da9499SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl; 45b5da9499SMatthew G. Knepley 46b5da9499SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 47b5da9499SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 48b5da9499SMatthew G. Knepley const PetscInt p = closure[cl]; 49b5da9499SMatthew G. Knepley 50b5da9499SMatthew G. Knepley if ((p >= eStart) && (p < eMax)) ++hEdges; 51b5da9499SMatthew G. Knepley } 52b5da9499SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 53b5da9499SMatthew G. Knepley } 54b5da9499SMatthew G. Knepley if (hEdges%2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Number of interior edges in hybrid cells cannot be odd: %d", hEdges); 55b5da9499SMatthew G. Knepley *numHybridFaces = hEdges/2; 56b5da9499SMatthew G. Knepley PetscFunctionReturn(0); 57b5da9499SMatthew G. Knepley } 58b5da9499SMatthew G. Knepley 59b5da9499SMatthew G. Knepley #undef __FUNCT__ 6075d3a19aSMatthew G. Knepley #define __FUNCT__ "CellRefinerGetSizes" 6175d3a19aSMatthew G. Knepley PetscErrorCode CellRefinerGetSizes(CellRefiner refiner, DM dm, PetscInt depthSize[]) 6275d3a19aSMatthew G. Knepley { 63b5da9499SMatthew G. Knepley PetscInt numHybridFaces, cStart, cEnd, cMax, vStart, vEnd, vMax, fStart, fEnd, fMax, eStart, eEnd, eMax; 6475d3a19aSMatthew G. Knepley PetscErrorCode ierr; 6575d3a19aSMatthew G. Knepley 6675d3a19aSMatthew G. Knepley PetscFunctionBegin; 6775d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 6875d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr); 6975d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 7075d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 7175d3a19aSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, &fMax, &eMax, &vMax);CHKERRQ(ierr); 7275d3a19aSMatthew G. Knepley switch (refiner) { 7375d3a19aSMatthew G. Knepley case 1: 7475d3a19aSMatthew G. Knepley /* Simplicial 2D */ 7575d3a19aSMatthew G. Knepley depthSize[0] = vEnd - vStart + fEnd - fStart; /* Add a vertex on every face */ 7675d3a19aSMatthew G. Knepley depthSize[1] = 2*(fEnd - fStart) + 3*(cEnd - cStart); /* Every face is split into 2 faces and 3 faces are added for each cell */ 7775d3a19aSMatthew G. Knepley depthSize[2] = 4*(cEnd - cStart); /* Every cell split into 4 cells */ 7875d3a19aSMatthew G. Knepley break; 7975d3a19aSMatthew G. Knepley case 3: 80d963de37SMatthew G. Knepley /* Hybrid Simplicial 2D */ 8175d3a19aSMatthew G. Knepley if (cMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No cell maximum specified in hybrid mesh"); 8275d3a19aSMatthew G. Knepley cMax = PetscMin(cEnd, cMax); 8375d3a19aSMatthew G. Knepley if (fMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No face maximum specified in hybrid mesh"); 8475d3a19aSMatthew G. Knepley fMax = PetscMin(fEnd, fMax); 8575d3a19aSMatthew G. Knepley depthSize[0] = vEnd - vStart + fMax - fStart; /* Add a vertex on every face, but not hybrid faces */ 8675d3a19aSMatthew G. Knepley depthSize[1] = 2*(fMax - fStart) + 3*(cMax - cStart) + (fEnd - fMax) + (cEnd - cMax); /* Every interior face is split into 2 faces, 3 faces are added for each interior cell, and one in each hybrid cell */ 8775d3a19aSMatthew G. Knepley depthSize[2] = 4*(cMax - cStart) + 2*(cEnd - cMax); /* Interior cells split into 4 cells, Hybrid cells split into 2 cells */ 8875d3a19aSMatthew G. Knepley break; 8975d3a19aSMatthew G. Knepley case 2: 9075d3a19aSMatthew G. Knepley /* Hex 2D */ 9175d3a19aSMatthew G. Knepley depthSize[0] = vEnd - vStart + cEnd - cStart + fEnd - fStart; /* Add a vertex on every face and cell */ 9275d3a19aSMatthew G. Knepley depthSize[1] = 2*(fEnd - fStart) + 4*(cEnd - cStart); /* Every face is split into 2 faces and 4 faces are added for each cell */ 9375d3a19aSMatthew G. Knepley depthSize[2] = 4*(cEnd - cStart); /* Every cell split into 4 cells */ 9475d3a19aSMatthew G. Knepley break; 95b5da9499SMatthew G. Knepley case 5: 96b5da9499SMatthew G. Knepley /* Simplicial 3D */ 97b5da9499SMatthew G. Knepley depthSize[0] = vEnd - vStart + eEnd - eStart; /* Add a vertex on every edge */ 98b5da9499SMatthew G. Knepley depthSize[1] = 2*(eEnd - eStart) + 3*(fEnd - fStart) + (cEnd - cStart); /* Every edge is split into 2 edges, 3 edges are added for each face, and 1 edge for each cell */ 99b5da9499SMatthew G. Knepley depthSize[2] = 4*(fEnd - fStart) + 8*(cEnd - cStart); /* Every face split into 4 faces and 8 faces are added for each cell */ 100b5da9499SMatthew G. Knepley depthSize[3] = 8*(cEnd - cStart); /* Every cell split into 8 cells */ 101b5da9499SMatthew G. Knepley break; 1022eabf88fSMatthew G. Knepley case 6: 1032eabf88fSMatthew G. Knepley /* Hex 3D */ 1042eabf88fSMatthew G. Knepley depthSize[0] = vEnd - vStart + eEnd - eStart + fEnd - fStart + cEnd - cStart; /* Add a vertex on every edge, face and cell */ 1052eabf88fSMatthew G. Knepley depthSize[1] = 2*(eEnd - eStart) + 4*(fEnd - fStart) + 6*(cEnd - cStart); /* Every edge is split into 2 edge, 4 edges are added for each face, and 6 edges for each cell */ 1062eabf88fSMatthew G. Knepley depthSize[2] = 4*(fEnd - fStart) + 12*(cEnd - cStart); /* Every face is split into 4 faces, and 12 faces are added for each cell */ 1072eabf88fSMatthew G. Knepley depthSize[3] = 8*(cEnd - cStart); /* Every cell split into 8 cells */ 1082eabf88fSMatthew G. Knepley break; 109b5da9499SMatthew G. Knepley case 7: 110b5da9499SMatthew G. Knepley /* Hybrid Simplicial 3D */ 111b5da9499SMatthew G. Knepley ierr = DMPlexGetNumHybridFaces_Internal(dm, &numHybridFaces);CHKERRQ(ierr); 112b5da9499SMatthew G. Knepley if (cMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No cell maximum specified in hybrid mesh"); 113b5da9499SMatthew G. Knepley cMax = PetscMin(cEnd, cMax); 114b5da9499SMatthew G. Knepley if (eMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No edge maximum specified in hybrid mesh"); 115b5da9499SMatthew G. Knepley eMax = PetscMin(eEnd, eMax); 116b5da9499SMatthew G. Knepley depthSize[0] = vEnd - vStart + eMax - eStart; /* Add a vertex on every edge, but not hybrid edges */ 117b5da9499SMatthew G. Knepley depthSize[1] = 2*(eMax - eStart) + 13*(cMax - cStart) + (eEnd - eMax) + numHybridFaces; /* Every interior edge is split into 2 edges and 13 edges are added for each interior cell, each hybrid edge stays intact, and one new hybrid edge for each two interior edges (hybrid face) on a hybrid cell */ 118b5da9499SMatthew G. Knepley depthSize[2] = 4*(fEnd - fStart) + 8*(cEnd - cStart); /* Every face split into 4 faces and 8 faces are added for each cell */ 119b5da9499SMatthew G. Knepley depthSize[3] = 8*(cMax - cStart) + 4*(cEnd - cMax); /* Every interior cell split into 8 cells, and every hybrid cell split into 4 cells */ 120b5da9499SMatthew G. Knepley break; 12175d3a19aSMatthew G. Knepley default: 12275d3a19aSMatthew G. Knepley SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Unknown cell refiner %d", refiner); 12375d3a19aSMatthew G. Knepley } 12475d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 12575d3a19aSMatthew G. Knepley } 12675d3a19aSMatthew G. Knepley 12742525629SMatthew G. Knepley /* Return triangle edge for orientation o, if it is r for o == 0 */ 12842525629SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt GetTriEdge_Static(PetscInt o, PetscInt r) { 129518a8359SMatthew G. Knepley return (o < 0 ? 2-(o+r) : o+r)%3; 130518a8359SMatthew G. Knepley } 131518a8359SMatthew G. Knepley 132518a8359SMatthew G. Knepley /* Return triangle subface for orientation o, if it is r for o == 0 */ 133518a8359SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt GetTriSubface_Static(PetscInt o, PetscInt r) { 134518a8359SMatthew G. Knepley return (o < 0 ? 0-(o+r) : o+r)%3; 13542525629SMatthew G. Knepley } 13642525629SMatthew G. Knepley 13742525629SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt GetRefHexFace_Static(PetscInt o, PetscInt r) { 13842525629SMatthew G. Knepley return (o < 0 ? (-(o+1)+4-r)%4 : (o+r)%4); 13942525629SMatthew G. Knepley } 14042525629SMatthew G. Knepley 14175d3a19aSMatthew G. Knepley #undef __FUNCT__ 14275d3a19aSMatthew G. Knepley #define __FUNCT__ "CellRefinerSetConeSizes" 14375d3a19aSMatthew G. Knepley PetscErrorCode CellRefinerSetConeSizes(CellRefiner refiner, DM dm, PetscInt depthSize[], DM rdm) 14475d3a19aSMatthew G. Knepley { 145b5da9499SMatthew G. Knepley PetscInt depth, cStart, cStartNew, cEnd, cMax, c, vStart, vStartNew, vEnd, vMax, v, fStart, fStartNew, fEnd, fMax, f, eStart, eStartNew, eEnd, eMax, e, r; 14675d3a19aSMatthew G. Knepley PetscErrorCode ierr; 14775d3a19aSMatthew G. Knepley 14875d3a19aSMatthew G. Knepley PetscFunctionBegin; 14975d3a19aSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 15075d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 15175d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr); 15275d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 15375d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 15475d3a19aSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, &fMax, &eMax, &vMax);CHKERRQ(ierr); 15575d3a19aSMatthew G. Knepley ierr = GetDepthStart_Private(depth, depthSize, &cStartNew, &fStartNew, &eStartNew, &vStartNew);CHKERRQ(ierr); 15675d3a19aSMatthew G. Knepley switch (refiner) { 15775d3a19aSMatthew G. Knepley case 1: 15875d3a19aSMatthew G. Knepley /* Simplicial 2D */ 15975d3a19aSMatthew G. Knepley /* All cells have 3 faces */ 16075d3a19aSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 16175d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 16275d3a19aSMatthew G. Knepley const PetscInt newp = (c - cStart)*4 + r; 16375d3a19aSMatthew G. Knepley 16475d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 3);CHKERRQ(ierr); 16575d3a19aSMatthew G. Knepley } 16675d3a19aSMatthew G. Knepley } 16775d3a19aSMatthew G. Knepley /* Split faces have 2 vertices and the same cells as the parent */ 16875d3a19aSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 16975d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 17075d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*2 + r; 17175d3a19aSMatthew G. Knepley PetscInt size; 17275d3a19aSMatthew G. Knepley 17375d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 17475d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 17575d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 17675d3a19aSMatthew G. Knepley } 17775d3a19aSMatthew G. Knepley } 17875d3a19aSMatthew G. Knepley /* Interior faces have 2 vertices and 2 cells */ 17975d3a19aSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 18075d3a19aSMatthew G. Knepley for (r = 0; r < 3; ++r) { 18175d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (fEnd - fStart)*2 + (c - cStart)*3 + r; 18275d3a19aSMatthew G. Knepley 18375d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 18475d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2);CHKERRQ(ierr); 18575d3a19aSMatthew G. Knepley } 18675d3a19aSMatthew G. Knepley } 18775d3a19aSMatthew G. Knepley /* Old vertices have identical supports */ 18875d3a19aSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 18975d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 19075d3a19aSMatthew G. Knepley PetscInt size; 19175d3a19aSMatthew G. Knepley 19275d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 19375d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 19475d3a19aSMatthew G. Knepley } 19575d3a19aSMatthew G. Knepley /* Face vertices have 2 + cells*2 supports */ 19675d3a19aSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 19775d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (f - fStart); 19875d3a19aSMatthew G. Knepley PetscInt size; 19975d3a19aSMatthew G. Knepley 20075d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 20175d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2 + size*2);CHKERRQ(ierr); 20275d3a19aSMatthew G. Knepley } 20375d3a19aSMatthew G. Knepley break; 20475d3a19aSMatthew G. Knepley case 2: 20575d3a19aSMatthew G. Knepley /* Hex 2D */ 20675d3a19aSMatthew G. Knepley /* All cells have 4 faces */ 20775d3a19aSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 20875d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 20975d3a19aSMatthew G. Knepley const PetscInt newp = (c - cStart)*4 + r; 21075d3a19aSMatthew G. Knepley 21175d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 4);CHKERRQ(ierr); 21275d3a19aSMatthew G. Knepley } 21375d3a19aSMatthew G. Knepley } 21475d3a19aSMatthew G. Knepley /* Split faces have 2 vertices and the same cells as the parent */ 21575d3a19aSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 21675d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 21775d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*2 + r; 21875d3a19aSMatthew G. Knepley PetscInt size; 21975d3a19aSMatthew G. Knepley 22075d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 22175d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 22275d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 22375d3a19aSMatthew G. Knepley } 22475d3a19aSMatthew G. Knepley } 22575d3a19aSMatthew G. Knepley /* Interior faces have 2 vertices and 2 cells */ 22675d3a19aSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 22775d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 22875d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + r; 22975d3a19aSMatthew G. Knepley 23075d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 23175d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2);CHKERRQ(ierr); 23275d3a19aSMatthew G. Knepley } 23375d3a19aSMatthew G. Knepley } 23475d3a19aSMatthew G. Knepley /* Old vertices have identical supports */ 23575d3a19aSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 23675d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 23775d3a19aSMatthew G. Knepley PetscInt size; 23875d3a19aSMatthew G. Knepley 23975d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 24075d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 24175d3a19aSMatthew G. Knepley } 24275d3a19aSMatthew G. Knepley /* Face vertices have 2 + cells supports */ 24375d3a19aSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 24475d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (f - fStart); 24575d3a19aSMatthew G. Knepley PetscInt size; 24675d3a19aSMatthew G. Knepley 24775d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 24875d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2 + size);CHKERRQ(ierr); 24975d3a19aSMatthew G. Knepley } 25075d3a19aSMatthew G. Knepley /* Cell vertices have 4 supports */ 25175d3a19aSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 25275d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (fEnd - fStart) + (c - cStart); 25375d3a19aSMatthew G. Knepley 25475d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 4);CHKERRQ(ierr); 25575d3a19aSMatthew G. Knepley } 25675d3a19aSMatthew G. Knepley break; 25775d3a19aSMatthew G. Knepley case 3: 258d963de37SMatthew G. Knepley /* Hybrid Simplicial 2D */ 25975d3a19aSMatthew G. Knepley if (cMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No cell maximum specified in hybrid mesh"); 26075d3a19aSMatthew G. Knepley cMax = PetscMin(cEnd, cMax); 26175d3a19aSMatthew G. Knepley if (fMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No face maximum specified in hybrid mesh"); 26275d3a19aSMatthew G. Knepley fMax = PetscMin(fEnd, fMax); 26375d3a19aSMatthew G. Knepley ierr = DMPlexSetHybridBounds(rdm, cStartNew + (cMax - cStart)*4, fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 26475d3a19aSMatthew G. Knepley /* Interior cells have 3 faces */ 26575d3a19aSMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 26675d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 26775d3a19aSMatthew G. Knepley const PetscInt newp = cStartNew + (c - cStart)*4 + r; 26875d3a19aSMatthew G. Knepley 26975d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 3);CHKERRQ(ierr); 27075d3a19aSMatthew G. Knepley } 27175d3a19aSMatthew G. Knepley } 27275d3a19aSMatthew G. Knepley /* Hybrid cells have 4 faces */ 27375d3a19aSMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 27475d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 27575d3a19aSMatthew G. Knepley const PetscInt newp = cStartNew + (cMax - cStart)*4 + (c - cMax)*2 + r; 27675d3a19aSMatthew G. Knepley 27775d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 4);CHKERRQ(ierr); 27875d3a19aSMatthew G. Knepley } 27975d3a19aSMatthew G. Knepley } 28075d3a19aSMatthew G. Knepley /* Interior split faces have 2 vertices and the same cells as the parent */ 28175d3a19aSMatthew G. Knepley for (f = fStart; f < fMax; ++f) { 28275d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 28375d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*2 + r; 28475d3a19aSMatthew G. Knepley PetscInt size; 28575d3a19aSMatthew G. Knepley 28675d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 28775d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 28875d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 28975d3a19aSMatthew G. Knepley } 29075d3a19aSMatthew G. Knepley } 29175d3a19aSMatthew G. Knepley /* Interior cell faces have 2 vertices and 2 cells */ 29275d3a19aSMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 29375d3a19aSMatthew G. Knepley for (r = 0; r < 3; ++r) { 29475d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (fMax - fStart)*2 + (c - cStart)*3 + r; 29575d3a19aSMatthew G. Knepley 29675d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 29775d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2);CHKERRQ(ierr); 29875d3a19aSMatthew G. Knepley } 29975d3a19aSMatthew G. Knepley } 30075d3a19aSMatthew G. Knepley /* Hybrid faces have 2 vertices and the same cells */ 30175d3a19aSMatthew G. Knepley for (f = fMax; f < fEnd; ++f) { 30275d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (f - fMax); 30375d3a19aSMatthew G. Knepley PetscInt size; 30475d3a19aSMatthew G. Knepley 30575d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 30675d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 30775d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 30875d3a19aSMatthew G. Knepley } 30975d3a19aSMatthew G. Knepley /* Hybrid cell faces have 2 vertices and 2 cells */ 31075d3a19aSMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 31175d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (fEnd - fMax) + (c - cMax); 31275d3a19aSMatthew G. Knepley 31375d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 31475d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2);CHKERRQ(ierr); 31575d3a19aSMatthew G. Knepley } 31675d3a19aSMatthew G. Knepley /* Old vertices have identical supports */ 31775d3a19aSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 31875d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 31975d3a19aSMatthew G. Knepley PetscInt size; 32075d3a19aSMatthew G. Knepley 32175d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 32275d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 32375d3a19aSMatthew G. Knepley } 32475d3a19aSMatthew G. Knepley /* Face vertices have 2 + (2 interior, 1 hybrid) supports */ 32575d3a19aSMatthew G. Knepley for (f = fStart; f < fMax; ++f) { 32675d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (f - fStart); 32775d3a19aSMatthew G. Knepley const PetscInt *support; 32875d3a19aSMatthew G. Knepley PetscInt size, newSize = 2, s; 32975d3a19aSMatthew G. Knepley 33075d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 33175d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 33275d3a19aSMatthew G. Knepley for (s = 0; s < size; ++s) { 33375d3a19aSMatthew G. Knepley if (support[s] >= cMax) newSize += 1; 33475d3a19aSMatthew G. Knepley else newSize += 2; 33575d3a19aSMatthew G. Knepley } 33675d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, newSize);CHKERRQ(ierr); 33775d3a19aSMatthew G. Knepley } 33875d3a19aSMatthew G. Knepley break; 339b5da9499SMatthew G. Knepley case 5: 340b5da9499SMatthew G. Knepley /* Simplicial 3D */ 341b5da9499SMatthew G. Knepley /* All cells have 4 faces */ 342b5da9499SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 343b5da9499SMatthew G. Knepley for (r = 0; r < 8; ++r) { 344b5da9499SMatthew G. Knepley const PetscInt newp = (c - cStart)*8 + r; 345b5da9499SMatthew G. Knepley 346b5da9499SMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 4);CHKERRQ(ierr); 347b5da9499SMatthew G. Knepley } 348b5da9499SMatthew G. Knepley } 349b5da9499SMatthew G. Knepley /* Split faces have 3 edges and the same cells as the parent */ 350b5da9499SMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 351b5da9499SMatthew G. Knepley for (r = 0; r < 4; ++r) { 352b5da9499SMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*4 + r; 353b5da9499SMatthew G. Knepley PetscInt size; 354b5da9499SMatthew G. Knepley 355b5da9499SMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 3);CHKERRQ(ierr); 356b5da9499SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 357b5da9499SMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 358b5da9499SMatthew G. Knepley } 359b5da9499SMatthew G. Knepley } 360b5da9499SMatthew G. Knepley /* Interior faces have 3 edges and 2 cells */ 361b5da9499SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 362b5da9499SMatthew G. Knepley for (r = 0; r < 8; ++r) { 363b5da9499SMatthew G. Knepley const PetscInt newp = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + r; 364b5da9499SMatthew G. Knepley 365b5da9499SMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 3);CHKERRQ(ierr); 366b5da9499SMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2);CHKERRQ(ierr); 367b5da9499SMatthew G. Knepley } 368b5da9499SMatthew G. Knepley } 369b5da9499SMatthew G. Knepley /* Split edges have 2 vertices and the same faces */ 370b5da9499SMatthew G. Knepley for (e = eStart; e < eEnd; ++e) { 371b5da9499SMatthew G. Knepley for (r = 0; r < 2; ++r) { 372b5da9499SMatthew G. Knepley const PetscInt newp = eStartNew + (e - eStart)*2 + r; 373b5da9499SMatthew G. Knepley PetscInt size; 374b5da9499SMatthew G. Knepley 375b5da9499SMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 376b5da9499SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &size);CHKERRQ(ierr); 377b5da9499SMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 378b5da9499SMatthew G. Knepley } 379b5da9499SMatthew G. Knepley } 380b5da9499SMatthew G. Knepley /* Face edges have 2 vertices and 2+cells*(1/2) faces */ 381b5da9499SMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 382b5da9499SMatthew G. Knepley for (r = 0; r < 3; ++r) { 383b5da9499SMatthew G. Knepley const PetscInt newp = eStartNew + (eEnd - eStart)*2 + (f - fStart)*3 + r; 384b5da9499SMatthew G. Knepley const PetscInt *cone, *ornt, *support, eint[4] = {1, 0, 2, 0}; 385b5da9499SMatthew G. Knepley PetscInt coneSize, c, supportSize, s, er, intFaces = 0; 386b5da9499SMatthew G. Knepley 387b5da9499SMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 388b5da9499SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 389b5da9499SMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 390b5da9499SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 391b5da9499SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 392b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 393b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 394b5da9499SMatthew G. Knepley for (c = 0; c < coneSize; ++c) {if (cone[c] == f) break;} 39586f0afeeSMatthew G. Knepley /* Here we want to determine whether edge newp contains a vertex which is part of the cross-tet edge */ 39686f0afeeSMatthew G. Knepley er = ornt[c] < 0 ? (-(ornt[c]+1) + 2-r)%3 : (ornt[c] + r)%3; 397b5da9499SMatthew G. Knepley if (er == eint[c]) { 398b5da9499SMatthew G. Knepley intFaces += 1; 399b5da9499SMatthew G. Knepley } else { 400b5da9499SMatthew G. Knepley intFaces += 2; 401b5da9499SMatthew G. Knepley } 402b5da9499SMatthew G. Knepley } 403b5da9499SMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2+intFaces);CHKERRQ(ierr); 404b5da9499SMatthew G. Knepley } 405b5da9499SMatthew G. Knepley } 406b5da9499SMatthew G. Knepley /* Interior edges have 2 vertices and 4 faces */ 407b5da9499SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 408b5da9499SMatthew G. Knepley const PetscInt newp = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*3 + (c - cStart); 409b5da9499SMatthew G. Knepley 410b5da9499SMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 411b5da9499SMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 4);CHKERRQ(ierr); 412b5da9499SMatthew G. Knepley } 413b5da9499SMatthew G. Knepley /* Old vertices have identical supports */ 414b5da9499SMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 415b5da9499SMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 416b5da9499SMatthew G. Knepley PetscInt size; 417b5da9499SMatthew G. Knepley 418b5da9499SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 419b5da9499SMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 420b5da9499SMatthew G. Knepley } 421b5da9499SMatthew G. Knepley /* Edge vertices have 2 + faces*2 + cells*0/1 supports */ 422b5da9499SMatthew G. Knepley for (e = eStart; e < eEnd; ++e) { 423b5da9499SMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (e - eStart); 424b5da9499SMatthew G. Knepley PetscInt size, *star = NULL, starSize, s, cellSize = 0; 425b5da9499SMatthew G. Knepley 426b5da9499SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &size);CHKERRQ(ierr); 427b5da9499SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, e, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 428b5da9499SMatthew G. Knepley for (s = 0; s < starSize*2; s += 2) { 429b5da9499SMatthew G. Knepley const PetscInt *cone, *ornt; 430b5da9499SMatthew G. Knepley PetscInt e01, e23; 431b5da9499SMatthew G. Knepley 432b5da9499SMatthew G. Knepley if ((star[s] >= cStart) && (star[s] < cEnd)) { 433b5da9499SMatthew G. Knepley /* Check edge 0-1 */ 434b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, star[s], &cone);CHKERRQ(ierr); 435b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, star[s], &ornt);CHKERRQ(ierr); 436b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[0], &cone);CHKERRQ(ierr); 43742525629SMatthew G. Knepley e01 = cone[GetTriEdge_Static(ornt[0], 0)]; 438b5da9499SMatthew G. Knepley /* Check edge 2-3 */ 439b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, star[s], &cone);CHKERRQ(ierr); 440b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, star[s], &ornt);CHKERRQ(ierr); 44142525629SMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[2], &cone);CHKERRQ(ierr); 44242525629SMatthew G. Knepley e23 = cone[GetTriEdge_Static(ornt[2], 1)]; 443b5da9499SMatthew G. Knepley if ((e01 == e) || (e23 == e)) ++cellSize; 444b5da9499SMatthew G. Knepley } 445b5da9499SMatthew G. Knepley } 446b5da9499SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, e, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 447b5da9499SMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2 + size*2 + cellSize);CHKERRQ(ierr); 448b5da9499SMatthew G. Knepley } 449b5da9499SMatthew G. Knepley break; 4502eabf88fSMatthew G. Knepley case 6: 4512eabf88fSMatthew G. Knepley /* Hex 3D */ 4522eabf88fSMatthew G. Knepley /* All cells have 6 faces */ 4532eabf88fSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 4542eabf88fSMatthew G. Knepley for (r = 0; r < 8; ++r) { 4552eabf88fSMatthew G. Knepley const PetscInt newp = (c - cStart)*8 + r; 4562eabf88fSMatthew G. Knepley 4572eabf88fSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 6);CHKERRQ(ierr); 4582eabf88fSMatthew G. Knepley } 4592eabf88fSMatthew G. Knepley } 4602eabf88fSMatthew G. Knepley /* Split faces have 4 edges and the same cells as the parent */ 4612eabf88fSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 4622eabf88fSMatthew G. Knepley for (r = 0; r < 4; ++r) { 4632eabf88fSMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*4 + r; 4642eabf88fSMatthew G. Knepley PetscInt size; 4652eabf88fSMatthew G. Knepley 4662eabf88fSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 4);CHKERRQ(ierr); 4672eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 4682eabf88fSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 4692eabf88fSMatthew G. Knepley } 4702eabf88fSMatthew G. Knepley } 4712eabf88fSMatthew G. Knepley /* Interior faces have 4 edges and 2 cells */ 4722eabf88fSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 4732eabf88fSMatthew G. Knepley for (r = 0; r < 12; ++r) { 4742eabf88fSMatthew G. Knepley const PetscInt newp = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + r; 4752eabf88fSMatthew G. Knepley 4762eabf88fSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 4);CHKERRQ(ierr); 4772eabf88fSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2);CHKERRQ(ierr); 4782eabf88fSMatthew G. Knepley } 4792eabf88fSMatthew G. Knepley } 4802eabf88fSMatthew G. Knepley /* Split edges have 2 vertices and the same faces as the parent */ 4812eabf88fSMatthew G. Knepley for (e = eStart; e < eEnd; ++e) { 4822eabf88fSMatthew G. Knepley for (r = 0; r < 2; ++r) { 4832eabf88fSMatthew G. Knepley const PetscInt newp = eStartNew + (e - eStart)*2 + r; 4842eabf88fSMatthew G. Knepley PetscInt size; 4852eabf88fSMatthew G. Knepley 4862eabf88fSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 4872eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &size);CHKERRQ(ierr); 4882eabf88fSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 4892eabf88fSMatthew G. Knepley } 4902eabf88fSMatthew G. Knepley } 4912eabf88fSMatthew G. Knepley /* Face edges have 2 vertices and 2+cells faces */ 4922eabf88fSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 4932eabf88fSMatthew G. Knepley for (r = 0; r < 4; ++r) { 4942eabf88fSMatthew G. Knepley const PetscInt newp = eStartNew + (eEnd - eStart)*2 + (f - fStart)*4 + r; 4952eabf88fSMatthew G. Knepley PetscInt size; 4962eabf88fSMatthew G. Knepley 4972eabf88fSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 4982eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 4992eabf88fSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2+size);CHKERRQ(ierr); 5002eabf88fSMatthew G. Knepley } 5012eabf88fSMatthew G. Knepley } 5022eabf88fSMatthew G. Knepley /* Cell edges have 2 vertices and 4 faces */ 5032eabf88fSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 5042eabf88fSMatthew G. Knepley for (r = 0; r < 6; ++r) { 5052eabf88fSMatthew G. Knepley const PetscInt newp = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + r; 5062eabf88fSMatthew G. Knepley 5072eabf88fSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 5082eabf88fSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 4);CHKERRQ(ierr); 5092eabf88fSMatthew G. Knepley } 5102eabf88fSMatthew G. Knepley } 5112eabf88fSMatthew G. Knepley /* Old vertices have identical supports */ 5122eabf88fSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 5132eabf88fSMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 5142eabf88fSMatthew G. Knepley PetscInt size; 5152eabf88fSMatthew G. Knepley 5162eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 5172eabf88fSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 5182eabf88fSMatthew G. Knepley } 5192eabf88fSMatthew G. Knepley /* Edge vertices have 2 + faces supports */ 5202eabf88fSMatthew G. Knepley for (e = eStart; e < eEnd; ++e) { 5212eabf88fSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (e - eStart); 5222eabf88fSMatthew G. Knepley PetscInt size; 5232eabf88fSMatthew G. Knepley 5242eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &size);CHKERRQ(ierr); 5252eabf88fSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2 + size);CHKERRQ(ierr); 5262eabf88fSMatthew G. Knepley } 5272eabf88fSMatthew G. Knepley /* Face vertices have 4 + cells supports */ 5282eabf88fSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 5292eabf88fSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (f - fStart); 5302eabf88fSMatthew G. Knepley PetscInt size; 5312eabf88fSMatthew G. Knepley 5322eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 5332eabf88fSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 4 + size);CHKERRQ(ierr); 5342eabf88fSMatthew G. Knepley } 5352eabf88fSMatthew G. Knepley /* Cell vertices have 6 supports */ 5362eabf88fSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 5372eabf88fSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (fEnd - fStart) + (c - cStart); 5382eabf88fSMatthew G. Knepley 5392eabf88fSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 6);CHKERRQ(ierr); 5402eabf88fSMatthew G. Knepley } 5412eabf88fSMatthew G. Knepley break; 54275d3a19aSMatthew G. Knepley default: 54375d3a19aSMatthew G. Knepley SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Unknown cell refiner %d", refiner); 54475d3a19aSMatthew G. Knepley } 54575d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 54675d3a19aSMatthew G. Knepley } 54775d3a19aSMatthew G. Knepley 54875d3a19aSMatthew G. Knepley #undef __FUNCT__ 54975d3a19aSMatthew G. Knepley #define __FUNCT__ "CellRefinerSetCones" 55075d3a19aSMatthew G. Knepley PetscErrorCode CellRefinerSetCones(CellRefiner refiner, DM dm, PetscInt depthSize[], DM rdm) 55175d3a19aSMatthew G. Knepley { 552b5da9499SMatthew G. Knepley const PetscInt *faces, cellInd[4] = {0, 1, 2, 3}; 553b5da9499SMatthew G. Knepley PetscInt depth, cStart, cEnd, cMax, cStartNew, cEndNew, c, vStart, vEnd, vMax, vStartNew, vEndNew, v, fStart, fEnd, fMax, fStartNew, fEndNew, f, eStart, eEnd, eMax, eStartNew, eEndNew, e, r, p; 55475d3a19aSMatthew G. Knepley PetscInt maxSupportSize, *supportRef; 55575d3a19aSMatthew G. Knepley PetscErrorCode ierr; 55675d3a19aSMatthew G. Knepley 55775d3a19aSMatthew G. Knepley PetscFunctionBegin; 55875d3a19aSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 55975d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 56075d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr); 56175d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 56275d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 56375d3a19aSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, &fMax, &eMax, &vMax);CHKERRQ(ierr); 56475d3a19aSMatthew G. Knepley ierr = GetDepthStart_Private(depth, depthSize, &cStartNew, &fStartNew, &eStartNew, &vStartNew);CHKERRQ(ierr); 56575d3a19aSMatthew G. Knepley ierr = GetDepthEnd_Private(depth, depthSize, &cEndNew, &fEndNew, &eEndNew, &vEndNew);CHKERRQ(ierr); 56675d3a19aSMatthew G. Knepley switch (refiner) { 56775d3a19aSMatthew G. Knepley case 1: 56875d3a19aSMatthew G. Knepley /* Simplicial 2D */ 56975d3a19aSMatthew G. Knepley /* 57075d3a19aSMatthew G. Knepley 2 57175d3a19aSMatthew G. Knepley |\ 57275d3a19aSMatthew G. Knepley | \ 57375d3a19aSMatthew G. Knepley | \ 57475d3a19aSMatthew G. Knepley | \ 57575d3a19aSMatthew G. Knepley | C \ 57675d3a19aSMatthew G. Knepley | \ 57775d3a19aSMatthew G. Knepley | \ 57875d3a19aSMatthew G. Knepley 2---1---1 57975d3a19aSMatthew G. Knepley |\ D / \ 58075d3a19aSMatthew G. Knepley | 2 0 \ 58175d3a19aSMatthew G. Knepley |A \ / B \ 58275d3a19aSMatthew G. Knepley 0---0-------1 58375d3a19aSMatthew G. Knepley */ 58475d3a19aSMatthew G. Knepley /* All cells have 3 faces */ 58575d3a19aSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 58675d3a19aSMatthew G. Knepley const PetscInt newp = cStartNew + (c - cStart)*4; 58775d3a19aSMatthew G. Knepley const PetscInt *cone, *ornt; 58875d3a19aSMatthew G. Knepley PetscInt coneNew[3], orntNew[3]; 58975d3a19aSMatthew G. Knepley 59075d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 59175d3a19aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 59275d3a19aSMatthew G. Knepley /* A triangle */ 59375d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*2 + (ornt[0] < 0 ? 1 : 0); 59475d3a19aSMatthew G. Knepley orntNew[0] = ornt[0]; 59575d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*3 + 2; 59675d3a19aSMatthew G. Knepley orntNew[1] = -2; 59775d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*2 + (ornt[2] < 0 ? 0 : 1); 59875d3a19aSMatthew G. Knepley orntNew[2] = ornt[2]; 59975d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+0, coneNew);CHKERRQ(ierr); 60075d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+0, orntNew);CHKERRQ(ierr); 60175d3a19aSMatthew G. Knepley #if 1 60275d3a19aSMatthew G. Knepley if ((newp+0 < cStartNew) || (newp+0 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+0, cStartNew, cEndNew); 60375d3a19aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 60475d3a19aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 60575d3a19aSMatthew G. Knepley } 60675d3a19aSMatthew G. Knepley #endif 60775d3a19aSMatthew G. Knepley /* B triangle */ 60875d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*2 + (ornt[0] < 0 ? 0 : 1); 60975d3a19aSMatthew G. Knepley orntNew[0] = ornt[0]; 61075d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*2 + (ornt[1] < 0 ? 1 : 0); 61175d3a19aSMatthew G. Knepley orntNew[1] = ornt[1]; 61275d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*3 + 0; 61375d3a19aSMatthew G. Knepley orntNew[2] = -2; 61475d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+1, coneNew);CHKERRQ(ierr); 61575d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+1, orntNew);CHKERRQ(ierr); 61675d3a19aSMatthew G. Knepley #if 1 61775d3a19aSMatthew G. Knepley if ((newp+1 < cStartNew) || (newp+1 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+1, cStartNew, cEndNew); 61875d3a19aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 61975d3a19aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 62075d3a19aSMatthew G. Knepley } 62175d3a19aSMatthew G. Knepley #endif 62275d3a19aSMatthew G. Knepley /* C triangle */ 62375d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*3 + 1; 62475d3a19aSMatthew G. Knepley orntNew[0] = -2; 62575d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*2 + (ornt[1] < 0 ? 0 : 1); 62675d3a19aSMatthew G. Knepley orntNew[1] = ornt[1]; 62775d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*2 + (ornt[2] < 0 ? 1 : 0); 62875d3a19aSMatthew G. Knepley orntNew[2] = ornt[2]; 62975d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+2, coneNew);CHKERRQ(ierr); 63075d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+2, orntNew);CHKERRQ(ierr); 63175d3a19aSMatthew G. Knepley #if 1 63275d3a19aSMatthew G. Knepley if ((newp+2 < cStartNew) || (newp+2 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+2, cStartNew, cEndNew); 63375d3a19aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 63475d3a19aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 63575d3a19aSMatthew G. Knepley } 63675d3a19aSMatthew G. Knepley #endif 63775d3a19aSMatthew G. Knepley /* D triangle */ 63875d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*3 + 0; 63975d3a19aSMatthew G. Knepley orntNew[0] = 0; 64075d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*3 + 1; 64175d3a19aSMatthew G. Knepley orntNew[1] = 0; 64275d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*3 + 2; 64375d3a19aSMatthew G. Knepley orntNew[2] = 0; 64475d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+3, coneNew);CHKERRQ(ierr); 64575d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+3, orntNew);CHKERRQ(ierr); 64675d3a19aSMatthew G. Knepley #if 1 64775d3a19aSMatthew G. Knepley if ((newp+3 < cStartNew) || (newp+3 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+3, cStartNew, cEndNew); 64875d3a19aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 64975d3a19aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 65075d3a19aSMatthew G. Knepley } 65175d3a19aSMatthew G. Knepley #endif 65275d3a19aSMatthew G. Knepley } 65375d3a19aSMatthew G. Knepley /* Split faces have 2 vertices and the same cells as the parent */ 65475d3a19aSMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, NULL, &maxSupportSize);CHKERRQ(ierr); 65575d3a19aSMatthew G. Knepley ierr = PetscMalloc((2 + maxSupportSize*2) * sizeof(PetscInt), &supportRef);CHKERRQ(ierr); 65675d3a19aSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 65775d3a19aSMatthew G. Knepley const PetscInt newv = vStartNew + (vEnd - vStart) + (f - fStart); 65875d3a19aSMatthew G. Knepley 65975d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 66075d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*2 + r; 661297d2bf4SMatthew G. Knepley const PetscInt *cone, *ornt, *support; 66275d3a19aSMatthew G. Knepley PetscInt coneNew[2], coneSize, c, supportSize, s; 66375d3a19aSMatthew G. Knepley 66475d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, f, &cone);CHKERRQ(ierr); 66575d3a19aSMatthew G. Knepley coneNew[0] = vStartNew + (cone[0] - vStart); 66675d3a19aSMatthew G. Knepley coneNew[1] = vStartNew + (cone[1] - vStart); 66775d3a19aSMatthew G. Knepley coneNew[(r+1)%2] = newv; 66875d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 66975d3a19aSMatthew G. Knepley #if 1 67075d3a19aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 67175d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 67275d3a19aSMatthew G. Knepley if ((coneNew[p] < vStartNew) || (coneNew[p] >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", coneNew[p], vStartNew, vEndNew); 67375d3a19aSMatthew G. Knepley } 67475d3a19aSMatthew G. Knepley #endif 67575d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 67675d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 67775d3a19aSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 67875d3a19aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 67975d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 680297d2bf4SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 68175d3a19aSMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 68275d3a19aSMatthew G. Knepley if (cone[c] == f) break; 68375d3a19aSMatthew G. Knepley } 684297d2bf4SMatthew G. Knepley supportRef[s] = cStartNew + (support[s] - cStart)*4 + (ornt[c] < 0 ? (c+1-r)%3 : (c+r)%3); 68575d3a19aSMatthew G. Knepley } 68675d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 68775d3a19aSMatthew G. Knepley #if 1 68875d3a19aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 68975d3a19aSMatthew G. Knepley for (p = 0; p < supportSize; ++p) { 69075d3a19aSMatthew G. Knepley if ((supportRef[p] < cStartNew) || (supportRef[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportRef[p], cStartNew, cEndNew); 69175d3a19aSMatthew G. Knepley } 69275d3a19aSMatthew G. Knepley #endif 69375d3a19aSMatthew G. Knepley } 69475d3a19aSMatthew G. Knepley } 69575d3a19aSMatthew G. Knepley /* Interior faces have 2 vertices and 2 cells */ 69675d3a19aSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 69775d3a19aSMatthew G. Knepley const PetscInt *cone; 69875d3a19aSMatthew G. Knepley 69975d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 70075d3a19aSMatthew G. Knepley for (r = 0; r < 3; ++r) { 70175d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (fEnd - fStart)*2 + (c - cStart)*3 + r; 70275d3a19aSMatthew G. Knepley PetscInt coneNew[2]; 70375d3a19aSMatthew G. Knepley PetscInt supportNew[2]; 70475d3a19aSMatthew G. Knepley 70575d3a19aSMatthew G. Knepley coneNew[0] = vStartNew + (vEnd - vStart) + (cone[r] - fStart); 70675d3a19aSMatthew G. Knepley coneNew[1] = vStartNew + (vEnd - vStart) + (cone[(r+1)%3] - fStart); 70775d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 70875d3a19aSMatthew G. Knepley #if 1 70975d3a19aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 71075d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 71175d3a19aSMatthew G. Knepley if ((coneNew[p] < vStartNew) || (coneNew[p] >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", coneNew[p], vStartNew, vEndNew); 71275d3a19aSMatthew G. Knepley } 71375d3a19aSMatthew G. Knepley #endif 71475d3a19aSMatthew G. Knepley supportNew[0] = (c - cStart)*4 + (r+1)%3; 71575d3a19aSMatthew G. Knepley supportNew[1] = (c - cStart)*4 + 3; 71675d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 71775d3a19aSMatthew G. Knepley #if 1 71875d3a19aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 71975d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 72075d3a19aSMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cEndNew); 72175d3a19aSMatthew G. Knepley } 72275d3a19aSMatthew G. Knepley #endif 72375d3a19aSMatthew G. Knepley } 72475d3a19aSMatthew G. Knepley } 72575d3a19aSMatthew G. Knepley /* Old vertices have identical supports */ 72675d3a19aSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 72775d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 72875d3a19aSMatthew G. Knepley const PetscInt *support, *cone; 72975d3a19aSMatthew G. Knepley PetscInt size, s; 73075d3a19aSMatthew G. Knepley 73175d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 73275d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, v, &support);CHKERRQ(ierr); 73375d3a19aSMatthew G. Knepley for (s = 0; s < size; ++s) { 73475d3a19aSMatthew G. Knepley PetscInt r = 0; 73575d3a19aSMatthew G. Knepley 73675d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 73775d3a19aSMatthew G. Knepley if (cone[1] == v) r = 1; 73875d3a19aSMatthew G. Knepley supportRef[s] = fStartNew + (support[s] - fStart)*2 + r; 73975d3a19aSMatthew G. Knepley } 74075d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 74175d3a19aSMatthew G. Knepley #if 1 74275d3a19aSMatthew G. Knepley if ((newp < vStartNew) || (newp >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", newp, vStartNew, vEndNew); 74375d3a19aSMatthew G. Knepley for (p = 0; p < size; ++p) { 74475d3a19aSMatthew G. Knepley if ((supportRef[p] < fStartNew) || (supportRef[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", supportRef[p], fStartNew, fEndNew); 74575d3a19aSMatthew G. Knepley } 74675d3a19aSMatthew G. Knepley #endif 74775d3a19aSMatthew G. Knepley } 74875d3a19aSMatthew G. Knepley /* Face vertices have 2 + cells*2 supports */ 74975d3a19aSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 75075d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (f - fStart); 75175d3a19aSMatthew G. Knepley const PetscInt *cone, *support; 75275d3a19aSMatthew G. Knepley PetscInt size, s; 75375d3a19aSMatthew G. Knepley 75475d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 75575d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 75675d3a19aSMatthew G. Knepley supportRef[0] = fStartNew + (f - fStart)*2 + 0; 75775d3a19aSMatthew G. Knepley supportRef[1] = fStartNew + (f - fStart)*2 + 1; 75875d3a19aSMatthew G. Knepley for (s = 0; s < size; ++s) { 75975d3a19aSMatthew G. Knepley PetscInt r = 0; 76075d3a19aSMatthew G. Knepley 76175d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 76275d3a19aSMatthew G. Knepley if (cone[1] == f) r = 1; 76375d3a19aSMatthew G. Knepley else if (cone[2] == f) r = 2; 76475d3a19aSMatthew G. Knepley supportRef[2+s*2+0] = fStartNew + (fEnd - fStart)*2 + (support[s] - cStart)*3 + (r+2)%3; 76575d3a19aSMatthew G. Knepley supportRef[2+s*2+1] = fStartNew + (fEnd - fStart)*2 + (support[s] - cStart)*3 + r; 76675d3a19aSMatthew G. Knepley } 76775d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 76875d3a19aSMatthew G. Knepley #if 1 76975d3a19aSMatthew G. Knepley if ((newp < vStartNew) || (newp >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", newp, vStartNew, vEndNew); 77075d3a19aSMatthew G. Knepley for (p = 0; p < 2+size*2; ++p) { 77175d3a19aSMatthew G. Knepley if ((supportRef[p] < fStartNew) || (supportRef[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", supportRef[p], fStartNew, fEndNew); 77275d3a19aSMatthew G. Knepley } 77375d3a19aSMatthew G. Knepley #endif 77475d3a19aSMatthew G. Knepley } 77575d3a19aSMatthew G. Knepley ierr = PetscFree(supportRef);CHKERRQ(ierr); 77675d3a19aSMatthew G. Knepley break; 77775d3a19aSMatthew G. Knepley case 2: 77875d3a19aSMatthew G. Knepley /* Hex 2D */ 77975d3a19aSMatthew G. Knepley /* 78075d3a19aSMatthew G. Knepley 3---------2---------2 78175d3a19aSMatthew G. Knepley | | | 78275d3a19aSMatthew G. Knepley | D 2 C | 78375d3a19aSMatthew G. Knepley | | | 78475d3a19aSMatthew G. Knepley 3----3----0----1----1 78575d3a19aSMatthew G. Knepley | | | 78675d3a19aSMatthew G. Knepley | A 0 B | 78775d3a19aSMatthew G. Knepley | | | 78875d3a19aSMatthew G. Knepley 0---------0---------1 78975d3a19aSMatthew G. Knepley */ 79075d3a19aSMatthew G. Knepley /* All cells have 4 faces */ 79175d3a19aSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 79275d3a19aSMatthew G. Knepley const PetscInt newp = (c - cStart)*4; 79375d3a19aSMatthew G. Knepley const PetscInt *cone, *ornt; 79475d3a19aSMatthew G. Knepley PetscInt coneNew[4], orntNew[4]; 79575d3a19aSMatthew G. Knepley 79675d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 79775d3a19aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 79875d3a19aSMatthew G. Knepley /* A quad */ 79975d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*2 + (ornt[0] < 0 ? 1 : 0); 80075d3a19aSMatthew G. Knepley orntNew[0] = ornt[0]; 80175d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + 0; 80275d3a19aSMatthew G. Knepley orntNew[1] = 0; 80375d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + 3; 80475d3a19aSMatthew G. Knepley orntNew[2] = -2; 80575d3a19aSMatthew G. Knepley coneNew[3] = fStartNew + (cone[3] - fStart)*2 + (ornt[3] < 0 ? 0 : 1); 80675d3a19aSMatthew G. Knepley orntNew[3] = ornt[3]; 80775d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+0, coneNew);CHKERRQ(ierr); 80875d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+0, orntNew);CHKERRQ(ierr); 80975d3a19aSMatthew G. Knepley #if 1 81075d3a19aSMatthew G. Knepley if ((newp+0 < cStartNew) || (newp+0 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+0, cStartNew, cEndNew); 81175d3a19aSMatthew G. Knepley for (p = 0; p < 4; ++p) { 81275d3a19aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 81375d3a19aSMatthew G. Knepley } 81475d3a19aSMatthew G. Knepley #endif 81575d3a19aSMatthew G. Knepley /* B quad */ 81675d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*2 + (ornt[0] < 0 ? 0 : 1); 81775d3a19aSMatthew G. Knepley orntNew[0] = ornt[0]; 81875d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*2 + (ornt[1] < 0 ? 1 : 0); 81975d3a19aSMatthew G. Knepley orntNew[1] = ornt[1]; 82075d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + 1; 82175d3a19aSMatthew G. Knepley orntNew[2] = 0; 82275d3a19aSMatthew G. Knepley coneNew[3] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + 0; 82375d3a19aSMatthew G. Knepley orntNew[3] = -2; 82475d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+1, coneNew);CHKERRQ(ierr); 82575d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+1, orntNew);CHKERRQ(ierr); 82675d3a19aSMatthew G. Knepley #if 1 82775d3a19aSMatthew G. Knepley if ((newp+1 < cStartNew) || (newp+1 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+1, cStartNew, cEndNew); 82875d3a19aSMatthew G. Knepley for (p = 0; p < 4; ++p) { 82975d3a19aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 83075d3a19aSMatthew G. Knepley } 83175d3a19aSMatthew G. Knepley #endif 83275d3a19aSMatthew G. Knepley /* C quad */ 83375d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + 1; 83475d3a19aSMatthew G. Knepley orntNew[0] = -2; 83575d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*2 + (ornt[1] < 0 ? 0 : 1); 83675d3a19aSMatthew G. Knepley orntNew[1] = ornt[1]; 83775d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*2 + (ornt[2] < 0 ? 1 : 0); 83875d3a19aSMatthew G. Knepley orntNew[2] = ornt[2]; 83975d3a19aSMatthew G. Knepley coneNew[3] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + 2; 84075d3a19aSMatthew G. Knepley orntNew[3] = 0; 84175d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+2, coneNew);CHKERRQ(ierr); 84275d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+2, orntNew);CHKERRQ(ierr); 84375d3a19aSMatthew G. Knepley #if 1 84475d3a19aSMatthew G. Knepley if ((newp+2 < cStartNew) || (newp+2 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+2, cStartNew, cEndNew); 84575d3a19aSMatthew G. Knepley for (p = 0; p < 4; ++p) { 84675d3a19aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 84775d3a19aSMatthew G. Knepley } 84875d3a19aSMatthew G. Knepley #endif 84975d3a19aSMatthew G. Knepley /* D quad */ 85075d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + 3; 85175d3a19aSMatthew G. Knepley orntNew[0] = 0; 85275d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + 2; 85375d3a19aSMatthew G. Knepley orntNew[1] = -2; 85475d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*2 + (ornt[2] < 0 ? 0 : 1); 85575d3a19aSMatthew G. Knepley orntNew[2] = ornt[2]; 85675d3a19aSMatthew G. Knepley coneNew[3] = fStartNew + (cone[3] - fStart)*2 + (ornt[3] < 0 ? 1 : 0); 85775d3a19aSMatthew G. Knepley orntNew[3] = ornt[3]; 85875d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+3, coneNew);CHKERRQ(ierr); 85975d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+3, orntNew);CHKERRQ(ierr); 86075d3a19aSMatthew G. Knepley #if 1 86175d3a19aSMatthew G. Knepley if ((newp+3 < cStartNew) || (newp+3 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+3, cStartNew, cEndNew); 86275d3a19aSMatthew G. Knepley for (p = 0; p < 4; ++p) { 86375d3a19aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 86475d3a19aSMatthew G. Knepley } 86575d3a19aSMatthew G. Knepley #endif 86675d3a19aSMatthew G. Knepley } 86775d3a19aSMatthew G. Knepley /* Split faces have 2 vertices and the same cells as the parent */ 86875d3a19aSMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, NULL, &maxSupportSize);CHKERRQ(ierr); 86975d3a19aSMatthew G. Knepley ierr = PetscMalloc((2 + maxSupportSize*2) * sizeof(PetscInt), &supportRef);CHKERRQ(ierr); 87075d3a19aSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 87175d3a19aSMatthew G. Knepley const PetscInt newv = vStartNew + (vEnd - vStart) + (f - fStart); 87275d3a19aSMatthew G. Knepley 87375d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 87475d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*2 + r; 875455d6cd4SMatthew G. Knepley const PetscInt *cone, *ornt, *support; 87675d3a19aSMatthew G. Knepley PetscInt coneNew[2], coneSize, c, supportSize, s; 87775d3a19aSMatthew G. Knepley 87875d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, f, &cone);CHKERRQ(ierr); 87975d3a19aSMatthew G. Knepley coneNew[0] = vStartNew + (cone[0] - vStart); 88075d3a19aSMatthew G. Knepley coneNew[1] = vStartNew + (cone[1] - vStart); 88175d3a19aSMatthew G. Knepley coneNew[(r+1)%2] = newv; 88275d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 88375d3a19aSMatthew G. Knepley #if 1 88475d3a19aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 88575d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 88675d3a19aSMatthew G. Knepley if ((coneNew[p] < vStartNew) || (coneNew[p] >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", coneNew[p], vStartNew, vEndNew); 88775d3a19aSMatthew G. Knepley } 88875d3a19aSMatthew G. Knepley #endif 88975d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 89075d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 89175d3a19aSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 89275d3a19aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 89375d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 894455d6cd4SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 89575d3a19aSMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 89675d3a19aSMatthew G. Knepley if (cone[c] == f) break; 89775d3a19aSMatthew G. Knepley } 898455d6cd4SMatthew G. Knepley supportRef[s] = cStartNew + (support[s] - cStart)*4 + (ornt[c] < 0 ? (c+1-r)%4 : (c+r)%4); 89975d3a19aSMatthew G. Knepley } 90075d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 90175d3a19aSMatthew G. Knepley #if 1 90275d3a19aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 90375d3a19aSMatthew G. Knepley for (p = 0; p < supportSize; ++p) { 90475d3a19aSMatthew G. Knepley if ((supportRef[p] < cStartNew) || (supportRef[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportRef[p], cStartNew, cEndNew); 90575d3a19aSMatthew G. Knepley } 90675d3a19aSMatthew G. Knepley #endif 90775d3a19aSMatthew G. Knepley } 90875d3a19aSMatthew G. Knepley } 90975d3a19aSMatthew G. Knepley /* Interior faces have 2 vertices and 2 cells */ 91075d3a19aSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 91175d3a19aSMatthew G. Knepley const PetscInt *cone; 91275d3a19aSMatthew G. Knepley PetscInt coneNew[2], supportNew[2]; 91375d3a19aSMatthew G. Knepley 91475d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 91575d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 91675d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + r; 91775d3a19aSMatthew G. Knepley 91875d3a19aSMatthew G. Knepley coneNew[0] = vStartNew + (vEnd - vStart) + (cone[r] - fStart); 91975d3a19aSMatthew G. Knepley coneNew[1] = vStartNew + (vEnd - vStart) + (fEnd - fStart) + (c - cStart); 92075d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 92175d3a19aSMatthew G. Knepley #if 1 92275d3a19aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 92375d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 92475d3a19aSMatthew G. Knepley if ((coneNew[p] < vStartNew) || (coneNew[p] >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", coneNew[p], vStartNew, vEndNew); 92575d3a19aSMatthew G. Knepley } 92675d3a19aSMatthew G. Knepley #endif 92775d3a19aSMatthew G. Knepley supportNew[0] = (c - cStart)*4 + r; 92875d3a19aSMatthew G. Knepley supportNew[1] = (c - cStart)*4 + (r+1)%4; 92975d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 93075d3a19aSMatthew G. Knepley #if 1 93175d3a19aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 93275d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 93375d3a19aSMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cEndNew); 93475d3a19aSMatthew G. Knepley } 93575d3a19aSMatthew G. Knepley #endif 93675d3a19aSMatthew G. Knepley } 93775d3a19aSMatthew G. Knepley } 93875d3a19aSMatthew G. Knepley /* Old vertices have identical supports */ 93975d3a19aSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 94075d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 94175d3a19aSMatthew G. Knepley const PetscInt *support, *cone; 94275d3a19aSMatthew G. Knepley PetscInt size, s; 94375d3a19aSMatthew G. Knepley 94475d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 94575d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, v, &support);CHKERRQ(ierr); 94675d3a19aSMatthew G. Knepley for (s = 0; s < size; ++s) { 94775d3a19aSMatthew G. Knepley PetscInt r = 0; 94875d3a19aSMatthew G. Knepley 94975d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 95075d3a19aSMatthew G. Knepley if (cone[1] == v) r = 1; 95175d3a19aSMatthew G. Knepley supportRef[s] = fStartNew + (support[s] - fStart)*2 + r; 95275d3a19aSMatthew G. Knepley } 95375d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 95475d3a19aSMatthew G. Knepley #if 1 95575d3a19aSMatthew G. Knepley if ((newp < vStartNew) || (newp >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", newp, vStartNew, vEndNew); 95675d3a19aSMatthew G. Knepley for (p = 0; p < size; ++p) { 95775d3a19aSMatthew G. Knepley if ((supportRef[p] < fStartNew) || (supportRef[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", supportRef[p], fStartNew, fEndNew); 95875d3a19aSMatthew G. Knepley } 95975d3a19aSMatthew G. Knepley #endif 96075d3a19aSMatthew G. Knepley } 96175d3a19aSMatthew G. Knepley /* Face vertices have 2 + cells supports */ 96275d3a19aSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 96375d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (f - fStart); 96475d3a19aSMatthew G. Knepley const PetscInt *cone, *support; 96575d3a19aSMatthew G. Knepley PetscInt size, s; 96675d3a19aSMatthew G. Knepley 96775d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 96875d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 96975d3a19aSMatthew G. Knepley supportRef[0] = fStartNew + (f - fStart)*2 + 0; 97075d3a19aSMatthew G. Knepley supportRef[1] = fStartNew + (f - fStart)*2 + 1; 97175d3a19aSMatthew G. Knepley for (s = 0; s < size; ++s) { 97275d3a19aSMatthew G. Knepley PetscInt r = 0; 97375d3a19aSMatthew G. Knepley 97475d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 97575d3a19aSMatthew G. Knepley if (cone[1] == f) r = 1; 97675d3a19aSMatthew G. Knepley else if (cone[2] == f) r = 2; 97775d3a19aSMatthew G. Knepley else if (cone[3] == f) r = 3; 97875d3a19aSMatthew G. Knepley supportRef[2+s] = fStartNew + (fEnd - fStart)*2 + (support[s] - cStart)*4 + r; 97975d3a19aSMatthew G. Knepley } 98075d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 98175d3a19aSMatthew G. Knepley #if 1 98275d3a19aSMatthew G. Knepley if ((newp < vStartNew) || (newp >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", newp, vStartNew, vEndNew); 98375d3a19aSMatthew G. Knepley for (p = 0; p < 2+size; ++p) { 98475d3a19aSMatthew G. Knepley if ((supportRef[p] < fStartNew) || (supportRef[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", supportRef[p], fStartNew, fEndNew); 98575d3a19aSMatthew G. Knepley } 98675d3a19aSMatthew G. Knepley #endif 98775d3a19aSMatthew G. Knepley } 98875d3a19aSMatthew G. Knepley /* Cell vertices have 4 supports */ 98975d3a19aSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 99075d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (fEnd - fStart) + (c - cStart); 99175d3a19aSMatthew G. Knepley PetscInt supportNew[4]; 99275d3a19aSMatthew G. Knepley 99375d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 99475d3a19aSMatthew G. Knepley supportNew[r] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + r; 99575d3a19aSMatthew G. Knepley } 99675d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 99775d3a19aSMatthew G. Knepley } 998*da00770fSMatthew G. Knepley ierr = PetscFree(supportRef);CHKERRQ(ierr); 99975d3a19aSMatthew G. Knepley break; 100075d3a19aSMatthew G. Knepley case 3: 100175d3a19aSMatthew G. Knepley if (cMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No cell maximum specified in hybrid mesh"); 100275d3a19aSMatthew G. Knepley cMax = PetscMin(cEnd, cMax); 100375d3a19aSMatthew G. Knepley if (fMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No face maximum specified in hybrid mesh"); 100475d3a19aSMatthew G. Knepley fMax = PetscMin(fEnd, fMax); 100575d3a19aSMatthew G. Knepley /* Interior cells have 3 faces */ 100675d3a19aSMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 100775d3a19aSMatthew G. Knepley const PetscInt newp = cStartNew + (c - cStart)*4; 100875d3a19aSMatthew G. Knepley const PetscInt *cone, *ornt; 100975d3a19aSMatthew G. Knepley PetscInt coneNew[3], orntNew[3]; 101075d3a19aSMatthew G. Knepley 101175d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 101275d3a19aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 101375d3a19aSMatthew G. Knepley /* A triangle */ 101475d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*2 + (ornt[0] < 0 ? 1 : 0); 101575d3a19aSMatthew G. Knepley orntNew[0] = ornt[0]; 101675d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (fMax - fStart)*2 + (c - cStart)*3 + 2; 101775d3a19aSMatthew G. Knepley orntNew[1] = -2; 101875d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*2 + (ornt[2] < 0 ? 0 : 1); 101975d3a19aSMatthew G. Knepley orntNew[2] = ornt[2]; 102075d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+0, coneNew);CHKERRQ(ierr); 102175d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+0, orntNew);CHKERRQ(ierr); 102275d3a19aSMatthew G. Knepley #if 1 102375d3a19aSMatthew G. Knepley if ((newp+0 < cStartNew) || (newp+0 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+0, cStartNew, cEndNew); 102475d3a19aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 102575d3a19aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 102675d3a19aSMatthew G. Knepley } 102775d3a19aSMatthew G. Knepley #endif 102875d3a19aSMatthew G. Knepley /* B triangle */ 102975d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*2 + (ornt[0] < 0 ? 0 : 1); 103075d3a19aSMatthew G. Knepley orntNew[0] = ornt[0]; 103175d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*2 + (ornt[1] < 0 ? 1 : 0); 103275d3a19aSMatthew G. Knepley orntNew[1] = ornt[1]; 103375d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (fMax - fStart)*2 + (c - cStart)*3 + 0; 103475d3a19aSMatthew G. Knepley orntNew[2] = -2; 103575d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+1, coneNew);CHKERRQ(ierr); 103675d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+1, orntNew);CHKERRQ(ierr); 103775d3a19aSMatthew G. Knepley #if 1 103875d3a19aSMatthew G. Knepley if ((newp+1 < cStartNew) || (newp+1 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+1, cStartNew, cEndNew); 103975d3a19aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 104075d3a19aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 104175d3a19aSMatthew G. Knepley } 104275d3a19aSMatthew G. Knepley #endif 104375d3a19aSMatthew G. Knepley /* C triangle */ 104475d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (fMax - fStart)*2 + (c - cStart)*3 + 1; 104575d3a19aSMatthew G. Knepley orntNew[0] = -2; 104675d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*2 + (ornt[1] < 0 ? 0 : 1); 104775d3a19aSMatthew G. Knepley orntNew[1] = ornt[1]; 104875d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*2 + (ornt[2] < 0 ? 1 : 0); 104975d3a19aSMatthew G. Knepley orntNew[2] = ornt[2]; 105075d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+2, coneNew);CHKERRQ(ierr); 105175d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+2, orntNew);CHKERRQ(ierr); 105275d3a19aSMatthew G. Knepley #if 1 105375d3a19aSMatthew G. Knepley if ((newp+2 < cStartNew) || (newp+2 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+2, cStartNew, cEndNew); 105475d3a19aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 105575d3a19aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 105675d3a19aSMatthew G. Knepley } 105775d3a19aSMatthew G. Knepley #endif 105875d3a19aSMatthew G. Knepley /* D triangle */ 105975d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (fMax - fStart)*2 + (c - cStart)*3 + 0; 106075d3a19aSMatthew G. Knepley orntNew[0] = 0; 106175d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (fMax - fStart)*2 + (c - cStart)*3 + 1; 106275d3a19aSMatthew G. Knepley orntNew[1] = 0; 106375d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (fMax - fStart)*2 + (c - cStart)*3 + 2; 106475d3a19aSMatthew G. Knepley orntNew[2] = 0; 106575d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+3, coneNew);CHKERRQ(ierr); 106675d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+3, orntNew);CHKERRQ(ierr); 106775d3a19aSMatthew G. Knepley #if 1 106875d3a19aSMatthew G. Knepley if ((newp+3 < cStartNew) || (newp+3 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+3, cStartNew, cEndNew); 106975d3a19aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 107075d3a19aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 107175d3a19aSMatthew G. Knepley } 107275d3a19aSMatthew G. Knepley #endif 107375d3a19aSMatthew G. Knepley } 107475d3a19aSMatthew G. Knepley /* 107575d3a19aSMatthew G. Knepley 2----3----3 107675d3a19aSMatthew G. Knepley | | 107775d3a19aSMatthew G. Knepley | B | 107875d3a19aSMatthew G. Knepley | | 107975d3a19aSMatthew G. Knepley 0----4--- 1 108075d3a19aSMatthew G. Knepley | | 108175d3a19aSMatthew G. Knepley | A | 108275d3a19aSMatthew G. Knepley | | 108375d3a19aSMatthew G. Knepley 0----2----1 108475d3a19aSMatthew G. Knepley */ 108575d3a19aSMatthew G. Knepley /* Hybrid cells have 4 faces */ 108675d3a19aSMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 108775d3a19aSMatthew G. Knepley const PetscInt newp = cStartNew + (cMax - cStart)*4 + (c - cMax)*2; 108875d3a19aSMatthew G. Knepley const PetscInt *cone, *ornt; 108975d3a19aSMatthew G. Knepley PetscInt coneNew[4], orntNew[4]; 109075d3a19aSMatthew G. Knepley 109175d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 109275d3a19aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 109375d3a19aSMatthew G. Knepley /* A quad */ 109475d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*2 + (ornt[0] < 0 ? 1 : 0); 109575d3a19aSMatthew G. Knepley orntNew[0] = ornt[0]; 109675d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*2 + (ornt[1] < 0 ? 1 : 0); 109775d3a19aSMatthew G. Knepley orntNew[1] = ornt[1]; 109875d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (cone[2] - fMax); 109975d3a19aSMatthew G. Knepley orntNew[2] = 0; 110075d3a19aSMatthew G. Knepley coneNew[3] = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (fEnd - fMax) + (c - cMax); 110175d3a19aSMatthew G. Knepley orntNew[3] = 0; 110275d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+0, coneNew);CHKERRQ(ierr); 110375d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+0, orntNew);CHKERRQ(ierr); 110475d3a19aSMatthew G. Knepley #if 1 110575d3a19aSMatthew G. Knepley if ((newp+0 < cStartNew) || (newp+0 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+0, cStartNew, cEndNew); 110675d3a19aSMatthew G. Knepley for (p = 0; p < 4; ++p) { 110775d3a19aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 110875d3a19aSMatthew G. Knepley } 110975d3a19aSMatthew G. Knepley #endif 111075d3a19aSMatthew G. Knepley /* B quad */ 111175d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*2 + (ornt[0] < 0 ? 0 : 1); 111275d3a19aSMatthew G. Knepley orntNew[0] = ornt[0]; 111375d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*2 + (ornt[1] < 0 ? 0 : 1); 111475d3a19aSMatthew G. Knepley orntNew[1] = ornt[1]; 111575d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (fEnd - fMax) + (c - cMax); 111675d3a19aSMatthew G. Knepley orntNew[2] = 0; 111775d3a19aSMatthew G. Knepley coneNew[3] = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (cone[3] - fMax); 111875d3a19aSMatthew G. Knepley orntNew[3] = 0; 111975d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+1, coneNew);CHKERRQ(ierr); 112075d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+1, orntNew);CHKERRQ(ierr); 112175d3a19aSMatthew G. Knepley #if 1 112275d3a19aSMatthew G. Knepley if ((newp+1 < cStartNew) || (newp+1 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+1, cStartNew, cEndNew); 112375d3a19aSMatthew G. Knepley for (p = 0; p < 4; ++p) { 112475d3a19aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 112575d3a19aSMatthew G. Knepley } 112675d3a19aSMatthew G. Knepley #endif 112775d3a19aSMatthew G. Knepley } 112875d3a19aSMatthew G. Knepley /* Interior split faces have 2 vertices and the same cells as the parent */ 112975d3a19aSMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, NULL, &maxSupportSize);CHKERRQ(ierr); 113075d3a19aSMatthew G. Knepley ierr = PetscMalloc((2 + maxSupportSize*2) * sizeof(PetscInt), &supportRef);CHKERRQ(ierr); 113175d3a19aSMatthew G. Knepley for (f = fStart; f < fMax; ++f) { 113275d3a19aSMatthew G. Knepley const PetscInt newv = vStartNew + (vEnd - vStart) + (f - fStart); 113375d3a19aSMatthew G. Knepley 113475d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 113575d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*2 + r; 1136297d2bf4SMatthew G. Knepley const PetscInt *cone, *ornt, *support; 113775d3a19aSMatthew G. Knepley PetscInt coneNew[2], coneSize, c, supportSize, s; 113875d3a19aSMatthew G. Knepley 113975d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, f, &cone);CHKERRQ(ierr); 114075d3a19aSMatthew G. Knepley coneNew[0] = vStartNew + (cone[0] - vStart); 114175d3a19aSMatthew G. Knepley coneNew[1] = vStartNew + (cone[1] - vStart); 114275d3a19aSMatthew G. Knepley coneNew[(r+1)%2] = newv; 114375d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 114475d3a19aSMatthew G. Knepley #if 1 114575d3a19aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 114675d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 114775d3a19aSMatthew G. Knepley if ((coneNew[p] < vStartNew) || (coneNew[p] >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", coneNew[p], vStartNew, vEndNew); 114875d3a19aSMatthew G. Knepley } 114975d3a19aSMatthew G. Knepley #endif 115075d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 115175d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 115275d3a19aSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 115375d3a19aSMatthew G. Knepley if (support[s] >= cMax) { 115475d3a19aSMatthew G. Knepley supportRef[s] = cStartNew + (cMax - cStart)*4 + (support[s] - cMax)*2 + r; 115575d3a19aSMatthew G. Knepley } else { 115675d3a19aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 115775d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1158297d2bf4SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 115975d3a19aSMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 116075d3a19aSMatthew G. Knepley if (cone[c] == f) break; 116175d3a19aSMatthew G. Knepley } 1162297d2bf4SMatthew G. Knepley supportRef[s] = cStartNew + (support[s] - cStart)*4 + (ornt[c] < 0 ? (c+1-r)%3 : (c+r)%3); 116375d3a19aSMatthew G. Knepley } 116475d3a19aSMatthew G. Knepley } 116575d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 116675d3a19aSMatthew G. Knepley #if 1 116775d3a19aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 116875d3a19aSMatthew G. Knepley for (p = 0; p < supportSize; ++p) { 116975d3a19aSMatthew G. Knepley if ((supportRef[p] < cStartNew) || (supportRef[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportRef[p], cStartNew, cEndNew); 117075d3a19aSMatthew G. Knepley } 117175d3a19aSMatthew G. Knepley #endif 117275d3a19aSMatthew G. Knepley } 117375d3a19aSMatthew G. Knepley } 117475d3a19aSMatthew G. Knepley /* Interior cell faces have 2 vertices and 2 cells */ 117575d3a19aSMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 117675d3a19aSMatthew G. Knepley const PetscInt *cone; 117775d3a19aSMatthew G. Knepley 117875d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 117975d3a19aSMatthew G. Knepley for (r = 0; r < 3; ++r) { 118075d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (fMax - fStart)*2 + (c - cStart)*3 + r; 118175d3a19aSMatthew G. Knepley PetscInt coneNew[2]; 118275d3a19aSMatthew G. Knepley PetscInt supportNew[2]; 118375d3a19aSMatthew G. Knepley 118475d3a19aSMatthew G. Knepley coneNew[0] = vStartNew + (vEnd - vStart) + (cone[r] - fStart); 118575d3a19aSMatthew G. Knepley coneNew[1] = vStartNew + (vEnd - vStart) + (cone[(r+1)%3] - fStart); 118675d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 118775d3a19aSMatthew G. Knepley #if 1 118875d3a19aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 118975d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 119075d3a19aSMatthew G. Knepley if ((coneNew[p] < vStartNew) || (coneNew[p] >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", coneNew[p], vStartNew, vEndNew); 119175d3a19aSMatthew G. Knepley } 119275d3a19aSMatthew G. Knepley #endif 119375d3a19aSMatthew G. Knepley supportNew[0] = (c - cStart)*4 + (r+1)%3; 119475d3a19aSMatthew G. Knepley supportNew[1] = (c - cStart)*4 + 3; 119575d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 119675d3a19aSMatthew G. Knepley #if 1 119775d3a19aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 119875d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 119975d3a19aSMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cEndNew); 120075d3a19aSMatthew G. Knepley } 120175d3a19aSMatthew G. Knepley #endif 120275d3a19aSMatthew G. Knepley } 120375d3a19aSMatthew G. Knepley } 120475d3a19aSMatthew G. Knepley /* Interior hybrid faces have 2 vertices and the same cells */ 120575d3a19aSMatthew G. Knepley for (f = fMax; f < fEnd; ++f) { 120675d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (f - fMax); 120775d3a19aSMatthew G. Knepley const PetscInt *cone; 120875d3a19aSMatthew G. Knepley const PetscInt *support; 120975d3a19aSMatthew G. Knepley PetscInt coneNew[2]; 121075d3a19aSMatthew G. Knepley PetscInt supportNew[2]; 121175d3a19aSMatthew G. Knepley PetscInt size, s, r; 121275d3a19aSMatthew G. Knepley 121375d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, f, &cone);CHKERRQ(ierr); 121475d3a19aSMatthew G. Knepley coneNew[0] = vStartNew + (cone[0] - vStart); 121575d3a19aSMatthew G. Knepley coneNew[1] = vStartNew + (cone[1] - vStart); 121675d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 121775d3a19aSMatthew G. Knepley #if 1 121875d3a19aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 121975d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 122075d3a19aSMatthew G. Knepley if ((coneNew[p] < vStartNew) || (coneNew[p] >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", coneNew[p], vStartNew, vEndNew); 122175d3a19aSMatthew G. Knepley } 122275d3a19aSMatthew G. Knepley #endif 122375d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 122475d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 122575d3a19aSMatthew G. Knepley for (s = 0; s < size; ++s) { 122675d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 122775d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 122875d3a19aSMatthew G. Knepley if (cone[r+2] == f) break; 122975d3a19aSMatthew G. Knepley } 123075d3a19aSMatthew G. Knepley supportNew[s] = (cMax - cStart)*4 + (support[s] - cMax)*2 + r; 123175d3a19aSMatthew G. Knepley } 123275d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 123375d3a19aSMatthew G. Knepley #if 1 123475d3a19aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 123575d3a19aSMatthew G. Knepley for (p = 0; p < size; ++p) { 123675d3a19aSMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cEndNew); 123775d3a19aSMatthew G. Knepley } 123875d3a19aSMatthew G. Knepley #endif 123975d3a19aSMatthew G. Knepley } 124075d3a19aSMatthew G. Knepley /* Cell hybrid faces have 2 vertices and 2 cells */ 124175d3a19aSMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 124275d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (fEnd - fMax) + (c - cMax); 124375d3a19aSMatthew G. Knepley const PetscInt *cone; 124475d3a19aSMatthew G. Knepley PetscInt coneNew[2]; 124575d3a19aSMatthew G. Knepley PetscInt supportNew[2]; 124675d3a19aSMatthew G. Knepley 124775d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 124875d3a19aSMatthew G. Knepley coneNew[0] = vStartNew + (vEnd - vStart) + (cone[0] - fStart); 124975d3a19aSMatthew G. Knepley coneNew[1] = vStartNew + (vEnd - vStart) + (cone[1] - fStart); 125075d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 125175d3a19aSMatthew G. Knepley #if 1 125275d3a19aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 125375d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 125475d3a19aSMatthew G. Knepley if ((coneNew[p] < vStartNew) || (coneNew[p] >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", coneNew[p], vStartNew, vEndNew); 125575d3a19aSMatthew G. Knepley } 125675d3a19aSMatthew G. Knepley #endif 125775d3a19aSMatthew G. Knepley supportNew[0] = (cMax - cStart)*4 + (c - cMax)*2 + 0; 125875d3a19aSMatthew G. Knepley supportNew[1] = (cMax - cStart)*4 + (c - cMax)*2 + 1; 125975d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 126075d3a19aSMatthew G. Knepley #if 1 126175d3a19aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 126275d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 126375d3a19aSMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cEndNew); 126475d3a19aSMatthew G. Knepley } 126575d3a19aSMatthew G. Knepley #endif 126675d3a19aSMatthew G. Knepley } 126775d3a19aSMatthew G. Knepley /* Old vertices have identical supports */ 126875d3a19aSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 126975d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 127075d3a19aSMatthew G. Knepley const PetscInt *support, *cone; 127175d3a19aSMatthew G. Knepley PetscInt size, s; 127275d3a19aSMatthew G. Knepley 127375d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 127475d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, v, &support);CHKERRQ(ierr); 127575d3a19aSMatthew G. Knepley for (s = 0; s < size; ++s) { 127675d3a19aSMatthew G. Knepley if (support[s] >= fMax) { 127775d3a19aSMatthew G. Knepley supportRef[s] = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (support[s] - fMax); 127875d3a19aSMatthew G. Knepley } else { 127975d3a19aSMatthew G. Knepley PetscInt r = 0; 128075d3a19aSMatthew G. Knepley 128175d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 128275d3a19aSMatthew G. Knepley if (cone[1] == v) r = 1; 128375d3a19aSMatthew G. Knepley supportRef[s] = fStartNew + (support[s] - fStart)*2 + r; 128475d3a19aSMatthew G. Knepley } 128575d3a19aSMatthew G. Knepley } 128675d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 128775d3a19aSMatthew G. Knepley #if 1 128875d3a19aSMatthew G. Knepley if ((newp < vStartNew) || (newp >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", newp, vStartNew, vEndNew); 128975d3a19aSMatthew G. Knepley for (p = 0; p < size; ++p) { 129075d3a19aSMatthew G. Knepley if ((supportRef[p] < fStartNew) || (supportRef[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", supportRef[p], fStartNew, fEndNew); 129175d3a19aSMatthew G. Knepley } 129275d3a19aSMatthew G. Knepley #endif 129375d3a19aSMatthew G. Knepley } 129475d3a19aSMatthew G. Knepley /* Face vertices have 2 + (2 interior, 1 hybrid) supports */ 129575d3a19aSMatthew G. Knepley for (f = fStart; f < fMax; ++f) { 129675d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (f - fStart); 129775d3a19aSMatthew G. Knepley const PetscInt *cone, *support; 129875d3a19aSMatthew G. Knepley PetscInt size, newSize = 2, s; 129975d3a19aSMatthew G. Knepley 130075d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 130175d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 130275d3a19aSMatthew G. Knepley supportRef[0] = fStartNew + (f - fStart)*2 + 0; 130375d3a19aSMatthew G. Knepley supportRef[1] = fStartNew + (f - fStart)*2 + 1; 130475d3a19aSMatthew G. Knepley for (s = 0; s < size; ++s) { 130575d3a19aSMatthew G. Knepley PetscInt r = 0; 130675d3a19aSMatthew G. Knepley 130775d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 130875d3a19aSMatthew G. Knepley if (support[s] >= cMax) { 130975d3a19aSMatthew G. Knepley supportRef[newSize+0] = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (fEnd - fMax) + (support[s] - cMax); 131075d3a19aSMatthew G. Knepley 131175d3a19aSMatthew G. Knepley newSize += 1; 131275d3a19aSMatthew G. Knepley } else { 131375d3a19aSMatthew G. Knepley if (cone[1] == f) r = 1; 131475d3a19aSMatthew G. Knepley else if (cone[2] == f) r = 2; 131575d3a19aSMatthew G. Knepley supportRef[newSize+0] = fStartNew + (fMax - fStart)*2 + (support[s] - cStart)*3 + (r+2)%3; 131675d3a19aSMatthew G. Knepley supportRef[newSize+1] = fStartNew + (fMax - fStart)*2 + (support[s] - cStart)*3 + r; 131775d3a19aSMatthew G. Knepley 131875d3a19aSMatthew G. Knepley newSize += 2; 131975d3a19aSMatthew G. Knepley } 132075d3a19aSMatthew G. Knepley } 132175d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 132275d3a19aSMatthew G. Knepley #if 1 132375d3a19aSMatthew G. Knepley if ((newp < vStartNew) || (newp >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", newp, vStartNew, vEndNew); 132475d3a19aSMatthew G. Knepley for (p = 0; p < newSize; ++p) { 132575d3a19aSMatthew G. Knepley if ((supportRef[p] < fStartNew) || (supportRef[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", supportRef[p], fStartNew, fEndNew); 132675d3a19aSMatthew G. Knepley } 132775d3a19aSMatthew G. Knepley #endif 132875d3a19aSMatthew G. Knepley } 132975d3a19aSMatthew G. Knepley ierr = PetscFree(supportRef);CHKERRQ(ierr); 133075d3a19aSMatthew G. Knepley break; 1331b5da9499SMatthew G. Knepley case 5: 1332b5da9499SMatthew G. Knepley /* Simplicial 3D */ 1333b5da9499SMatthew G. Knepley /* All cells have 4 faces: Tet face order is prescribed in DMPlexGetFaces_Internal() */ 1334b5da9499SMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, 3, 4, cellInd, NULL, NULL, &faces);CHKERRQ(ierr); 1335b5da9499SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 1336b5da9499SMatthew G. Knepley const PetscInt newp = cStartNew + (c - cStart)*8; 1337b5da9499SMatthew G. Knepley const PetscInt *cone, *ornt; 1338b5da9499SMatthew G. Knepley PetscInt coneNew[4], orntNew[4]; 1339b5da9499SMatthew G. Knepley 1340b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1341b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 1342b5da9499SMatthew G. Knepley /* A tetrahedron: {0, a, c, d} */ 1343518a8359SMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*4 + GetTriSubface_Static(ornt[0], 0); /* A */ 1344b5da9499SMatthew G. Knepley orntNew[0] = ornt[0]; 1345518a8359SMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*4 + GetTriSubface_Static(ornt[1], 0); /* A */ 1346b5da9499SMatthew G. Knepley orntNew[1] = ornt[1]; 1347518a8359SMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*4 + GetTriSubface_Static(ornt[2], 0); /* A */ 1348b5da9499SMatthew G. Knepley orntNew[2] = ornt[2]; 1349b5da9499SMatthew G. Knepley coneNew[3] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 0; 1350b5da9499SMatthew G. Knepley orntNew[3] = 0; 1351b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+0, coneNew);CHKERRQ(ierr); 1352b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+0, orntNew);CHKERRQ(ierr); 1353b5da9499SMatthew G. Knepley #if 1 1354b5da9499SMatthew G. Knepley if ((newp+0 < cStartNew) || (newp+0 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+0, cStartNew, cEndNew); 1355b5da9499SMatthew G. Knepley for (p = 0; p < 4; ++p) { 1356b5da9499SMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 1357b5da9499SMatthew G. Knepley } 1358b5da9499SMatthew G. Knepley #endif 1359b5da9499SMatthew G. Knepley /* B tetrahedron: {a, 1, b, e} */ 1360518a8359SMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*4 + GetTriSubface_Static(ornt[0], 1); /* B */ 1361b5da9499SMatthew G. Knepley orntNew[0] = ornt[0]; 1362518a8359SMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*4 + GetTriSubface_Static(ornt[1], 2); /* C */ 1363b5da9499SMatthew G. Knepley orntNew[1] = ornt[1]; 1364b5da9499SMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 1; 1365b5da9499SMatthew G. Knepley orntNew[2] = 0; 1366518a8359SMatthew G. Knepley coneNew[3] = fStartNew + (cone[3] - fStart)*4 + GetTriSubface_Static(ornt[3], 1); /* B */ 1367b5da9499SMatthew G. Knepley orntNew[3] = ornt[3]; 1368b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+1, coneNew);CHKERRQ(ierr); 1369b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+1, orntNew);CHKERRQ(ierr); 1370b5da9499SMatthew G. Knepley #if 1 1371b5da9499SMatthew G. Knepley if ((newp+1 < cStartNew) || (newp+1 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+1, cStartNew, cEndNew); 1372b5da9499SMatthew G. Knepley for (p = 0; p < 4; ++p) { 1373b5da9499SMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 1374b5da9499SMatthew G. Knepley } 1375b5da9499SMatthew G. Knepley #endif 1376b5da9499SMatthew G. Knepley /* C tetrahedron: {c, b, 2, f} */ 1377518a8359SMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*4 + GetTriSubface_Static(ornt[0], 2); /* C */ 1378b5da9499SMatthew G. Knepley orntNew[0] = ornt[0]; 1379b5da9499SMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 2; 1380b5da9499SMatthew G. Knepley orntNew[1] = 0; 1381518a8359SMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*4 + GetTriSubface_Static(ornt[2], 1); /* B */ 1382b5da9499SMatthew G. Knepley orntNew[2] = ornt[2]; 1383518a8359SMatthew G. Knepley coneNew[3] = fStartNew + (cone[3] - fStart)*4 + GetTriSubface_Static(ornt[3], 0); /* A */ 1384b5da9499SMatthew G. Knepley orntNew[3] = ornt[3]; 1385b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+2, coneNew);CHKERRQ(ierr); 1386b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+2, orntNew);CHKERRQ(ierr); 1387b5da9499SMatthew G. Knepley #if 1 1388b5da9499SMatthew G. Knepley if ((newp+2 < cStartNew) || (newp+2 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+2, cStartNew, cEndNew); 1389b5da9499SMatthew G. Knepley for (p = 0; p < 4; ++p) { 1390b5da9499SMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 1391b5da9499SMatthew G. Knepley } 1392b5da9499SMatthew G. Knepley #endif 1393b5da9499SMatthew G. Knepley /* D tetrahedron: {d, e, f, 3} */ 1394b5da9499SMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 3; 1395b5da9499SMatthew G. Knepley orntNew[0] = 0; 1396518a8359SMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*4 + GetTriSubface_Static(ornt[1], 1); /* B */ 1397b5da9499SMatthew G. Knepley orntNew[1] = ornt[1]; 1398518a8359SMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*4 + GetTriSubface_Static(ornt[2], 2); /* C */ 1399b5da9499SMatthew G. Knepley orntNew[2] = ornt[2]; 1400518a8359SMatthew G. Knepley coneNew[3] = fStartNew + (cone[3] - fStart)*4 + GetTriSubface_Static(ornt[3], 2); /* C */ 1401b5da9499SMatthew G. Knepley orntNew[3] = ornt[3]; 1402b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+3, coneNew);CHKERRQ(ierr); 1403b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+3, orntNew);CHKERRQ(ierr); 1404b5da9499SMatthew G. Knepley #if 1 1405b5da9499SMatthew G. Knepley if ((newp+3 < cStartNew) || (newp+3 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+3, cStartNew, cEndNew); 1406b5da9499SMatthew G. Knepley for (p = 0; p < 4; ++p) { 1407b5da9499SMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 1408b5da9499SMatthew G. Knepley } 1409b5da9499SMatthew G. Knepley #endif 1410b5da9499SMatthew G. Knepley /* A' tetrahedron: {d, a, c, f} */ 1411b5da9499SMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 0; 1412b5da9499SMatthew G. Knepley orntNew[0] = -3; 1413b5da9499SMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 4; 1414b5da9499SMatthew G. Knepley orntNew[1] = 0; 1415b5da9499SMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*4 + 3; 1416b5da9499SMatthew G. Knepley orntNew[2] = ornt[2] < 0 ? -((-(ornt[2]+1)+2)%3+1) : (ornt[2]+2)%3; 1417b5da9499SMatthew G. Knepley coneNew[3] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 5; 1418b5da9499SMatthew G. Knepley orntNew[3] = 0; 1419b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+4, coneNew);CHKERRQ(ierr); 1420b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+4, orntNew);CHKERRQ(ierr); 1421b5da9499SMatthew G. Knepley #if 1 1422b5da9499SMatthew G. Knepley if ((newp+4 < cStartNew) || (newp+4 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+4, cStartNew, cEndNew); 1423b5da9499SMatthew G. Knepley for (p = 0; p < 4; ++p) { 1424b5da9499SMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 1425b5da9499SMatthew G. Knepley } 1426b5da9499SMatthew G. Knepley #endif 1427b5da9499SMatthew G. Knepley /* B' tetrahedron: {e, b, a, f} */ 1428b5da9499SMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 1; 1429b5da9499SMatthew G. Knepley orntNew[0] = -3; 1430b5da9499SMatthew G. Knepley coneNew[1] = fStartNew + (cone[3] - fStart)*4 + 3; 1431b5da9499SMatthew G. Knepley orntNew[1] = ornt[3] < 0 ? -((-(ornt[3]+1)+1)%3+1) : (ornt[3]+1)%3; 1432b5da9499SMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 6; 1433b5da9499SMatthew G. Knepley orntNew[2] = 0; 1434b5da9499SMatthew G. Knepley coneNew[3] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 7; 1435b5da9499SMatthew G. Knepley orntNew[3] = 0; 1436b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+5, coneNew);CHKERRQ(ierr); 1437b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+5, orntNew);CHKERRQ(ierr); 1438b5da9499SMatthew G. Knepley #if 1 1439b5da9499SMatthew G. Knepley if ((newp+5 < cStartNew) || (newp+5 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+5, cStartNew, cEndNew); 1440b5da9499SMatthew G. Knepley for (p = 0; p < 4; ++p) { 1441b5da9499SMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 1442b5da9499SMatthew G. Knepley } 1443b5da9499SMatthew G. Knepley #endif 1444b5da9499SMatthew G. Knepley /* C' tetrahedron: {b, f, c, a} */ 1445b5da9499SMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 2; 1446b5da9499SMatthew G. Knepley orntNew[0] = -3; 1447b5da9499SMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 7; 1448b5da9499SMatthew G. Knepley orntNew[1] = -2; 1449b5da9499SMatthew G. Knepley coneNew[2] = fStartNew + (cone[0] - fStart)*4 + 3; 1450b5da9499SMatthew G. Knepley orntNew[2] = ornt[0] < 0 ? (-(ornt[0]+1)+1)%3 : -((ornt[0]+1)%3+1); 1451b5da9499SMatthew G. Knepley coneNew[3] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 5; 1452b5da9499SMatthew G. Knepley orntNew[3] = -1; 1453b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+6, coneNew);CHKERRQ(ierr); 1454b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+6, orntNew);CHKERRQ(ierr); 1455b5da9499SMatthew G. Knepley #if 1 1456b5da9499SMatthew G. Knepley if ((newp+6 < cStartNew) || (newp+6 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+6, cStartNew, cEndNew); 1457b5da9499SMatthew G. Knepley for (p = 0; p < 4; ++p) { 1458b5da9499SMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 1459b5da9499SMatthew G. Knepley } 1460b5da9499SMatthew G. Knepley #endif 1461b5da9499SMatthew G. Knepley /* D' tetrahedron: {f, e, d, a} */ 1462b5da9499SMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 3; 1463b5da9499SMatthew G. Knepley orntNew[0] = -3; 1464b5da9499SMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 6; 1465b5da9499SMatthew G. Knepley orntNew[1] = -3; 1466b5da9499SMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 4; 1467b5da9499SMatthew G. Knepley orntNew[2] = -2; 1468b5da9499SMatthew G. Knepley coneNew[3] = fStartNew + (cone[1] - fStart)*4 + 3; 1469b5da9499SMatthew G. Knepley orntNew[3] = ornt[2]; 1470b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+7, coneNew);CHKERRQ(ierr); 1471b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+7, orntNew);CHKERRQ(ierr); 1472b5da9499SMatthew G. Knepley #if 1 1473b5da9499SMatthew G. Knepley if ((newp+7 < cStartNew) || (newp+7 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+7, cStartNew, cEndNew); 1474b5da9499SMatthew G. Knepley for (p = 0; p < 4; ++p) { 1475b5da9499SMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 1476b5da9499SMatthew G. Knepley } 1477b5da9499SMatthew G. Knepley #endif 1478b5da9499SMatthew G. Knepley } 1479b5da9499SMatthew G. Knepley /* Split faces have 3 edges and the same cells as the parent */ 1480b5da9499SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, NULL, &maxSupportSize);CHKERRQ(ierr); 1481b5da9499SMatthew G. Knepley ierr = PetscMalloc((2 + maxSupportSize*2) * sizeof(PetscInt), &supportRef);CHKERRQ(ierr); 1482b5da9499SMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 1483b5da9499SMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*4; 1484b5da9499SMatthew G. Knepley const PetscInt *cone, *ornt, *support; 1485b5da9499SMatthew G. Knepley PetscInt coneNew[3], orntNew[3], coneSize, supportSize, s; 1486b5da9499SMatthew G. Knepley 1487b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, f, &cone);CHKERRQ(ierr); 1488b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, f, &ornt);CHKERRQ(ierr); 1489b5da9499SMatthew G. Knepley /* A triangle */ 1490b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (cone[0] - eStart)*2 + (ornt[0] < 0 ? 1 : 0); 1491b5da9499SMatthew G. Knepley orntNew[0] = ornt[0]; 1492b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (f - fStart)*3 + 2; 1493b5da9499SMatthew G. Knepley orntNew[1] = -2; 1494b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (cone[2] - eStart)*2 + (ornt[2] < 0 ? 0 : 1); 1495b5da9499SMatthew G. Knepley orntNew[2] = ornt[2]; 1496b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+0, coneNew);CHKERRQ(ierr); 1497b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+0, orntNew);CHKERRQ(ierr); 1498b5da9499SMatthew G. Knepley #if 1 1499b5da9499SMatthew G. Knepley if ((newp+0 < fStartNew) || (newp+0 >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp+0, fStartNew, fEndNew); 1500b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1501b5da9499SMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eEndNew); 1502b5da9499SMatthew G. Knepley } 1503b5da9499SMatthew G. Knepley #endif 1504b5da9499SMatthew G. Knepley /* B triangle */ 1505b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (cone[0] - eStart)*2 + (ornt[0] < 0 ? 0 : 1); 1506b5da9499SMatthew G. Knepley orntNew[0] = ornt[0]; 1507b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (cone[1] - eStart)*2 + (ornt[1] < 0 ? 1 : 0); 1508b5da9499SMatthew G. Knepley orntNew[1] = ornt[1]; 1509b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (f - fStart)*3 + 0; 1510b5da9499SMatthew G. Knepley orntNew[2] = -2; 1511b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+1, coneNew);CHKERRQ(ierr); 1512b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+1, orntNew);CHKERRQ(ierr); 1513b5da9499SMatthew G. Knepley #if 1 1514b5da9499SMatthew G. Knepley if ((newp+1 < fStartNew) || (newp+1 >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp+1, fStartNew, fEndNew); 1515b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1516b5da9499SMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eEndNew); 1517b5da9499SMatthew G. Knepley } 1518b5da9499SMatthew G. Knepley #endif 1519b5da9499SMatthew G. Knepley /* C triangle */ 1520b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (f - fStart)*3 + 1; 1521b5da9499SMatthew G. Knepley orntNew[0] = -2; 1522b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (cone[1] - eStart)*2 + (ornt[1] < 0 ? 0 : 1); 1523b5da9499SMatthew G. Knepley orntNew[1] = ornt[1]; 1524b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (cone[2] - eStart)*2 + (ornt[2] < 0 ? 1 : 0); 1525b5da9499SMatthew G. Knepley orntNew[2] = ornt[2]; 1526b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+2, coneNew);CHKERRQ(ierr); 1527b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+2, orntNew);CHKERRQ(ierr); 1528b5da9499SMatthew G. Knepley #if 1 1529b5da9499SMatthew G. Knepley if ((newp+2 < fStartNew) || (newp+2 >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp+2, fStartNew, fEndNew); 1530b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1531b5da9499SMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eEndNew); 1532b5da9499SMatthew G. Knepley } 1533b5da9499SMatthew G. Knepley #endif 1534b5da9499SMatthew G. Knepley /* D triangle */ 1535b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (f - fStart)*3 + 0; 1536b5da9499SMatthew G. Knepley orntNew[0] = 0; 1537b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (f - fStart)*3 + 1; 1538b5da9499SMatthew G. Knepley orntNew[1] = 0; 1539b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (f - fStart)*3 + 2; 1540b5da9499SMatthew G. Knepley orntNew[2] = 0; 1541b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+3, coneNew);CHKERRQ(ierr); 1542b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+3, orntNew);CHKERRQ(ierr); 1543b5da9499SMatthew G. Knepley #if 1 1544b5da9499SMatthew G. Knepley if ((newp+3 < fStartNew) || (newp+3 >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp+3, fStartNew, fEndNew); 1545b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1546b5da9499SMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eEndNew); 1547b5da9499SMatthew G. Knepley } 1548b5da9499SMatthew G. Knepley #endif 1549b5da9499SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 1550b5da9499SMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 1551b5da9499SMatthew G. Knepley for (r = 0; r < 4; ++r) { 1552b5da9499SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 1553b5da9499SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1554b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1555b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 1556b5da9499SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 1557b5da9499SMatthew G. Knepley if (cone[c] == f) break; 1558b5da9499SMatthew G. Knepley } 1559b5da9499SMatthew G. Knepley supportRef[s] = cStartNew + (support[s] - cStart)*8 + (r==3 ? (c+2)%4 + 4 : (ornt[c] < 0 ? faces[c*3+(-(ornt[c]+1)+1+3-r)%3] : faces[c*3+r])); 1560b5da9499SMatthew G. Knepley } 1561b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp+r, supportRef);CHKERRQ(ierr); 1562b5da9499SMatthew G. Knepley #if 1 1563b5da9499SMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 1564b5da9499SMatthew G. Knepley for (p = 0; p < supportSize; ++p) { 1565b5da9499SMatthew G. Knepley if ((supportRef[p] < cStartNew) || (supportRef[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportRef[p], cStartNew, cEndNew); 1566b5da9499SMatthew G. Knepley } 1567b5da9499SMatthew G. Knepley #endif 1568b5da9499SMatthew G. Knepley } 1569b5da9499SMatthew G. Knepley } 1570b5da9499SMatthew G. Knepley /* Interior faces have 3 edges and 2 cells */ 1571b5da9499SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 1572b5da9499SMatthew G. Knepley PetscInt newp = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8; 1573b5da9499SMatthew G. Knepley const PetscInt *cone, *ornt; 1574b5da9499SMatthew G. Knepley PetscInt coneNew[3], orntNew[3]; 1575b5da9499SMatthew G. Knepley PetscInt supportNew[2]; 1576b5da9499SMatthew G. Knepley 1577b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1578b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 1579b5da9499SMatthew G. Knepley /* Face A: {c, a, d} */ 1580b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[0] - fStart)*3 + (ornt[0] < 0 ? (-(ornt[0]+1)+0)%3 : (ornt[0]+2)%3); 1581b5da9499SMatthew G. Knepley orntNew[0] = ornt[0] < 0 ? -2 : 0; 1582b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[1] - fStart)*3 + (ornt[1] < 0 ? (-(ornt[1]+1)+0)%3 : (ornt[1]+2)%3); 1583b5da9499SMatthew G. Knepley orntNew[1] = ornt[1] < 0 ? -2 : 0; 1584b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (cone[2] - fStart)*3 + (ornt[2] < 0 ? (-(ornt[2]+1)+0)%3 : (ornt[2]+2)%3); 1585b5da9499SMatthew G. Knepley orntNew[2] = ornt[2] < 0 ? -2 : 0; 1586b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 1587b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 1588b5da9499SMatthew G. Knepley #if 1 1589b5da9499SMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 1590b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1591b5da9499SMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eEndNew); 1592b5da9499SMatthew G. Knepley } 1593b5da9499SMatthew G. Knepley #endif 1594b5da9499SMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 0; 1595b5da9499SMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 0+4; 1596b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 1597b5da9499SMatthew G. Knepley #if 1 1598b5da9499SMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 1599b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 1600b5da9499SMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cEndNew); 1601b5da9499SMatthew G. Knepley } 1602b5da9499SMatthew G. Knepley #endif 1603b5da9499SMatthew G. Knepley ++newp; 1604b5da9499SMatthew G. Knepley /* Face B: {a, b, e} */ 1605b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[0] - fStart)*3 + (ornt[0] < 0 ? (-(ornt[0]+1)+2)%3 : (ornt[0]+0)%3); 1606b5da9499SMatthew G. Knepley orntNew[0] = ornt[0] < 0 ? -2 : 0; 1607b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[3] - fStart)*3 + (ornt[3] < 0 ? (-(ornt[3]+1)+2)%3 : (ornt[3]+0)%3); 1608b5da9499SMatthew G. Knepley orntNew[1] = ornt[3] < 0 ? -2 : 0; 1609b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (cone[1] - fStart)*3 + (ornt[1] < 0 ? (-(ornt[1]+1)+1)%3 : (ornt[1]+1)%3); 1610b5da9499SMatthew G. Knepley orntNew[2] = ornt[1] < 0 ? -2 : 0; 1611b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 1612b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 1613b5da9499SMatthew G. Knepley #if 1 1614b5da9499SMatthew G. Knepley if ((newp+1 < fStartNew) || (newp+1 >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp+1, fStartNew, fEndNew); 1615b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1616b5da9499SMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eEndNew); 1617b5da9499SMatthew G. Knepley } 1618b5da9499SMatthew G. Knepley #endif 1619b5da9499SMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 1; 1620b5da9499SMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 1+4; 1621b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 1622b5da9499SMatthew G. Knepley #if 1 1623b5da9499SMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 1624b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 1625b5da9499SMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cEndNew); 1626b5da9499SMatthew G. Knepley } 1627b5da9499SMatthew G. Knepley #endif 1628b5da9499SMatthew G. Knepley ++newp; 1629b5da9499SMatthew G. Knepley /* Face C: {c, f, b} */ 1630b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[2] - fStart)*3 + (ornt[2] < 0 ? (-(ornt[2]+1)+2)%3 : (ornt[2]+0)%3); 1631b5da9499SMatthew G. Knepley orntNew[0] = ornt[2] < 0 ? -2 : 0; 1632b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[3] - fStart)*3 + (ornt[3] < 0 ? (-(ornt[3]+1)+0)%3 : (ornt[3]+2)%3); 1633b5da9499SMatthew G. Knepley orntNew[1] = ornt[3] < 0 ? -2 : 0; 1634b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (cone[0] - fStart)*3 + (ornt[0] < 0 ? (-(ornt[0]+1)+1)%3 : (ornt[0]+1)%3); 1635b5da9499SMatthew G. Knepley orntNew[2] = ornt[0] < 0 ? -2 : 0; 1636b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 1637b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 1638b5da9499SMatthew G. Knepley #if 1 1639b5da9499SMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 1640b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1641b5da9499SMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eEndNew); 1642b5da9499SMatthew G. Knepley } 1643b5da9499SMatthew G. Knepley #endif 1644b5da9499SMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 2; 1645b5da9499SMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 2+4; 1646b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 1647b5da9499SMatthew G. Knepley #if 1 1648b5da9499SMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 1649b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 1650b5da9499SMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cEndNew); 1651b5da9499SMatthew G. Knepley } 1652b5da9499SMatthew G. Knepley #endif 1653b5da9499SMatthew G. Knepley ++newp; 1654b5da9499SMatthew G. Knepley /* Face D: {d, e, f} */ 1655b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[1] - fStart)*3 + (ornt[1] < 0 ? (-(ornt[1]+1)+2)%3 : (ornt[1]+0)%3); 1656b5da9499SMatthew G. Knepley orntNew[0] = ornt[1] < 0 ? -2 : 0; 1657b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[3] - fStart)*3 + (ornt[3] < 0 ? (-(ornt[3]+1)+1)%3 : (ornt[3]+1)%3); 1658b5da9499SMatthew G. Knepley orntNew[1] = ornt[3] < 0 ? -2 : 0; 1659b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (cone[2] - fStart)*3 + (ornt[2] < 0 ? (-(ornt[2]+1)+1)%3 : (ornt[2]+1)%3); 1660b5da9499SMatthew G. Knepley orntNew[2] = ornt[2] < 0 ? -2 : 0; 1661b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 1662b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 1663b5da9499SMatthew G. Knepley #if 1 1664b5da9499SMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 1665b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1666b5da9499SMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eEndNew); 1667b5da9499SMatthew G. Knepley } 1668b5da9499SMatthew G. Knepley #endif 1669b5da9499SMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 3; 1670b5da9499SMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 3+4; 1671b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 1672b5da9499SMatthew G. Knepley #if 1 1673b5da9499SMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 1674b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 1675b5da9499SMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cEndNew); 1676b5da9499SMatthew G. Knepley } 1677b5da9499SMatthew G. Knepley #endif 1678b5da9499SMatthew G. Knepley ++newp; 1679b5da9499SMatthew G. Knepley /* Face E: {d, f, a} */ 1680b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[2] - fStart)*3 + (ornt[2] < 0 ? (-(ornt[2]+1)+1)%3 : (ornt[2]+1)%3); 1681b5da9499SMatthew G. Knepley orntNew[0] = ornt[2] < 0 ? 0 : -2; 1682b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*3 + (c - cStart); 1683b5da9499SMatthew G. Knepley orntNew[1] = 0; 1684b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (cone[1] - fStart)*3 + (ornt[1] < 0 ? (-(ornt[1]+1)+0)%3 : (ornt[1]+2)%3); 1685b5da9499SMatthew G. Knepley orntNew[2] = ornt[1] < 0 ? -2 : 0; 1686b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 1687b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 1688b5da9499SMatthew G. Knepley #if 1 1689b5da9499SMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 1690b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1691b5da9499SMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eEndNew); 1692b5da9499SMatthew G. Knepley } 1693b5da9499SMatthew G. Knepley #endif 1694b5da9499SMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 0+4; 1695b5da9499SMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 3+4; 1696b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 1697b5da9499SMatthew G. Knepley #if 1 1698b5da9499SMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 1699b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 1700b5da9499SMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cEndNew); 1701b5da9499SMatthew G. Knepley } 1702b5da9499SMatthew G. Knepley #endif 1703b5da9499SMatthew G. Knepley ++newp; 1704b5da9499SMatthew G. Knepley /* Face F: {c, a, f} */ 1705b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[0] - fStart)*3 + (ornt[0] < 0 ? (-(ornt[0]+1)+0)%3 : (ornt[0]+2)%3); 1706b5da9499SMatthew G. Knepley orntNew[0] = ornt[0] < 0 ? -2 : 0; 1707b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*3 + (c - cStart); 1708b5da9499SMatthew G. Knepley orntNew[1] = -2; 1709b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (cone[2] - fStart)*3 + (ornt[2] < 0 ? (-(ornt[2]+1)+2)%3 : (ornt[2]+0)%3); 1710b5da9499SMatthew G. Knepley orntNew[2] = ornt[1] < 0 ? 0 : -2; 1711b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 1712b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 1713b5da9499SMatthew G. Knepley #if 1 1714b5da9499SMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 1715b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1716b5da9499SMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eEndNew); 1717b5da9499SMatthew G. Knepley } 1718b5da9499SMatthew G. Knepley #endif 1719b5da9499SMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 0+4; 1720b5da9499SMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 2+4; 1721b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 1722b5da9499SMatthew G. Knepley #if 1 1723b5da9499SMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 1724b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 1725b5da9499SMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cEndNew); 1726b5da9499SMatthew G. Knepley } 1727b5da9499SMatthew G. Knepley #endif 1728b5da9499SMatthew G. Knepley ++newp; 1729b5da9499SMatthew G. Knepley /* Face G: {e, a, f} */ 1730b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[1] - fStart)*3 + (ornt[1] < 0 ? (-(ornt[1]+1)+1)%3 : (ornt[1]+1)%3); 1731b5da9499SMatthew G. Knepley orntNew[0] = ornt[1] < 0 ? -2 : 0; 1732b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*3 + (c - cStart); 1733b5da9499SMatthew G. Knepley orntNew[1] = -2; 1734b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (cone[3] - fStart)*3 + (ornt[3] < 0 ? (-(ornt[3]+1)+1)%3 : (ornt[3]+1)%3); 1735b5da9499SMatthew G. Knepley orntNew[2] = ornt[3] < 0 ? 0 : -2; 1736b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 1737b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 1738b5da9499SMatthew G. Knepley #if 1 1739b5da9499SMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 1740b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1741b5da9499SMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eEndNew); 1742b5da9499SMatthew G. Knepley } 1743b5da9499SMatthew G. Knepley #endif 1744b5da9499SMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 1+4; 1745b5da9499SMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 3+4; 1746b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 1747b5da9499SMatthew G. Knepley #if 1 1748b5da9499SMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 1749b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 1750b5da9499SMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cEndNew); 1751b5da9499SMatthew G. Knepley } 1752b5da9499SMatthew G. Knepley #endif 1753b5da9499SMatthew G. Knepley ++newp; 1754b5da9499SMatthew G. Knepley /* Face H: {a, b, f} */ 1755b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[0] - fStart)*3 + (ornt[0] < 0 ? (-(ornt[0]+1)+2)%3 : (ornt[0]+0)%3); 1756b5da9499SMatthew G. Knepley orntNew[0] = ornt[0] < 0 ? -2 : 0; 1757b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[3] - fStart)*3 + (ornt[3] < 0 ? (-(ornt[3]+1)+0)%3 : (ornt[3]+2)%3); 1758b5da9499SMatthew G. Knepley orntNew[1] = ornt[3] < 0 ? 0 : -2; 1759b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*3 + (c - cStart); 1760b5da9499SMatthew G. Knepley orntNew[2] = 0; 1761b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 1762b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 1763b5da9499SMatthew G. Knepley #if 1 1764b5da9499SMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 1765b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1766b5da9499SMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eEndNew); 1767b5da9499SMatthew G. Knepley } 1768b5da9499SMatthew G. Knepley #endif 1769b5da9499SMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 1+4; 1770b5da9499SMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 2+4; 1771b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 1772b5da9499SMatthew G. Knepley #if 1 1773b5da9499SMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 1774b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 1775b5da9499SMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cEndNew); 1776b5da9499SMatthew G. Knepley } 1777b5da9499SMatthew G. Knepley #endif 1778b5da9499SMatthew G. Knepley ++newp; 1779b5da9499SMatthew G. Knepley } 1780b5da9499SMatthew G. Knepley /* Split Edges have 2 vertices and the same faces as the parent */ 1781b5da9499SMatthew G. Knepley for (e = eStart; e < eEnd; ++e) { 1782b5da9499SMatthew G. Knepley const PetscInt newv = vStartNew + (vEnd - vStart) + (e - eStart); 1783b5da9499SMatthew G. Knepley 1784b5da9499SMatthew G. Knepley for (r = 0; r < 2; ++r) { 1785b5da9499SMatthew G. Knepley const PetscInt newp = eStartNew + (e - eStart)*2 + r; 1786b5da9499SMatthew G. Knepley const PetscInt *cone, *ornt, *support; 1787b5da9499SMatthew G. Knepley PetscInt coneNew[2], coneSize, c, supportSize, s; 1788b5da9499SMatthew G. Knepley 1789b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 1790b5da9499SMatthew G. Knepley coneNew[0] = vStartNew + (cone[0] - vStart); 1791b5da9499SMatthew G. Knepley coneNew[1] = vStartNew + (cone[1] - vStart); 1792b5da9499SMatthew G. Knepley coneNew[(r+1)%2] = newv; 1793b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 1794b5da9499SMatthew G. Knepley #if 1 1795b5da9499SMatthew G. Knepley if ((newp < eStartNew) || (newp >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", newp, eStartNew, eEndNew); 1796b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 1797b5da9499SMatthew G. Knepley if ((coneNew[p] < vStartNew) || (coneNew[p] >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", coneNew[p], vStartNew, vEndNew); 1798b5da9499SMatthew G. Knepley } 1799b5da9499SMatthew G. Knepley #endif 1800b5da9499SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &supportSize);CHKERRQ(ierr); 1801b5da9499SMatthew G. Knepley ierr = DMPlexGetSupport(dm, e, &support);CHKERRQ(ierr); 1802b5da9499SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 1803b5da9499SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1804b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1805b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 1806b5da9499SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 1807b5da9499SMatthew G. Knepley if (cone[c] == e) break; 1808b5da9499SMatthew G. Knepley } 1809b5da9499SMatthew G. Knepley supportRef[s] = fStartNew + (support[s] - fStart)*4 + (c + (ornt[c] < 0 ? 1-r : r))%3; 1810b5da9499SMatthew G. Knepley } 1811b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 1812b5da9499SMatthew G. Knepley #if 1 1813b5da9499SMatthew G. Knepley if ((newp < eStartNew) || (newp >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", newp, eStartNew, eEndNew); 1814b5da9499SMatthew G. Knepley for (p = 0; p < supportSize; ++p) { 1815b5da9499SMatthew G. Knepley if ((supportRef[p] < fStartNew) || (supportRef[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", supportRef[p], fStartNew, fEndNew); 1816b5da9499SMatthew G. Knepley } 1817b5da9499SMatthew G. Knepley #endif 1818b5da9499SMatthew G. Knepley } 1819b5da9499SMatthew G. Knepley } 182086f0afeeSMatthew G. Knepley /* Face edges have 2 vertices and 2+cells*(1/2) faces */ 1821b5da9499SMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 1822b5da9499SMatthew G. Knepley const PetscInt *cone, *ornt, *support; 1823b5da9499SMatthew G. Knepley PetscInt coneSize, supportSize, s; 1824b5da9499SMatthew G. Knepley 1825b5da9499SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 1826b5da9499SMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 1827b5da9499SMatthew G. Knepley for (r = 0; r < 3; ++r) { 1828b5da9499SMatthew G. Knepley const PetscInt newp = eStartNew + (eEnd - eStart)*2 + (f - fStart)*3 + r; 1829b5da9499SMatthew G. Knepley PetscInt coneNew[2], intFaces = 0, er, eint[4] = {1, 0, 2, 0}; 1830b5da9499SMatthew G. Knepley PetscInt fint[24] = { 1, 7, -1, -1, 0, 5, 1831b5da9499SMatthew G. Knepley -1, -1, 1, 6, 0, 4, 1832b5da9499SMatthew G. Knepley 2, 5, 3, 4, -1, -1, 1833b5da9499SMatthew G. Knepley -1, -1, 3, 6, 2, 7}; 1834b5da9499SMatthew G. Knepley 1835b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, f, &cone);CHKERRQ(ierr); 1836b5da9499SMatthew G. Knepley coneNew[0] = vStartNew + (vEnd - vStart) + (cone[(r+0)%3] - eStart); 1837b5da9499SMatthew G. Knepley coneNew[1] = vStartNew + (vEnd - vStart) + (cone[(r+1)%3] - eStart); 1838b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 1839b5da9499SMatthew G. Knepley #if 1 1840b5da9499SMatthew G. Knepley if ((newp < eStartNew) || (newp >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", newp, eStartNew, eEndNew); 1841b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 1842b5da9499SMatthew G. Knepley if ((coneNew[p] < vStartNew) || (coneNew[p] >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", coneNew[p], vStartNew, vEndNew); 1843b5da9499SMatthew G. Knepley } 1844b5da9499SMatthew G. Knepley #endif 1845b5da9499SMatthew G. Knepley supportRef[0] = fStartNew + (f - fStart)*4 + (r+1)%3; 1846b5da9499SMatthew G. Knepley supportRef[1] = fStartNew + (f - fStart)*4 + 3; 1847b5da9499SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 1848b5da9499SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1849b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1850b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 1851b5da9499SMatthew G. Knepley for (c = 0; c < coneSize; ++c) {if (cone[c] == f) break;} 185286f0afeeSMatthew G. Knepley /* Here we want to determine whether edge newp contains a vertex which is part of the cross-tet edge */ 185386f0afeeSMatthew G. Knepley er = ornt[c] < 0 ? (-(ornt[c]+1) + 2-r)%3 : (ornt[c] + r)%3; 1854b5da9499SMatthew G. Knepley if (er == eint[c]) { 1855b5da9499SMatthew G. Knepley supportRef[2+intFaces++] = fStartNew + (fEnd - fStart)*4 + (support[s] - cStart)*8 + (c + 2)%4; 1856b5da9499SMatthew G. Knepley } else { 1857b5da9499SMatthew G. Knepley supportRef[2+intFaces++] = fStartNew + (fEnd - fStart)*4 + (support[s] - cStart)*8 + fint[(c*3 + er)*2 + 0]; 1858b5da9499SMatthew G. Knepley supportRef[2+intFaces++] = fStartNew + (fEnd - fStart)*4 + (support[s] - cStart)*8 + fint[(c*3 + er)*2 + 1]; 1859b5da9499SMatthew G. Knepley } 1860b5da9499SMatthew G. Knepley } 1861b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 1862b5da9499SMatthew G. Knepley #if 1 1863b5da9499SMatthew G. Knepley if ((newp < eStartNew) || (newp >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", newp, eStartNew, eEndNew); 1864b5da9499SMatthew G. Knepley for (p = 0; p < intFaces; ++p) { 1865b5da9499SMatthew G. Knepley if ((supportRef[p] < fStartNew) || (supportRef[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", supportRef[p], fStartNew, fEndNew); 1866b5da9499SMatthew G. Knepley } 1867b5da9499SMatthew G. Knepley #endif 1868b5da9499SMatthew G. Knepley } 1869b5da9499SMatthew G. Knepley } 1870b5da9499SMatthew G. Knepley /* Interior edges have 2 vertices and 4 faces */ 1871b5da9499SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 1872b5da9499SMatthew G. Knepley const PetscInt newp = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*3 + (c - cStart); 1873b5da9499SMatthew G. Knepley const PetscInt *cone, *ornt, *fcone; 18744a40f731SMatthew G. Knepley PetscInt coneNew[2], supportNew[4], find; 1875b5da9499SMatthew G. Knepley 1876b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1877b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 1878b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[0], &fcone);CHKERRQ(ierr); 187942525629SMatthew G. Knepley find = GetTriEdge_Static(ornt[0], 0); 1880b5da9499SMatthew G. Knepley coneNew[0] = vStartNew + (vEnd - vStart) + (fcone[find] - eStart); 1881b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[2], &fcone);CHKERRQ(ierr); 188242525629SMatthew G. Knepley find = GetTriEdge_Static(ornt[2], 1); 1883b5da9499SMatthew G. Knepley coneNew[1] = vStartNew + (vEnd - vStart) + (fcone[find] - eStart); 1884b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 1885b5da9499SMatthew G. Knepley #if 1 1886b5da9499SMatthew G. Knepley if ((newp < eStartNew) || (newp >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", newp, eStartNew, eEndNew); 1887b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 1888b5da9499SMatthew G. Knepley if ((coneNew[p] < vStartNew) || (coneNew[p] >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", coneNew[p], vStartNew, vEndNew); 1889b5da9499SMatthew G. Knepley } 1890b5da9499SMatthew G. Knepley #endif 1891b5da9499SMatthew G. Knepley supportNew[0] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 4; 1892b5da9499SMatthew G. Knepley supportNew[1] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 5; 1893b5da9499SMatthew G. Knepley supportNew[2] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 6; 1894b5da9499SMatthew G. Knepley supportNew[3] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 7; 1895b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 1896b5da9499SMatthew G. Knepley #if 1 1897b5da9499SMatthew G. Knepley if ((newp < eStartNew) || (newp >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", newp, eStartNew, eEndNew); 1898b5da9499SMatthew G. Knepley for (p = 0; p < 4; ++p) { 1899b5da9499SMatthew G. Knepley if ((supportNew[p] < fStartNew) || (supportNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", supportNew[p], fStartNew, fEndNew); 1900b5da9499SMatthew G. Knepley } 1901b5da9499SMatthew G. Knepley #endif 1902b5da9499SMatthew G. Knepley } 1903b5da9499SMatthew G. Knepley /* Old vertices have identical supports */ 1904b5da9499SMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 1905b5da9499SMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 1906b5da9499SMatthew G. Knepley const PetscInt *support, *cone; 1907b5da9499SMatthew G. Knepley PetscInt size, s; 1908b5da9499SMatthew G. Knepley 1909b5da9499SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 1910b5da9499SMatthew G. Knepley ierr = DMPlexGetSupport(dm, v, &support);CHKERRQ(ierr); 1911b5da9499SMatthew G. Knepley for (s = 0; s < size; ++s) { 1912b5da9499SMatthew G. Knepley PetscInt r = 0; 1913b5da9499SMatthew G. Knepley 1914b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1915b5da9499SMatthew G. Knepley if (cone[1] == v) r = 1; 1916b5da9499SMatthew G. Knepley supportRef[s] = eStartNew + (support[s] - eStart)*2 + r; 1917b5da9499SMatthew G. Knepley } 1918b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 1919b5da9499SMatthew G. Knepley #if 1 1920b5da9499SMatthew G. Knepley if ((newp < vStartNew) || (newp >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", newp, vStartNew, vEndNew); 1921b5da9499SMatthew G. Knepley for (p = 0; p < size; ++p) { 1922b5da9499SMatthew G. Knepley if ((supportRef[p] < eStartNew) || (supportRef[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", supportRef[p], eStartNew, eEndNew); 1923b5da9499SMatthew G. Knepley } 1924b5da9499SMatthew G. Knepley #endif 1925b5da9499SMatthew G. Knepley } 1926b5da9499SMatthew G. Knepley /* Edge vertices have 2 + face*2 + 0/1 supports */ 1927b5da9499SMatthew G. Knepley for (e = eStart; e < eEnd; ++e) { 1928b5da9499SMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (e - eStart); 1929b5da9499SMatthew G. Knepley const PetscInt *cone, *support; 1930b5da9499SMatthew G. Knepley PetscInt *star = NULL, starSize, cellSize = 0, coneSize, size, s; 1931b5da9499SMatthew G. Knepley 1932b5da9499SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &size);CHKERRQ(ierr); 1933b5da9499SMatthew G. Knepley ierr = DMPlexGetSupport(dm, e, &support);CHKERRQ(ierr); 1934b5da9499SMatthew G. Knepley supportRef[0] = eStartNew + (e - eStart)*2 + 0; 1935b5da9499SMatthew G. Knepley supportRef[1] = eStartNew + (e - eStart)*2 + 1; 1936b5da9499SMatthew G. Knepley for (s = 0; s < size; ++s) { 1937b5da9499SMatthew G. Knepley PetscInt r = 0; 1938b5da9499SMatthew G. Knepley 1939b5da9499SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1940b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1941b5da9499SMatthew G. Knepley for (r = 0; r < coneSize; ++r) {if (cone[r] == e) break;} 1942b5da9499SMatthew G. Knepley supportRef[2+s*2+0] = eStartNew + (eEnd - eStart)*2 + (support[s] - fStart)*3 + (r+0)%3; 1943b5da9499SMatthew G. Knepley supportRef[2+s*2+1] = eStartNew + (eEnd - eStart)*2 + (support[s] - fStart)*3 + (r+2)%3; 1944b5da9499SMatthew G. Knepley } 1945b5da9499SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, e, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1946b5da9499SMatthew G. Knepley for (s = 0; s < starSize*2; s += 2) { 1947b5da9499SMatthew G. Knepley const PetscInt *cone, *ornt; 1948b5da9499SMatthew G. Knepley PetscInt e01, e23; 1949b5da9499SMatthew G. Knepley 1950b5da9499SMatthew G. Knepley if ((star[s] >= cStart) && (star[s] < cEnd)) { 1951b5da9499SMatthew G. Knepley /* Check edge 0-1 */ 1952b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, star[s], &cone);CHKERRQ(ierr); 1953b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, star[s], &ornt);CHKERRQ(ierr); 1954b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[0], &cone);CHKERRQ(ierr); 195542525629SMatthew G. Knepley e01 = cone[GetTriEdge_Static(ornt[0], 0)]; 1956b5da9499SMatthew G. Knepley /* Check edge 2-3 */ 1957b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, star[s], &cone);CHKERRQ(ierr); 1958b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, star[s], &ornt);CHKERRQ(ierr); 195942525629SMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[2], &cone);CHKERRQ(ierr); 196042525629SMatthew G. Knepley e23 = cone[GetTriEdge_Static(ornt[2], 1)]; 1961b5da9499SMatthew G. Knepley if ((e01 == e) || (e23 == e)) {supportRef[2+size*2+cellSize++] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*3 + (star[s] - cStart);} 1962b5da9499SMatthew G. Knepley } 1963b5da9499SMatthew G. Knepley } 1964b5da9499SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, e, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1965b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 1966b5da9499SMatthew G. Knepley #if 1 1967b5da9499SMatthew G. Knepley if ((newp < vStartNew) || (newp >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", newp, vStartNew, vEndNew); 1968b5da9499SMatthew G. Knepley for (p = 0; p < 2+size*2+cellSize; ++p) { 1969b5da9499SMatthew G. Knepley if ((supportRef[p] < eStartNew) || (supportRef[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", supportRef[p], eStartNew, eEndNew); 1970b5da9499SMatthew G. Knepley } 1971b5da9499SMatthew G. Knepley #endif 1972b5da9499SMatthew G. Knepley } 1973b5da9499SMatthew G. Knepley ierr = PetscFree(supportRef);CHKERRQ(ierr); 1974b5da9499SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, 3, cStart, NULL, NULL, &faces);CHKERRQ(ierr); 1975b5da9499SMatthew G. Knepley break; 19762eabf88fSMatthew G. Knepley case 6: 19772eabf88fSMatthew G. Knepley /* Hex 3D */ 19782eabf88fSMatthew G. Knepley /* 19792eabf88fSMatthew G. Knepley Bottom (viewed from top) Top 19802eabf88fSMatthew G. Knepley 1---------2---------2 7---------2---------6 19812eabf88fSMatthew G. Knepley | | | | | | 19822eabf88fSMatthew G. Knepley | B 2 C | | H 2 G | 19832eabf88fSMatthew G. Knepley | | | | | | 19842eabf88fSMatthew G. Knepley 3----3----0----1----1 3----3----0----1----1 19852eabf88fSMatthew G. Knepley | | | | | | 19862eabf88fSMatthew G. Knepley | A 0 D | | E 0 F | 19872eabf88fSMatthew G. Knepley | | | | | | 19882eabf88fSMatthew G. Knepley 0---------0---------3 4---------0---------5 19892eabf88fSMatthew G. Knepley */ 19902eabf88fSMatthew G. Knepley /* All cells have 6 faces: Bottom, Top, Front, Back, Right, Left */ 19912eabf88fSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 19922eabf88fSMatthew G. Knepley const PetscInt newp = (c - cStart)*8; 19932eabf88fSMatthew G. Knepley const PetscInt *cone, *ornt; 19942eabf88fSMatthew G. Knepley PetscInt coneNew[6], orntNew[6]; 19952eabf88fSMatthew G. Knepley 19962eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 19972eabf88fSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 19982eabf88fSMatthew G. Knepley /* A hex */ 19992eabf88fSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*4 + GetRefHexFace_Static(ornt[0], 0); 20002eabf88fSMatthew G. Knepley orntNew[0] = ornt[0]; 20012eabf88fSMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 8; /* AE */ 20022eabf88fSMatthew G. Knepley orntNew[1] = 0; 20032eabf88fSMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*4 + GetRefHexFace_Static(ornt[2], 0); 20042eabf88fSMatthew G. Knepley orntNew[2] = ornt[2]; 20052eabf88fSMatthew G. Knepley coneNew[3] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 3; /* AB */ 20062eabf88fSMatthew G. Knepley orntNew[3] = 0; 20072eabf88fSMatthew G. Knepley coneNew[4] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 0; /* AD */ 20082eabf88fSMatthew G. Knepley orntNew[4] = 0; 20092eabf88fSMatthew G. Knepley coneNew[5] = fStartNew + (cone[5] - fStart)*4 + GetRefHexFace_Static(ornt[5], 0); 20102eabf88fSMatthew G. Knepley orntNew[5] = ornt[5]; 20112eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+0, coneNew);CHKERRQ(ierr); 20122eabf88fSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+0, orntNew);CHKERRQ(ierr); 20132eabf88fSMatthew G. Knepley #if 1 20142eabf88fSMatthew G. Knepley if ((newp+0 < cStartNew) || (newp+0 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+0, cStartNew, cEndNew); 20152eabf88fSMatthew G. Knepley for (p = 0; p < 6; ++p) { 20162eabf88fSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 20172eabf88fSMatthew G. Knepley } 20182eabf88fSMatthew G. Knepley #endif 20192eabf88fSMatthew G. Knepley /* B hex */ 20202eabf88fSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*4 + GetRefHexFace_Static(ornt[0], 1); 20212eabf88fSMatthew G. Knepley orntNew[0] = ornt[0]; 20222eabf88fSMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 11; /* BH */ 20232eabf88fSMatthew G. Knepley orntNew[1] = 0; 20242eabf88fSMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 3; /* AB */ 20252eabf88fSMatthew G. Knepley orntNew[2] = -3; 20262eabf88fSMatthew G. Knepley coneNew[3] = fStartNew + (cone[3] - fStart)*4 + GetRefHexFace_Static(ornt[3], 1); 20272eabf88fSMatthew G. Knepley orntNew[3] = ornt[3]; 20282eabf88fSMatthew G. Knepley coneNew[4] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 2; /* BC */ 20292eabf88fSMatthew G. Knepley orntNew[4] = 0; 20302eabf88fSMatthew G. Knepley coneNew[5] = fStartNew + (cone[5] - fStart)*4 + GetRefHexFace_Static(ornt[5], 3); 20312eabf88fSMatthew G. Knepley orntNew[5] = ornt[5]; 20322eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+1, coneNew);CHKERRQ(ierr); 20332eabf88fSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+1, orntNew);CHKERRQ(ierr); 20342eabf88fSMatthew G. Knepley #if 1 20352eabf88fSMatthew G. Knepley if ((newp+1 < cStartNew) || (newp+1 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+1, cStartNew, cEndNew); 20362eabf88fSMatthew G. Knepley for (p = 0; p < 6; ++p) { 20372eabf88fSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 20382eabf88fSMatthew G. Knepley } 20392eabf88fSMatthew G. Knepley #endif 20402eabf88fSMatthew G. Knepley /* C hex */ 20412eabf88fSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*4 + GetRefHexFace_Static(ornt[0], 2); 20422eabf88fSMatthew G. Knepley orntNew[0] = ornt[0]; 20432eabf88fSMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 10; /* CG */ 20442eabf88fSMatthew G. Knepley orntNew[1] = 0; 20452eabf88fSMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 1; /* CD */ 20462eabf88fSMatthew G. Knepley orntNew[2] = 0; 20472eabf88fSMatthew G. Knepley coneNew[3] = fStartNew + (cone[3] - fStart)*4 + GetRefHexFace_Static(ornt[3], 1); 20482eabf88fSMatthew G. Knepley orntNew[3] = ornt[3]; 20492eabf88fSMatthew G. Knepley coneNew[4] = fStartNew + (cone[4] - fStart)*4 + GetRefHexFace_Static(ornt[4], 1); 20502eabf88fSMatthew G. Knepley orntNew[4] = ornt[4]; 20512eabf88fSMatthew G. Knepley coneNew[5] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 2; /* BC */ 20522eabf88fSMatthew G. Knepley orntNew[5] = -3; 20532eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+2, coneNew);CHKERRQ(ierr); 20542eabf88fSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+2, orntNew);CHKERRQ(ierr); 20552eabf88fSMatthew G. Knepley #if 1 20562eabf88fSMatthew G. Knepley if ((newp+2 < cStartNew) || (newp+2 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+2, cStartNew, cEndNew); 20572eabf88fSMatthew G. Knepley for (p = 0; p < 6; ++p) { 20582eabf88fSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 20592eabf88fSMatthew G. Knepley } 20602eabf88fSMatthew G. Knepley #endif 20612eabf88fSMatthew G. Knepley /* D hex */ 20622eabf88fSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*4 + GetRefHexFace_Static(ornt[0], 3); 20632eabf88fSMatthew G. Knepley orntNew[0] = ornt[0]; 20642eabf88fSMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 9; /* DF */ 20652eabf88fSMatthew G. Knepley orntNew[1] = 0; 20662eabf88fSMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*4 + GetRefHexFace_Static(ornt[2], 1); 20672eabf88fSMatthew G. Knepley orntNew[2] = ornt[2]; 20682eabf88fSMatthew G. Knepley coneNew[3] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 1; /* CD */ 20692eabf88fSMatthew G. Knepley orntNew[3] = -3; 20702eabf88fSMatthew G. Knepley coneNew[4] = fStartNew + (cone[4] - fStart)*4 + GetRefHexFace_Static(ornt[4], 0); 20712eabf88fSMatthew G. Knepley orntNew[4] = ornt[4]; 20722eabf88fSMatthew G. Knepley coneNew[5] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 0; /* AD */ 20732eabf88fSMatthew G. Knepley orntNew[5] = -3; 20742eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+3, coneNew);CHKERRQ(ierr); 20752eabf88fSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+3, orntNew);CHKERRQ(ierr); 20762eabf88fSMatthew G. Knepley #if 1 20772eabf88fSMatthew G. Knepley if ((newp+3 < cStartNew) || (newp+3 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+3, cStartNew, cEndNew); 20782eabf88fSMatthew G. Knepley for (p = 0; p < 6; ++p) { 20792eabf88fSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 20802eabf88fSMatthew G. Knepley } 20812eabf88fSMatthew G. Knepley #endif 20822eabf88fSMatthew G. Knepley /* E hex */ 20832eabf88fSMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 8; /* AE */ 20842eabf88fSMatthew G. Knepley orntNew[0] = -3; 20852eabf88fSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*4 + GetRefHexFace_Static(ornt[1], 0); 20862eabf88fSMatthew G. Knepley orntNew[1] = ornt[1]; 20872eabf88fSMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*4 + GetRefHexFace_Static(ornt[2], 3); 20882eabf88fSMatthew G. Knepley orntNew[2] = ornt[2]; 20892eabf88fSMatthew G. Knepley coneNew[3] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 7; /* EH */ 20902eabf88fSMatthew G. Knepley orntNew[3] = 0; 20912eabf88fSMatthew G. Knepley coneNew[4] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 4; /* EF */ 20922eabf88fSMatthew G. Knepley orntNew[4] = 0; 20932eabf88fSMatthew G. Knepley coneNew[5] = fStartNew + (cone[5] - fStart)*4 + GetRefHexFace_Static(ornt[5], 1); 20942eabf88fSMatthew G. Knepley orntNew[5] = ornt[5]; 20952eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+0, coneNew);CHKERRQ(ierr); 20962eabf88fSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+0, orntNew);CHKERRQ(ierr); 20972eabf88fSMatthew G. Knepley #if 1 20982eabf88fSMatthew G. Knepley if ((newp+0 < cStartNew) || (newp+0 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+0, cStartNew, cEndNew); 20992eabf88fSMatthew G. Knepley for (p = 0; p < 6; ++p) { 21002eabf88fSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 21012eabf88fSMatthew G. Knepley } 21022eabf88fSMatthew G. Knepley #endif 21032eabf88fSMatthew G. Knepley /* F hex */ 21042eabf88fSMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 9; /* DF */ 21052eabf88fSMatthew G. Knepley orntNew[0] = -3; 21062eabf88fSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*4 + GetRefHexFace_Static(ornt[1], 1); 21072eabf88fSMatthew G. Knepley orntNew[1] = ornt[1]; 21082eabf88fSMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*4 + GetRefHexFace_Static(ornt[2], 2); 21092eabf88fSMatthew G. Knepley orntNew[2] = ornt[2]; 21102eabf88fSMatthew G. Knepley coneNew[3] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 5; /* FG */ 21112eabf88fSMatthew G. Knepley orntNew[3] = 0; 21122eabf88fSMatthew G. Knepley coneNew[4] = fStartNew + (cone[4] - fStart)*4 + GetRefHexFace_Static(ornt[4], 3); 21132eabf88fSMatthew G. Knepley orntNew[4] = ornt[4]; 21142eabf88fSMatthew G. Knepley coneNew[5] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 4; /* EF */ 21152eabf88fSMatthew G. Knepley orntNew[5] = -3; 21162eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+1, coneNew);CHKERRQ(ierr); 21172eabf88fSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+1, orntNew);CHKERRQ(ierr); 21182eabf88fSMatthew G. Knepley #if 1 21192eabf88fSMatthew G. Knepley if ((newp+1 < cStartNew) || (newp+1 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+1, cStartNew, cEndNew); 21202eabf88fSMatthew G. Knepley for (p = 0; p < 6; ++p) { 21212eabf88fSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 21222eabf88fSMatthew G. Knepley } 21232eabf88fSMatthew G. Knepley #endif 21242eabf88fSMatthew G. Knepley /* G hex */ 21252eabf88fSMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 10; /* CG */ 21262eabf88fSMatthew G. Knepley orntNew[0] = -3; 21272eabf88fSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*4 + GetRefHexFace_Static(ornt[1], 2); 21282eabf88fSMatthew G. Knepley orntNew[1] = ornt[1]; 21292eabf88fSMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 5; /* FG */ 21302eabf88fSMatthew G. Knepley orntNew[2] = -3; 21312eabf88fSMatthew G. Knepley coneNew[3] = fStartNew + (cone[3] - fStart)*4 + GetRefHexFace_Static(ornt[3], 3); 21322eabf88fSMatthew G. Knepley orntNew[3] = ornt[3]; 21332eabf88fSMatthew G. Knepley coneNew[4] = fStartNew + (cone[4] - fStart)*4 + GetRefHexFace_Static(ornt[4], 2); 21342eabf88fSMatthew G. Knepley orntNew[4] = ornt[4]; 21352eabf88fSMatthew G. Knepley coneNew[5] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 6; /* GH */ 21362eabf88fSMatthew G. Knepley orntNew[5] = 0; 21372eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+2, coneNew);CHKERRQ(ierr); 21382eabf88fSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+2, orntNew);CHKERRQ(ierr); 21392eabf88fSMatthew G. Knepley #if 1 21402eabf88fSMatthew G. Knepley if ((newp+2 < cStartNew) || (newp+2 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+2, cStartNew, cEndNew); 21412eabf88fSMatthew G. Knepley for (p = 0; p < 6; ++p) { 21422eabf88fSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 21432eabf88fSMatthew G. Knepley } 21442eabf88fSMatthew G. Knepley #endif 21452eabf88fSMatthew G. Knepley /* H hex */ 21462eabf88fSMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 11; /* BH */ 21472eabf88fSMatthew G. Knepley orntNew[0] = -3; 21482eabf88fSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*4 + GetRefHexFace_Static(ornt[1], 3); 21492eabf88fSMatthew G. Knepley orntNew[1] = ornt[1]; 21502eabf88fSMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 7; /* EH */ 21512eabf88fSMatthew G. Knepley orntNew[2] = -3; 21522eabf88fSMatthew G. Knepley coneNew[3] = fStartNew + (cone[3] - fStart)*4 + GetRefHexFace_Static(ornt[3], 2); 21532eabf88fSMatthew G. Knepley orntNew[3] = ornt[3]; 21542eabf88fSMatthew G. Knepley coneNew[4] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 6; /* GH */ 21552eabf88fSMatthew G. Knepley orntNew[4] = -3; 21562eabf88fSMatthew G. Knepley coneNew[5] = fStartNew + (cone[5] - fStart)*4 + GetRefHexFace_Static(ornt[5], 2); 21572eabf88fSMatthew G. Knepley orntNew[5] = ornt[5]; 21582eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+3, coneNew);CHKERRQ(ierr); 21592eabf88fSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+3, orntNew);CHKERRQ(ierr); 21602eabf88fSMatthew G. Knepley #if 1 21612eabf88fSMatthew G. Knepley if ((newp+3 < cStartNew) || (newp+3 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+3, cStartNew, cEndNew); 21622eabf88fSMatthew G. Knepley for (p = 0; p < 6; ++p) { 21632eabf88fSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fEndNew); 21642eabf88fSMatthew G. Knepley } 21652eabf88fSMatthew G. Knepley #endif 21662eabf88fSMatthew G. Knepley } 21672eabf88fSMatthew G. Knepley /* Split faces have 4 edges and the same cells as the parent */ 21682eabf88fSMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, NULL, &maxSupportSize);CHKERRQ(ierr); 21692eabf88fSMatthew G. Knepley ierr = PetscMalloc((4 + maxSupportSize*2) * sizeof(PetscInt), &supportRef);CHKERRQ(ierr); 21702eabf88fSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 21712eabf88fSMatthew G. Knepley for (r = 0; r < 4; ++r) { 21722eabf88fSMatthew G. Knepley /* This can come from GetFaces_Internal() */ 21732eabf88fSMatthew G. Knepley const PetscInt newCells[24] = {0, 1, 2, 3, 4, 5, 6, 7, 0, 3, 5, 4, 2, 1, 7, 6, 3, 2, 6, 5, 0, 4, 7, 1}; 21742eabf88fSMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*4 + r; 21752eabf88fSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 21762eabf88fSMatthew G. Knepley PetscInt coneNew[4], coneSize, c, supportSize, s; 21772eabf88fSMatthew G. Knepley 21782eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, f, &cone);CHKERRQ(ierr); 21792eabf88fSMatthew G. Knepley /* TODO: Redo using orientation information */ 21802eabf88fSMatthew G. Knepley coneNew[0] = eStartNew + (cone[(r+3)%4] - eStart)*2 + 1; 21812eabf88fSMatthew G. Knepley coneNew[1] = eStartNew + (cone[r] - eStart)*2 + 0; 21822eabf88fSMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (f - fStart)*4 + r; 21832eabf88fSMatthew G. Knepley coneNew[3] = eStartNew + (eEnd - eStart)*2 + (f - fStart)*4 + (r+3)%4; 21842eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 21852eabf88fSMatthew G. Knepley #if 1 21862eabf88fSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 21872eabf88fSMatthew G. Knepley for (p = 0; p < 4; ++p) { 21882eabf88fSMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eEndNew); 21892eabf88fSMatthew G. Knepley } 21902eabf88fSMatthew G. Knepley #endif 21912eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 21922eabf88fSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 21932eabf88fSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 21942eabf88fSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 21952eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 21962eabf88fSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 21972eabf88fSMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 21982eabf88fSMatthew G. Knepley if (cone[c] == f) break; 21992eabf88fSMatthew G. Knepley } 22002eabf88fSMatthew G. Knepley /* TODO: Redo using orientation information */ 22012eabf88fSMatthew G. Knepley supportRef[s] = cStartNew + (support[s] - cStart)*8 + newCells[c*4+r]; 22022eabf88fSMatthew G. Knepley } 22032eabf88fSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 22042eabf88fSMatthew G. Knepley #if 1 22052eabf88fSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 22062eabf88fSMatthew G. Knepley for (p = 0; p < supportSize; ++p) { 22072eabf88fSMatthew G. Knepley if ((supportRef[p] < cStartNew) || (supportRef[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportRef[p], cStartNew, cEndNew); 22082eabf88fSMatthew G. Knepley } 22092eabf88fSMatthew G. Knepley #endif 22102eabf88fSMatthew G. Knepley } 22112eabf88fSMatthew G. Knepley } 22122eabf88fSMatthew G. Knepley /* Interior faces have 4 edges and 2 cells */ 22132eabf88fSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 22142eabf88fSMatthew G. Knepley const PetscInt newCells[24] = {0, 3, 2, 3, 1, 2, 0, 1, 4, 5, 5, 6, 6, 7, 4, 7, 0, 4, 3, 5, 2, 6, 1, 7}; 22152eabf88fSMatthew G. Knepley const PetscInt *cone; 22162eabf88fSMatthew G. Knepley PetscInt coneNew[4], supportNew[2]; 22172eabf88fSMatthew G. Knepley 22182eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 22192eabf88fSMatthew G. Knepley for (r = 0; r < 12; ++r) { 22202eabf88fSMatthew G. Knepley const PetscInt newp = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + r; 22212eabf88fSMatthew G. Knepley 22222eabf88fSMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[r] - fStart); 22232eabf88fSMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart) + (c - cStart); 22242eabf88fSMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (cone[r] - fStart); 22252eabf88fSMatthew G. Knepley coneNew[3] = eStartNew + (eEnd - eStart)*2 + (cone[r] - fStart); 22262eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 22272eabf88fSMatthew G. Knepley #if 1 22282eabf88fSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 22292eabf88fSMatthew G. Knepley for (p = 0; p < 4; ++p) { 22302eabf88fSMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eEndNew); 22312eabf88fSMatthew G. Knepley } 22322eabf88fSMatthew G. Knepley #endif 22332eabf88fSMatthew G. Knepley supportNew[0] = cStartNew + (c - cStart)*8 + newCells[r*2+0]; 22342eabf88fSMatthew G. Knepley supportNew[1] = cStartNew + (c - cStart)*8 + newCells[r*2+1]; 22352eabf88fSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 22362eabf88fSMatthew G. Knepley #if 1 22372eabf88fSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fEndNew); 22382eabf88fSMatthew G. Knepley for (p = 0; p < 2; ++p) { 22392eabf88fSMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cEndNew); 22402eabf88fSMatthew G. Knepley } 22412eabf88fSMatthew G. Knepley #endif 22422eabf88fSMatthew G. Knepley } 22432eabf88fSMatthew G. Knepley } 22442eabf88fSMatthew G. Knepley /* Split edges have 2 vertices and the same faces as the parent */ 22452eabf88fSMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, NULL, &maxSupportSize);CHKERRQ(ierr); 22462eabf88fSMatthew G. Knepley ierr = PetscMalloc((2 + maxSupportSize*2) * sizeof(PetscInt), &supportRef);CHKERRQ(ierr); 22472eabf88fSMatthew G. Knepley for (e = eStart; e < eEnd; ++e) { 22482eabf88fSMatthew G. Knepley const PetscInt newv = vStartNew + (vEnd - vStart) + (e - eStart); 22492eabf88fSMatthew G. Knepley 22502eabf88fSMatthew G. Knepley for (r = 0; r < 2; ++r) { 22512eabf88fSMatthew G. Knepley const PetscInt newp = eStartNew + (e - eStart)*2 + r; 22522eabf88fSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 22532eabf88fSMatthew G. Knepley PetscInt coneNew[2], coneSize, c, supportSize, s; 22542eabf88fSMatthew G. Knepley 22552eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 22562eabf88fSMatthew G. Knepley coneNew[0] = vStartNew + (cone[0] - vStart); 22572eabf88fSMatthew G. Knepley coneNew[1] = vStartNew + (cone[1] - vStart); 22582eabf88fSMatthew G. Knepley coneNew[(r+1)%2] = newv; 22592eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 22602eabf88fSMatthew G. Knepley #if 1 22612eabf88fSMatthew G. Knepley if ((newp < eStartNew) || (newp >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", newp, eStartNew, eEndNew); 22622eabf88fSMatthew G. Knepley for (p = 0; p < 2; ++p) { 22632eabf88fSMatthew G. Knepley if ((coneNew[p] < vStartNew) || (coneNew[p] >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", coneNew[p], vStartNew, vEndNew); 22642eabf88fSMatthew G. Knepley } 22652eabf88fSMatthew G. Knepley #endif 22662eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &supportSize);CHKERRQ(ierr); 22672eabf88fSMatthew G. Knepley ierr = DMPlexGetSupport(dm, e, &support);CHKERRQ(ierr); 22682eabf88fSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 22692eabf88fSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 22702eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 22712eabf88fSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 22722eabf88fSMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 22732eabf88fSMatthew G. Knepley if (cone[c] == e) break; 22742eabf88fSMatthew G. Knepley } 22752eabf88fSMatthew G. Knepley supportRef[s] = fStartNew + (support[s] - fStart)*4 + (ornt[c] < 0 ? (c+1-r)%4 : (c+r)%4); 22762eabf88fSMatthew G. Knepley } 22772eabf88fSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 22782eabf88fSMatthew G. Knepley #if 1 22792eabf88fSMatthew G. Knepley if ((newp < eStartNew) || (newp >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", newp, eStartNew, eEndNew); 22802eabf88fSMatthew G. Knepley for (p = 0; p < supportSize; ++p) { 22812eabf88fSMatthew G. Knepley if ((supportRef[p] < fStartNew) || (supportRef[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", supportRef[p], fStartNew, fEndNew); 22822eabf88fSMatthew G. Knepley } 22832eabf88fSMatthew G. Knepley #endif 22842eabf88fSMatthew G. Knepley } 22852eabf88fSMatthew G. Knepley } 22862eabf88fSMatthew G. Knepley /* Face edges have 2 vertices and 2+cells faces */ 22872eabf88fSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 22882eabf88fSMatthew G. Knepley const PetscInt newFaces[24] = {0, 1, 2, 3, 4, 5, 6, 7, 0, 9, 4, 8, 2, 11, 6, 10, 1, 10, 5, 9, 3, 8, 7, 11}; 22892eabf88fSMatthew G. Knepley const PetscInt newv = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (f - fStart); 22902eabf88fSMatthew G. Knepley const PetscInt *cone, *coneCell, *support; 22912eabf88fSMatthew G. Knepley PetscInt coneNew[2], coneSize, c, supportSize, s; 22922eabf88fSMatthew G. Knepley 22932eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, f, &cone);CHKERRQ(ierr); 22942eabf88fSMatthew G. Knepley for (r = 0; r < 4; ++r) { 22952eabf88fSMatthew G. Knepley const PetscInt newp = eStartNew + (eEnd - eStart)*2 + (f - fStart)*4 + r; 22962eabf88fSMatthew G. Knepley 22972eabf88fSMatthew G. Knepley coneNew[0] = vStartNew + (vEnd - vStart) + (cone[r] - eStart); 22982eabf88fSMatthew G. Knepley coneNew[1] = newv; 22992eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 23002eabf88fSMatthew G. Knepley #if 1 23012eabf88fSMatthew G. Knepley if ((newp < eStartNew) || (newp >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", newp, eStartNew, eEndNew); 23022eabf88fSMatthew G. Knepley for (p = 0; p < 2; ++p) { 23032eabf88fSMatthew G. Knepley if ((coneNew[p] < vStartNew) || (coneNew[p] >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", coneNew[p], vStartNew, vEndNew); 23042eabf88fSMatthew G. Knepley } 23052eabf88fSMatthew G. Knepley #endif 23062eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 23072eabf88fSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 23082eabf88fSMatthew G. Knepley supportRef[0] = fStartNew + (f - fStart)*4 + r; 23092eabf88fSMatthew G. Knepley supportRef[1] = fStartNew + (f - fStart)*4 + (r+1)%4; 23102eabf88fSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 2311e19c037eSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, f, &coneSize);CHKERRQ(ierr); 23122eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, f, &coneCell);CHKERRQ(ierr); 23132eabf88fSMatthew G. Knepley for (c = 0; c < coneSize; ++c) if (coneCell[c] == f) break; 23142eabf88fSMatthew G. Knepley supportRef[2+s] = fStartNew + (f - fStart)*4 + newFaces[c*4+r]; 23152eabf88fSMatthew G. Knepley } 23162eabf88fSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 23172eabf88fSMatthew G. Knepley #if 1 23182eabf88fSMatthew G. Knepley if ((newp < eStartNew) || (newp >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", newp, eStartNew, eEndNew); 23192eabf88fSMatthew G. Knepley for (p = 0; p < 2+supportSize; ++p) { 23202eabf88fSMatthew G. Knepley if ((supportRef[p] < fStartNew) || (supportRef[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", supportRef[p], fStartNew, fEndNew); 23212eabf88fSMatthew G. Knepley } 23222eabf88fSMatthew G. Knepley #endif 23232eabf88fSMatthew G. Knepley } 23242eabf88fSMatthew G. Knepley } 23252eabf88fSMatthew G. Knepley /* Cell edges have 2 vertices and 4 faces */ 23262eabf88fSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 23272eabf88fSMatthew G. Knepley const PetscInt newFaces[24] = {0, 1, 2, 3, 4, 5, 6, 7, 0, 9, 4, 8, 2, 11, 6, 10, 1, 10, 5, 9, 3, 8, 7, 11}; 23282eabf88fSMatthew G. Knepley const PetscInt newv = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (fEnd - fStart) + (c - cStart); 23292eabf88fSMatthew G. Knepley const PetscInt *cone; 23302eabf88fSMatthew G. Knepley PetscInt coneNew[2], supportNew[4]; 23312eabf88fSMatthew G. Knepley 23322eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 23332eabf88fSMatthew G. Knepley for (r = 0; r < 6; ++r) { 23342eabf88fSMatthew G. Knepley const PetscInt newp = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + r; 23352eabf88fSMatthew G. Knepley 23362eabf88fSMatthew G. Knepley coneNew[0] = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (cone[r] - fStart); 23372eabf88fSMatthew G. Knepley coneNew[1] = newv; 23382eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 23392eabf88fSMatthew G. Knepley #if 1 23402eabf88fSMatthew G. Knepley if ((newp < eStartNew) || (newp >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", newp, eStartNew, eEndNew); 23412eabf88fSMatthew G. Knepley for (p = 0; p < 2; ++p) { 23422eabf88fSMatthew G. Knepley if ((coneNew[p] < vStartNew) || (coneNew[p] >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", coneNew[p], vStartNew, vEndNew); 23432eabf88fSMatthew G. Knepley } 23442eabf88fSMatthew G. Knepley #endif 23452eabf88fSMatthew G. Knepley for (f = 0; f < 4; ++f) supportNew[f] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + newFaces[r*4+f]; 23462eabf88fSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 23472eabf88fSMatthew G. Knepley #if 1 23482eabf88fSMatthew G. Knepley if ((newp < eStartNew) || (newp >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", newp, eStartNew, eEndNew); 23492eabf88fSMatthew G. Knepley for (p = 0; p < 4; ++p) { 23502eabf88fSMatthew G. Knepley if ((supportNew[p] < fStartNew) || (supportNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", supportNew[p], fStartNew, fEndNew); 23512eabf88fSMatthew G. Knepley } 23522eabf88fSMatthew G. Knepley #endif 23532eabf88fSMatthew G. Knepley } 23542eabf88fSMatthew G. Knepley } 23552eabf88fSMatthew G. Knepley /* Old vertices have identical supports */ 23562eabf88fSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 23572eabf88fSMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 23582eabf88fSMatthew G. Knepley const PetscInt *support, *cone; 23592eabf88fSMatthew G. Knepley PetscInt size, s; 23602eabf88fSMatthew G. Knepley 23612eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 23622eabf88fSMatthew G. Knepley ierr = DMPlexGetSupport(dm, v, &support);CHKERRQ(ierr); 23632eabf88fSMatthew G. Knepley for (s = 0; s < size; ++s) { 23642eabf88fSMatthew G. Knepley PetscInt r = 0; 23652eabf88fSMatthew G. Knepley 23662eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 23672eabf88fSMatthew G. Knepley if (cone[1] == v) r = 1; 23682eabf88fSMatthew G. Knepley supportRef[s] = eStartNew + (support[s] - eStart)*2 + r; 23692eabf88fSMatthew G. Knepley } 23702eabf88fSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 23712eabf88fSMatthew G. Knepley #if 1 23722eabf88fSMatthew G. Knepley if ((newp < vStartNew) || (newp >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", newp, vStartNew, vEndNew); 23732eabf88fSMatthew G. Knepley for (p = 0; p < size; ++p) { 23742eabf88fSMatthew G. Knepley if ((supportRef[p] < eStartNew) || (supportRef[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", supportRef[p], eStartNew, eEndNew); 23752eabf88fSMatthew G. Knepley } 23762eabf88fSMatthew G. Knepley #endif 23772eabf88fSMatthew G. Knepley } 23782eabf88fSMatthew G. Knepley /* Edge vertices have 2 + faces supports */ 23792eabf88fSMatthew G. Knepley for (e = eStart; e < eEnd; ++e) { 23802eabf88fSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (e - eStart); 23812eabf88fSMatthew G. Knepley const PetscInt *cone, *support; 23822eabf88fSMatthew G. Knepley PetscInt size, s; 23832eabf88fSMatthew G. Knepley 23842eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &size);CHKERRQ(ierr); 23852eabf88fSMatthew G. Knepley ierr = DMPlexGetSupport(dm, e, &support);CHKERRQ(ierr); 23862eabf88fSMatthew G. Knepley supportRef[0] = eStartNew + (e - eStart)*2 + 0; 23872eabf88fSMatthew G. Knepley supportRef[1] = eStartNew + (e - eStart)*2 + 1; 23882eabf88fSMatthew G. Knepley for (s = 0; s < size; ++s) { 23892eabf88fSMatthew G. Knepley PetscInt r; 23902eabf88fSMatthew G. Knepley 23912eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 23922eabf88fSMatthew G. Knepley for (r = 0; r < 4; ++r) if (cone[r] == f) break; 23932eabf88fSMatthew G. Knepley supportRef[2+s] = eStartNew + (eEnd - eStart)*2 + (support[s] - fStart)*4 + r; 23942eabf88fSMatthew G. Knepley } 23952eabf88fSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 23962eabf88fSMatthew G. Knepley #if 1 23972eabf88fSMatthew G. Knepley if ((newp < vStartNew) || (newp >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", newp, vStartNew, vEndNew); 23982eabf88fSMatthew G. Knepley for (p = 0; p < 2+size; ++p) { 23992eabf88fSMatthew G. Knepley if ((supportRef[p] < eStartNew) || (supportRef[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", supportRef[p], eStartNew, eEndNew); 24002eabf88fSMatthew G. Knepley } 24012eabf88fSMatthew G. Knepley #endif 24022eabf88fSMatthew G. Knepley } 24032eabf88fSMatthew G. Knepley /* Face vertices have 4 + cells supports */ 24042eabf88fSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 24052eabf88fSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (f - fStart); 24062eabf88fSMatthew G. Knepley const PetscInt *cone, *support; 24072eabf88fSMatthew G. Knepley PetscInt size, s; 24082eabf88fSMatthew G. Knepley 24092eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 24102eabf88fSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 24112eabf88fSMatthew G. Knepley for (r = 0; r < 4; ++r) supportRef[r] = eStartNew + (e - eStart)*2 + (f - fStart)*4 + r; 24122eabf88fSMatthew G. Knepley for (s = 0; s < size; ++s) { 24132eabf88fSMatthew G. Knepley PetscInt r; 24142eabf88fSMatthew G. Knepley 24152eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 24162eabf88fSMatthew G. Knepley for (r = 0; r < 6; ++r) if (cone[r] == f) break; 24172eabf88fSMatthew G. Knepley supportRef[4+s] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (support[s] - cStart)*6 + r; 24182eabf88fSMatthew G. Knepley } 24192eabf88fSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 24202eabf88fSMatthew G. Knepley #if 1 24212eabf88fSMatthew G. Knepley if ((newp < vStartNew) || (newp >= vEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a vertex [%d, %d)", newp, vStartNew, vEndNew); 24222eabf88fSMatthew G. Knepley for (p = 0; p < 4+size; ++p) { 24232eabf88fSMatthew G. Knepley if ((supportRef[p] < eStartNew) || (supportRef[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", supportRef[p], eStartNew, eEndNew); 24242eabf88fSMatthew G. Knepley } 24252eabf88fSMatthew G. Knepley #endif 24262eabf88fSMatthew G. Knepley } 24272eabf88fSMatthew G. Knepley /* Cell vertices have 6 supports */ 24282eabf88fSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 24292eabf88fSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (fEnd - fStart) + (c - cStart); 24302eabf88fSMatthew G. Knepley PetscInt supportNew[6]; 24312eabf88fSMatthew G. Knepley 24322eabf88fSMatthew G. Knepley for (r = 0; r < 6; ++r) { 24332eabf88fSMatthew G. Knepley supportNew[r] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + r; 24342eabf88fSMatthew G. Knepley } 24352eabf88fSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 24362eabf88fSMatthew G. Knepley } 2437*da00770fSMatthew G. Knepley ierr = PetscFree(supportRef);CHKERRQ(ierr); 24382eabf88fSMatthew G. Knepley break; 243975d3a19aSMatthew G. Knepley default: 244075d3a19aSMatthew G. Knepley SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Unknown cell refiner %d", refiner); 244175d3a19aSMatthew G. Knepley } 244275d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 244375d3a19aSMatthew G. Knepley } 244475d3a19aSMatthew G. Knepley 244575d3a19aSMatthew G. Knepley #undef __FUNCT__ 244675d3a19aSMatthew G. Knepley #define __FUNCT__ "CellRefinerSetCoordinates" 244775d3a19aSMatthew G. Knepley PetscErrorCode CellRefinerSetCoordinates(CellRefiner refiner, DM dm, PetscInt depthSize[], DM rdm) 244875d3a19aSMatthew G. Knepley { 244975d3a19aSMatthew G. Knepley PetscSection coordSection, coordSectionNew; 245075d3a19aSMatthew G. Knepley Vec coordinates, coordinatesNew; 245175d3a19aSMatthew G. Knepley PetscScalar *coords, *coordsNew; 2452b5da9499SMatthew G. Knepley PetscInt dim, depth, coordSizeNew, cStart, cEnd, c, vStart, vStartNew, vEnd, v, eStart, eEnd, eMax, e, fStart, fEnd, fMax, f; 245375d3a19aSMatthew G. Knepley PetscErrorCode ierr; 245475d3a19aSMatthew G. Knepley 245575d3a19aSMatthew G. Knepley PetscFunctionBegin; 245675d3a19aSMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 245775d3a19aSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 245875d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 2459b5da9499SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr); 246075d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 246175d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 2462b5da9499SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, NULL, &fMax, &eMax, NULL);CHKERRQ(ierr); 246375d3a19aSMatthew G. Knepley ierr = GetDepthStart_Private(depth, depthSize, NULL, NULL, NULL, &vStartNew);CHKERRQ(ierr); 246475d3a19aSMatthew G. Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 246575d3a19aSMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &coordSectionNew);CHKERRQ(ierr); 246675d3a19aSMatthew G. Knepley ierr = PetscSectionSetNumFields(coordSectionNew, 1);CHKERRQ(ierr); 246775d3a19aSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(coordSectionNew, 0, dim);CHKERRQ(ierr); 246875d3a19aSMatthew G. Knepley ierr = PetscSectionSetChart(coordSectionNew, vStartNew, vStartNew+depthSize[0]);CHKERRQ(ierr); 246975d3a19aSMatthew G. Knepley if (fMax < 0) fMax = fEnd; 2470b5da9499SMatthew G. Knepley if (eMax < 0) eMax = eEnd; 247175d3a19aSMatthew G. Knepley /* All vertices have the dim coordinates */ 247275d3a19aSMatthew G. Knepley for (v = vStartNew; v < vStartNew+depthSize[0]; ++v) { 247375d3a19aSMatthew G. Knepley ierr = PetscSectionSetDof(coordSectionNew, v, dim);CHKERRQ(ierr); 247475d3a19aSMatthew G. Knepley ierr = PetscSectionSetFieldDof(coordSectionNew, v, 0, dim);CHKERRQ(ierr); 247575d3a19aSMatthew G. Knepley } 247675d3a19aSMatthew G. Knepley ierr = PetscSectionSetUp(coordSectionNew);CHKERRQ(ierr); 247775d3a19aSMatthew G. Knepley ierr = DMPlexSetCoordinateSection(rdm, coordSectionNew);CHKERRQ(ierr); 247875d3a19aSMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 247975d3a19aSMatthew G. Knepley ierr = PetscSectionGetStorageSize(coordSectionNew, &coordSizeNew);CHKERRQ(ierr); 248075d3a19aSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject)dm), &coordinatesNew);CHKERRQ(ierr); 248175d3a19aSMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) coordinatesNew, "coordinates");CHKERRQ(ierr); 248275d3a19aSMatthew G. Knepley ierr = VecSetSizes(coordinatesNew, coordSizeNew, PETSC_DETERMINE);CHKERRQ(ierr); 248375d3a19aSMatthew G. Knepley ierr = VecSetFromOptions(coordinatesNew);CHKERRQ(ierr); 248475d3a19aSMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 248575d3a19aSMatthew G. Knepley ierr = VecGetArray(coordinatesNew, &coordsNew);CHKERRQ(ierr); 2486b5da9499SMatthew G. Knepley switch (refiner) { 2487b5da9499SMatthew G. Knepley case 6: /* Hex 3D */ 2488b5da9499SMatthew G. Knepley /* Face vertices have the average of corner coordinates */ 2489b5da9499SMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 2490b5da9499SMatthew G. Knepley const PetscInt newv = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (cEnd - cStart) + (f - fStart); 2491b5da9499SMatthew G. Knepley PetscInt *cone = NULL; 2492b5da9499SMatthew G. Knepley PetscInt closureSize, coneSize = 0, off[8], offnew, p, d; 2493b5da9499SMatthew G. Knepley 2494b5da9499SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, f, PETSC_TRUE, &closureSize, &cone);CHKERRQ(ierr); 2495b5da9499SMatthew G. Knepley for (p = 0; p < closureSize*2; p += 2) { 2496b5da9499SMatthew G. Knepley const PetscInt point = cone[p]; 2497b5da9499SMatthew G. Knepley if ((point >= vStart) && (point < vEnd)) cone[coneSize++] = point; 2498b5da9499SMatthew G. Knepley } 2499b5da9499SMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 2500b5da9499SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, cone[v], &off[v]);CHKERRQ(ierr); 2501b5da9499SMatthew G. Knepley } 2502b5da9499SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSectionNew, newv, &offnew);CHKERRQ(ierr); 2503b5da9499SMatthew G. Knepley for (d = 0; d < dim; ++d) { 2504b5da9499SMatthew G. Knepley coordsNew[offnew+d] = 0.0; 2505b5da9499SMatthew G. Knepley for (v = 0; v < coneSize; ++v) coordsNew[offnew+d] += coords[off[v]+d]; 2506b5da9499SMatthew G. Knepley coordsNew[offnew+d] /= coneSize; 2507b5da9499SMatthew G. Knepley } 2508b5da9499SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, f, PETSC_TRUE, &closureSize, &cone);CHKERRQ(ierr); 2509b5da9499SMatthew G. Knepley } 2510b5da9499SMatthew G. Knepley case 2: /* Hex 2D */ 2511b5da9499SMatthew G. Knepley /* Cell vertices have the average of corner coordinates */ 2512b5da9499SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2513b5da9499SMatthew G. Knepley const PetscInt newv = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (c - cStart); 2514b5da9499SMatthew G. Knepley PetscInt *cone = NULL; 2515b5da9499SMatthew G. Knepley PetscInt closureSize, coneSize = 0, off[8], offnew, p, d; 2516b5da9499SMatthew G. Knepley 2517b5da9499SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &cone);CHKERRQ(ierr); 2518b5da9499SMatthew G. Knepley for (p = 0; p < closureSize*2; p += 2) { 2519b5da9499SMatthew G. Knepley const PetscInt point = cone[p]; 2520b5da9499SMatthew G. Knepley if ((point >= vStart) && (point < vEnd)) cone[coneSize++] = point; 2521b5da9499SMatthew G. Knepley } 2522b5da9499SMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 2523b5da9499SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, cone[v], &off[v]);CHKERRQ(ierr); 2524b5da9499SMatthew G. Knepley } 2525b5da9499SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSectionNew, newv, &offnew);CHKERRQ(ierr); 2526b5da9499SMatthew G. Knepley for (d = 0; d < dim; ++d) { 2527b5da9499SMatthew G. Knepley coordsNew[offnew+d] = 0.0; 2528b5da9499SMatthew G. Knepley for (v = 0; v < coneSize; ++v) coordsNew[offnew+d] += coords[off[v]+d]; 2529b5da9499SMatthew G. Knepley coordsNew[offnew+d] /= coneSize; 2530b5da9499SMatthew G. Knepley } 2531b5da9499SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &cone);CHKERRQ(ierr); 2532b5da9499SMatthew G. Knepley } 2533b5da9499SMatthew G. Knepley case 1: /* Simplicial 2D */ 2534b5da9499SMatthew G. Knepley case 3: /* Hybrid Simplicial 2D */ 2535b5da9499SMatthew G. Knepley case 5: /* Simplicial 3D */ 2536b5da9499SMatthew G. Knepley /* Edge vertices have the average of endpoint coordinates */ 2537b5da9499SMatthew G. Knepley for (e = eStart; e < eMax; ++e) { 2538b5da9499SMatthew G. Knepley const PetscInt newv = vStartNew + (vEnd - vStart) + (e - eStart); 2539b5da9499SMatthew G. Knepley const PetscInt *cone; 2540b5da9499SMatthew G. Knepley PetscInt coneSize, offA, offB, offnew, d; 2541b5da9499SMatthew G. Knepley 2542b5da9499SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr); 2543b5da9499SMatthew G. Knepley if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize); 2544b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 2545b5da9499SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr); 2546b5da9499SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr); 2547b5da9499SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSectionNew, newv, &offnew);CHKERRQ(ierr); 2548b5da9499SMatthew G. Knepley for (d = 0; d < dim; ++d) { 2549b5da9499SMatthew G. Knepley coordsNew[offnew+d] = 0.5*(coords[offA+d] + coords[offB+d]); 2550b5da9499SMatthew G. Knepley } 2551b5da9499SMatthew G. Knepley } 255275d3a19aSMatthew G. Knepley /* Old vertices have the same coordinates */ 255375d3a19aSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 255475d3a19aSMatthew G. Knepley const PetscInt newv = vStartNew + (v - vStart); 255575d3a19aSMatthew G. Knepley PetscInt off, offnew, d; 255675d3a19aSMatthew G. Knepley 255775d3a19aSMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 255875d3a19aSMatthew G. Knepley ierr = PetscSectionGetOffset(coordSectionNew, newv, &offnew);CHKERRQ(ierr); 255975d3a19aSMatthew G. Knepley for (d = 0; d < dim; ++d) { 256075d3a19aSMatthew G. Knepley coordsNew[offnew+d] = coords[off+d]; 256175d3a19aSMatthew G. Knepley } 256275d3a19aSMatthew G. Knepley } 2563b5da9499SMatthew G. Knepley break; 2564b5da9499SMatthew G. Knepley default: 2565b5da9499SMatthew G. Knepley SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Unknown cell refiner %d", refiner); 256675d3a19aSMatthew G. Knepley } 256775d3a19aSMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 256875d3a19aSMatthew G. Knepley ierr = VecRestoreArray(coordinatesNew, &coordsNew);CHKERRQ(ierr); 256975d3a19aSMatthew G. Knepley ierr = DMSetCoordinatesLocal(rdm, coordinatesNew);CHKERRQ(ierr); 257075d3a19aSMatthew G. Knepley ierr = VecDestroy(&coordinatesNew);CHKERRQ(ierr); 257175d3a19aSMatthew G. Knepley ierr = PetscSectionDestroy(&coordSectionNew);CHKERRQ(ierr); 257275d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 257375d3a19aSMatthew G. Knepley } 257475d3a19aSMatthew G. Knepley 257575d3a19aSMatthew G. Knepley #undef __FUNCT__ 257675d3a19aSMatthew G. Knepley #define __FUNCT__ "DMPlexCreateProcessSF" 257775d3a19aSMatthew G. Knepley PetscErrorCode DMPlexCreateProcessSF(DM dm, PetscSF sfPoint, IS *processRanks, PetscSF *sfProcess) 257875d3a19aSMatthew G. Knepley { 257975d3a19aSMatthew G. Knepley PetscInt numRoots, numLeaves, l; 258075d3a19aSMatthew G. Knepley const PetscInt *localPoints; 258175d3a19aSMatthew G. Knepley const PetscSFNode *remotePoints; 258275d3a19aSMatthew G. Knepley PetscInt *localPointsNew; 258375d3a19aSMatthew G. Knepley PetscSFNode *remotePointsNew; 258475d3a19aSMatthew G. Knepley PetscInt *ranks, *ranksNew; 258575d3a19aSMatthew G. Knepley PetscErrorCode ierr; 258675d3a19aSMatthew G. Knepley 258775d3a19aSMatthew G. Knepley PetscFunctionBegin; 258875d3a19aSMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 258975d3a19aSMatthew G. Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscInt), &ranks);CHKERRQ(ierr); 259075d3a19aSMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 259175d3a19aSMatthew G. Knepley ranks[l] = remotePoints[l].rank; 259275d3a19aSMatthew G. Knepley } 259375d3a19aSMatthew G. Knepley ierr = PetscSortRemoveDupsInt(&numLeaves, ranks);CHKERRQ(ierr); 259475d3a19aSMatthew G. Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscInt), &ranksNew);CHKERRQ(ierr); 259575d3a19aSMatthew G. Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscInt), &localPointsNew);CHKERRQ(ierr); 259675d3a19aSMatthew G. Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscSFNode), &remotePointsNew);CHKERRQ(ierr); 259775d3a19aSMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 259875d3a19aSMatthew G. Knepley ranksNew[l] = ranks[l]; 259975d3a19aSMatthew G. Knepley localPointsNew[l] = l; 260075d3a19aSMatthew G. Knepley remotePointsNew[l].index = 0; 260175d3a19aSMatthew G. Knepley remotePointsNew[l].rank = ranksNew[l]; 260275d3a19aSMatthew G. Knepley } 260375d3a19aSMatthew G. Knepley ierr = PetscFree(ranks);CHKERRQ(ierr); 260475d3a19aSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), numLeaves, ranksNew, PETSC_OWN_POINTER, processRanks);CHKERRQ(ierr); 260575d3a19aSMatthew G. Knepley ierr = PetscSFCreate(PetscObjectComm((PetscObject)dm), sfProcess);CHKERRQ(ierr); 260675d3a19aSMatthew G. Knepley ierr = PetscSFSetFromOptions(*sfProcess);CHKERRQ(ierr); 260775d3a19aSMatthew G. Knepley ierr = PetscSFSetGraph(*sfProcess, 1, numLeaves, localPointsNew, PETSC_OWN_POINTER, remotePointsNew, PETSC_OWN_POINTER);CHKERRQ(ierr); 260875d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 260975d3a19aSMatthew G. Knepley } 261075d3a19aSMatthew G. Knepley 261175d3a19aSMatthew G. Knepley #undef __FUNCT__ 261275d3a19aSMatthew G. Knepley #define __FUNCT__ "CellRefinerCreateSF" 261375d3a19aSMatthew G. Knepley PetscErrorCode CellRefinerCreateSF(CellRefiner refiner, DM dm, PetscInt depthSize[], DM rdm) 261475d3a19aSMatthew G. Knepley { 261575d3a19aSMatthew G. Knepley PetscSF sf, sfNew, sfProcess; 261675d3a19aSMatthew G. Knepley IS processRanks; 261775d3a19aSMatthew G. Knepley MPI_Datatype depthType; 261875d3a19aSMatthew G. Knepley PetscInt numRoots, numLeaves, numLeavesNew = 0, l, m; 261975d3a19aSMatthew G. Knepley const PetscInt *localPoints, *neighbors; 262075d3a19aSMatthew G. Knepley const PetscSFNode *remotePoints; 262175d3a19aSMatthew G. Knepley PetscInt *localPointsNew; 262275d3a19aSMatthew G. Knepley PetscSFNode *remotePointsNew; 262375d3a19aSMatthew G. Knepley PetscInt *depthSizeOld, *rdepthSize, *rdepthSizeOld, *rdepthMaxOld, *rvStart, *rvStartNew, *reStart, *reStartNew, *rfStart, *rfStartNew, *rcStart, *rcStartNew; 262475d3a19aSMatthew G. Knepley PetscInt depth, numNeighbors, pStartNew, pEndNew, cStart, cStartNew, cEnd, cMax, vStart, vStartNew, vEnd, vMax, fStart, fStartNew, fEnd, fMax, eStart, eStartNew, eEnd, eMax, r, n; 262575d3a19aSMatthew G. Knepley PetscErrorCode ierr; 262675d3a19aSMatthew G. Knepley 262775d3a19aSMatthew G. Knepley PetscFunctionBegin; 262875d3a19aSMatthew G. Knepley ierr = DMPlexGetChart(rdm, &pStartNew, &pEndNew);CHKERRQ(ierr); 262975d3a19aSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 263075d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 263175d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr); 263275d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 263375d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 263475d3a19aSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, &fMax, &eMax, &vMax);CHKERRQ(ierr); 263575d3a19aSMatthew G. Knepley ierr = GetDepthStart_Private(depth, depthSize, &cStartNew, &fStartNew, &eStartNew, &vStartNew);CHKERRQ(ierr); 263675d3a19aSMatthew G. Knepley switch (refiner) { 263775d3a19aSMatthew G. Knepley case 3: 263875d3a19aSMatthew G. Knepley if (cMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No cell maximum specified in hybrid mesh"); 263975d3a19aSMatthew G. Knepley cMax = PetscMin(cEnd, cMax); 264075d3a19aSMatthew G. Knepley if (fMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No face maximum specified in hybrid mesh"); 264175d3a19aSMatthew G. Knepley fMax = PetscMin(fEnd, fMax); 264275d3a19aSMatthew G. Knepley } 264375d3a19aSMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 264475d3a19aSMatthew G. Knepley ierr = DMGetPointSF(rdm, &sfNew);CHKERRQ(ierr); 264575d3a19aSMatthew G. Knepley /* Caculate size of new SF */ 264675d3a19aSMatthew G. Knepley ierr = PetscSFGetGraph(sf, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 264775d3a19aSMatthew G. Knepley if (numRoots < 0) PetscFunctionReturn(0); 264875d3a19aSMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 264975d3a19aSMatthew G. Knepley const PetscInt p = localPoints[l]; 265075d3a19aSMatthew G. Knepley 265175d3a19aSMatthew G. Knepley switch (refiner) { 265275d3a19aSMatthew G. Knepley case 1: 265375d3a19aSMatthew G. Knepley /* Simplicial 2D */ 265475d3a19aSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 265575d3a19aSMatthew G. Knepley /* Old vertices stay the same */ 265675d3a19aSMatthew G. Knepley ++numLeavesNew; 265775d3a19aSMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 265875d3a19aSMatthew G. Knepley /* Old faces add new faces and vertex */ 2659d963de37SMatthew G. Knepley numLeavesNew += 2 + 1; 266075d3a19aSMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 266175d3a19aSMatthew G. Knepley /* Old cells add new cells and interior faces */ 266275d3a19aSMatthew G. Knepley numLeavesNew += 4 + 3; 266375d3a19aSMatthew G. Knepley } 266475d3a19aSMatthew G. Knepley break; 266575d3a19aSMatthew G. Knepley case 2: 266675d3a19aSMatthew G. Knepley /* Hex 2D */ 266775d3a19aSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 266875d3a19aSMatthew G. Knepley /* Old vertices stay the same */ 266975d3a19aSMatthew G. Knepley ++numLeavesNew; 267075d3a19aSMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 267175d3a19aSMatthew G. Knepley /* Old faces add new faces and vertex */ 2672d963de37SMatthew G. Knepley numLeavesNew += 2 + 1; 267375d3a19aSMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 2674455d6cd4SMatthew G. Knepley /* Old cells add new cells, interior faces, and vertex */ 2675455d6cd4SMatthew G. Knepley numLeavesNew += 4 + 4 + 1; 267675d3a19aSMatthew G. Knepley } 267775d3a19aSMatthew G. Knepley break; 2678b5da9499SMatthew G. Knepley case 5: 2679b5da9499SMatthew G. Knepley /* Simplicial 3D */ 2680b5da9499SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 2681b5da9499SMatthew G. Knepley /* Old vertices stay the same */ 2682b5da9499SMatthew G. Knepley ++numLeavesNew; 2683b5da9499SMatthew G. Knepley } else if ((p >= eStart) && (p < eEnd)) { 2684b5da9499SMatthew G. Knepley /* Old edges add new edges and vertex */ 2685b5da9499SMatthew G. Knepley numLeavesNew += 2 + 1; 2686b5da9499SMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 2687b5da9499SMatthew G. Knepley /* Old faces add new faces and face edges */ 2688b5da9499SMatthew G. Knepley numLeavesNew += 4 + 3; 2689b5da9499SMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 2690b5da9499SMatthew G. Knepley /* Old cells add new cells and interior faces and edges */ 2691b5da9499SMatthew G. Knepley numLeavesNew += 8 + 8 + 1; 2692b5da9499SMatthew G. Knepley } 2693b5da9499SMatthew G. Knepley break; 26942eabf88fSMatthew G. Knepley case 6: 26952eabf88fSMatthew G. Knepley /* Hex 3D */ 26962eabf88fSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 26972eabf88fSMatthew G. Knepley /* Old vertices stay the same */ 26982eabf88fSMatthew G. Knepley ++numLeavesNew; 26992eabf88fSMatthew G. Knepley } else if ((p >= eStart) && (p < eEnd)) { 27002eabf88fSMatthew G. Knepley /* Old edges add new edges, and vertex */ 27012eabf88fSMatthew G. Knepley numLeavesNew += 2 + 1; 27022eabf88fSMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 27032eabf88fSMatthew G. Knepley /* Old faces add new faces, edges, and vertex */ 27042eabf88fSMatthew G. Knepley numLeavesNew += 4 + 4 + 1; 27052eabf88fSMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 27062eabf88fSMatthew G. Knepley /* Old cells add new cells, faces, edges, and vertex */ 27072eabf88fSMatthew G. Knepley numLeavesNew += 8 + 12 + 6 + 1; 27082eabf88fSMatthew G. Knepley } 27092eabf88fSMatthew G. Knepley break; 271075d3a19aSMatthew G. Knepley default: 271175d3a19aSMatthew G. Knepley SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Unknown cell refiner %d", refiner); 271275d3a19aSMatthew G. Knepley } 271375d3a19aSMatthew G. Knepley } 271475d3a19aSMatthew G. Knepley /* Communicate depthSizes for each remote rank */ 271575d3a19aSMatthew G. Knepley ierr = DMPlexCreateProcessSF(dm, sf, &processRanks, &sfProcess);CHKERRQ(ierr); 271675d3a19aSMatthew G. Knepley ierr = ISGetLocalSize(processRanks, &numNeighbors);CHKERRQ(ierr); 271775d3a19aSMatthew G. Knepley ierr = PetscMalloc5((depth+1)*numNeighbors,PetscInt,&rdepthSize,numNeighbors,PetscInt,&rvStartNew,numNeighbors,PetscInt,&reStartNew,numNeighbors,PetscInt,&rfStartNew,numNeighbors,PetscInt,&rcStartNew);CHKERRQ(ierr); 271875d3a19aSMatthew G. Knepley ierr = PetscMalloc7(depth+1,PetscInt,&depthSizeOld,(depth+1)*numNeighbors,PetscInt,&rdepthSizeOld,(depth+1)*numNeighbors,PetscInt,&rdepthMaxOld,numNeighbors,PetscInt,&rvStart,numNeighbors,PetscInt,&reStart,numNeighbors,PetscInt,&rfStart,numNeighbors,PetscInt,&rcStart);CHKERRQ(ierr); 271975d3a19aSMatthew G. Knepley ierr = MPI_Type_contiguous(depth+1, MPIU_INT, &depthType);CHKERRQ(ierr); 272075d3a19aSMatthew G. Knepley ierr = MPI_Type_commit(&depthType);CHKERRQ(ierr); 272175d3a19aSMatthew G. Knepley ierr = PetscSFBcastBegin(sfProcess, depthType, depthSize, rdepthSize);CHKERRQ(ierr); 272275d3a19aSMatthew G. Knepley ierr = PetscSFBcastEnd(sfProcess, depthType, depthSize, rdepthSize);CHKERRQ(ierr); 272375d3a19aSMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 272475d3a19aSMatthew G. Knepley ierr = GetDepthStart_Private(depth, &rdepthSize[n*(depth+1)], &rcStartNew[n], &rfStartNew[n], &reStartNew[n], &rvStartNew[n]);CHKERRQ(ierr); 272575d3a19aSMatthew G. Knepley } 272675d3a19aSMatthew G. Knepley depthSizeOld[depth] = cMax; 272775d3a19aSMatthew G. Knepley depthSizeOld[0] = vMax; 272875d3a19aSMatthew G. Knepley depthSizeOld[depth-1] = fMax; 272975d3a19aSMatthew G. Knepley depthSizeOld[1] = eMax; 273075d3a19aSMatthew G. Knepley 273175d3a19aSMatthew G. Knepley ierr = PetscSFBcastBegin(sfProcess, depthType, depthSizeOld, rdepthMaxOld);CHKERRQ(ierr); 273275d3a19aSMatthew G. Knepley ierr = PetscSFBcastEnd(sfProcess, depthType, depthSizeOld, rdepthMaxOld);CHKERRQ(ierr); 273375d3a19aSMatthew G. Knepley 273475d3a19aSMatthew G. Knepley depthSizeOld[depth] = cEnd - cStart; 273575d3a19aSMatthew G. Knepley depthSizeOld[0] = vEnd - vStart; 273675d3a19aSMatthew G. Knepley depthSizeOld[depth-1] = fEnd - fStart; 273775d3a19aSMatthew G. Knepley depthSizeOld[1] = eEnd - eStart; 273875d3a19aSMatthew G. Knepley 273975d3a19aSMatthew G. Knepley ierr = PetscSFBcastBegin(sfProcess, depthType, depthSizeOld, rdepthSizeOld);CHKERRQ(ierr); 274075d3a19aSMatthew G. Knepley ierr = PetscSFBcastEnd(sfProcess, depthType, depthSizeOld, rdepthSizeOld);CHKERRQ(ierr); 274175d3a19aSMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 274275d3a19aSMatthew G. Knepley ierr = GetDepthStart_Private(depth, &rdepthSizeOld[n*(depth+1)], &rcStart[n], &rfStart[n], &reStart[n], &rvStart[n]);CHKERRQ(ierr); 274375d3a19aSMatthew G. Knepley } 274475d3a19aSMatthew G. Knepley ierr = MPI_Type_free(&depthType);CHKERRQ(ierr); 274575d3a19aSMatthew G. Knepley ierr = PetscSFDestroy(&sfProcess);CHKERRQ(ierr); 274675d3a19aSMatthew G. Knepley /* Calculate new point SF */ 274775d3a19aSMatthew G. Knepley ierr = PetscMalloc(numLeavesNew * sizeof(PetscInt), &localPointsNew);CHKERRQ(ierr); 274875d3a19aSMatthew G. Knepley ierr = PetscMalloc(numLeavesNew * sizeof(PetscSFNode), &remotePointsNew);CHKERRQ(ierr); 274975d3a19aSMatthew G. Knepley ierr = ISGetIndices(processRanks, &neighbors);CHKERRQ(ierr); 275075d3a19aSMatthew G. Knepley for (l = 0, m = 0; l < numLeaves; ++l) { 275175d3a19aSMatthew G. Knepley PetscInt p = localPoints[l]; 275275d3a19aSMatthew G. Knepley PetscInt rp = remotePoints[l].index, n; 275375d3a19aSMatthew G. Knepley PetscMPIInt rrank = remotePoints[l].rank; 275475d3a19aSMatthew G. Knepley 275575d3a19aSMatthew G. Knepley ierr = PetscFindInt(rrank, numNeighbors, neighbors, &n);CHKERRQ(ierr); 275675d3a19aSMatthew G. Knepley if (n < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Could not locate remote rank %d", rrank); 275775d3a19aSMatthew G. Knepley switch (refiner) { 275875d3a19aSMatthew G. Knepley case 1: 275975d3a19aSMatthew G. Knepley /* Simplicial 2D */ 276075d3a19aSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 276175d3a19aSMatthew G. Knepley /* Old vertices stay the same */ 276275d3a19aSMatthew G. Knepley localPointsNew[m] = vStartNew + (p - vStart); 276375d3a19aSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + (rp - rvStart[n]); 276475d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 276575d3a19aSMatthew G. Knepley ++m; 276675d3a19aSMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 276775d3a19aSMatthew G. Knepley /* Old faces add new faces and vertex */ 276875d3a19aSMatthew G. Knepley localPointsNew[m] = vStartNew + (vEnd - vStart) + (p - fStart); 276975d3a19aSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + rdepthSizeOld[n*(depth+1)+0] + (rp - rfStart[n]); 277075d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 277175d3a19aSMatthew G. Knepley ++m; 277275d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r, ++m) { 277375d3a19aSMatthew G. Knepley localPointsNew[m] = fStartNew + (p - fStart)*2 + r; 277475d3a19aSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + (rp - rfStart[n])*2 + r; 277575d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 277675d3a19aSMatthew G. Knepley } 277775d3a19aSMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 277875d3a19aSMatthew G. Knepley /* Old cells add new cells and interior faces */ 277975d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r, ++m) { 278075d3a19aSMatthew G. Knepley localPointsNew[m] = cStartNew + (p - cStart)*4 + r; 278175d3a19aSMatthew G. Knepley remotePointsNew[m].index = rcStartNew[n] + (rp - rcStart[n])*4 + r; 278275d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 278375d3a19aSMatthew G. Knepley } 278475d3a19aSMatthew G. Knepley for (r = 0; r < 3; ++r, ++m) { 278575d3a19aSMatthew G. Knepley localPointsNew[m] = fStartNew + (fEnd - fStart)*2 + (p - cStart)*3 + r; 278675d3a19aSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + rdepthSizeOld[n*(depth+1)+depth-1]*2 + (rp - rcStart[n])*3 + r; 278775d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 278875d3a19aSMatthew G. Knepley } 278975d3a19aSMatthew G. Knepley } 279075d3a19aSMatthew G. Knepley break; 279175d3a19aSMatthew G. Knepley case 2: 279275d3a19aSMatthew G. Knepley /* Hex 2D */ 279375d3a19aSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 279475d3a19aSMatthew G. Knepley /* Old vertices stay the same */ 279575d3a19aSMatthew G. Knepley localPointsNew[m] = vStartNew + (p - vStart); 279675d3a19aSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + (rp - rvStart[n]); 279775d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 279875d3a19aSMatthew G. Knepley ++m; 279975d3a19aSMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 280075d3a19aSMatthew G. Knepley /* Old faces add new faces and vertex */ 280175d3a19aSMatthew G. Knepley localPointsNew[m] = vStartNew + (vEnd - vStart) + (p - fStart); 280275d3a19aSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + rdepthSizeOld[n*(depth+1)+0] + (rp - rfStart[n]); 280375d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 280475d3a19aSMatthew G. Knepley ++m; 280575d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r, ++m) { 280675d3a19aSMatthew G. Knepley localPointsNew[m] = fStartNew + (p - fStart)*2 + r; 280775d3a19aSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + (rp - rfStart[n])*2 + r; 280875d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 280975d3a19aSMatthew G. Knepley } 281075d3a19aSMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 2811455d6cd4SMatthew G. Knepley /* Old cells add new cells, interior faces, and vertex */ 281275d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r, ++m) { 281375d3a19aSMatthew G. Knepley localPointsNew[m] = cStartNew + (p - cStart)*4 + r; 281475d3a19aSMatthew G. Knepley remotePointsNew[m].index = rcStartNew[n] + (rp - rcStart[n])*4 + r; 281575d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 281675d3a19aSMatthew G. Knepley } 281775d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r, ++m) { 281875d3a19aSMatthew G. Knepley localPointsNew[m] = fStartNew + (fEnd - fStart)*2 + (p - cStart)*4 + r; 281975d3a19aSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + rdepthSizeOld[n*(depth+1)+depth-1]*2 + (rp - rcStart[n])*4 + r; 282075d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 282175d3a19aSMatthew G. Knepley } 2822455d6cd4SMatthew G. Knepley for (r = 0; r < 1; ++r, ++m) { 2823455d6cd4SMatthew G. Knepley localPointsNew[m] = vStartNew + (fEnd - fStart) + (p - cStart) + r; 2824455d6cd4SMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + rdepthSizeOld[n*(depth+1)+depth-1] + (rp - rcStart[n]) + r; 2825455d6cd4SMatthew G. Knepley remotePointsNew[m].rank = rrank; 2826455d6cd4SMatthew G. Knepley } 282775d3a19aSMatthew G. Knepley } 282875d3a19aSMatthew G. Knepley break; 282975d3a19aSMatthew G. Knepley case 3: 283075d3a19aSMatthew G. Knepley /* Hybrid simplicial 2D */ 283175d3a19aSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 283275d3a19aSMatthew G. Knepley /* Old vertices stay the same */ 283375d3a19aSMatthew G. Knepley localPointsNew[m] = vStartNew + (p - vStart); 283475d3a19aSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + (rp - rvStart[n]); 283575d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 283675d3a19aSMatthew G. Knepley ++m; 283775d3a19aSMatthew G. Knepley } else if ((p >= fStart) && (p < fMax)) { 283875d3a19aSMatthew G. Knepley /* Old interior faces add new faces and vertex */ 283975d3a19aSMatthew G. Knepley localPointsNew[m] = vStartNew + (vEnd - vStart) + (p - fStart); 284075d3a19aSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + rdepthSizeOld[n*(depth+1)+0] + (rp - rfStart[n]); 284175d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 284275d3a19aSMatthew G. Knepley ++m; 284375d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r, ++m) { 284475d3a19aSMatthew G. Knepley localPointsNew[m] = fStartNew + (p - fStart)*2 + r; 284575d3a19aSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + (rp - rfStart[n])*2 + r; 284675d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 284775d3a19aSMatthew G. Knepley } 284875d3a19aSMatthew G. Knepley } else if ((p >= fMax) && (p < fEnd)) { 284975d3a19aSMatthew G. Knepley /* Old hybrid faces stay the same */ 285075d3a19aSMatthew G. Knepley localPointsNew[m] = fStartNew + (fMax - fStart)*2 + (p - fMax); 285175d3a19aSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + (rdepthMaxOld[n*(depth+1)+depth-1] - rfStart[n])*2 + (rp - rdepthMaxOld[n*(depth+1)+depth-1]); 285275d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 285375d3a19aSMatthew G. Knepley ++m; 285475d3a19aSMatthew G. Knepley } else if ((p >= cStart) && (p < cMax)) { 285575d3a19aSMatthew G. Knepley /* Old interior cells add new cells and interior faces */ 285675d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r, ++m) { 285775d3a19aSMatthew G. Knepley localPointsNew[m] = cStartNew + (p - cStart)*4 + r; 285875d3a19aSMatthew G. Knepley remotePointsNew[m].index = rcStartNew[n] + (rp - rcStart[n])*4 + r; 285975d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 286075d3a19aSMatthew G. Knepley } 286175d3a19aSMatthew G. Knepley for (r = 0; r < 3; ++r, ++m) { 286275d3a19aSMatthew G. Knepley localPointsNew[m] = fStartNew + (fMax - fStart)*2 + (p - cStart)*3 + r; 286375d3a19aSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + (rdepthMaxOld[n*(depth+1)+depth-1] - rfStart[n])*2 + (rp - rcStart[n])*3 + r; 286475d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 286575d3a19aSMatthew G. Knepley } 286675d3a19aSMatthew G. Knepley } else if ((p >= cStart) && (p < cMax)) { 286775d3a19aSMatthew G. Knepley /* Old hybrid cells add new cells and hybrid face */ 286875d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r, ++m) { 286975d3a19aSMatthew G. Knepley localPointsNew[m] = cStartNew + (p - cStart)*4 + r; 287075d3a19aSMatthew G. Knepley remotePointsNew[m].index = rcStartNew[n] + (rp - rcStart[n])*4 + r; 287175d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 287275d3a19aSMatthew G. Knepley } 287375d3a19aSMatthew G. Knepley localPointsNew[m] = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (p - cMax); 287475d3a19aSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + (rdepthMaxOld[n*(depth+1)+depth-1] - rfStart[n])*2 + (rdepthMaxOld[n*(depth+1)+depth] - rcStart[n])*3 + (rp - rdepthMaxOld[n*(depth+1)+depth]); 287575d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 287675d3a19aSMatthew G. Knepley ++m; 287775d3a19aSMatthew G. Knepley } 287875d3a19aSMatthew G. Knepley break; 2879b5da9499SMatthew G. Knepley case 5: 2880b5da9499SMatthew G. Knepley /* Simplicial 3D */ 2881b5da9499SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 2882b5da9499SMatthew G. Knepley /* Old vertices stay the same */ 2883b5da9499SMatthew G. Knepley localPointsNew[m] = vStartNew + (p - vStart); 2884b5da9499SMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + (rp - rvStart[n]); 2885b5da9499SMatthew G. Knepley remotePointsNew[m].rank = rrank; 2886b5da9499SMatthew G. Knepley ++m; 288787fe6628SMatthew G. Knepley } else if ((p >= eStart) && (p < eEnd)) { 2888b5da9499SMatthew G. Knepley /* Old edges add new edges and vertex */ 2889b5da9499SMatthew G. Knepley for (r = 0; r < 2; ++r, ++m) { 2890b5da9499SMatthew G. Knepley localPointsNew[m] = eStartNew + (p - eStart)*2 + r; 2891b5da9499SMatthew G. Knepley remotePointsNew[m].index = reStartNew[n] + (rp - reStart[n])*2 + r; 2892b5da9499SMatthew G. Knepley remotePointsNew[m].rank = rrank; 2893b5da9499SMatthew G. Knepley } 2894b5da9499SMatthew G. Knepley localPointsNew[m] = vStartNew + (vEnd - vStart) + (p - eStart); 2895b5da9499SMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + rdepthSizeOld[n*(depth+1)+0] + (rp - reStart[n]); 2896b5da9499SMatthew G. Knepley remotePointsNew[m].rank = rrank; 2897b5da9499SMatthew G. Knepley ++m; 2898b5da9499SMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 2899b5da9499SMatthew G. Knepley /* Old faces add new faces and face edges */ 2900b5da9499SMatthew G. Knepley for (r = 0; r < 4; ++r, ++m) { 2901b5da9499SMatthew G. Knepley localPointsNew[m] = fStartNew + (p - fStart)*4 + r; 2902b5da9499SMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + (rp - rfStart[n])*4 + r; 2903b5da9499SMatthew G. Knepley remotePointsNew[m].rank = rrank; 2904b5da9499SMatthew G. Knepley } 2905b5da9499SMatthew G. Knepley for (r = 0; r < 3; ++r, ++m) { 2906b5da9499SMatthew G. Knepley localPointsNew[m] = eStartNew + (eEnd - eStart)*2 + (p - fStart)*3 + r; 2907b5da9499SMatthew G. Knepley remotePointsNew[m].index = reStartNew[n] + rdepthSizeOld[n*(depth+1)+1]*2 + (rp - rfStart[n])*3 + r; 2908b5da9499SMatthew G. Knepley remotePointsNew[m].rank = rrank; 2909b5da9499SMatthew G. Knepley } 2910b5da9499SMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 2911b5da9499SMatthew G. Knepley /* Old cells add new cells and interior faces and edges */ 2912b5da9499SMatthew G. Knepley for (r = 0; r < 8; ++r, ++m) { 2913b5da9499SMatthew G. Knepley localPointsNew[m] = cStartNew + (p - cStart)*8 + r; 2914b5da9499SMatthew G. Knepley remotePointsNew[m].index = rcStartNew[n] + (rp - rcStart[n])*8 + r; 2915b5da9499SMatthew G. Knepley remotePointsNew[m].rank = rrank; 2916b5da9499SMatthew G. Knepley } 2917b5da9499SMatthew G. Knepley for (r = 0; r < 8; ++r, ++m) { 2918b5da9499SMatthew G. Knepley localPointsNew[m] = fStartNew + (fEnd - fStart)*4 + (p - cStart)*8 + r; 2919b5da9499SMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + rdepthSizeOld[n*(depth+1)+depth-1]*4 + (rp - rcStart[n])*8 + r; 2920b5da9499SMatthew G. Knepley remotePointsNew[m].rank = rrank; 2921b5da9499SMatthew G. Knepley } 2922b5da9499SMatthew G. Knepley for (r = 0; r < 1; ++r, ++m) { 2923b5da9499SMatthew G. Knepley localPointsNew[m] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*3 + (p - cStart)*1 + r; 2924b5da9499SMatthew G. Knepley remotePointsNew[m].index = reStartNew[n] + rdepthSizeOld[n*(depth+1)+1]*2 + rdepthSizeOld[n*(depth+1)+depth-1]*3 + (rp - rcStart[n])*1 + r; 2925b5da9499SMatthew G. Knepley remotePointsNew[m].rank = rrank; 2926b5da9499SMatthew G. Knepley } 2927b5da9499SMatthew G. Knepley } 2928b5da9499SMatthew G. Knepley break; 29292eabf88fSMatthew G. Knepley case 6: 29302eabf88fSMatthew G. Knepley /* Hex 3D */ 29312eabf88fSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 29322eabf88fSMatthew G. Knepley /* Old vertices stay the same */ 29332eabf88fSMatthew G. Knepley localPointsNew[m] = vStartNew + (p - vStart); 29342eabf88fSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + (rp - rvStart[n]); 29352eabf88fSMatthew G. Knepley remotePointsNew[m].rank = rrank; 29362eabf88fSMatthew G. Knepley ++m; 29372eabf88fSMatthew G. Knepley } else if ((p >= eStart) && (p < eEnd)) { 29382eabf88fSMatthew G. Knepley /* Old edges add new edges and vertex */ 29392eabf88fSMatthew G. Knepley for (r = 0; r < 2; ++r, ++m) { 29402eabf88fSMatthew G. Knepley localPointsNew[m] = eStartNew + (p - eStart)*2 + r; 29412eabf88fSMatthew G. Knepley remotePointsNew[m].index = reStartNew[n] + (rp - reStart[n])*2 + r; 29422eabf88fSMatthew G. Knepley remotePointsNew[m].rank = rrank; 29432eabf88fSMatthew G. Knepley } 29442eabf88fSMatthew G. Knepley localPointsNew[m] = vStartNew + (vEnd - vStart) + (p - eStart); 29452eabf88fSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + rdepthSizeOld[n*(depth+1)+0] + (rp - reStart[n]); 29462eabf88fSMatthew G. Knepley remotePointsNew[m].rank = rrank; 29472eabf88fSMatthew G. Knepley ++m; 29482eabf88fSMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 29492eabf88fSMatthew G. Knepley /* Old faces add new faces, edges, and vertex */ 29502eabf88fSMatthew G. Knepley for (r = 0; r < 4; ++r, ++m) { 29512eabf88fSMatthew G. Knepley localPointsNew[m] = fStartNew + (p - fStart)*4 + r; 29522eabf88fSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + (rp - rfStart[n])*4 + r; 29532eabf88fSMatthew G. Knepley remotePointsNew[m].rank = rrank; 29542eabf88fSMatthew G. Knepley } 29552eabf88fSMatthew G. Knepley for (r = 0; r < 4; ++r, ++m) { 29562eabf88fSMatthew G. Knepley localPointsNew[m] = eStartNew + (eEnd - eStart)*2 + (p - fStart)*4 + r; 29572eabf88fSMatthew G. Knepley remotePointsNew[m].index = reStartNew[n] + rdepthSizeOld[n*(depth+1)+1]*2 + (rp - rfStart[n])*4 + r; 29582eabf88fSMatthew G. Knepley remotePointsNew[m].rank = rrank; 29592eabf88fSMatthew G. Knepley } 29602eabf88fSMatthew G. Knepley localPointsNew[m] = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (p - fStart); 29612eabf88fSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + rdepthSizeOld[n*(depth+1)+0] + rdepthSizeOld[n*(depth+1)+1] + (rp - rfStart[n]); 29622eabf88fSMatthew G. Knepley remotePointsNew[m].rank = rrank; 29632eabf88fSMatthew G. Knepley ++m; 29642eabf88fSMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 29652eabf88fSMatthew G. Knepley /* Old cells add new cells, faces, edges, and vertex */ 29662eabf88fSMatthew G. Knepley for (r = 0; r < 8; ++r, ++m) { 29672eabf88fSMatthew G. Knepley localPointsNew[m] = cStartNew + (p - cStart)*8 + r; 29682eabf88fSMatthew G. Knepley remotePointsNew[m].index = rcStartNew[n] + (rp - rcStart[n])*8 + r; 29692eabf88fSMatthew G. Knepley remotePointsNew[m].rank = rrank; 29702eabf88fSMatthew G. Knepley } 29712eabf88fSMatthew G. Knepley for (r = 0; r < 12; ++r, ++m) { 29722eabf88fSMatthew G. Knepley localPointsNew[m] = fStartNew + (fEnd - fStart)*4 + (p - cStart)*12 + r; 29732eabf88fSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + rdepthSizeOld[n*(depth+1)+depth-1]*4 + (rp - rcStart[n])*12 + r; 29742eabf88fSMatthew G. Knepley remotePointsNew[m].rank = rrank; 29752eabf88fSMatthew G. Knepley } 29762eabf88fSMatthew G. Knepley for (r = 0; r < 6; ++r, ++m) { 29772eabf88fSMatthew G. Knepley localPointsNew[m] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (p - cStart)*6 + r; 29782eabf88fSMatthew G. Knepley remotePointsNew[m].index = reStartNew[n] + rdepthSizeOld[n*(depth+1)+1]*2 + rdepthSizeOld[n*(depth+1)+depth-1]*4 + (rp - rcStart[n])*6 + r; 29792eabf88fSMatthew G. Knepley remotePointsNew[m].rank = rrank; 29802eabf88fSMatthew G. Knepley } 29812eabf88fSMatthew G. Knepley for (r = 0; r < 1; ++r, ++m) { 29822eabf88fSMatthew G. Knepley localPointsNew[m] = vStartNew + (eEnd - eStart) + (fEnd - fStart) + (p - cStart) + r; 29832eabf88fSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + rdepthSizeOld[n*(depth+1)+1] + rdepthSizeOld[n*(depth+1)+depth-1] + (rp - rcStart[n]) + r; 29842eabf88fSMatthew G. Knepley remotePointsNew[m].rank = rrank; 29852eabf88fSMatthew G. Knepley } 29862eabf88fSMatthew G. Knepley } 29872eabf88fSMatthew G. Knepley break; 298875d3a19aSMatthew G. Knepley default: 298975d3a19aSMatthew G. Knepley SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Unknown cell refiner %d", refiner); 299075d3a19aSMatthew G. Knepley } 299175d3a19aSMatthew G. Knepley } 299275d3a19aSMatthew G. Knepley ierr = ISRestoreIndices(processRanks, &neighbors);CHKERRQ(ierr); 299375d3a19aSMatthew G. Knepley ierr = ISDestroy(&processRanks);CHKERRQ(ierr); 299475d3a19aSMatthew G. Knepley ierr = PetscSFSetGraph(sfNew, pEndNew-pStartNew, numLeavesNew, localPointsNew, PETSC_OWN_POINTER, remotePointsNew, PETSC_OWN_POINTER);CHKERRQ(ierr); 299575d3a19aSMatthew G. Knepley ierr = PetscFree5(rdepthSize,rvStartNew,reStartNew,rfStartNew,rcStartNew);CHKERRQ(ierr); 299606a0ba2dSMatthew G. Knepley ierr = PetscFree7(depthSizeOld,rdepthSizeOld,rdepthMaxOld,rvStart,reStart,rfStart,rcStart);CHKERRQ(ierr); 299775d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 299875d3a19aSMatthew G. Knepley } 299975d3a19aSMatthew G. Knepley 300075d3a19aSMatthew G. Knepley #undef __FUNCT__ 300175d3a19aSMatthew G. Knepley #define __FUNCT__ "CellRefinerCreateLabels" 300275d3a19aSMatthew G. Knepley PetscErrorCode CellRefinerCreateLabels(CellRefiner refiner, DM dm, PetscInt depthSize[], DM rdm) 300375d3a19aSMatthew G. Knepley { 300475d3a19aSMatthew G. Knepley PetscInt numLabels, l; 3005b5da9499SMatthew G. Knepley PetscInt depth, newp, cStart, cStartNew, cEnd, cMax, vStart, vStartNew, vEnd, vMax, fStart, fStartNew, fEnd, fMax, eStart, eStartNew, eEnd, eMax, r; 300675d3a19aSMatthew G. Knepley PetscErrorCode ierr; 300775d3a19aSMatthew G. Knepley 300875d3a19aSMatthew G. Knepley PetscFunctionBegin; 300975d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 301075d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr); 301175d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 301275d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 3013d963de37SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3014d963de37SMatthew G. Knepley ierr = GetDepthStart_Private(depth, depthSize, &cStartNew, &fStartNew, &eStartNew, &vStartNew);CHKERRQ(ierr); 301575d3a19aSMatthew G. Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 301675d3a19aSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, &fMax, &eMax, &vMax);CHKERRQ(ierr); 301775d3a19aSMatthew G. Knepley switch (refiner) { 301875d3a19aSMatthew G. Knepley case 3: 301975d3a19aSMatthew G. Knepley if (cMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No cell maximum specified in hybrid mesh"); 302075d3a19aSMatthew G. Knepley cMax = PetscMin(cEnd, cMax); 302175d3a19aSMatthew G. Knepley if (fMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No face maximum specified in hybrid mesh"); 302275d3a19aSMatthew G. Knepley fMax = PetscMin(fEnd, fMax); 302375d3a19aSMatthew G. Knepley } 302475d3a19aSMatthew G. Knepley for (l = 0; l < numLabels; ++l) { 302575d3a19aSMatthew G. Knepley DMLabel label, labelNew; 302675d3a19aSMatthew G. Knepley const char *lname; 302775d3a19aSMatthew G. Knepley PetscBool isDepth; 302875d3a19aSMatthew G. Knepley IS valueIS; 302975d3a19aSMatthew G. Knepley const PetscInt *values; 303075d3a19aSMatthew G. Knepley PetscInt numValues, val; 303175d3a19aSMatthew G. Knepley 303275d3a19aSMatthew G. Knepley ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr); 303375d3a19aSMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 303475d3a19aSMatthew G. Knepley if (isDepth) continue; 303575d3a19aSMatthew G. Knepley ierr = DMPlexCreateLabel(rdm, lname);CHKERRQ(ierr); 303675d3a19aSMatthew G. Knepley ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr); 303775d3a19aSMatthew G. Knepley ierr = DMPlexGetLabel(rdm, lname, &labelNew);CHKERRQ(ierr); 303875d3a19aSMatthew G. Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 303975d3a19aSMatthew G. Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 304075d3a19aSMatthew G. Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 304175d3a19aSMatthew G. Knepley for (val = 0; val < numValues; ++val) { 304275d3a19aSMatthew G. Knepley IS pointIS; 304375d3a19aSMatthew G. Knepley const PetscInt *points; 304475d3a19aSMatthew G. Knepley PetscInt numPoints, n; 304575d3a19aSMatthew G. Knepley 304675d3a19aSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 304775d3a19aSMatthew G. Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 304875d3a19aSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 304975d3a19aSMatthew G. Knepley for (n = 0; n < numPoints; ++n) { 305075d3a19aSMatthew G. Knepley const PetscInt p = points[n]; 305175d3a19aSMatthew G. Knepley switch (refiner) { 305275d3a19aSMatthew G. Knepley case 1: 305375d3a19aSMatthew G. Knepley /* Simplicial 2D */ 305475d3a19aSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 305575d3a19aSMatthew G. Knepley /* Old vertices stay the same */ 305675d3a19aSMatthew G. Knepley newp = vStartNew + (p - vStart); 305775d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 305875d3a19aSMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 305975d3a19aSMatthew G. Knepley /* Old faces add new faces and vertex */ 306075d3a19aSMatthew G. Knepley newp = vStartNew + (vEnd - vStart) + (p - fStart); 306175d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 306275d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 306375d3a19aSMatthew G. Knepley newp = fStartNew + (p - fStart)*2 + r; 306475d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 306575d3a19aSMatthew G. Knepley } 306675d3a19aSMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 306775d3a19aSMatthew G. Knepley /* Old cells add new cells and interior faces */ 306875d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 306975d3a19aSMatthew G. Knepley newp = cStartNew + (p - cStart)*4 + r; 307075d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 307175d3a19aSMatthew G. Knepley } 307275d3a19aSMatthew G. Knepley for (r = 0; r < 3; ++r) { 307375d3a19aSMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*2 + (p - cStart)*3 + r; 307475d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 307575d3a19aSMatthew G. Knepley } 307675d3a19aSMatthew G. Knepley } 307775d3a19aSMatthew G. Knepley break; 307875d3a19aSMatthew G. Knepley case 2: 307975d3a19aSMatthew G. Knepley /* Hex 2D */ 308075d3a19aSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 308175d3a19aSMatthew G. Knepley /* Old vertices stay the same */ 308275d3a19aSMatthew G. Knepley newp = vStartNew + (p - vStart); 308375d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 308475d3a19aSMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 308575d3a19aSMatthew G. Knepley /* Old faces add new faces and vertex */ 308675d3a19aSMatthew G. Knepley newp = vStartNew + (vEnd - vStart) + (p - fStart); 308775d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 308875d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 308975d3a19aSMatthew G. Knepley newp = fStartNew + (p - fStart)*2 + r; 309075d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 309175d3a19aSMatthew G. Knepley } 309275d3a19aSMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 309375d3a19aSMatthew G. Knepley /* Old cells add new cells and interior faces and vertex */ 309475d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 309575d3a19aSMatthew G. Knepley newp = cStartNew + (p - cStart)*4 + r; 309675d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 309775d3a19aSMatthew G. Knepley } 309875d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 309975d3a19aSMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*2 + (p - cStart)*4 + r; 310075d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 310175d3a19aSMatthew G. Knepley } 310275d3a19aSMatthew G. Knepley newp = vStartNew + (vEnd - vStart) + (fEnd - fStart) + (p - cStart); 310375d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 310475d3a19aSMatthew G. Knepley } 310575d3a19aSMatthew G. Knepley break; 310675d3a19aSMatthew G. Knepley case 3: 310775d3a19aSMatthew G. Knepley /* Hybrid simplicial 2D */ 310875d3a19aSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 310975d3a19aSMatthew G. Knepley /* Old vertices stay the same */ 311075d3a19aSMatthew G. Knepley newp = vStartNew + (p - vStart); 311175d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 311275d3a19aSMatthew G. Knepley } else if ((p >= fStart) && (p < fMax)) { 311375d3a19aSMatthew G. Knepley /* Old interior faces add new faces and vertex */ 311475d3a19aSMatthew G. Knepley newp = vStartNew + (vEnd - vStart) + (p - fStart); 311575d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 311675d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 311775d3a19aSMatthew G. Knepley newp = fStartNew + (p - fStart)*2 + r; 311875d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 311975d3a19aSMatthew G. Knepley } 312075d3a19aSMatthew G. Knepley } else if ((p >= fMax) && (p < fEnd)) { 312175d3a19aSMatthew G. Knepley /* Old hybrid faces stay the same */ 312275d3a19aSMatthew G. Knepley newp = fStartNew + (fMax - fStart)*2 + (p - fMax); 312375d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 312475d3a19aSMatthew G. Knepley } else if ((p >= cStart) && (p < cMax)) { 312575d3a19aSMatthew G. Knepley /* Old interior cells add new cells and interior faces */ 312675d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 312775d3a19aSMatthew G. Knepley newp = cStartNew + (p - cStart)*4 + r; 312875d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 312975d3a19aSMatthew G. Knepley } 313075d3a19aSMatthew G. Knepley for (r = 0; r < 3; ++r) { 313175d3a19aSMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*2 + (p - cStart)*3 + r; 313275d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 313375d3a19aSMatthew G. Knepley } 313475d3a19aSMatthew G. Knepley } else if ((p >= cMax) && (p < cEnd)) { 313575d3a19aSMatthew G. Knepley /* Old hybrid cells add new cells and hybrid face */ 313675d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 313775d3a19aSMatthew G. Knepley newp = cStartNew + (cMax - cStart)*4 + (p - cMax)*2 + r; 313875d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 313975d3a19aSMatthew G. Knepley } 314075d3a19aSMatthew G. Knepley newp = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (p - cMax); 314175d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 314275d3a19aSMatthew G. Knepley } 314375d3a19aSMatthew G. Knepley break; 3144b5da9499SMatthew G. Knepley case 5: 3145b5da9499SMatthew G. Knepley /* Simplicial 3D */ 3146b5da9499SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 3147b5da9499SMatthew G. Knepley /* Old vertices stay the same */ 3148b5da9499SMatthew G. Knepley newp = vStartNew + (p - vStart); 3149b5da9499SMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 3150b5da9499SMatthew G. Knepley } else if ((p >= eStart) && (p < eEnd)) { 3151b5da9499SMatthew G. Knepley /* Old edges add new edges and vertex */ 3152b5da9499SMatthew G. Knepley for (r = 0; r < 2; ++r) { 3153b5da9499SMatthew G. Knepley newp = eStartNew + (p - eStart)*2 + r; 3154b5da9499SMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 3155b5da9499SMatthew G. Knepley } 3156b5da9499SMatthew G. Knepley newp = vStartNew + (vEnd - vStart) + (p - eStart); 3157b5da9499SMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 3158b5da9499SMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 3159b5da9499SMatthew G. Knepley /* Old faces add new faces and edges */ 3160b5da9499SMatthew G. Knepley for (r = 0; r < 4; ++r) { 3161b5da9499SMatthew G. Knepley newp = fStartNew + (p - fStart)*4 + r; 3162b5da9499SMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 3163b5da9499SMatthew G. Knepley } 3164b5da9499SMatthew G. Knepley for (r = 0; r < 3; ++r) { 3165b5da9499SMatthew G. Knepley newp = eStartNew + (eEnd - eStart)*2 + (p - fStart)*3 + r; 3166b5da9499SMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 3167b5da9499SMatthew G. Knepley } 3168b5da9499SMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 3169b5da9499SMatthew G. Knepley /* Old cells add new cells and interior faces and edges */ 3170b5da9499SMatthew G. Knepley for (r = 0; r < 8; ++r) { 3171b5da9499SMatthew G. Knepley newp = cStartNew + (p - cStart)*8 + r; 3172b5da9499SMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 3173b5da9499SMatthew G. Knepley } 3174b5da9499SMatthew G. Knepley for (r = 0; r < 8; ++r) { 3175b5da9499SMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*4 + (p - cStart)*8 + r; 3176b5da9499SMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 3177b5da9499SMatthew G. Knepley } 3178b5da9499SMatthew G. Knepley for (r = 0; r < 1; ++r) { 3179b5da9499SMatthew G. Knepley newp = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*3 + (p - cStart)*1 + r; 3180b5da9499SMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 3181b5da9499SMatthew G. Knepley } 3182b5da9499SMatthew G. Knepley } 3183b5da9499SMatthew G. Knepley break; 31842eabf88fSMatthew G. Knepley case 6: 31852eabf88fSMatthew G. Knepley /* Hex 3D */ 31862eabf88fSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 31872eabf88fSMatthew G. Knepley /* Old vertices stay the same */ 31882eabf88fSMatthew G. Knepley newp = vStartNew + (p - vStart); 31892eabf88fSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 31902eabf88fSMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 31912eabf88fSMatthew G. Knepley /* Old edges add new edges and vertex */ 31922eabf88fSMatthew G. Knepley for (r = 0; r < 2; ++r) { 31932eabf88fSMatthew G. Knepley newp = eStartNew + (p - eStart)*2 + r; 31942eabf88fSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 31952eabf88fSMatthew G. Knepley } 31962eabf88fSMatthew G. Knepley newp = vStartNew + (vEnd - vStart) + (p - eStart); 31972eabf88fSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 31982eabf88fSMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 31992eabf88fSMatthew G. Knepley /* Old faces add new faces, edges, and vertex */ 32002eabf88fSMatthew G. Knepley for (r = 0; r < 4; ++r) { 32012eabf88fSMatthew G. Knepley newp = fStartNew + (p - fStart)*4 + r; 32022eabf88fSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 32032eabf88fSMatthew G. Knepley } 32042eabf88fSMatthew G. Knepley for (r = 0; r < 4; ++r) { 32052eabf88fSMatthew G. Knepley newp = eStartNew + (eEnd - eStart)*2 + (p - fStart)*4 + r; 32062eabf88fSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 32072eabf88fSMatthew G. Knepley } 32082eabf88fSMatthew G. Knepley newp = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (p - fStart); 32092eabf88fSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 32102eabf88fSMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 32112eabf88fSMatthew G. Knepley /* Old cells add new cells, faces, edges, and vertex */ 32122eabf88fSMatthew G. Knepley for (r = 0; r < 8; ++r) { 32132eabf88fSMatthew G. Knepley newp = cStartNew + (p - cStart)*8 + r; 32142eabf88fSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 32152eabf88fSMatthew G. Knepley } 32162eabf88fSMatthew G. Knepley for (r = 0; r < 12; ++r) { 32172eabf88fSMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*4 + (p - cStart)*12 + r; 32182eabf88fSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 32192eabf88fSMatthew G. Knepley } 32202eabf88fSMatthew G. Knepley for (r = 0; r < 6; ++r) { 32212eabf88fSMatthew G. Knepley newp = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (p - cStart)*6 + r; 32222eabf88fSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 32232eabf88fSMatthew G. Knepley } 32242eabf88fSMatthew G. Knepley newp = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (fEnd - fStart) + (p - cStart); 32252eabf88fSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 32262eabf88fSMatthew G. Knepley } 32272eabf88fSMatthew G. Knepley break; 322875d3a19aSMatthew G. Knepley default: 322975d3a19aSMatthew G. Knepley SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Unknown cell refiner %d", refiner); 323075d3a19aSMatthew G. Knepley } 323175d3a19aSMatthew G. Knepley } 323275d3a19aSMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 323375d3a19aSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 323475d3a19aSMatthew G. Knepley } 323575d3a19aSMatthew G. Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 323675d3a19aSMatthew G. Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 323775d3a19aSMatthew G. Knepley if (0) { 323875d3a19aSMatthew G. Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 323975d3a19aSMatthew G. Knepley ierr = DMLabelView(labelNew, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 324075d3a19aSMatthew G. Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 324175d3a19aSMatthew G. Knepley } 324275d3a19aSMatthew G. Knepley } 324375d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 324475d3a19aSMatthew G. Knepley } 324575d3a19aSMatthew G. Knepley 324675d3a19aSMatthew G. Knepley #undef __FUNCT__ 3247509c9b89SMatthew G. Knepley #define __FUNCT__ "DMPlexRefineUniform_Internal" 324875d3a19aSMatthew G. Knepley /* This will only work for interpolated meshes */ 3249509c9b89SMatthew G. Knepley PetscErrorCode DMPlexRefineUniform_Internal(DM dm, CellRefiner cellRefiner, DM *dmRefined) 325075d3a19aSMatthew G. Knepley { 325175d3a19aSMatthew G. Knepley DM rdm; 325275d3a19aSMatthew G. Knepley PetscInt *depthSize; 325375d3a19aSMatthew G. Knepley PetscInt dim, depth = 0, d, pStart = 0, pEnd = 0; 325475d3a19aSMatthew G. Knepley PetscErrorCode ierr; 325575d3a19aSMatthew G. Knepley 325675d3a19aSMatthew G. Knepley PetscFunctionBegin; 325775d3a19aSMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &rdm);CHKERRQ(ierr); 325875d3a19aSMatthew G. Knepley ierr = DMSetType(rdm, DMPLEX);CHKERRQ(ierr); 325975d3a19aSMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 326075d3a19aSMatthew G. Knepley ierr = DMPlexSetDimension(rdm, dim);CHKERRQ(ierr); 326175d3a19aSMatthew G. Knepley /* Calculate number of new points of each depth */ 326275d3a19aSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 326375d3a19aSMatthew G. Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthSize);CHKERRQ(ierr); 326475d3a19aSMatthew G. Knepley ierr = PetscMemzero(depthSize, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 326575d3a19aSMatthew G. Knepley ierr = CellRefinerGetSizes(cellRefiner, dm, depthSize);CHKERRQ(ierr); 326675d3a19aSMatthew G. Knepley /* Step 1: Set chart */ 326775d3a19aSMatthew G. Knepley for (d = 0; d <= depth; ++d) pEnd += depthSize[d]; 326875d3a19aSMatthew G. Knepley ierr = DMPlexSetChart(rdm, pStart, pEnd);CHKERRQ(ierr); 326975d3a19aSMatthew G. Knepley /* Step 2: Set cone/support sizes */ 327075d3a19aSMatthew G. Knepley ierr = CellRefinerSetConeSizes(cellRefiner, dm, depthSize, rdm);CHKERRQ(ierr); 327175d3a19aSMatthew G. Knepley /* Step 3: Setup refined DM */ 327275d3a19aSMatthew G. Knepley ierr = DMSetUp(rdm);CHKERRQ(ierr); 327375d3a19aSMatthew G. Knepley /* Step 4: Set cones and supports */ 327475d3a19aSMatthew G. Knepley ierr = CellRefinerSetCones(cellRefiner, dm, depthSize, rdm);CHKERRQ(ierr); 327575d3a19aSMatthew G. Knepley /* Step 5: Stratify */ 327675d3a19aSMatthew G. Knepley ierr = DMPlexStratify(rdm);CHKERRQ(ierr); 327775d3a19aSMatthew G. Knepley /* Step 6: Set coordinates for vertices */ 327875d3a19aSMatthew G. Knepley ierr = CellRefinerSetCoordinates(cellRefiner, dm, depthSize, rdm);CHKERRQ(ierr); 327975d3a19aSMatthew G. Knepley /* Step 7: Create pointSF */ 328075d3a19aSMatthew G. Knepley ierr = CellRefinerCreateSF(cellRefiner, dm, depthSize, rdm);CHKERRQ(ierr); 328175d3a19aSMatthew G. Knepley /* Step 8: Create labels */ 328275d3a19aSMatthew G. Knepley ierr = CellRefinerCreateLabels(cellRefiner, dm, depthSize, rdm);CHKERRQ(ierr); 328375d3a19aSMatthew G. Knepley ierr = PetscFree(depthSize);CHKERRQ(ierr); 328475d3a19aSMatthew G. Knepley 328575d3a19aSMatthew G. Knepley *dmRefined = rdm; 328675d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 328775d3a19aSMatthew G. Knepley } 328875d3a19aSMatthew G. Knepley 328975d3a19aSMatthew G. Knepley #undef __FUNCT__ 329075d3a19aSMatthew G. Knepley #define __FUNCT__ "DMPlexSetRefinementUniform" 329175d3a19aSMatthew G. Knepley PetscErrorCode DMPlexSetRefinementUniform(DM dm, PetscBool refinementUniform) 329275d3a19aSMatthew G. Knepley { 329375d3a19aSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 329475d3a19aSMatthew G. Knepley 329575d3a19aSMatthew G. Knepley PetscFunctionBegin; 329675d3a19aSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 329775d3a19aSMatthew G. Knepley mesh->refinementUniform = refinementUniform; 329875d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 329975d3a19aSMatthew G. Knepley } 330075d3a19aSMatthew G. Knepley 330175d3a19aSMatthew G. Knepley #undef __FUNCT__ 330275d3a19aSMatthew G. Knepley #define __FUNCT__ "DMPlexGetRefinementUniform" 330375d3a19aSMatthew G. Knepley PetscErrorCode DMPlexGetRefinementUniform(DM dm, PetscBool *refinementUniform) 330475d3a19aSMatthew G. Knepley { 330575d3a19aSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 330675d3a19aSMatthew G. Knepley 330775d3a19aSMatthew G. Knepley PetscFunctionBegin; 330875d3a19aSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 330975d3a19aSMatthew G. Knepley PetscValidPointer(refinementUniform, 2); 331075d3a19aSMatthew G. Knepley *refinementUniform = mesh->refinementUniform; 331175d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 331275d3a19aSMatthew G. Knepley } 331375d3a19aSMatthew G. Knepley 331475d3a19aSMatthew G. Knepley #undef __FUNCT__ 331575d3a19aSMatthew G. Knepley #define __FUNCT__ "DMPlexSetRefinementLimit" 331675d3a19aSMatthew G. Knepley PetscErrorCode DMPlexSetRefinementLimit(DM dm, PetscReal refinementLimit) 331775d3a19aSMatthew G. Knepley { 331875d3a19aSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 331975d3a19aSMatthew G. Knepley 332075d3a19aSMatthew G. Knepley PetscFunctionBegin; 332175d3a19aSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 332275d3a19aSMatthew G. Knepley mesh->refinementLimit = refinementLimit; 332375d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 332475d3a19aSMatthew G. Knepley } 332575d3a19aSMatthew G. Knepley 332675d3a19aSMatthew G. Knepley #undef __FUNCT__ 332775d3a19aSMatthew G. Knepley #define __FUNCT__ "DMPlexGetRefinementLimit" 332875d3a19aSMatthew G. Knepley PetscErrorCode DMPlexGetRefinementLimit(DM dm, PetscReal *refinementLimit) 332975d3a19aSMatthew G. Knepley { 333075d3a19aSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 333175d3a19aSMatthew G. Knepley 333275d3a19aSMatthew G. Knepley PetscFunctionBegin; 333375d3a19aSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 333475d3a19aSMatthew G. Knepley PetscValidPointer(refinementLimit, 2); 333575d3a19aSMatthew G. Knepley /* if (mesh->refinementLimit < 0) = getMaxVolume()/2.0; */ 333675d3a19aSMatthew G. Knepley *refinementLimit = mesh->refinementLimit; 333775d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 333875d3a19aSMatthew G. Knepley } 333975d3a19aSMatthew G. Knepley 334075d3a19aSMatthew G. Knepley #undef __FUNCT__ 3341509c9b89SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCellRefiner_Internal" 3342509c9b89SMatthew G. Knepley PetscErrorCode DMPlexGetCellRefiner_Internal(DM dm, CellRefiner *cellRefiner) 334375d3a19aSMatthew G. Knepley { 334475d3a19aSMatthew G. Knepley PetscInt dim, cStart, coneSize, cMax; 334575d3a19aSMatthew G. Knepley PetscErrorCode ierr; 334675d3a19aSMatthew G. Knepley 334775d3a19aSMatthew G. Knepley PetscFunctionBegin; 334875d3a19aSMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 334975d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, NULL);CHKERRQ(ierr); 335075d3a19aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr); 335175d3a19aSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 335275d3a19aSMatthew G. Knepley switch (dim) { 335375d3a19aSMatthew G. Knepley case 2: 335475d3a19aSMatthew G. Knepley switch (coneSize) { 335575d3a19aSMatthew G. Knepley case 3: 335675d3a19aSMatthew G. Knepley if (cMax >= 0) *cellRefiner = 3; /* Hybrid */ 335775d3a19aSMatthew G. Knepley else *cellRefiner = 1; /* Triangular */ 335875d3a19aSMatthew G. Knepley break; 335975d3a19aSMatthew G. Knepley case 4: 336075d3a19aSMatthew G. Knepley if (cMax >= 0) *cellRefiner = 4; /* Hybrid */ 336175d3a19aSMatthew G. Knepley else *cellRefiner = 2; /* Quadrilateral */ 336275d3a19aSMatthew G. Knepley break; 336375d3a19aSMatthew G. Knepley default: 336475d3a19aSMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Unknown coneSize %d in dimension %d for cell refiner", coneSize, dim); 336575d3a19aSMatthew G. Knepley } 336675d3a19aSMatthew G. Knepley break; 3367b5da9499SMatthew G. Knepley case 3: 3368b5da9499SMatthew G. Knepley switch (coneSize) { 3369b5da9499SMatthew G. Knepley case 4: 3370b5da9499SMatthew G. Knepley if (cMax >= 0) *cellRefiner = 7; /* Hybrid */ 3371b5da9499SMatthew G. Knepley else *cellRefiner = 5; /* Tetrahedral */ 3372b5da9499SMatthew G. Knepley break; 33732eabf88fSMatthew G. Knepley case 6: 33742eabf88fSMatthew G. Knepley if (cMax >= 0) *cellRefiner = 8; /* Hybrid */ 33752eabf88fSMatthew G. Knepley else *cellRefiner = 6; /* hexahedral */ 33762eabf88fSMatthew G. Knepley break; 3377b5da9499SMatthew G. Knepley default: 3378b5da9499SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Unknown coneSize %d in dimension %d for cell refiner", coneSize, dim); 3379b5da9499SMatthew G. Knepley } 3380b5da9499SMatthew G. Knepley break; 338175d3a19aSMatthew G. Knepley default: 338275d3a19aSMatthew G. Knepley SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Unknown dimension %d for cell refiner", dim); 338375d3a19aSMatthew G. Knepley } 338475d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 338575d3a19aSMatthew G. Knepley } 3386