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__ 2975d3a19aSMatthew G. Knepley #define __FUNCT__ "CellRefinerGetSizes" 3075d3a19aSMatthew G. Knepley PetscErrorCode CellRefinerGetSizes(CellRefiner refiner, DM dm, PetscInt depthSize[]) 3175d3a19aSMatthew G. Knepley { 326ce3c06aSMatthew G. Knepley PetscInt cStart, cEnd, cMax, vStart, vEnd, vMax, fStart, fEnd, fMax, eStart, eEnd, eMax; 3375d3a19aSMatthew G. Knepley PetscErrorCode ierr; 3475d3a19aSMatthew G. Knepley 3575d3a19aSMatthew G. Knepley PetscFunctionBegin; 3675d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3775d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr); 3875d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3975d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 4075d3a19aSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, &fMax, &eMax, &vMax);CHKERRQ(ierr); 4175d3a19aSMatthew G. Knepley switch (refiner) { 4275d3a19aSMatthew G. Knepley case 1: 4375d3a19aSMatthew G. Knepley /* Simplicial 2D */ 4475d3a19aSMatthew G. Knepley depthSize[0] = vEnd - vStart + fEnd - fStart; /* Add a vertex on every face */ 4575d3a19aSMatthew 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 */ 4675d3a19aSMatthew G. Knepley depthSize[2] = 4*(cEnd - cStart); /* Every cell split into 4 cells */ 4775d3a19aSMatthew G. Knepley break; 4875d3a19aSMatthew G. Knepley case 3: 49d963de37SMatthew G. Knepley /* Hybrid Simplicial 2D */ 5075d3a19aSMatthew G. Knepley if (cMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No cell maximum specified in hybrid mesh"); 5175d3a19aSMatthew G. Knepley if (fMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No face maximum specified in hybrid mesh"); 5275d3a19aSMatthew G. Knepley depthSize[0] = vEnd - vStart + fMax - fStart; /* Add a vertex on every face, but not hybrid faces */ 5375d3a19aSMatthew 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 */ 5475d3a19aSMatthew G. Knepley depthSize[2] = 4*(cMax - cStart) + 2*(cEnd - cMax); /* Interior cells split into 4 cells, Hybrid cells split into 2 cells */ 5575d3a19aSMatthew G. Knepley break; 5675d3a19aSMatthew G. Knepley case 2: 5775d3a19aSMatthew G. Knepley /* Hex 2D */ 5875d3a19aSMatthew G. Knepley depthSize[0] = vEnd - vStart + cEnd - cStart + fEnd - fStart; /* Add a vertex on every face and cell */ 5975d3a19aSMatthew 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 */ 6075d3a19aSMatthew G. Knepley depthSize[2] = 4*(cEnd - cStart); /* Every cell split into 4 cells */ 6175d3a19aSMatthew G. Knepley break; 62b5da9499SMatthew G. Knepley case 5: 63b5da9499SMatthew G. Knepley /* Simplicial 3D */ 64b5da9499SMatthew G. Knepley depthSize[0] = vEnd - vStart + eEnd - eStart; /* Add a vertex on every edge */ 65b5da9499SMatthew 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 */ 66b5da9499SMatthew G. Knepley depthSize[2] = 4*(fEnd - fStart) + 8*(cEnd - cStart); /* Every face split into 4 faces and 8 faces are added for each cell */ 67b5da9499SMatthew G. Knepley depthSize[3] = 8*(cEnd - cStart); /* Every cell split into 8 cells */ 68b5da9499SMatthew G. Knepley break; 69b5da9499SMatthew G. Knepley case 7: 70b5da9499SMatthew G. Knepley /* Hybrid Simplicial 3D */ 71b5da9499SMatthew G. Knepley if (cMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No cell maximum specified in hybrid mesh"); 726ce3c06aSMatthew G. Knepley if (fMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No face maximum specified in hybrid mesh"); 73b5da9499SMatthew G. Knepley if (eMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No edge maximum specified in hybrid mesh"); 74dae4404aSMatthew G. Knepley /* Tetrahedra */ 75dae4404aSMatthew G. Knepley depthSize[0] = vEnd - vStart + eMax - eStart; /* Add a vertex on every interior edge */ 76dae4404aSMatthew G. Knepley depthSize[1] = 2*(eMax - eStart) + 3*(fMax - fStart) + (cMax - cStart); /* Every interior edge split into 2 edges, 3 edges added for each interior face, 1 edge for each interior cell */ 77dae4404aSMatthew G. Knepley depthSize[2] = 4*(fMax - fStart) + 8*(cMax - cStart); /* Every interior face split into 4 faces, 8 faces added for each interior cell */ 78dae4404aSMatthew G. Knepley depthSize[3] = 8*(cMax - cStart); /* Every interior cell split into 8 cells */ 79dae4404aSMatthew G. Knepley /* Triangular Prisms */ 80dae4404aSMatthew G. Knepley depthSize[0] += 0; /* No hybrid vertices */ 81dae4404aSMatthew G. Knepley depthSize[1] += (eEnd - eMax) + (fEnd - fMax); /* Every hybrid edge remains, 1 edge for every hybrid face */ 826ce3c06aSMatthew G. Knepley depthSize[2] += 2*(fEnd - fMax) + 3*(cEnd - cMax); /* Every hybrid face split into 2 faces and 3 faces are added for each hybrid cell */ 83dae4404aSMatthew G. Knepley depthSize[3] += 4*(cEnd - cMax); /* Every hybrid cell split into 4 cells */ 84b5da9499SMatthew G. Knepley break; 856ce3c06aSMatthew G. Knepley case 6: 866ce3c06aSMatthew G. Knepley /* Hex 3D */ 876ce3c06aSMatthew G. Knepley depthSize[0] = vEnd - vStart + eEnd - eStart + fEnd - fStart + cEnd - cStart; /* Add a vertex on every edge, face and cell */ 886ce3c06aSMatthew 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 */ 896ce3c06aSMatthew 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 */ 906ce3c06aSMatthew G. Knepley depthSize[3] = 8*(cEnd - cStart); /* Every cell split into 8 cells */ 916ce3c06aSMatthew G. Knepley break; 9275d3a19aSMatthew G. Knepley default: 9375d3a19aSMatthew G. Knepley SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Unknown cell refiner %d", refiner); 9475d3a19aSMatthew G. Knepley } 9575d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 9675d3a19aSMatthew G. Knepley } 9775d3a19aSMatthew G. Knepley 9842525629SMatthew G. Knepley /* Return triangle edge for orientation o, if it is r for o == 0 */ 9942525629SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt GetTriEdge_Static(PetscInt o, PetscInt r) { 100518a8359SMatthew G. Knepley return (o < 0 ? 2-(o+r) : o+r)%3; 101518a8359SMatthew G. Knepley } 102518a8359SMatthew G. Knepley 103518a8359SMatthew G. Knepley /* Return triangle subface for orientation o, if it is r for o == 0 */ 104518a8359SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt GetTriSubface_Static(PetscInt o, PetscInt r) { 105*4bae88c7SMatthew G. Knepley return (o < 0 ? 3-(o+r) : o+r)%3; 10642525629SMatthew G. Knepley } 10742525629SMatthew G. Knepley 108e3f8b1d6SMatthew G. Knepley /* Return quad edge for orientation o, if it is r for o == 0 */ 109e3f8b1d6SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt GetQuadEdge_Static(PetscInt o, PetscInt r) { 110e3f8b1d6SMatthew G. Knepley return (o < 0 ? 3-(o+r) : o+r)%4; 111e3f8b1d6SMatthew G. Knepley } 112e3f8b1d6SMatthew G. Knepley 113e3f8b1d6SMatthew G. Knepley /* Return quad subface for orientation o, if it is r for o == 0 */ 114e3f8b1d6SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt GetQuadSubface_Static(PetscInt o, PetscInt r) { 115*4bae88c7SMatthew G. Knepley return (o < 0 ? 4-(o+r) : o+r)%4; 11642525629SMatthew G. Knepley } 11742525629SMatthew G. Knepley 11875d3a19aSMatthew G. Knepley #undef __FUNCT__ 11975d3a19aSMatthew G. Knepley #define __FUNCT__ "CellRefinerSetConeSizes" 12075d3a19aSMatthew G. Knepley PetscErrorCode CellRefinerSetConeSizes(CellRefiner refiner, DM dm, PetscInt depthSize[], DM rdm) 12175d3a19aSMatthew G. Knepley { 122b5da9499SMatthew 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; 12375d3a19aSMatthew G. Knepley PetscErrorCode ierr; 12475d3a19aSMatthew G. Knepley 12575d3a19aSMatthew G. Knepley PetscFunctionBegin; 12675d3a19aSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 12775d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 12875d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr); 12975d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 13075d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 13175d3a19aSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, &fMax, &eMax, &vMax);CHKERRQ(ierr); 13275d3a19aSMatthew G. Knepley ierr = GetDepthStart_Private(depth, depthSize, &cStartNew, &fStartNew, &eStartNew, &vStartNew);CHKERRQ(ierr); 13375d3a19aSMatthew G. Knepley switch (refiner) { 13475d3a19aSMatthew G. Knepley case 1: 13575d3a19aSMatthew G. Knepley /* Simplicial 2D */ 13675d3a19aSMatthew G. Knepley /* All cells have 3 faces */ 13775d3a19aSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 13875d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 13975d3a19aSMatthew G. Knepley const PetscInt newp = (c - cStart)*4 + r; 14075d3a19aSMatthew G. Knepley 14175d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 3);CHKERRQ(ierr); 14275d3a19aSMatthew G. Knepley } 14375d3a19aSMatthew G. Knepley } 14475d3a19aSMatthew G. Knepley /* Split faces have 2 vertices and the same cells as the parent */ 14575d3a19aSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 14675d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 14775d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*2 + r; 14875d3a19aSMatthew G. Knepley PetscInt size; 14975d3a19aSMatthew G. Knepley 15075d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 15175d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 15275d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 15375d3a19aSMatthew G. Knepley } 15475d3a19aSMatthew G. Knepley } 15575d3a19aSMatthew G. Knepley /* Interior faces have 2 vertices and 2 cells */ 15675d3a19aSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 15775d3a19aSMatthew G. Knepley for (r = 0; r < 3; ++r) { 15875d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (fEnd - fStart)*2 + (c - cStart)*3 + r; 15975d3a19aSMatthew G. Knepley 16075d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 16175d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2);CHKERRQ(ierr); 16275d3a19aSMatthew G. Knepley } 16375d3a19aSMatthew G. Knepley } 16475d3a19aSMatthew G. Knepley /* Old vertices have identical supports */ 16575d3a19aSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 16675d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 16775d3a19aSMatthew G. Knepley PetscInt size; 16875d3a19aSMatthew G. Knepley 16975d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 17075d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 17175d3a19aSMatthew G. Knepley } 17275d3a19aSMatthew G. Knepley /* Face vertices have 2 + cells*2 supports */ 17375d3a19aSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 17475d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (f - fStart); 17575d3a19aSMatthew G. Knepley PetscInt size; 17675d3a19aSMatthew G. Knepley 17775d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 17875d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2 + size*2);CHKERRQ(ierr); 17975d3a19aSMatthew G. Knepley } 18075d3a19aSMatthew G. Knepley break; 18175d3a19aSMatthew G. Knepley case 2: 18275d3a19aSMatthew G. Knepley /* Hex 2D */ 18375d3a19aSMatthew G. Knepley /* All cells have 4 faces */ 18475d3a19aSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 18575d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 18675d3a19aSMatthew G. Knepley const PetscInt newp = (c - cStart)*4 + r; 18775d3a19aSMatthew G. Knepley 18875d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 4);CHKERRQ(ierr); 18975d3a19aSMatthew G. Knepley } 19075d3a19aSMatthew G. Knepley } 19175d3a19aSMatthew G. Knepley /* Split faces have 2 vertices and the same cells as the parent */ 19275d3a19aSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 19375d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 19475d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*2 + r; 19575d3a19aSMatthew G. Knepley PetscInt size; 19675d3a19aSMatthew G. Knepley 19775d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 19875d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 19975d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 20075d3a19aSMatthew G. Knepley } 20175d3a19aSMatthew G. Knepley } 20275d3a19aSMatthew G. Knepley /* Interior faces have 2 vertices and 2 cells */ 20375d3a19aSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 20475d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 20575d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + r; 20675d3a19aSMatthew G. Knepley 20775d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 20875d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2);CHKERRQ(ierr); 20975d3a19aSMatthew G. Knepley } 21075d3a19aSMatthew G. Knepley } 21175d3a19aSMatthew G. Knepley /* Old vertices have identical supports */ 21275d3a19aSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 21375d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 21475d3a19aSMatthew G. Knepley PetscInt size; 21575d3a19aSMatthew G. Knepley 21675d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 21775d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 21875d3a19aSMatthew G. Knepley } 21975d3a19aSMatthew G. Knepley /* Face vertices have 2 + cells supports */ 22075d3a19aSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 22175d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (f - fStart); 22275d3a19aSMatthew G. Knepley PetscInt size; 22375d3a19aSMatthew G. Knepley 22475d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 22575d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2 + size);CHKERRQ(ierr); 22675d3a19aSMatthew G. Knepley } 22775d3a19aSMatthew G. Knepley /* Cell vertices have 4 supports */ 22875d3a19aSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 22975d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (fEnd - fStart) + (c - cStart); 23075d3a19aSMatthew G. Knepley 23175d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 4);CHKERRQ(ierr); 23275d3a19aSMatthew G. Knepley } 23375d3a19aSMatthew G. Knepley break; 23475d3a19aSMatthew G. Knepley case 3: 235d963de37SMatthew G. Knepley /* Hybrid Simplicial 2D */ 23675d3a19aSMatthew G. Knepley if (cMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No cell maximum specified in hybrid mesh"); 23775d3a19aSMatthew G. Knepley cMax = PetscMin(cEnd, cMax); 23875d3a19aSMatthew G. Knepley if (fMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No face maximum specified in hybrid mesh"); 23975d3a19aSMatthew G. Knepley fMax = PetscMin(fEnd, fMax); 24075d3a19aSMatthew G. Knepley ierr = DMPlexSetHybridBounds(rdm, cStartNew + (cMax - cStart)*4, fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 24175d3a19aSMatthew G. Knepley /* Interior cells have 3 faces */ 24275d3a19aSMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 24375d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 24475d3a19aSMatthew G. Knepley const PetscInt newp = cStartNew + (c - cStart)*4 + r; 24575d3a19aSMatthew G. Knepley 24675d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 3);CHKERRQ(ierr); 24775d3a19aSMatthew G. Knepley } 24875d3a19aSMatthew G. Knepley } 24975d3a19aSMatthew G. Knepley /* Hybrid cells have 4 faces */ 25075d3a19aSMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 25175d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 25275d3a19aSMatthew G. Knepley const PetscInt newp = cStartNew + (cMax - cStart)*4 + (c - cMax)*2 + r; 25375d3a19aSMatthew G. Knepley 25475d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 4);CHKERRQ(ierr); 25575d3a19aSMatthew G. Knepley } 25675d3a19aSMatthew G. Knepley } 25775d3a19aSMatthew G. Knepley /* Interior split faces have 2 vertices and the same cells as the parent */ 25875d3a19aSMatthew G. Knepley for (f = fStart; f < fMax; ++f) { 25975d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 26075d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*2 + r; 26175d3a19aSMatthew G. Knepley PetscInt size; 26275d3a19aSMatthew G. Knepley 26375d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 26475d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 26575d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 26675d3a19aSMatthew G. Knepley } 26775d3a19aSMatthew G. Knepley } 26875d3a19aSMatthew G. Knepley /* Interior cell faces have 2 vertices and 2 cells */ 26975d3a19aSMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 27075d3a19aSMatthew G. Knepley for (r = 0; r < 3; ++r) { 27175d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (fMax - fStart)*2 + (c - cStart)*3 + r; 27275d3a19aSMatthew G. Knepley 27375d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 27475d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2);CHKERRQ(ierr); 27575d3a19aSMatthew G. Knepley } 27675d3a19aSMatthew G. Knepley } 27775d3a19aSMatthew G. Knepley /* Hybrid faces have 2 vertices and the same cells */ 27875d3a19aSMatthew G. Knepley for (f = fMax; f < fEnd; ++f) { 27975d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (f - fMax); 28075d3a19aSMatthew G. Knepley PetscInt size; 28175d3a19aSMatthew G. Knepley 28275d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 28375d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 28475d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 28575d3a19aSMatthew G. Knepley } 28675d3a19aSMatthew G. Knepley /* Hybrid cell faces have 2 vertices and 2 cells */ 28775d3a19aSMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 28875d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (fEnd - fMax) + (c - cMax); 28975d3a19aSMatthew G. Knepley 29075d3a19aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 29175d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2);CHKERRQ(ierr); 29275d3a19aSMatthew G. Knepley } 29375d3a19aSMatthew G. Knepley /* Old vertices have identical supports */ 29475d3a19aSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 29575d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 29675d3a19aSMatthew G. Knepley PetscInt size; 29775d3a19aSMatthew G. Knepley 29875d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 29975d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 30075d3a19aSMatthew G. Knepley } 30175d3a19aSMatthew G. Knepley /* Face vertices have 2 + (2 interior, 1 hybrid) supports */ 30275d3a19aSMatthew G. Knepley for (f = fStart; f < fMax; ++f) { 30375d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (f - fStart); 30475d3a19aSMatthew G. Knepley const PetscInt *support; 30575d3a19aSMatthew G. Knepley PetscInt size, newSize = 2, s; 30675d3a19aSMatthew G. Knepley 30775d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 30875d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 30975d3a19aSMatthew G. Knepley for (s = 0; s < size; ++s) { 31075d3a19aSMatthew G. Knepley if (support[s] >= cMax) newSize += 1; 31175d3a19aSMatthew G. Knepley else newSize += 2; 31275d3a19aSMatthew G. Knepley } 31375d3a19aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, newSize);CHKERRQ(ierr); 31475d3a19aSMatthew G. Knepley } 31575d3a19aSMatthew G. Knepley break; 316b5da9499SMatthew G. Knepley case 5: 317b5da9499SMatthew G. Knepley /* Simplicial 3D */ 318b5da9499SMatthew G. Knepley /* All cells have 4 faces */ 319b5da9499SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 320b5da9499SMatthew G. Knepley for (r = 0; r < 8; ++r) { 321dae4404aSMatthew G. Knepley const PetscInt newp = cStartNew + (c - cStart)*8 + r; 322b5da9499SMatthew G. Knepley 323b5da9499SMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 4);CHKERRQ(ierr); 324b5da9499SMatthew G. Knepley } 325b5da9499SMatthew G. Knepley } 326b5da9499SMatthew G. Knepley /* Split faces have 3 edges and the same cells as the parent */ 327b5da9499SMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 328b5da9499SMatthew G. Knepley for (r = 0; r < 4; ++r) { 329b5da9499SMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*4 + r; 330b5da9499SMatthew G. Knepley PetscInt size; 331b5da9499SMatthew G. Knepley 332b5da9499SMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 3);CHKERRQ(ierr); 333b5da9499SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 334b5da9499SMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 335b5da9499SMatthew G. Knepley } 336b5da9499SMatthew G. Knepley } 337b5da9499SMatthew G. Knepley /* Interior faces have 3 edges and 2 cells */ 338b5da9499SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 339b5da9499SMatthew G. Knepley for (r = 0; r < 8; ++r) { 340b5da9499SMatthew G. Knepley const PetscInt newp = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + r; 341b5da9499SMatthew G. Knepley 342b5da9499SMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 3);CHKERRQ(ierr); 343b5da9499SMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2);CHKERRQ(ierr); 344b5da9499SMatthew G. Knepley } 345b5da9499SMatthew G. Knepley } 346b5da9499SMatthew G. Knepley /* Split edges have 2 vertices and the same faces */ 347b5da9499SMatthew G. Knepley for (e = eStart; e < eEnd; ++e) { 348b5da9499SMatthew G. Knepley for (r = 0; r < 2; ++r) { 349b5da9499SMatthew G. Knepley const PetscInt newp = eStartNew + (e - eStart)*2 + r; 350b5da9499SMatthew G. Knepley PetscInt size; 351b5da9499SMatthew G. Knepley 352b5da9499SMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 353b5da9499SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &size);CHKERRQ(ierr); 354b5da9499SMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 355b5da9499SMatthew G. Knepley } 356b5da9499SMatthew G. Knepley } 357b5da9499SMatthew G. Knepley /* Face edges have 2 vertices and 2+cells*(1/2) faces */ 358b5da9499SMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 359b5da9499SMatthew G. Knepley for (r = 0; r < 3; ++r) { 360b5da9499SMatthew G. Knepley const PetscInt newp = eStartNew + (eEnd - eStart)*2 + (f - fStart)*3 + r; 361b5da9499SMatthew G. Knepley const PetscInt *cone, *ornt, *support, eint[4] = {1, 0, 2, 0}; 362b5da9499SMatthew G. Knepley PetscInt coneSize, c, supportSize, s, er, intFaces = 0; 363b5da9499SMatthew G. Knepley 364b5da9499SMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 365b5da9499SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 366b5da9499SMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 367b5da9499SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 368b5da9499SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 369b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 370b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 371b5da9499SMatthew G. Knepley for (c = 0; c < coneSize; ++c) {if (cone[c] == f) break;} 37286f0afeeSMatthew G. Knepley /* Here we want to determine whether edge newp contains a vertex which is part of the cross-tet edge */ 37386f0afeeSMatthew G. Knepley er = ornt[c] < 0 ? (-(ornt[c]+1) + 2-r)%3 : (ornt[c] + r)%3; 374b5da9499SMatthew G. Knepley if (er == eint[c]) { 375b5da9499SMatthew G. Knepley intFaces += 1; 376b5da9499SMatthew G. Knepley } else { 377b5da9499SMatthew G. Knepley intFaces += 2; 378b5da9499SMatthew G. Knepley } 379b5da9499SMatthew G. Knepley } 380b5da9499SMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2+intFaces);CHKERRQ(ierr); 381b5da9499SMatthew G. Knepley } 382b5da9499SMatthew G. Knepley } 383b5da9499SMatthew G. Knepley /* Interior edges have 2 vertices and 4 faces */ 384b5da9499SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 385b5da9499SMatthew G. Knepley const PetscInt newp = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*3 + (c - cStart); 386b5da9499SMatthew G. Knepley 387b5da9499SMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 388b5da9499SMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 4);CHKERRQ(ierr); 389b5da9499SMatthew G. Knepley } 390b5da9499SMatthew G. Knepley /* Old vertices have identical supports */ 391b5da9499SMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 392b5da9499SMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 393b5da9499SMatthew G. Knepley PetscInt size; 394b5da9499SMatthew G. Knepley 395b5da9499SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 396b5da9499SMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 397b5da9499SMatthew G. Knepley } 398b5da9499SMatthew G. Knepley /* Edge vertices have 2 + faces*2 + cells*0/1 supports */ 399b5da9499SMatthew G. Knepley for (e = eStart; e < eEnd; ++e) { 400b5da9499SMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (e - eStart); 401b5da9499SMatthew G. Knepley PetscInt size, *star = NULL, starSize, s, cellSize = 0; 402b5da9499SMatthew G. Knepley 403b5da9499SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &size);CHKERRQ(ierr); 404b5da9499SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, e, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 405b5da9499SMatthew G. Knepley for (s = 0; s < starSize*2; s += 2) { 406b5da9499SMatthew G. Knepley const PetscInt *cone, *ornt; 407b5da9499SMatthew G. Knepley PetscInt e01, e23; 408b5da9499SMatthew G. Knepley 409b5da9499SMatthew G. Knepley if ((star[s] >= cStart) && (star[s] < cEnd)) { 410b5da9499SMatthew G. Knepley /* Check edge 0-1 */ 411b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, star[s], &cone);CHKERRQ(ierr); 412b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, star[s], &ornt);CHKERRQ(ierr); 413b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[0], &cone);CHKERRQ(ierr); 41442525629SMatthew G. Knepley e01 = cone[GetTriEdge_Static(ornt[0], 0)]; 415b5da9499SMatthew G. Knepley /* Check edge 2-3 */ 416b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, star[s], &cone);CHKERRQ(ierr); 417b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, star[s], &ornt);CHKERRQ(ierr); 41842525629SMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[2], &cone);CHKERRQ(ierr); 41942525629SMatthew G. Knepley e23 = cone[GetTriEdge_Static(ornt[2], 1)]; 420b5da9499SMatthew G. Knepley if ((e01 == e) || (e23 == e)) ++cellSize; 421b5da9499SMatthew G. Knepley } 422b5da9499SMatthew G. Knepley } 423b5da9499SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, e, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 424b5da9499SMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2 + size*2 + cellSize);CHKERRQ(ierr); 425b5da9499SMatthew G. Knepley } 426b5da9499SMatthew G. Knepley break; 427dae4404aSMatthew G. Knepley case 7: 4286ce3c06aSMatthew G. Knepley /* Hybrid Simplicial 3D */ 4296ce3c06aSMatthew G. Knepley ierr = DMPlexSetHybridBounds(rdm, cStartNew + 8*(cMax-cStart), fStartNew + 4*(fMax - fStart) + 8*(cMax - cStart), 4306ce3c06aSMatthew G. Knepley eStartNew + 2*(eMax - eStart) + 3*(fMax - fStart) + (cMax - cStart), PETSC_DETERMINE);CHKERRQ(ierr); 431dae4404aSMatthew G. Knepley /* Interior cells have 4 faces */ 432dae4404aSMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 433dae4404aSMatthew G. Knepley for (r = 0; r < 8; ++r) { 434dae4404aSMatthew G. Knepley const PetscInt newp = cStartNew + (c - cStart)*8 + r; 435dae4404aSMatthew G. Knepley 436dae4404aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 4);CHKERRQ(ierr); 437dae4404aSMatthew G. Knepley } 438dae4404aSMatthew G. Knepley } 439dae4404aSMatthew G. Knepley /* Hybrid cells have 5 faces */ 440dae4404aSMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 441dae4404aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 442dae4404aSMatthew G. Knepley const PetscInt newp = cStartNew + (cMax - cStart)*8 + (c - cMax)*4 + r; 443dae4404aSMatthew G. Knepley 444dae4404aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 5);CHKERRQ(ierr); 445dae4404aSMatthew G. Knepley } 446dae4404aSMatthew G. Knepley } 4476ce3c06aSMatthew G. Knepley /* Interior split faces have 3 edges and the same cells as the parent */ 448dae4404aSMatthew G. Knepley for (f = fStart; f < fMax; ++f) { 449dae4404aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 450dae4404aSMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*4 + r; 451dae4404aSMatthew G. Knepley PetscInt size; 452dae4404aSMatthew G. Knepley 453dae4404aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 3);CHKERRQ(ierr); 454dae4404aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 455dae4404aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 456dae4404aSMatthew G. Knepley } 457dae4404aSMatthew G. Knepley } 458dae4404aSMatthew G. Knepley /* Interior cell faces have 3 edges and 2 cells */ 459dae4404aSMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 460dae4404aSMatthew G. Knepley for (r = 0; r < 8; ++r) { 461dae4404aSMatthew G. Knepley const PetscInt newp = fStartNew + (fMax - fStart)*4 + (c - cStart)*8 + r; 462dae4404aSMatthew G. Knepley 463dae4404aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 3);CHKERRQ(ierr); 464dae4404aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2);CHKERRQ(ierr); 465dae4404aSMatthew G. Knepley } 466dae4404aSMatthew G. Knepley } 4676ce3c06aSMatthew G. Knepley /* Hybrid split faces have 4 edges and the same cells as the parent */ 4686ce3c06aSMatthew G. Knepley for (f = fMax; f < fEnd; ++f) { 4696ce3c06aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 4706ce3c06aSMatthew G. Knepley const PetscInt newp = fStartNew + (fMax - fStart)*4 + (cMax - cStart)*8 + (f - fMax)*2 + r; 4716ce3c06aSMatthew G. Knepley PetscInt size; 4726ce3c06aSMatthew G. Knepley 4736ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 4);CHKERRQ(ierr); 4746ce3c06aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 4756ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 4766ce3c06aSMatthew G. Knepley } 4776ce3c06aSMatthew G. Knepley } 4786ce3c06aSMatthew G. Knepley /* Hybrid cells faces have 4 edges and 2 cells */ 4796ce3c06aSMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 4806ce3c06aSMatthew G. Knepley for (r = 0; r < 3; ++r) { 4816ce3c06aSMatthew G. Knepley const PetscInt newp = fStartNew + (fMax - fStart)*4 + (cMax - cStart)*8 + (fEnd - fMax)*2 + (c - cMax)*3 + r; 4826ce3c06aSMatthew G. Knepley 4836ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 4);CHKERRQ(ierr); 4846ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2);CHKERRQ(ierr); 4856ce3c06aSMatthew G. Knepley } 4866ce3c06aSMatthew G. Knepley } 4876ce3c06aSMatthew G. Knepley /* Interior split edges have 2 vertices and the same faces */ 488dae4404aSMatthew G. Knepley for (e = eStart; e < eMax; ++e) { 489dae4404aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 490dae4404aSMatthew G. Knepley const PetscInt newp = eStartNew + (e - eStart)*2 + r; 491dae4404aSMatthew G. Knepley PetscInt size; 492dae4404aSMatthew G. Knepley 493dae4404aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 494dae4404aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &size);CHKERRQ(ierr); 495dae4404aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 496dae4404aSMatthew G. Knepley } 497dae4404aSMatthew G. Knepley } 4986ce3c06aSMatthew G. Knepley /* Interior face edges have 2 vertices and 2+cells*(1/2) faces */ 499dae4404aSMatthew G. Knepley for (f = fStart; f < fMax; ++f) { 500dae4404aSMatthew G. Knepley for (r = 0; r < 3; ++r) { 501dae4404aSMatthew G. Knepley const PetscInt newp = eStartNew + (eMax - eStart)*2 + (f - fStart)*3 + r; 502dae4404aSMatthew G. Knepley const PetscInt *cone, *ornt, *support, eint[4] = {1, 0, 2, 0}; 503dae4404aSMatthew G. Knepley PetscInt coneSize, c, supportSize, s, er, intFaces = 0; 504dae4404aSMatthew G. Knepley 505dae4404aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 506dae4404aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 507dae4404aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 508dae4404aSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 509dae4404aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 510dae4404aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 511dae4404aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 512dae4404aSMatthew G. Knepley for (c = 0; c < coneSize; ++c) {if (cone[c] == f) break;} 5136ce3c06aSMatthew G. Knepley if (support[s] < cMax) { 514dae4404aSMatthew G. Knepley /* Here we want to determine whether edge newp contains a vertex which is part of the cross-tet edge */ 515dae4404aSMatthew G. Knepley er = ornt[c] < 0 ? (-(ornt[c]+1) + 2-r)%3 : (ornt[c] + r)%3; 516dae4404aSMatthew G. Knepley if (er == eint[c]) { 517dae4404aSMatthew G. Knepley intFaces += 1; 518dae4404aSMatthew G. Knepley } else { 519dae4404aSMatthew G. Knepley intFaces += 2; 520dae4404aSMatthew G. Knepley } 5216ce3c06aSMatthew G. Knepley } else { 5226ce3c06aSMatthew G. Knepley intFaces += 1; 5236ce3c06aSMatthew G. Knepley } 524dae4404aSMatthew G. Knepley } 525dae4404aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2+intFaces);CHKERRQ(ierr); 526dae4404aSMatthew G. Knepley } 527dae4404aSMatthew G. Knepley } 5286ce3c06aSMatthew G. Knepley /* Interior cell edges have 2 vertices and 4 faces */ 529dae4404aSMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 530dae4404aSMatthew G. Knepley const PetscInt newp = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (c - cStart); 531dae4404aSMatthew G. Knepley 532dae4404aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 533dae4404aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 4);CHKERRQ(ierr); 534dae4404aSMatthew G. Knepley } 5356ce3c06aSMatthew G. Knepley /* Hybrid edges have 2 vertices and the same faces */ 536dae4404aSMatthew G. Knepley for (e = eMax; e < eEnd; ++e) { 5376ce3c06aSMatthew G. Knepley const PetscInt newp = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (cMax - cStart) + (e - eMax); 5386ce3c06aSMatthew G. Knepley PetscInt size; 5396ce3c06aSMatthew G. Knepley 5406ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 5416ce3c06aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &size);CHKERRQ(ierr); 5426ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 5436ce3c06aSMatthew G. Knepley } 5446ce3c06aSMatthew G. Knepley /* Hybrid face edges have 2 vertices and 2+2*cells faces */ 5456ce3c06aSMatthew G. Knepley for (f = fMax; f < fEnd; ++f) { 5466ce3c06aSMatthew G. Knepley const PetscInt newp = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (cMax - cStart) + (eEnd - eMax) + (f - fMax); 547dae4404aSMatthew G. Knepley PetscInt size; 548dae4404aSMatthew G. Knepley 549dae4404aSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 550dae4404aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 5516ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2+2*size);CHKERRQ(ierr); 552dae4404aSMatthew G. Knepley } 5536ce3c06aSMatthew G. Knepley /* Interior vertices have identical supports */ 554dae4404aSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 555dae4404aSMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 556dae4404aSMatthew G. Knepley PetscInt size; 557dae4404aSMatthew G. Knepley 558dae4404aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 559dae4404aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 560dae4404aSMatthew G. Knepley } 5616ce3c06aSMatthew G. Knepley /* Interior edge vertices have 2 + interior face*2 + hybrid face + cells*0/1 supports */ 5626ce3c06aSMatthew G. Knepley for (e = eStart; e < eMax; ++e) { 5636ce3c06aSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (e - eStart); 564dae4404aSMatthew G. Knepley const PetscInt *support; 5656ce3c06aSMatthew G. Knepley PetscInt size, *star = NULL, starSize, s, faceSize = 0, cellSize = 0; 566dae4404aSMatthew G. Knepley 5676ce3c06aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &size);CHKERRQ(ierr); 5686ce3c06aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, e, &support);CHKERRQ(ierr); 569dae4404aSMatthew G. Knepley for (s = 0; s < size; ++s) { 5706ce3c06aSMatthew G. Knepley if (support[s] < fMax) faceSize += 2; 5716ce3c06aSMatthew G. Knepley else faceSize += 1; 572dae4404aSMatthew G. Knepley } 5736ce3c06aSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, e, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 5746ce3c06aSMatthew G. Knepley for (s = 0; s < starSize*2; s += 2) { 5756ce3c06aSMatthew G. Knepley const PetscInt *cone, *ornt; 5766ce3c06aSMatthew G. Knepley PetscInt e01, e23; 5776ce3c06aSMatthew G. Knepley 5786ce3c06aSMatthew G. Knepley if ((star[s] >= cStart) && (star[s] < cMax)) { 5796ce3c06aSMatthew G. Knepley /* Check edge 0-1 */ 5806ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, star[s], &cone);CHKERRQ(ierr); 5816ce3c06aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, star[s], &ornt);CHKERRQ(ierr); 5826ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[0], &cone);CHKERRQ(ierr); 5836ce3c06aSMatthew G. Knepley e01 = cone[GetTriEdge_Static(ornt[0], 0)]; 5846ce3c06aSMatthew G. Knepley /* Check edge 2-3 */ 5856ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, star[s], &cone);CHKERRQ(ierr); 5866ce3c06aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, star[s], &ornt);CHKERRQ(ierr); 5876ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[2], &cone);CHKERRQ(ierr); 5886ce3c06aSMatthew G. Knepley e23 = cone[GetTriEdge_Static(ornt[2], 1)]; 5896ce3c06aSMatthew G. Knepley if ((e01 == e) || (e23 == e)) ++cellSize; 5906ce3c06aSMatthew G. Knepley } 5916ce3c06aSMatthew G. Knepley } 5926ce3c06aSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, e, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 5936ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2 + faceSize + cellSize);CHKERRQ(ierr); 594dae4404aSMatthew G. Knepley } 595dae4404aSMatthew G. Knepley break; 5962eabf88fSMatthew G. Knepley case 6: 5972eabf88fSMatthew G. Knepley /* Hex 3D */ 5982eabf88fSMatthew G. Knepley /* All cells have 6 faces */ 5992eabf88fSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 6002eabf88fSMatthew G. Knepley for (r = 0; r < 8; ++r) { 6012eabf88fSMatthew G. Knepley const PetscInt newp = (c - cStart)*8 + r; 6022eabf88fSMatthew G. Knepley 6032eabf88fSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 6);CHKERRQ(ierr); 6042eabf88fSMatthew G. Knepley } 6052eabf88fSMatthew G. Knepley } 6062eabf88fSMatthew G. Knepley /* Split faces have 4 edges and the same cells as the parent */ 6072eabf88fSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 6082eabf88fSMatthew G. Knepley for (r = 0; r < 4; ++r) { 6092eabf88fSMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*4 + r; 6102eabf88fSMatthew G. Knepley PetscInt size; 6112eabf88fSMatthew G. Knepley 6122eabf88fSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 4);CHKERRQ(ierr); 6132eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 6142eabf88fSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 6152eabf88fSMatthew G. Knepley } 6162eabf88fSMatthew G. Knepley } 6172eabf88fSMatthew G. Knepley /* Interior faces have 4 edges and 2 cells */ 6182eabf88fSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 6192eabf88fSMatthew G. Knepley for (r = 0; r < 12; ++r) { 6202eabf88fSMatthew G. Knepley const PetscInt newp = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + r; 6212eabf88fSMatthew G. Knepley 6222eabf88fSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 4);CHKERRQ(ierr); 6232eabf88fSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2);CHKERRQ(ierr); 6242eabf88fSMatthew G. Knepley } 6252eabf88fSMatthew G. Knepley } 6262eabf88fSMatthew G. Knepley /* Split edges have 2 vertices and the same faces as the parent */ 6272eabf88fSMatthew G. Knepley for (e = eStart; e < eEnd; ++e) { 6282eabf88fSMatthew G. Knepley for (r = 0; r < 2; ++r) { 6292eabf88fSMatthew G. Knepley const PetscInt newp = eStartNew + (e - eStart)*2 + r; 6302eabf88fSMatthew G. Knepley PetscInt size; 6312eabf88fSMatthew G. Knepley 6322eabf88fSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 6332eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &size);CHKERRQ(ierr); 6342eabf88fSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 6352eabf88fSMatthew G. Knepley } 6362eabf88fSMatthew G. Knepley } 6372eabf88fSMatthew G. Knepley /* Face edges have 2 vertices and 2+cells faces */ 6382eabf88fSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 6392eabf88fSMatthew G. Knepley for (r = 0; r < 4; ++r) { 6402eabf88fSMatthew G. Knepley const PetscInt newp = eStartNew + (eEnd - eStart)*2 + (f - fStart)*4 + r; 6412eabf88fSMatthew G. Knepley PetscInt size; 6422eabf88fSMatthew G. Knepley 6432eabf88fSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 6442eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 6452eabf88fSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2+size);CHKERRQ(ierr); 6462eabf88fSMatthew G. Knepley } 6472eabf88fSMatthew G. Knepley } 6482eabf88fSMatthew G. Knepley /* Cell edges have 2 vertices and 4 faces */ 6492eabf88fSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 6502eabf88fSMatthew G. Knepley for (r = 0; r < 6; ++r) { 6512eabf88fSMatthew G. Knepley const PetscInt newp = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + r; 6522eabf88fSMatthew G. Knepley 6532eabf88fSMatthew G. Knepley ierr = DMPlexSetConeSize(rdm, newp, 2);CHKERRQ(ierr); 6542eabf88fSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 4);CHKERRQ(ierr); 6552eabf88fSMatthew G. Knepley } 6562eabf88fSMatthew G. Knepley } 6572eabf88fSMatthew G. Knepley /* Old vertices have identical supports */ 6582eabf88fSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 6592eabf88fSMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 6602eabf88fSMatthew G. Knepley PetscInt size; 6612eabf88fSMatthew G. Knepley 6622eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 6632eabf88fSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, size);CHKERRQ(ierr); 6642eabf88fSMatthew G. Knepley } 6652eabf88fSMatthew G. Knepley /* Edge vertices have 2 + faces supports */ 6662eabf88fSMatthew G. Knepley for (e = eStart; e < eEnd; ++e) { 6672eabf88fSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (e - eStart); 6682eabf88fSMatthew G. Knepley PetscInt size; 6692eabf88fSMatthew G. Knepley 6702eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &size);CHKERRQ(ierr); 6712eabf88fSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 2 + size);CHKERRQ(ierr); 6722eabf88fSMatthew G. Knepley } 6732eabf88fSMatthew G. Knepley /* Face vertices have 4 + cells supports */ 6742eabf88fSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 6752eabf88fSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (f - fStart); 6762eabf88fSMatthew G. Knepley PetscInt size; 6772eabf88fSMatthew G. Knepley 6782eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 6792eabf88fSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 4 + size);CHKERRQ(ierr); 6802eabf88fSMatthew G. Knepley } 6812eabf88fSMatthew G. Knepley /* Cell vertices have 6 supports */ 6822eabf88fSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 6832eabf88fSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (fEnd - fStart) + (c - cStart); 6842eabf88fSMatthew G. Knepley 6852eabf88fSMatthew G. Knepley ierr = DMPlexSetSupportSize(rdm, newp, 6);CHKERRQ(ierr); 6862eabf88fSMatthew G. Knepley } 6872eabf88fSMatthew G. Knepley break; 68875d3a19aSMatthew G. Knepley default: 68975d3a19aSMatthew G. Knepley SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Unknown cell refiner %d", refiner); 69075d3a19aSMatthew G. Knepley } 69175d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 69275d3a19aSMatthew G. Knepley } 69375d3a19aSMatthew G. Knepley 69475d3a19aSMatthew G. Knepley #undef __FUNCT__ 69575d3a19aSMatthew G. Knepley #define __FUNCT__ "CellRefinerSetCones" 69675d3a19aSMatthew G. Knepley PetscErrorCode CellRefinerSetCones(CellRefiner refiner, DM dm, PetscInt depthSize[], DM rdm) 69775d3a19aSMatthew G. Knepley { 698b5da9499SMatthew G. Knepley const PetscInt *faces, cellInd[4] = {0, 1, 2, 3}; 6996ce3c06aSMatthew G. Knepley PetscInt cStart, cEnd, cMax, vStart, vEnd, vMax, fStart, fEnd, fMax, eStart, eEnd, eMax; 7006ce3c06aSMatthew G. Knepley PetscInt cStartNew, cEndNew, cMaxNew, vStartNew, vEndNew, fStartNew, fEndNew, fMaxNew, eStartNew, eEndNew, eMaxNew; 7016ce3c06aSMatthew G. Knepley PetscInt depth, maxSupportSize, *supportRef, c, f, e, v, r, p; 70275d3a19aSMatthew G. Knepley PetscErrorCode ierr; 70375d3a19aSMatthew G. Knepley 70475d3a19aSMatthew G. Knepley PetscFunctionBegin; 70575d3a19aSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 70675d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 70775d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr); 70875d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 70975d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 71075d3a19aSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, &fMax, &eMax, &vMax);CHKERRQ(ierr); 71175d3a19aSMatthew G. Knepley ierr = GetDepthStart_Private(depth, depthSize, &cStartNew, &fStartNew, &eStartNew, &vStartNew);CHKERRQ(ierr); 71275d3a19aSMatthew G. Knepley ierr = GetDepthEnd_Private(depth, depthSize, &cEndNew, &fEndNew, &eEndNew, &vEndNew);CHKERRQ(ierr); 71375d3a19aSMatthew G. Knepley switch (refiner) { 71475d3a19aSMatthew G. Knepley case 1: 71575d3a19aSMatthew G. Knepley /* Simplicial 2D */ 71675d3a19aSMatthew G. Knepley /* 71775d3a19aSMatthew G. Knepley 2 71875d3a19aSMatthew G. Knepley |\ 71975d3a19aSMatthew G. Knepley | \ 72075d3a19aSMatthew G. Knepley | \ 72175d3a19aSMatthew G. Knepley | \ 72275d3a19aSMatthew G. Knepley | C \ 72375d3a19aSMatthew G. Knepley | \ 72475d3a19aSMatthew G. Knepley | \ 72575d3a19aSMatthew G. Knepley 2---1---1 72675d3a19aSMatthew G. Knepley |\ D / \ 72775d3a19aSMatthew G. Knepley | 2 0 \ 72875d3a19aSMatthew G. Knepley |A \ / B \ 72975d3a19aSMatthew G. Knepley 0---0-------1 73075d3a19aSMatthew G. Knepley */ 73175d3a19aSMatthew G. Knepley /* All cells have 3 faces */ 73275d3a19aSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 73375d3a19aSMatthew G. Knepley const PetscInt newp = cStartNew + (c - cStart)*4; 73475d3a19aSMatthew G. Knepley const PetscInt *cone, *ornt; 73575d3a19aSMatthew G. Knepley PetscInt coneNew[3], orntNew[3]; 73675d3a19aSMatthew G. Knepley 73775d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 73875d3a19aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 73975d3a19aSMatthew G. Knepley /* A triangle */ 74075d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*2 + (ornt[0] < 0 ? 1 : 0); 74175d3a19aSMatthew G. Knepley orntNew[0] = ornt[0]; 74275d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*3 + 2; 74375d3a19aSMatthew G. Knepley orntNew[1] = -2; 74475d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*2 + (ornt[2] < 0 ? 0 : 1); 74575d3a19aSMatthew G. Knepley orntNew[2] = ornt[2]; 74675d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+0, coneNew);CHKERRQ(ierr); 74775d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+0, orntNew);CHKERRQ(ierr); 74875d3a19aSMatthew G. Knepley #if 1 74975d3a19aSMatthew 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); 75075d3a19aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 75175d3a19aSMatthew 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); 75275d3a19aSMatthew G. Knepley } 75375d3a19aSMatthew G. Knepley #endif 75475d3a19aSMatthew G. Knepley /* B triangle */ 75575d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*2 + (ornt[0] < 0 ? 0 : 1); 75675d3a19aSMatthew G. Knepley orntNew[0] = ornt[0]; 75775d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*2 + (ornt[1] < 0 ? 1 : 0); 75875d3a19aSMatthew G. Knepley orntNew[1] = ornt[1]; 75975d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*3 + 0; 76075d3a19aSMatthew G. Knepley orntNew[2] = -2; 76175d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+1, coneNew);CHKERRQ(ierr); 76275d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+1, orntNew);CHKERRQ(ierr); 76375d3a19aSMatthew G. Knepley #if 1 76475d3a19aSMatthew 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); 76575d3a19aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 76675d3a19aSMatthew 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); 76775d3a19aSMatthew G. Knepley } 76875d3a19aSMatthew G. Knepley #endif 76975d3a19aSMatthew G. Knepley /* C triangle */ 77075d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*3 + 1; 77175d3a19aSMatthew G. Knepley orntNew[0] = -2; 77275d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*2 + (ornt[1] < 0 ? 0 : 1); 77375d3a19aSMatthew G. Knepley orntNew[1] = ornt[1]; 77475d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*2 + (ornt[2] < 0 ? 1 : 0); 77575d3a19aSMatthew G. Knepley orntNew[2] = ornt[2]; 77675d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+2, coneNew);CHKERRQ(ierr); 77775d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+2, orntNew);CHKERRQ(ierr); 77875d3a19aSMatthew G. Knepley #if 1 77975d3a19aSMatthew 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); 78075d3a19aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 78175d3a19aSMatthew 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); 78275d3a19aSMatthew G. Knepley } 78375d3a19aSMatthew G. Knepley #endif 78475d3a19aSMatthew G. Knepley /* D triangle */ 78575d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*3 + 0; 78675d3a19aSMatthew G. Knepley orntNew[0] = 0; 78775d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*3 + 1; 78875d3a19aSMatthew G. Knepley orntNew[1] = 0; 78975d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*3 + 2; 79075d3a19aSMatthew G. Knepley orntNew[2] = 0; 79175d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+3, coneNew);CHKERRQ(ierr); 79275d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+3, orntNew);CHKERRQ(ierr); 79375d3a19aSMatthew G. Knepley #if 1 79475d3a19aSMatthew 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); 79575d3a19aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 79675d3a19aSMatthew 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); 79775d3a19aSMatthew G. Knepley } 79875d3a19aSMatthew G. Knepley #endif 79975d3a19aSMatthew G. Knepley } 80075d3a19aSMatthew G. Knepley /* Split faces have 2 vertices and the same cells as the parent */ 80175d3a19aSMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, NULL, &maxSupportSize);CHKERRQ(ierr); 80275d3a19aSMatthew G. Knepley ierr = PetscMalloc((2 + maxSupportSize*2) * sizeof(PetscInt), &supportRef);CHKERRQ(ierr); 80375d3a19aSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 80475d3a19aSMatthew G. Knepley const PetscInt newv = vStartNew + (vEnd - vStart) + (f - fStart); 80575d3a19aSMatthew G. Knepley 80675d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 80775d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*2 + r; 808297d2bf4SMatthew G. Knepley const PetscInt *cone, *ornt, *support; 80975d3a19aSMatthew G. Knepley PetscInt coneNew[2], coneSize, c, supportSize, s; 81075d3a19aSMatthew G. Knepley 81175d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, f, &cone);CHKERRQ(ierr); 81275d3a19aSMatthew G. Knepley coneNew[0] = vStartNew + (cone[0] - vStart); 81375d3a19aSMatthew G. Knepley coneNew[1] = vStartNew + (cone[1] - vStart); 81475d3a19aSMatthew G. Knepley coneNew[(r+1)%2] = newv; 81575d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 81675d3a19aSMatthew G. Knepley #if 1 81775d3a19aSMatthew 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); 81875d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 81975d3a19aSMatthew 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); 82075d3a19aSMatthew G. Knepley } 82175d3a19aSMatthew G. Knepley #endif 82275d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 82375d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 82475d3a19aSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 82575d3a19aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 82675d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 827297d2bf4SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 82875d3a19aSMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 82975d3a19aSMatthew G. Knepley if (cone[c] == f) break; 83075d3a19aSMatthew G. Knepley } 831297d2bf4SMatthew G. Knepley supportRef[s] = cStartNew + (support[s] - cStart)*4 + (ornt[c] < 0 ? (c+1-r)%3 : (c+r)%3); 83275d3a19aSMatthew G. Knepley } 83375d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 83475d3a19aSMatthew G. Knepley #if 1 83575d3a19aSMatthew 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); 83675d3a19aSMatthew G. Knepley for (p = 0; p < supportSize; ++p) { 83775d3a19aSMatthew 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); 83875d3a19aSMatthew G. Knepley } 83975d3a19aSMatthew G. Knepley #endif 84075d3a19aSMatthew G. Knepley } 84175d3a19aSMatthew G. Knepley } 84275d3a19aSMatthew G. Knepley /* Interior faces have 2 vertices and 2 cells */ 84375d3a19aSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 84475d3a19aSMatthew G. Knepley const PetscInt *cone; 84575d3a19aSMatthew G. Knepley 84675d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 84775d3a19aSMatthew G. Knepley for (r = 0; r < 3; ++r) { 84875d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (fEnd - fStart)*2 + (c - cStart)*3 + r; 84975d3a19aSMatthew G. Knepley PetscInt coneNew[2]; 85075d3a19aSMatthew G. Knepley PetscInt supportNew[2]; 85175d3a19aSMatthew G. Knepley 85275d3a19aSMatthew G. Knepley coneNew[0] = vStartNew + (vEnd - vStart) + (cone[r] - fStart); 85375d3a19aSMatthew G. Knepley coneNew[1] = vStartNew + (vEnd - vStart) + (cone[(r+1)%3] - fStart); 85475d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 85575d3a19aSMatthew G. Knepley #if 1 85675d3a19aSMatthew 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); 85775d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 85875d3a19aSMatthew 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); 85975d3a19aSMatthew G. Knepley } 86075d3a19aSMatthew G. Knepley #endif 86175d3a19aSMatthew G. Knepley supportNew[0] = (c - cStart)*4 + (r+1)%3; 86275d3a19aSMatthew G. Knepley supportNew[1] = (c - cStart)*4 + 3; 86375d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 86475d3a19aSMatthew G. Knepley #if 1 86575d3a19aSMatthew 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); 86675d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 86775d3a19aSMatthew 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); 86875d3a19aSMatthew G. Knepley } 86975d3a19aSMatthew G. Knepley #endif 87075d3a19aSMatthew G. Knepley } 87175d3a19aSMatthew G. Knepley } 87275d3a19aSMatthew G. Knepley /* Old vertices have identical supports */ 87375d3a19aSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 87475d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 87575d3a19aSMatthew G. Knepley const PetscInt *support, *cone; 87675d3a19aSMatthew G. Knepley PetscInt size, s; 87775d3a19aSMatthew G. Knepley 87875d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 87975d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, v, &support);CHKERRQ(ierr); 88075d3a19aSMatthew G. Knepley for (s = 0; s < size; ++s) { 88175d3a19aSMatthew G. Knepley PetscInt r = 0; 88275d3a19aSMatthew G. Knepley 88375d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 88475d3a19aSMatthew G. Knepley if (cone[1] == v) r = 1; 88575d3a19aSMatthew G. Knepley supportRef[s] = fStartNew + (support[s] - fStart)*2 + r; 88675d3a19aSMatthew G. Knepley } 88775d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 88875d3a19aSMatthew G. Knepley #if 1 88975d3a19aSMatthew 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); 89075d3a19aSMatthew G. Knepley for (p = 0; p < size; ++p) { 89175d3a19aSMatthew 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); 89275d3a19aSMatthew G. Knepley } 89375d3a19aSMatthew G. Knepley #endif 89475d3a19aSMatthew G. Knepley } 89575d3a19aSMatthew G. Knepley /* Face vertices have 2 + cells*2 supports */ 89675d3a19aSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 89775d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (f - fStart); 89875d3a19aSMatthew G. Knepley const PetscInt *cone, *support; 89975d3a19aSMatthew G. Knepley PetscInt size, s; 90075d3a19aSMatthew G. Knepley 90175d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 90275d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 90375d3a19aSMatthew G. Knepley supportRef[0] = fStartNew + (f - fStart)*2 + 0; 90475d3a19aSMatthew G. Knepley supportRef[1] = fStartNew + (f - fStart)*2 + 1; 90575d3a19aSMatthew G. Knepley for (s = 0; s < size; ++s) { 90675d3a19aSMatthew G. Knepley PetscInt r = 0; 90775d3a19aSMatthew G. Knepley 90875d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 90975d3a19aSMatthew G. Knepley if (cone[1] == f) r = 1; 91075d3a19aSMatthew G. Knepley else if (cone[2] == f) r = 2; 91175d3a19aSMatthew G. Knepley supportRef[2+s*2+0] = fStartNew + (fEnd - fStart)*2 + (support[s] - cStart)*3 + (r+2)%3; 91275d3a19aSMatthew G. Knepley supportRef[2+s*2+1] = fStartNew + (fEnd - fStart)*2 + (support[s] - cStart)*3 + r; 91375d3a19aSMatthew G. Knepley } 91475d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 91575d3a19aSMatthew G. Knepley #if 1 91675d3a19aSMatthew 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); 91775d3a19aSMatthew G. Knepley for (p = 0; p < 2+size*2; ++p) { 91875d3a19aSMatthew 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); 91975d3a19aSMatthew G. Knepley } 92075d3a19aSMatthew G. Knepley #endif 92175d3a19aSMatthew G. Knepley } 92275d3a19aSMatthew G. Knepley ierr = PetscFree(supportRef);CHKERRQ(ierr); 92375d3a19aSMatthew G. Knepley break; 92475d3a19aSMatthew G. Knepley case 2: 92575d3a19aSMatthew G. Knepley /* Hex 2D */ 92675d3a19aSMatthew G. Knepley /* 92775d3a19aSMatthew G. Knepley 3---------2---------2 92875d3a19aSMatthew G. Knepley | | | 92975d3a19aSMatthew G. Knepley | D 2 C | 93075d3a19aSMatthew G. Knepley | | | 93175d3a19aSMatthew G. Knepley 3----3----0----1----1 93275d3a19aSMatthew G. Knepley | | | 93375d3a19aSMatthew G. Knepley | A 0 B | 93475d3a19aSMatthew G. Knepley | | | 93575d3a19aSMatthew G. Knepley 0---------0---------1 93675d3a19aSMatthew G. Knepley */ 93775d3a19aSMatthew G. Knepley /* All cells have 4 faces */ 93875d3a19aSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 93975d3a19aSMatthew G. Knepley const PetscInt newp = (c - cStart)*4; 94075d3a19aSMatthew G. Knepley const PetscInt *cone, *ornt; 94175d3a19aSMatthew G. Knepley PetscInt coneNew[4], orntNew[4]; 94275d3a19aSMatthew G. Knepley 94375d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 94475d3a19aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 94575d3a19aSMatthew G. Knepley /* A quad */ 94675d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*2 + (ornt[0] < 0 ? 1 : 0); 94775d3a19aSMatthew G. Knepley orntNew[0] = ornt[0]; 94875d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + 0; 94975d3a19aSMatthew G. Knepley orntNew[1] = 0; 95075d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + 3; 95175d3a19aSMatthew G. Knepley orntNew[2] = -2; 95275d3a19aSMatthew G. Knepley coneNew[3] = fStartNew + (cone[3] - fStart)*2 + (ornt[3] < 0 ? 0 : 1); 95375d3a19aSMatthew G. Knepley orntNew[3] = ornt[3]; 95475d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+0, coneNew);CHKERRQ(ierr); 95575d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+0, orntNew);CHKERRQ(ierr); 95675d3a19aSMatthew G. Knepley #if 1 95775d3a19aSMatthew 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); 95875d3a19aSMatthew G. Knepley for (p = 0; p < 4; ++p) { 95975d3a19aSMatthew 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); 96075d3a19aSMatthew G. Knepley } 96175d3a19aSMatthew G. Knepley #endif 96275d3a19aSMatthew G. Knepley /* B quad */ 96375d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*2 + (ornt[0] < 0 ? 0 : 1); 96475d3a19aSMatthew G. Knepley orntNew[0] = ornt[0]; 96575d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*2 + (ornt[1] < 0 ? 1 : 0); 96675d3a19aSMatthew G. Knepley orntNew[1] = ornt[1]; 96775d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + 1; 96875d3a19aSMatthew G. Knepley orntNew[2] = 0; 96975d3a19aSMatthew G. Knepley coneNew[3] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + 0; 97075d3a19aSMatthew G. Knepley orntNew[3] = -2; 97175d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+1, coneNew);CHKERRQ(ierr); 97275d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+1, orntNew);CHKERRQ(ierr); 97375d3a19aSMatthew G. Knepley #if 1 97475d3a19aSMatthew 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); 97575d3a19aSMatthew G. Knepley for (p = 0; p < 4; ++p) { 97675d3a19aSMatthew 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); 97775d3a19aSMatthew G. Knepley } 97875d3a19aSMatthew G. Knepley #endif 97975d3a19aSMatthew G. Knepley /* C quad */ 98075d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + 1; 98175d3a19aSMatthew G. Knepley orntNew[0] = -2; 98275d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*2 + (ornt[1] < 0 ? 0 : 1); 98375d3a19aSMatthew G. Knepley orntNew[1] = ornt[1]; 98475d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*2 + (ornt[2] < 0 ? 1 : 0); 98575d3a19aSMatthew G. Knepley orntNew[2] = ornt[2]; 98675d3a19aSMatthew G. Knepley coneNew[3] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + 2; 98775d3a19aSMatthew G. Knepley orntNew[3] = 0; 98875d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+2, coneNew);CHKERRQ(ierr); 98975d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+2, orntNew);CHKERRQ(ierr); 99075d3a19aSMatthew G. Knepley #if 1 99175d3a19aSMatthew 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); 99275d3a19aSMatthew G. Knepley for (p = 0; p < 4; ++p) { 99375d3a19aSMatthew 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); 99475d3a19aSMatthew G. Knepley } 99575d3a19aSMatthew G. Knepley #endif 99675d3a19aSMatthew G. Knepley /* D quad */ 99775d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + 3; 99875d3a19aSMatthew G. Knepley orntNew[0] = 0; 99975d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + 2; 100075d3a19aSMatthew G. Knepley orntNew[1] = -2; 100175d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*2 + (ornt[2] < 0 ? 0 : 1); 100275d3a19aSMatthew G. Knepley orntNew[2] = ornt[2]; 100375d3a19aSMatthew G. Knepley coneNew[3] = fStartNew + (cone[3] - fStart)*2 + (ornt[3] < 0 ? 1 : 0); 100475d3a19aSMatthew G. Knepley orntNew[3] = ornt[3]; 100575d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+3, coneNew);CHKERRQ(ierr); 100675d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+3, orntNew);CHKERRQ(ierr); 100775d3a19aSMatthew G. Knepley #if 1 100875d3a19aSMatthew 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); 100975d3a19aSMatthew G. Knepley for (p = 0; p < 4; ++p) { 101075d3a19aSMatthew 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); 101175d3a19aSMatthew G. Knepley } 101275d3a19aSMatthew G. Knepley #endif 101375d3a19aSMatthew G. Knepley } 101475d3a19aSMatthew G. Knepley /* Split faces have 2 vertices and the same cells as the parent */ 101575d3a19aSMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, NULL, &maxSupportSize);CHKERRQ(ierr); 101675d3a19aSMatthew G. Knepley ierr = PetscMalloc((2 + maxSupportSize*2) * sizeof(PetscInt), &supportRef);CHKERRQ(ierr); 101775d3a19aSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 101875d3a19aSMatthew G. Knepley const PetscInt newv = vStartNew + (vEnd - vStart) + (f - fStart); 101975d3a19aSMatthew G. Knepley 102075d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 102175d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*2 + r; 1022455d6cd4SMatthew G. Knepley const PetscInt *cone, *ornt, *support; 102375d3a19aSMatthew G. Knepley PetscInt coneNew[2], coneSize, c, supportSize, s; 102475d3a19aSMatthew G. Knepley 102575d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, f, &cone);CHKERRQ(ierr); 102675d3a19aSMatthew G. Knepley coneNew[0] = vStartNew + (cone[0] - vStart); 102775d3a19aSMatthew G. Knepley coneNew[1] = vStartNew + (cone[1] - vStart); 102875d3a19aSMatthew G. Knepley coneNew[(r+1)%2] = newv; 102975d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 103075d3a19aSMatthew G. Knepley #if 1 103175d3a19aSMatthew 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); 103275d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 103375d3a19aSMatthew 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); 103475d3a19aSMatthew G. Knepley } 103575d3a19aSMatthew G. Knepley #endif 103675d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 103775d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 103875d3a19aSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 103975d3a19aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 104075d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1041455d6cd4SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 104275d3a19aSMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 104375d3a19aSMatthew G. Knepley if (cone[c] == f) break; 104475d3a19aSMatthew G. Knepley } 1045455d6cd4SMatthew G. Knepley supportRef[s] = cStartNew + (support[s] - cStart)*4 + (ornt[c] < 0 ? (c+1-r)%4 : (c+r)%4); 104675d3a19aSMatthew G. Knepley } 104775d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 104875d3a19aSMatthew G. Knepley #if 1 104975d3a19aSMatthew 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); 105075d3a19aSMatthew G. Knepley for (p = 0; p < supportSize; ++p) { 105175d3a19aSMatthew 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); 105275d3a19aSMatthew G. Knepley } 105375d3a19aSMatthew G. Knepley #endif 105475d3a19aSMatthew G. Knepley } 105575d3a19aSMatthew G. Knepley } 105675d3a19aSMatthew G. Knepley /* Interior faces have 2 vertices and 2 cells */ 105775d3a19aSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 105875d3a19aSMatthew G. Knepley const PetscInt *cone; 105975d3a19aSMatthew G. Knepley PetscInt coneNew[2], supportNew[2]; 106075d3a19aSMatthew G. Knepley 106175d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 106275d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 106375d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + r; 106475d3a19aSMatthew G. Knepley 106575d3a19aSMatthew G. Knepley coneNew[0] = vStartNew + (vEnd - vStart) + (cone[r] - fStart); 106675d3a19aSMatthew G. Knepley coneNew[1] = vStartNew + (vEnd - vStart) + (fEnd - fStart) + (c - cStart); 106775d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 106875d3a19aSMatthew G. Knepley #if 1 106975d3a19aSMatthew 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); 107075d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 107175d3a19aSMatthew 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); 107275d3a19aSMatthew G. Knepley } 107375d3a19aSMatthew G. Knepley #endif 107475d3a19aSMatthew G. Knepley supportNew[0] = (c - cStart)*4 + r; 107575d3a19aSMatthew G. Knepley supportNew[1] = (c - cStart)*4 + (r+1)%4; 107675d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 107775d3a19aSMatthew G. Knepley #if 1 107875d3a19aSMatthew 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); 107975d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 108075d3a19aSMatthew 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); 108175d3a19aSMatthew G. Knepley } 108275d3a19aSMatthew G. Knepley #endif 108375d3a19aSMatthew G. Knepley } 108475d3a19aSMatthew G. Knepley } 108575d3a19aSMatthew G. Knepley /* Old vertices have identical supports */ 108675d3a19aSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 108775d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 108875d3a19aSMatthew G. Knepley const PetscInt *support, *cone; 108975d3a19aSMatthew G. Knepley PetscInt size, s; 109075d3a19aSMatthew G. Knepley 109175d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 109275d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, v, &support);CHKERRQ(ierr); 109375d3a19aSMatthew G. Knepley for (s = 0; s < size; ++s) { 109475d3a19aSMatthew G. Knepley PetscInt r = 0; 109575d3a19aSMatthew G. Knepley 109675d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 109775d3a19aSMatthew G. Knepley if (cone[1] == v) r = 1; 109875d3a19aSMatthew G. Knepley supportRef[s] = fStartNew + (support[s] - fStart)*2 + r; 109975d3a19aSMatthew G. Knepley } 110075d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 110175d3a19aSMatthew G. Knepley #if 1 110275d3a19aSMatthew 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); 110375d3a19aSMatthew G. Knepley for (p = 0; p < size; ++p) { 110475d3a19aSMatthew 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); 110575d3a19aSMatthew G. Knepley } 110675d3a19aSMatthew G. Knepley #endif 110775d3a19aSMatthew G. Knepley } 110875d3a19aSMatthew G. Knepley /* Face vertices have 2 + cells supports */ 110975d3a19aSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 111075d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (f - fStart); 111175d3a19aSMatthew G. Knepley const PetscInt *cone, *support; 111275d3a19aSMatthew G. Knepley PetscInt size, s; 111375d3a19aSMatthew G. Knepley 111475d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 111575d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 111675d3a19aSMatthew G. Knepley supportRef[0] = fStartNew + (f - fStart)*2 + 0; 111775d3a19aSMatthew G. Knepley supportRef[1] = fStartNew + (f - fStart)*2 + 1; 111875d3a19aSMatthew G. Knepley for (s = 0; s < size; ++s) { 111975d3a19aSMatthew G. Knepley PetscInt r = 0; 112075d3a19aSMatthew G. Knepley 112175d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 112275d3a19aSMatthew G. Knepley if (cone[1] == f) r = 1; 112375d3a19aSMatthew G. Knepley else if (cone[2] == f) r = 2; 112475d3a19aSMatthew G. Knepley else if (cone[3] == f) r = 3; 112575d3a19aSMatthew G. Knepley supportRef[2+s] = fStartNew + (fEnd - fStart)*2 + (support[s] - cStart)*4 + r; 112675d3a19aSMatthew G. Knepley } 112775d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 112875d3a19aSMatthew G. Knepley #if 1 112975d3a19aSMatthew 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); 113075d3a19aSMatthew G. Knepley for (p = 0; p < 2+size; ++p) { 113175d3a19aSMatthew 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); 113275d3a19aSMatthew G. Knepley } 113375d3a19aSMatthew G. Knepley #endif 113475d3a19aSMatthew G. Knepley } 113575d3a19aSMatthew G. Knepley /* Cell vertices have 4 supports */ 113675d3a19aSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 113775d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (fEnd - fStart) + (c - cStart); 113875d3a19aSMatthew G. Knepley PetscInt supportNew[4]; 113975d3a19aSMatthew G. Knepley 114075d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 114175d3a19aSMatthew G. Knepley supportNew[r] = fStartNew + (fEnd - fStart)*2 + (c - cStart)*4 + r; 114275d3a19aSMatthew G. Knepley } 114375d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 114475d3a19aSMatthew G. Knepley } 1145da00770fSMatthew G. Knepley ierr = PetscFree(supportRef);CHKERRQ(ierr); 114675d3a19aSMatthew G. Knepley break; 114775d3a19aSMatthew G. Knepley case 3: 114875d3a19aSMatthew G. Knepley if (cMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No cell maximum specified in hybrid mesh"); 114975d3a19aSMatthew G. Knepley cMax = PetscMin(cEnd, cMax); 115075d3a19aSMatthew G. Knepley if (fMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No face maximum specified in hybrid mesh"); 115175d3a19aSMatthew G. Knepley fMax = PetscMin(fEnd, fMax); 115275d3a19aSMatthew G. Knepley /* Interior cells have 3 faces */ 115375d3a19aSMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 115475d3a19aSMatthew G. Knepley const PetscInt newp = cStartNew + (c - cStart)*4; 115575d3a19aSMatthew G. Knepley const PetscInt *cone, *ornt; 115675d3a19aSMatthew G. Knepley PetscInt coneNew[3], orntNew[3]; 115775d3a19aSMatthew G. Knepley 115875d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 115975d3a19aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 116075d3a19aSMatthew G. Knepley /* A triangle */ 116175d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*2 + (ornt[0] < 0 ? 1 : 0); 116275d3a19aSMatthew G. Knepley orntNew[0] = ornt[0]; 116375d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (fMax - fStart)*2 + (c - cStart)*3 + 2; 116475d3a19aSMatthew G. Knepley orntNew[1] = -2; 116575d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*2 + (ornt[2] < 0 ? 0 : 1); 116675d3a19aSMatthew G. Knepley orntNew[2] = ornt[2]; 116775d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+0, coneNew);CHKERRQ(ierr); 116875d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+0, orntNew);CHKERRQ(ierr); 116975d3a19aSMatthew G. Knepley #if 1 117075d3a19aSMatthew 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); 117175d3a19aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 117275d3a19aSMatthew 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); 117375d3a19aSMatthew G. Knepley } 117475d3a19aSMatthew G. Knepley #endif 117575d3a19aSMatthew G. Knepley /* B triangle */ 117675d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*2 + (ornt[0] < 0 ? 0 : 1); 117775d3a19aSMatthew G. Knepley orntNew[0] = ornt[0]; 117875d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*2 + (ornt[1] < 0 ? 1 : 0); 117975d3a19aSMatthew G. Knepley orntNew[1] = ornt[1]; 118075d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (fMax - fStart)*2 + (c - cStart)*3 + 0; 118175d3a19aSMatthew G. Knepley orntNew[2] = -2; 118275d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+1, coneNew);CHKERRQ(ierr); 118375d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+1, orntNew);CHKERRQ(ierr); 118475d3a19aSMatthew G. Knepley #if 1 118575d3a19aSMatthew 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); 118675d3a19aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 118775d3a19aSMatthew 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); 118875d3a19aSMatthew G. Knepley } 118975d3a19aSMatthew G. Knepley #endif 119075d3a19aSMatthew G. Knepley /* C triangle */ 119175d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (fMax - fStart)*2 + (c - cStart)*3 + 1; 119275d3a19aSMatthew G. Knepley orntNew[0] = -2; 119375d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*2 + (ornt[1] < 0 ? 0 : 1); 119475d3a19aSMatthew G. Knepley orntNew[1] = ornt[1]; 119575d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*2 + (ornt[2] < 0 ? 1 : 0); 119675d3a19aSMatthew G. Knepley orntNew[2] = ornt[2]; 119775d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+2, coneNew);CHKERRQ(ierr); 119875d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+2, orntNew);CHKERRQ(ierr); 119975d3a19aSMatthew G. Knepley #if 1 120075d3a19aSMatthew 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); 120175d3a19aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 120275d3a19aSMatthew 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); 120375d3a19aSMatthew G. Knepley } 120475d3a19aSMatthew G. Knepley #endif 120575d3a19aSMatthew G. Knepley /* D triangle */ 120675d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (fMax - fStart)*2 + (c - cStart)*3 + 0; 120775d3a19aSMatthew G. Knepley orntNew[0] = 0; 120875d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (fMax - fStart)*2 + (c - cStart)*3 + 1; 120975d3a19aSMatthew G. Knepley orntNew[1] = 0; 121075d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (fMax - fStart)*2 + (c - cStart)*3 + 2; 121175d3a19aSMatthew G. Knepley orntNew[2] = 0; 121275d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+3, coneNew);CHKERRQ(ierr); 121375d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+3, orntNew);CHKERRQ(ierr); 121475d3a19aSMatthew G. Knepley #if 1 121575d3a19aSMatthew 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); 121675d3a19aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 121775d3a19aSMatthew 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); 121875d3a19aSMatthew G. Knepley } 121975d3a19aSMatthew G. Knepley #endif 122075d3a19aSMatthew G. Knepley } 122175d3a19aSMatthew G. Knepley /* 122275d3a19aSMatthew G. Knepley 2----3----3 122375d3a19aSMatthew G. Knepley | | 122475d3a19aSMatthew G. Knepley | B | 122575d3a19aSMatthew G. Knepley | | 122675d3a19aSMatthew G. Knepley 0----4--- 1 122775d3a19aSMatthew G. Knepley | | 122875d3a19aSMatthew G. Knepley | A | 122975d3a19aSMatthew G. Knepley | | 123075d3a19aSMatthew G. Knepley 0----2----1 123175d3a19aSMatthew G. Knepley */ 123275d3a19aSMatthew G. Knepley /* Hybrid cells have 4 faces */ 123375d3a19aSMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 123475d3a19aSMatthew G. Knepley const PetscInt newp = cStartNew + (cMax - cStart)*4 + (c - cMax)*2; 123575d3a19aSMatthew G. Knepley const PetscInt *cone, *ornt; 123675d3a19aSMatthew G. Knepley PetscInt coneNew[4], orntNew[4]; 123775d3a19aSMatthew G. Knepley 123875d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 123975d3a19aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 124075d3a19aSMatthew G. Knepley /* A quad */ 124175d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*2 + (ornt[0] < 0 ? 1 : 0); 124275d3a19aSMatthew G. Knepley orntNew[0] = ornt[0]; 124375d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*2 + (ornt[1] < 0 ? 1 : 0); 124475d3a19aSMatthew G. Knepley orntNew[1] = ornt[1]; 124575d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (cone[2] - fMax); 124675d3a19aSMatthew G. Knepley orntNew[2] = 0; 124775d3a19aSMatthew G. Knepley coneNew[3] = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (fEnd - fMax) + (c - cMax); 124875d3a19aSMatthew G. Knepley orntNew[3] = 0; 124975d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+0, coneNew);CHKERRQ(ierr); 125075d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+0, orntNew);CHKERRQ(ierr); 125175d3a19aSMatthew G. Knepley #if 1 125275d3a19aSMatthew 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); 125375d3a19aSMatthew G. Knepley for (p = 0; p < 4; ++p) { 125475d3a19aSMatthew 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); 125575d3a19aSMatthew G. Knepley } 125675d3a19aSMatthew G. Knepley #endif 125775d3a19aSMatthew G. Knepley /* B quad */ 125875d3a19aSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*2 + (ornt[0] < 0 ? 0 : 1); 125975d3a19aSMatthew G. Knepley orntNew[0] = ornt[0]; 126075d3a19aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*2 + (ornt[1] < 0 ? 0 : 1); 126175d3a19aSMatthew G. Knepley orntNew[1] = ornt[1]; 126275d3a19aSMatthew G. Knepley coneNew[2] = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (fEnd - fMax) + (c - cMax); 126375d3a19aSMatthew G. Knepley orntNew[2] = 0; 126475d3a19aSMatthew G. Knepley coneNew[3] = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (cone[3] - fMax); 126575d3a19aSMatthew G. Knepley orntNew[3] = 0; 126675d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+1, coneNew);CHKERRQ(ierr); 126775d3a19aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+1, orntNew);CHKERRQ(ierr); 126875d3a19aSMatthew G. Knepley #if 1 126975d3a19aSMatthew 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); 127075d3a19aSMatthew G. Knepley for (p = 0; p < 4; ++p) { 127175d3a19aSMatthew 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); 127275d3a19aSMatthew G. Knepley } 127375d3a19aSMatthew G. Knepley #endif 127475d3a19aSMatthew G. Knepley } 127575d3a19aSMatthew G. Knepley /* Interior split faces have 2 vertices and the same cells as the parent */ 127675d3a19aSMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, NULL, &maxSupportSize);CHKERRQ(ierr); 127775d3a19aSMatthew G. Knepley ierr = PetscMalloc((2 + maxSupportSize*2) * sizeof(PetscInt), &supportRef);CHKERRQ(ierr); 127875d3a19aSMatthew G. Knepley for (f = fStart; f < fMax; ++f) { 127975d3a19aSMatthew G. Knepley const PetscInt newv = vStartNew + (vEnd - vStart) + (f - fStart); 128075d3a19aSMatthew G. Knepley 128175d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 128275d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*2 + r; 1283297d2bf4SMatthew G. Knepley const PetscInt *cone, *ornt, *support; 128475d3a19aSMatthew G. Knepley PetscInt coneNew[2], coneSize, c, supportSize, s; 128575d3a19aSMatthew G. Knepley 128675d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, f, &cone);CHKERRQ(ierr); 128775d3a19aSMatthew G. Knepley coneNew[0] = vStartNew + (cone[0] - vStart); 128875d3a19aSMatthew G. Knepley coneNew[1] = vStartNew + (cone[1] - vStart); 128975d3a19aSMatthew G. Knepley coneNew[(r+1)%2] = newv; 129075d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 129175d3a19aSMatthew G. Knepley #if 1 129275d3a19aSMatthew 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); 129375d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 129475d3a19aSMatthew 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); 129575d3a19aSMatthew G. Knepley } 129675d3a19aSMatthew G. Knepley #endif 129775d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 129875d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 129975d3a19aSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 130075d3a19aSMatthew G. Knepley if (support[s] >= cMax) { 130175d3a19aSMatthew G. Knepley supportRef[s] = cStartNew + (cMax - cStart)*4 + (support[s] - cMax)*2 + r; 130275d3a19aSMatthew G. Knepley } else { 130375d3a19aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 130475d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1305297d2bf4SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 130675d3a19aSMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 130775d3a19aSMatthew G. Knepley if (cone[c] == f) break; 130875d3a19aSMatthew G. Knepley } 1309297d2bf4SMatthew G. Knepley supportRef[s] = cStartNew + (support[s] - cStart)*4 + (ornt[c] < 0 ? (c+1-r)%3 : (c+r)%3); 131075d3a19aSMatthew G. Knepley } 131175d3a19aSMatthew G. Knepley } 131275d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 131375d3a19aSMatthew G. Knepley #if 1 131475d3a19aSMatthew 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); 131575d3a19aSMatthew G. Knepley for (p = 0; p < supportSize; ++p) { 131675d3a19aSMatthew 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); 131775d3a19aSMatthew G. Knepley } 131875d3a19aSMatthew G. Knepley #endif 131975d3a19aSMatthew G. Knepley } 132075d3a19aSMatthew G. Knepley } 132175d3a19aSMatthew G. Knepley /* Interior cell faces have 2 vertices and 2 cells */ 132275d3a19aSMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 132375d3a19aSMatthew G. Knepley const PetscInt *cone; 132475d3a19aSMatthew G. Knepley 132575d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 132675d3a19aSMatthew G. Knepley for (r = 0; r < 3; ++r) { 132775d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (fMax - fStart)*2 + (c - cStart)*3 + r; 132875d3a19aSMatthew G. Knepley PetscInt coneNew[2]; 132975d3a19aSMatthew G. Knepley PetscInt supportNew[2]; 133075d3a19aSMatthew G. Knepley 133175d3a19aSMatthew G. Knepley coneNew[0] = vStartNew + (vEnd - vStart) + (cone[r] - fStart); 133275d3a19aSMatthew G. Knepley coneNew[1] = vStartNew + (vEnd - vStart) + (cone[(r+1)%3] - fStart); 133375d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 133475d3a19aSMatthew G. Knepley #if 1 133575d3a19aSMatthew 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); 133675d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 133775d3a19aSMatthew 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); 133875d3a19aSMatthew G. Knepley } 133975d3a19aSMatthew G. Knepley #endif 134075d3a19aSMatthew G. Knepley supportNew[0] = (c - cStart)*4 + (r+1)%3; 134175d3a19aSMatthew G. Knepley supportNew[1] = (c - cStart)*4 + 3; 134275d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 134375d3a19aSMatthew G. Knepley #if 1 134475d3a19aSMatthew 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); 134575d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 134675d3a19aSMatthew 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); 134775d3a19aSMatthew G. Knepley } 134875d3a19aSMatthew G. Knepley #endif 134975d3a19aSMatthew G. Knepley } 135075d3a19aSMatthew G. Knepley } 135175d3a19aSMatthew G. Knepley /* Interior hybrid faces have 2 vertices and the same cells */ 135275d3a19aSMatthew G. Knepley for (f = fMax; f < fEnd; ++f) { 135375d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (f - fMax); 135475d3a19aSMatthew G. Knepley const PetscInt *cone; 135575d3a19aSMatthew G. Knepley const PetscInt *support; 135675d3a19aSMatthew G. Knepley PetscInt coneNew[2]; 135775d3a19aSMatthew G. Knepley PetscInt supportNew[2]; 135875d3a19aSMatthew G. Knepley PetscInt size, s, r; 135975d3a19aSMatthew G. Knepley 136075d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, f, &cone);CHKERRQ(ierr); 136175d3a19aSMatthew G. Knepley coneNew[0] = vStartNew + (cone[0] - vStart); 136275d3a19aSMatthew G. Knepley coneNew[1] = vStartNew + (cone[1] - vStart); 136375d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 136475d3a19aSMatthew G. Knepley #if 1 136575d3a19aSMatthew 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); 136675d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 136775d3a19aSMatthew 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); 136875d3a19aSMatthew G. Knepley } 136975d3a19aSMatthew G. Knepley #endif 137075d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 137175d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 137275d3a19aSMatthew G. Knepley for (s = 0; s < size; ++s) { 137375d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 137475d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 137575d3a19aSMatthew G. Knepley if (cone[r+2] == f) break; 137675d3a19aSMatthew G. Knepley } 137775d3a19aSMatthew G. Knepley supportNew[s] = (cMax - cStart)*4 + (support[s] - cMax)*2 + r; 137875d3a19aSMatthew G. Knepley } 137975d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 138075d3a19aSMatthew G. Knepley #if 1 138175d3a19aSMatthew 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); 138275d3a19aSMatthew G. Knepley for (p = 0; p < size; ++p) { 138375d3a19aSMatthew 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); 138475d3a19aSMatthew G. Knepley } 138575d3a19aSMatthew G. Knepley #endif 138675d3a19aSMatthew G. Knepley } 138775d3a19aSMatthew G. Knepley /* Cell hybrid faces have 2 vertices and 2 cells */ 138875d3a19aSMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 138975d3a19aSMatthew G. Knepley const PetscInt newp = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (fEnd - fMax) + (c - cMax); 139075d3a19aSMatthew G. Knepley const PetscInt *cone; 139175d3a19aSMatthew G. Knepley PetscInt coneNew[2]; 139275d3a19aSMatthew G. Knepley PetscInt supportNew[2]; 139375d3a19aSMatthew G. Knepley 139475d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 139575d3a19aSMatthew G. Knepley coneNew[0] = vStartNew + (vEnd - vStart) + (cone[0] - fStart); 139675d3a19aSMatthew G. Knepley coneNew[1] = vStartNew + (vEnd - vStart) + (cone[1] - fStart); 139775d3a19aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 139875d3a19aSMatthew G. Knepley #if 1 139975d3a19aSMatthew 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); 140075d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 140175d3a19aSMatthew 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); 140275d3a19aSMatthew G. Knepley } 140375d3a19aSMatthew G. Knepley #endif 140475d3a19aSMatthew G. Knepley supportNew[0] = (cMax - cStart)*4 + (c - cMax)*2 + 0; 140575d3a19aSMatthew G. Knepley supportNew[1] = (cMax - cStart)*4 + (c - cMax)*2 + 1; 140675d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 140775d3a19aSMatthew G. Knepley #if 1 140875d3a19aSMatthew 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); 140975d3a19aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 141075d3a19aSMatthew 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); 141175d3a19aSMatthew G. Knepley } 141275d3a19aSMatthew G. Knepley #endif 141375d3a19aSMatthew G. Knepley } 141475d3a19aSMatthew G. Knepley /* Old vertices have identical supports */ 141575d3a19aSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 141675d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 141775d3a19aSMatthew G. Knepley const PetscInt *support, *cone; 141875d3a19aSMatthew G. Knepley PetscInt size, s; 141975d3a19aSMatthew G. Knepley 142075d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 142175d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, v, &support);CHKERRQ(ierr); 142275d3a19aSMatthew G. Knepley for (s = 0; s < size; ++s) { 142375d3a19aSMatthew G. Knepley if (support[s] >= fMax) { 142475d3a19aSMatthew G. Knepley supportRef[s] = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (support[s] - fMax); 142575d3a19aSMatthew G. Knepley } else { 142675d3a19aSMatthew G. Knepley PetscInt r = 0; 142775d3a19aSMatthew G. Knepley 142875d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 142975d3a19aSMatthew G. Knepley if (cone[1] == v) r = 1; 143075d3a19aSMatthew G. Knepley supportRef[s] = fStartNew + (support[s] - fStart)*2 + r; 143175d3a19aSMatthew G. Knepley } 143275d3a19aSMatthew G. Knepley } 143375d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 143475d3a19aSMatthew G. Knepley #if 1 143575d3a19aSMatthew 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); 143675d3a19aSMatthew G. Knepley for (p = 0; p < size; ++p) { 143775d3a19aSMatthew 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); 143875d3a19aSMatthew G. Knepley } 143975d3a19aSMatthew G. Knepley #endif 144075d3a19aSMatthew G. Knepley } 144175d3a19aSMatthew G. Knepley /* Face vertices have 2 + (2 interior, 1 hybrid) supports */ 144275d3a19aSMatthew G. Knepley for (f = fStart; f < fMax; ++f) { 144375d3a19aSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (f - fStart); 144475d3a19aSMatthew G. Knepley const PetscInt *cone, *support; 144575d3a19aSMatthew G. Knepley PetscInt size, newSize = 2, s; 144675d3a19aSMatthew G. Knepley 144775d3a19aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 144875d3a19aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 144975d3a19aSMatthew G. Knepley supportRef[0] = fStartNew + (f - fStart)*2 + 0; 145075d3a19aSMatthew G. Knepley supportRef[1] = fStartNew + (f - fStart)*2 + 1; 145175d3a19aSMatthew G. Knepley for (s = 0; s < size; ++s) { 145275d3a19aSMatthew G. Knepley PetscInt r = 0; 145375d3a19aSMatthew G. Knepley 145475d3a19aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 145575d3a19aSMatthew G. Knepley if (support[s] >= cMax) { 145675d3a19aSMatthew G. Knepley supportRef[newSize+0] = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (fEnd - fMax) + (support[s] - cMax); 145775d3a19aSMatthew G. Knepley 145875d3a19aSMatthew G. Knepley newSize += 1; 145975d3a19aSMatthew G. Knepley } else { 146075d3a19aSMatthew G. Knepley if (cone[1] == f) r = 1; 146175d3a19aSMatthew G. Knepley else if (cone[2] == f) r = 2; 146275d3a19aSMatthew G. Knepley supportRef[newSize+0] = fStartNew + (fMax - fStart)*2 + (support[s] - cStart)*3 + (r+2)%3; 146375d3a19aSMatthew G. Knepley supportRef[newSize+1] = fStartNew + (fMax - fStart)*2 + (support[s] - cStart)*3 + r; 146475d3a19aSMatthew G. Knepley 146575d3a19aSMatthew G. Knepley newSize += 2; 146675d3a19aSMatthew G. Knepley } 146775d3a19aSMatthew G. Knepley } 146875d3a19aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 146975d3a19aSMatthew G. Knepley #if 1 147075d3a19aSMatthew 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); 147175d3a19aSMatthew G. Knepley for (p = 0; p < newSize; ++p) { 147275d3a19aSMatthew 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); 147375d3a19aSMatthew G. Knepley } 147475d3a19aSMatthew G. Knepley #endif 147575d3a19aSMatthew G. Knepley } 147675d3a19aSMatthew G. Knepley ierr = PetscFree(supportRef);CHKERRQ(ierr); 147775d3a19aSMatthew G. Knepley break; 1478b5da9499SMatthew G. Knepley case 5: 1479b5da9499SMatthew G. Knepley /* Simplicial 3D */ 1480b5da9499SMatthew G. Knepley /* All cells have 4 faces: Tet face order is prescribed in DMPlexGetFaces_Internal() */ 1481b5da9499SMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, 3, 4, cellInd, NULL, NULL, &faces);CHKERRQ(ierr); 1482b5da9499SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 1483b5da9499SMatthew G. Knepley const PetscInt newp = cStartNew + (c - cStart)*8; 1484b5da9499SMatthew G. Knepley const PetscInt *cone, *ornt; 1485b5da9499SMatthew G. Knepley PetscInt coneNew[4], orntNew[4]; 1486b5da9499SMatthew G. Knepley 1487b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1488b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 1489b5da9499SMatthew G. Knepley /* A tetrahedron: {0, a, c, d} */ 1490518a8359SMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*4 + GetTriSubface_Static(ornt[0], 0); /* A */ 1491b5da9499SMatthew G. Knepley orntNew[0] = ornt[0]; 1492518a8359SMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*4 + GetTriSubface_Static(ornt[1], 0); /* A */ 1493b5da9499SMatthew G. Knepley orntNew[1] = ornt[1]; 1494518a8359SMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*4 + GetTriSubface_Static(ornt[2], 0); /* A */ 1495b5da9499SMatthew G. Knepley orntNew[2] = ornt[2]; 1496b5da9499SMatthew G. Knepley coneNew[3] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 0; 1497b5da9499SMatthew G. Knepley orntNew[3] = 0; 1498b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+0, coneNew);CHKERRQ(ierr); 1499b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+0, orntNew);CHKERRQ(ierr); 1500b5da9499SMatthew G. Knepley #if 1 1501b5da9499SMatthew 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); 1502b5da9499SMatthew G. Knepley for (p = 0; p < 4; ++p) { 1503b5da9499SMatthew 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); 1504b5da9499SMatthew G. Knepley } 1505b5da9499SMatthew G. Knepley #endif 1506b5da9499SMatthew G. Knepley /* B tetrahedron: {a, 1, b, e} */ 1507518a8359SMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*4 + GetTriSubface_Static(ornt[0], 1); /* B */ 1508b5da9499SMatthew G. Knepley orntNew[0] = ornt[0]; 1509518a8359SMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*4 + GetTriSubface_Static(ornt[1], 2); /* C */ 1510b5da9499SMatthew G. Knepley orntNew[1] = ornt[1]; 1511b5da9499SMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 1; 1512b5da9499SMatthew G. Knepley orntNew[2] = 0; 1513518a8359SMatthew G. Knepley coneNew[3] = fStartNew + (cone[3] - fStart)*4 + GetTriSubface_Static(ornt[3], 1); /* B */ 1514b5da9499SMatthew G. Knepley orntNew[3] = ornt[3]; 1515b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+1, coneNew);CHKERRQ(ierr); 1516b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+1, orntNew);CHKERRQ(ierr); 1517b5da9499SMatthew G. Knepley #if 1 1518b5da9499SMatthew 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); 1519b5da9499SMatthew G. Knepley for (p = 0; p < 4; ++p) { 1520b5da9499SMatthew 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); 1521b5da9499SMatthew G. Knepley } 1522b5da9499SMatthew G. Knepley #endif 1523b5da9499SMatthew G. Knepley /* C tetrahedron: {c, b, 2, f} */ 1524518a8359SMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*4 + GetTriSubface_Static(ornt[0], 2); /* C */ 1525b5da9499SMatthew G. Knepley orntNew[0] = ornt[0]; 1526b5da9499SMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 2; 1527b5da9499SMatthew G. Knepley orntNew[1] = 0; 1528518a8359SMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*4 + GetTriSubface_Static(ornt[2], 1); /* B */ 1529b5da9499SMatthew G. Knepley orntNew[2] = ornt[2]; 1530518a8359SMatthew G. Knepley coneNew[3] = fStartNew + (cone[3] - fStart)*4 + GetTriSubface_Static(ornt[3], 0); /* A */ 1531b5da9499SMatthew G. Knepley orntNew[3] = ornt[3]; 1532b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+2, coneNew);CHKERRQ(ierr); 1533b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+2, orntNew);CHKERRQ(ierr); 1534b5da9499SMatthew G. Knepley #if 1 1535b5da9499SMatthew 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); 1536b5da9499SMatthew G. Knepley for (p = 0; p < 4; ++p) { 1537b5da9499SMatthew 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); 1538b5da9499SMatthew G. Knepley } 1539b5da9499SMatthew G. Knepley #endif 1540b5da9499SMatthew G. Knepley /* D tetrahedron: {d, e, f, 3} */ 1541b5da9499SMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 3; 1542b5da9499SMatthew G. Knepley orntNew[0] = 0; 1543518a8359SMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*4 + GetTriSubface_Static(ornt[1], 1); /* B */ 1544b5da9499SMatthew G. Knepley orntNew[1] = ornt[1]; 1545518a8359SMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*4 + GetTriSubface_Static(ornt[2], 2); /* C */ 1546b5da9499SMatthew G. Knepley orntNew[2] = ornt[2]; 1547518a8359SMatthew G. Knepley coneNew[3] = fStartNew + (cone[3] - fStart)*4 + GetTriSubface_Static(ornt[3], 2); /* C */ 1548b5da9499SMatthew G. Knepley orntNew[3] = ornt[3]; 1549b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+3, coneNew);CHKERRQ(ierr); 1550b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+3, orntNew);CHKERRQ(ierr); 1551b5da9499SMatthew G. Knepley #if 1 1552b5da9499SMatthew 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); 1553b5da9499SMatthew G. Knepley for (p = 0; p < 4; ++p) { 1554b5da9499SMatthew 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); 1555b5da9499SMatthew G. Knepley } 1556b5da9499SMatthew G. Knepley #endif 1557b5da9499SMatthew G. Knepley /* A' tetrahedron: {d, a, c, f} */ 1558b5da9499SMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 0; 1559b5da9499SMatthew G. Knepley orntNew[0] = -3; 1560b5da9499SMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 4; 1561b5da9499SMatthew G. Knepley orntNew[1] = 0; 1562b5da9499SMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*4 + 3; 1563b5da9499SMatthew G. Knepley orntNew[2] = ornt[2] < 0 ? -((-(ornt[2]+1)+2)%3+1) : (ornt[2]+2)%3; 1564b5da9499SMatthew G. Knepley coneNew[3] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 5; 1565b5da9499SMatthew G. Knepley orntNew[3] = 0; 1566b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+4, coneNew);CHKERRQ(ierr); 1567b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+4, orntNew);CHKERRQ(ierr); 1568b5da9499SMatthew G. Knepley #if 1 1569b5da9499SMatthew 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); 1570b5da9499SMatthew G. Knepley for (p = 0; p < 4; ++p) { 1571b5da9499SMatthew 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); 1572b5da9499SMatthew G. Knepley } 1573b5da9499SMatthew G. Knepley #endif 1574b5da9499SMatthew G. Knepley /* B' tetrahedron: {e, b, a, f} */ 1575b5da9499SMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 1; 1576b5da9499SMatthew G. Knepley orntNew[0] = -3; 1577b5da9499SMatthew G. Knepley coneNew[1] = fStartNew + (cone[3] - fStart)*4 + 3; 1578b5da9499SMatthew G. Knepley orntNew[1] = ornt[3] < 0 ? -((-(ornt[3]+1)+1)%3+1) : (ornt[3]+1)%3; 1579b5da9499SMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 6; 1580b5da9499SMatthew G. Knepley orntNew[2] = 0; 1581b5da9499SMatthew G. Knepley coneNew[3] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 7; 1582b5da9499SMatthew G. Knepley orntNew[3] = 0; 1583b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+5, coneNew);CHKERRQ(ierr); 1584b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+5, orntNew);CHKERRQ(ierr); 1585b5da9499SMatthew G. Knepley #if 1 1586b5da9499SMatthew 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); 1587b5da9499SMatthew G. Knepley for (p = 0; p < 4; ++p) { 1588b5da9499SMatthew 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); 1589b5da9499SMatthew G. Knepley } 1590b5da9499SMatthew G. Knepley #endif 1591b5da9499SMatthew G. Knepley /* C' tetrahedron: {b, f, c, a} */ 1592b5da9499SMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 2; 1593b5da9499SMatthew G. Knepley orntNew[0] = -3; 1594b5da9499SMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 7; 1595b5da9499SMatthew G. Knepley orntNew[1] = -2; 1596b5da9499SMatthew G. Knepley coneNew[2] = fStartNew + (cone[0] - fStart)*4 + 3; 1597b5da9499SMatthew G. Knepley orntNew[2] = ornt[0] < 0 ? (-(ornt[0]+1)+1)%3 : -((ornt[0]+1)%3+1); 1598b5da9499SMatthew G. Knepley coneNew[3] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 5; 1599b5da9499SMatthew G. Knepley orntNew[3] = -1; 1600b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+6, coneNew);CHKERRQ(ierr); 1601b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+6, orntNew);CHKERRQ(ierr); 1602b5da9499SMatthew G. Knepley #if 1 1603b5da9499SMatthew 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); 1604b5da9499SMatthew G. Knepley for (p = 0; p < 4; ++p) { 1605b5da9499SMatthew 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); 1606b5da9499SMatthew G. Knepley } 1607b5da9499SMatthew G. Knepley #endif 1608b5da9499SMatthew G. Knepley /* D' tetrahedron: {f, e, d, a} */ 1609b5da9499SMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 3; 1610b5da9499SMatthew G. Knepley orntNew[0] = -3; 1611b5da9499SMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 6; 1612b5da9499SMatthew G. Knepley orntNew[1] = -3; 1613b5da9499SMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 4; 1614b5da9499SMatthew G. Knepley orntNew[2] = -2; 1615b5da9499SMatthew G. Knepley coneNew[3] = fStartNew + (cone[1] - fStart)*4 + 3; 1616b5da9499SMatthew G. Knepley orntNew[3] = ornt[2]; 1617b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+7, coneNew);CHKERRQ(ierr); 1618b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+7, orntNew);CHKERRQ(ierr); 1619b5da9499SMatthew G. Knepley #if 1 1620b5da9499SMatthew 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); 1621b5da9499SMatthew G. Knepley for (p = 0; p < 4; ++p) { 1622b5da9499SMatthew 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); 1623b5da9499SMatthew G. Knepley } 1624b5da9499SMatthew G. Knepley #endif 1625b5da9499SMatthew G. Knepley } 1626b5da9499SMatthew G. Knepley /* Split faces have 3 edges and the same cells as the parent */ 1627b5da9499SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, NULL, &maxSupportSize);CHKERRQ(ierr); 1628b5da9499SMatthew G. Knepley ierr = PetscMalloc((2 + maxSupportSize*2) * sizeof(PetscInt), &supportRef);CHKERRQ(ierr); 1629b5da9499SMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 1630b5da9499SMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*4; 1631b5da9499SMatthew G. Knepley const PetscInt *cone, *ornt, *support; 1632b5da9499SMatthew G. Knepley PetscInt coneNew[3], orntNew[3], coneSize, supportSize, s; 1633b5da9499SMatthew G. Knepley 1634b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, f, &cone);CHKERRQ(ierr); 1635b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, f, &ornt);CHKERRQ(ierr); 1636b5da9499SMatthew G. Knepley /* A triangle */ 1637b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (cone[0] - eStart)*2 + (ornt[0] < 0 ? 1 : 0); 1638b5da9499SMatthew G. Knepley orntNew[0] = ornt[0]; 1639b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (f - fStart)*3 + 2; 1640b5da9499SMatthew G. Knepley orntNew[1] = -2; 1641b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (cone[2] - eStart)*2 + (ornt[2] < 0 ? 0 : 1); 1642b5da9499SMatthew G. Knepley orntNew[2] = ornt[2]; 1643b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+0, coneNew);CHKERRQ(ierr); 1644b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+0, orntNew);CHKERRQ(ierr); 1645b5da9499SMatthew G. Knepley #if 1 1646b5da9499SMatthew 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); 1647b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1648b5da9499SMatthew 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); 1649b5da9499SMatthew G. Knepley } 1650b5da9499SMatthew G. Knepley #endif 1651b5da9499SMatthew G. Knepley /* B triangle */ 1652b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (cone[0] - eStart)*2 + (ornt[0] < 0 ? 0 : 1); 1653b5da9499SMatthew G. Knepley orntNew[0] = ornt[0]; 1654b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (cone[1] - eStart)*2 + (ornt[1] < 0 ? 1 : 0); 1655b5da9499SMatthew G. Knepley orntNew[1] = ornt[1]; 1656b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (f - fStart)*3 + 0; 1657b5da9499SMatthew G. Knepley orntNew[2] = -2; 1658b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+1, coneNew);CHKERRQ(ierr); 1659b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+1, orntNew);CHKERRQ(ierr); 1660b5da9499SMatthew G. Knepley #if 1 1661b5da9499SMatthew 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); 1662b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1663b5da9499SMatthew 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); 1664b5da9499SMatthew G. Knepley } 1665b5da9499SMatthew G. Knepley #endif 1666b5da9499SMatthew G. Knepley /* C triangle */ 1667b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (f - fStart)*3 + 1; 1668b5da9499SMatthew G. Knepley orntNew[0] = -2; 1669b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (cone[1] - eStart)*2 + (ornt[1] < 0 ? 0 : 1); 1670b5da9499SMatthew G. Knepley orntNew[1] = ornt[1]; 1671b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (cone[2] - eStart)*2 + (ornt[2] < 0 ? 1 : 0); 1672b5da9499SMatthew G. Knepley orntNew[2] = ornt[2]; 1673b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+2, coneNew);CHKERRQ(ierr); 1674b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+2, orntNew);CHKERRQ(ierr); 1675b5da9499SMatthew G. Knepley #if 1 1676b5da9499SMatthew 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); 1677b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1678b5da9499SMatthew 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); 1679b5da9499SMatthew G. Knepley } 1680b5da9499SMatthew G. Knepley #endif 1681b5da9499SMatthew G. Knepley /* D triangle */ 1682b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (f - fStart)*3 + 0; 1683b5da9499SMatthew G. Knepley orntNew[0] = 0; 1684b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (f - fStart)*3 + 1; 1685b5da9499SMatthew G. Knepley orntNew[1] = 0; 1686b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (f - fStart)*3 + 2; 1687b5da9499SMatthew G. Knepley orntNew[2] = 0; 1688b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+3, coneNew);CHKERRQ(ierr); 1689b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+3, orntNew);CHKERRQ(ierr); 1690b5da9499SMatthew G. Knepley #if 1 1691b5da9499SMatthew 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); 1692b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1693b5da9499SMatthew 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); 1694b5da9499SMatthew G. Knepley } 1695b5da9499SMatthew G. Knepley #endif 1696b5da9499SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 1697b5da9499SMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 1698b5da9499SMatthew G. Knepley for (r = 0; r < 4; ++r) { 1699b5da9499SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 1700b5da9499SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1701b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1702b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 1703b5da9499SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 1704b5da9499SMatthew G. Knepley if (cone[c] == f) break; 1705b5da9499SMatthew G. Knepley } 1706b5da9499SMatthew 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])); 1707b5da9499SMatthew G. Knepley } 1708b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp+r, supportRef);CHKERRQ(ierr); 1709b5da9499SMatthew G. Knepley #if 1 1710b5da9499SMatthew 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); 1711b5da9499SMatthew G. Knepley for (p = 0; p < supportSize; ++p) { 1712b5da9499SMatthew 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); 1713b5da9499SMatthew G. Knepley } 1714b5da9499SMatthew G. Knepley #endif 1715b5da9499SMatthew G. Knepley } 1716b5da9499SMatthew G. Knepley } 1717b5da9499SMatthew G. Knepley /* Interior faces have 3 edges and 2 cells */ 1718b5da9499SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 1719b5da9499SMatthew G. Knepley PetscInt newp = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8; 1720b5da9499SMatthew G. Knepley const PetscInt *cone, *ornt; 1721b5da9499SMatthew G. Knepley PetscInt coneNew[3], orntNew[3]; 1722b5da9499SMatthew G. Knepley PetscInt supportNew[2]; 1723b5da9499SMatthew G. Knepley 1724b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1725b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 1726b5da9499SMatthew G. Knepley /* Face A: {c, a, d} */ 1727b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[0] - fStart)*3 + (ornt[0] < 0 ? (-(ornt[0]+1)+0)%3 : (ornt[0]+2)%3); 1728b5da9499SMatthew G. Knepley orntNew[0] = ornt[0] < 0 ? -2 : 0; 1729b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[1] - fStart)*3 + (ornt[1] < 0 ? (-(ornt[1]+1)+0)%3 : (ornt[1]+2)%3); 1730b5da9499SMatthew G. Knepley orntNew[1] = ornt[1] < 0 ? -2 : 0; 1731b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (cone[2] - fStart)*3 + (ornt[2] < 0 ? (-(ornt[2]+1)+0)%3 : (ornt[2]+2)%3); 1732b5da9499SMatthew G. Knepley orntNew[2] = ornt[2] < 0 ? -2 : 0; 1733b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 1734b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 1735b5da9499SMatthew G. Knepley #if 1 1736b5da9499SMatthew 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); 1737b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1738b5da9499SMatthew 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); 1739b5da9499SMatthew G. Knepley } 1740b5da9499SMatthew G. Knepley #endif 1741b5da9499SMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 0; 1742b5da9499SMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 0+4; 1743b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 1744b5da9499SMatthew G. Knepley #if 1 1745b5da9499SMatthew 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); 1746b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 1747b5da9499SMatthew 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); 1748b5da9499SMatthew G. Knepley } 1749b5da9499SMatthew G. Knepley #endif 1750b5da9499SMatthew G. Knepley ++newp; 1751b5da9499SMatthew G. Knepley /* Face B: {a, b, e} */ 1752b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[0] - fStart)*3 + (ornt[0] < 0 ? (-(ornt[0]+1)+2)%3 : (ornt[0]+0)%3); 1753b5da9499SMatthew G. Knepley orntNew[0] = ornt[0] < 0 ? -2 : 0; 1754b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[3] - fStart)*3 + (ornt[3] < 0 ? (-(ornt[3]+1)+2)%3 : (ornt[3]+0)%3); 1755b5da9499SMatthew G. Knepley orntNew[1] = ornt[3] < 0 ? -2 : 0; 1756b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (cone[1] - fStart)*3 + (ornt[1] < 0 ? (-(ornt[1]+1)+1)%3 : (ornt[1]+1)%3); 1757b5da9499SMatthew G. Knepley orntNew[2] = ornt[1] < 0 ? -2 : 0; 1758b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 1759b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 1760b5da9499SMatthew G. Knepley #if 1 1761b5da9499SMatthew 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); 1762b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1763b5da9499SMatthew 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); 1764b5da9499SMatthew G. Knepley } 1765b5da9499SMatthew G. Knepley #endif 1766b5da9499SMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 1; 1767b5da9499SMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 1+4; 1768b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 1769b5da9499SMatthew G. Knepley #if 1 1770b5da9499SMatthew 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); 1771b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 1772b5da9499SMatthew 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); 1773b5da9499SMatthew G. Knepley } 1774b5da9499SMatthew G. Knepley #endif 1775b5da9499SMatthew G. Knepley ++newp; 1776b5da9499SMatthew G. Knepley /* Face C: {c, f, b} */ 1777b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[2] - fStart)*3 + (ornt[2] < 0 ? (-(ornt[2]+1)+2)%3 : (ornt[2]+0)%3); 1778b5da9499SMatthew G. Knepley orntNew[0] = ornt[2] < 0 ? -2 : 0; 1779b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[3] - fStart)*3 + (ornt[3] < 0 ? (-(ornt[3]+1)+0)%3 : (ornt[3]+2)%3); 1780b5da9499SMatthew G. Knepley orntNew[1] = ornt[3] < 0 ? -2 : 0; 1781b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (cone[0] - fStart)*3 + (ornt[0] < 0 ? (-(ornt[0]+1)+1)%3 : (ornt[0]+1)%3); 1782b5da9499SMatthew G. Knepley orntNew[2] = ornt[0] < 0 ? -2 : 0; 1783b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 1784b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 1785b5da9499SMatthew G. Knepley #if 1 1786b5da9499SMatthew 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); 1787b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1788b5da9499SMatthew 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); 1789b5da9499SMatthew G. Knepley } 1790b5da9499SMatthew G. Knepley #endif 1791b5da9499SMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 2; 1792b5da9499SMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 2+4; 1793b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 1794b5da9499SMatthew G. Knepley #if 1 1795b5da9499SMatthew 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); 1796b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 1797b5da9499SMatthew 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); 1798b5da9499SMatthew G. Knepley } 1799b5da9499SMatthew G. Knepley #endif 1800b5da9499SMatthew G. Knepley ++newp; 1801b5da9499SMatthew G. Knepley /* Face D: {d, e, f} */ 1802b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[1] - fStart)*3 + (ornt[1] < 0 ? (-(ornt[1]+1)+2)%3 : (ornt[1]+0)%3); 1803b5da9499SMatthew G. Knepley orntNew[0] = ornt[1] < 0 ? -2 : 0; 1804b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[3] - fStart)*3 + (ornt[3] < 0 ? (-(ornt[3]+1)+1)%3 : (ornt[3]+1)%3); 1805b5da9499SMatthew G. Knepley orntNew[1] = ornt[3] < 0 ? -2 : 0; 1806b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (cone[2] - fStart)*3 + (ornt[2] < 0 ? (-(ornt[2]+1)+1)%3 : (ornt[2]+1)%3); 1807b5da9499SMatthew G. Knepley orntNew[2] = ornt[2] < 0 ? -2 : 0; 1808b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 1809b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 1810b5da9499SMatthew G. Knepley #if 1 1811b5da9499SMatthew 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); 1812b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1813b5da9499SMatthew 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); 1814b5da9499SMatthew G. Knepley } 1815b5da9499SMatthew G. Knepley #endif 1816b5da9499SMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 3; 1817b5da9499SMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 3+4; 1818b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 1819b5da9499SMatthew G. Knepley #if 1 1820b5da9499SMatthew 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); 1821b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 1822b5da9499SMatthew 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); 1823b5da9499SMatthew G. Knepley } 1824b5da9499SMatthew G. Knepley #endif 1825b5da9499SMatthew G. Knepley ++newp; 1826b5da9499SMatthew G. Knepley /* Face E: {d, f, a} */ 1827b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[2] - fStart)*3 + (ornt[2] < 0 ? (-(ornt[2]+1)+1)%3 : (ornt[2]+1)%3); 1828b5da9499SMatthew G. Knepley orntNew[0] = ornt[2] < 0 ? 0 : -2; 1829b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*3 + (c - cStart); 1830b5da9499SMatthew G. Knepley orntNew[1] = 0; 1831b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (cone[1] - fStart)*3 + (ornt[1] < 0 ? (-(ornt[1]+1)+0)%3 : (ornt[1]+2)%3); 1832b5da9499SMatthew G. Knepley orntNew[2] = ornt[1] < 0 ? -2 : 0; 1833b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 1834b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 1835b5da9499SMatthew G. Knepley #if 1 1836b5da9499SMatthew 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); 1837b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1838b5da9499SMatthew 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); 1839b5da9499SMatthew G. Knepley } 1840b5da9499SMatthew G. Knepley #endif 1841b5da9499SMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 0+4; 1842b5da9499SMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 3+4; 1843b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 1844b5da9499SMatthew G. Knepley #if 1 1845b5da9499SMatthew 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); 1846b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 1847b5da9499SMatthew 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); 1848b5da9499SMatthew G. Knepley } 1849b5da9499SMatthew G. Knepley #endif 1850b5da9499SMatthew G. Knepley ++newp; 1851b5da9499SMatthew G. Knepley /* Face F: {c, a, f} */ 1852b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[0] - fStart)*3 + (ornt[0] < 0 ? (-(ornt[0]+1)+0)%3 : (ornt[0]+2)%3); 1853b5da9499SMatthew G. Knepley orntNew[0] = ornt[0] < 0 ? -2 : 0; 1854b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*3 + (c - cStart); 1855b5da9499SMatthew G. Knepley orntNew[1] = -2; 1856b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (cone[2] - fStart)*3 + (ornt[2] < 0 ? (-(ornt[2]+1)+2)%3 : (ornt[2]+0)%3); 1857b5da9499SMatthew G. Knepley orntNew[2] = ornt[1] < 0 ? 0 : -2; 1858b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 1859b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 1860b5da9499SMatthew G. Knepley #if 1 1861b5da9499SMatthew 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); 1862b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1863b5da9499SMatthew 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); 1864b5da9499SMatthew G. Knepley } 1865b5da9499SMatthew G. Knepley #endif 1866b5da9499SMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 0+4; 1867b5da9499SMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 2+4; 1868b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 1869b5da9499SMatthew G. Knepley #if 1 1870b5da9499SMatthew 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); 1871b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 1872b5da9499SMatthew 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); 1873b5da9499SMatthew G. Knepley } 1874b5da9499SMatthew G. Knepley #endif 1875b5da9499SMatthew G. Knepley ++newp; 1876b5da9499SMatthew G. Knepley /* Face G: {e, a, f} */ 1877b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[1] - fStart)*3 + (ornt[1] < 0 ? (-(ornt[1]+1)+1)%3 : (ornt[1]+1)%3); 1878b5da9499SMatthew G. Knepley orntNew[0] = ornt[1] < 0 ? -2 : 0; 1879b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*3 + (c - cStart); 1880b5da9499SMatthew G. Knepley orntNew[1] = -2; 1881b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (cone[3] - fStart)*3 + (ornt[3] < 0 ? (-(ornt[3]+1)+1)%3 : (ornt[3]+1)%3); 1882b5da9499SMatthew G. Knepley orntNew[2] = ornt[3] < 0 ? 0 : -2; 1883b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 1884b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 1885b5da9499SMatthew G. Knepley #if 1 1886b5da9499SMatthew 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); 1887b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1888b5da9499SMatthew 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); 1889b5da9499SMatthew G. Knepley } 1890b5da9499SMatthew G. Knepley #endif 1891b5da9499SMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 1+4; 1892b5da9499SMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 3+4; 1893b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 1894b5da9499SMatthew G. Knepley #if 1 1895b5da9499SMatthew 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); 1896b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 1897b5da9499SMatthew 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); 1898b5da9499SMatthew G. Knepley } 1899b5da9499SMatthew G. Knepley #endif 1900b5da9499SMatthew G. Knepley ++newp; 1901b5da9499SMatthew G. Knepley /* Face H: {a, b, f} */ 1902b5da9499SMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[0] - fStart)*3 + (ornt[0] < 0 ? (-(ornt[0]+1)+2)%3 : (ornt[0]+0)%3); 1903b5da9499SMatthew G. Knepley orntNew[0] = ornt[0] < 0 ? -2 : 0; 1904b5da9499SMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[3] - fStart)*3 + (ornt[3] < 0 ? (-(ornt[3]+1)+0)%3 : (ornt[3]+2)%3); 1905b5da9499SMatthew G. Knepley orntNew[1] = ornt[3] < 0 ? 0 : -2; 1906b5da9499SMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*3 + (c - cStart); 1907b5da9499SMatthew G. Knepley orntNew[2] = 0; 1908b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 1909b5da9499SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 1910b5da9499SMatthew G. Knepley #if 1 1911b5da9499SMatthew 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); 1912b5da9499SMatthew G. Knepley for (p = 0; p < 3; ++p) { 1913b5da9499SMatthew 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); 1914b5da9499SMatthew G. Knepley } 1915b5da9499SMatthew G. Knepley #endif 1916b5da9499SMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 1+4; 1917b5da9499SMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 2+4; 1918b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 1919b5da9499SMatthew G. Knepley #if 1 1920b5da9499SMatthew 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); 1921b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 1922b5da9499SMatthew 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); 1923b5da9499SMatthew G. Knepley } 1924b5da9499SMatthew G. Knepley #endif 1925b5da9499SMatthew G. Knepley ++newp; 1926b5da9499SMatthew G. Knepley } 1927b5da9499SMatthew G. Knepley /* Split Edges have 2 vertices and the same faces as the parent */ 1928b5da9499SMatthew G. Knepley for (e = eStart; e < eEnd; ++e) { 1929b5da9499SMatthew G. Knepley const PetscInt newv = vStartNew + (vEnd - vStart) + (e - eStart); 1930b5da9499SMatthew G. Knepley 1931b5da9499SMatthew G. Knepley for (r = 0; r < 2; ++r) { 1932b5da9499SMatthew G. Knepley const PetscInt newp = eStartNew + (e - eStart)*2 + r; 1933b5da9499SMatthew G. Knepley const PetscInt *cone, *ornt, *support; 1934b5da9499SMatthew G. Knepley PetscInt coneNew[2], coneSize, c, supportSize, s; 1935b5da9499SMatthew G. Knepley 1936b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 1937b5da9499SMatthew G. Knepley coneNew[0] = vStartNew + (cone[0] - vStart); 1938b5da9499SMatthew G. Knepley coneNew[1] = vStartNew + (cone[1] - vStart); 1939b5da9499SMatthew G. Knepley coneNew[(r+1)%2] = newv; 1940b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 1941b5da9499SMatthew G. Knepley #if 1 1942b5da9499SMatthew 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); 1943b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 1944b5da9499SMatthew 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); 1945b5da9499SMatthew G. Knepley } 1946b5da9499SMatthew G. Knepley #endif 1947b5da9499SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &supportSize);CHKERRQ(ierr); 1948b5da9499SMatthew G. Knepley ierr = DMPlexGetSupport(dm, e, &support);CHKERRQ(ierr); 1949b5da9499SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 1950b5da9499SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1951b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1952b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 1953b5da9499SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 1954b5da9499SMatthew G. Knepley if (cone[c] == e) break; 1955b5da9499SMatthew G. Knepley } 1956b5da9499SMatthew G. Knepley supportRef[s] = fStartNew + (support[s] - fStart)*4 + (c + (ornt[c] < 0 ? 1-r : r))%3; 1957b5da9499SMatthew G. Knepley } 1958b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 1959b5da9499SMatthew G. Knepley #if 1 1960b5da9499SMatthew 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); 1961b5da9499SMatthew G. Knepley for (p = 0; p < supportSize; ++p) { 1962b5da9499SMatthew 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); 1963b5da9499SMatthew G. Knepley } 1964b5da9499SMatthew G. Knepley #endif 1965b5da9499SMatthew G. Knepley } 1966b5da9499SMatthew G. Knepley } 196786f0afeeSMatthew G. Knepley /* Face edges have 2 vertices and 2+cells*(1/2) faces */ 1968b5da9499SMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 1969b5da9499SMatthew G. Knepley const PetscInt *cone, *ornt, *support; 1970b5da9499SMatthew G. Knepley PetscInt coneSize, supportSize, s; 1971b5da9499SMatthew G. Knepley 1972b5da9499SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 1973b5da9499SMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 1974b5da9499SMatthew G. Knepley for (r = 0; r < 3; ++r) { 1975b5da9499SMatthew G. Knepley const PetscInt newp = eStartNew + (eEnd - eStart)*2 + (f - fStart)*3 + r; 1976b5da9499SMatthew G. Knepley PetscInt coneNew[2], intFaces = 0, er, eint[4] = {1, 0, 2, 0}; 1977b5da9499SMatthew G. Knepley PetscInt fint[24] = { 1, 7, -1, -1, 0, 5, 1978b5da9499SMatthew G. Knepley -1, -1, 1, 6, 0, 4, 1979b5da9499SMatthew G. Knepley 2, 5, 3, 4, -1, -1, 1980b5da9499SMatthew G. Knepley -1, -1, 3, 6, 2, 7}; 1981b5da9499SMatthew G. Knepley 1982b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, f, &cone);CHKERRQ(ierr); 1983b5da9499SMatthew G. Knepley coneNew[0] = vStartNew + (vEnd - vStart) + (cone[(r+0)%3] - eStart); 1984b5da9499SMatthew G. Knepley coneNew[1] = vStartNew + (vEnd - vStart) + (cone[(r+1)%3] - eStart); 1985b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 1986b5da9499SMatthew G. Knepley #if 1 1987b5da9499SMatthew 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); 1988b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 1989b5da9499SMatthew 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); 1990b5da9499SMatthew G. Knepley } 1991b5da9499SMatthew G. Knepley #endif 1992b5da9499SMatthew G. Knepley supportRef[0] = fStartNew + (f - fStart)*4 + (r+1)%3; 1993b5da9499SMatthew G. Knepley supportRef[1] = fStartNew + (f - fStart)*4 + 3; 1994b5da9499SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 1995b5da9499SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1996b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1997b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 1998b5da9499SMatthew G. Knepley for (c = 0; c < coneSize; ++c) {if (cone[c] == f) break;} 199986f0afeeSMatthew G. Knepley /* Here we want to determine whether edge newp contains a vertex which is part of the cross-tet edge */ 200086f0afeeSMatthew G. Knepley er = ornt[c] < 0 ? (-(ornt[c]+1) + 2-r)%3 : (ornt[c] + r)%3; 2001b5da9499SMatthew G. Knepley if (er == eint[c]) { 2002b5da9499SMatthew G. Knepley supportRef[2+intFaces++] = fStartNew + (fEnd - fStart)*4 + (support[s] - cStart)*8 + (c + 2)%4; 2003b5da9499SMatthew G. Knepley } else { 2004b5da9499SMatthew G. Knepley supportRef[2+intFaces++] = fStartNew + (fEnd - fStart)*4 + (support[s] - cStart)*8 + fint[(c*3 + er)*2 + 0]; 2005b5da9499SMatthew G. Knepley supportRef[2+intFaces++] = fStartNew + (fEnd - fStart)*4 + (support[s] - cStart)*8 + fint[(c*3 + er)*2 + 1]; 2006b5da9499SMatthew G. Knepley } 2007b5da9499SMatthew G. Knepley } 2008b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 2009b5da9499SMatthew G. Knepley #if 1 2010b5da9499SMatthew 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); 2011b5da9499SMatthew G. Knepley for (p = 0; p < intFaces; ++p) { 2012b5da9499SMatthew 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); 2013b5da9499SMatthew G. Knepley } 2014b5da9499SMatthew G. Knepley #endif 2015b5da9499SMatthew G. Knepley } 2016b5da9499SMatthew G. Knepley } 2017b5da9499SMatthew G. Knepley /* Interior edges have 2 vertices and 4 faces */ 2018b5da9499SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2019b5da9499SMatthew G. Knepley const PetscInt newp = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*3 + (c - cStart); 2020b5da9499SMatthew G. Knepley const PetscInt *cone, *ornt, *fcone; 20214a40f731SMatthew G. Knepley PetscInt coneNew[2], supportNew[4], find; 2022b5da9499SMatthew G. Knepley 2023b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2024b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 2025b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[0], &fcone);CHKERRQ(ierr); 202642525629SMatthew G. Knepley find = GetTriEdge_Static(ornt[0], 0); 2027b5da9499SMatthew G. Knepley coneNew[0] = vStartNew + (vEnd - vStart) + (fcone[find] - eStart); 2028b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[2], &fcone);CHKERRQ(ierr); 202942525629SMatthew G. Knepley find = GetTriEdge_Static(ornt[2], 1); 2030b5da9499SMatthew G. Knepley coneNew[1] = vStartNew + (vEnd - vStart) + (fcone[find] - eStart); 2031b5da9499SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 2032b5da9499SMatthew G. Knepley #if 1 2033b5da9499SMatthew 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); 2034b5da9499SMatthew G. Knepley for (p = 0; p < 2; ++p) { 2035b5da9499SMatthew 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); 2036b5da9499SMatthew G. Knepley } 2037b5da9499SMatthew G. Knepley #endif 2038b5da9499SMatthew G. Knepley supportNew[0] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 4; 2039b5da9499SMatthew G. Knepley supportNew[1] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 5; 2040b5da9499SMatthew G. Knepley supportNew[2] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 6; 2041b5da9499SMatthew G. Knepley supportNew[3] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*8 + 7; 2042b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 2043b5da9499SMatthew G. Knepley #if 1 2044b5da9499SMatthew 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); 2045b5da9499SMatthew G. Knepley for (p = 0; p < 4; ++p) { 2046b5da9499SMatthew 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); 2047b5da9499SMatthew G. Knepley } 2048b5da9499SMatthew G. Knepley #endif 2049b5da9499SMatthew G. Knepley } 2050b5da9499SMatthew G. Knepley /* Old vertices have identical supports */ 2051b5da9499SMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 2052b5da9499SMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 2053b5da9499SMatthew G. Knepley const PetscInt *support, *cone; 2054b5da9499SMatthew G. Knepley PetscInt size, s; 2055b5da9499SMatthew G. Knepley 2056b5da9499SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 2057b5da9499SMatthew G. Knepley ierr = DMPlexGetSupport(dm, v, &support);CHKERRQ(ierr); 2058b5da9499SMatthew G. Knepley for (s = 0; s < size; ++s) { 2059b5da9499SMatthew G. Knepley PetscInt r = 0; 2060b5da9499SMatthew G. Knepley 2061b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 2062b5da9499SMatthew G. Knepley if (cone[1] == v) r = 1; 2063b5da9499SMatthew G. Knepley supportRef[s] = eStartNew + (support[s] - eStart)*2 + r; 2064b5da9499SMatthew G. Knepley } 2065b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 2066b5da9499SMatthew G. Knepley #if 1 2067b5da9499SMatthew 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); 2068b5da9499SMatthew G. Knepley for (p = 0; p < size; ++p) { 2069b5da9499SMatthew 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); 2070b5da9499SMatthew G. Knepley } 2071b5da9499SMatthew G. Knepley #endif 2072b5da9499SMatthew G. Knepley } 2073b5da9499SMatthew G. Knepley /* Edge vertices have 2 + face*2 + 0/1 supports */ 2074b5da9499SMatthew G. Knepley for (e = eStart; e < eEnd; ++e) { 2075b5da9499SMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (e - eStart); 2076b5da9499SMatthew G. Knepley const PetscInt *cone, *support; 2077b5da9499SMatthew G. Knepley PetscInt *star = NULL, starSize, cellSize = 0, coneSize, size, s; 2078b5da9499SMatthew G. Knepley 2079b5da9499SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &size);CHKERRQ(ierr); 2080b5da9499SMatthew G. Knepley ierr = DMPlexGetSupport(dm, e, &support);CHKERRQ(ierr); 2081b5da9499SMatthew G. Knepley supportRef[0] = eStartNew + (e - eStart)*2 + 0; 2082b5da9499SMatthew G. Knepley supportRef[1] = eStartNew + (e - eStart)*2 + 1; 2083b5da9499SMatthew G. Knepley for (s = 0; s < size; ++s) { 2084b5da9499SMatthew G. Knepley PetscInt r = 0; 2085b5da9499SMatthew G. Knepley 2086b5da9499SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 2087b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 2088b5da9499SMatthew G. Knepley for (r = 0; r < coneSize; ++r) {if (cone[r] == e) break;} 2089b5da9499SMatthew G. Knepley supportRef[2+s*2+0] = eStartNew + (eEnd - eStart)*2 + (support[s] - fStart)*3 + (r+0)%3; 2090b5da9499SMatthew G. Knepley supportRef[2+s*2+1] = eStartNew + (eEnd - eStart)*2 + (support[s] - fStart)*3 + (r+2)%3; 2091b5da9499SMatthew G. Knepley } 2092b5da9499SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, e, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 2093b5da9499SMatthew G. Knepley for (s = 0; s < starSize*2; s += 2) { 2094b5da9499SMatthew G. Knepley const PetscInt *cone, *ornt; 2095b5da9499SMatthew G. Knepley PetscInt e01, e23; 2096b5da9499SMatthew G. Knepley 2097b5da9499SMatthew G. Knepley if ((star[s] >= cStart) && (star[s] < cEnd)) { 2098b5da9499SMatthew G. Knepley /* Check edge 0-1 */ 2099b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, star[s], &cone);CHKERRQ(ierr); 2100b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, star[s], &ornt);CHKERRQ(ierr); 2101b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[0], &cone);CHKERRQ(ierr); 210242525629SMatthew G. Knepley e01 = cone[GetTriEdge_Static(ornt[0], 0)]; 2103b5da9499SMatthew G. Knepley /* Check edge 2-3 */ 2104b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, star[s], &cone);CHKERRQ(ierr); 2105b5da9499SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, star[s], &ornt);CHKERRQ(ierr); 210642525629SMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[2], &cone);CHKERRQ(ierr); 210742525629SMatthew G. Knepley e23 = cone[GetTriEdge_Static(ornt[2], 1)]; 2108b5da9499SMatthew G. Knepley if ((e01 == e) || (e23 == e)) {supportRef[2+size*2+cellSize++] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*3 + (star[s] - cStart);} 2109b5da9499SMatthew G. Knepley } 2110b5da9499SMatthew G. Knepley } 2111b5da9499SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, e, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 2112b5da9499SMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 2113b5da9499SMatthew G. Knepley #if 1 2114b5da9499SMatthew 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); 2115b5da9499SMatthew G. Knepley for (p = 0; p < 2+size*2+cellSize; ++p) { 2116b5da9499SMatthew 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); 2117b5da9499SMatthew G. Knepley } 2118b5da9499SMatthew G. Knepley #endif 2119b5da9499SMatthew G. Knepley } 2120b5da9499SMatthew G. Knepley ierr = PetscFree(supportRef);CHKERRQ(ierr); 2121b5da9499SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, 3, cStart, NULL, NULL, &faces);CHKERRQ(ierr); 2122b5da9499SMatthew G. Knepley break; 21236ce3c06aSMatthew G. Knepley case 7: 21246ce3c06aSMatthew G. Knepley /* Hybrid Simplicial 3D */ 21256ce3c06aSMatthew G. Knepley ierr = DMPlexGetHybridBounds(rdm, &cMaxNew, &fMaxNew, &eMaxNew, NULL);CHKERRQ(ierr); 21266ce3c06aSMatthew G. Knepley /* Interior cells have 4 faces: Tet face order is prescribed in DMPlexGetFaces_Internal() */ 21276ce3c06aSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, 3, 4, cellInd, NULL, NULL, &faces);CHKERRQ(ierr); 21286ce3c06aSMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 21296ce3c06aSMatthew G. Knepley const PetscInt newp = cStartNew + (c - cStart)*8; 21306ce3c06aSMatthew G. Knepley const PetscInt *cone, *ornt; 21316ce3c06aSMatthew G. Knepley PetscInt coneNew[4], orntNew[4]; 21326ce3c06aSMatthew G. Knepley 21336ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 21346ce3c06aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 21356ce3c06aSMatthew G. Knepley /* A tetrahedron: {0, a, c, d} */ 21366ce3c06aSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*4 + GetTriSubface_Static(ornt[0], 0); /* A */ 21376ce3c06aSMatthew G. Knepley orntNew[0] = ornt[0]; 21386ce3c06aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*4 + GetTriSubface_Static(ornt[1], 0); /* A */ 21396ce3c06aSMatthew G. Knepley orntNew[1] = ornt[1]; 21406ce3c06aSMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*4 + GetTriSubface_Static(ornt[2], 0); /* A */ 21416ce3c06aSMatthew G. Knepley orntNew[2] = ornt[2]; 21426ce3c06aSMatthew G. Knepley coneNew[3] = fStartNew + (fMax - fStart)*4 + (c - cStart)*8 + 0; 21436ce3c06aSMatthew G. Knepley orntNew[3] = 0; 21446ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+0, coneNew);CHKERRQ(ierr); 21456ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+0, orntNew);CHKERRQ(ierr); 21466ce3c06aSMatthew G. Knepley #if 1 21476ce3c06aSMatthew G. Knepley if ((newp+0 < cStartNew) || (newp+0 >= cMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+0, cStartNew, cMaxNew); 21486ce3c06aSMatthew G. Knepley for (p = 0; p < 4; ++p) { 21496ce3c06aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fMaxNew); 21506ce3c06aSMatthew G. Knepley } 21516ce3c06aSMatthew G. Knepley #endif 21526ce3c06aSMatthew G. Knepley /* B tetrahedron: {a, 1, b, e} */ 21536ce3c06aSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*4 + GetTriSubface_Static(ornt[0], 1); /* B */ 21546ce3c06aSMatthew G. Knepley orntNew[0] = ornt[0]; 21556ce3c06aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*4 + GetTriSubface_Static(ornt[1], 2); /* C */ 21566ce3c06aSMatthew G. Knepley orntNew[1] = ornt[1]; 21576ce3c06aSMatthew G. Knepley coneNew[2] = fStartNew + (fMax - fStart)*4 + (c - cStart)*8 + 1; 21586ce3c06aSMatthew G. Knepley orntNew[2] = 0; 21596ce3c06aSMatthew G. Knepley coneNew[3] = fStartNew + (cone[3] - fStart)*4 + GetTriSubface_Static(ornt[3], 1); /* B */ 21606ce3c06aSMatthew G. Knepley orntNew[3] = ornt[3]; 21616ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+1, coneNew);CHKERRQ(ierr); 21626ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+1, orntNew);CHKERRQ(ierr); 21636ce3c06aSMatthew G. Knepley #if 1 21646ce3c06aSMatthew G. Knepley if ((newp+1 < cStartNew) || (newp+1 >= cMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+1, cStartNew, cMaxNew); 21656ce3c06aSMatthew G. Knepley for (p = 0; p < 4; ++p) { 21666ce3c06aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fMaxNew); 21676ce3c06aSMatthew G. Knepley } 21686ce3c06aSMatthew G. Knepley #endif 21696ce3c06aSMatthew G. Knepley /* C tetrahedron: {c, b, 2, f} */ 21706ce3c06aSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*4 + GetTriSubface_Static(ornt[0], 2); /* C */ 21716ce3c06aSMatthew G. Knepley orntNew[0] = ornt[0]; 21726ce3c06aSMatthew G. Knepley coneNew[1] = fStartNew + (fMax - fStart)*4 + (c - cStart)*8 + 2; 21736ce3c06aSMatthew G. Knepley orntNew[1] = 0; 21746ce3c06aSMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*4 + GetTriSubface_Static(ornt[2], 1); /* B */ 21756ce3c06aSMatthew G. Knepley orntNew[2] = ornt[2]; 21766ce3c06aSMatthew G. Knepley coneNew[3] = fStartNew + (cone[3] - fStart)*4 + GetTriSubface_Static(ornt[3], 0); /* A */ 21776ce3c06aSMatthew G. Knepley orntNew[3] = ornt[3]; 21786ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+2, coneNew);CHKERRQ(ierr); 21796ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+2, orntNew);CHKERRQ(ierr); 21806ce3c06aSMatthew G. Knepley #if 1 21816ce3c06aSMatthew G. Knepley if ((newp+2 < cStartNew) || (newp+2 >= cMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+2, cStartNew, cMaxNew); 21826ce3c06aSMatthew G. Knepley for (p = 0; p < 4; ++p) { 21836ce3c06aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fMaxNew); 21846ce3c06aSMatthew G. Knepley } 21856ce3c06aSMatthew G. Knepley #endif 21866ce3c06aSMatthew G. Knepley /* D tetrahedron: {d, e, f, 3} */ 21876ce3c06aSMatthew G. Knepley coneNew[0] = fStartNew + (fMax - fStart)*4 + (c - cStart)*8 + 3; 21886ce3c06aSMatthew G. Knepley orntNew[0] = 0; 21896ce3c06aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*4 + GetTriSubface_Static(ornt[1], 1); /* B */ 21906ce3c06aSMatthew G. Knepley orntNew[1] = ornt[1]; 21916ce3c06aSMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*4 + GetTriSubface_Static(ornt[2], 2); /* C */ 21926ce3c06aSMatthew G. Knepley orntNew[2] = ornt[2]; 21936ce3c06aSMatthew G. Knepley coneNew[3] = fStartNew + (cone[3] - fStart)*4 + GetTriSubface_Static(ornt[3], 2); /* C */ 21946ce3c06aSMatthew G. Knepley orntNew[3] = ornt[3]; 21956ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+3, coneNew);CHKERRQ(ierr); 21966ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+3, orntNew);CHKERRQ(ierr); 21976ce3c06aSMatthew G. Knepley #if 1 21986ce3c06aSMatthew G. Knepley if ((newp+3 < cStartNew) || (newp+3 >= cMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+3, cStartNew, cMaxNew); 21996ce3c06aSMatthew G. Knepley for (p = 0; p < 4; ++p) { 22006ce3c06aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fMaxNew); 22016ce3c06aSMatthew G. Knepley } 22026ce3c06aSMatthew G. Knepley #endif 22036ce3c06aSMatthew G. Knepley /* A' tetrahedron: {d, a, c, f} */ 22046ce3c06aSMatthew G. Knepley coneNew[0] = fStartNew + (fMax - fStart)*4 + (c - cStart)*8 + 0; 22056ce3c06aSMatthew G. Knepley orntNew[0] = -3; 22066ce3c06aSMatthew G. Knepley coneNew[1] = fStartNew + (fMax - fStart)*4 + (c - cStart)*8 + 4; 22076ce3c06aSMatthew G. Knepley orntNew[1] = 0; 22086ce3c06aSMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*4 + 3; 22096ce3c06aSMatthew G. Knepley orntNew[2] = ornt[2] < 0 ? -((-(ornt[2]+1)+2)%3+1) : (ornt[2]+2)%3; 22106ce3c06aSMatthew G. Knepley coneNew[3] = fStartNew + (fMax - fStart)*4 + (c - cStart)*8 + 5; 22116ce3c06aSMatthew G. Knepley orntNew[3] = 0; 22126ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+4, coneNew);CHKERRQ(ierr); 22136ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+4, orntNew);CHKERRQ(ierr); 22146ce3c06aSMatthew G. Knepley #if 1 22156ce3c06aSMatthew G. Knepley if ((newp+4 < cStartNew) || (newp+4 >= cMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+4, cStartNew, cMaxNew); 22166ce3c06aSMatthew G. Knepley for (p = 0; p < 4; ++p) { 22176ce3c06aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fMaxNew); 22186ce3c06aSMatthew G. Knepley } 22196ce3c06aSMatthew G. Knepley #endif 22206ce3c06aSMatthew G. Knepley /* B' tetrahedron: {e, b, a, f} */ 22216ce3c06aSMatthew G. Knepley coneNew[0] = fStartNew + (fMax - fStart)*4 + (c - cStart)*8 + 1; 22226ce3c06aSMatthew G. Knepley orntNew[0] = -3; 22236ce3c06aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[3] - fStart)*4 + 3; 22246ce3c06aSMatthew G. Knepley orntNew[1] = ornt[3] < 0 ? -((-(ornt[3]+1)+1)%3+1) : (ornt[3]+1)%3; 22256ce3c06aSMatthew G. Knepley coneNew[2] = fStartNew + (fMax - fStart)*4 + (c - cStart)*8 + 6; 22266ce3c06aSMatthew G. Knepley orntNew[2] = 0; 22276ce3c06aSMatthew G. Knepley coneNew[3] = fStartNew + (fMax - fStart)*4 + (c - cStart)*8 + 7; 22286ce3c06aSMatthew G. Knepley orntNew[3] = 0; 22296ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+5, coneNew);CHKERRQ(ierr); 22306ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+5, orntNew);CHKERRQ(ierr); 22316ce3c06aSMatthew G. Knepley #if 1 22326ce3c06aSMatthew G. Knepley if ((newp+5 < cStartNew) || (newp+5 >= cMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+5, cStartNew, cMaxNew); 22336ce3c06aSMatthew G. Knepley for (p = 0; p < 4; ++p) { 22346ce3c06aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fMaxNew); 22356ce3c06aSMatthew G. Knepley } 22366ce3c06aSMatthew G. Knepley #endif 22376ce3c06aSMatthew G. Knepley /* C' tetrahedron: {b, f, c, a} */ 22386ce3c06aSMatthew G. Knepley coneNew[0] = fStartNew + (fMax - fStart)*4 + (c - cStart)*8 + 2; 22396ce3c06aSMatthew G. Knepley orntNew[0] = -3; 22406ce3c06aSMatthew G. Knepley coneNew[1] = fStartNew + (fMax - fStart)*4 + (c - cStart)*8 + 7; 22416ce3c06aSMatthew G. Knepley orntNew[1] = -2; 22426ce3c06aSMatthew G. Knepley coneNew[2] = fStartNew + (cone[0] - fStart)*4 + 3; 22436ce3c06aSMatthew G. Knepley orntNew[2] = ornt[0] < 0 ? (-(ornt[0]+1)+1)%3 : -((ornt[0]+1)%3+1); 22446ce3c06aSMatthew G. Knepley coneNew[3] = fStartNew + (fMax - fStart)*4 + (c - cStart)*8 + 5; 22456ce3c06aSMatthew G. Knepley orntNew[3] = -1; 22466ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+6, coneNew);CHKERRQ(ierr); 22476ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+6, orntNew);CHKERRQ(ierr); 22486ce3c06aSMatthew G. Knepley #if 1 22496ce3c06aSMatthew G. Knepley if ((newp+6 < cStartNew) || (newp+6 >= cMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+6, cStartNew, cMaxNew); 22506ce3c06aSMatthew G. Knepley for (p = 0; p < 4; ++p) { 22516ce3c06aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fMaxNew); 22526ce3c06aSMatthew G. Knepley } 22536ce3c06aSMatthew G. Knepley #endif 22546ce3c06aSMatthew G. Knepley /* D' tetrahedron: {f, e, d, a} */ 22556ce3c06aSMatthew G. Knepley coneNew[0] = fStartNew + (fMax - fStart)*4 + (c - cStart)*8 + 3; 22566ce3c06aSMatthew G. Knepley orntNew[0] = -3; 22576ce3c06aSMatthew G. Knepley coneNew[1] = fStartNew + (fMax - fStart)*4 + (c - cStart)*8 + 6; 22586ce3c06aSMatthew G. Knepley orntNew[1] = -3; 22596ce3c06aSMatthew G. Knepley coneNew[2] = fStartNew + (fMax - fStart)*4 + (c - cStart)*8 + 4; 22606ce3c06aSMatthew G. Knepley orntNew[2] = -2; 22616ce3c06aSMatthew G. Knepley coneNew[3] = fStartNew + (cone[1] - fStart)*4 + 3; 22626ce3c06aSMatthew G. Knepley orntNew[3] = ornt[2]; 22636ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+7, coneNew);CHKERRQ(ierr); 22646ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+7, orntNew);CHKERRQ(ierr); 22656ce3c06aSMatthew G. Knepley #if 1 22666ce3c06aSMatthew G. Knepley if ((newp+7 < cStartNew) || (newp+7 >= cMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", newp+7, cStartNew, cMaxNew); 22676ce3c06aSMatthew G. Knepley for (p = 0; p < 4; ++p) { 22686ce3c06aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fMaxNew); 22696ce3c06aSMatthew G. Knepley } 22706ce3c06aSMatthew G. Knepley #endif 22716ce3c06aSMatthew G. Knepley } 22726ce3c06aSMatthew G. Knepley /* Hybrid cells have 5 faces */ 22736ce3c06aSMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 22746ce3c06aSMatthew G. Knepley const PetscInt newp = cStartNew + (cMax - cStart)*8 + (c - cMax)*4; 22756ce3c06aSMatthew G. Knepley const PetscInt *cone, *ornt; 22766ce3c06aSMatthew G. Knepley PetscInt coneNew[5], orntNew[5]; 22776ce3c06aSMatthew G. Knepley 22786ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 22796ce3c06aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 22806ce3c06aSMatthew G. Knepley for (r = 0; r < 3; ++r) { 22816ce3c06aSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*4 + GetTriSubface_Static(ornt[0], r); 22826ce3c06aSMatthew G. Knepley orntNew[0] = ornt[0]; 22836ce3c06aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*4 + GetTriSubface_Static(ornt[1], r); 22846ce3c06aSMatthew G. Knepley orntNew[1] = ornt[1]; 22856ce3c06aSMatthew G. Knepley coneNew[2] = fStartNew + (fMax - fStart)*4 + (cMax - cStart)*8 + (cone[2+GetTriSubface_Static(ornt[0], (r+2)%3)] - fMax)*2 + (ornt[2+GetTriSubface_Static(ornt[0], (r+2)%3)] < 0 ? 0 : 1); 22866ce3c06aSMatthew G. Knepley orntNew[2] = 0; 22876ce3c06aSMatthew G. Knepley coneNew[3] = fStartNew + (fMax - fStart)*4 + (cMax - cStart)*8 + (cone[2+GetTriSubface_Static(ornt[0], r)] - fMax)*2 + (ornt[2+GetTriSubface_Static(ornt[0], r)] < 0 ? 1 : 0); 22886ce3c06aSMatthew G. Knepley orntNew[3] = 0; 22896ce3c06aSMatthew G. Knepley coneNew[4] = fStartNew + (fMax - fStart)*4 + (cMax - cStart)*8 + (fEnd - fMax)*2 + (c - cMax)*3 + GetTriSubface_Static(ornt[0], r); 22906ce3c06aSMatthew G. Knepley orntNew[4] = 0; 22916ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+r, coneNew);CHKERRQ(ierr); 22926ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+r, orntNew);CHKERRQ(ierr); 22936ce3c06aSMatthew G. Knepley #if 1 22946ce3c06aSMatthew G. Knepley if ((newp+r < cMaxNew) || (newp+r >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a hybrid cell [%d, %d)", newp+r, cMaxNew, cEndNew); 22956ce3c06aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 22966ce3c06aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fMaxNew); 22976ce3c06aSMatthew G. Knepley } 22986ce3c06aSMatthew G. Knepley for (p = 2; p < 5; ++p) { 22996ce3c06aSMatthew G. Knepley if ((coneNew[p] < fMaxNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a hybrid face [%d, %d)", coneNew[p], fMaxNew, fEndNew); 23006ce3c06aSMatthew G. Knepley } 23016ce3c06aSMatthew G. Knepley #endif 23026ce3c06aSMatthew G. Knepley } 23036ce3c06aSMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*4 + 3; 23046ce3c06aSMatthew G. Knepley orntNew[0] = 0; 23056ce3c06aSMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*4 + 3; 23066ce3c06aSMatthew G. Knepley orntNew[1] = 0; 23076ce3c06aSMatthew G. Knepley coneNew[2] = fStartNew + (fMax - fStart)*4 + (cMax - cStart)*8 + (fEnd - fMax)*2 + (c - cMax)*3 + 0; 23086ce3c06aSMatthew G. Knepley orntNew[2] = 0; 23096ce3c06aSMatthew G. Knepley coneNew[3] = fStartNew + (fMax - fStart)*4 + (cMax - cStart)*8 + (fEnd - fMax)*2 + (c - cMax)*3 + 1; 23106ce3c06aSMatthew G. Knepley orntNew[3] = 0; 23116ce3c06aSMatthew G. Knepley coneNew[4] = fStartNew + (fMax - fStart)*4 + (cMax - cStart)*8 + (fEnd - fMax)*2 + (c - cMax)*3 + 2; 23126ce3c06aSMatthew G. Knepley orntNew[4] = 0; 23136ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+3, coneNew);CHKERRQ(ierr); 23146ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+3, orntNew);CHKERRQ(ierr); 23156ce3c06aSMatthew G. Knepley #if 1 23166ce3c06aSMatthew G. Knepley if ((newp+3 < cMaxNew) || (newp+3 >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a hybrid cell [%d, %d)", newp+3, cMaxNew, cEndNew); 23176ce3c06aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 23186ce3c06aSMatthew G. Knepley if ((coneNew[p] < fStartNew) || (coneNew[p] >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", coneNew[p], fStartNew, fMaxNew); 23196ce3c06aSMatthew G. Knepley } 23206ce3c06aSMatthew G. Knepley for (p = 2; p < 5; ++p) { 23216ce3c06aSMatthew G. Knepley if ((coneNew[p] < fMaxNew) || (coneNew[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a hybrid face [%d, %d)", coneNew[p], fMaxNew, fEndNew); 23226ce3c06aSMatthew G. Knepley } 23236ce3c06aSMatthew G. Knepley #endif 23246ce3c06aSMatthew G. Knepley } 23256ce3c06aSMatthew G. Knepley /* Split faces have 3 edges and the same cells as the parent */ 23266ce3c06aSMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, NULL, &maxSupportSize);CHKERRQ(ierr); 23276ce3c06aSMatthew G. Knepley ierr = PetscMalloc((2 + maxSupportSize*2) * sizeof(PetscInt), &supportRef);CHKERRQ(ierr); 23286ce3c06aSMatthew G. Knepley for (f = fStart; f < fMax; ++f) { 23296ce3c06aSMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*4; 23306ce3c06aSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 23316ce3c06aSMatthew G. Knepley PetscInt coneNew[3], orntNew[3], coneSize, supportSize, s; 23326ce3c06aSMatthew G. Knepley 23336ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, f, &cone);CHKERRQ(ierr); 23346ce3c06aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, f, &ornt);CHKERRQ(ierr); 23356ce3c06aSMatthew G. Knepley /* A triangle */ 23366ce3c06aSMatthew G. Knepley coneNew[0] = eStartNew + (cone[0] - eStart)*2 + (ornt[0] < 0 ? 1 : 0); 23376ce3c06aSMatthew G. Knepley orntNew[0] = ornt[0]; 23386ce3c06aSMatthew G. Knepley coneNew[1] = eStartNew + (eMax - eStart)*2 + (f - fStart)*3 + 2; 23396ce3c06aSMatthew G. Knepley orntNew[1] = -2; 23406ce3c06aSMatthew G. Knepley coneNew[2] = eStartNew + (cone[2] - eStart)*2 + (ornt[2] < 0 ? 0 : 1); 23416ce3c06aSMatthew G. Knepley orntNew[2] = ornt[2]; 23426ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+0, coneNew);CHKERRQ(ierr); 23436ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+0, orntNew);CHKERRQ(ierr); 23446ce3c06aSMatthew G. Knepley #if 1 23456ce3c06aSMatthew G. Knepley if ((newp+0 < fStartNew) || (newp+0 >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp+0, fStartNew, fMaxNew); 23466ce3c06aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 23476ce3c06aSMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eMaxNew); 23486ce3c06aSMatthew G. Knepley } 23496ce3c06aSMatthew G. Knepley #endif 23506ce3c06aSMatthew G. Knepley /* B triangle */ 23516ce3c06aSMatthew G. Knepley coneNew[0] = eStartNew + (cone[0] - eStart)*2 + (ornt[0] < 0 ? 0 : 1); 23526ce3c06aSMatthew G. Knepley orntNew[0] = ornt[0]; 23536ce3c06aSMatthew G. Knepley coneNew[1] = eStartNew + (cone[1] - eStart)*2 + (ornt[1] < 0 ? 1 : 0); 23546ce3c06aSMatthew G. Knepley orntNew[1] = ornt[1]; 23556ce3c06aSMatthew G. Knepley coneNew[2] = eStartNew + (eMax - eStart)*2 + (f - fStart)*3 + 0; 23566ce3c06aSMatthew G. Knepley orntNew[2] = -2; 23576ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+1, coneNew);CHKERRQ(ierr); 23586ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+1, orntNew);CHKERRQ(ierr); 23596ce3c06aSMatthew G. Knepley #if 1 23606ce3c06aSMatthew G. Knepley if ((newp+1 < fStartNew) || (newp+1 >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp+1, fStartNew, fMaxNew); 23616ce3c06aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 23626ce3c06aSMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eMaxNew); 23636ce3c06aSMatthew G. Knepley } 23646ce3c06aSMatthew G. Knepley #endif 23656ce3c06aSMatthew G. Knepley /* C triangle */ 23666ce3c06aSMatthew G. Knepley coneNew[0] = eStartNew + (eMax - eStart)*2 + (f - fStart)*3 + 1; 23676ce3c06aSMatthew G. Knepley orntNew[0] = -2; 23686ce3c06aSMatthew G. Knepley coneNew[1] = eStartNew + (cone[1] - eStart)*2 + (ornt[1] < 0 ? 0 : 1); 23696ce3c06aSMatthew G. Knepley orntNew[1] = ornt[1]; 23706ce3c06aSMatthew G. Knepley coneNew[2] = eStartNew + (cone[2] - eStart)*2 + (ornt[2] < 0 ? 1 : 0); 23716ce3c06aSMatthew G. Knepley orntNew[2] = ornt[2]; 23726ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+2, coneNew);CHKERRQ(ierr); 23736ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+2, orntNew);CHKERRQ(ierr); 23746ce3c06aSMatthew G. Knepley #if 1 23756ce3c06aSMatthew G. Knepley if ((newp+2 < fStartNew) || (newp+2 >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp+2, fStartNew, fMaxNew); 23766ce3c06aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 23776ce3c06aSMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eMaxNew); 23786ce3c06aSMatthew G. Knepley } 23796ce3c06aSMatthew G. Knepley #endif 23806ce3c06aSMatthew G. Knepley /* D triangle */ 23816ce3c06aSMatthew G. Knepley coneNew[0] = eStartNew + (eMax - eStart)*2 + (f - fStart)*3 + 0; 23826ce3c06aSMatthew G. Knepley orntNew[0] = 0; 23836ce3c06aSMatthew G. Knepley coneNew[1] = eStartNew + (eMax - eStart)*2 + (f - fStart)*3 + 1; 23846ce3c06aSMatthew G. Knepley orntNew[1] = 0; 23856ce3c06aSMatthew G. Knepley coneNew[2] = eStartNew + (eMax - eStart)*2 + (f - fStart)*3 + 2; 23866ce3c06aSMatthew G. Knepley orntNew[2] = 0; 23876ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+3, coneNew);CHKERRQ(ierr); 23886ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+3, orntNew);CHKERRQ(ierr); 23896ce3c06aSMatthew G. Knepley #if 1 23906ce3c06aSMatthew G. Knepley if ((newp+3 < fStartNew) || (newp+3 >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp+3, fStartNew, fMaxNew); 23916ce3c06aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 23926ce3c06aSMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eMaxNew); 23936ce3c06aSMatthew G. Knepley } 23946ce3c06aSMatthew G. Knepley #endif 23956ce3c06aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 23966ce3c06aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 23976ce3c06aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 23986ce3c06aSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 23996ce3c06aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 24006ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 24016ce3c06aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 24026ce3c06aSMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 24036ce3c06aSMatthew G. Knepley if (cone[c] == f) break; 24046ce3c06aSMatthew G. Knepley } 24056ce3c06aSMatthew G. Knepley if (support[s] < cMax) { 24066ce3c06aSMatthew 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])); 24076ce3c06aSMatthew G. Knepley } else { 24086ce3c06aSMatthew G. Knepley supportRef[s] = cStartNew + (cMax - cStart)*8 + (support[s] - cMax)*4 + r; 24096ce3c06aSMatthew G. Knepley } 24106ce3c06aSMatthew G. Knepley } 24116ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp+r, supportRef);CHKERRQ(ierr); 24126ce3c06aSMatthew G. Knepley #if 1 24136ce3c06aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fMaxNew); 24146ce3c06aSMatthew G. Knepley for (p = 0; p < supportSize; ++p) { 24156ce3c06aSMatthew G. Knepley if ((supportRef[p] < cStartNew) || (supportRef[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an interior or hybrid cell [%d, %d)", supportRef[p], cStartNew, cEndNew); 24166ce3c06aSMatthew G. Knepley } 24176ce3c06aSMatthew G. Knepley #endif 24186ce3c06aSMatthew G. Knepley } 24196ce3c06aSMatthew G. Knepley } 24206ce3c06aSMatthew G. Knepley /* Interior cell faces have 3 edges and 2 cells */ 24216ce3c06aSMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 24226ce3c06aSMatthew G. Knepley PetscInt newp = fStartNew + (fMax - fStart)*4 + (c - cStart)*8; 24236ce3c06aSMatthew G. Knepley const PetscInt *cone, *ornt; 24246ce3c06aSMatthew G. Knepley PetscInt coneNew[3], orntNew[3]; 24256ce3c06aSMatthew G. Knepley PetscInt supportNew[2]; 24266ce3c06aSMatthew G. Knepley 24276ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 24286ce3c06aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 24296ce3c06aSMatthew G. Knepley /* Face A: {c, a, d} */ 24306ce3c06aSMatthew G. Knepley coneNew[0] = eStartNew + (eMax - eStart)*2 + (cone[0] - fStart)*3 + (ornt[0] < 0 ? (-(ornt[0]+1)+0)%3 : (ornt[0]+2)%3); 24316ce3c06aSMatthew G. Knepley orntNew[0] = ornt[0] < 0 ? -2 : 0; 24326ce3c06aSMatthew G. Knepley coneNew[1] = eStartNew + (eMax - eStart)*2 + (cone[1] - fStart)*3 + (ornt[1] < 0 ? (-(ornt[1]+1)+0)%3 : (ornt[1]+2)%3); 24336ce3c06aSMatthew G. Knepley orntNew[1] = ornt[1] < 0 ? -2 : 0; 24346ce3c06aSMatthew G. Knepley coneNew[2] = eStartNew + (eMax - eStart)*2 + (cone[2] - fStart)*3 + (ornt[2] < 0 ? (-(ornt[2]+1)+0)%3 : (ornt[2]+2)%3); 24356ce3c06aSMatthew G. Knepley orntNew[2] = ornt[2] < 0 ? -2 : 0; 24366ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 24376ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 24386ce3c06aSMatthew G. Knepley #if 1 24396ce3c06aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fMaxNew); 24406ce3c06aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 24416ce3c06aSMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eMaxNew); 24426ce3c06aSMatthew G. Knepley } 24436ce3c06aSMatthew G. Knepley #endif 24446ce3c06aSMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 0; 24456ce3c06aSMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 0+4; 24466ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 24476ce3c06aSMatthew G. Knepley #if 1 24486ce3c06aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fMaxNew); 24496ce3c06aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 24506ce3c06aSMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cMaxNew); 24516ce3c06aSMatthew G. Knepley } 24526ce3c06aSMatthew G. Knepley #endif 24536ce3c06aSMatthew G. Knepley ++newp; 24546ce3c06aSMatthew G. Knepley /* Face B: {a, b, e} */ 24556ce3c06aSMatthew G. Knepley coneNew[0] = eStartNew + (eMax - eStart)*2 + (cone[0] - fStart)*3 + (ornt[0] < 0 ? (-(ornt[0]+1)+2)%3 : (ornt[0]+0)%3); 24566ce3c06aSMatthew G. Knepley orntNew[0] = ornt[0] < 0 ? -2 : 0; 24576ce3c06aSMatthew G. Knepley coneNew[1] = eStartNew + (eMax - eStart)*2 + (cone[3] - fStart)*3 + (ornt[3] < 0 ? (-(ornt[3]+1)+2)%3 : (ornt[3]+0)%3); 24586ce3c06aSMatthew G. Knepley orntNew[1] = ornt[3] < 0 ? -2 : 0; 24596ce3c06aSMatthew G. Knepley coneNew[2] = eStartNew + (eMax - eStart)*2 + (cone[1] - fStart)*3 + (ornt[1] < 0 ? (-(ornt[1]+1)+1)%3 : (ornt[1]+1)%3); 24606ce3c06aSMatthew G. Knepley orntNew[2] = ornt[1] < 0 ? -2 : 0; 24616ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 24626ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 24636ce3c06aSMatthew G. Knepley #if 1 24646ce3c06aSMatthew G. Knepley if ((newp+1 < fStartNew) || (newp+1 >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp+1, fStartNew, fMaxNew); 24656ce3c06aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 24666ce3c06aSMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eMaxNew); 24676ce3c06aSMatthew G. Knepley } 24686ce3c06aSMatthew G. Knepley #endif 24696ce3c06aSMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 1; 24706ce3c06aSMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 1+4; 24716ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 24726ce3c06aSMatthew G. Knepley #if 1 24736ce3c06aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fMaxNew); 24746ce3c06aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 24756ce3c06aSMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cMaxNew); 24766ce3c06aSMatthew G. Knepley } 24776ce3c06aSMatthew G. Knepley #endif 24786ce3c06aSMatthew G. Knepley ++newp; 24796ce3c06aSMatthew G. Knepley /* Face C: {c, f, b} */ 24806ce3c06aSMatthew G. Knepley coneNew[0] = eStartNew + (eMax - eStart)*2 + (cone[2] - fStart)*3 + (ornt[2] < 0 ? (-(ornt[2]+1)+2)%3 : (ornt[2]+0)%3); 24816ce3c06aSMatthew G. Knepley orntNew[0] = ornt[2] < 0 ? -2 : 0; 24826ce3c06aSMatthew G. Knepley coneNew[1] = eStartNew + (eMax - eStart)*2 + (cone[3] - fStart)*3 + (ornt[3] < 0 ? (-(ornt[3]+1)+0)%3 : (ornt[3]+2)%3); 24836ce3c06aSMatthew G. Knepley orntNew[1] = ornt[3] < 0 ? -2 : 0; 24846ce3c06aSMatthew G. Knepley coneNew[2] = eStartNew + (eMax - eStart)*2 + (cone[0] - fStart)*3 + (ornt[0] < 0 ? (-(ornt[0]+1)+1)%3 : (ornt[0]+1)%3); 24856ce3c06aSMatthew G. Knepley orntNew[2] = ornt[0] < 0 ? -2 : 0; 24866ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 24876ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 24886ce3c06aSMatthew G. Knepley #if 1 24896ce3c06aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fMaxNew); 24906ce3c06aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 24916ce3c06aSMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eMaxNew); 24926ce3c06aSMatthew G. Knepley } 24936ce3c06aSMatthew G. Knepley #endif 24946ce3c06aSMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 2; 24956ce3c06aSMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 2+4; 24966ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 24976ce3c06aSMatthew G. Knepley #if 1 24986ce3c06aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fMaxNew); 24996ce3c06aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 25006ce3c06aSMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cMaxNew); 25016ce3c06aSMatthew G. Knepley } 25026ce3c06aSMatthew G. Knepley #endif 25036ce3c06aSMatthew G. Knepley ++newp; 25046ce3c06aSMatthew G. Knepley /* Face D: {d, e, f} */ 25056ce3c06aSMatthew G. Knepley coneNew[0] = eStartNew + (eMax - eStart)*2 + (cone[1] - fStart)*3 + (ornt[1] < 0 ? (-(ornt[1]+1)+2)%3 : (ornt[1]+0)%3); 25066ce3c06aSMatthew G. Knepley orntNew[0] = ornt[1] < 0 ? -2 : 0; 25076ce3c06aSMatthew G. Knepley coneNew[1] = eStartNew + (eMax - eStart)*2 + (cone[3] - fStart)*3 + (ornt[3] < 0 ? (-(ornt[3]+1)+1)%3 : (ornt[3]+1)%3); 25086ce3c06aSMatthew G. Knepley orntNew[1] = ornt[3] < 0 ? -2 : 0; 25096ce3c06aSMatthew G. Knepley coneNew[2] = eStartNew + (eMax - eStart)*2 + (cone[2] - fStart)*3 + (ornt[2] < 0 ? (-(ornt[2]+1)+1)%3 : (ornt[2]+1)%3); 25106ce3c06aSMatthew G. Knepley orntNew[2] = ornt[2] < 0 ? -2 : 0; 25116ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 25126ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 25136ce3c06aSMatthew G. Knepley #if 1 25146ce3c06aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fMaxNew); 25156ce3c06aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 25166ce3c06aSMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eMaxNew); 25176ce3c06aSMatthew G. Knepley } 25186ce3c06aSMatthew G. Knepley #endif 25196ce3c06aSMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 3; 25206ce3c06aSMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 3+4; 25216ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 25226ce3c06aSMatthew G. Knepley #if 1 25236ce3c06aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fMaxNew); 25246ce3c06aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 25256ce3c06aSMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cMaxNew); 25266ce3c06aSMatthew G. Knepley } 25276ce3c06aSMatthew G. Knepley #endif 25286ce3c06aSMatthew G. Knepley ++newp; 25296ce3c06aSMatthew G. Knepley /* Face E: {d, f, a} */ 25306ce3c06aSMatthew G. Knepley coneNew[0] = eStartNew + (eMax - eStart)*2 + (cone[2] - fStart)*3 + (ornt[2] < 0 ? (-(ornt[2]+1)+1)%3 : (ornt[2]+1)%3); 25316ce3c06aSMatthew G. Knepley orntNew[0] = ornt[2] < 0 ? 0 : -2; 25326ce3c06aSMatthew G. Knepley coneNew[1] = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (c - cStart); 25336ce3c06aSMatthew G. Knepley orntNew[1] = 0; 25346ce3c06aSMatthew G. Knepley coneNew[2] = eStartNew + (eMax - eStart)*2 + (cone[1] - fStart)*3 + (ornt[1] < 0 ? (-(ornt[1]+1)+0)%3 : (ornt[1]+2)%3); 25356ce3c06aSMatthew G. Knepley orntNew[2] = ornt[1] < 0 ? -2 : 0; 25366ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 25376ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 25386ce3c06aSMatthew G. Knepley #if 1 25396ce3c06aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fMaxNew); 25406ce3c06aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 25416ce3c06aSMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eMaxNew); 25426ce3c06aSMatthew G. Knepley } 25436ce3c06aSMatthew G. Knepley #endif 25446ce3c06aSMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 0+4; 25456ce3c06aSMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 3+4; 25466ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 25476ce3c06aSMatthew G. Knepley #if 1 25486ce3c06aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fMaxNew); 25496ce3c06aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 25506ce3c06aSMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cMaxNew); 25516ce3c06aSMatthew G. Knepley } 25526ce3c06aSMatthew G. Knepley #endif 25536ce3c06aSMatthew G. Knepley ++newp; 25546ce3c06aSMatthew G. Knepley /* Face F: {c, a, f} */ 25556ce3c06aSMatthew G. Knepley coneNew[0] = eStartNew + (eMax - eStart)*2 + (cone[0] - fStart)*3 + (ornt[0] < 0 ? (-(ornt[0]+1)+0)%3 : (ornt[0]+2)%3); 25566ce3c06aSMatthew G. Knepley orntNew[0] = ornt[0] < 0 ? -2 : 0; 25576ce3c06aSMatthew G. Knepley coneNew[1] = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (c - cStart); 25586ce3c06aSMatthew G. Knepley orntNew[1] = -2; 25596ce3c06aSMatthew G. Knepley coneNew[2] = eStartNew + (eMax - eStart)*2 + (cone[2] - fStart)*3 + (ornt[2] < 0 ? (-(ornt[2]+1)+2)%3 : (ornt[2]+0)%3); 25606ce3c06aSMatthew G. Knepley orntNew[2] = ornt[1] < 0 ? 0 : -2; 25616ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 25626ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 25636ce3c06aSMatthew G. Knepley #if 1 25646ce3c06aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fMaxNew); 25656ce3c06aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 25666ce3c06aSMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eMaxNew); 25676ce3c06aSMatthew G. Knepley } 25686ce3c06aSMatthew G. Knepley #endif 25696ce3c06aSMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 0+4; 25706ce3c06aSMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 2+4; 25716ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 25726ce3c06aSMatthew G. Knepley #if 1 25736ce3c06aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fMaxNew); 25746ce3c06aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 25756ce3c06aSMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cMaxNew); 25766ce3c06aSMatthew G. Knepley } 25776ce3c06aSMatthew G. Knepley #endif 25786ce3c06aSMatthew G. Knepley ++newp; 25796ce3c06aSMatthew G. Knepley /* Face G: {e, a, f} */ 25806ce3c06aSMatthew G. Knepley coneNew[0] = eStartNew + (eMax - eStart)*2 + (cone[1] - fStart)*3 + (ornt[1] < 0 ? (-(ornt[1]+1)+1)%3 : (ornt[1]+1)%3); 25816ce3c06aSMatthew G. Knepley orntNew[0] = ornt[1] < 0 ? -2 : 0; 25826ce3c06aSMatthew G. Knepley coneNew[1] = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (c - cStart); 25836ce3c06aSMatthew G. Knepley orntNew[1] = -2; 25846ce3c06aSMatthew G. Knepley coneNew[2] = eStartNew + (eMax - eStart)*2 + (cone[3] - fStart)*3 + (ornt[3] < 0 ? (-(ornt[3]+1)+1)%3 : (ornt[3]+1)%3); 25856ce3c06aSMatthew G. Knepley orntNew[2] = ornt[3] < 0 ? 0 : -2; 25866ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 25876ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 25886ce3c06aSMatthew G. Knepley #if 1 25896ce3c06aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fMaxNew); 25906ce3c06aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 25916ce3c06aSMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eMaxNew); 25926ce3c06aSMatthew G. Knepley } 25936ce3c06aSMatthew G. Knepley #endif 25946ce3c06aSMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 1+4; 25956ce3c06aSMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 3+4; 25966ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 25976ce3c06aSMatthew G. Knepley #if 1 25986ce3c06aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fMaxNew); 25996ce3c06aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 26006ce3c06aSMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cMaxNew); 26016ce3c06aSMatthew G. Knepley } 26026ce3c06aSMatthew G. Knepley #endif 26036ce3c06aSMatthew G. Knepley ++newp; 26046ce3c06aSMatthew G. Knepley /* Face H: {a, b, f} */ 26056ce3c06aSMatthew G. Knepley coneNew[0] = eStartNew + (eMax - eStart)*2 + (cone[0] - fStart)*3 + (ornt[0] < 0 ? (-(ornt[0]+1)+2)%3 : (ornt[0]+0)%3); 26066ce3c06aSMatthew G. Knepley orntNew[0] = ornt[0] < 0 ? -2 : 0; 26076ce3c06aSMatthew G. Knepley coneNew[1] = eStartNew + (eMax - eStart)*2 + (cone[3] - fStart)*3 + (ornt[3] < 0 ? (-(ornt[3]+1)+0)%3 : (ornt[3]+2)%3); 26086ce3c06aSMatthew G. Knepley orntNew[1] = ornt[3] < 0 ? 0 : -2; 26096ce3c06aSMatthew G. Knepley coneNew[2] = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (c - cStart); 26106ce3c06aSMatthew G. Knepley orntNew[2] = 0; 26116ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 26126ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 26136ce3c06aSMatthew G. Knepley #if 1 26146ce3c06aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fMaxNew); 26156ce3c06aSMatthew G. Knepley for (p = 0; p < 3; ++p) { 26166ce3c06aSMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eMaxNew); 26176ce3c06aSMatthew G. Knepley } 26186ce3c06aSMatthew G. Knepley #endif 26196ce3c06aSMatthew G. Knepley supportNew[0] = (c - cStart)*8 + 1+4; 26206ce3c06aSMatthew G. Knepley supportNew[1] = (c - cStart)*8 + 2+4; 26216ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 26226ce3c06aSMatthew G. Knepley #if 1 26236ce3c06aSMatthew G. Knepley if ((newp < fStartNew) || (newp >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", newp, fStartNew, fMaxNew); 26246ce3c06aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 26256ce3c06aSMatthew G. Knepley if ((supportNew[p] < cStartNew) || (supportNew[p] >= cMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a cell [%d, %d)", supportNew[p], cStartNew, cMaxNew); 26266ce3c06aSMatthew G. Knepley } 26276ce3c06aSMatthew G. Knepley #endif 26286ce3c06aSMatthew G. Knepley ++newp; 26296ce3c06aSMatthew G. Knepley } 26306ce3c06aSMatthew G. Knepley /* Hybrid split faces have 4 edges and same cells */ 26316ce3c06aSMatthew G. Knepley for (f = fMax; f < fEnd; ++f) { 26326ce3c06aSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 26336ce3c06aSMatthew G. Knepley PetscInt coneNew[4], orntNew[4]; 26346ce3c06aSMatthew G. Knepley PetscInt supportNew[2], size, s, c; 26356ce3c06aSMatthew G. Knepley 26366ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, f, &cone);CHKERRQ(ierr); 26376ce3c06aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, f, &ornt);CHKERRQ(ierr); 26386ce3c06aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 26396ce3c06aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 26406ce3c06aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 26416ce3c06aSMatthew G. Knepley const PetscInt newp = fStartNew + (fMax - fStart)*4 + (cMax - cStart)*8 + (f - fMax)*2 + r; 26426ce3c06aSMatthew G. Knepley 26436ce3c06aSMatthew G. Knepley coneNew[0] = eStartNew + (cone[0] - eStart)*2 + (ornt[0] < 0 ? 1-r : r); 26446ce3c06aSMatthew G. Knepley orntNew[0] = ornt[0]; 26456ce3c06aSMatthew G. Knepley coneNew[1] = eStartNew + (cone[1] - eStart)*2 + (ornt[1] < 0 ? 1-r : r); 26466ce3c06aSMatthew G. Knepley orntNew[1] = ornt[1]; 26476ce3c06aSMatthew G. Knepley coneNew[2+r] = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (cMax - cStart) + (cone[2+r] - eMax); 26486ce3c06aSMatthew G. Knepley orntNew[2+r] = 0; 26496ce3c06aSMatthew G. Knepley coneNew[3-r] = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (cMax - cStart) + (eEnd - eMax) + (f - fMax); 26506ce3c06aSMatthew G. Knepley orntNew[3-r] = 0; 26516ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 26526ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 26536ce3c06aSMatthew G. Knepley #if 1 26546ce3c06aSMatthew G. Knepley if ((newp < fMaxNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a hybrid face [%d, %d)", newp, fMaxNew, fEndNew); 26556ce3c06aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 26566ce3c06aSMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eMaxNew); 26576ce3c06aSMatthew G. Knepley } 26586ce3c06aSMatthew G. Knepley for (p = 2; p < 4; ++p) { 26596ce3c06aSMatthew G. Knepley if ((coneNew[p] < eMaxNew) || (coneNew[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a hybrid edge [%d, %d)", coneNew[p], eMaxNew, eEndNew); 26606ce3c06aSMatthew G. Knepley } 26616ce3c06aSMatthew G. Knepley #endif 26626ce3c06aSMatthew G. Knepley for (s = 0; s < size; ++s) { 26636ce3c06aSMatthew G. Knepley const PetscInt *coneCell, *orntCell; 26646ce3c06aSMatthew G. Knepley 26656ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &coneCell);CHKERRQ(ierr); 26666ce3c06aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &orntCell);CHKERRQ(ierr); 26676ce3c06aSMatthew G. Knepley for (c = 2; c < 5; ++c) if (coneCell[c] == f) break; 26686ce3c06aSMatthew G. Knepley if (c >= 5) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Could not find face %d in cone of cell %d", f, support[s]); 26696ce3c06aSMatthew G. Knepley supportNew[s] = cStartNew + (cMax - cStart)*8 + (support[s] - cMax)*4 + GetTriSubface_Static(orntCell[c], (c-2+r)%3); 26706ce3c06aSMatthew G. Knepley } 26716ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 26726ce3c06aSMatthew G. Knepley #if 1 26736ce3c06aSMatthew G. Knepley if ((newp < fMaxNew) || (newp >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a hybrid face [%d, %d)", newp, fMaxNew, fEndNew); 26746ce3c06aSMatthew G. Knepley for (p = 0; p < size; ++p) { 26756ce3c06aSMatthew G. Knepley if ((supportNew[p] < cMaxNew) || (supportNew[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a hybrid cell [%d, %d)", supportNew[p], cMaxNew, cEndNew); 26766ce3c06aSMatthew G. Knepley } 26776ce3c06aSMatthew G. Knepley #endif 26786ce3c06aSMatthew G. Knepley } 26796ce3c06aSMatthew G. Knepley } 26806ce3c06aSMatthew G. Knepley /* Hybrid cell faces have 4 edges and 2 cells */ 26816ce3c06aSMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 26826ce3c06aSMatthew G. Knepley PetscInt newp = fStartNew + (fMax - fStart)*4 + (cMax - cStart)*8 + (fEnd - fMax)*2 + (c - cMax)*3; 26836ce3c06aSMatthew G. Knepley const PetscInt *cone, *ornt; 26846ce3c06aSMatthew G. Knepley PetscInt coneNew[4], orntNew[4]; 26856ce3c06aSMatthew G. Knepley PetscInt supportNew[2]; 26866ce3c06aSMatthew G. Knepley 26876ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 26886ce3c06aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 26896ce3c06aSMatthew G. Knepley for (r = 0; r < 3; ++r) { 26906ce3c06aSMatthew G. Knepley coneNew[0] = eStartNew + (eMax - eStart)*2 + (cone[0] - fStart)*3 + GetTriSubface_Static(ornt[0], (r+2)%3); 26916ce3c06aSMatthew G. Knepley orntNew[0] = 0; 26926ce3c06aSMatthew G. Knepley coneNew[1] = eStartNew + (eMax - eStart)*2 + (cone[1] - fStart)*3 + GetTriSubface_Static(ornt[1], (r+2)%3); 26936ce3c06aSMatthew G. Knepley orntNew[1] = 0; 26946ce3c06aSMatthew G. Knepley coneNew[2] = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (cMax - cStart) + (eEnd - eMax) + (cone[2+GetTriSubface_Static(ornt[0], (r+2)%3)] - fMax); 26956ce3c06aSMatthew G. Knepley orntNew[2] = 0; 26966ce3c06aSMatthew G. Knepley coneNew[3] = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (cMax - cStart) + (eEnd - eMax) + (cone[2+GetTriSubface_Static(ornt[0], r)] - fMax); 26976ce3c06aSMatthew G. Knepley orntNew[3] = 0; 26986ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+r, coneNew);CHKERRQ(ierr); 26996ce3c06aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+r, orntNew);CHKERRQ(ierr); 27006ce3c06aSMatthew G. Knepley #if 1 27016ce3c06aSMatthew G. Knepley if ((newp+r < fMaxNew) || (newp+r >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a hybrid face [%d, %d)", newp+r, fMaxNew, fEndNew); 27026ce3c06aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 27036ce3c06aSMatthew G. Knepley if ((coneNew[p] < eStartNew) || (coneNew[p] >= eMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", coneNew[p], eStartNew, eMaxNew); 27046ce3c06aSMatthew G. Knepley } 27056ce3c06aSMatthew G. Knepley for (p = 2; p < 4; ++p) { 27066ce3c06aSMatthew G. Knepley if ((coneNew[p] < eMaxNew) || (coneNew[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a hybrid edge [%d, %d)", coneNew[p], eMaxNew, eEndNew); 27076ce3c06aSMatthew G. Knepley } 27086ce3c06aSMatthew G. Knepley #endif 27096ce3c06aSMatthew G. Knepley supportNew[0] = cStartNew + (cMax - cStart)*8 + (c - cMax)*4 + GetTriSubface_Static(ornt[0], r); 27106ce3c06aSMatthew G. Knepley supportNew[1] = cStartNew + (cMax - cStart)*8 + (c - cMax)*4 + 3; 27116ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp+r, supportNew);CHKERRQ(ierr); 27126ce3c06aSMatthew G. Knepley #if 1 27136ce3c06aSMatthew G. Knepley if ((newp+r < fMaxNew) || (newp+r >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a hybrid face [%d, %d)", newp+r, fMaxNew, fEndNew); 27146ce3c06aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 27156ce3c06aSMatthew G. Knepley if ((supportNew[p] < cMaxNew) || (supportNew[p] >= cEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a hybrid cell [%d, %d)", supportNew[p], cMaxNew, cEndNew); 27166ce3c06aSMatthew G. Knepley } 27176ce3c06aSMatthew G. Knepley #endif 27186ce3c06aSMatthew G. Knepley } 27196ce3c06aSMatthew G. Knepley } 27206ce3c06aSMatthew G. Knepley /* Interior split edges have 2 vertices and the same faces as the parent */ 27216ce3c06aSMatthew G. Knepley for (e = eStart; e < eMax; ++e) { 27226ce3c06aSMatthew G. Knepley const PetscInt newv = vStartNew + (vEnd - vStart) + (e - eStart); 27236ce3c06aSMatthew G. Knepley 27246ce3c06aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 27256ce3c06aSMatthew G. Knepley const PetscInt newp = eStartNew + (e - eStart)*2 + r; 27266ce3c06aSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 27276ce3c06aSMatthew G. Knepley PetscInt coneNew[2], coneSize, c, supportSize, s; 27286ce3c06aSMatthew G. Knepley 27296ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 27306ce3c06aSMatthew G. Knepley coneNew[0] = vStartNew + (cone[0] - vStart); 27316ce3c06aSMatthew G. Knepley coneNew[1] = vStartNew + (cone[1] - vStart); 27326ce3c06aSMatthew G. Knepley coneNew[(r+1)%2] = newv; 27336ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 27346ce3c06aSMatthew G. Knepley #if 1 27356ce3c06aSMatthew G. Knepley if ((newp < eStartNew) || (newp >= eMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", newp, eStartNew, eMaxNew); 27366ce3c06aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 27376ce3c06aSMatthew 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); 27386ce3c06aSMatthew G. Knepley } 27396ce3c06aSMatthew G. Knepley #endif 27406ce3c06aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &supportSize);CHKERRQ(ierr); 27416ce3c06aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, e, &support);CHKERRQ(ierr); 27426ce3c06aSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 27436ce3c06aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 27446ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 27456ce3c06aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 27466ce3c06aSMatthew G. Knepley for (c = 0; c < coneSize; ++c) if (cone[c] == e) break; 27476ce3c06aSMatthew G. Knepley if (support[s] < fMax) { 27486ce3c06aSMatthew G. Knepley supportRef[s] = fStartNew + (support[s] - fStart)*4 + (c + (ornt[c] < 0 ? 1-r : r))%3; 27496ce3c06aSMatthew G. Knepley } else { 27506ce3c06aSMatthew G. Knepley supportRef[s] = fStartNew + (fMax - fStart)*4 + (cMax - cStart)*8 + (support[s] - fMax)*2 + (ornt[c] < 0 ? 1-r : r); 27516ce3c06aSMatthew G. Knepley } 27526ce3c06aSMatthew G. Knepley } 27536ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 27546ce3c06aSMatthew G. Knepley #if 1 27556ce3c06aSMatthew G. Knepley if ((newp < eStartNew) || (newp >= eMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", newp, eStartNew, eMaxNew); 27566ce3c06aSMatthew G. Knepley for (p = 0; p < supportSize; ++p) { 27576ce3c06aSMatthew G. Knepley if ((supportRef[p] < fStartNew) || (supportRef[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an interior or hybrid face [%d, %d)", supportRef[p], fStartNew, fEndNew); 27586ce3c06aSMatthew G. Knepley } 27596ce3c06aSMatthew G. Knepley #endif 27606ce3c06aSMatthew G. Knepley } 27616ce3c06aSMatthew G. Knepley } 27626ce3c06aSMatthew G. Knepley /* Interior face edges have 2 vertices and 2+cells*(1/2) faces */ 27636ce3c06aSMatthew G. Knepley for (f = fStart; f < fMax; ++f) { 27646ce3c06aSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 27656ce3c06aSMatthew G. Knepley PetscInt coneSize, supportSize, s; 27666ce3c06aSMatthew G. Knepley 27676ce3c06aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 27686ce3c06aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 27696ce3c06aSMatthew G. Knepley for (r = 0; r < 3; ++r) { 27706ce3c06aSMatthew G. Knepley const PetscInt newp = eStartNew + (eMax - eStart)*2 + (f - fStart)*3 + r; 27716ce3c06aSMatthew G. Knepley PetscInt coneNew[2], intFaces = 0, er, eint[4] = {1, 0, 2, 0}; 27726ce3c06aSMatthew G. Knepley PetscInt fint[24] = { 1, 7, -1, -1, 0, 5, 27736ce3c06aSMatthew G. Knepley -1, -1, 1, 6, 0, 4, 27746ce3c06aSMatthew G. Knepley 2, 5, 3, 4, -1, -1, 27756ce3c06aSMatthew G. Knepley -1, -1, 3, 6, 2, 7}; 27766ce3c06aSMatthew G. Knepley 27776ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, f, &cone);CHKERRQ(ierr); 27786ce3c06aSMatthew G. Knepley coneNew[0] = vStartNew + (vEnd - vStart) + (cone[(r+0)%3] - eStart); 27796ce3c06aSMatthew G. Knepley coneNew[1] = vStartNew + (vEnd - vStart) + (cone[(r+1)%3] - eStart); 27806ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 27816ce3c06aSMatthew G. Knepley #if 1 27826ce3c06aSMatthew G. Knepley if ((newp < eStartNew) || (newp >= eMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", newp, eStartNew, eMaxNew); 27836ce3c06aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 27846ce3c06aSMatthew 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); 27856ce3c06aSMatthew G. Knepley } 27866ce3c06aSMatthew G. Knepley #endif 27876ce3c06aSMatthew G. Knepley supportRef[0] = fStartNew + (f - fStart)*4 + (r+1)%3; 27886ce3c06aSMatthew G. Knepley supportRef[1] = fStartNew + (f - fStart)*4 + 3; 27896ce3c06aSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 27906ce3c06aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 27916ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 27926ce3c06aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 27936ce3c06aSMatthew G. Knepley for (c = 0; c < coneSize; ++c) {if (cone[c] == f) break;} 27946ce3c06aSMatthew G. Knepley if (support[s] < cMax) { 27956ce3c06aSMatthew G. Knepley /* Here we want to determine whether edge newp contains a vertex which is part of the cross-tet edge */ 27966ce3c06aSMatthew G. Knepley er = ornt[c] < 0 ? (-(ornt[c]+1) + 2-r)%3 : (ornt[c] + r)%3; 27976ce3c06aSMatthew G. Knepley if (er == eint[c]) { 27986ce3c06aSMatthew G. Knepley supportRef[2+intFaces++] = fStartNew + (fMax - fStart)*4 + (support[s] - cStart)*8 + (c + 2)%4; 27996ce3c06aSMatthew G. Knepley } else { 28006ce3c06aSMatthew G. Knepley supportRef[2+intFaces++] = fStartNew + (fMax - fStart)*4 + (support[s] - cStart)*8 + fint[(c*3 + er)*2 + 0]; 28016ce3c06aSMatthew G. Knepley supportRef[2+intFaces++] = fStartNew + (fMax - fStart)*4 + (support[s] - cStart)*8 + fint[(c*3 + er)*2 + 1]; 28026ce3c06aSMatthew G. Knepley } 28036ce3c06aSMatthew G. Knepley } else { 28046ce3c06aSMatthew G. Knepley supportRef[2+intFaces++] = fStartNew + (fMax - fStart)*4 + (cMax - cStart)*8 + (fEnd - fMax)*2 + (support[s] - cMax)*3 + (r+1)%3; 28056ce3c06aSMatthew G. Knepley } 28066ce3c06aSMatthew G. Knepley } 28076ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 28086ce3c06aSMatthew G. Knepley #if 1 28096ce3c06aSMatthew G. Knepley if ((newp < eStartNew) || (newp >= eMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", newp, eStartNew, eMaxNew); 28106ce3c06aSMatthew G. Knepley for (p = 0; p < intFaces; ++p) { 28116ce3c06aSMatthew G. Knepley if ((supportRef[p] < fStartNew) || (supportRef[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an interior or hybrid face [%d, %d)", supportRef[p], fStartNew, fEndNew); 28126ce3c06aSMatthew G. Knepley } 28136ce3c06aSMatthew G. Knepley #endif 28146ce3c06aSMatthew G. Knepley } 28156ce3c06aSMatthew G. Knepley } 28166ce3c06aSMatthew G. Knepley /* Interior cell edges have 2 vertices and 4 faces */ 28176ce3c06aSMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 28186ce3c06aSMatthew G. Knepley const PetscInt newp = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (c - cStart); 28196ce3c06aSMatthew G. Knepley const PetscInt *cone, *ornt, *fcone; 28206ce3c06aSMatthew G. Knepley PetscInt coneNew[2], supportNew[4], find; 28216ce3c06aSMatthew G. Knepley 28226ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 28236ce3c06aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 28246ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[0], &fcone);CHKERRQ(ierr); 28256ce3c06aSMatthew G. Knepley find = GetTriEdge_Static(ornt[0], 0); 28266ce3c06aSMatthew G. Knepley coneNew[0] = vStartNew + (vEnd - vStart) + (fcone[find] - eStart); 28276ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[2], &fcone);CHKERRQ(ierr); 28286ce3c06aSMatthew G. Knepley find = GetTriEdge_Static(ornt[2], 1); 28296ce3c06aSMatthew G. Knepley coneNew[1] = vStartNew + (vEnd - vStart) + (fcone[find] - eStart); 28306ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 28316ce3c06aSMatthew G. Knepley #if 1 28326ce3c06aSMatthew G. Knepley if ((newp < eStartNew) || (newp >= eMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", newp, eStartNew, eMaxNew); 28336ce3c06aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 28346ce3c06aSMatthew 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); 28356ce3c06aSMatthew G. Knepley } 28366ce3c06aSMatthew G. Knepley #endif 28376ce3c06aSMatthew G. Knepley supportNew[0] = fStartNew + (fMax - fStart)*4 + (c - cStart)*8 + 4; 28386ce3c06aSMatthew G. Knepley supportNew[1] = fStartNew + (fMax - fStart)*4 + (c - cStart)*8 + 5; 28396ce3c06aSMatthew G. Knepley supportNew[2] = fStartNew + (fMax - fStart)*4 + (c - cStart)*8 + 6; 28406ce3c06aSMatthew G. Knepley supportNew[3] = fStartNew + (fMax - fStart)*4 + (c - cStart)*8 + 7; 28416ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 28426ce3c06aSMatthew G. Knepley #if 1 28436ce3c06aSMatthew G. Knepley if ((newp < eStartNew) || (newp >= eMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an edge [%d, %d)", newp, eStartNew, eMaxNew); 28446ce3c06aSMatthew G. Knepley for (p = 0; p < 4; ++p) { 28456ce3c06aSMatthew G. Knepley if ((supportNew[p] < fStartNew) || (supportNew[p] >= fMaxNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a face [%d, %d)", supportNew[p], fStartNew, fMaxNew); 28466ce3c06aSMatthew G. Knepley } 28476ce3c06aSMatthew G. Knepley #endif 28486ce3c06aSMatthew G. Knepley } 28496ce3c06aSMatthew G. Knepley /* Hybrid edges have two vertices and the same faces */ 28506ce3c06aSMatthew G. Knepley for (e = eMax; e < eEnd; ++e) { 28516ce3c06aSMatthew G. Knepley const PetscInt newp = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (cMax - cStart) + (e - eMax); 28526ce3c06aSMatthew G. Knepley const PetscInt *cone, *support, *fcone; 28536ce3c06aSMatthew G. Knepley PetscInt coneNew[2], size, fsize, s; 28546ce3c06aSMatthew G. Knepley 28556ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 28566ce3c06aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &size);CHKERRQ(ierr); 28576ce3c06aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, e, &support);CHKERRQ(ierr); 28586ce3c06aSMatthew G. Knepley coneNew[0] = vStartNew + (cone[0] - vStart); 28596ce3c06aSMatthew G. Knepley coneNew[1] = vStartNew + (cone[1] - vStart); 28606ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 28616ce3c06aSMatthew G. Knepley #if 1 28626ce3c06aSMatthew G. Knepley if ((newp < eMaxNew) || (newp >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a hybrid edge [%d, %d)", newp, eMaxNew, eEndNew); 28636ce3c06aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 28646ce3c06aSMatthew 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); 28656ce3c06aSMatthew G. Knepley } 28666ce3c06aSMatthew G. Knepley #endif 28676ce3c06aSMatthew G. Knepley for (s = 0; s < size; ++s) { 28686ce3c06aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &fsize);CHKERRQ(ierr); 28696ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &fcone);CHKERRQ(ierr); 28706ce3c06aSMatthew G. Knepley for (c = 0; c < fsize; ++c) if (fcone[c] == e) break; 28716ce3c06aSMatthew G. Knepley if ((c < 2) || (c > 3)) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Edge %d not found in cone of face %d", e, support[s]); 28726ce3c06aSMatthew G. Knepley supportRef[s] = fStartNew + (fMax - fStart)*4 + (cMax - cStart)*8 + (support[s] - fMax)*2 + c-2; 28736ce3c06aSMatthew G. Knepley } 28746ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 28756ce3c06aSMatthew G. Knepley #if 1 28766ce3c06aSMatthew G. Knepley if ((newp < eMaxNew) || (newp >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a hybrid edge [%d, %d)", newp, eMaxNew, eEndNew); 28776ce3c06aSMatthew G. Knepley for (p = 0; p < size; ++p) { 28786ce3c06aSMatthew G. Knepley if ((supportRef[p] < fMaxNew) || (supportRef[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a hybrid face [%d, %d)", supportRef[p], fMaxNew, fEndNew); 28796ce3c06aSMatthew G. Knepley } 28806ce3c06aSMatthew G. Knepley #endif 28816ce3c06aSMatthew G. Knepley } 28826ce3c06aSMatthew G. Knepley /* Hybrid face edges have 2 vertices and 2+2*cells faces */ 28836ce3c06aSMatthew G. Knepley for (f = fMax; f < fEnd; ++f) { 28846ce3c06aSMatthew G. Knepley const PetscInt newp = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (cMax - cStart) + (eEnd - eMax) + (f - fMax); 28856ce3c06aSMatthew G. Knepley const PetscInt *cone, *support, *ccone; 28866ce3c06aSMatthew G. Knepley PetscInt coneNew[2], size, csize, s; 28876ce3c06aSMatthew G. Knepley 28886ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, f, &cone);CHKERRQ(ierr); 28896ce3c06aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 28906ce3c06aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 28916ce3c06aSMatthew G. Knepley coneNew[0] = vStartNew + (vEnd - vStart) + (cone[0] - eStart); 28926ce3c06aSMatthew G. Knepley coneNew[1] = vStartNew + (vEnd - vStart) + (cone[1] - eStart); 28936ce3c06aSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 28946ce3c06aSMatthew G. Knepley #if 1 28956ce3c06aSMatthew G. Knepley if ((newp < eMaxNew) || (newp >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a hybrid edge [%d, %d)", newp, eMaxNew, eEndNew); 28966ce3c06aSMatthew G. Knepley for (p = 0; p < 2; ++p) { 28976ce3c06aSMatthew 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); 28986ce3c06aSMatthew G. Knepley } 28996ce3c06aSMatthew G. Knepley #endif 29006ce3c06aSMatthew G. Knepley supportRef[0] = fStartNew + (fMax - fStart)*4 + (cMax - cStart)*8 + (f - fMax)*2 + 0; 29016ce3c06aSMatthew G. Knepley supportRef[1] = fStartNew + (fMax - fStart)*4 + (cMax - cStart)*8 + (f - fMax)*2 + 1; 29026ce3c06aSMatthew G. Knepley for (s = 0; s < size; ++s) { 29036ce3c06aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &csize);CHKERRQ(ierr); 29046ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ccone);CHKERRQ(ierr); 29056ce3c06aSMatthew G. Knepley for (c = 0; c < csize; ++c) if (ccone[c] == f) break; 29066ce3c06aSMatthew G. Knepley if ((c < 2) || (c >= csize)) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Hybrid face %d is not in cone of hybrid cell %d", f, support[s]); 29076ce3c06aSMatthew G. Knepley supportRef[2+s*2+0] = fStartNew + (fMax - fStart)*4 + (cMax - cStart)*8 + (fEnd - fMax)*2 + (support[s] - cMax)*3 + (c-2)%3; 29086ce3c06aSMatthew G. Knepley supportRef[2+s*2+1] = fStartNew + (fMax - fStart)*4 + (cMax - cStart)*8 + (fEnd - fMax)*2 + (support[s] - cMax)*3 + (c-1)%3; 29096ce3c06aSMatthew G. Knepley } 29106ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 29116ce3c06aSMatthew G. Knepley #if 1 29126ce3c06aSMatthew G. Knepley if ((newp < eMaxNew) || (newp >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a hybrid edge [%d, %d)", newp, eMaxNew, eEndNew); 29136ce3c06aSMatthew G. Knepley for (p = 0; p < 2+size*2; ++p) { 29146ce3c06aSMatthew G. Knepley if ((supportRef[p] < fMaxNew) || (supportRef[p] >= fEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not a hybrid face [%d, %d)", supportRef[p], fMaxNew, fEndNew); 29156ce3c06aSMatthew G. Knepley } 29166ce3c06aSMatthew G. Knepley #endif 29176ce3c06aSMatthew G. Knepley } 29186ce3c06aSMatthew G. Knepley /* Interior vertices have identical supports */ 29196ce3c06aSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 29206ce3c06aSMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 29216ce3c06aSMatthew G. Knepley const PetscInt *support, *cone; 29226ce3c06aSMatthew G. Knepley PetscInt size, s; 29236ce3c06aSMatthew G. Knepley 29246ce3c06aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 29256ce3c06aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, v, &support);CHKERRQ(ierr); 29266ce3c06aSMatthew G. Knepley for (s = 0; s < size; ++s) { 29276ce3c06aSMatthew G. Knepley PetscInt r = 0; 29286ce3c06aSMatthew G. Knepley 29296ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 29306ce3c06aSMatthew G. Knepley if (cone[1] == v) r = 1; 29316ce3c06aSMatthew G. Knepley if (support[s] < eMax) supportRef[s] = eStartNew + (support[s] - eStart)*2 + r; 29326ce3c06aSMatthew G. Knepley else supportRef[s] = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (cMax - cStart) + (support[s] - eMax); 29336ce3c06aSMatthew G. Knepley } 29346ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 29356ce3c06aSMatthew G. Knepley #if 1 29366ce3c06aSMatthew 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); 29376ce3c06aSMatthew G. Knepley for (p = 0; p < size; ++p) { 29386ce3c06aSMatthew G. Knepley if ((supportRef[p] < eStartNew) || (supportRef[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an interior or hybrid edge [%d, %d)", supportRef[p], eStartNew, eEndNew); 29396ce3c06aSMatthew G. Knepley } 29406ce3c06aSMatthew G. Knepley #endif 29416ce3c06aSMatthew G. Knepley } 29426ce3c06aSMatthew G. Knepley /* Interior edge vertices have 2 + interior face*2 + hybrid face + cells*0/1 supports */ 29436ce3c06aSMatthew G. Knepley for (e = eStart; e < eMax; ++e) { 29446ce3c06aSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (e - eStart); 29456ce3c06aSMatthew G. Knepley const PetscInt *cone, *support; 29466ce3c06aSMatthew G. Knepley PetscInt *star = NULL, starSize, faceSize = 0, cellSize = 0, coneSize, size, s; 29476ce3c06aSMatthew G. Knepley 29486ce3c06aSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &size);CHKERRQ(ierr); 29496ce3c06aSMatthew G. Knepley ierr = DMPlexGetSupport(dm, e, &support);CHKERRQ(ierr); 29506ce3c06aSMatthew G. Knepley supportRef[0] = eStartNew + (e - eStart)*2 + 0; 29516ce3c06aSMatthew G. Knepley supportRef[1] = eStartNew + (e - eStart)*2 + 1; 29526ce3c06aSMatthew G. Knepley for (s = 0; s < size; ++s) { 29536ce3c06aSMatthew G. Knepley PetscInt r = 0; 29546ce3c06aSMatthew G. Knepley 29556ce3c06aSMatthew G. Knepley if (support[s] < fMax) { 29566ce3c06aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 29576ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 29586ce3c06aSMatthew G. Knepley for (r = 0; r < coneSize; ++r) {if (cone[r] == e) break;} 29596ce3c06aSMatthew G. Knepley supportRef[2+faceSize+0] = eStartNew + (eMax - eStart)*2 + (support[s] - fStart)*3 + (r+0)%3; 29606ce3c06aSMatthew G. Knepley supportRef[2+faceSize+1] = eStartNew + (eMax - eStart)*2 + (support[s] - fStart)*3 + (r+2)%3; 29616ce3c06aSMatthew G. Knepley faceSize += 2; 29626ce3c06aSMatthew G. Knepley } else { 29636ce3c06aSMatthew G. Knepley supportRef[2+faceSize+0] = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (cMax - cStart) + (eEnd - eMax) + (support[s] - fMax); 29646ce3c06aSMatthew G. Knepley ++faceSize; 29656ce3c06aSMatthew G. Knepley } 29666ce3c06aSMatthew G. Knepley } 29676ce3c06aSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, e, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 29686ce3c06aSMatthew G. Knepley for (s = 0; s < starSize*2; s += 2) { 29696ce3c06aSMatthew G. Knepley const PetscInt *cone, *ornt; 29706ce3c06aSMatthew G. Knepley PetscInt e01, e23; 29716ce3c06aSMatthew G. Knepley 29726ce3c06aSMatthew G. Knepley if ((star[s] >= cStart) && (star[s] < cMax)) { 29736ce3c06aSMatthew G. Knepley /* Check edge 0-1 */ 29746ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, star[s], &cone);CHKERRQ(ierr); 29756ce3c06aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, star[s], &ornt);CHKERRQ(ierr); 29766ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[0], &cone);CHKERRQ(ierr); 29776ce3c06aSMatthew G. Knepley e01 = cone[GetTriEdge_Static(ornt[0], 0)]; 29786ce3c06aSMatthew G. Knepley /* Check edge 2-3 */ 29796ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, star[s], &cone);CHKERRQ(ierr); 29806ce3c06aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, star[s], &ornt);CHKERRQ(ierr); 29816ce3c06aSMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[2], &cone);CHKERRQ(ierr); 29826ce3c06aSMatthew G. Knepley e23 = cone[GetTriEdge_Static(ornt[2], 1)]; 29836ce3c06aSMatthew G. Knepley if ((e01 == e) || (e23 == e)) {supportRef[2+faceSize+cellSize++] = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (star[s] - cStart);} 29846ce3c06aSMatthew G. Knepley } 29856ce3c06aSMatthew G. Knepley } 29866ce3c06aSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, e, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 29876ce3c06aSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 29886ce3c06aSMatthew G. Knepley #if 1 29896ce3c06aSMatthew 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); 29906ce3c06aSMatthew G. Knepley for (p = 0; p < 2+faceSize+cellSize; ++p) { 29916ce3c06aSMatthew G. Knepley if ((supportRef[p] < eStartNew) || (supportRef[p] >= eEndNew)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d is not an interior or hybrid edge [%d, %d)", supportRef[p], eStartNew, eEndNew); 29926ce3c06aSMatthew G. Knepley } 29936ce3c06aSMatthew G. Knepley #endif 29946ce3c06aSMatthew G. Knepley } 29956ce3c06aSMatthew G. Knepley ierr = PetscFree(supportRef);CHKERRQ(ierr); 29966ce3c06aSMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, 3, cStart, NULL, NULL, &faces);CHKERRQ(ierr); 29976ce3c06aSMatthew G. Knepley break; 29982eabf88fSMatthew G. Knepley case 6: 29992eabf88fSMatthew G. Knepley /* Hex 3D */ 30002eabf88fSMatthew G. Knepley /* 30012eabf88fSMatthew G. Knepley Bottom (viewed from top) Top 30022eabf88fSMatthew G. Knepley 1---------2---------2 7---------2---------6 30032eabf88fSMatthew G. Knepley | | | | | | 30042eabf88fSMatthew G. Knepley | B 2 C | | H 2 G | 30052eabf88fSMatthew G. Knepley | | | | | | 30062eabf88fSMatthew G. Knepley 3----3----0----1----1 3----3----0----1----1 30072eabf88fSMatthew G. Knepley | | | | | | 30082eabf88fSMatthew G. Knepley | A 0 D | | E 0 F | 30092eabf88fSMatthew G. Knepley | | | | | | 30102eabf88fSMatthew G. Knepley 0---------0---------3 4---------0---------5 30112eabf88fSMatthew G. Knepley */ 30122eabf88fSMatthew G. Knepley /* All cells have 6 faces: Bottom, Top, Front, Back, Right, Left */ 30132eabf88fSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 30142eabf88fSMatthew G. Knepley const PetscInt newp = (c - cStart)*8; 30152eabf88fSMatthew G. Knepley const PetscInt *cone, *ornt; 30162eabf88fSMatthew G. Knepley PetscInt coneNew[6], orntNew[6]; 30172eabf88fSMatthew G. Knepley 30182eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 30192eabf88fSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 30202eabf88fSMatthew G. Knepley /* A hex */ 3021e3f8b1d6SMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*4 + GetQuadSubface_Static(ornt[0], 0); 30222eabf88fSMatthew G. Knepley orntNew[0] = ornt[0]; 30232eabf88fSMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 8; /* AE */ 30242eabf88fSMatthew G. Knepley orntNew[1] = 0; 3025e3f8b1d6SMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*4 + GetQuadSubface_Static(ornt[2], 0); 30262eabf88fSMatthew G. Knepley orntNew[2] = ornt[2]; 30272eabf88fSMatthew G. Knepley coneNew[3] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 3; /* AB */ 30282eabf88fSMatthew G. Knepley orntNew[3] = 0; 30292eabf88fSMatthew G. Knepley coneNew[4] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 0; /* AD */ 30302eabf88fSMatthew G. Knepley orntNew[4] = 0; 3031e3f8b1d6SMatthew G. Knepley coneNew[5] = fStartNew + (cone[5] - fStart)*4 + GetQuadSubface_Static(ornt[5], 0); 30322eabf88fSMatthew G. Knepley orntNew[5] = ornt[5]; 30332eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+0, coneNew);CHKERRQ(ierr); 30342eabf88fSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+0, orntNew);CHKERRQ(ierr); 30352eabf88fSMatthew G. Knepley #if 1 30362eabf88fSMatthew 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); 30372eabf88fSMatthew G. Knepley for (p = 0; p < 6; ++p) { 30382eabf88fSMatthew 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); 30392eabf88fSMatthew G. Knepley } 30402eabf88fSMatthew G. Knepley #endif 30412eabf88fSMatthew G. Knepley /* B hex */ 3042e3f8b1d6SMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*4 + GetQuadSubface_Static(ornt[0], 1); 30432eabf88fSMatthew G. Knepley orntNew[0] = ornt[0]; 30442eabf88fSMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 11; /* BH */ 30452eabf88fSMatthew G. Knepley orntNew[1] = 0; 30462eabf88fSMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 3; /* AB */ 30472eabf88fSMatthew G. Knepley orntNew[2] = -3; 3048e3f8b1d6SMatthew G. Knepley coneNew[3] = fStartNew + (cone[3] - fStart)*4 + GetQuadSubface_Static(ornt[3], 1); 30492eabf88fSMatthew G. Knepley orntNew[3] = ornt[3]; 30502eabf88fSMatthew G. Knepley coneNew[4] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 2; /* BC */ 30512eabf88fSMatthew G. Knepley orntNew[4] = 0; 3052e3f8b1d6SMatthew G. Knepley coneNew[5] = fStartNew + (cone[5] - fStart)*4 + GetQuadSubface_Static(ornt[5], 3); 30532eabf88fSMatthew G. Knepley orntNew[5] = ornt[5]; 30542eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+1, coneNew);CHKERRQ(ierr); 30552eabf88fSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+1, orntNew);CHKERRQ(ierr); 30562eabf88fSMatthew G. Knepley #if 1 30572eabf88fSMatthew 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); 30582eabf88fSMatthew G. Knepley for (p = 0; p < 6; ++p) { 30592eabf88fSMatthew 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); 30602eabf88fSMatthew G. Knepley } 30612eabf88fSMatthew G. Knepley #endif 30622eabf88fSMatthew G. Knepley /* C hex */ 3063e3f8b1d6SMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*4 + GetQuadSubface_Static(ornt[0], 2); 30642eabf88fSMatthew G. Knepley orntNew[0] = ornt[0]; 30652eabf88fSMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 10; /* CG */ 30662eabf88fSMatthew G. Knepley orntNew[1] = 0; 30672eabf88fSMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 1; /* CD */ 30682eabf88fSMatthew G. Knepley orntNew[2] = 0; 3069e3f8b1d6SMatthew G. Knepley coneNew[3] = fStartNew + (cone[3] - fStart)*4 + GetQuadSubface_Static(ornt[3], 0); 30702eabf88fSMatthew G. Knepley orntNew[3] = ornt[3]; 3071e3f8b1d6SMatthew G. Knepley coneNew[4] = fStartNew + (cone[4] - fStart)*4 + GetQuadSubface_Static(ornt[4], 1); 30722eabf88fSMatthew G. Knepley orntNew[4] = ornt[4]; 30732eabf88fSMatthew G. Knepley coneNew[5] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 2; /* BC */ 30742eabf88fSMatthew G. Knepley orntNew[5] = -3; 30752eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+2, coneNew);CHKERRQ(ierr); 30762eabf88fSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+2, orntNew);CHKERRQ(ierr); 30772eabf88fSMatthew G. Knepley #if 1 30782eabf88fSMatthew 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); 30792eabf88fSMatthew G. Knepley for (p = 0; p < 6; ++p) { 30802eabf88fSMatthew 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); 30812eabf88fSMatthew G. Knepley } 30822eabf88fSMatthew G. Knepley #endif 30832eabf88fSMatthew G. Knepley /* D hex */ 3084e3f8b1d6SMatthew G. Knepley coneNew[0] = fStartNew + (cone[0] - fStart)*4 + GetQuadSubface_Static(ornt[0], 3); 30852eabf88fSMatthew G. Knepley orntNew[0] = ornt[0]; 30862eabf88fSMatthew G. Knepley coneNew[1] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 9; /* DF */ 30872eabf88fSMatthew G. Knepley orntNew[1] = 0; 3088e3f8b1d6SMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*4 + GetQuadSubface_Static(ornt[2], 1); 30892eabf88fSMatthew G. Knepley orntNew[2] = ornt[2]; 30902eabf88fSMatthew G. Knepley coneNew[3] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 1; /* CD */ 30912eabf88fSMatthew G. Knepley orntNew[3] = -3; 3092e3f8b1d6SMatthew G. Knepley coneNew[4] = fStartNew + (cone[4] - fStart)*4 + GetQuadSubface_Static(ornt[4], 0); 30932eabf88fSMatthew G. Knepley orntNew[4] = ornt[4]; 30942eabf88fSMatthew G. Knepley coneNew[5] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 0; /* AD */ 30952eabf88fSMatthew G. Knepley orntNew[5] = -3; 30962eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+3, coneNew);CHKERRQ(ierr); 30972eabf88fSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+3, orntNew);CHKERRQ(ierr); 30982eabf88fSMatthew G. Knepley #if 1 30992eabf88fSMatthew 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); 31002eabf88fSMatthew G. Knepley for (p = 0; p < 6; ++p) { 31012eabf88fSMatthew 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); 31022eabf88fSMatthew G. Knepley } 31032eabf88fSMatthew G. Knepley #endif 31042eabf88fSMatthew G. Knepley /* E hex */ 31052eabf88fSMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 8; /* AE */ 31062eabf88fSMatthew G. Knepley orntNew[0] = -3; 3107e3f8b1d6SMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*4 + GetQuadSubface_Static(ornt[1], 0); 31082eabf88fSMatthew G. Knepley orntNew[1] = ornt[1]; 3109e3f8b1d6SMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*4 + GetQuadSubface_Static(ornt[2], 3); 31102eabf88fSMatthew G. Knepley orntNew[2] = ornt[2]; 31112eabf88fSMatthew G. Knepley coneNew[3] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 7; /* EH */ 31122eabf88fSMatthew G. Knepley orntNew[3] = 0; 31132eabf88fSMatthew G. Knepley coneNew[4] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 4; /* EF */ 31142eabf88fSMatthew G. Knepley orntNew[4] = 0; 3115e3f8b1d6SMatthew G. Knepley coneNew[5] = fStartNew + (cone[5] - fStart)*4 + GetQuadSubface_Static(ornt[5], 1); 31162eabf88fSMatthew G. Knepley orntNew[5] = ornt[5]; 3117b164cbf2SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+4, coneNew);CHKERRQ(ierr); 3118b164cbf2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+4, orntNew);CHKERRQ(ierr); 31192eabf88fSMatthew G. Knepley #if 1 3120b164cbf2SMatthew 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); 31212eabf88fSMatthew G. Knepley for (p = 0; p < 6; ++p) { 31222eabf88fSMatthew 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); 31232eabf88fSMatthew G. Knepley } 31242eabf88fSMatthew G. Knepley #endif 31252eabf88fSMatthew G. Knepley /* F hex */ 31262eabf88fSMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 9; /* DF */ 31272eabf88fSMatthew G. Knepley orntNew[0] = -3; 3128e3f8b1d6SMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*4 + GetQuadSubface_Static(ornt[1], 1); 31292eabf88fSMatthew G. Knepley orntNew[1] = ornt[1]; 3130e3f8b1d6SMatthew G. Knepley coneNew[2] = fStartNew + (cone[2] - fStart)*4 + GetQuadSubface_Static(ornt[2], 2); 31312eabf88fSMatthew G. Knepley orntNew[2] = ornt[2]; 31322eabf88fSMatthew G. Knepley coneNew[3] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 5; /* FG */ 31332eabf88fSMatthew G. Knepley orntNew[3] = 0; 3134e3f8b1d6SMatthew G. Knepley coneNew[4] = fStartNew + (cone[4] - fStart)*4 + GetQuadSubface_Static(ornt[4], 3); 31352eabf88fSMatthew G. Knepley orntNew[4] = ornt[4]; 31362eabf88fSMatthew G. Knepley coneNew[5] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 4; /* EF */ 31372eabf88fSMatthew G. Knepley orntNew[5] = -3; 3138b164cbf2SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+5, coneNew);CHKERRQ(ierr); 3139b164cbf2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+5, orntNew);CHKERRQ(ierr); 31402eabf88fSMatthew G. Knepley #if 1 3141b164cbf2SMatthew 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); 31422eabf88fSMatthew G. Knepley for (p = 0; p < 6; ++p) { 31432eabf88fSMatthew 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); 31442eabf88fSMatthew G. Knepley } 31452eabf88fSMatthew G. Knepley #endif 31462eabf88fSMatthew G. Knepley /* G hex */ 31472eabf88fSMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 10; /* CG */ 31482eabf88fSMatthew G. Knepley orntNew[0] = -3; 3149e3f8b1d6SMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*4 + GetQuadSubface_Static(ornt[1], 2); 31502eabf88fSMatthew G. Knepley orntNew[1] = ornt[1]; 31512eabf88fSMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 5; /* FG */ 31522eabf88fSMatthew G. Knepley orntNew[2] = -3; 3153e3f8b1d6SMatthew G. Knepley coneNew[3] = fStartNew + (cone[3] - fStart)*4 + GetQuadSubface_Static(ornt[3], 3); 31542eabf88fSMatthew G. Knepley orntNew[3] = ornt[3]; 3155e3f8b1d6SMatthew G. Knepley coneNew[4] = fStartNew + (cone[4] - fStart)*4 + GetQuadSubface_Static(ornt[4], 2); 31562eabf88fSMatthew G. Knepley orntNew[4] = ornt[4]; 31572eabf88fSMatthew G. Knepley coneNew[5] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 6; /* GH */ 31582eabf88fSMatthew G. Knepley orntNew[5] = 0; 3159b164cbf2SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+6, coneNew);CHKERRQ(ierr); 3160b164cbf2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+6, orntNew);CHKERRQ(ierr); 31612eabf88fSMatthew G. Knepley #if 1 3162b164cbf2SMatthew 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); 31632eabf88fSMatthew G. Knepley for (p = 0; p < 6; ++p) { 31642eabf88fSMatthew 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); 31652eabf88fSMatthew G. Knepley } 31662eabf88fSMatthew G. Knepley #endif 31672eabf88fSMatthew G. Knepley /* H hex */ 31682eabf88fSMatthew G. Knepley coneNew[0] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 11; /* BH */ 31692eabf88fSMatthew G. Knepley orntNew[0] = -3; 3170e3f8b1d6SMatthew G. Knepley coneNew[1] = fStartNew + (cone[1] - fStart)*4 + GetQuadSubface_Static(ornt[1], 3); 31712eabf88fSMatthew G. Knepley orntNew[1] = ornt[1]; 31722eabf88fSMatthew G. Knepley coneNew[2] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 7; /* EH */ 31732eabf88fSMatthew G. Knepley orntNew[2] = -3; 3174e3f8b1d6SMatthew G. Knepley coneNew[3] = fStartNew + (cone[3] - fStart)*4 + GetQuadSubface_Static(ornt[3], 2); 31752eabf88fSMatthew G. Knepley orntNew[3] = ornt[3]; 31762eabf88fSMatthew G. Knepley coneNew[4] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 6; /* GH */ 31772eabf88fSMatthew G. Knepley orntNew[4] = -3; 3178e3f8b1d6SMatthew G. Knepley coneNew[5] = fStartNew + (cone[5] - fStart)*4 + GetQuadSubface_Static(ornt[5], 2); 31792eabf88fSMatthew G. Knepley orntNew[5] = ornt[5]; 3180b164cbf2SMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp+7, coneNew);CHKERRQ(ierr); 3181b164cbf2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp+7, orntNew);CHKERRQ(ierr); 31822eabf88fSMatthew G. Knepley #if 1 3183b164cbf2SMatthew 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); 31842eabf88fSMatthew G. Knepley for (p = 0; p < 6; ++p) { 31852eabf88fSMatthew 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); 31862eabf88fSMatthew G. Knepley } 31872eabf88fSMatthew G. Knepley #endif 31882eabf88fSMatthew G. Knepley } 31892eabf88fSMatthew G. Knepley /* Split faces have 4 edges and the same cells as the parent */ 31902eabf88fSMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, NULL, &maxSupportSize);CHKERRQ(ierr); 31912eabf88fSMatthew G. Knepley ierr = PetscMalloc((4 + maxSupportSize*2) * sizeof(PetscInt), &supportRef);CHKERRQ(ierr); 31922eabf88fSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 31932eabf88fSMatthew G. Knepley for (r = 0; r < 4; ++r) { 3194aaebbb9dSMatthew G. Knepley /* TODO: This can come from GetFaces_Internal() */ 31952eabf88fSMatthew 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}; 31962eabf88fSMatthew G. Knepley const PetscInt newp = fStartNew + (f - fStart)*4 + r; 31972eabf88fSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 3198aaebbb9dSMatthew G. Knepley PetscInt coneNew[4], orntNew[4], coneSize, c, supportSize, s; 31992eabf88fSMatthew G. Knepley 32002eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, f, &cone);CHKERRQ(ierr); 3201aaebbb9dSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, f, &ornt);CHKERRQ(ierr); 3202aaebbb9dSMatthew G. Knepley coneNew[0] = eStartNew + (cone[(r+3)%4] - eStart)*2 + (ornt[(r+3)%4] < 0 ? 0 : 1); 3203aaebbb9dSMatthew G. Knepley orntNew[0] = ornt[(r+3)%4]; 3204aaebbb9dSMatthew G. Knepley coneNew[1] = eStartNew + (cone[r] - eStart)*2 + (ornt[r] < 0 ? 1 : 0); 3205aaebbb9dSMatthew G. Knepley orntNew[1] = ornt[r]; 32062eabf88fSMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (f - fStart)*4 + r; 3207aaebbb9dSMatthew G. Knepley orntNew[2] = 0; 32082eabf88fSMatthew G. Knepley coneNew[3] = eStartNew + (eEnd - eStart)*2 + (f - fStart)*4 + (r+3)%4; 3209aaebbb9dSMatthew G. Knepley orntNew[3] = -2; 32102eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 3211aaebbb9dSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 32122eabf88fSMatthew G. Knepley #if 1 32132eabf88fSMatthew 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); 32142eabf88fSMatthew G. Knepley for (p = 0; p < 4; ++p) { 32152eabf88fSMatthew 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); 32162eabf88fSMatthew G. Knepley } 32172eabf88fSMatthew G. Knepley #endif 32182eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 32192eabf88fSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 32202eabf88fSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 32212eabf88fSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 32222eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 32232eabf88fSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 32242eabf88fSMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 32252eabf88fSMatthew G. Knepley if (cone[c] == f) break; 32262eabf88fSMatthew G. Knepley } 3227a3f78057SMatthew G. Knepley supportRef[s] = cStartNew + (support[s] - cStart)*8 + newCells[c*4+GetQuadSubface_Static(ornt[c], r)]; 32282eabf88fSMatthew G. Knepley } 32292eabf88fSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 32302eabf88fSMatthew G. Knepley #if 1 32312eabf88fSMatthew 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); 32322eabf88fSMatthew G. Knepley for (p = 0; p < supportSize; ++p) { 32332eabf88fSMatthew 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); 32342eabf88fSMatthew G. Knepley } 32352eabf88fSMatthew G. Knepley #endif 32362eabf88fSMatthew G. Knepley } 32372eabf88fSMatthew G. Knepley } 32382eabf88fSMatthew G. Knepley /* Interior faces have 4 edges and 2 cells */ 32392eabf88fSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 32402eabf88fSMatthew 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}; 3241afb2665bSMatthew G. Knepley const PetscInt *cone, *ornt; 3242afb2665bSMatthew G. Knepley PetscInt newp, coneNew[4], orntNew[4], supportNew[2]; 32432eabf88fSMatthew G. Knepley 32442eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 3245afb2665bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 3246afb2665bSMatthew G. Knepley /* A-D face */ 3247afb2665bSMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 0; 3248afb2665bSMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[2] - fStart)*4 + GetQuadEdge_Static(ornt[2], 0); 3249afb2665bSMatthew G. Knepley orntNew[0] = -2; 3250afb2665bSMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[0] - fStart)*4 + GetQuadEdge_Static(ornt[0], 3); 3251afb2665bSMatthew G. Knepley orntNew[1] = 0; 3252afb2665bSMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 0; 3253afb2665bSMatthew G. Knepley orntNew[2] = 0; 3254afb2665bSMatthew G. Knepley coneNew[3] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 2; 3255afb2665bSMatthew G. Knepley orntNew[3] = -2; 32562eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 3257afb2665bSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 32582eabf88fSMatthew G. Knepley #if 1 32592eabf88fSMatthew 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); 32602eabf88fSMatthew G. Knepley for (p = 0; p < 4; ++p) { 32612eabf88fSMatthew 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); 32622eabf88fSMatthew G. Knepley } 32632eabf88fSMatthew G. Knepley #endif 3264afb2665bSMatthew G. Knepley /* C-D face */ 3265afb2665bSMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 1; 3266afb2665bSMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[4] - fStart)*4 + GetQuadEdge_Static(ornt[4], 0); 3267afb2665bSMatthew G. Knepley orntNew[0] = -2; 3268afb2665bSMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[0] - fStart)*4 + GetQuadEdge_Static(ornt[0], 2); 3269afb2665bSMatthew G. Knepley orntNew[1] = 0; 3270afb2665bSMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 0; 3271afb2665bSMatthew G. Knepley orntNew[2] = 0; 3272afb2665bSMatthew G. Knepley coneNew[3] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 4; 3273afb2665bSMatthew G. Knepley orntNew[3] = -2; 3274afb2665bSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 3275afb2665bSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 3276afb2665bSMatthew G. Knepley #if 1 3277afb2665bSMatthew 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); 3278afb2665bSMatthew G. Knepley for (p = 0; p < 4; ++p) { 3279afb2665bSMatthew 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); 3280afb2665bSMatthew G. Knepley } 3281afb2665bSMatthew G. Knepley #endif 3282afb2665bSMatthew G. Knepley /* B-C face */ 3283afb2665bSMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 2; 3284afb2665bSMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[0] - fStart)*4 + GetQuadEdge_Static(ornt[0], 1); 3285afb2665bSMatthew G. Knepley orntNew[0] = -2; 3286afb2665bSMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[3] - fStart)*4 + GetQuadEdge_Static(ornt[3], 0); 3287afb2665bSMatthew G. Knepley orntNew[1] = 0; 3288afb2665bSMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 3; 3289afb2665bSMatthew G. Knepley orntNew[2] = 0; 3290afb2665bSMatthew G. Knepley coneNew[3] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 0; 3291afb2665bSMatthew G. Knepley orntNew[3] = -2; 3292afb2665bSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 3293afb2665bSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 3294afb2665bSMatthew G. Knepley #if 1 3295afb2665bSMatthew 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); 3296afb2665bSMatthew G. Knepley for (p = 0; p < 4; ++p) { 3297afb2665bSMatthew 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); 3298afb2665bSMatthew G. Knepley } 3299afb2665bSMatthew G. Knepley #endif 3300afb2665bSMatthew G. Knepley /* A-B face */ 3301afb2665bSMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 3; 3302afb2665bSMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[0] - fStart)*4 + GetQuadEdge_Static(ornt[0], 0); 3303afb2665bSMatthew G. Knepley orntNew[0] = -2; 3304afb2665bSMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[5] - fStart)*4 + GetQuadEdge_Static(ornt[5], 3); 3305afb2665bSMatthew G. Knepley orntNew[1] = 0; 3306afb2665bSMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 5; 3307afb2665bSMatthew G. Knepley orntNew[2] = 0; 3308afb2665bSMatthew G. Knepley coneNew[3] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 0; 3309afb2665bSMatthew G. Knepley orntNew[3] = -2; 3310afb2665bSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 3311afb2665bSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 3312afb2665bSMatthew G. Knepley #if 1 3313afb2665bSMatthew 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); 3314afb2665bSMatthew G. Knepley for (p = 0; p < 4; ++p) { 3315afb2665bSMatthew 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); 3316afb2665bSMatthew G. Knepley } 3317afb2665bSMatthew G. Knepley #endif 3318afb2665bSMatthew G. Knepley /* E-F face */ 3319afb2665bSMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 4; 3320afb2665bSMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[2] - fStart)*4 + GetQuadEdge_Static(ornt[2], 2); 3321afb2665bSMatthew G. Knepley orntNew[0] = -2; 3322afb2665bSMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[1] - fStart)*4 + GetQuadEdge_Static(ornt[1], 0); 3323afb2665bSMatthew G. Knepley orntNew[1] = 0; 3324afb2665bSMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 1; 3325afb2665bSMatthew G. Knepley orntNew[2] = 0; 3326afb2665bSMatthew G. Knepley coneNew[3] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 2; 3327afb2665bSMatthew G. Knepley orntNew[3] = -2; 3328afb2665bSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 3329afb2665bSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 3330afb2665bSMatthew G. Knepley #if 1 3331afb2665bSMatthew 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); 3332afb2665bSMatthew G. Knepley for (p = 0; p < 4; ++p) { 3333afb2665bSMatthew 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); 3334afb2665bSMatthew G. Knepley } 3335afb2665bSMatthew G. Knepley #endif 3336afb2665bSMatthew G. Knepley /* F-G face */ 3337afb2665bSMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 5; 3338afb2665bSMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[4] - fStart)*4 + GetQuadEdge_Static(ornt[4], 2); 3339afb2665bSMatthew G. Knepley orntNew[0] = -2; 3340afb2665bSMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[1] - fStart)*4 + GetQuadEdge_Static(ornt[1], 1); 3341afb2665bSMatthew G. Knepley orntNew[1] = 0; 3342afb2665bSMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 1; 3343afb2665bSMatthew G. Knepley orntNew[2] = 0; 3344afb2665bSMatthew G. Knepley coneNew[3] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 4; 3345afb2665bSMatthew G. Knepley orntNew[3] = -2; 3346afb2665bSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 3347afb2665bSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 3348afb2665bSMatthew G. Knepley #if 1 3349afb2665bSMatthew 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); 3350afb2665bSMatthew G. Knepley for (p = 0; p < 4; ++p) { 3351afb2665bSMatthew 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); 3352afb2665bSMatthew G. Knepley } 3353afb2665bSMatthew G. Knepley #endif 3354afb2665bSMatthew G. Knepley /* G-H face */ 3355afb2665bSMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 6; 3356afb2665bSMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[3] - fStart)*4 + GetQuadEdge_Static(ornt[3], 2); 3357afb2665bSMatthew G. Knepley orntNew[0] = -2; 3358afb2665bSMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[1] - fStart)*4 + GetQuadEdge_Static(ornt[1], 2); 3359afb2665bSMatthew G. Knepley orntNew[1] = 0; 3360afb2665bSMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 1; 3361afb2665bSMatthew G. Knepley orntNew[2] = 0; 3362afb2665bSMatthew G. Knepley coneNew[3] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 3; 3363afb2665bSMatthew G. Knepley orntNew[3] = -2; 3364afb2665bSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 3365afb2665bSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 3366afb2665bSMatthew G. Knepley #if 1 3367afb2665bSMatthew 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); 3368afb2665bSMatthew G. Knepley for (p = 0; p < 4; ++p) { 3369afb2665bSMatthew 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); 3370afb2665bSMatthew G. Knepley } 3371afb2665bSMatthew G. Knepley #endif 3372afb2665bSMatthew G. Knepley /* E-H face */ 3373afb2665bSMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 7; 3374afb2665bSMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[5] - fStart)*4 + GetQuadEdge_Static(ornt[5], 1); 3375afb2665bSMatthew G. Knepley orntNew[0] = -2; 3376afb2665bSMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[1] - fStart)*4 + GetQuadEdge_Static(ornt[1], 3); 3377afb2665bSMatthew G. Knepley orntNew[1] = 0; 3378afb2665bSMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 1; 3379afb2665bSMatthew G. Knepley orntNew[2] = 0; 3380afb2665bSMatthew G. Knepley coneNew[3] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 5; 3381afb2665bSMatthew G. Knepley orntNew[3] = -2; 3382afb2665bSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 3383afb2665bSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 3384afb2665bSMatthew G. Knepley #if 1 3385afb2665bSMatthew 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); 3386afb2665bSMatthew G. Knepley for (p = 0; p < 4; ++p) { 3387afb2665bSMatthew 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); 3388afb2665bSMatthew G. Knepley } 3389afb2665bSMatthew G. Knepley #endif 3390afb2665bSMatthew G. Knepley /* A-E face */ 3391afb2665bSMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 8; 3392afb2665bSMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[5] - fStart)*4 + GetQuadEdge_Static(ornt[5], 0); 3393afb2665bSMatthew G. Knepley orntNew[0] = -2; 3394afb2665bSMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[2] - fStart)*4 + GetQuadEdge_Static(ornt[2], 3); 3395afb2665bSMatthew G. Knepley orntNew[1] = 0; 3396afb2665bSMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 2; 3397afb2665bSMatthew G. Knepley orntNew[2] = 0; 3398afb2665bSMatthew G. Knepley coneNew[3] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 5; 3399afb2665bSMatthew G. Knepley orntNew[3] = -2; 3400afb2665bSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 3401afb2665bSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 3402afb2665bSMatthew G. Knepley #if 1 3403afb2665bSMatthew 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); 3404afb2665bSMatthew G. Knepley for (p = 0; p < 4; ++p) { 3405afb2665bSMatthew 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); 3406afb2665bSMatthew G. Knepley } 3407afb2665bSMatthew G. Knepley #endif 3408afb2665bSMatthew G. Knepley /* D-F face */ 3409afb2665bSMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 9; 3410afb2665bSMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[2] - fStart)*4 + GetQuadEdge_Static(ornt[2], 1); 3411afb2665bSMatthew G. Knepley orntNew[0] = -2; 3412afb2665bSMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[4] - fStart)*4 + GetQuadEdge_Static(ornt[4], 3); 3413afb2665bSMatthew G. Knepley orntNew[1] = 0; 3414afb2665bSMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 4; 3415afb2665bSMatthew G. Knepley orntNew[2] = 0; 3416afb2665bSMatthew G. Knepley coneNew[3] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 2; 3417afb2665bSMatthew G. Knepley orntNew[3] = -2; 3418afb2665bSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 3419afb2665bSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 3420afb2665bSMatthew G. Knepley #if 1 3421afb2665bSMatthew 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); 3422afb2665bSMatthew G. Knepley for (p = 0; p < 4; ++p) { 3423afb2665bSMatthew 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); 3424afb2665bSMatthew G. Knepley } 3425afb2665bSMatthew G. Knepley #endif 3426afb2665bSMatthew G. Knepley /* C-G face */ 3427afb2665bSMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 10; 3428afb2665bSMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[4] - fStart)*4 + GetQuadEdge_Static(ornt[4], 1); 3429afb2665bSMatthew G. Knepley orntNew[0] = -2; 3430afb2665bSMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[3] - fStart)*4 + GetQuadEdge_Static(ornt[3], 3); 3431afb2665bSMatthew G. Knepley orntNew[1] = 0; 3432afb2665bSMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 3; 3433afb2665bSMatthew G. Knepley orntNew[2] = 0; 3434afb2665bSMatthew G. Knepley coneNew[3] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 4; 3435afb2665bSMatthew G. Knepley orntNew[3] = -2; 3436afb2665bSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 3437afb2665bSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 3438afb2665bSMatthew G. Knepley #if 1 3439afb2665bSMatthew 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); 3440afb2665bSMatthew G. Knepley for (p = 0; p < 4; ++p) { 3441afb2665bSMatthew 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); 3442afb2665bSMatthew G. Knepley } 3443afb2665bSMatthew G. Knepley #endif 3444afb2665bSMatthew G. Knepley /* B-H face */ 3445afb2665bSMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + 11; 3446afb2665bSMatthew G. Knepley coneNew[0] = eStartNew + (eEnd - eStart)*2 + (cone[3] - fStart)*4 + GetQuadEdge_Static(ornt[3], 1); 3447afb2665bSMatthew G. Knepley orntNew[0] = -2; 3448afb2665bSMatthew G. Knepley coneNew[1] = eStartNew + (eEnd - eStart)*2 + (cone[5] - fStart)*4 + GetQuadEdge_Static(ornt[5], 2); 3449afb2665bSMatthew G. Knepley orntNew[1] = 0; 3450afb2665bSMatthew G. Knepley coneNew[2] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 5; 3451afb2665bSMatthew G. Knepley orntNew[2] = 0; 3452afb2665bSMatthew G. Knepley coneNew[3] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + 3; 3453afb2665bSMatthew G. Knepley orntNew[3] = -2; 3454afb2665bSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 3455afb2665bSMatthew G. Knepley ierr = DMPlexSetConeOrientation(rdm, newp, orntNew);CHKERRQ(ierr); 3456afb2665bSMatthew G. Knepley #if 1 3457afb2665bSMatthew 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); 3458afb2665bSMatthew G. Knepley for (p = 0; p < 4; ++p) { 3459afb2665bSMatthew 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); 3460afb2665bSMatthew G. Knepley } 3461afb2665bSMatthew G. Knepley #endif 3462afb2665bSMatthew G. Knepley for (r = 0; r < 12; ++r) { 3463afb2665bSMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + r; 34642eabf88fSMatthew G. Knepley supportNew[0] = cStartNew + (c - cStart)*8 + newCells[r*2+0]; 34652eabf88fSMatthew G. Knepley supportNew[1] = cStartNew + (c - cStart)*8 + newCells[r*2+1]; 34662eabf88fSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 34672eabf88fSMatthew G. Knepley #if 1 34682eabf88fSMatthew 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); 34692eabf88fSMatthew G. Knepley for (p = 0; p < 2; ++p) { 34702eabf88fSMatthew 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); 34712eabf88fSMatthew G. Knepley } 34722eabf88fSMatthew G. Knepley #endif 34732eabf88fSMatthew G. Knepley } 34742eabf88fSMatthew G. Knepley } 34752eabf88fSMatthew G. Knepley /* Split edges have 2 vertices and the same faces as the parent */ 34762eabf88fSMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, NULL, &maxSupportSize);CHKERRQ(ierr); 34772eabf88fSMatthew G. Knepley for (e = eStart; e < eEnd; ++e) { 34782eabf88fSMatthew G. Knepley const PetscInt newv = vStartNew + (vEnd - vStart) + (e - eStart); 34792eabf88fSMatthew G. Knepley 34802eabf88fSMatthew G. Knepley for (r = 0; r < 2; ++r) { 34812eabf88fSMatthew G. Knepley const PetscInt newp = eStartNew + (e - eStart)*2 + r; 34822eabf88fSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 34832eabf88fSMatthew G. Knepley PetscInt coneNew[2], coneSize, c, supportSize, s; 34842eabf88fSMatthew G. Knepley 34852eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 34862eabf88fSMatthew G. Knepley coneNew[0] = vStartNew + (cone[0] - vStart); 34872eabf88fSMatthew G. Knepley coneNew[1] = vStartNew + (cone[1] - vStart); 34882eabf88fSMatthew G. Knepley coneNew[(r+1)%2] = newv; 34892eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 34902eabf88fSMatthew G. Knepley #if 1 34912eabf88fSMatthew 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); 34922eabf88fSMatthew G. Knepley for (p = 0; p < 2; ++p) { 34932eabf88fSMatthew 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); 34942eabf88fSMatthew G. Knepley } 34952eabf88fSMatthew G. Knepley #endif 34962eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &supportSize);CHKERRQ(ierr); 34972eabf88fSMatthew G. Knepley ierr = DMPlexGetSupport(dm, e, &support);CHKERRQ(ierr); 34982eabf88fSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 34992eabf88fSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 35002eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 35012eabf88fSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 35022eabf88fSMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 35032eabf88fSMatthew G. Knepley if (cone[c] == e) break; 35042eabf88fSMatthew G. Knepley } 35052eabf88fSMatthew G. Knepley supportRef[s] = fStartNew + (support[s] - fStart)*4 + (ornt[c] < 0 ? (c+1-r)%4 : (c+r)%4); 35062eabf88fSMatthew G. Knepley } 35072eabf88fSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 35082eabf88fSMatthew G. Knepley #if 1 35092eabf88fSMatthew 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); 35102eabf88fSMatthew G. Knepley for (p = 0; p < supportSize; ++p) { 35112eabf88fSMatthew 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); 35122eabf88fSMatthew G. Knepley } 35132eabf88fSMatthew G. Knepley #endif 35142eabf88fSMatthew G. Knepley } 35152eabf88fSMatthew G. Knepley } 35162eabf88fSMatthew G. Knepley /* Face edges have 2 vertices and 2+cells faces */ 35172eabf88fSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 35186b852384SMatthew G. Knepley const PetscInt newFaces[24] = {3, 2, 1, 0, 4, 5, 6, 7, 0, 9, 4, 8, 2, 11, 6, 10, 1, 10, 5, 9, 8, 7, 11, 3}; 35192eabf88fSMatthew G. Knepley const PetscInt newv = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (f - fStart); 35206b852384SMatthew G. Knepley const PetscInt *cone, *coneCell, *orntCell, *support; 35212eabf88fSMatthew G. Knepley PetscInt coneNew[2], coneSize, c, supportSize, s; 35222eabf88fSMatthew G. Knepley 35232eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, f, &cone);CHKERRQ(ierr); 35242eabf88fSMatthew G. Knepley for (r = 0; r < 4; ++r) { 35252eabf88fSMatthew G. Knepley const PetscInt newp = eStartNew + (eEnd - eStart)*2 + (f - fStart)*4 + r; 35262eabf88fSMatthew G. Knepley 35272eabf88fSMatthew G. Knepley coneNew[0] = vStartNew + (vEnd - vStart) + (cone[r] - eStart); 35282eabf88fSMatthew G. Knepley coneNew[1] = newv; 35292eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 35302eabf88fSMatthew G. Knepley #if 1 35312eabf88fSMatthew 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); 35322eabf88fSMatthew G. Knepley for (p = 0; p < 2; ++p) { 35332eabf88fSMatthew 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); 35342eabf88fSMatthew G. Knepley } 35352eabf88fSMatthew G. Knepley #endif 35362eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 35372eabf88fSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 35382eabf88fSMatthew G. Knepley supportRef[0] = fStartNew + (f - fStart)*4 + r; 35392eabf88fSMatthew G. Knepley supportRef[1] = fStartNew + (f - fStart)*4 + (r+1)%4; 35402eabf88fSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 35416b852384SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 35426b852384SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &coneCell);CHKERRQ(ierr); 35436b852384SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &orntCell);CHKERRQ(ierr); 35442eabf88fSMatthew G. Knepley for (c = 0; c < coneSize; ++c) if (coneCell[c] == f) break; 35456b852384SMatthew G. Knepley supportRef[2+s] = fStartNew + (fEnd - fStart)*4 + (support[s] - cStart)*12 + newFaces[c*4 + GetQuadEdge_Static(orntCell[c], r)]; 35462eabf88fSMatthew G. Knepley } 35472eabf88fSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 35482eabf88fSMatthew G. Knepley #if 1 35492eabf88fSMatthew 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); 35502eabf88fSMatthew G. Knepley for (p = 0; p < 2+supportSize; ++p) { 35512eabf88fSMatthew 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); 35522eabf88fSMatthew G. Knepley } 35532eabf88fSMatthew G. Knepley #endif 35542eabf88fSMatthew G. Knepley } 35552eabf88fSMatthew G. Knepley } 35562eabf88fSMatthew G. Knepley /* Cell edges have 2 vertices and 4 faces */ 35572eabf88fSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 35582eabf88fSMatthew 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}; 35592eabf88fSMatthew G. Knepley const PetscInt newv = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (fEnd - fStart) + (c - cStart); 35602eabf88fSMatthew G. Knepley const PetscInt *cone; 35612eabf88fSMatthew G. Knepley PetscInt coneNew[2], supportNew[4]; 35622eabf88fSMatthew G. Knepley 35632eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 35642eabf88fSMatthew G. Knepley for (r = 0; r < 6; ++r) { 35652eabf88fSMatthew G. Knepley const PetscInt newp = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + r; 35662eabf88fSMatthew G. Knepley 35672eabf88fSMatthew G. Knepley coneNew[0] = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (cone[r] - fStart); 35682eabf88fSMatthew G. Knepley coneNew[1] = newv; 35692eabf88fSMatthew G. Knepley ierr = DMPlexSetCone(rdm, newp, coneNew);CHKERRQ(ierr); 35702eabf88fSMatthew G. Knepley #if 1 35712eabf88fSMatthew 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); 35722eabf88fSMatthew G. Knepley for (p = 0; p < 2; ++p) { 35732eabf88fSMatthew 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); 35742eabf88fSMatthew G. Knepley } 35752eabf88fSMatthew G. Knepley #endif 35762eabf88fSMatthew G. Knepley for (f = 0; f < 4; ++f) supportNew[f] = fStartNew + (fEnd - fStart)*4 + (c - cStart)*12 + newFaces[r*4+f]; 35772eabf88fSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 35782eabf88fSMatthew G. Knepley #if 1 35792eabf88fSMatthew 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); 35802eabf88fSMatthew G. Knepley for (p = 0; p < 4; ++p) { 35812eabf88fSMatthew 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); 35822eabf88fSMatthew G. Knepley } 35832eabf88fSMatthew G. Knepley #endif 35842eabf88fSMatthew G. Knepley } 35852eabf88fSMatthew G. Knepley } 35862eabf88fSMatthew G. Knepley /* Old vertices have identical supports */ 35872eabf88fSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 35882eabf88fSMatthew G. Knepley const PetscInt newp = vStartNew + (v - vStart); 35892eabf88fSMatthew G. Knepley const PetscInt *support, *cone; 35902eabf88fSMatthew G. Knepley PetscInt size, s; 35912eabf88fSMatthew G. Knepley 35922eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, v, &size);CHKERRQ(ierr); 35932eabf88fSMatthew G. Knepley ierr = DMPlexGetSupport(dm, v, &support);CHKERRQ(ierr); 35942eabf88fSMatthew G. Knepley for (s = 0; s < size; ++s) { 35952eabf88fSMatthew G. Knepley PetscInt r = 0; 35962eabf88fSMatthew G. Knepley 35972eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 35982eabf88fSMatthew G. Knepley if (cone[1] == v) r = 1; 35992eabf88fSMatthew G. Knepley supportRef[s] = eStartNew + (support[s] - eStart)*2 + r; 36002eabf88fSMatthew G. Knepley } 36012eabf88fSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 36022eabf88fSMatthew G. Knepley #if 1 36032eabf88fSMatthew 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); 36042eabf88fSMatthew G. Knepley for (p = 0; p < size; ++p) { 36052eabf88fSMatthew 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); 36062eabf88fSMatthew G. Knepley } 36072eabf88fSMatthew G. Knepley #endif 36082eabf88fSMatthew G. Knepley } 36092eabf88fSMatthew G. Knepley /* Edge vertices have 2 + faces supports */ 36102eabf88fSMatthew G. Knepley for (e = eStart; e < eEnd; ++e) { 36112eabf88fSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (e - eStart); 36122eabf88fSMatthew G. Knepley const PetscInt *cone, *support; 36132eabf88fSMatthew G. Knepley PetscInt size, s; 36142eabf88fSMatthew G. Knepley 36152eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, e, &size);CHKERRQ(ierr); 36162eabf88fSMatthew G. Knepley ierr = DMPlexGetSupport(dm, e, &support);CHKERRQ(ierr); 36172eabf88fSMatthew G. Knepley supportRef[0] = eStartNew + (e - eStart)*2 + 0; 36182eabf88fSMatthew G. Knepley supportRef[1] = eStartNew + (e - eStart)*2 + 1; 36192eabf88fSMatthew G. Knepley for (s = 0; s < size; ++s) { 36202eabf88fSMatthew G. Knepley PetscInt r; 36212eabf88fSMatthew G. Knepley 36222eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 3623a660e16cSMatthew G. Knepley for (r = 0; r < 4; ++r) if (cone[r] == e) break; 36242eabf88fSMatthew G. Knepley supportRef[2+s] = eStartNew + (eEnd - eStart)*2 + (support[s] - fStart)*4 + r; 36252eabf88fSMatthew G. Knepley } 36262eabf88fSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 36272eabf88fSMatthew G. Knepley #if 1 36282eabf88fSMatthew 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); 36292eabf88fSMatthew G. Knepley for (p = 0; p < 2+size; ++p) { 36302eabf88fSMatthew 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); 36312eabf88fSMatthew G. Knepley } 36322eabf88fSMatthew G. Knepley #endif 36332eabf88fSMatthew G. Knepley } 36342eabf88fSMatthew G. Knepley /* Face vertices have 4 + cells supports */ 36352eabf88fSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 36362eabf88fSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (f - fStart); 36372eabf88fSMatthew G. Knepley const PetscInt *cone, *support; 36382eabf88fSMatthew G. Knepley PetscInt size, s; 36392eabf88fSMatthew G. Knepley 36402eabf88fSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &size);CHKERRQ(ierr); 36412eabf88fSMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 36422eabf88fSMatthew G. Knepley for (r = 0; r < 4; ++r) supportRef[r] = eStartNew + (e - eStart)*2 + (f - fStart)*4 + r; 36432eabf88fSMatthew G. Knepley for (s = 0; s < size; ++s) { 36442eabf88fSMatthew G. Knepley PetscInt r; 36452eabf88fSMatthew G. Knepley 36462eabf88fSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 36472eabf88fSMatthew G. Knepley for (r = 0; r < 6; ++r) if (cone[r] == f) break; 36482eabf88fSMatthew G. Knepley supportRef[4+s] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (support[s] - cStart)*6 + r; 36492eabf88fSMatthew G. Knepley } 36502eabf88fSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportRef);CHKERRQ(ierr); 36512eabf88fSMatthew G. Knepley #if 1 36522eabf88fSMatthew 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); 36532eabf88fSMatthew G. Knepley for (p = 0; p < 4+size; ++p) { 36542eabf88fSMatthew 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); 36552eabf88fSMatthew G. Knepley } 36562eabf88fSMatthew G. Knepley #endif 36572eabf88fSMatthew G. Knepley } 36582eabf88fSMatthew G. Knepley /* Cell vertices have 6 supports */ 36592eabf88fSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 36602eabf88fSMatthew G. Knepley const PetscInt newp = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (fEnd - fStart) + (c - cStart); 36612eabf88fSMatthew G. Knepley PetscInt supportNew[6]; 36622eabf88fSMatthew G. Knepley 36632eabf88fSMatthew G. Knepley for (r = 0; r < 6; ++r) { 36642eabf88fSMatthew G. Knepley supportNew[r] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (c - cStart)*6 + r; 36652eabf88fSMatthew G. Knepley } 36662eabf88fSMatthew G. Knepley ierr = DMPlexSetSupport(rdm, newp, supportNew);CHKERRQ(ierr); 36672eabf88fSMatthew G. Knepley } 3668da00770fSMatthew G. Knepley ierr = PetscFree(supportRef);CHKERRQ(ierr); 36692eabf88fSMatthew G. Knepley break; 367075d3a19aSMatthew G. Knepley default: 367175d3a19aSMatthew G. Knepley SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Unknown cell refiner %d", refiner); 367275d3a19aSMatthew G. Knepley } 367375d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 367475d3a19aSMatthew G. Knepley } 367575d3a19aSMatthew G. Knepley 367675d3a19aSMatthew G. Knepley #undef __FUNCT__ 367775d3a19aSMatthew G. Knepley #define __FUNCT__ "CellRefinerSetCoordinates" 367875d3a19aSMatthew G. Knepley PetscErrorCode CellRefinerSetCoordinates(CellRefiner refiner, DM dm, PetscInt depthSize[], DM rdm) 367975d3a19aSMatthew G. Knepley { 368075d3a19aSMatthew G. Knepley PetscSection coordSection, coordSectionNew; 368175d3a19aSMatthew G. Knepley Vec coordinates, coordinatesNew; 368275d3a19aSMatthew G. Knepley PetscScalar *coords, *coordsNew; 3683b5da9499SMatthew G. Knepley PetscInt dim, depth, coordSizeNew, cStart, cEnd, c, vStart, vStartNew, vEnd, v, eStart, eEnd, eMax, e, fStart, fEnd, fMax, f; 368475d3a19aSMatthew G. Knepley PetscErrorCode ierr; 368575d3a19aSMatthew G. Knepley 368675d3a19aSMatthew G. Knepley PetscFunctionBegin; 368775d3a19aSMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 368875d3a19aSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 368975d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3690b5da9499SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr); 369175d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 369275d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 3693b5da9499SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, NULL, &fMax, &eMax, NULL);CHKERRQ(ierr); 369475d3a19aSMatthew G. Knepley ierr = GetDepthStart_Private(depth, depthSize, NULL, NULL, NULL, &vStartNew);CHKERRQ(ierr); 369575d3a19aSMatthew G. Knepley ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 369675d3a19aSMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &coordSectionNew);CHKERRQ(ierr); 369775d3a19aSMatthew G. Knepley ierr = PetscSectionSetNumFields(coordSectionNew, 1);CHKERRQ(ierr); 369875d3a19aSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(coordSectionNew, 0, dim);CHKERRQ(ierr); 369975d3a19aSMatthew G. Knepley ierr = PetscSectionSetChart(coordSectionNew, vStartNew, vStartNew+depthSize[0]);CHKERRQ(ierr); 370075d3a19aSMatthew G. Knepley if (fMax < 0) fMax = fEnd; 3701b5da9499SMatthew G. Knepley if (eMax < 0) eMax = eEnd; 370275d3a19aSMatthew G. Knepley /* All vertices have the dim coordinates */ 370375d3a19aSMatthew G. Knepley for (v = vStartNew; v < vStartNew+depthSize[0]; ++v) { 370475d3a19aSMatthew G. Knepley ierr = PetscSectionSetDof(coordSectionNew, v, dim);CHKERRQ(ierr); 370575d3a19aSMatthew G. Knepley ierr = PetscSectionSetFieldDof(coordSectionNew, v, 0, dim);CHKERRQ(ierr); 370675d3a19aSMatthew G. Knepley } 370775d3a19aSMatthew G. Knepley ierr = PetscSectionSetUp(coordSectionNew);CHKERRQ(ierr); 370875d3a19aSMatthew G. Knepley ierr = DMPlexSetCoordinateSection(rdm, coordSectionNew);CHKERRQ(ierr); 370975d3a19aSMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 371075d3a19aSMatthew G. Knepley ierr = PetscSectionGetStorageSize(coordSectionNew, &coordSizeNew);CHKERRQ(ierr); 371175d3a19aSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject)dm), &coordinatesNew);CHKERRQ(ierr); 371275d3a19aSMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) coordinatesNew, "coordinates");CHKERRQ(ierr); 371375d3a19aSMatthew G. Knepley ierr = VecSetSizes(coordinatesNew, coordSizeNew, PETSC_DETERMINE);CHKERRQ(ierr); 371475d3a19aSMatthew G. Knepley ierr = VecSetFromOptions(coordinatesNew);CHKERRQ(ierr); 371575d3a19aSMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 371675d3a19aSMatthew G. Knepley ierr = VecGetArray(coordinatesNew, &coordsNew);CHKERRQ(ierr); 3717b5da9499SMatthew G. Knepley switch (refiner) { 3718b5da9499SMatthew G. Knepley case 6: /* Hex 3D */ 3719b5da9499SMatthew G. Knepley /* Face vertices have the average of corner coordinates */ 3720b5da9499SMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 3721c91acedaSMatthew G. Knepley const PetscInt newv = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (f - fStart); 3722b5da9499SMatthew G. Knepley PetscInt *cone = NULL; 3723b5da9499SMatthew G. Knepley PetscInt closureSize, coneSize = 0, off[8], offnew, p, d; 3724b5da9499SMatthew G. Knepley 3725b5da9499SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, f, PETSC_TRUE, &closureSize, &cone);CHKERRQ(ierr); 3726b5da9499SMatthew G. Knepley for (p = 0; p < closureSize*2; p += 2) { 3727b5da9499SMatthew G. Knepley const PetscInt point = cone[p]; 3728b5da9499SMatthew G. Knepley if ((point >= vStart) && (point < vEnd)) cone[coneSize++] = point; 3729b5da9499SMatthew G. Knepley } 3730b5da9499SMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 3731b5da9499SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, cone[v], &off[v]);CHKERRQ(ierr); 3732b5da9499SMatthew G. Knepley } 3733b5da9499SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSectionNew, newv, &offnew);CHKERRQ(ierr); 3734b5da9499SMatthew G. Knepley for (d = 0; d < dim; ++d) { 3735b5da9499SMatthew G. Knepley coordsNew[offnew+d] = 0.0; 3736b5da9499SMatthew G. Knepley for (v = 0; v < coneSize; ++v) coordsNew[offnew+d] += coords[off[v]+d]; 3737b5da9499SMatthew G. Knepley coordsNew[offnew+d] /= coneSize; 3738b5da9499SMatthew G. Knepley } 3739b5da9499SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, f, PETSC_TRUE, &closureSize, &cone);CHKERRQ(ierr); 3740b5da9499SMatthew G. Knepley } 3741b5da9499SMatthew G. Knepley case 2: /* Hex 2D */ 3742b5da9499SMatthew G. Knepley /* Cell vertices have the average of corner coordinates */ 3743b5da9499SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 3744c91acedaSMatthew G. Knepley const PetscInt newv = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (c - cStart) + (dim > 2 ? (fEnd - fStart) : 0); 3745b5da9499SMatthew G. Knepley PetscInt *cone = NULL; 3746b5da9499SMatthew G. Knepley PetscInt closureSize, coneSize = 0, off[8], offnew, p, d; 3747b5da9499SMatthew G. Knepley 3748b5da9499SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &cone);CHKERRQ(ierr); 3749b5da9499SMatthew G. Knepley for (p = 0; p < closureSize*2; p += 2) { 3750b5da9499SMatthew G. Knepley const PetscInt point = cone[p]; 3751b5da9499SMatthew G. Knepley if ((point >= vStart) && (point < vEnd)) cone[coneSize++] = point; 3752b5da9499SMatthew G. Knepley } 3753b5da9499SMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 3754b5da9499SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, cone[v], &off[v]);CHKERRQ(ierr); 3755b5da9499SMatthew G. Knepley } 3756b5da9499SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSectionNew, newv, &offnew);CHKERRQ(ierr); 3757b5da9499SMatthew G. Knepley for (d = 0; d < dim; ++d) { 3758b5da9499SMatthew G. Knepley coordsNew[offnew+d] = 0.0; 3759b5da9499SMatthew G. Knepley for (v = 0; v < coneSize; ++v) coordsNew[offnew+d] += coords[off[v]+d]; 3760b5da9499SMatthew G. Knepley coordsNew[offnew+d] /= coneSize; 3761b5da9499SMatthew G. Knepley } 3762b5da9499SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &cone);CHKERRQ(ierr); 3763b5da9499SMatthew G. Knepley } 3764b5da9499SMatthew G. Knepley case 1: /* Simplicial 2D */ 3765b5da9499SMatthew G. Knepley case 3: /* Hybrid Simplicial 2D */ 3766b5da9499SMatthew G. Knepley case 5: /* Simplicial 3D */ 37676ce3c06aSMatthew G. Knepley case 7: /* Hybrid Simplicial 3D */ 3768b5da9499SMatthew G. Knepley /* Edge vertices have the average of endpoint coordinates */ 3769b5da9499SMatthew G. Knepley for (e = eStart; e < eMax; ++e) { 3770b5da9499SMatthew G. Knepley const PetscInt newv = vStartNew + (vEnd - vStart) + (e - eStart); 3771b5da9499SMatthew G. Knepley const PetscInt *cone; 3772b5da9499SMatthew G. Knepley PetscInt coneSize, offA, offB, offnew, d; 3773b5da9499SMatthew G. Knepley 3774b5da9499SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr); 3775b5da9499SMatthew G. Knepley if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize); 3776b5da9499SMatthew G. Knepley ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 3777b5da9499SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr); 3778b5da9499SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr); 3779b5da9499SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSectionNew, newv, &offnew);CHKERRQ(ierr); 3780b5da9499SMatthew G. Knepley for (d = 0; d < dim; ++d) { 3781b5da9499SMatthew G. Knepley coordsNew[offnew+d] = 0.5*(coords[offA+d] + coords[offB+d]); 3782b5da9499SMatthew G. Knepley } 3783b5da9499SMatthew G. Knepley } 378475d3a19aSMatthew G. Knepley /* Old vertices have the same coordinates */ 378575d3a19aSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 378675d3a19aSMatthew G. Knepley const PetscInt newv = vStartNew + (v - vStart); 378775d3a19aSMatthew G. Knepley PetscInt off, offnew, d; 378875d3a19aSMatthew G. Knepley 378975d3a19aSMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 379075d3a19aSMatthew G. Knepley ierr = PetscSectionGetOffset(coordSectionNew, newv, &offnew);CHKERRQ(ierr); 379175d3a19aSMatthew G. Knepley for (d = 0; d < dim; ++d) { 379275d3a19aSMatthew G. Knepley coordsNew[offnew+d] = coords[off+d]; 379375d3a19aSMatthew G. Knepley } 379475d3a19aSMatthew G. Knepley } 3795b5da9499SMatthew G. Knepley break; 3796b5da9499SMatthew G. Knepley default: 3797b5da9499SMatthew G. Knepley SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Unknown cell refiner %d", refiner); 379875d3a19aSMatthew G. Knepley } 379975d3a19aSMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 380075d3a19aSMatthew G. Knepley ierr = VecRestoreArray(coordinatesNew, &coordsNew);CHKERRQ(ierr); 380175d3a19aSMatthew G. Knepley ierr = DMSetCoordinatesLocal(rdm, coordinatesNew);CHKERRQ(ierr); 380275d3a19aSMatthew G. Knepley ierr = VecDestroy(&coordinatesNew);CHKERRQ(ierr); 380375d3a19aSMatthew G. Knepley ierr = PetscSectionDestroy(&coordSectionNew);CHKERRQ(ierr); 380475d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 380575d3a19aSMatthew G. Knepley } 380675d3a19aSMatthew G. Knepley 380775d3a19aSMatthew G. Knepley #undef __FUNCT__ 380875d3a19aSMatthew G. Knepley #define __FUNCT__ "DMPlexCreateProcessSF" 380975d3a19aSMatthew G. Knepley PetscErrorCode DMPlexCreateProcessSF(DM dm, PetscSF sfPoint, IS *processRanks, PetscSF *sfProcess) 381075d3a19aSMatthew G. Knepley { 381175d3a19aSMatthew G. Knepley PetscInt numRoots, numLeaves, l; 381275d3a19aSMatthew G. Knepley const PetscInt *localPoints; 381375d3a19aSMatthew G. Knepley const PetscSFNode *remotePoints; 381475d3a19aSMatthew G. Knepley PetscInt *localPointsNew; 381575d3a19aSMatthew G. Knepley PetscSFNode *remotePointsNew; 381675d3a19aSMatthew G. Knepley PetscInt *ranks, *ranksNew; 381775d3a19aSMatthew G. Knepley PetscErrorCode ierr; 381875d3a19aSMatthew G. Knepley 381975d3a19aSMatthew G. Knepley PetscFunctionBegin; 382075d3a19aSMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 382175d3a19aSMatthew G. Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscInt), &ranks);CHKERRQ(ierr); 382275d3a19aSMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 382375d3a19aSMatthew G. Knepley ranks[l] = remotePoints[l].rank; 382475d3a19aSMatthew G. Knepley } 382575d3a19aSMatthew G. Knepley ierr = PetscSortRemoveDupsInt(&numLeaves, ranks);CHKERRQ(ierr); 382675d3a19aSMatthew G. Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscInt), &ranksNew);CHKERRQ(ierr); 382775d3a19aSMatthew G. Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscInt), &localPointsNew);CHKERRQ(ierr); 382875d3a19aSMatthew G. Knepley ierr = PetscMalloc(numLeaves * sizeof(PetscSFNode), &remotePointsNew);CHKERRQ(ierr); 382975d3a19aSMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 383075d3a19aSMatthew G. Knepley ranksNew[l] = ranks[l]; 383175d3a19aSMatthew G. Knepley localPointsNew[l] = l; 383275d3a19aSMatthew G. Knepley remotePointsNew[l].index = 0; 383375d3a19aSMatthew G. Knepley remotePointsNew[l].rank = ranksNew[l]; 383475d3a19aSMatthew G. Knepley } 383575d3a19aSMatthew G. Knepley ierr = PetscFree(ranks);CHKERRQ(ierr); 383675d3a19aSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), numLeaves, ranksNew, PETSC_OWN_POINTER, processRanks);CHKERRQ(ierr); 383775d3a19aSMatthew G. Knepley ierr = PetscSFCreate(PetscObjectComm((PetscObject)dm), sfProcess);CHKERRQ(ierr); 383875d3a19aSMatthew G. Knepley ierr = PetscSFSetFromOptions(*sfProcess);CHKERRQ(ierr); 383975d3a19aSMatthew G. Knepley ierr = PetscSFSetGraph(*sfProcess, 1, numLeaves, localPointsNew, PETSC_OWN_POINTER, remotePointsNew, PETSC_OWN_POINTER);CHKERRQ(ierr); 384075d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 384175d3a19aSMatthew G. Knepley } 384275d3a19aSMatthew G. Knepley 384375d3a19aSMatthew G. Knepley #undef __FUNCT__ 384475d3a19aSMatthew G. Knepley #define __FUNCT__ "CellRefinerCreateSF" 384575d3a19aSMatthew G. Knepley PetscErrorCode CellRefinerCreateSF(CellRefiner refiner, DM dm, PetscInt depthSize[], DM rdm) 384675d3a19aSMatthew G. Knepley { 384775d3a19aSMatthew G. Knepley PetscSF sf, sfNew, sfProcess; 384875d3a19aSMatthew G. Knepley IS processRanks; 384975d3a19aSMatthew G. Knepley MPI_Datatype depthType; 385075d3a19aSMatthew G. Knepley PetscInt numRoots, numLeaves, numLeavesNew = 0, l, m; 385175d3a19aSMatthew G. Knepley const PetscInt *localPoints, *neighbors; 385275d3a19aSMatthew G. Knepley const PetscSFNode *remotePoints; 385375d3a19aSMatthew G. Knepley PetscInt *localPointsNew; 385475d3a19aSMatthew G. Knepley PetscSFNode *remotePointsNew; 385575d3a19aSMatthew G. Knepley PetscInt *depthSizeOld, *rdepthSize, *rdepthSizeOld, *rdepthMaxOld, *rvStart, *rvStartNew, *reStart, *reStartNew, *rfStart, *rfStartNew, *rcStart, *rcStartNew; 385675d3a19aSMatthew 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; 385775d3a19aSMatthew G. Knepley PetscErrorCode ierr; 385875d3a19aSMatthew G. Knepley 385975d3a19aSMatthew G. Knepley PetscFunctionBegin; 386075d3a19aSMatthew G. Knepley ierr = DMPlexGetChart(rdm, &pStartNew, &pEndNew);CHKERRQ(ierr); 386175d3a19aSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 386275d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 386375d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr); 386475d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 386575d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 386675d3a19aSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, &fMax, &eMax, &vMax);CHKERRQ(ierr); 386775d3a19aSMatthew G. Knepley ierr = GetDepthStart_Private(depth, depthSize, &cStartNew, &fStartNew, &eStartNew, &vStartNew);CHKERRQ(ierr); 386875d3a19aSMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 386975d3a19aSMatthew G. Knepley ierr = DMGetPointSF(rdm, &sfNew);CHKERRQ(ierr); 387075d3a19aSMatthew G. Knepley /* Caculate size of new SF */ 387175d3a19aSMatthew G. Knepley ierr = PetscSFGetGraph(sf, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 387275d3a19aSMatthew G. Knepley if (numRoots < 0) PetscFunctionReturn(0); 387375d3a19aSMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 387475d3a19aSMatthew G. Knepley const PetscInt p = localPoints[l]; 387575d3a19aSMatthew G. Knepley 387675d3a19aSMatthew G. Knepley switch (refiner) { 387775d3a19aSMatthew G. Knepley case 1: 387875d3a19aSMatthew G. Knepley /* Simplicial 2D */ 387975d3a19aSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 388075d3a19aSMatthew G. Knepley /* Old vertices stay the same */ 388175d3a19aSMatthew G. Knepley ++numLeavesNew; 388275d3a19aSMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 388375d3a19aSMatthew G. Knepley /* Old faces add new faces and vertex */ 3884d963de37SMatthew G. Knepley numLeavesNew += 2 + 1; 388575d3a19aSMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 388675d3a19aSMatthew G. Knepley /* Old cells add new cells and interior faces */ 388775d3a19aSMatthew G. Knepley numLeavesNew += 4 + 3; 388875d3a19aSMatthew G. Knepley } 388975d3a19aSMatthew G. Knepley break; 389075d3a19aSMatthew G. Knepley case 2: 389175d3a19aSMatthew G. Knepley /* Hex 2D */ 389275d3a19aSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 389375d3a19aSMatthew G. Knepley /* Old vertices stay the same */ 389475d3a19aSMatthew G. Knepley ++numLeavesNew; 389575d3a19aSMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 389675d3a19aSMatthew G. Knepley /* Old faces add new faces and vertex */ 3897d963de37SMatthew G. Knepley numLeavesNew += 2 + 1; 389875d3a19aSMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 3899455d6cd4SMatthew G. Knepley /* Old cells add new cells, interior faces, and vertex */ 3900455d6cd4SMatthew G. Knepley numLeavesNew += 4 + 4 + 1; 390175d3a19aSMatthew G. Knepley } 390275d3a19aSMatthew G. Knepley break; 3903b5da9499SMatthew G. Knepley case 5: 3904b5da9499SMatthew G. Knepley /* Simplicial 3D */ 3905b5da9499SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 3906b5da9499SMatthew G. Knepley /* Old vertices stay the same */ 3907b5da9499SMatthew G. Knepley ++numLeavesNew; 3908b5da9499SMatthew G. Knepley } else if ((p >= eStart) && (p < eEnd)) { 3909b5da9499SMatthew G. Knepley /* Old edges add new edges and vertex */ 3910b5da9499SMatthew G. Knepley numLeavesNew += 2 + 1; 3911b5da9499SMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 3912b5da9499SMatthew G. Knepley /* Old faces add new faces and face edges */ 3913b5da9499SMatthew G. Knepley numLeavesNew += 4 + 3; 3914b5da9499SMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 3915b5da9499SMatthew G. Knepley /* Old cells add new cells and interior faces and edges */ 3916b5da9499SMatthew G. Knepley numLeavesNew += 8 + 8 + 1; 3917b5da9499SMatthew G. Knepley } 3918b5da9499SMatthew G. Knepley break; 39196ce3c06aSMatthew G. Knepley case 7: 39206ce3c06aSMatthew G. Knepley /* Hybrid Simplicial 3D */ 39216ce3c06aSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 39226ce3c06aSMatthew G. Knepley /* Interior vertices stay the same */ 39236ce3c06aSMatthew G. Knepley ++numLeavesNew; 39246ce3c06aSMatthew G. Knepley } else if ((p >= eStart) && (p < eMax)) { 39256ce3c06aSMatthew G. Knepley /* Interior edges add new edges and vertex */ 39266ce3c06aSMatthew G. Knepley numLeavesNew += 2 + 1; 39276ce3c06aSMatthew G. Knepley } else if ((p >= eMax) && (p < eEnd)) { 39286ce3c06aSMatthew G. Knepley /* Hybrid edges stay the same */ 39296ce3c06aSMatthew G. Knepley ++numLeavesNew; 39306ce3c06aSMatthew G. Knepley } else if ((p >= fStart) && (p < fMax)) { 39316ce3c06aSMatthew G. Knepley /* Interior faces add new faces and edges */ 39326ce3c06aSMatthew G. Knepley numLeavesNew += 4 + 3; 39336ce3c06aSMatthew G. Knepley } else if ((p >= fMax) && (p < fEnd)) { 39346ce3c06aSMatthew G. Knepley /* Hybrid faces add new faces and edges */ 39356ce3c06aSMatthew G. Knepley numLeavesNew += 2 + 1; 39366ce3c06aSMatthew G. Knepley } else if ((p >= cStart) && (p < cMax)) { 39376ce3c06aSMatthew G. Knepley /* Interior cells add new cells, faces, and edges */ 39386ce3c06aSMatthew G. Knepley numLeavesNew += 8 + 8 + 1; 39396ce3c06aSMatthew G. Knepley } else if ((p >= cMax) && (p < cEnd)) { 39406ce3c06aSMatthew G. Knepley /* Hybrid cells add new cells and faces */ 39416ce3c06aSMatthew G. Knepley numLeavesNew += 4 + 3; 39426ce3c06aSMatthew G. Knepley } 39436ce3c06aSMatthew G. Knepley break; 39442eabf88fSMatthew G. Knepley case 6: 39452eabf88fSMatthew G. Knepley /* Hex 3D */ 39462eabf88fSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 39472eabf88fSMatthew G. Knepley /* Old vertices stay the same */ 39482eabf88fSMatthew G. Knepley ++numLeavesNew; 39492eabf88fSMatthew G. Knepley } else if ((p >= eStart) && (p < eEnd)) { 39502eabf88fSMatthew G. Knepley /* Old edges add new edges, and vertex */ 39512eabf88fSMatthew G. Knepley numLeavesNew += 2 + 1; 39522eabf88fSMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 39532eabf88fSMatthew G. Knepley /* Old faces add new faces, edges, and vertex */ 39542eabf88fSMatthew G. Knepley numLeavesNew += 4 + 4 + 1; 39552eabf88fSMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 39562eabf88fSMatthew G. Knepley /* Old cells add new cells, faces, edges, and vertex */ 39572eabf88fSMatthew G. Knepley numLeavesNew += 8 + 12 + 6 + 1; 39582eabf88fSMatthew G. Knepley } 39592eabf88fSMatthew G. Knepley break; 396075d3a19aSMatthew G. Knepley default: 396175d3a19aSMatthew G. Knepley SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Unknown cell refiner %d", refiner); 396275d3a19aSMatthew G. Knepley } 396375d3a19aSMatthew G. Knepley } 396475d3a19aSMatthew G. Knepley /* Communicate depthSizes for each remote rank */ 396575d3a19aSMatthew G. Knepley ierr = DMPlexCreateProcessSF(dm, sf, &processRanks, &sfProcess);CHKERRQ(ierr); 396675d3a19aSMatthew G. Knepley ierr = ISGetLocalSize(processRanks, &numNeighbors);CHKERRQ(ierr); 396775d3a19aSMatthew G. Knepley ierr = PetscMalloc5((depth+1)*numNeighbors,PetscInt,&rdepthSize,numNeighbors,PetscInt,&rvStartNew,numNeighbors,PetscInt,&reStartNew,numNeighbors,PetscInt,&rfStartNew,numNeighbors,PetscInt,&rcStartNew);CHKERRQ(ierr); 396875d3a19aSMatthew 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); 396975d3a19aSMatthew G. Knepley ierr = MPI_Type_contiguous(depth+1, MPIU_INT, &depthType);CHKERRQ(ierr); 397075d3a19aSMatthew G. Knepley ierr = MPI_Type_commit(&depthType);CHKERRQ(ierr); 397175d3a19aSMatthew G. Knepley ierr = PetscSFBcastBegin(sfProcess, depthType, depthSize, rdepthSize);CHKERRQ(ierr); 397275d3a19aSMatthew G. Knepley ierr = PetscSFBcastEnd(sfProcess, depthType, depthSize, rdepthSize);CHKERRQ(ierr); 397375d3a19aSMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 397475d3a19aSMatthew G. Knepley ierr = GetDepthStart_Private(depth, &rdepthSize[n*(depth+1)], &rcStartNew[n], &rfStartNew[n], &reStartNew[n], &rvStartNew[n]);CHKERRQ(ierr); 397575d3a19aSMatthew G. Knepley } 397675d3a19aSMatthew G. Knepley depthSizeOld[depth] = cMax; 397775d3a19aSMatthew G. Knepley depthSizeOld[0] = vMax; 397875d3a19aSMatthew G. Knepley depthSizeOld[depth-1] = fMax; 397975d3a19aSMatthew G. Knepley depthSizeOld[1] = eMax; 398075d3a19aSMatthew G. Knepley 398175d3a19aSMatthew G. Knepley ierr = PetscSFBcastBegin(sfProcess, depthType, depthSizeOld, rdepthMaxOld);CHKERRQ(ierr); 398275d3a19aSMatthew G. Knepley ierr = PetscSFBcastEnd(sfProcess, depthType, depthSizeOld, rdepthMaxOld);CHKERRQ(ierr); 398375d3a19aSMatthew G. Knepley 398475d3a19aSMatthew G. Knepley depthSizeOld[depth] = cEnd - cStart; 398575d3a19aSMatthew G. Knepley depthSizeOld[0] = vEnd - vStart; 398675d3a19aSMatthew G. Knepley depthSizeOld[depth-1] = fEnd - fStart; 398775d3a19aSMatthew G. Knepley depthSizeOld[1] = eEnd - eStart; 398875d3a19aSMatthew G. Knepley 398975d3a19aSMatthew G. Knepley ierr = PetscSFBcastBegin(sfProcess, depthType, depthSizeOld, rdepthSizeOld);CHKERRQ(ierr); 399075d3a19aSMatthew G. Knepley ierr = PetscSFBcastEnd(sfProcess, depthType, depthSizeOld, rdepthSizeOld);CHKERRQ(ierr); 399175d3a19aSMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 399275d3a19aSMatthew G. Knepley ierr = GetDepthStart_Private(depth, &rdepthSizeOld[n*(depth+1)], &rcStart[n], &rfStart[n], &reStart[n], &rvStart[n]);CHKERRQ(ierr); 399375d3a19aSMatthew G. Knepley } 399475d3a19aSMatthew G. Knepley ierr = MPI_Type_free(&depthType);CHKERRQ(ierr); 399575d3a19aSMatthew G. Knepley ierr = PetscSFDestroy(&sfProcess);CHKERRQ(ierr); 399675d3a19aSMatthew G. Knepley /* Calculate new point SF */ 399775d3a19aSMatthew G. Knepley ierr = PetscMalloc(numLeavesNew * sizeof(PetscInt), &localPointsNew);CHKERRQ(ierr); 399875d3a19aSMatthew G. Knepley ierr = PetscMalloc(numLeavesNew * sizeof(PetscSFNode), &remotePointsNew);CHKERRQ(ierr); 399975d3a19aSMatthew G. Knepley ierr = ISGetIndices(processRanks, &neighbors);CHKERRQ(ierr); 400075d3a19aSMatthew G. Knepley for (l = 0, m = 0; l < numLeaves; ++l) { 400175d3a19aSMatthew G. Knepley PetscInt p = localPoints[l]; 400275d3a19aSMatthew G. Knepley PetscInt rp = remotePoints[l].index, n; 400375d3a19aSMatthew G. Knepley PetscMPIInt rrank = remotePoints[l].rank; 400475d3a19aSMatthew G. Knepley 400575d3a19aSMatthew G. Knepley ierr = PetscFindInt(rrank, numNeighbors, neighbors, &n);CHKERRQ(ierr); 400675d3a19aSMatthew G. Knepley if (n < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Could not locate remote rank %d", rrank); 400775d3a19aSMatthew G. Knepley switch (refiner) { 400875d3a19aSMatthew G. Knepley case 1: 400975d3a19aSMatthew G. Knepley /* Simplicial 2D */ 401075d3a19aSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 401175d3a19aSMatthew G. Knepley /* Old vertices stay the same */ 401275d3a19aSMatthew G. Knepley localPointsNew[m] = vStartNew + (p - vStart); 401375d3a19aSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + (rp - rvStart[n]); 401475d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 401575d3a19aSMatthew G. Knepley ++m; 401675d3a19aSMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 401775d3a19aSMatthew G. Knepley /* Old faces add new faces and vertex */ 401875d3a19aSMatthew G. Knepley localPointsNew[m] = vStartNew + (vEnd - vStart) + (p - fStart); 401975d3a19aSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + rdepthSizeOld[n*(depth+1)+0] + (rp - rfStart[n]); 402075d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 402175d3a19aSMatthew G. Knepley ++m; 402275d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r, ++m) { 402375d3a19aSMatthew G. Knepley localPointsNew[m] = fStartNew + (p - fStart)*2 + r; 402475d3a19aSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + (rp - rfStart[n])*2 + r; 402575d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 402675d3a19aSMatthew G. Knepley } 402775d3a19aSMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 402875d3a19aSMatthew G. Knepley /* Old cells add new cells and interior faces */ 402975d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r, ++m) { 403075d3a19aSMatthew G. Knepley localPointsNew[m] = cStartNew + (p - cStart)*4 + r; 403175d3a19aSMatthew G. Knepley remotePointsNew[m].index = rcStartNew[n] + (rp - rcStart[n])*4 + r; 403275d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 403375d3a19aSMatthew G. Knepley } 403475d3a19aSMatthew G. Knepley for (r = 0; r < 3; ++r, ++m) { 403575d3a19aSMatthew G. Knepley localPointsNew[m] = fStartNew + (fEnd - fStart)*2 + (p - cStart)*3 + r; 403675d3a19aSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + rdepthSizeOld[n*(depth+1)+depth-1]*2 + (rp - rcStart[n])*3 + r; 403775d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 403875d3a19aSMatthew G. Knepley } 403975d3a19aSMatthew G. Knepley } 404075d3a19aSMatthew G. Knepley break; 404175d3a19aSMatthew G. Knepley case 2: 404275d3a19aSMatthew G. Knepley /* Hex 2D */ 404375d3a19aSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 404475d3a19aSMatthew G. Knepley /* Old vertices stay the same */ 404575d3a19aSMatthew G. Knepley localPointsNew[m] = vStartNew + (p - vStart); 404675d3a19aSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + (rp - rvStart[n]); 404775d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 404875d3a19aSMatthew G. Knepley ++m; 404975d3a19aSMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 405075d3a19aSMatthew G. Knepley /* Old faces add new faces and vertex */ 405175d3a19aSMatthew G. Knepley localPointsNew[m] = vStartNew + (vEnd - vStart) + (p - fStart); 405275d3a19aSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + rdepthSizeOld[n*(depth+1)+0] + (rp - rfStart[n]); 405375d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 405475d3a19aSMatthew G. Knepley ++m; 405575d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r, ++m) { 405675d3a19aSMatthew G. Knepley localPointsNew[m] = fStartNew + (p - fStart)*2 + r; 405775d3a19aSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + (rp - rfStart[n])*2 + r; 405875d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 405975d3a19aSMatthew G. Knepley } 406075d3a19aSMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 4061455d6cd4SMatthew G. Knepley /* Old cells add new cells, interior faces, and vertex */ 406275d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r, ++m) { 406375d3a19aSMatthew G. Knepley localPointsNew[m] = cStartNew + (p - cStart)*4 + r; 406475d3a19aSMatthew G. Knepley remotePointsNew[m].index = rcStartNew[n] + (rp - rcStart[n])*4 + r; 406575d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 406675d3a19aSMatthew G. Knepley } 406775d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r, ++m) { 406875d3a19aSMatthew G. Knepley localPointsNew[m] = fStartNew + (fEnd - fStart)*2 + (p - cStart)*4 + r; 406975d3a19aSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + rdepthSizeOld[n*(depth+1)+depth-1]*2 + (rp - rcStart[n])*4 + r; 407075d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 407175d3a19aSMatthew G. Knepley } 4072455d6cd4SMatthew G. Knepley for (r = 0; r < 1; ++r, ++m) { 4073455d6cd4SMatthew G. Knepley localPointsNew[m] = vStartNew + (fEnd - fStart) + (p - cStart) + r; 4074455d6cd4SMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + rdepthSizeOld[n*(depth+1)+depth-1] + (rp - rcStart[n]) + r; 4075455d6cd4SMatthew G. Knepley remotePointsNew[m].rank = rrank; 4076455d6cd4SMatthew G. Knepley } 407775d3a19aSMatthew G. Knepley } 407875d3a19aSMatthew G. Knepley break; 407975d3a19aSMatthew G. Knepley case 3: 408075d3a19aSMatthew G. Knepley /* Hybrid simplicial 2D */ 408175d3a19aSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 408275d3a19aSMatthew G. Knepley /* Old vertices stay the same */ 408375d3a19aSMatthew G. Knepley localPointsNew[m] = vStartNew + (p - vStart); 408475d3a19aSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + (rp - rvStart[n]); 408575d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 408675d3a19aSMatthew G. Knepley ++m; 408775d3a19aSMatthew G. Knepley } else if ((p >= fStart) && (p < fMax)) { 408875d3a19aSMatthew G. Knepley /* Old interior faces add new faces and vertex */ 408975d3a19aSMatthew G. Knepley localPointsNew[m] = vStartNew + (vEnd - vStart) + (p - fStart); 409075d3a19aSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + rdepthSizeOld[n*(depth+1)+0] + (rp - rfStart[n]); 409175d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 409275d3a19aSMatthew G. Knepley ++m; 409375d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r, ++m) { 409475d3a19aSMatthew G. Knepley localPointsNew[m] = fStartNew + (p - fStart)*2 + r; 409575d3a19aSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + (rp - rfStart[n])*2 + r; 409675d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 409775d3a19aSMatthew G. Knepley } 409875d3a19aSMatthew G. Knepley } else if ((p >= fMax) && (p < fEnd)) { 409975d3a19aSMatthew G. Knepley /* Old hybrid faces stay the same */ 410075d3a19aSMatthew G. Knepley localPointsNew[m] = fStartNew + (fMax - fStart)*2 + (p - fMax); 410175d3a19aSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + (rdepthMaxOld[n*(depth+1)+depth-1] - rfStart[n])*2 + (rp - rdepthMaxOld[n*(depth+1)+depth-1]); 410275d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 410375d3a19aSMatthew G. Knepley ++m; 410475d3a19aSMatthew G. Knepley } else if ((p >= cStart) && (p < cMax)) { 410575d3a19aSMatthew G. Knepley /* Old interior cells add new cells and interior faces */ 410675d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r, ++m) { 410775d3a19aSMatthew G. Knepley localPointsNew[m] = cStartNew + (p - cStart)*4 + r; 410875d3a19aSMatthew G. Knepley remotePointsNew[m].index = rcStartNew[n] + (rp - rcStart[n])*4 + r; 410975d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 411075d3a19aSMatthew G. Knepley } 411175d3a19aSMatthew G. Knepley for (r = 0; r < 3; ++r, ++m) { 411275d3a19aSMatthew G. Knepley localPointsNew[m] = fStartNew + (fMax - fStart)*2 + (p - cStart)*3 + r; 411375d3a19aSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + (rdepthMaxOld[n*(depth+1)+depth-1] - rfStart[n])*2 + (rp - rcStart[n])*3 + r; 411475d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 411575d3a19aSMatthew G. Knepley } 411675d3a19aSMatthew G. Knepley } else if ((p >= cStart) && (p < cMax)) { 411775d3a19aSMatthew G. Knepley /* Old hybrid cells add new cells and hybrid face */ 411875d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r, ++m) { 411975d3a19aSMatthew G. Knepley localPointsNew[m] = cStartNew + (p - cStart)*4 + r; 412075d3a19aSMatthew G. Knepley remotePointsNew[m].index = rcStartNew[n] + (rp - rcStart[n])*4 + r; 412175d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 412275d3a19aSMatthew G. Knepley } 412375d3a19aSMatthew G. Knepley localPointsNew[m] = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (p - cMax); 412475d3a19aSMatthew 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]); 412575d3a19aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 412675d3a19aSMatthew G. Knepley ++m; 412775d3a19aSMatthew G. Knepley } 412875d3a19aSMatthew G. Knepley break; 4129b5da9499SMatthew G. Knepley case 5: 4130b5da9499SMatthew G. Knepley /* Simplicial 3D */ 4131b5da9499SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 4132b5da9499SMatthew G. Knepley /* Old vertices stay the same */ 4133b5da9499SMatthew G. Knepley localPointsNew[m] = vStartNew + (p - vStart); 4134b5da9499SMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + (rp - rvStart[n]); 4135b5da9499SMatthew G. Knepley remotePointsNew[m].rank = rrank; 4136b5da9499SMatthew G. Knepley ++m; 413787fe6628SMatthew G. Knepley } else if ((p >= eStart) && (p < eEnd)) { 4138b5da9499SMatthew G. Knepley /* Old edges add new edges and vertex */ 4139b5da9499SMatthew G. Knepley for (r = 0; r < 2; ++r, ++m) { 4140b5da9499SMatthew G. Knepley localPointsNew[m] = eStartNew + (p - eStart)*2 + r; 4141b5da9499SMatthew G. Knepley remotePointsNew[m].index = reStartNew[n] + (rp - reStart[n])*2 + r; 4142b5da9499SMatthew G. Knepley remotePointsNew[m].rank = rrank; 4143b5da9499SMatthew G. Knepley } 4144b5da9499SMatthew G. Knepley localPointsNew[m] = vStartNew + (vEnd - vStart) + (p - eStart); 4145b5da9499SMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + rdepthSizeOld[n*(depth+1)+0] + (rp - reStart[n]); 4146b5da9499SMatthew G. Knepley remotePointsNew[m].rank = rrank; 4147b5da9499SMatthew G. Knepley ++m; 4148b5da9499SMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 4149b5da9499SMatthew G. Knepley /* Old faces add new faces and face edges */ 4150b5da9499SMatthew G. Knepley for (r = 0; r < 4; ++r, ++m) { 4151b5da9499SMatthew G. Knepley localPointsNew[m] = fStartNew + (p - fStart)*4 + r; 4152b5da9499SMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + (rp - rfStart[n])*4 + r; 4153b5da9499SMatthew G. Knepley remotePointsNew[m].rank = rrank; 4154b5da9499SMatthew G. Knepley } 4155b5da9499SMatthew G. Knepley for (r = 0; r < 3; ++r, ++m) { 4156b5da9499SMatthew G. Knepley localPointsNew[m] = eStartNew + (eEnd - eStart)*2 + (p - fStart)*3 + r; 4157b5da9499SMatthew G. Knepley remotePointsNew[m].index = reStartNew[n] + rdepthSizeOld[n*(depth+1)+1]*2 + (rp - rfStart[n])*3 + r; 4158b5da9499SMatthew G. Knepley remotePointsNew[m].rank = rrank; 4159b5da9499SMatthew G. Knepley } 4160b5da9499SMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 4161b5da9499SMatthew G. Knepley /* Old cells add new cells and interior faces and edges */ 4162b5da9499SMatthew G. Knepley for (r = 0; r < 8; ++r, ++m) { 4163b5da9499SMatthew G. Knepley localPointsNew[m] = cStartNew + (p - cStart)*8 + r; 4164b5da9499SMatthew G. Knepley remotePointsNew[m].index = rcStartNew[n] + (rp - rcStart[n])*8 + r; 4165b5da9499SMatthew G. Knepley remotePointsNew[m].rank = rrank; 4166b5da9499SMatthew G. Knepley } 4167b5da9499SMatthew G. Knepley for (r = 0; r < 8; ++r, ++m) { 4168b5da9499SMatthew G. Knepley localPointsNew[m] = fStartNew + (fEnd - fStart)*4 + (p - cStart)*8 + r; 4169b5da9499SMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + rdepthSizeOld[n*(depth+1)+depth-1]*4 + (rp - rcStart[n])*8 + r; 4170b5da9499SMatthew G. Knepley remotePointsNew[m].rank = rrank; 4171b5da9499SMatthew G. Knepley } 4172b5da9499SMatthew G. Knepley for (r = 0; r < 1; ++r, ++m) { 4173b5da9499SMatthew G. Knepley localPointsNew[m] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*3 + (p - cStart)*1 + r; 4174b5da9499SMatthew 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; 4175b5da9499SMatthew G. Knepley remotePointsNew[m].rank = rrank; 4176b5da9499SMatthew G. Knepley } 4177b5da9499SMatthew G. Knepley } 4178b5da9499SMatthew G. Knepley break; 41796ce3c06aSMatthew G. Knepley case 7: 41806ce3c06aSMatthew G. Knepley /* Hybrid Simplicial 3D */ 41816ce3c06aSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 41826ce3c06aSMatthew G. Knepley /* Interior vertices stay the same */ 41836ce3c06aSMatthew G. Knepley localPointsNew[m] = vStartNew + (p - vStart); 41846ce3c06aSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + (rp - rvStart[n]); 41856ce3c06aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 41866ce3c06aSMatthew G. Knepley ++m; 41876ce3c06aSMatthew G. Knepley } else if ((p >= eStart) && (p < eMax)) { 41886ce3c06aSMatthew G. Knepley /* Interior edges add new edges and vertex */ 41896ce3c06aSMatthew G. Knepley for (r = 0; r < 2; ++r, ++m) { 41906ce3c06aSMatthew G. Knepley localPointsNew[m] = eStartNew + (p - eStart)*2 + r; 41916ce3c06aSMatthew G. Knepley remotePointsNew[m].index = reStartNew[n] + (rp - reStart[n])*2 + r; 41926ce3c06aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 41936ce3c06aSMatthew G. Knepley } 41946ce3c06aSMatthew G. Knepley localPointsNew[m] = vStartNew + (vEnd - vStart) + (p - eStart); 41956ce3c06aSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + rdepthSizeOld[n*(depth+1)+0] + (rp - reStart[n]); 41966ce3c06aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 41976ce3c06aSMatthew G. Knepley ++m; 41986ce3c06aSMatthew G. Knepley } else if ((p >= eMax) && (p < eEnd)) { 41996ce3c06aSMatthew G. Knepley /* Hybrid edges stay the same */ 42006ce3c06aSMatthew G. Knepley localPointsNew[m] = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (cMax - cStart) + (p - eMax); 42016ce3c06aSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + (rdepthMaxOld[n*(depth+1)+1] - reStart[n])*2 + (rdepthMaxOld[n*(depth+1)+depth-1] - rfStart[n])*3 + (rdepthMaxOld[n*(depth+1)+depth] - rcStart[n]) + (rp - rdepthMaxOld[n*(depth+1)+1]); 42026ce3c06aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 42036ce3c06aSMatthew G. Knepley ++m; 42046ce3c06aSMatthew G. Knepley } else if ((p >= fStart) && (p < fMax)) { 42056ce3c06aSMatthew G. Knepley /* Interior faces add new faces and edges */ 42066ce3c06aSMatthew G. Knepley for (r = 0; r < 4; ++r, ++m) { 42076ce3c06aSMatthew G. Knepley localPointsNew[m] = fStartNew + (p - fStart)*4 + r; 42086ce3c06aSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + (rp - rfStart[n])*4 + r; 42096ce3c06aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 42106ce3c06aSMatthew G. Knepley } 42116ce3c06aSMatthew G. Knepley for (r = 0; r < 3; ++r, ++m) { 42126ce3c06aSMatthew G. Knepley localPointsNew[m] = eStartNew + (eMax - eStart)*2 + (p - fStart)*3 + r; 42136ce3c06aSMatthew G. Knepley remotePointsNew[m].index = reStartNew[n] + (rdepthMaxOld[n*(depth+1)+1] - reStart[n])*2 + (rp - rfStart[n])*3 + r; 42146ce3c06aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 42156ce3c06aSMatthew G. Knepley } 42166ce3c06aSMatthew G. Knepley } else if ((p >= fMax) && (p < fEnd)) { 42176ce3c06aSMatthew G. Knepley /* Hybrid faces add new faces and edges */ 42186ce3c06aSMatthew G. Knepley for (r = 0; r < 2; ++r, ++m) { 42196ce3c06aSMatthew G. Knepley localPointsNew[m] = fStartNew + (fMax - fStart)*4 + (cMax - cStart)*8 + (p - fStart)*2 + r; 42206ce3c06aSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + (rdepthMaxOld[n*(depth+1)+depth-1] - rfStart[n])*4 + (rdepthMaxOld[n*(depth+1)+depth] - rcStart[n])*8 + (rp - rfStart[n])*2 + r; 42216ce3c06aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 42226ce3c06aSMatthew G. Knepley } 42236ce3c06aSMatthew G. Knepley localPointsNew[m] = eStartNew + (eMax - eStart)*2 + (fMax - fStart) + (cMax - cStart) + (fEnd - fMax); 42246ce3c06aSMatthew G. Knepley remotePointsNew[m].index = reStartNew[n] + (rdepthMaxOld[n*(depth+1)+1] - reStart[n])*2 + (rdepthMaxOld[n*(depth+1)+depth-1] - rfStart[n]) + (rdepthMaxOld[n*(depth+1)+depth] - rcStart[n]) + (rdepthSizeOld[n*(depth+1)+depth-1]+rfStart[n] - rdepthMaxOld[n*(depth+1)+depth-1]); 42256ce3c06aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 42266ce3c06aSMatthew G. Knepley } else if ((p >= cStart) && (p < cMax)) { 42276ce3c06aSMatthew G. Knepley /* Interior cells add new cells, faces, and edges */ 42286ce3c06aSMatthew G. Knepley for (r = 0; r < 8; ++r, ++m) { 42296ce3c06aSMatthew G. Knepley localPointsNew[m] = cStartNew + (p - cStart)*8 + r; 42306ce3c06aSMatthew G. Knepley remotePointsNew[m].index = rcStartNew[n] + (rp - rcStart[n])*8 + r; 42316ce3c06aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 42326ce3c06aSMatthew G. Knepley } 42336ce3c06aSMatthew G. Knepley for (r = 0; r < 8; ++r, ++m) { 42346ce3c06aSMatthew G. Knepley localPointsNew[m] = fStartNew + (fMax - fStart)*4 + (p - cStart)*8 + r; 42356ce3c06aSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + (rdepthMaxOld[n*(depth+1)+depth-1] - rfStart[n])*4 + (rp - rcStart[n])*8 + r; 42366ce3c06aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 42376ce3c06aSMatthew G. Knepley } 42386ce3c06aSMatthew G. Knepley localPointsNew[m] = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (p - cStart)*1 + r; 42396ce3c06aSMatthew G. Knepley remotePointsNew[m].index = reStartNew[n] + (rdepthMaxOld[n*(depth+1)+1] - reStart[n])*2 + (rdepthMaxOld[n*(depth+1)+depth-1] - rfStart[n])*3 + (rp - rcStart[n])*1 + r; 42406ce3c06aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 42416ce3c06aSMatthew G. Knepley } else if ((p >= cMax) && (p < cEnd)) { 42426ce3c06aSMatthew G. Knepley /* Hybrid cells add new cells and faces */ 42436ce3c06aSMatthew G. Knepley for (r = 0; r < 4; ++r, ++m) { 42446ce3c06aSMatthew G. Knepley localPointsNew[m] = cStartNew + (cMax - cStart)*8 + (p - cMax)*4 + r; 42456ce3c06aSMatthew G. Knepley remotePointsNew[m].index = rcStartNew[n] + (rdepthMaxOld[n*(depth+1)+depth] - rcStart[n])*8 + (rp - rdepthMaxOld[n*(depth+1)+depth])*4 + r; 42466ce3c06aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 42476ce3c06aSMatthew G. Knepley } 42486ce3c06aSMatthew G. Knepley for (r = 0; r < 3; ++r, ++m) { 42496ce3c06aSMatthew G. Knepley localPointsNew[m] = fStartNew + (fMax - fStart)*4 + (cMax - cStart)*8 + (fEnd - fMax)*4 + (p - cMax)*3 + r; 42506ce3c06aSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + (rdepthMaxOld[n*(depth+1)+depth-1] - rfStart[n])*4 + (rdepthMaxOld[n*(depth+1)+depth] - rcStart[n])*8 + (rdepthSizeOld[n*(depth+1)+depth-1]+rfStart[n] - rdepthMaxOld[n*(depth+1)+depth-1])*4 + (rp - rdepthMaxOld[n*(depth+1)+depth])*3 + r; 42516ce3c06aSMatthew G. Knepley remotePointsNew[m].rank = rrank; 42526ce3c06aSMatthew G. Knepley } 42536ce3c06aSMatthew G. Knepley } 42546ce3c06aSMatthew G. Knepley break; 42552eabf88fSMatthew G. Knepley case 6: 42562eabf88fSMatthew G. Knepley /* Hex 3D */ 42572eabf88fSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 42582eabf88fSMatthew G. Knepley /* Old vertices stay the same */ 42592eabf88fSMatthew G. Knepley localPointsNew[m] = vStartNew + (p - vStart); 42602eabf88fSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + (rp - rvStart[n]); 42612eabf88fSMatthew G. Knepley remotePointsNew[m].rank = rrank; 42622eabf88fSMatthew G. Knepley ++m; 42632eabf88fSMatthew G. Knepley } else if ((p >= eStart) && (p < eEnd)) { 42642eabf88fSMatthew G. Knepley /* Old edges add new edges and vertex */ 42652eabf88fSMatthew G. Knepley for (r = 0; r < 2; ++r, ++m) { 42662eabf88fSMatthew G. Knepley localPointsNew[m] = eStartNew + (p - eStart)*2 + r; 42672eabf88fSMatthew G. Knepley remotePointsNew[m].index = reStartNew[n] + (rp - reStart[n])*2 + r; 42682eabf88fSMatthew G. Knepley remotePointsNew[m].rank = rrank; 42692eabf88fSMatthew G. Knepley } 42702eabf88fSMatthew G. Knepley localPointsNew[m] = vStartNew + (vEnd - vStart) + (p - eStart); 42712eabf88fSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + rdepthSizeOld[n*(depth+1)+0] + (rp - reStart[n]); 42722eabf88fSMatthew G. Knepley remotePointsNew[m].rank = rrank; 42732eabf88fSMatthew G. Knepley ++m; 42742eabf88fSMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 42752eabf88fSMatthew G. Knepley /* Old faces add new faces, edges, and vertex */ 42762eabf88fSMatthew G. Knepley for (r = 0; r < 4; ++r, ++m) { 42772eabf88fSMatthew G. Knepley localPointsNew[m] = fStartNew + (p - fStart)*4 + r; 42782eabf88fSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + (rp - rfStart[n])*4 + r; 42792eabf88fSMatthew G. Knepley remotePointsNew[m].rank = rrank; 42802eabf88fSMatthew G. Knepley } 42812eabf88fSMatthew G. Knepley for (r = 0; r < 4; ++r, ++m) { 42822eabf88fSMatthew G. Knepley localPointsNew[m] = eStartNew + (eEnd - eStart)*2 + (p - fStart)*4 + r; 42832eabf88fSMatthew G. Knepley remotePointsNew[m].index = reStartNew[n] + rdepthSizeOld[n*(depth+1)+1]*2 + (rp - rfStart[n])*4 + r; 42842eabf88fSMatthew G. Knepley remotePointsNew[m].rank = rrank; 42852eabf88fSMatthew G. Knepley } 42862eabf88fSMatthew G. Knepley localPointsNew[m] = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (p - fStart); 42872eabf88fSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + rdepthSizeOld[n*(depth+1)+0] + rdepthSizeOld[n*(depth+1)+1] + (rp - rfStart[n]); 42882eabf88fSMatthew G. Knepley remotePointsNew[m].rank = rrank; 42892eabf88fSMatthew G. Knepley ++m; 42902eabf88fSMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 42912eabf88fSMatthew G. Knepley /* Old cells add new cells, faces, edges, and vertex */ 42922eabf88fSMatthew G. Knepley for (r = 0; r < 8; ++r, ++m) { 42932eabf88fSMatthew G. Knepley localPointsNew[m] = cStartNew + (p - cStart)*8 + r; 42942eabf88fSMatthew G. Knepley remotePointsNew[m].index = rcStartNew[n] + (rp - rcStart[n])*8 + r; 42952eabf88fSMatthew G. Knepley remotePointsNew[m].rank = rrank; 42962eabf88fSMatthew G. Knepley } 42972eabf88fSMatthew G. Knepley for (r = 0; r < 12; ++r, ++m) { 42982eabf88fSMatthew G. Knepley localPointsNew[m] = fStartNew + (fEnd - fStart)*4 + (p - cStart)*12 + r; 42992eabf88fSMatthew G. Knepley remotePointsNew[m].index = rfStartNew[n] + rdepthSizeOld[n*(depth+1)+depth-1]*4 + (rp - rcStart[n])*12 + r; 43002eabf88fSMatthew G. Knepley remotePointsNew[m].rank = rrank; 43012eabf88fSMatthew G. Knepley } 43022eabf88fSMatthew G. Knepley for (r = 0; r < 6; ++r, ++m) { 43032eabf88fSMatthew G. Knepley localPointsNew[m] = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (p - cStart)*6 + r; 43042eabf88fSMatthew 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; 43052eabf88fSMatthew G. Knepley remotePointsNew[m].rank = rrank; 43062eabf88fSMatthew G. Knepley } 43072eabf88fSMatthew G. Knepley for (r = 0; r < 1; ++r, ++m) { 43082eabf88fSMatthew G. Knepley localPointsNew[m] = vStartNew + (eEnd - eStart) + (fEnd - fStart) + (p - cStart) + r; 43092eabf88fSMatthew G. Knepley remotePointsNew[m].index = rvStartNew[n] + rdepthSizeOld[n*(depth+1)+1] + rdepthSizeOld[n*(depth+1)+depth-1] + (rp - rcStart[n]) + r; 43102eabf88fSMatthew G. Knepley remotePointsNew[m].rank = rrank; 43112eabf88fSMatthew G. Knepley } 43122eabf88fSMatthew G. Knepley } 43132eabf88fSMatthew G. Knepley break; 431475d3a19aSMatthew G. Knepley default: 431575d3a19aSMatthew G. Knepley SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Unknown cell refiner %d", refiner); 431675d3a19aSMatthew G. Knepley } 431775d3a19aSMatthew G. Knepley } 431875d3a19aSMatthew G. Knepley ierr = ISRestoreIndices(processRanks, &neighbors);CHKERRQ(ierr); 431975d3a19aSMatthew G. Knepley ierr = ISDestroy(&processRanks);CHKERRQ(ierr); 432075d3a19aSMatthew G. Knepley ierr = PetscSFSetGraph(sfNew, pEndNew-pStartNew, numLeavesNew, localPointsNew, PETSC_OWN_POINTER, remotePointsNew, PETSC_OWN_POINTER);CHKERRQ(ierr); 432175d3a19aSMatthew G. Knepley ierr = PetscFree5(rdepthSize,rvStartNew,reStartNew,rfStartNew,rcStartNew);CHKERRQ(ierr); 432206a0ba2dSMatthew G. Knepley ierr = PetscFree7(depthSizeOld,rdepthSizeOld,rdepthMaxOld,rvStart,reStart,rfStart,rcStart);CHKERRQ(ierr); 432375d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 432475d3a19aSMatthew G. Knepley } 432575d3a19aSMatthew G. Knepley 432675d3a19aSMatthew G. Knepley #undef __FUNCT__ 432775d3a19aSMatthew G. Knepley #define __FUNCT__ "CellRefinerCreateLabels" 432875d3a19aSMatthew G. Knepley PetscErrorCode CellRefinerCreateLabels(CellRefiner refiner, DM dm, PetscInt depthSize[], DM rdm) 432975d3a19aSMatthew G. Knepley { 433075d3a19aSMatthew G. Knepley PetscInt numLabels, l; 4331b5da9499SMatthew G. Knepley PetscInt depth, newp, cStart, cStartNew, cEnd, cMax, vStart, vStartNew, vEnd, vMax, fStart, fStartNew, fEnd, fMax, eStart, eStartNew, eEnd, eMax, r; 433275d3a19aSMatthew G. Knepley PetscErrorCode ierr; 433375d3a19aSMatthew G. Knepley 433475d3a19aSMatthew G. Knepley PetscFunctionBegin; 433575d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 433675d3a19aSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr); 433775d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 433875d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 4339d963de37SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4340d963de37SMatthew G. Knepley ierr = GetDepthStart_Private(depth, depthSize, &cStartNew, &fStartNew, &eStartNew, &vStartNew);CHKERRQ(ierr); 434175d3a19aSMatthew G. Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 434275d3a19aSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, &fMax, &eMax, &vMax);CHKERRQ(ierr); 434375d3a19aSMatthew G. Knepley switch (refiner) { 434475d3a19aSMatthew G. Knepley case 3: 434575d3a19aSMatthew G. Knepley if (cMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No cell maximum specified in hybrid mesh"); 434675d3a19aSMatthew G. Knepley cMax = PetscMin(cEnd, cMax); 434775d3a19aSMatthew G. Knepley if (fMax < 0) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "No face maximum specified in hybrid mesh"); 434875d3a19aSMatthew G. Knepley fMax = PetscMin(fEnd, fMax); 434975d3a19aSMatthew G. Knepley } 435075d3a19aSMatthew G. Knepley for (l = 0; l < numLabels; ++l) { 435175d3a19aSMatthew G. Knepley DMLabel label, labelNew; 435275d3a19aSMatthew G. Knepley const char *lname; 435375d3a19aSMatthew G. Knepley PetscBool isDepth; 435475d3a19aSMatthew G. Knepley IS valueIS; 435575d3a19aSMatthew G. Knepley const PetscInt *values; 435675d3a19aSMatthew G. Knepley PetscInt numValues, val; 435775d3a19aSMatthew G. Knepley 435875d3a19aSMatthew G. Knepley ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr); 435975d3a19aSMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 436075d3a19aSMatthew G. Knepley if (isDepth) continue; 436175d3a19aSMatthew G. Knepley ierr = DMPlexCreateLabel(rdm, lname);CHKERRQ(ierr); 436275d3a19aSMatthew G. Knepley ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr); 436375d3a19aSMatthew G. Knepley ierr = DMPlexGetLabel(rdm, lname, &labelNew);CHKERRQ(ierr); 436475d3a19aSMatthew G. Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 436575d3a19aSMatthew G. Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 436675d3a19aSMatthew G. Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 436775d3a19aSMatthew G. Knepley for (val = 0; val < numValues; ++val) { 436875d3a19aSMatthew G. Knepley IS pointIS; 436975d3a19aSMatthew G. Knepley const PetscInt *points; 437075d3a19aSMatthew G. Knepley PetscInt numPoints, n; 437175d3a19aSMatthew G. Knepley 437275d3a19aSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 437375d3a19aSMatthew G. Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 437475d3a19aSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 437575d3a19aSMatthew G. Knepley for (n = 0; n < numPoints; ++n) { 437675d3a19aSMatthew G. Knepley const PetscInt p = points[n]; 437775d3a19aSMatthew G. Knepley switch (refiner) { 437875d3a19aSMatthew G. Knepley case 1: 437975d3a19aSMatthew G. Knepley /* Simplicial 2D */ 438075d3a19aSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 438175d3a19aSMatthew G. Knepley /* Old vertices stay the same */ 438275d3a19aSMatthew G. Knepley newp = vStartNew + (p - vStart); 438375d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 438475d3a19aSMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 438575d3a19aSMatthew G. Knepley /* Old faces add new faces and vertex */ 438675d3a19aSMatthew G. Knepley newp = vStartNew + (vEnd - vStart) + (p - fStart); 438775d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 438875d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 438975d3a19aSMatthew G. Knepley newp = fStartNew + (p - fStart)*2 + r; 439075d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 439175d3a19aSMatthew G. Knepley } 439275d3a19aSMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 439375d3a19aSMatthew G. Knepley /* Old cells add new cells and interior faces */ 439475d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 439575d3a19aSMatthew G. Knepley newp = cStartNew + (p - cStart)*4 + r; 439675d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 439775d3a19aSMatthew G. Knepley } 439875d3a19aSMatthew G. Knepley for (r = 0; r < 3; ++r) { 439975d3a19aSMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*2 + (p - cStart)*3 + r; 440075d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 440175d3a19aSMatthew G. Knepley } 440275d3a19aSMatthew G. Knepley } 440375d3a19aSMatthew G. Knepley break; 440475d3a19aSMatthew G. Knepley case 2: 440575d3a19aSMatthew G. Knepley /* Hex 2D */ 440675d3a19aSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 440775d3a19aSMatthew G. Knepley /* Old vertices stay the same */ 440875d3a19aSMatthew G. Knepley newp = vStartNew + (p - vStart); 440975d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 441075d3a19aSMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 441175d3a19aSMatthew G. Knepley /* Old faces add new faces and vertex */ 441275d3a19aSMatthew G. Knepley newp = vStartNew + (vEnd - vStart) + (p - fStart); 441375d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 441475d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 441575d3a19aSMatthew G. Knepley newp = fStartNew + (p - fStart)*2 + r; 441675d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 441775d3a19aSMatthew G. Knepley } 441875d3a19aSMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 441975d3a19aSMatthew G. Knepley /* Old cells add new cells and interior faces and vertex */ 442075d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 442175d3a19aSMatthew G. Knepley newp = cStartNew + (p - cStart)*4 + r; 442275d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 442375d3a19aSMatthew G. Knepley } 442475d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 442575d3a19aSMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*2 + (p - cStart)*4 + r; 442675d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 442775d3a19aSMatthew G. Knepley } 442875d3a19aSMatthew G. Knepley newp = vStartNew + (vEnd - vStart) + (fEnd - fStart) + (p - cStart); 442975d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 443075d3a19aSMatthew G. Knepley } 443175d3a19aSMatthew G. Knepley break; 443275d3a19aSMatthew G. Knepley case 3: 443375d3a19aSMatthew G. Knepley /* Hybrid simplicial 2D */ 443475d3a19aSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 443575d3a19aSMatthew G. Knepley /* Old vertices stay the same */ 443675d3a19aSMatthew G. Knepley newp = vStartNew + (p - vStart); 443775d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 443875d3a19aSMatthew G. Knepley } else if ((p >= fStart) && (p < fMax)) { 443975d3a19aSMatthew G. Knepley /* Old interior faces add new faces and vertex */ 444075d3a19aSMatthew G. Knepley newp = vStartNew + (vEnd - vStart) + (p - fStart); 444175d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 444275d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 444375d3a19aSMatthew G. Knepley newp = fStartNew + (p - fStart)*2 + r; 444475d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 444575d3a19aSMatthew G. Knepley } 444675d3a19aSMatthew G. Knepley } else if ((p >= fMax) && (p < fEnd)) { 444775d3a19aSMatthew G. Knepley /* Old hybrid faces stay the same */ 444875d3a19aSMatthew G. Knepley newp = fStartNew + (fMax - fStart)*2 + (p - fMax); 444975d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 445075d3a19aSMatthew G. Knepley } else if ((p >= cStart) && (p < cMax)) { 445175d3a19aSMatthew G. Knepley /* Old interior cells add new cells and interior faces */ 445275d3a19aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 445375d3a19aSMatthew G. Knepley newp = cStartNew + (p - cStart)*4 + r; 445475d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 445575d3a19aSMatthew G. Knepley } 445675d3a19aSMatthew G. Knepley for (r = 0; r < 3; ++r) { 445775d3a19aSMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*2 + (p - cStart)*3 + r; 445875d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 445975d3a19aSMatthew G. Knepley } 446075d3a19aSMatthew G. Knepley } else if ((p >= cMax) && (p < cEnd)) { 446175d3a19aSMatthew G. Knepley /* Old hybrid cells add new cells and hybrid face */ 446275d3a19aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 446375d3a19aSMatthew G. Knepley newp = cStartNew + (cMax - cStart)*4 + (p - cMax)*2 + r; 446475d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 446575d3a19aSMatthew G. Knepley } 446675d3a19aSMatthew G. Knepley newp = fStartNew + (fMax - fStart)*2 + (cMax - cStart)*3 + (p - cMax); 446775d3a19aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 446875d3a19aSMatthew G. Knepley } 446975d3a19aSMatthew G. Knepley break; 4470b5da9499SMatthew G. Knepley case 5: 4471b5da9499SMatthew G. Knepley /* Simplicial 3D */ 4472b5da9499SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 4473b5da9499SMatthew G. Knepley /* Old vertices stay the same */ 4474b5da9499SMatthew G. Knepley newp = vStartNew + (p - vStart); 4475b5da9499SMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 4476b5da9499SMatthew G. Knepley } else if ((p >= eStart) && (p < eEnd)) { 4477b5da9499SMatthew G. Knepley /* Old edges add new edges and vertex */ 4478b5da9499SMatthew G. Knepley for (r = 0; r < 2; ++r) { 4479b5da9499SMatthew G. Knepley newp = eStartNew + (p - eStart)*2 + r; 4480b5da9499SMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 4481b5da9499SMatthew G. Knepley } 4482b5da9499SMatthew G. Knepley newp = vStartNew + (vEnd - vStart) + (p - eStart); 4483b5da9499SMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 4484b5da9499SMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 4485b5da9499SMatthew G. Knepley /* Old faces add new faces and edges */ 4486b5da9499SMatthew G. Knepley for (r = 0; r < 4; ++r) { 4487b5da9499SMatthew G. Knepley newp = fStartNew + (p - fStart)*4 + r; 4488b5da9499SMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 4489b5da9499SMatthew G. Knepley } 4490b5da9499SMatthew G. Knepley for (r = 0; r < 3; ++r) { 4491b5da9499SMatthew G. Knepley newp = eStartNew + (eEnd - eStart)*2 + (p - fStart)*3 + r; 4492b5da9499SMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 4493b5da9499SMatthew G. Knepley } 4494b5da9499SMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 4495b5da9499SMatthew G. Knepley /* Old cells add new cells and interior faces and edges */ 4496b5da9499SMatthew G. Knepley for (r = 0; r < 8; ++r) { 4497b5da9499SMatthew G. Knepley newp = cStartNew + (p - cStart)*8 + r; 4498b5da9499SMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 4499b5da9499SMatthew G. Knepley } 4500b5da9499SMatthew G. Knepley for (r = 0; r < 8; ++r) { 4501b5da9499SMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*4 + (p - cStart)*8 + r; 4502b5da9499SMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 4503b5da9499SMatthew G. Knepley } 4504b5da9499SMatthew G. Knepley for (r = 0; r < 1; ++r) { 4505b5da9499SMatthew G. Knepley newp = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*3 + (p - cStart)*1 + r; 4506b5da9499SMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 4507b5da9499SMatthew G. Knepley } 4508b5da9499SMatthew G. Knepley } 4509b5da9499SMatthew G. Knepley break; 45106ce3c06aSMatthew G. Knepley case 7: 45116ce3c06aSMatthew G. Knepley /* Hybrid Simplicial 3D */ 45126ce3c06aSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 45136ce3c06aSMatthew G. Knepley /* Interior vertices stay the same */ 45146ce3c06aSMatthew G. Knepley newp = vStartNew + (p - vStart); 45156ce3c06aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 45166ce3c06aSMatthew G. Knepley } else if ((p >= eStart) && (p < eMax)) { 45176ce3c06aSMatthew G. Knepley /* Interior edges add new edges and vertex */ 45186ce3c06aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 45196ce3c06aSMatthew G. Knepley newp = eStartNew + (p - eStart)*2 + r; 45206ce3c06aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 45216ce3c06aSMatthew G. Knepley } 45226ce3c06aSMatthew G. Knepley newp = vStartNew + (vEnd - vStart) + (p - eStart); 45236ce3c06aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 45246ce3c06aSMatthew G. Knepley } else if ((p >= eMax) && (p < eEnd)) { 45256ce3c06aSMatthew G. Knepley /* Hybrid edges stay the same */ 45266ce3c06aSMatthew G. Knepley newp = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (cMax - cStart) + (p - eMax); 45276ce3c06aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 45286ce3c06aSMatthew G. Knepley } else if ((p >= fStart) && (p < fMax)) { 45296ce3c06aSMatthew G. Knepley /* Interior faces add new faces and edges */ 45306ce3c06aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 45316ce3c06aSMatthew G. Knepley newp = fStartNew + (p - fStart)*4 + r; 45326ce3c06aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 45336ce3c06aSMatthew G. Knepley } 45346ce3c06aSMatthew G. Knepley for (r = 0; r < 3; ++r) { 45356ce3c06aSMatthew G. Knepley newp = eStartNew + (eMax - eStart)*2 + (p - fStart)*3 + r; 45366ce3c06aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 45376ce3c06aSMatthew G. Knepley } 45386ce3c06aSMatthew G. Knepley } else if ((p >= fMax) && (p < fEnd)) { 45396ce3c06aSMatthew G. Knepley /* Hybrid faces add new faces and edges */ 45406ce3c06aSMatthew G. Knepley for (r = 0; r < 2; ++r) { 45416ce3c06aSMatthew G. Knepley newp = fStartNew + (fMax - fStart)*4 + (cMax - cStart)*8 + (p - fMax)*2 + r; 45426ce3c06aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 45436ce3c06aSMatthew G. Knepley } 45446ce3c06aSMatthew G. Knepley newp = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (cMax - cStart) + (p - fMax); 45456ce3c06aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 45466ce3c06aSMatthew G. Knepley } else if ((p >= cStart) && (p < cMax)) { 45476ce3c06aSMatthew G. Knepley /* Interior cells add new cells, faces, and edges */ 45486ce3c06aSMatthew G. Knepley for (r = 0; r < 8; ++r) { 45496ce3c06aSMatthew G. Knepley newp = cStartNew + (p - cStart)*8 + r; 45506ce3c06aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 45516ce3c06aSMatthew G. Knepley } 45526ce3c06aSMatthew G. Knepley for (r = 0; r < 8; ++r) { 45536ce3c06aSMatthew G. Knepley newp = fStartNew + (fMax - fStart)*4 + (p - cStart)*8 + r; 45546ce3c06aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 45556ce3c06aSMatthew G. Knepley } 45566ce3c06aSMatthew G. Knepley newp = eStartNew + (eMax - eStart)*2 + (fMax - fStart)*3 + (p - cStart); 45576ce3c06aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 45586ce3c06aSMatthew G. Knepley } else if ((p >= cStart) && (p < cMax)) { 45596ce3c06aSMatthew G. Knepley /* Hybrid cells add new cells and faces */ 45606ce3c06aSMatthew G. Knepley for (r = 0; r < 4; ++r) { 45616ce3c06aSMatthew G. Knepley newp = cStartNew + (cMax - cStart)*8 + (p - cMax)*4 + r; 45626ce3c06aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 45636ce3c06aSMatthew G. Knepley } 45646ce3c06aSMatthew G. Knepley for (r = 0; r < 3; ++r) { 45656ce3c06aSMatthew G. Knepley newp = fStartNew + (fMax - fStart)*4 + (cMax - cStart)*8 + (fEnd - fMax)*2 + (p - cMax)*3 + r; 45666ce3c06aSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 45676ce3c06aSMatthew G. Knepley } 45686ce3c06aSMatthew G. Knepley } 45696ce3c06aSMatthew G. Knepley break; 45702eabf88fSMatthew G. Knepley case 6: 45712eabf88fSMatthew G. Knepley /* Hex 3D */ 45722eabf88fSMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) { 45732eabf88fSMatthew G. Knepley /* Old vertices stay the same */ 45742eabf88fSMatthew G. Knepley newp = vStartNew + (p - vStart); 45752eabf88fSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 45762eabf88fSMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 45772eabf88fSMatthew G. Knepley /* Old edges add new edges and vertex */ 45782eabf88fSMatthew G. Knepley for (r = 0; r < 2; ++r) { 45792eabf88fSMatthew G. Knepley newp = eStartNew + (p - eStart)*2 + r; 45802eabf88fSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 45812eabf88fSMatthew G. Knepley } 45822eabf88fSMatthew G. Knepley newp = vStartNew + (vEnd - vStart) + (p - eStart); 45832eabf88fSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 45842eabf88fSMatthew G. Knepley } else if ((p >= fStart) && (p < fEnd)) { 45852eabf88fSMatthew G. Knepley /* Old faces add new faces, edges, and vertex */ 45862eabf88fSMatthew G. Knepley for (r = 0; r < 4; ++r) { 45872eabf88fSMatthew G. Knepley newp = fStartNew + (p - fStart)*4 + r; 45882eabf88fSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 45892eabf88fSMatthew G. Knepley } 45902eabf88fSMatthew G. Knepley for (r = 0; r < 4; ++r) { 45912eabf88fSMatthew G. Knepley newp = eStartNew + (eEnd - eStart)*2 + (p - fStart)*4 + r; 45922eabf88fSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 45932eabf88fSMatthew G. Knepley } 45942eabf88fSMatthew G. Knepley newp = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (p - fStart); 45952eabf88fSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 45962eabf88fSMatthew G. Knepley } else if ((p >= cStart) && (p < cEnd)) { 45972eabf88fSMatthew G. Knepley /* Old cells add new cells, faces, edges, and vertex */ 45982eabf88fSMatthew G. Knepley for (r = 0; r < 8; ++r) { 45992eabf88fSMatthew G. Knepley newp = cStartNew + (p - cStart)*8 + r; 46002eabf88fSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 46012eabf88fSMatthew G. Knepley } 46022eabf88fSMatthew G. Knepley for (r = 0; r < 12; ++r) { 46032eabf88fSMatthew G. Knepley newp = fStartNew + (fEnd - fStart)*4 + (p - cStart)*12 + r; 46042eabf88fSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 46052eabf88fSMatthew G. Knepley } 46062eabf88fSMatthew G. Knepley for (r = 0; r < 6; ++r) { 46072eabf88fSMatthew G. Knepley newp = eStartNew + (eEnd - eStart)*2 + (fEnd - fStart)*4 + (p - cStart)*6 + r; 46082eabf88fSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 46092eabf88fSMatthew G. Knepley } 46102eabf88fSMatthew G. Knepley newp = vStartNew + (vEnd - vStart) + (eEnd - eStart) + (fEnd - fStart) + (p - cStart); 46112eabf88fSMatthew G. Knepley ierr = DMLabelSetValue(labelNew, newp, values[val]);CHKERRQ(ierr); 46122eabf88fSMatthew G. Knepley } 46132eabf88fSMatthew G. Knepley break; 461475d3a19aSMatthew G. Knepley default: 461575d3a19aSMatthew G. Knepley SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Unknown cell refiner %d", refiner); 461675d3a19aSMatthew G. Knepley } 461775d3a19aSMatthew G. Knepley } 461875d3a19aSMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 461975d3a19aSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 462075d3a19aSMatthew G. Knepley } 462175d3a19aSMatthew G. Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 462275d3a19aSMatthew G. Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 462375d3a19aSMatthew G. Knepley if (0) { 462475d3a19aSMatthew G. Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 462575d3a19aSMatthew G. Knepley ierr = DMLabelView(labelNew, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 462675d3a19aSMatthew G. Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 462775d3a19aSMatthew G. Knepley } 462875d3a19aSMatthew G. Knepley } 462975d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 463075d3a19aSMatthew G. Knepley } 463175d3a19aSMatthew G. Knepley 463275d3a19aSMatthew G. Knepley #undef __FUNCT__ 4633509c9b89SMatthew G. Knepley #define __FUNCT__ "DMPlexRefineUniform_Internal" 463475d3a19aSMatthew G. Knepley /* This will only work for interpolated meshes */ 4635509c9b89SMatthew G. Knepley PetscErrorCode DMPlexRefineUniform_Internal(DM dm, CellRefiner cellRefiner, DM *dmRefined) 463675d3a19aSMatthew G. Knepley { 463775d3a19aSMatthew G. Knepley DM rdm; 463875d3a19aSMatthew G. Knepley PetscInt *depthSize; 463975d3a19aSMatthew G. Knepley PetscInt dim, depth = 0, d, pStart = 0, pEnd = 0; 464075d3a19aSMatthew G. Knepley PetscErrorCode ierr; 464175d3a19aSMatthew G. Knepley 464275d3a19aSMatthew G. Knepley PetscFunctionBegin; 464375d3a19aSMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &rdm);CHKERRQ(ierr); 464475d3a19aSMatthew G. Knepley ierr = DMSetType(rdm, DMPLEX);CHKERRQ(ierr); 464575d3a19aSMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 464675d3a19aSMatthew G. Knepley ierr = DMPlexSetDimension(rdm, dim);CHKERRQ(ierr); 464775d3a19aSMatthew G. Knepley /* Calculate number of new points of each depth */ 464875d3a19aSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 464975d3a19aSMatthew G. Knepley ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthSize);CHKERRQ(ierr); 465075d3a19aSMatthew G. Knepley ierr = PetscMemzero(depthSize, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 465175d3a19aSMatthew G. Knepley ierr = CellRefinerGetSizes(cellRefiner, dm, depthSize);CHKERRQ(ierr); 465275d3a19aSMatthew G. Knepley /* Step 1: Set chart */ 465375d3a19aSMatthew G. Knepley for (d = 0; d <= depth; ++d) pEnd += depthSize[d]; 465475d3a19aSMatthew G. Knepley ierr = DMPlexSetChart(rdm, pStart, pEnd);CHKERRQ(ierr); 465575d3a19aSMatthew G. Knepley /* Step 2: Set cone/support sizes */ 465675d3a19aSMatthew G. Knepley ierr = CellRefinerSetConeSizes(cellRefiner, dm, depthSize, rdm);CHKERRQ(ierr); 465775d3a19aSMatthew G. Knepley /* Step 3: Setup refined DM */ 465875d3a19aSMatthew G. Knepley ierr = DMSetUp(rdm);CHKERRQ(ierr); 465975d3a19aSMatthew G. Knepley /* Step 4: Set cones and supports */ 466075d3a19aSMatthew G. Knepley ierr = CellRefinerSetCones(cellRefiner, dm, depthSize, rdm);CHKERRQ(ierr); 466175d3a19aSMatthew G. Knepley /* Step 5: Stratify */ 466275d3a19aSMatthew G. Knepley ierr = DMPlexStratify(rdm);CHKERRQ(ierr); 466375d3a19aSMatthew G. Knepley /* Step 6: Set coordinates for vertices */ 466475d3a19aSMatthew G. Knepley ierr = CellRefinerSetCoordinates(cellRefiner, dm, depthSize, rdm);CHKERRQ(ierr); 466575d3a19aSMatthew G. Knepley /* Step 7: Create pointSF */ 466675d3a19aSMatthew G. Knepley ierr = CellRefinerCreateSF(cellRefiner, dm, depthSize, rdm);CHKERRQ(ierr); 466775d3a19aSMatthew G. Knepley /* Step 8: Create labels */ 466875d3a19aSMatthew G. Knepley ierr = CellRefinerCreateLabels(cellRefiner, dm, depthSize, rdm);CHKERRQ(ierr); 466975d3a19aSMatthew G. Knepley ierr = PetscFree(depthSize);CHKERRQ(ierr); 467075d3a19aSMatthew G. Knepley 467175d3a19aSMatthew G. Knepley *dmRefined = rdm; 467275d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 467375d3a19aSMatthew G. Knepley } 467475d3a19aSMatthew G. Knepley 467575d3a19aSMatthew G. Knepley #undef __FUNCT__ 467675d3a19aSMatthew G. Knepley #define __FUNCT__ "DMPlexSetRefinementUniform" 467775d3a19aSMatthew G. Knepley PetscErrorCode DMPlexSetRefinementUniform(DM dm, PetscBool refinementUniform) 467875d3a19aSMatthew G. Knepley { 467975d3a19aSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 468075d3a19aSMatthew G. Knepley 468175d3a19aSMatthew G. Knepley PetscFunctionBegin; 468275d3a19aSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 468375d3a19aSMatthew G. Knepley mesh->refinementUniform = refinementUniform; 468475d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 468575d3a19aSMatthew G. Knepley } 468675d3a19aSMatthew G. Knepley 468775d3a19aSMatthew G. Knepley #undef __FUNCT__ 468875d3a19aSMatthew G. Knepley #define __FUNCT__ "DMPlexGetRefinementUniform" 468975d3a19aSMatthew G. Knepley PetscErrorCode DMPlexGetRefinementUniform(DM dm, PetscBool *refinementUniform) 469075d3a19aSMatthew G. Knepley { 469175d3a19aSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 469275d3a19aSMatthew G. Knepley 469375d3a19aSMatthew G. Knepley PetscFunctionBegin; 469475d3a19aSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 469575d3a19aSMatthew G. Knepley PetscValidPointer(refinementUniform, 2); 469675d3a19aSMatthew G. Knepley *refinementUniform = mesh->refinementUniform; 469775d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 469875d3a19aSMatthew G. Knepley } 469975d3a19aSMatthew G. Knepley 470075d3a19aSMatthew G. Knepley #undef __FUNCT__ 470175d3a19aSMatthew G. Knepley #define __FUNCT__ "DMPlexSetRefinementLimit" 470275d3a19aSMatthew G. Knepley PetscErrorCode DMPlexSetRefinementLimit(DM dm, PetscReal refinementLimit) 470375d3a19aSMatthew G. Knepley { 470475d3a19aSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 470575d3a19aSMatthew G. Knepley 470675d3a19aSMatthew G. Knepley PetscFunctionBegin; 470775d3a19aSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 470875d3a19aSMatthew G. Knepley mesh->refinementLimit = refinementLimit; 470975d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 471075d3a19aSMatthew G. Knepley } 471175d3a19aSMatthew G. Knepley 471275d3a19aSMatthew G. Knepley #undef __FUNCT__ 471375d3a19aSMatthew G. Knepley #define __FUNCT__ "DMPlexGetRefinementLimit" 471475d3a19aSMatthew G. Knepley PetscErrorCode DMPlexGetRefinementLimit(DM dm, PetscReal *refinementLimit) 471575d3a19aSMatthew G. Knepley { 471675d3a19aSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 471775d3a19aSMatthew G. Knepley 471875d3a19aSMatthew G. Knepley PetscFunctionBegin; 471975d3a19aSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 472075d3a19aSMatthew G. Knepley PetscValidPointer(refinementLimit, 2); 472175d3a19aSMatthew G. Knepley /* if (mesh->refinementLimit < 0) = getMaxVolume()/2.0; */ 472275d3a19aSMatthew G. Knepley *refinementLimit = mesh->refinementLimit; 472375d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 472475d3a19aSMatthew G. Knepley } 472575d3a19aSMatthew G. Knepley 472675d3a19aSMatthew G. Knepley #undef __FUNCT__ 4727509c9b89SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCellRefiner_Internal" 4728509c9b89SMatthew G. Knepley PetscErrorCode DMPlexGetCellRefiner_Internal(DM dm, CellRefiner *cellRefiner) 472975d3a19aSMatthew G. Knepley { 473075d3a19aSMatthew G. Knepley PetscInt dim, cStart, coneSize, cMax; 473175d3a19aSMatthew G. Knepley PetscErrorCode ierr; 473275d3a19aSMatthew G. Knepley 473375d3a19aSMatthew G. Knepley PetscFunctionBegin; 473475d3a19aSMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 473575d3a19aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, NULL);CHKERRQ(ierr); 473675d3a19aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr); 473775d3a19aSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 473875d3a19aSMatthew G. Knepley switch (dim) { 473975d3a19aSMatthew G. Knepley case 2: 474075d3a19aSMatthew G. Knepley switch (coneSize) { 474175d3a19aSMatthew G. Knepley case 3: 474275d3a19aSMatthew G. Knepley if (cMax >= 0) *cellRefiner = 3; /* Hybrid */ 474375d3a19aSMatthew G. Knepley else *cellRefiner = 1; /* Triangular */ 474475d3a19aSMatthew G. Knepley break; 474575d3a19aSMatthew G. Knepley case 4: 474675d3a19aSMatthew G. Knepley if (cMax >= 0) *cellRefiner = 4; /* Hybrid */ 474775d3a19aSMatthew G. Knepley else *cellRefiner = 2; /* Quadrilateral */ 474875d3a19aSMatthew G. Knepley break; 474975d3a19aSMatthew G. Knepley default: 475075d3a19aSMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Unknown coneSize %d in dimension %d for cell refiner", coneSize, dim); 475175d3a19aSMatthew G. Knepley } 475275d3a19aSMatthew G. Knepley break; 4753b5da9499SMatthew G. Knepley case 3: 4754b5da9499SMatthew G. Knepley switch (coneSize) { 4755b5da9499SMatthew G. Knepley case 4: 4756b5da9499SMatthew G. Knepley if (cMax >= 0) *cellRefiner = 7; /* Hybrid */ 4757b5da9499SMatthew G. Knepley else *cellRefiner = 5; /* Tetrahedral */ 4758b5da9499SMatthew G. Knepley break; 47592eabf88fSMatthew G. Knepley case 6: 47602eabf88fSMatthew G. Knepley if (cMax >= 0) *cellRefiner = 8; /* Hybrid */ 47612eabf88fSMatthew G. Knepley else *cellRefiner = 6; /* hexahedral */ 47622eabf88fSMatthew G. Knepley break; 4763b5da9499SMatthew G. Knepley default: 4764b5da9499SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Unknown coneSize %d in dimension %d for cell refiner", coneSize, dim); 4765b5da9499SMatthew G. Knepley } 4766b5da9499SMatthew G. Knepley break; 476775d3a19aSMatthew G. Knepley default: 476875d3a19aSMatthew G. Knepley SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Unknown dimension %d for cell refiner", dim); 476975d3a19aSMatthew G. Knepley } 477075d3a19aSMatthew G. Knepley PetscFunctionReturn(0); 477175d3a19aSMatthew G. Knepley } 4772