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