134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 20c312b8eSJed Brown #include <petscsf.h> 3e6ccafaeSMatthew G Knepley 4e6ccafaeSMatthew G Knepley #undef __FUNCT__ 5cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces" 6cd0c2139SMatthew G Knepley /*@ 7cd0c2139SMatthew G Knepley DMPlexMarkBoundaryFaces - Mark all faces on the boundary 8cd0c2139SMatthew G Knepley 9cd0c2139SMatthew G Knepley Not Collective 10cd0c2139SMatthew G Knepley 11cd0c2139SMatthew G Knepley Input Parameter: 12cd0c2139SMatthew G Knepley . dm - The original DM 13cd0c2139SMatthew G Knepley 14cd0c2139SMatthew G Knepley Output Parameter: 15cd0c2139SMatthew G Knepley . label - The DMLabel marking boundary faces with value 1 16cd0c2139SMatthew G Knepley 17cd0c2139SMatthew G Knepley Level: developer 18cd0c2139SMatthew G Knepley 19cd0c2139SMatthew G Knepley .seealso: DMLabelCreate(), DMPlexCreateLabel() 2009f723d9SJed Brown @*/ 21cd0c2139SMatthew G Knepley PetscErrorCode DMPlexMarkBoundaryFaces(DM dm, DMLabel label) 22cd0c2139SMatthew G Knepley { 23cd0c2139SMatthew G Knepley PetscInt fStart, fEnd, f; 24cd0c2139SMatthew G Knepley PetscErrorCode ierr; 25cd0c2139SMatthew G Knepley 26cd0c2139SMatthew G Knepley PetscFunctionBegin; 27cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 28cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 29cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 30cd0c2139SMatthew G Knepley PetscInt supportSize; 31cd0c2139SMatthew G Knepley 32cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 33cd0c2139SMatthew G Knepley if (supportSize == 1) { 34cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, f, 1);CHKERRQ(ierr); 35cd0c2139SMatthew G Knepley } 36cd0c2139SMatthew G Knepley } 37cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 38cd0c2139SMatthew G Knepley } 39cd0c2139SMatthew G Knepley 40cd0c2139SMatthew G Knepley #undef __FUNCT__ 412be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelComplete" 422be2b188SMatthew G Knepley /*@ 432be2b188SMatthew G Knepley DMPlexLabelComplete - Starting with a label marking points on a surface, we add the transitive closure to the surface 442be2b188SMatthew G Knepley 452be2b188SMatthew G Knepley Input Parameters: 462be2b188SMatthew G Knepley + dm - The DM 472be2b188SMatthew G Knepley - label - A DMLabel marking the surface points 482be2b188SMatthew G Knepley 492be2b188SMatthew G Knepley Output Parameter: 502be2b188SMatthew G Knepley . label - A DMLabel marking all surface points in the transitive closure 512be2b188SMatthew G Knepley 522be2b188SMatthew G Knepley Level: developer 532be2b188SMatthew G Knepley 542be2b188SMatthew G Knepley .seealso: DMPlexLabelCohesiveComplete() 552be2b188SMatthew G Knepley @*/ 562be2b188SMatthew G Knepley PetscErrorCode DMPlexLabelComplete(DM dm, DMLabel label) 572be2b188SMatthew G Knepley { 582be2b188SMatthew G Knepley IS valueIS; 592be2b188SMatthew G Knepley const PetscInt *values; 602be2b188SMatthew G Knepley PetscInt numValues, v; 612be2b188SMatthew G Knepley PetscErrorCode ierr; 622be2b188SMatthew G Knepley 632be2b188SMatthew G Knepley PetscFunctionBegin; 642be2b188SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 652be2b188SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 662be2b188SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 672be2b188SMatthew G Knepley for (v = 0; v < numValues; ++v) { 682be2b188SMatthew G Knepley IS pointIS; 692be2b188SMatthew G Knepley const PetscInt *points; 702be2b188SMatthew G Knepley PetscInt numPoints, p; 712be2b188SMatthew G Knepley 722be2b188SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 732be2b188SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 742be2b188SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 752be2b188SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 762be2b188SMatthew G Knepley PetscInt *closure = NULL; 772be2b188SMatthew G Knepley PetscInt closureSize, c; 782be2b188SMatthew G Knepley 792be2b188SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 802be2b188SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 812be2b188SMatthew G Knepley ierr = DMLabelSetValue(label, closure[c], values[v]);CHKERRQ(ierr); 822be2b188SMatthew G Knepley } 832be2b188SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 842be2b188SMatthew G Knepley } 852be2b188SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 862be2b188SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 872be2b188SMatthew G Knepley } 882be2b188SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 892be2b188SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 902be2b188SMatthew G Knepley PetscFunctionReturn(0); 912be2b188SMatthew G Knepley } 922be2b188SMatthew G Knepley 932be2b188SMatthew G Knepley #undef __FUNCT__ 946cf0e42fSMatthew G. Knepley #define __FUNCT__ "DMPlexLabelAddCells" 956cf0e42fSMatthew G. Knepley /*@ 966cf0e42fSMatthew G. Knepley DMPlexLabelAddCells - Starting with a label marking faces on a surface, we add a cell for each face 976cf0e42fSMatthew G. Knepley 986cf0e42fSMatthew G. Knepley Input Parameters: 996cf0e42fSMatthew G. Knepley + dm - The DM 1006cf0e42fSMatthew G. Knepley - label - A DMLabel marking the surface points 1016cf0e42fSMatthew G. Knepley 1026cf0e42fSMatthew G. Knepley Output Parameter: 1036cf0e42fSMatthew G. Knepley . label - A DMLabel incorporating cells 1046cf0e42fSMatthew G. Knepley 1056cf0e42fSMatthew G. Knepley Level: developer 1066cf0e42fSMatthew G. Knepley 1076cf0e42fSMatthew G. Knepley Note: The cells allow FEM boundary conditions to be applied using the cell geometry 1086cf0e42fSMatthew G. Knepley 1096cf0e42fSMatthew G. Knepley .seealso: DMPlexLabelComplete(), DMPlexLabelCohesiveComplete() 1106cf0e42fSMatthew G. Knepley @*/ 1116cf0e42fSMatthew G. Knepley PetscErrorCode DMPlexLabelAddCells(DM dm, DMLabel label) 1126cf0e42fSMatthew G. Knepley { 1136cf0e42fSMatthew G. Knepley IS valueIS; 1146cf0e42fSMatthew G. Knepley const PetscInt *values; 1156cf0e42fSMatthew G. Knepley PetscInt numValues, v, cStart, cEnd; 1166cf0e42fSMatthew G. Knepley PetscErrorCode ierr; 1176cf0e42fSMatthew G. Knepley 1186cf0e42fSMatthew G. Knepley PetscFunctionBegin; 1196cf0e42fSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1206cf0e42fSMatthew G. Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 1216cf0e42fSMatthew G. Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 1226cf0e42fSMatthew G. Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 1236cf0e42fSMatthew G. Knepley for (v = 0; v < numValues; ++v) { 1246cf0e42fSMatthew G. Knepley IS pointIS; 1256cf0e42fSMatthew G. Knepley const PetscInt *points; 1266cf0e42fSMatthew G. Knepley PetscInt numPoints, p; 1276cf0e42fSMatthew G. Knepley 1286cf0e42fSMatthew G. Knepley ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 1296cf0e42fSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 1306cf0e42fSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 1316cf0e42fSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1326cf0e42fSMatthew G. Knepley PetscInt *closure = NULL; 1336cf0e42fSMatthew G. Knepley PetscInt closureSize, point; 1346cf0e42fSMatthew G. Knepley 1356cf0e42fSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 1366cf0e42fSMatthew G. Knepley point = closure[(closureSize-1)*2]; 1376cf0e42fSMatthew G. Knepley if ((point >= cStart) && (point < cEnd)) {ierr = DMLabelSetValue(label, point, values[v]);CHKERRQ(ierr);} 1386cf0e42fSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 1396cf0e42fSMatthew G. Knepley } 1406cf0e42fSMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 1416cf0e42fSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 1426cf0e42fSMatthew G. Knepley } 1436cf0e42fSMatthew G. Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1446cf0e42fSMatthew G. Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1456cf0e42fSMatthew G. Knepley PetscFunctionReturn(0); 1466cf0e42fSMatthew G. Knepley } 1476cf0e42fSMatthew G. Knepley 1486cf0e42fSMatthew G. Knepley #undef __FUNCT__ 149cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoint_Internal" 150a6ae58d1SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthMax[], PetscInt depthEnd[], PetscInt depthShift[]) 151cd0c2139SMatthew G Knepley { 152cd0c2139SMatthew G Knepley if (depth < 0) return p; 153a6ae58d1SMatthew G. Knepley /* Normal Cells */ if (p < depthMax[depth]) return p; 154a6ae58d1SMatthew G. Knepley /* Hybrid Cells+Normal Vertices */ if (p < depthMax[0]) return p + depthShift[depth]; 155a6ae58d1SMatthew G. Knepley /* Hybrid Vertices+Normal Faces */ if (depth < 2 || p < depthMax[depth-1]) return p + depthShift[depth] + depthShift[0]; 156a6ae58d1SMatthew G. Knepley /* Hybrid Faces+Normal Edges */ if (depth < 3 || p < depthMax[depth-2]) return p + depthShift[depth] + depthShift[0] + depthShift[depth-1]; 157a6ae58d1SMatthew G. Knepley /* Hybrid Edges */ return p + depthShift[depth] + depthShift[0] + depthShift[depth-1] + depthShift[depth-2]; 158cd0c2139SMatthew G Knepley } 159cd0c2139SMatthew G Knepley 160cd0c2139SMatthew G Knepley #undef __FUNCT__ 161cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSizes_Internal" 162cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew) 163cd0c2139SMatthew G Knepley { 164a6ae58d1SMatthew G. Knepley PetscInt *depthMax, *depthEnd; 165cd0c2139SMatthew G Knepley PetscInt depth = 0, d, pStart, pEnd, p; 166cd0c2139SMatthew G Knepley PetscErrorCode ierr; 167cd0c2139SMatthew G Knepley 168cd0c2139SMatthew G Knepley PetscFunctionBegin; 169cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 170cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 1712203a8e9SMatthew G. Knepley ierr = PetscMalloc2(depth+1,&depthMax,depth+1,&depthEnd);CHKERRQ(ierr); 172cd0c2139SMatthew G Knepley /* Step 1: Expand chart */ 173cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 174a6ae58d1SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &depthMax[depth], depth > 0 ? &depthMax[depth-1] : NULL, &depthMax[1], &depthMax[0]);CHKERRQ(ierr); 175cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 176cd0c2139SMatthew G Knepley pEnd += depthShift[d]; 177cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 178a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 179cd0c2139SMatthew G Knepley } 180cd0c2139SMatthew G Knepley ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr); 181cd0c2139SMatthew G Knepley /* Step 2: Set cone and support sizes */ 182cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 183cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 184cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 185a6ae58d1SMatthew G. Knepley PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthMax, depthEnd, depthShift); 186cd0c2139SMatthew G Knepley PetscInt size; 187cd0c2139SMatthew G Knepley 188cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 189cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr); 190cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 191cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr); 192cd0c2139SMatthew G Knepley } 193cd0c2139SMatthew G Knepley } 194a6ae58d1SMatthew G. Knepley ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr); 195cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 196cd0c2139SMatthew G Knepley } 197cd0c2139SMatthew G Knepley 198cd0c2139SMatthew G Knepley #undef __FUNCT__ 199cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoints_Internal" 200cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew) 201cd0c2139SMatthew G Knepley { 202a6ae58d1SMatthew G. Knepley PetscInt *depthEnd, *depthMax, *newpoints; 203dcbb62e8SMatthew G. Knepley PetscInt depth = 0, d, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, pStart, pEnd, p; 204cd0c2139SMatthew G Knepley PetscErrorCode ierr; 205cd0c2139SMatthew G Knepley 206cd0c2139SMatthew G Knepley PetscFunctionBegin; 207cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 208cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 209cd0c2139SMatthew G Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 210dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dmNew, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 2112203a8e9SMatthew G. Knepley ierr = PetscMalloc3(depth+1,&depthEnd,depth+1,&depthMax,PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),&newpoints);CHKERRQ(ierr); 212a6ae58d1SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &depthMax[depth], depth > 0 ? &depthMax[depth-1] : NULL, &depthMax[1], &depthMax[0]);CHKERRQ(ierr); 213cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 214cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 215a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 216cd0c2139SMatthew G Knepley } 217cd0c2139SMatthew G Knepley /* Step 5: Set cones and supports */ 218cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 219cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 220cd0c2139SMatthew G Knepley const PetscInt *points = NULL, *orientations = NULL; 221a6ae58d1SMatthew G. Knepley PetscInt size,sizeNew, i, newp = DMPlexShiftPoint_Internal(p, depth, depthMax, depthEnd, depthShift); 222cd0c2139SMatthew G Knepley 223cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 224cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr); 225cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr); 226cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 227a6ae58d1SMatthew G. Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthMax, depthEnd, depthShift); 228cd0c2139SMatthew G Knepley } 229cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr); 230cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr); 231cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 232dcbb62e8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmNew, newp, &sizeNew);CHKERRQ(ierr); 233cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr); 234cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 235a6ae58d1SMatthew G. Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthMax, depthEnd, depthShift); 236cd0c2139SMatthew G Knepley } 237dcbb62e8SMatthew G. Knepley for (i = size; i < sizeNew; ++i) newpoints[i] = 0; 238cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr); 239cd0c2139SMatthew G Knepley } 240a6ae58d1SMatthew G. Knepley ierr = PetscFree3(depthEnd,depthMax,newpoints);CHKERRQ(ierr); 241cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 242cd0c2139SMatthew G Knepley } 243cd0c2139SMatthew G Knepley 244cd0c2139SMatthew G Knepley #undef __FUNCT__ 245cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftCoordinates_Internal" 246cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew) 247cd0c2139SMatthew G Knepley { 248cd0c2139SMatthew G Knepley PetscSection coordSection, newCoordSection; 249cd0c2139SMatthew G Knepley Vec coordinates, newCoordinates; 250cd0c2139SMatthew G Knepley PetscScalar *coords, *newCoords; 251cd0c2139SMatthew G Knepley PetscInt *depthEnd, coordSize; 252cd0c2139SMatthew G Knepley PetscInt dim, depth = 0, d, vStart, vEnd, vStartNew, vEndNew, v; 253cd0c2139SMatthew G Knepley PetscErrorCode ierr; 254cd0c2139SMatthew G Knepley 255cd0c2139SMatthew G Knepley PetscFunctionBegin; 256cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 257cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 258785e854fSJed Brown ierr = PetscMalloc1((depth+1), &depthEnd);CHKERRQ(ierr); 259cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 260cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 261cd0c2139SMatthew G Knepley } 262cd0c2139SMatthew G Knepley /* Step 8: Convert coordinates */ 263cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 264cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr); 26569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 266cd0c2139SMatthew G Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr); 267cd0c2139SMatthew G Knepley ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr); 268cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr); 269cd0c2139SMatthew G Knepley ierr = PetscSectionSetChart(newCoordSection, vStartNew, vEndNew);CHKERRQ(ierr); 270cd0c2139SMatthew G Knepley for (v = vStartNew; v < vEndNew; ++v) { 271cd0c2139SMatthew G Knepley ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr); 272cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr); 273cd0c2139SMatthew G Knepley } 274cd0c2139SMatthew G Knepley ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr); 27569d8a9ceSMatthew G. Knepley ierr = DMSetCoordinateSection(dmNew, newCoordSection);CHKERRQ(ierr); 276cd0c2139SMatthew G Knepley ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr); 277cd0c2139SMatthew G Knepley ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr); 278cd0c2139SMatthew G Knepley ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr); 279cd0c2139SMatthew G Knepley ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2802eb5907fSJed Brown ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr); 281cd0c2139SMatthew G Knepley ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr); 282cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 283cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 284cd0c2139SMatthew G Knepley ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr); 285cd0c2139SMatthew G Knepley for (v = vStart; v < vEnd; ++v) { 286cd0c2139SMatthew G Knepley PetscInt dof, off, noff, d; 287cd0c2139SMatthew G Knepley 288cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 289cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 290a6ae58d1SMatthew G. Knepley ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthEnd, depthEnd, depthShift), &noff);CHKERRQ(ierr); 291cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) { 292cd0c2139SMatthew G Knepley newCoords[noff+d] = coords[off+d]; 293cd0c2139SMatthew G Knepley } 294cd0c2139SMatthew G Knepley } 295cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 296cd0c2139SMatthew G Knepley ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr); 297cd0c2139SMatthew G Knepley ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 298cd0c2139SMatthew G Knepley ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr); 299cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 300cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 301cd0c2139SMatthew G Knepley } 302cd0c2139SMatthew G Knepley 303cd0c2139SMatthew G Knepley #undef __FUNCT__ 304cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal" 305cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew) 306cd0c2139SMatthew G Knepley { 307a6ae58d1SMatthew G. Knepley PetscInt *depthMax, *depthEnd; 308cd0c2139SMatthew G Knepley PetscInt depth = 0, d; 309cd0c2139SMatthew G Knepley PetscSF sfPoint, sfPointNew; 310cd0c2139SMatthew G Knepley const PetscSFNode *remotePoints; 311cd0c2139SMatthew G Knepley PetscSFNode *gremotePoints; 312cd0c2139SMatthew G Knepley const PetscInt *localPoints; 313cd0c2139SMatthew G Knepley PetscInt *glocalPoints, *newLocation, *newRemoteLocation; 314cd0c2139SMatthew G Knepley PetscInt numRoots, numLeaves, l, pStart, pEnd, totShift = 0; 315cd0c2139SMatthew G Knepley PetscErrorCode ierr; 316cd0c2139SMatthew G Knepley 317cd0c2139SMatthew G Knepley PetscFunctionBegin; 318cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3192203a8e9SMatthew G. Knepley ierr = PetscMalloc2(depth+1,&depthMax,depth+1,&depthEnd);CHKERRQ(ierr); 320a6ae58d1SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &depthMax[depth] : NULL, depth>1 ? &depthMax[depth-1] : NULL, depth>2 ? &depthMax[1] : NULL, depth >= 0 ? &depthMax[0] : NULL);CHKERRQ(ierr); 321cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 322cd0c2139SMatthew G Knepley totShift += depthShift[d]; 323cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 324a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 325cd0c2139SMatthew G Knepley } 326cd0c2139SMatthew G Knepley /* Step 9: Convert pointSF */ 327cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 328cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr); 329cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 330cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 331cd0c2139SMatthew G Knepley if (numRoots >= 0) { 332dcca6d9dSJed Brown ierr = PetscMalloc2(numRoots,&newLocation,pEnd-pStart,&newRemoteLocation);CHKERRQ(ierr); 333a6ae58d1SMatthew G. Knepley for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthMax, depthEnd, depthShift); 334cd0c2139SMatthew G Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 335cd0c2139SMatthew G Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 336785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &glocalPoints);CHKERRQ(ierr); 337785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &gremotePoints);CHKERRQ(ierr); 338cd0c2139SMatthew G Knepley for (l = 0; l < numLeaves; ++l) { 339a6ae58d1SMatthew G. Knepley glocalPoints[l] = DMPlexShiftPoint_Internal(localPoints[l], depth, depthMax, depthEnd, depthShift); 340cd0c2139SMatthew G Knepley gremotePoints[l].rank = remotePoints[l].rank; 341cd0c2139SMatthew G Knepley gremotePoints[l].index = newRemoteLocation[localPoints[l]]; 342cd0c2139SMatthew G Knepley } 343cd0c2139SMatthew G Knepley ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr); 344cd0c2139SMatthew G Knepley ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 345cd0c2139SMatthew G Knepley } 346a6ae58d1SMatthew G. Knepley ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr); 347cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 348cd0c2139SMatthew G Knepley } 349cd0c2139SMatthew G Knepley 350cd0c2139SMatthew G Knepley #undef __FUNCT__ 351cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal" 352cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew) 353cd0c2139SMatthew G Knepley { 354cd0c2139SMatthew G Knepley PetscSF sfPoint; 355cd0c2139SMatthew G Knepley DMLabel vtkLabel, ghostLabel; 356a6ae58d1SMatthew G. Knepley PetscInt *depthMax, *depthEnd; 357cd0c2139SMatthew G Knepley const PetscSFNode *leafRemote; 358cd0c2139SMatthew G Knepley const PetscInt *leafLocal; 359cd0c2139SMatthew G Knepley PetscInt depth = 0, d, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f; 360cd0c2139SMatthew G Knepley PetscMPIInt rank; 361cd0c2139SMatthew G Knepley PetscErrorCode ierr; 362cd0c2139SMatthew G Knepley 363cd0c2139SMatthew G Knepley PetscFunctionBegin; 364cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3652203a8e9SMatthew G. Knepley ierr = PetscMalloc2(depth+1,&depthMax,depth+1,&depthEnd);CHKERRQ(ierr); 366a6ae58d1SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &depthMax[depth] : NULL, depth>1 ? &depthMax[depth-1] : NULL, depth>2 ? &depthMax[1] : NULL, depth >= 0 ? &depthMax[0] : NULL);CHKERRQ(ierr); 367cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 368cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 369a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 370cd0c2139SMatthew G Knepley } 371cd0c2139SMatthew G Knepley /* Step 10: Convert labels */ 372cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 373cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 374cd0c2139SMatthew G Knepley DMLabel label, newlabel; 375cd0c2139SMatthew G Knepley const char *lname; 376cd0c2139SMatthew G Knepley PetscBool isDepth; 377cd0c2139SMatthew G Knepley IS valueIS; 378cd0c2139SMatthew G Knepley const PetscInt *values; 379cd0c2139SMatthew G Knepley PetscInt numValues, val; 380cd0c2139SMatthew G Knepley 381cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr); 382cd0c2139SMatthew G Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 383cd0c2139SMatthew G Knepley if (isDepth) continue; 384cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, lname);CHKERRQ(ierr); 385cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr); 386cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr); 387cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 388cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 389cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 390cd0c2139SMatthew G Knepley for (val = 0; val < numValues; ++val) { 391cd0c2139SMatthew G Knepley IS pointIS; 392cd0c2139SMatthew G Knepley const PetscInt *points; 393cd0c2139SMatthew G Knepley PetscInt numPoints, p; 394cd0c2139SMatthew G Knepley 395cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 396cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 397cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 398cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 399a6ae58d1SMatthew G. Knepley const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthMax, depthEnd, depthShift); 400cd0c2139SMatthew G Knepley 401cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr); 402cd0c2139SMatthew G Knepley } 403cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 404cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 405cd0c2139SMatthew G Knepley } 406cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 407cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 408cd0c2139SMatthew G Knepley } 409a6ae58d1SMatthew G. Knepley ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr); 410cd0c2139SMatthew G Knepley /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */ 411cd0c2139SMatthew G Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 412cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 413cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 414cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr); 415cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "vtk");CHKERRQ(ierr); 416cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "ghost");CHKERRQ(ierr); 417cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr); 418cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr); 419cd0c2139SMatthew G Knepley for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { 420cd0c2139SMatthew G Knepley for (; c < leafLocal[l] && c < cEnd; ++c) { 421cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 422cd0c2139SMatthew G Knepley } 423cd0c2139SMatthew G Knepley if (leafLocal[l] >= cEnd) break; 424cd0c2139SMatthew G Knepley if (leafRemote[l].rank == rank) { 425cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 426cd0c2139SMatthew G Knepley } else { 427cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr); 428cd0c2139SMatthew G Knepley } 429cd0c2139SMatthew G Knepley } 430cd0c2139SMatthew G Knepley for (; c < cEnd; ++c) { 431cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 432cd0c2139SMatthew G Knepley } 433cd0c2139SMatthew G Knepley if (0) { 434cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 435cd0c2139SMatthew G Knepley ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 436cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 437cd0c2139SMatthew G Knepley } 438cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr); 439cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 440cd0c2139SMatthew G Knepley PetscInt numCells; 441cd0c2139SMatthew G Knepley 442cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr); 443cd0c2139SMatthew G Knepley if (numCells < 2) { 444cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr); 445cd0c2139SMatthew G Knepley } else { 446cd0c2139SMatthew G Knepley const PetscInt *cells = NULL; 447cd0c2139SMatthew G Knepley PetscInt vA, vB; 448cd0c2139SMatthew G Knepley 449cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr); 450cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr); 451cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr); 452cd0c2139SMatthew G Knepley if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);} 453cd0c2139SMatthew G Knepley } 454cd0c2139SMatthew G Knepley } 455cd0c2139SMatthew G Knepley if (0) { 456cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 457cd0c2139SMatthew G Knepley ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 458cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 459cd0c2139SMatthew G Knepley } 460cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 461cd0c2139SMatthew G Knepley } 462cd0c2139SMatthew G Knepley 463cd0c2139SMatthew G Knepley #undef __FUNCT__ 464cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal" 465cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm) 466cd0c2139SMatthew G Knepley { 467cd0c2139SMatthew G Knepley IS valueIS; 468cd0c2139SMatthew G Knepley const PetscInt *values; 469cd0c2139SMatthew G Knepley PetscInt *depthShift; 4704a6cfa73SMatthew G. Knepley PetscInt depth = 0, Ng, numFS, fs, fStart, fEnd, ghostCell, cEnd, c; 471cd0c2139SMatthew G Knepley PetscErrorCode ierr; 472cd0c2139SMatthew G Knepley 473cd0c2139SMatthew G Knepley PetscFunctionBegin; 47446c796b9SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 475cd0c2139SMatthew G Knepley /* Count ghost cells */ 476cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 477cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr); 478cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 4794a6cfa73SMatthew G. Knepley Ng = 0; 480cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 48146c796b9SMatthew G. Knepley IS faceIS; 48246c796b9SMatthew G. Knepley const PetscInt *faces; 48346c796b9SMatthew G. Knepley PetscInt numFaces, f, numBdFaces = 0; 484cd0c2139SMatthew G Knepley 48546c796b9SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 48646c796b9SMatthew G. Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 48746c796b9SMatthew G. Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 48846c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 48946c796b9SMatthew G. Knepley if ((faces[f] >= fStart) && (faces[f] < fEnd)) ++numBdFaces; 49046c796b9SMatthew G. Knepley } 4914a6cfa73SMatthew G. Knepley Ng += numBdFaces; 49246c796b9SMatthew G. Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 493cd0c2139SMatthew G Knepley } 494cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 495785e854fSJed Brown ierr = PetscMalloc1((depth+1), &depthShift);CHKERRQ(ierr); 496cd0c2139SMatthew G Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 4974a6cfa73SMatthew G. Knepley if (depth >= 0) depthShift[depth] = Ng; 498cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 499cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 500cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 5015acea1aeSMatthew G. Knepley ierr = DMPlexSetHybridBounds(gdm, cEnd, PETSC_DETERMINE, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 5024a6cfa73SMatthew G. Knepley for (c = cEnd; c < cEnd + Ng; ++c) { 503cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr); 504cd0c2139SMatthew G Knepley } 505cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 506cd0c2139SMatthew G Knepley IS faceIS; 507cd0c2139SMatthew G Knepley const PetscInt *faces; 508cd0c2139SMatthew G Knepley PetscInt numFaces, f; 509cd0c2139SMatthew G Knepley 510cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 511cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 512cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 513cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 514cd0c2139SMatthew G Knepley PetscInt size; 515cd0c2139SMatthew G Knepley 51646c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 517cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr); 518cd0c2139SMatthew G Knepley if (size != 1) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "DM has boundary face %d with %d support cells", faces[f], size); 5194a6cfa73SMatthew G. Knepley ierr = DMPlexSetSupportSize(gdm, faces[f] + Ng, 2);CHKERRQ(ierr); 520cd0c2139SMatthew G Knepley } 521cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 522cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 523cd0c2139SMatthew G Knepley } 524cd0c2139SMatthew G Knepley /* Step 4: Setup ghosted DM */ 525cd0c2139SMatthew G Knepley ierr = DMSetUp(gdm);CHKERRQ(ierr); 526cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 527cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 528cd0c2139SMatthew G Knepley ghostCell = cEnd; 529cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 530cd0c2139SMatthew G Knepley IS faceIS; 531cd0c2139SMatthew G Knepley const PetscInt *faces; 532cd0c2139SMatthew G Knepley PetscInt numFaces, f; 533cd0c2139SMatthew G Knepley 534cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 535cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 536cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 53746c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 5384a6cfa73SMatthew G. Knepley PetscInt newFace = faces[f] + Ng; 539cd0c2139SMatthew G Knepley 54046c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 541cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr); 542cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr); 54346c796b9SMatthew G. Knepley ++ghostCell; 544cd0c2139SMatthew G Knepley } 545cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 546cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 547cd0c2139SMatthew G Knepley } 548cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 549cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 550cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 551cd0c2139SMatthew G Knepley ierr = DMPlexStratify(gdm);CHKERRQ(ierr); 552cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 553cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 554cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 555cd0c2139SMatthew G Knepley ierr = PetscFree(depthShift);CHKERRQ(ierr); 5564a6cfa73SMatthew G. Knepley if (numGhostCells) *numGhostCells = Ng; 557cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 558cd0c2139SMatthew G Knepley } 559cd0c2139SMatthew G Knepley 560cd0c2139SMatthew G Knepley #undef __FUNCT__ 561cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells" 562cd0c2139SMatthew G Knepley /*@C 563cd0c2139SMatthew G Knepley DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face 564cd0c2139SMatthew G Knepley 565cd0c2139SMatthew G Knepley Collective on dm 566cd0c2139SMatthew G Knepley 567cd0c2139SMatthew G Knepley Input Parameters: 568cd0c2139SMatthew G Knepley + dm - The original DM 569cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL 570cd0c2139SMatthew G Knepley 571cd0c2139SMatthew G Knepley Output Parameters: 572cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM 573cd0c2139SMatthew G Knepley - dmGhosted - The new DM 574cd0c2139SMatthew G Knepley 575cd0c2139SMatthew G Knepley Note: If no label exists of that name, one will be created marking all boundary faces 576cd0c2139SMatthew G Knepley 577cd0c2139SMatthew G Knepley Level: developer 578cd0c2139SMatthew G Knepley 579cd0c2139SMatthew G Knepley .seealso: DMCreate() 58031266bc0SMatthew G. Knepley @*/ 581cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted) 582cd0c2139SMatthew G Knepley { 583cd0c2139SMatthew G Knepley DM gdm; 584cd0c2139SMatthew G Knepley DMLabel label; 585cd0c2139SMatthew G Knepley const char *name = labelName ? labelName : "Face Sets"; 586cd0c2139SMatthew G Knepley PetscInt dim; 587a42b08eeSMatthew G. Knepley PetscBool flag; 588cd0c2139SMatthew G Knepley PetscErrorCode ierr; 589cd0c2139SMatthew G Knepley 590cd0c2139SMatthew G Knepley PetscFunctionBegin; 591cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5924a6cfa73SMatthew G. Knepley if (numGhostCells) PetscValidPointer(numGhostCells, 3); 593cd0c2139SMatthew G Knepley PetscValidPointer(dmGhosted, 4); 594cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr); 595cd0c2139SMatthew G Knepley ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr); 596cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 597cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(gdm, dim);CHKERRQ(ierr); 598a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseCone(dm, &flag);CHKERRQ(ierr); 599a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseCone(gdm, flag);CHKERRQ(ierr); 600a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseClosure(dm, &flag);CHKERRQ(ierr); 601a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseClosure(gdm, flag);CHKERRQ(ierr); 602cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 603cd0c2139SMatthew G Knepley if (!label) { 604cd0c2139SMatthew G Knepley /* Get label for boundary faces */ 605cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr); 606cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 607cd0c2139SMatthew G Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 608cd0c2139SMatthew G Knepley } 609cd0c2139SMatthew G Knepley ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr); 610*8e136ac0SMatthew G. Knepley ierr = DMPlexCopyBoundary(dm, gdm);CHKERRQ(ierr); 611cd0c2139SMatthew G Knepley *dmGhosted = gdm; 612cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 613cd0c2139SMatthew G Knepley } 614cd0c2139SMatthew G Knepley 615cd0c2139SMatthew G Knepley #undef __FUNCT__ 616cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal" 617607ab7a9SMatthew G. Knepley /* 618faedd622SMatthew G. Knepley We are adding three kinds of points here: 619607ab7a9SMatthew G. Knepley Replicated: Copies of points which exist in the mesh, such as vertices identified across a fault 620faedd622SMatthew G. Knepley Non-replicated: Points which exist on the fault, but are not replicated 621607ab7a9SMatthew G. Knepley Hybrid: Entirely new points, such as cohesive cells 622a6ae58d1SMatthew G. Knepley 623a6ae58d1SMatthew G. Knepley When creating subsequent cohesive cells, we shift the old hybrid cells to the end of the numbering at 624a6ae58d1SMatthew G. Knepley each depth so that the new split/hybrid points can be inserted as a block. 625607ab7a9SMatthew G. Knepley */ 626cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm) 627cd0c2139SMatthew G Knepley { 628cd0c2139SMatthew G Knepley MPI_Comm comm; 629607ab7a9SMatthew G. Knepley IS valueIS; 630607ab7a9SMatthew G. Knepley PetscInt numSP = 0; /* The number of depths for which we have replicated points */ 631607ab7a9SMatthew G. Knepley const PetscInt *values; /* List of depths for which we have replicated points */ 63218c5995bSMatthew G. Knepley IS *splitIS; 63318c5995bSMatthew G. Knepley IS *unsplitIS; 634607ab7a9SMatthew G. Knepley PetscInt *numSplitPoints; /* The number of replicated points at each depth */ 63518c5995bSMatthew G. Knepley PetscInt *numUnsplitPoints; /* The number of non-replicated points at each depth which still give rise to hybrid points */ 63636dbac82SMatthew G. Knepley PetscInt *numHybridPoints; /* The number of new hybrid points at each depth */ 63736dbac82SMatthew G. Knepley PetscInt *numHybridPointsOld; /* The number of existing hybrid points at each depth */ 638607ab7a9SMatthew G. Knepley const PetscInt **splitPoints; /* Replicated points for each depth */ 63918c5995bSMatthew G. Knepley const PetscInt **unsplitPoints; /* Non-replicated points for each depth */ 640cd0c2139SMatthew G Knepley PetscSection coordSection; 641cd0c2139SMatthew G Knepley Vec coordinates; 642cd0c2139SMatthew G Knepley PetscScalar *coords; 643607ab7a9SMatthew G. Knepley PetscInt depths[4]; /* Depths in the order that plex points are numbered */ 644a6ae58d1SMatthew G. Knepley PetscInt *depthMax; /* The first hybrid point at each depth in the original mesh */ 645a6ae58d1SMatthew G. Knepley PetscInt *depthEnd; /* The point limit at each depth in the original mesh */ 646607ab7a9SMatthew G. Knepley PetscInt *depthShift; /* Number of replicated+hybrid points at each depth */ 647607ab7a9SMatthew G. Knepley PetscInt *depthOffset; /* Prefix sums of depthShift */ 648607ab7a9SMatthew G. Knepley PetscInt *pMaxNew; /* The first replicated point at each depth in the new mesh, hybrids come after this */ 649607ab7a9SMatthew G. Knepley PetscInt *coneNew, *coneONew, *supportNew; 65018c5995bSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v; 651cd0c2139SMatthew G Knepley PetscErrorCode ierr; 652cd0c2139SMatthew G Knepley 653cd0c2139SMatthew G Knepley PetscFunctionBegin; 654cd0c2139SMatthew G Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 655cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 656607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 657fd4b9f15SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 658607ab7a9SMatthew G. Knepley depths[0] = depth; 659607ab7a9SMatthew G. Knepley depths[1] = 0; 660607ab7a9SMatthew G. Knepley depths[2] = depth-1; 661607ab7a9SMatthew G. Knepley depths[3] = 1; 662cd0c2139SMatthew G Knepley /* Count split points and add cohesive cells */ 663607ab7a9SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 6642203a8e9SMatthew G. Knepley ierr = PetscMalloc6(depth+1,&depthMax,depth+1,&depthEnd,depth+1,&depthShift,depth+1,&depthOffset,depth+1,&pMaxNew,depth+1,&numHybridPointsOld);CHKERRQ(ierr); 665dcca6d9dSJed Brown ierr = PetscMalloc7(depth+1,&splitIS,depth+1,&unsplitIS,depth+1,&numSplitPoints,depth+1,&numUnsplitPoints,depth+1,&numHybridPoints,depth+1,&splitPoints,depth+1,&unsplitPoints);CHKERRQ(ierr); 666607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 667607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthOffset, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 668a6ae58d1SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &depthMax[depth] : NULL, depth>1 ? &depthMax[depth-1] : NULL, depth>2 ? &depthMax[1] : NULL, depth >= 0 ? &depthMax[0] : NULL);CHKERRQ(ierr); 669607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 670607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 671a6ae58d1SMatthew G. Knepley depthEnd[d] = pMaxNew[d]; 672a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 673607ab7a9SMatthew G. Knepley numSplitPoints[d] = 0; 67418c5995bSMatthew G. Knepley numUnsplitPoints[d] = 0; 675607ab7a9SMatthew G. Knepley numHybridPoints[d] = 0; 676a6ae58d1SMatthew G. Knepley numHybridPointsOld[d] = depthMax[d] < 0 ? 0 : depthEnd[d] - depthMax[d]; 677607ab7a9SMatthew G. Knepley splitPoints[d] = NULL; 67818c5995bSMatthew G. Knepley unsplitPoints[d] = NULL; 67918c5995bSMatthew G. Knepley splitIS[d] = NULL; 68018c5995bSMatthew G. Knepley unsplitIS[d] = NULL; 681607ab7a9SMatthew G. Knepley } 682cd0c2139SMatthew G Knepley if (label) { 683cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 684cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 685cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 686cd0c2139SMatthew G Knepley } 687cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 688cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 689cd0c2139SMatthew G Knepley 690cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 69118c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr); 69218c5995bSMatthew G. Knepley if (splitIS[dep]) { 69318c5995bSMatthew G. Knepley ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 69418c5995bSMatthew G. Knepley ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 69518c5995bSMatthew G. Knepley } 69618c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr); 69718c5995bSMatthew G. Knepley if (unsplitIS[dep]) { 69818c5995bSMatthew G. Knepley ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr); 69918c5995bSMatthew G. Knepley ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr); 700cd0c2139SMatthew G Knepley } 701cd0c2139SMatthew G Knepley } 702607ab7a9SMatthew G. Knepley /* Calculate number of hybrid points */ 70318c5995bSMatthew G. Knepley for (d = 1; d <= depth; ++d) numHybridPoints[d] = numSplitPoints[d-1] + numUnsplitPoints[d-1]; /* There is a hybrid cell/face/edge for every split face/edge/vertex */ 704607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) depthShift[d] = numSplitPoints[d] + numHybridPoints[d]; 705607ab7a9SMatthew G. Knepley for (d = 1; d <= depth; ++d) depthOffset[depths[d]] = depthOffset[depths[d-1]] + depthShift[depths[d-1]]; 706a6ae58d1SMatthew G. Knepley for (d = 0; d <= depth; ++d) pMaxNew[d] += depthOffset[d] - numHybridPointsOld[d]; 707cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 708cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 709cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 710cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 711cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 712a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 7134c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 714cd0c2139SMatthew G Knepley const PetscInt *support; 7154c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, qf, qn, qp, e; 716cd0c2139SMatthew G Knepley 717cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 718cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 719cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 720cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 721cd0c2139SMatthew G Knepley if (dep == depth-1) { 7224c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 7234c367dbcSMatthew G. Knepley 724cd0c2139SMatthew G Knepley /* Add cohesive cells, they are prisms */ 7254c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr); 726cd0c2139SMatthew G Knepley } else if (dep == 0) { 7274c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 728cd0c2139SMatthew G Knepley 729cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 7304c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 731cd0c2139SMatthew G Knepley PetscInt val; 732cd0c2139SMatthew G Knepley 733cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 7344c367dbcSMatthew G. Knepley if (val == 1) ++qf; 7354c367dbcSMatthew G. Knepley if ((val == 1) || (val == (shift + 1))) ++qn; 7364c367dbcSMatthew G. Knepley if ((val == 1) || (val == -(shift + 1))) ++qp; 737cd0c2139SMatthew G Knepley } 7384c367dbcSMatthew G. Knepley /* Split old vertex: Edges into original vertex and new cohesive edge */ 7394c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 7404c367dbcSMatthew G. Knepley /* Split new vertex: Edges into split vertex and new cohesive edge */ 7414c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 7424c367dbcSMatthew G. Knepley /* Add hybrid edge */ 7434c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 7444c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 745cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 7464c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 7474c367dbcSMatthew G. Knepley 748cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 7494c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 750cd0c2139SMatthew G Knepley PetscInt val; 751cd0c2139SMatthew G Knepley 752cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 7534c367dbcSMatthew G. Knepley if (val == dim-1) ++qf; 7544c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 7554c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 756cd0c2139SMatthew G Knepley } 7574c367dbcSMatthew G. Knepley /* Split old edge: Faces into original edge and cohesive face (positive side?) */ 7584c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 7594c367dbcSMatthew G. Knepley /* Split new edge: Faces into split edge and cohesive face (negative side?) */ 7604c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 7614c367dbcSMatthew G. Knepley /* Add hybrid face */ 7624c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 7634c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 764cd0c2139SMatthew G Knepley } 765cd0c2139SMatthew G Knepley } 766cd0c2139SMatthew G Knepley } 76718c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 76818c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 76918c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 770a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 77118c5995bSMatthew G. Knepley const PetscInt *support; 772da1dd7e4SMatthew G. Knepley PetscInt coneSize, supportSize, qf, e, s; 77318c5995bSMatthew G. Knepley 77418c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 77518c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 77639254ff6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 77718c5995bSMatthew G. Knepley if (dep == 0) { 77818c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 77918c5995bSMatthew G. Knepley 78039254ff6SMatthew G. Knepley /* Unsplit vertex: Edges into original vertex, split edges, and new cohesive edge twice */ 78139254ff6SMatthew G. Knepley for (s = 0, qf = 0; s < supportSize; ++s, ++qf) { 78239254ff6SMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 78339254ff6SMatthew G. Knepley if (e >= 0) ++qf; 78439254ff6SMatthew G. Knepley } 78539254ff6SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 78618c5995bSMatthew G. Knepley /* Add hybrid edge */ 78718c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 788e1757548SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 789e1757548SMatthew G. Knepley PetscInt val; 790e1757548SMatthew G. Knepley 791e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 792e1757548SMatthew G. Knepley /* Split and unsplit edges produce hybrid faces */ 793da1dd7e4SMatthew G. Knepley if (val == 1) ++qf; 794da1dd7e4SMatthew G. Knepley if (val == (shift2 + 1)) ++qf; 795e1757548SMatthew G. Knepley } 796e1757548SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 79718c5995bSMatthew G. Knepley } else if (dep == dim-2) { 79818c5995bSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 799cd0c2139SMatthew G Knepley PetscInt val; 800cd0c2139SMatthew G Knepley 801da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 802cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 803da1dd7e4SMatthew G. Knepley if (val == dim-1) qf += 2; 804da1dd7e4SMatthew G. Knepley else ++qf; 805cd0c2139SMatthew G Knepley } 80618c5995bSMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */ 807da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 80818c5995bSMatthew G. Knepley /* Add hybrid face */ 809da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 810da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 811da1dd7e4SMatthew G. Knepley if (val == dim-1) ++qf; 812da1dd7e4SMatthew G. Knepley } 81318c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 814da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 815cd0c2139SMatthew G Knepley } 816cd0c2139SMatthew G Knepley } 817cd0c2139SMatthew G Knepley } 818cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 819cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 820cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 821dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 822dcca6d9dSJed Brown ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),&supportNew);CHKERRQ(ierr); 823cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 824cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 825cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 826cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 827a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 8284c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 829cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 8304c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, q, qf, qn, qp, v, e, s; 831cd0c2139SMatthew G Knepley 832cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 833cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 834cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 835cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 836cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 837cd0c2139SMatthew G Knepley if (dep == depth-1) { 83896a07cd0SMatthew G. Knepley PetscBool hasUnsplit = PETSC_FALSE; 8394c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 840cd0c2139SMatthew G Knepley const PetscInt *supportF; 841cd0c2139SMatthew G Knepley 842cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 843cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 844cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 845cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 846cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 847cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 8484c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 84918c5995bSMatthew G. Knepley if (v < 0) { 85018c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 85118c5995bSMatthew G. Knepley if (v < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate point %d in split or unsplit points of depth %d", cone[q], dep-1); 852a6ae58d1SMatthew G. Knepley coneNew[2+q] = DMPlexShiftPoint_Internal(cone[q], depth, depthMax, depthEnd, depthShift) /*cone[q] + depthOffset[dep-1]*/; 85396a07cd0SMatthew G. Knepley hasUnsplit = PETSC_TRUE; 85418c5995bSMatthew G. Knepley } else { 8554c367dbcSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep-1]; 856163235baSMatthew G. Knepley if (dep > 1) { 857163235baSMatthew G. Knepley const PetscInt *econe; 858163235baSMatthew G. Knepley PetscInt econeSize, r, vs, vu; 859163235baSMatthew G. Knepley 860163235baSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[q], &econeSize);CHKERRQ(ierr); 861163235baSMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[q], &econe);CHKERRQ(ierr); 862163235baSMatthew G. Knepley for (r = 0; r < econeSize; ++r) { 863163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numSplitPoints[dep-2], splitPoints[dep-2], &vs);CHKERRQ(ierr); 864163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numUnsplitPoints[dep-2], unsplitPoints[dep-2], &vu);CHKERRQ(ierr); 865163235baSMatthew G. Knepley if (vs >= 0) continue; 866163235baSMatthew G. Knepley if (vu < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate point %d in split or unsplit points of depth %d", econe[r], dep-2); 867163235baSMatthew G. Knepley hasUnsplit = PETSC_TRUE; 868163235baSMatthew G. Knepley } 869163235baSMatthew G. Knepley } 870cd0c2139SMatthew G Knepley } 871cd0c2139SMatthew G Knepley } 872cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 873cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 874e537020bSMatthew G. Knepley /* Face support */ 875cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 876cd0c2139SMatthew G Knepley PetscInt val; 877cd0c2139SMatthew G Knepley 878cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 879cd0c2139SMatthew G Knepley if (val < 0) { 880cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 8814c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr); 882cd0c2139SMatthew G Knepley } else { 883cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 8844c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr); 885e537020bSMatthew G. Knepley /* Get orientation for cohesive face */ 886e537020bSMatthew G. Knepley { 887e537020bSMatthew G. Knepley const PetscInt *ncone, *nconeO; 888e537020bSMatthew G. Knepley PetscInt nconeSize, nc; 889e537020bSMatthew G. Knepley 890e537020bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 891e537020bSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 892e537020bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 893e537020bSMatthew G. Knepley for (nc = 0; nc < nconeSize; ++nc) { 894e537020bSMatthew G. Knepley if (ncone[nc] == oldp) { 895e537020bSMatthew G. Knepley coneONew[0] = nconeO[nc]; 896e537020bSMatthew G. Knepley break; 897cd0c2139SMatthew G Knepley } 898cd0c2139SMatthew G Knepley } 899e537020bSMatthew G. Knepley if (nc >= nconeSize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate face %d in neighboring cell %d", oldp, support[s]); 900e537020bSMatthew G. Knepley } 901e537020bSMatthew G. Knepley } 902e537020bSMatthew G. Knepley } 9034c367dbcSMatthew G. Knepley /* Cohesive cell: Old and new split face, then new cohesive faces */ 904fd4b9f15SMatthew G. Knepley coneNew[0] = newp; /* Extracted negative side orientation above */ 9054c367dbcSMatthew G. Knepley coneNew[1] = splitp; 9064c367dbcSMatthew G. Knepley coneONew[1] = coneONew[0]; 907e537020bSMatthew G. Knepley for (q = 0; q < coneSize; ++q) { 90818c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 90918c5995bSMatthew G. Knepley if (v < 0) { 91018c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 91118c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 91218c5995bSMatthew G. Knepley coneONew[2+q] = 0; 91318c5995bSMatthew G. Knepley } else { 91418c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep]; 91518c5995bSMatthew G. Knepley } 916e537020bSMatthew G. Knepley coneONew[2+q] = 0; 917e537020bSMatthew G. Knepley } 9184c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr); 9194c367dbcSMatthew G. Knepley ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr); 92096a07cd0SMatthew G. Knepley /* Label the hybrid cells on the boundary of the split */ 92196a07cd0SMatthew G. Knepley if (hasUnsplit) {ierr = DMLabelSetValue(label, -hybcell, dim);CHKERRQ(ierr);} 922cd0c2139SMatthew G Knepley } else if (dep == 0) { 9234c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 924cd0c2139SMatthew G Knepley 925cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 9264c367dbcSMatthew G. Knepley for (e = 0, qn = 0; e < supportSize; ++e) { 927cd0c2139SMatthew G Knepley PetscInt val; 928cd0c2139SMatthew G Knepley 929cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 930cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 931a6ae58d1SMatthew G. Knepley supportNew[qn++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 932cd0c2139SMatthew G Knepley } 933cd0c2139SMatthew G Knepley } 9344c367dbcSMatthew G. Knepley supportNew[qn] = hybedge; 935cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 936cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 9374c367dbcSMatthew G. Knepley for (e = 0, qp = 0; e < supportSize; ++e) { 938cd0c2139SMatthew G Knepley PetscInt val, edge; 939cd0c2139SMatthew G Knepley 940cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 941cd0c2139SMatthew G Knepley if (val == 1) { 9424c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 943cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 9444c367dbcSMatthew G. Knepley supportNew[qp++] = edge + pMaxNew[dep+1]; 945cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 946a6ae58d1SMatthew G. Knepley supportNew[qp++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 947cd0c2139SMatthew G Knepley } 948cd0c2139SMatthew G Knepley } 9494c367dbcSMatthew G. Knepley supportNew[qp] = hybedge; 950cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 9514c367dbcSMatthew G. Knepley /* Hybrid edge: Old and new split vertex */ 952cd0c2139SMatthew G Knepley coneNew[0] = newp; 953cd0c2139SMatthew G Knepley coneNew[1] = splitp; 9544c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 9554c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 9564c367dbcSMatthew G. Knepley PetscInt val, edge; 9574c367dbcSMatthew G. Knepley 9584c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 9594c367dbcSMatthew G. Knepley if (val == 1) { 9604c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 9614c367dbcSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 9624c367dbcSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 9634c367dbcSMatthew G. Knepley } 9644c367dbcSMatthew G. Knepley } 9654c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 966cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 9674c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 9684c367dbcSMatthew G. Knepley 969cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 970cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 971cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 9724c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 973e1757548SMatthew G. Knepley if (v < 0) { 974e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 975e1757548SMatthew G. Knepley if (v < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate point %d in split or unsplit points of depth %d", cone[q], dep-1); 976a6ae58d1SMatthew G. Knepley coneNew[q] = DMPlexShiftPoint_Internal(cone[q], depth, depthMax, depthEnd, depthShift) /*cone[q] + depthOffset[dep-1]*/; 977e1757548SMatthew G. Knepley } else { 9784c367dbcSMatthew G. Knepley coneNew[q] = v + pMaxNew[dep-1]; 979cd0c2139SMatthew G Knepley } 980e1757548SMatthew G. Knepley } 981cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 982cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 983cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 984cd0c2139SMatthew G Knepley PetscInt val; 985cd0c2139SMatthew G Knepley 986cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 9874c367dbcSMatthew G. Knepley if (val == dim-1) { 988a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 9894c367dbcSMatthew G. Knepley } else if (val == (shift + dim-1)) { 990a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 991cd0c2139SMatthew G Knepley } 992cd0c2139SMatthew G Knepley } 993b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 994cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 995cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 996cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 997cd0c2139SMatthew G Knepley PetscInt val, face; 998cd0c2139SMatthew G Knepley 999cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1000cd0c2139SMatthew G Knepley if (val == dim-1) { 10014c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1002cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 10034c367dbcSMatthew G. Knepley supportNew[q++] = face + pMaxNew[dep+1]; 1004cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 1005a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 1006cd0c2139SMatthew G Knepley } 1007cd0c2139SMatthew G Knepley } 1008b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1009cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 10104c367dbcSMatthew G. Knepley /* Hybrid face */ 10114c367dbcSMatthew G. Knepley coneNew[0] = newp; 10124c367dbcSMatthew G. Knepley coneNew[1] = splitp; 10134c367dbcSMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 10144c367dbcSMatthew G. Knepley PetscInt vertex; 10154c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr); 1016e1757548SMatthew G. Knepley if (vertex < 0) { 1017e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr); 1018e1757548SMatthew G. Knepley if (vertex < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate point %d in split or unsplit points of depth %d", cone[v], dep-1); 1019e1757548SMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1020e1757548SMatthew G. Knepley } else { 10214c367dbcSMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep]; 10224c367dbcSMatthew G. Knepley } 1023e1757548SMatthew G. Knepley } 10244c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 10254c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 10264c367dbcSMatthew G. Knepley PetscInt val, face; 10274c367dbcSMatthew G. Knepley 10284c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 10294c367dbcSMatthew G. Knepley if (val == dim-1) { 10304c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 10314c367dbcSMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 10324c367dbcSMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 10334c367dbcSMatthew G. Knepley } 10344c367dbcSMatthew G. Knepley } 10354c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1036cd0c2139SMatthew G Knepley } 1037cd0c2139SMatthew G Knepley } 1038cd0c2139SMatthew G Knepley } 103918c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 104018c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 104118c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 1042a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 104318c5995bSMatthew G. Knepley const PetscInt *cone, *support, *ornt; 1044e1757548SMatthew G. Knepley PetscInt coneSize, supportSize, supportSizeNew, q, qf, e, f, s; 104518c5995bSMatthew G. Knepley 104618c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 104718c5995bSMatthew G. Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 104818c5995bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 104918c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 105018c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 105118c5995bSMatthew G. Knepley if (dep == 0) { 105218c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 105318c5995bSMatthew G. Knepley 105418c5995bSMatthew G. Knepley /* Unsplit vertex */ 105518c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 105618c5995bSMatthew G. Knepley for (s = 0, q = 0; s < supportSize; ++s) { 1057a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[s], depth, depthMax, depthEnd, depthShift) /*support[s] + depthOffset[dep+1]*/; 105818c5995bSMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 105918c5995bSMatthew G. Knepley if (e >= 0) { 106018c5995bSMatthew G. Knepley supportNew[q++] = e + pMaxNew[dep+1]; 106118c5995bSMatthew G. Knepley } 106218c5995bSMatthew G. Knepley } 106318c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 106418c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 106518c5995bSMatthew G. Knepley if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp); 106618c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 106718c5995bSMatthew G. Knepley /* Hybrid edge */ 106818c5995bSMatthew G. Knepley coneNew[0] = newp; 106918c5995bSMatthew G. Knepley coneNew[1] = newp; 107018c5995bSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 107118c5995bSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 107218c5995bSMatthew G. Knepley PetscInt val, edge; 107318c5995bSMatthew G. Knepley 107418c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 107518c5995bSMatthew G. Knepley if (val == 1) { 107618c5995bSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 107718c5995bSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 107818c5995bSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1079e1757548SMatthew G. Knepley } else if (val == (shift2 + 1)) { 1080e1757548SMatthew G. Knepley ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr); 1081e1757548SMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]); 1082e1757548SMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1]; 108318c5995bSMatthew G. Knepley } 108418c5995bSMatthew G. Knepley } 108518c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1086e1757548SMatthew G. Knepley } else if (dep == dim-2) { 1087e1757548SMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 1088e1757548SMatthew G. Knepley 1089da1dd7e4SMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and hybrid face twice */ 1090e1757548SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1091e1757548SMatthew G. Knepley PetscInt val, face; 1092e1757548SMatthew G. Knepley 1093e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1094e1757548SMatthew G. Knepley if (val == dim-1) { 1095e1757548SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1096e1757548SMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]); 1097a6ae58d1SMatthew G. Knepley supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthMax, depthEnd, depthShift) /*support[f] + depthOffset[dep+1]*/; 1098e1757548SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+1]; 1099e1757548SMatthew G. Knepley } else { 1100a6ae58d1SMatthew G. Knepley supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthMax, depthEnd, depthShift) /*support[f] + depthOffset[dep+1]*/; 1101e1757548SMatthew G. Knepley } 1102e1757548SMatthew G. Knepley } 1103e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1104e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1105da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 1106da1dd7e4SMatthew G. Knepley if (qf != supportSizeNew) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Support size for unsplit edge %d is %d != %d\n", newp, qf, supportSizeNew); 1107e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1108e1757548SMatthew G. Knepley /* Add hybrid face */ 1109e1757548SMatthew G. Knepley coneNew[0] = newp; 1110212cc919SMatthew G. Knepley coneNew[1] = newp; 1111e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[0], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1112e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[0]); 1113212cc919SMatthew G. Knepley coneNew[2] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1114e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1115e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]); 1116e1757548SMatthew G. Knepley coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1117e1757548SMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 1118da1dd7e4SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1119da1dd7e4SMatthew G. Knepley PetscInt val, face; 1120da1dd7e4SMatthew G. Knepley 1121da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1122da1dd7e4SMatthew G. Knepley if (val == dim-1) { 1123da1dd7e4SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1124da1dd7e4SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1125da1dd7e4SMatthew G. Knepley } 1126da1dd7e4SMatthew G. Knepley } 1127da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, hybface, &supportSizeNew);CHKERRQ(ierr); 1128da1dd7e4SMatthew G. Knepley if (qf != supportSizeNew) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Support size for hybrid face %d is %d != %d\n", hybface, qf, supportSizeNew); 1129e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1130cd0c2139SMatthew G Knepley } 1131cd0c2139SMatthew G Knepley } 1132cd0c2139SMatthew G Knepley } 1133cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 1134cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1135cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 1136cd0c2139SMatthew G Knepley IS pIS; 1137cd0c2139SMatthew G Knepley PetscInt numPoints; 1138cd0c2139SMatthew G Knepley const PetscInt *points; 1139cd0c2139SMatthew G Knepley 1140cd0c2139SMatthew G Knepley if (dep >= 0) continue; 1141cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 1142cd0c2139SMatthew G Knepley if (!pIS) continue; 1143cd0c2139SMatthew G Knepley dep = -dep - shift; 1144cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 1145cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 1146cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1147cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 1148a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*depthOffset[dep] + oldp*/; 1149cd0c2139SMatthew G Knepley const PetscInt *cone; 1150cd0c2139SMatthew G Knepley PetscInt coneSize, c; 115150cf782dSMatthew G. Knepley /* PetscBool replaced = PETSC_FALSE; */ 1152cd0c2139SMatthew G Knepley 1153cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 1154cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 1155cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 1156cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 1157cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1158cd0c2139SMatthew G Knepley const PetscInt coldp = cone[c] - depthOffset[dep-1]; 1159cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 1160cd0c2139SMatthew G Knepley 1161cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 1162cd0c2139SMatthew G Knepley if (val == dep-1) { 1163cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 1164cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 1165cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 1166cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 116750cf782dSMatthew G. Knepley /* replaced = PETSC_TRUE; */ 1168cd0c2139SMatthew G Knepley } 1169cd0c2139SMatthew G Knepley } 11704a189a86SMatthew G. Knepley /* Cells with only a vertex or edge on the submesh have no replacement */ 11714a189a86SMatthew G. Knepley /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 1172cd0c2139SMatthew G Knepley } 1173cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 1174cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 1175cd0c2139SMatthew G Knepley } 1176cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 1177cd0c2139SMatthew G Knepley ierr = DMPlexStratify(sdm);CHKERRQ(ierr); 1178cd0c2139SMatthew G Knepley /* Step 8: Coordinates */ 1179cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 118069d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 1181cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 1182cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 1183cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 1184a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[0][v], depth, depthMax, depthEnd, depthShift) /*depthOffset[0] + splitPoints[0][v]*/; 1185cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 1186cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 1187cd0c2139SMatthew G Knepley 1188cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 1189cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 1190cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 1191cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 1192cd0c2139SMatthew G Knepley } 1193cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 1194cd0c2139SMatthew G Knepley /* Step 9: SF, if I can figure this out we can split the mesh in parallel */ 1195cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1196cd0c2139SMatthew G Knepley /* Step 10: Labels */ 1197cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1198cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 1199cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1200cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 1201a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[dep][p], depth, depthMax, depthEnd, depthShift) /*depthOffset[dep] + splitPoints[dep][p]*/; 1202cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 1203cd0c2139SMatthew G Knepley PetscInt l; 1204cd0c2139SMatthew G Knepley 1205cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 1206cd0c2139SMatthew G Knepley DMLabel mlabel; 1207cd0c2139SMatthew G Knepley const char *lname; 1208cd0c2139SMatthew G Knepley PetscInt val; 12099a356370SMatthew G. Knepley PetscBool isDepth; 1210cd0c2139SMatthew G Knepley 1211cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 12129a356370SMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 12139a356370SMatthew G. Knepley if (isDepth) continue; 1214cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 1215cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 1216cd0c2139SMatthew G Knepley if (val >= 0) { 1217cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 12189a356370SMatthew G. Knepley #if 0 12199a356370SMatthew G. Knepley /* Do not put cohesive edges into the label */ 1220cd0c2139SMatthew G Knepley if (dep == 0) { 12214c367dbcSMatthew G. Knepley const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1222cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr); 12234c367dbcSMatthew G. Knepley } else if (dep == dim-2) { 12244c367dbcSMatthew G. Knepley const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 12254c367dbcSMatthew G. Knepley ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr); 1226cd0c2139SMatthew G Knepley } 12274c367dbcSMatthew G. Knepley /* Do not put cohesive faces into the label */ 12289a356370SMatthew G. Knepley #endif 1229cd0c2139SMatthew G Knepley } 1230cd0c2139SMatthew G Knepley } 1231cd0c2139SMatthew G Knepley } 1232cd0c2139SMatthew G Knepley } 1233cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1234cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 1235cd0c2139SMatthew G Knepley 1236cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 123718c5995bSMatthew G. Knepley if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 123818c5995bSMatthew G. Knepley ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr); 123918c5995bSMatthew G. Knepley if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);} 124018c5995bSMatthew G. Knepley ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr); 1241cd0c2139SMatthew G Knepley } 1242cd0c2139SMatthew G Knepley if (label) { 1243cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1244cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1245cd0c2139SMatthew G Knepley } 12460d4d4d06SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 12470d4d4d06SMatthew G. Knepley ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr); 124836dbac82SMatthew G. Knepley pMaxNew[d] = pEnd - numHybridPoints[d] - numHybridPointsOld[d]; 12490d4d4d06SMatthew G. Knepley } 12500e49e2e2SMatthew G. Knepley ierr = DMPlexSetHybridBounds(sdm, depth >= 0 ? pMaxNew[depth] : PETSC_DETERMINE, depth>1 ? pMaxNew[depth-1] : PETSC_DETERMINE, depth>2 ? pMaxNew[1] : PETSC_DETERMINE, depth >= 0 ? pMaxNew[0] : PETSC_DETERMINE);CHKERRQ(ierr); 1251dcbb62e8SMatthew G. Knepley ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr); 1252a6ae58d1SMatthew G. Knepley ierr = PetscFree6(depthMax, depthEnd, depthShift, depthOffset, pMaxNew, numHybridPointsOld);CHKERRQ(ierr); 125318c5995bSMatthew G. Knepley ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr); 1254cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1255cd0c2139SMatthew G Knepley } 1256cd0c2139SMatthew G Knepley 1257cd0c2139SMatthew G Knepley #undef __FUNCT__ 1258cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells" 1259cd0c2139SMatthew G Knepley /*@C 1260cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 1261cd0c2139SMatthew G Knepley 1262cd0c2139SMatthew G Knepley Collective on dm 1263cd0c2139SMatthew G Knepley 1264cd0c2139SMatthew G Knepley Input Parameters: 1265cd0c2139SMatthew G Knepley + dm - The original DM 126653156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated) 1267cd0c2139SMatthew G Knepley 1268cd0c2139SMatthew G Knepley Output Parameters: 1269cd0c2139SMatthew G Knepley - dmSplit - The new DM 1270cd0c2139SMatthew G Knepley 1271cd0c2139SMatthew G Knepley Level: developer 1272cd0c2139SMatthew G Knepley 12732be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 1274cd0c2139SMatthew G Knepley @*/ 1275cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 1276cd0c2139SMatthew G Knepley { 1277cd0c2139SMatthew G Knepley DM sdm; 1278cd0c2139SMatthew G Knepley PetscInt dim; 1279cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1280cd0c2139SMatthew G Knepley 1281cd0c2139SMatthew G Knepley PetscFunctionBegin; 1282cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 128353156dfcSMatthew G. Knepley PetscValidPointer(dmSplit, 3); 1284cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 1285cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 1286cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1287cd0c2139SMatthew G Knepley ierr = DMPlexSetDimension(sdm, dim);CHKERRQ(ierr); 1288cd0c2139SMatthew G Knepley switch (dim) { 1289cd0c2139SMatthew G Knepley case 2: 1290cd0c2139SMatthew G Knepley case 3: 1291cd0c2139SMatthew G Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 1292cd0c2139SMatthew G Knepley break; 1293cd0c2139SMatthew G Knepley default: 1294cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 1295cd0c2139SMatthew G Knepley } 1296cd0c2139SMatthew G Knepley *dmSplit = sdm; 1297cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1298cd0c2139SMatthew G Knepley } 1299cd0c2139SMatthew G Knepley 1300cd0c2139SMatthew G Knepley #undef __FUNCT__ 13012be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete" 1302cd0c2139SMatthew G Knepley /*@ 13032be2b188SMatthew G Knepley DMPlexLabelCohesiveComplete - Starting with a label marking vertices on an internal surface, we add all other mesh pieces 1304cd0c2139SMatthew G Knepley to complete the surface 1305cd0c2139SMatthew G Knepley 1306cd0c2139SMatthew G Knepley Input Parameters: 1307cd0c2139SMatthew G Knepley + dm - The DM 130847946fd8SMatthew G. Knepley . label - A DMLabel marking the surface vertices 1309bb55d314SMatthew G. Knepley . flip - Flag to flip the submesh normal and replace points on the other side 131047946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL 1311cd0c2139SMatthew G Knepley 1312cd0c2139SMatthew G Knepley Output Parameter: 1313cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 1314cd0c2139SMatthew G Knepley 1315cd0c2139SMatthew G Knepley Level: developer 1316cd0c2139SMatthew G Knepley 13172be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 1318cd0c2139SMatthew G Knepley @*/ 1319bb55d314SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, PetscBool flip, DM subdm) 1320cd0c2139SMatthew G Knepley { 1321d90583fdSMatthew G. Knepley DMLabel depthLabel; 132218c5995bSMatthew G. Knepley IS dimIS, subpointIS, facePosIS, faceNegIS; 132347946fd8SMatthew G. Knepley const PetscInt *points, *subpoints; 1324bb55d314SMatthew G. Knepley const PetscInt rev = flip ? -1 : 1; 132518c5995bSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, dim, dep, cStart, cEnd, numPoints, numSubpoints, p, val; 1326cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1327cd0c2139SMatthew G Knepley 1328cd0c2139SMatthew G Knepley PetscFunctionBegin; 1329d90583fdSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 1330cd0c2139SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 133147946fd8SMatthew G. Knepley if (subdm) { 133247946fd8SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 133347946fd8SMatthew G. Knepley if (subpointIS) { 133447946fd8SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 133547946fd8SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 133647946fd8SMatthew G. Knepley } 133747946fd8SMatthew G. Knepley } 1338d7c8f101SMatthew G. Knepley /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */ 1339cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 1340cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1341cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1342cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1343d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */ 1344cd0c2139SMatthew G Knepley const PetscInt *support; 1345cd0c2139SMatthew G Knepley PetscInt supportSize, s; 1346cd0c2139SMatthew G Knepley 1347cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1348cd0c2139SMatthew G Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 1349cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1350cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1351cd0c2139SMatthew G Knepley const PetscInt *cone, *ornt; 1352cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1353cd0c2139SMatthew G Knepley PetscBool pos = PETSC_TRUE; 1354cd0c2139SMatthew G Knepley 1355cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1356cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1357cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 1358cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1359cd0c2139SMatthew G Knepley if (cone[c] == points[p]) { 136047946fd8SMatthew G. Knepley PetscInt o = ornt[c]; 136147946fd8SMatthew G. Knepley 136247946fd8SMatthew G. Knepley if (subdm) { 136347946fd8SMatthew G. Knepley const PetscInt *subcone, *subornt; 136447946fd8SMatthew G. Knepley PetscInt subpoint, subface, subconeSize, sc; 136547946fd8SMatthew G. Knepley 136647946fd8SMatthew G. Knepley ierr = PetscFindInt(support[s], numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 136747946fd8SMatthew G. Knepley ierr = PetscFindInt(points[p], numSubpoints, subpoints, &subface);CHKERRQ(ierr); 136847946fd8SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 136947946fd8SMatthew G. Knepley ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 137047946fd8SMatthew G. Knepley ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 137147946fd8SMatthew G. Knepley for (sc = 0; sc < subconeSize; ++sc) { 137247946fd8SMatthew G. Knepley if (subcone[sc] == subface) { 137347946fd8SMatthew G. Knepley o = subornt[0]; 137447946fd8SMatthew G. Knepley break; 137547946fd8SMatthew G. Knepley } 137647946fd8SMatthew G. Knepley } 137747946fd8SMatthew G. Knepley if (sc >= subconeSize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find point %d in cone for subpoint %d", points[p], subpoint); 137847946fd8SMatthew G. Knepley } 137947946fd8SMatthew G. Knepley if (o >= 0) { 1380bb55d314SMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr); 1381ffaa4bbcSMatthew G. Knepley pos = rev > 0 ? PETSC_TRUE : PETSC_FALSE; 1382cd0c2139SMatthew G Knepley } else { 1383bb55d314SMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr); 1384ffaa4bbcSMatthew G. Knepley pos = rev > 0 ? PETSC_FALSE : PETSC_TRUE; 1385cd0c2139SMatthew G Knepley } 1386cd0c2139SMatthew G Knepley break; 1387cd0c2139SMatthew G Knepley } 1388cd0c2139SMatthew G Knepley } 1389cd0c2139SMatthew G Knepley if (c == coneSize) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Cell split face %d support does not have it in the cone", points[p]); 1390cd0c2139SMatthew G Knepley /* Put faces touching the fault in the label */ 1391cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1392cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 1393cd0c2139SMatthew G Knepley 1394cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1395cd0c2139SMatthew G Knepley if (val == -1) { 1396cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 1397cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 1398cd0c2139SMatthew G Knepley 1399cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1400cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1401cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 1402cd0c2139SMatthew G Knepley 1403cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1404cd0c2139SMatthew G Knepley if ((val >= 0) && (val < dim-1)) { 1405cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1406cd0c2139SMatthew G Knepley break; 1407cd0c2139SMatthew G Knepley } 1408cd0c2139SMatthew G Knepley } 1409cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1410cd0c2139SMatthew G Knepley } 1411cd0c2139SMatthew G Knepley } 1412cd0c2139SMatthew G Knepley } 1413cd0c2139SMatthew G Knepley } 141447946fd8SMatthew G. Knepley if (subdm) { 141547946fd8SMatthew G. Knepley if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 141647946fd8SMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 141747946fd8SMatthew G. Knepley } 1418cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1419cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1420cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1421cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1422cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 1423cd0c2139SMatthew G Knepley if (!dimIS) PetscFunctionReturn(0); 1424cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1425cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1426d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */ 1427cd0c2139SMatthew G Knepley PetscInt *star = NULL; 1428cd0c2139SMatthew G Knepley PetscInt starSize, s; 1429cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1430cd0c2139SMatthew G Knepley 1431d4622b2cSMatthew G. Knepley /* All points connected to the fault are inside a cell, so at the top level we will only check cells */ 1432cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1433cd0c2139SMatthew G Knepley while (again) { 1434cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1435cd0c2139SMatthew G Knepley again = 0; 1436cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1437cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1438cd0c2139SMatthew G Knepley const PetscInt *cone; 1439cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1440cd0c2139SMatthew G Knepley 1441cd0c2139SMatthew G Knepley if ((point < cStart) || (point >= cEnd)) continue; 1442cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1443cd0c2139SMatthew G Knepley if (val != -1) continue; 1444d4622b2cSMatthew G. Knepley again = again == 1 ? 1 : 2; 1445cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1446cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1447cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1448cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1449cd0c2139SMatthew G Knepley if (val != -1) { 1450d7c8f101SMatthew G. Knepley const PetscInt *ccone; 1451166d9d0cSMatthew G. Knepley PetscInt cconeSize, cc, side; 1452d7c8f101SMatthew G. Knepley 1453cd0c2139SMatthew G Knepley if (abs(val) < shift) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d on cell %d has an invalid label %d", cone[c], point, val); 145437a6de01SMatthew G. Knepley if (val > 0) side = 1; 145537a6de01SMatthew G. Knepley else side = -1; 145637a6de01SMatthew G. Knepley ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr); 1457d7c8f101SMatthew G. Knepley /* Mark cell faces which touch the fault */ 1458d7c8f101SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr); 1459d7c8f101SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr); 1460d7c8f101SMatthew G. Knepley for (cc = 0; cc < cconeSize; ++cc) { 1461d7c8f101SMatthew G. Knepley PetscInt *closure = NULL; 1462d7c8f101SMatthew G. Knepley PetscInt closureSize, cl; 1463d7c8f101SMatthew G. Knepley 1464166d9d0cSMatthew G. Knepley ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr); 1465166d9d0cSMatthew G. Knepley if (val != -1) continue; 1466d7c8f101SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1467d4622b2cSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1468d7c8f101SMatthew G. Knepley const PetscInt clp = closure[cl]; 1469d7c8f101SMatthew G. Knepley 1470d7c8f101SMatthew G. Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1471d7c8f101SMatthew G. Knepley if (val == -1) continue; 1472d7c8f101SMatthew G. Knepley ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr); 147337a6de01SMatthew G. Knepley break; 147437a6de01SMatthew G. Knepley } 1475d7c8f101SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1476cd0c2139SMatthew G Knepley } 1477cd0c2139SMatthew G Knepley again = 1; 1478cd0c2139SMatthew G Knepley break; 1479cd0c2139SMatthew G Knepley } 1480cd0c2139SMatthew G Knepley } 1481cd0c2139SMatthew G Knepley } 1482cd0c2139SMatthew G Knepley } 1483cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1484cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1485cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1486cd0c2139SMatthew G Knepley 1487cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1488cd0c2139SMatthew G Knepley if (val == -1) { 1489cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1490cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1491cd0c2139SMatthew G Knepley PetscBool marked = PETSC_FALSE; 1492cd0c2139SMatthew G Knepley 1493cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1494cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1495cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1496cd0c2139SMatthew G Knepley 1497cd0c2139SMatthew G Knepley if ((spoint < cStart) || (spoint >= cEnd)) continue; 1498cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1499cd0c2139SMatthew G Knepley if (val == -1) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d in star of %d does not have a valid label", spoint, point); 1500d90583fdSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1501cd0c2139SMatthew G Knepley if (val > 0) { 1502cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1503cd0c2139SMatthew G Knepley } else { 1504cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1505cd0c2139SMatthew G Knepley } 1506cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1507cd0c2139SMatthew G Knepley break; 1508cd0c2139SMatthew G Knepley } 1509cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1510cd0c2139SMatthew G Knepley if (!marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1511cd0c2139SMatthew G Knepley } 1512cd0c2139SMatthew G Knepley } 1513cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1514cd0c2139SMatthew G Knepley } 1515cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1516cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 151718c5995bSMatthew G. Knepley /* If any faces touching the fault divide cells on either side, split them */ 151818c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift+dim-1, &facePosIS);CHKERRQ(ierr); 151918c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr); 152018c5995bSMatthew G. Knepley ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr); 152118c5995bSMatthew G. Knepley ierr = ISDestroy(&facePosIS);CHKERRQ(ierr); 152218c5995bSMatthew G. Knepley ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr); 152318c5995bSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 152418c5995bSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 152518c5995bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 152618c5995bSMatthew G. Knepley const PetscInt point = points[p]; 152718c5995bSMatthew G. Knepley const PetscInt *support; 152818c5995bSMatthew G. Knepley PetscInt supportSize, valA, valB; 152918c5995bSMatthew G. Knepley 153018c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 153118c5995bSMatthew G. Knepley if (supportSize != 2) continue; 153218c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 153318c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr); 153418c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr); 153518c5995bSMatthew G. Knepley if ((valA == -1) || (valB == -1)) continue; 153618c5995bSMatthew G. Knepley if (valA*valB > 0) continue; 153718c5995bSMatthew G. Knepley /* Split the face */ 153818c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr); 153918c5995bSMatthew G. Knepley ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr); 154018c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr); 1541e1757548SMatthew G. Knepley /* Label its closure: 1542e1757548SMatthew G. Knepley unmarked: label as unsplit 1543e1757548SMatthew G. Knepley incident: relabel as split 1544e1757548SMatthew G. Knepley split: do nothing 1545e1757548SMatthew G. Knepley */ 154618c5995bSMatthew G. Knepley { 154718c5995bSMatthew G. Knepley PetscInt *closure = NULL; 154818c5995bSMatthew G. Knepley PetscInt closureSize, cl; 154918c5995bSMatthew G. Knepley 155018c5995bSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 155118c5995bSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 155218c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr); 15538771c1d3SMatthew G. Knepley if (valA == -1) { /* Mark as unsplit */ 155418c5995bSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 155518c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr); 15568771c1d3SMatthew G. Knepley } else if (((valA >= shift) && (valA < shift2)) || ((valA <= -shift) && (valA > -shift2))) { 1557e1757548SMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 1558e1757548SMatthew G. Knepley ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr); 1559e1757548SMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr); 1560e1757548SMatthew G. Knepley } 156118c5995bSMatthew G. Knepley } 156218c5995bSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 156318c5995bSMatthew G. Knepley } 156418c5995bSMatthew G. Knepley } 156518c5995bSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 156618c5995bSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1567cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1568cd0c2139SMatthew G Knepley } 1569cd0c2139SMatthew G Knepley 1570cd0c2139SMatthew G Knepley #undef __FUNCT__ 15713cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh" 15723cf72582SMatthew G. Knepley /*@C 15733cf72582SMatthew G. Knepley DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface 15743cf72582SMatthew G. Knepley 15753cf72582SMatthew G. Knepley Collective on dm 15763cf72582SMatthew G. Knepley 15773cf72582SMatthew G. Knepley Input Parameters: 15783cf72582SMatthew G. Knepley + dm - The original DM 15793cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices 15803cf72582SMatthew G. Knepley 15813cf72582SMatthew G. Knepley Output Parameters: 15823cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface 15833cf72582SMatthew G. Knepley - dmHybrid - The new DM 15843cf72582SMatthew G. Knepley 15853cf72582SMatthew G. Knepley Level: developer 15863cf72582SMatthew G. Knepley 15873cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate() 15883cf72582SMatthew G. Knepley @*/ 15893cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid) 15903cf72582SMatthew G. Knepley { 15913cf72582SMatthew G. Knepley DM idm; 15923cf72582SMatthew G. Knepley DMLabel subpointMap, hlabel; 15933cf72582SMatthew G. Knepley PetscInt dim; 15943cf72582SMatthew G. Knepley PetscErrorCode ierr; 15953cf72582SMatthew G. Knepley 15963cf72582SMatthew G. Knepley PetscFunctionBegin; 15973cf72582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 15983cf72582SMatthew G. Knepley if (hybridLabel) PetscValidPointer(hybridLabel, 3); 15993cf72582SMatthew G. Knepley PetscValidPointer(dmHybrid, 4); 16003cf72582SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 16013cf72582SMatthew G. Knepley ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr); 16023cf72582SMatthew G. Knepley ierr = DMPlexOrient(idm);CHKERRQ(ierr); 16033cf72582SMatthew G. Knepley ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr); 16043cf72582SMatthew G. Knepley ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr); 16053cf72582SMatthew G. Knepley ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr); 16063cf72582SMatthew G. Knepley ierr = DMPlexLabelCohesiveComplete(dm, hlabel, PETSC_FALSE, idm);CHKERRQ(ierr); 16073cf72582SMatthew G. Knepley ierr = DMDestroy(&idm);CHKERRQ(ierr); 16083cf72582SMatthew G. Knepley ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr); 16093cf72582SMatthew G. Knepley if (hybridLabel) *hybridLabel = hlabel; 161053aa2e23SMatthew G. Knepley else {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);} 1611e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1612e6ccafaeSMatthew G Knepley } 1613e6ccafaeSMatthew G Knepley 1614e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1615efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated" 1616efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 1617efa14ee0SMatthew G Knepley 1618efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 1619efa14ee0SMatthew G Knepley */ 1620830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1621efa14ee0SMatthew G Knepley { 1622fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 1623efa14ee0SMatthew G Knepley const PetscInt *subvertices; 162477d178adSMatthew G. Knepley PetscInt *pStart, *pEnd, *pMax, pSize; 1625efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1626efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1627efa14ee0SMatthew G Knepley 1628efa14ee0SMatthew G Knepley PetscFunctionBegin; 1629efa14ee0SMatthew G Knepley *numFaces = 0; 1630efa14ee0SMatthew G Knepley *nFV = 0; 1631efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1632efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 163377d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1634dcca6d9dSJed Brown ierr = PetscMalloc3(pSize,&pStart,pSize,&pEnd,pSize,&pMax);CHKERRQ(ierr); 1635d92e47f8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &pMax[depth] : NULL, depth>1 ? &pMax[depth-1] : NULL, depth>2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1636efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 1637efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1638efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1639efa14ee0SMatthew G Knepley } 1640efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1641fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1642efa14ee0SMatthew G Knepley if (subvertexIS) { 1643efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1644efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1645efa14ee0SMatthew G Knepley } 1646efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1647efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 16480298fd71SBarry Smith PetscInt *star = NULL; 1649efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 1650efa14ee0SMatthew G Knepley 1651efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1652efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1653efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1654efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1655efa14ee0SMatthew G Knepley } 1656efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 1657efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 16580298fd71SBarry Smith PetscInt *closure = NULL; 1659efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 1660efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 1661efa14ee0SMatthew G Knepley 1662efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 166365560c7fSMatthew G Knepley if (cellLoc == 2) continue; 166482f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1665efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1666efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1667efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1668efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1669efa14ee0SMatthew G Knepley 1670efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1671efa14ee0SMatthew G Knepley ++numCorners; 1672efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1673830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 1674efa14ee0SMatthew G Knepley } 1675efa14ee0SMatthew G Knepley } 167618ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 167782f516ccSBarry Smith if (faceSize > *nFV) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 1678efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 1679007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 1680007baee2SMatthew G. Knepley PetscInt numCells, nc; 1681007baee2SMatthew G. Knepley 1682efa14ee0SMatthew G Knepley ++(*numFaces); 1683efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 1684efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 1685efa14ee0SMatthew G Knepley } 1686007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1687007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 1688007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 1689007baee2SMatthew G. Knepley } 1690007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1691efa14ee0SMatthew G Knepley } 1692efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1693efa14ee0SMatthew G Knepley } 1694efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1695efa14ee0SMatthew G Knepley } 1696efa14ee0SMatthew G Knepley if (subvertexIS) { 1697efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1698efa14ee0SMatthew G Knepley } 1699efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1700efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1701efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1702efa14ee0SMatthew G Knepley } 1703efa14ee0SMatthew G Knepley 1704efa14ee0SMatthew G Knepley #undef __FUNCT__ 1705efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated" 1706830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 1707efa14ee0SMatthew G Knepley { 1708efa14ee0SMatthew G Knepley IS subvertexIS; 1709efa14ee0SMatthew G Knepley const PetscInt *subvertices; 1710efa14ee0SMatthew G Knepley PetscInt *pStart, *pEnd, *pMax; 1711efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 1712efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1713efa14ee0SMatthew G Knepley 1714efa14ee0SMatthew G Knepley PetscFunctionBegin; 1715efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1716dcca6d9dSJed Brown ierr = PetscMalloc3(dim+1,&pStart,dim+1,&pEnd,dim+1,&pMax);CHKERRQ(ierr); 17170298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1718efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 1719efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1720efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1721efa14ee0SMatthew G Knepley } 1722efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1723830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 1724efa14ee0SMatthew G Knepley if (subvertexIS) { 1725efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1726efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1727efa14ee0SMatthew G Knepley } 1728efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1729efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 17300298fd71SBarry Smith PetscInt *star = NULL; 1731efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 1732efa14ee0SMatthew G Knepley 1733efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1734efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1735efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1736efa14ee0SMatthew G Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 1737efa14ee0SMatthew G Knepley } 1738efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 1739efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 17400298fd71SBarry Smith PetscInt *closure = NULL; 1741efa14ee0SMatthew G Knepley PetscInt closureSize, c; 1742efa14ee0SMatthew G Knepley PetscInt faceLoc; 1743efa14ee0SMatthew G Knepley 1744efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 1745efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 174682f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 1747efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1748efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1749efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1750efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1751efa14ee0SMatthew G Knepley 1752efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1753efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1754830e53efSMatthew G. Knepley if (vertexLoc != value) break; 1755efa14ee0SMatthew G Knepley } 1756efa14ee0SMatthew G Knepley } 1757efa14ee0SMatthew G Knepley if (c == closureSize*2) { 1758efa14ee0SMatthew G Knepley const PetscInt *support; 1759efa14ee0SMatthew G Knepley PetscInt supportSize, s; 1760efa14ee0SMatthew G Knepley 1761efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1762efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1763efa14ee0SMatthew G Knepley 1764efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 1765efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1766efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1767efa14ee0SMatthew G Knepley break; 1768efa14ee0SMatthew G Knepley } 1769efa14ee0SMatthew G Knepley } 1770efa14ee0SMatthew G Knepley } 1771efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 1772efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 1773efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1774efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1775efa14ee0SMatthew G Knepley } 1776efa14ee0SMatthew G Knepley } 1777efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1778efa14ee0SMatthew G Knepley } 1779efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1780efa14ee0SMatthew G Knepley } 1781efa14ee0SMatthew G Knepley if (subvertexIS) { 1782efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1783efa14ee0SMatthew G Knepley } 1784efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1785efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1786efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1787efa14ee0SMatthew G Knepley } 1788efa14ee0SMatthew G Knepley 1789efa14ee0SMatthew G Knepley #undef __FUNCT__ 1790766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated" 179127c04023SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char labelname[], PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, PetscInt *subCells[], DM subdm) 1792766ab985SMatthew G. Knepley { 179327c04023SMatthew G. Knepley DMLabel label = NULL; 1794766ab985SMatthew G. Knepley const PetscInt *cone; 179527234c99SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize; 1796766ab985SMatthew G. Knepley PetscErrorCode ierr; 1797766ab985SMatthew G. Knepley 1798812bfc34SJed Brown PetscFunctionBegin; 1799c0ed958bSJed Brown *numFaces = 0; 1800c0ed958bSJed Brown *nFV = 0; 1801b6d5cb33SJed Brown if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1802fed694aaSMatthew G. Knepley *subCells = NULL; 1803766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1804766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1805766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1806766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 180727c04023SMatthew G. Knepley if (label) { 180827c04023SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 180927c04023SMatthew G. Knepley PetscInt val; 181027c04023SMatthew G. Knepley 181127c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 181227c04023SMatthew G. Knepley if (val == value) { 181327c04023SMatthew G. Knepley ++(*numFaces); 181427c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 181527c04023SMatthew G. Knepley } 181627c04023SMatthew G. Knepley } 181727c04023SMatthew G. Knepley } else { 1818766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 181927c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 182027c04023SMatthew G. Knepley } 1821766ab985SMatthew G. Knepley *nFV = hasLagrange ? coneSize/3 : coneSize/2; 1822785e854fSJed Brown ierr = PetscMalloc1(*numFaces *2, subCells);CHKERRQ(ierr); 1823766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1824766ab985SMatthew G. Knepley const PetscInt *cells; 1825766ab985SMatthew G. Knepley PetscInt numCells; 1826766ab985SMatthew G. Knepley 182727c04023SMatthew G. Knepley if (label) { 182827c04023SMatthew G. Knepley PetscInt val; 182927c04023SMatthew G. Knepley 183027c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 183127c04023SMatthew G. Knepley if (val != value) continue; 183227c04023SMatthew G. Knepley } 1833766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1834766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 1835766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 1836766ab985SMatthew G. Knepley } 1837766ab985SMatthew G. Knepley /* Negative face */ 1838766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 183927234c99SMatthew G. Knepley /* Not true in parallel 184027234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 1841766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 1842766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 184327234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 1844766ab985SMatthew G. Knepley } 1845766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 1846766ab985SMatthew G. Knepley /* Positive face is not included */ 1847766ab985SMatthew G. Knepley } 1848766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1849766ab985SMatthew G. Knepley } 1850766ab985SMatthew G. Knepley 1851766ab985SMatthew G. Knepley #undef __FUNCT__ 1852766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated" 1853b3154360SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DMLabel subpointMap, DM subdm) 1854766ab985SMatthew G. Knepley { 185527c04023SMatthew G. Knepley DMLabel label = NULL; 1856766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 1857766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 1858766ab985SMatthew G. Knepley PetscErrorCode ierr; 1859766ab985SMatthew G. Knepley 1860812bfc34SJed Brown PetscFunctionBegin; 186127c04023SMatthew G. Knepley if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1862766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1863766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1864766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1865766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 1866dcca6d9dSJed Brown ierr = PetscMalloc2(dim+1,&pStart,dim+1,&pEnd);CHKERRQ(ierr); 1867b3154360SMatthew G. Knepley for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);} 1868766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1869766ab985SMatthew G. Knepley const PetscInt *cone; 1870766ab985SMatthew G. Knepley PetscInt *closure = NULL; 1871b3154360SMatthew G. Knepley PetscInt fconeSize, coneSize, closureSize, cl, val; 1872766ab985SMatthew G. Knepley 187327c04023SMatthew G. Knepley if (label) { 187427c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 187527c04023SMatthew G. Knepley if (val != value) continue; 187627c04023SMatthew G. Knepley } 1877766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 1878766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1879b3154360SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr); 1880b3154360SMatthew G. Knepley if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 1881b3154360SMatthew G. Knepley /* Negative face */ 1882766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1883766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1884766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 1885766ab985SMatthew G. Knepley 1886766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 1887766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1888766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1889766ab985SMatthew G. Knepley break; 1890766ab985SMatthew G. Knepley } 1891766ab985SMatthew G. Knepley } 1892766ab985SMatthew G. Knepley } 1893766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1894766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 1895766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 1896766ab985SMatthew G. Knepley const PetscInt *support; 1897766ab985SMatthew G. Knepley PetscInt supportSize, s; 1898766ab985SMatthew G. Knepley 1899766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 1900711de394SMatthew G. Knepley /* if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); */ 1901766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 1902766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 1903766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1904766ab985SMatthew G. Knepley } 1905766ab985SMatthew G. Knepley } 1906766ab985SMatthew G. Knepley } 1907766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 1908766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1909766ab985SMatthew G. Knepley } 1910766ab985SMatthew G. Knepley 1911766ab985SMatthew G. Knepley #undef __FUNCT__ 1912e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation" 1913e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 1914e6ccafaeSMatthew G Knepley { 191582f516ccSBarry Smith MPI_Comm comm; 1916e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 1917e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 1918e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 1919e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 1920e6ccafaeSMatthew G Knepley 192182f516ccSBarry Smith PetscFunctionBegin; 192282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1923e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &cellDim);CHKERRQ(ierr); 1924e6ccafaeSMatthew G Knepley if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 1925e6ccafaeSMatthew G Knepley 1926ddeab2a6SMatthew G. Knepley if (cellDim == 1 && numCorners == 2) { 1927ddeab2a6SMatthew G. Knepley /* Triangle */ 1928e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 1929e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1930ddeab2a6SMatthew G. Knepley } else if (cellDim == 2 && numCorners == 3) { 1931ddeab2a6SMatthew G. Knepley /* Triangle */ 1932ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 1933ddeab2a6SMatthew G. Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1934ddeab2a6SMatthew G. Knepley } else if (cellDim == 3 && numCorners == 4) { 1935ddeab2a6SMatthew G. Knepley /* Tetrahedron */ 1936ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 1937ddeab2a6SMatthew G. Knepley posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1938e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 1939e6ccafaeSMatthew G Knepley /* Quadratic line */ 1940e6ccafaeSMatthew G Knepley faceSize = 1; 1941e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1942e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 1943e6ccafaeSMatthew G Knepley /* Quads */ 1944e6ccafaeSMatthew G Knepley faceSize = 2; 1945e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 1946e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1947e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 1948e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 1949e6ccafaeSMatthew G Knepley } else { 1950e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 1951e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 1952e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 1953e6ccafaeSMatthew G Knepley } 1954e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 1955e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 1956e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 1957e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 1958e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 1959e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 1960e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 1961e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 1962e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 1963e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 1964e6ccafaeSMatthew G Knepley }; 1965e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 1966e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 1967e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 1968e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 1969e6ccafaeSMatthew G Knepley }; 1970e6ccafaeSMatthew G Knepley 1971e6ccafaeSMatthew G Knepley faceSize = faceSizeTri; 1972e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 1973e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 1974e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 1975e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 1976e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 1977e6ccafaeSMatthew G Knepley 1978e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 1979e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 1980e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 1981e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 1982e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 1983e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 1984e6ccafaeSMatthew G Knepley break; 1985e6ccafaeSMatthew G Knepley } 1986e6ccafaeSMatthew G Knepley } 1987e6ccafaeSMatthew G Knepley } 1988e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 1989e6ccafaeSMatthew G Knepley break; 1990e6ccafaeSMatthew G Knepley } 1991e6ccafaeSMatthew G Knepley } 1992e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 1993e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 1994e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1995e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 1996e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 1997e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 1998e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 1999e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2000e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2001e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 2002e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2003e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2004e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2005e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 2006e6ccafaeSMatthew G Knepley }; 2007e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 2008e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2009e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2010e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2011e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 2012e6ccafaeSMatthew G Knepley }; 2013e6ccafaeSMatthew G Knepley 2014e6ccafaeSMatthew G Knepley faceSize = faceSizeQuad; 2015e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 2016e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 2017e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 2018e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 2019e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2020e6ccafaeSMatthew G Knepley 2021e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 2022e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 2023e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 2024e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 2025e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 2026e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2027e6ccafaeSMatthew G Knepley break; 2028e6ccafaeSMatthew G Knepley } 2029e6ccafaeSMatthew G Knepley } 2030e6ccafaeSMatthew G Knepley } 2031e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2032e6ccafaeSMatthew G Knepley break; 2033e6ccafaeSMatthew G Knepley } 2034e6ccafaeSMatthew G Knepley } 2035e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 2036e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2037e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2038e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 2039e6ccafaeSMatthew G Knepley /* Hexes 2040e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2041e6ccafaeSMatthew G Knepley pointing up at the second. 2042e6ccafaeSMatthew G Knepley 2043e6ccafaeSMatthew G Knepley 7---6 2044e6ccafaeSMatthew G Knepley /| /| 2045e6ccafaeSMatthew G Knepley 4---5 | 2046ddeab2a6SMatthew G. Knepley | 1-|-2 2047e6ccafaeSMatthew G Knepley |/ |/ 2048ddeab2a6SMatthew G. Knepley 0---3 2049e6ccafaeSMatthew G Knepley 2050e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2051e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 2052e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 2053e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2054e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 2055e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 2056e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2057ddeab2a6SMatthew G. Knepley 0, 3, 4, 5, /* front */ 2058ddeab2a6SMatthew G. Knepley 2, 3, 5, 6, /* right */ 2059ddeab2a6SMatthew G. Knepley 1, 2, 6, 7, /* back */ 2060ddeab2a6SMatthew G. Knepley 0, 1, 4, 7, /* left */ 2061e6ccafaeSMatthew G Knepley }; 2062e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 2063ddeab2a6SMatthew G. Knepley 1, 2, 3, 0, /* bottom */ 2064e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2065ddeab2a6SMatthew G. Knepley 0, 3, 5, 4, /* front */ 2066ddeab2a6SMatthew G. Knepley 3, 2, 6, 5, /* right */ 2067ddeab2a6SMatthew G. Knepley 2, 1, 7, 6, /* back */ 2068ddeab2a6SMatthew G. Knepley 1, 0, 4, 7, /* left */ 2069e6ccafaeSMatthew G Knepley }; 2070e6ccafaeSMatthew G Knepley 2071e6ccafaeSMatthew G Knepley faceSize = faceSizeHex; 2072e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 2073e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 2074e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2075e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 2076e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2077e6ccafaeSMatthew G Knepley 2078e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 2079e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 2080e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 2081e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 2082e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 2083e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 2084e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 2085e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2086e6ccafaeSMatthew G Knepley break; 2087e6ccafaeSMatthew G Knepley } 2088e6ccafaeSMatthew G Knepley } 2089e6ccafaeSMatthew G Knepley } 2090e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2091e6ccafaeSMatthew G Knepley break; 2092e6ccafaeSMatthew G Knepley } 2093e6ccafaeSMatthew G Knepley } 2094e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2095e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2096e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2097e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 2098e6ccafaeSMatthew G Knepley /* Quadratic tet */ 2099e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 2100e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 2101e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 2102e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2103e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 2104e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2105e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 2106e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 2107e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 2108e6ccafaeSMatthew G Knepley }; 2109e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 2110e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2111e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 2112e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 2113e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 2114e6ccafaeSMatthew G Knepley }; 2115e6ccafaeSMatthew G Knepley 2116e6ccafaeSMatthew G Knepley faceSize = faceSizeTet; 2117e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 2118e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 2119e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 2120e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 2121e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2122e6ccafaeSMatthew G Knepley 2123e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 2124e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 2125e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 2126e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 2127e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 2128e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 2129e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 2130e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2131e6ccafaeSMatthew G Knepley break; 2132e6ccafaeSMatthew G Knepley } 2133e6ccafaeSMatthew G Knepley } 2134e6ccafaeSMatthew G Knepley } 2135e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2136e6ccafaeSMatthew G Knepley break; 2137e6ccafaeSMatthew G Knepley } 2138e6ccafaeSMatthew G Knepley } 2139e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 2140e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2141e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2142e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 2143e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 2144e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2145e6ccafaeSMatthew G Knepley pointing up at the second. 2146e6ccafaeSMatthew G Knepley 2147e6ccafaeSMatthew G Knepley 7---6 2148e6ccafaeSMatthew G Knepley /| /| 2149e6ccafaeSMatthew G Knepley 4---5 | 2150e6ccafaeSMatthew G Knepley | 3-|-2 2151e6ccafaeSMatthew G Knepley |/ |/ 2152e6ccafaeSMatthew G Knepley 0---1 2153e6ccafaeSMatthew G Knepley 2154e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2155e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 2156e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 2157e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2158e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 2159e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 2160e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2161e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 2162e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 2163e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 2164e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 2165e6ccafaeSMatthew G Knepley }; 2166e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 2167e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 2168e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2169e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 2170e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 2171e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 2172e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 2173e6ccafaeSMatthew G Knepley }; 2174e6ccafaeSMatthew G Knepley 2175e6ccafaeSMatthew G Knepley faceSize = faceSizeQuadHex; 2176e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 2177e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 2178e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2179e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 2180e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2181e6ccafaeSMatthew G Knepley 2182e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 2183e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 2184e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 2185e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 2186e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 2187e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 2188e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 2189e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2190e6ccafaeSMatthew G Knepley break; 2191e6ccafaeSMatthew G Knepley } 2192e6ccafaeSMatthew G Knepley } 2193e6ccafaeSMatthew G Knepley } 2194e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2195e6ccafaeSMatthew G Knepley break; 2196e6ccafaeSMatthew G Knepley } 2197e6ccafaeSMatthew G Knepley } 2198e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2199e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2200e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2201e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 2202e6ccafaeSMatthew G Knepley if (!posOrient) { 2203e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 2204e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 2205e6ccafaeSMatthew G Knepley } else { 2206e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 2207e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 2208e6ccafaeSMatthew G Knepley } 2209e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 2210e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2211e6ccafaeSMatthew G Knepley } 2212e6ccafaeSMatthew G Knepley 2213e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2214e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace" 2215e6ccafaeSMatthew G Knepley /* 2216e6ccafaeSMatthew G Knepley Given a cell and a face, as a set of vertices, 2217e6ccafaeSMatthew G Knepley return the oriented face, as a set of vertices, in faceVertices 2218e6ccafaeSMatthew G Knepley The orientation is such that the face normal points out of the cell 2219e6ccafaeSMatthew G Knepley */ 2220e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2221e6ccafaeSMatthew G Knepley { 22220298fd71SBarry Smith const PetscInt *cone = NULL; 2223e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 2224e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 2225e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2226e6ccafaeSMatthew G Knepley 2227e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2228e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 2229e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 2230e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 2231e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2232e6ccafaeSMatthew G Knepley 2233e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 2234e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 2235e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 2236e6ccafaeSMatthew G Knepley } 2237e6ccafaeSMatthew G Knepley } 2238e6ccafaeSMatthew G Knepley if (found) { 2239e6ccafaeSMatthew G Knepley indices[v2] = v; 2240e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 2241e6ccafaeSMatthew G Knepley ++v2; 2242e6ccafaeSMatthew G Knepley } else { 2243e6ccafaeSMatthew G Knepley oppositeVertex = v; 2244e6ccafaeSMatthew G Knepley } 2245e6ccafaeSMatthew G Knepley } 2246e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 2247e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2248e6ccafaeSMatthew G Knepley } 2249e6ccafaeSMatthew G Knepley 2250e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2251cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal" 2252e6ccafaeSMatthew G Knepley /* 2253cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 2254e6ccafaeSMatthew G Knepley 2255e6ccafaeSMatthew G Knepley Not collective 2256e6ccafaeSMatthew G Knepley 2257e6ccafaeSMatthew G Knepley Input Parameters: 2258e6ccafaeSMatthew G Knepley + dm - The DMPlex 2259e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 2260e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 2261e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 2262e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 2263e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 2264e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 2265e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 2266e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 2267e6ccafaeSMatthew G Knepley 2268e6ccafaeSMatthew G Knepley Output Parameters: 2269e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 2270e6ccafaeSMatthew G Knepley 2271e6ccafaeSMatthew G Knepley Level: developer 2272e6ccafaeSMatthew G Knepley */ 2273cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexInsertFace_Internal(DM dm, DM subdm, PetscInt numFaceVertices, const PetscInt faceVertices[], const PetscInt subfaceVertices[], PetscInt numCorners, PetscInt cell, PetscInt subcell, PetscInt firstFace, PetscInt *newFacePoint) 2274e6ccafaeSMatthew G Knepley { 227582f516ccSBarry Smith MPI_Comm comm; 2276e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 2277e6ccafaeSMatthew G Knepley const PetscInt *faces; 2278e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 2279e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2280e6ccafaeSMatthew G Knepley 2281e6ccafaeSMatthew G Knepley PetscFunctionBegin; 228282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2283e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 2284e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 2285e6ccafaeSMatthew G Knepley #if 0 2286e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 2287e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2288e6ccafaeSMatthew G Knepley #else 2289e6ccafaeSMatthew G Knepley { 2290e6ccafaeSMatthew G Knepley PetscInt f; 2291e6ccafaeSMatthew G Knepley 2292e6ccafaeSMatthew G Knepley numFaces = 0; 2293e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2294e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 2295e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 2296e6ccafaeSMatthew G Knepley 2297e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 2298e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 2299e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 2300e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 2301e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 2302e6ccafaeSMatthew G Knepley PetscInt v; 2303e6ccafaeSMatthew G Knepley 2304e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2305e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 2306e6ccafaeSMatthew G Knepley } 2307e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 2308e6ccafaeSMatthew G Knepley } 2309e6ccafaeSMatthew G Knepley if (d == dof) { 2310e6ccafaeSMatthew G Knepley numFaces = 1; 2311e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 2312e6ccafaeSMatthew G Knepley } 2313e6ccafaeSMatthew G Knepley } 2314e6ccafaeSMatthew G Knepley } 2315e6ccafaeSMatthew G Knepley #endif 2316e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 2317e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 2318e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 2319766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 2320e6ccafaeSMatthew G Knepley } else { 2321e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 2322e6ccafaeSMatthew G Knepley PetscBool posOriented; 2323e6ccafaeSMatthew G Knepley 2324e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2325e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 2326e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 2327e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 2328e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 2329e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 2330e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2331e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 2332e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 2333e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 2334e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 2335e6ccafaeSMatthew G Knepley break; 2336e6ccafaeSMatthew G Knepley } 2337e6ccafaeSMatthew G Knepley } 2338e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 2339e6ccafaeSMatthew G Knepley } 2340e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 2341e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 2342e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2343e6ccafaeSMatthew G Knepley ++(*newFacePoint); 2344e6ccafaeSMatthew G Knepley } 2345ef07cca7SMatthew G. Knepley #if 0 2346e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2347ef07cca7SMatthew G. Knepley #else 2348ef07cca7SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2349ef07cca7SMatthew G. Knepley #endif 2350e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2351e6ccafaeSMatthew G Knepley } 2352e6ccafaeSMatthew G Knepley 2353e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2354e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated" 235553156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2356e6ccafaeSMatthew G Knepley { 235782f516ccSBarry Smith MPI_Comm comm; 235853156dfcSMatthew G. Knepley DMLabel subpointMap; 2359efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 2360efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 2361efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 2362fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 2363efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 2364e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2365e6ccafaeSMatthew G Knepley 2366e6ccafaeSMatthew G Knepley PetscFunctionBegin; 236782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2368efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2369efa14ee0SMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2370efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2371efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 237253156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);} 2373efa14ee0SMatthew G Knepley /* Setup chart */ 2374efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2375efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2376efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2377efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2378e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2379e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 2380efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 2381e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 2382efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2383efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2384efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 2385efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2386e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2387e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2388e6ccafaeSMatthew G Knepley } 2389e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2390e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2391e6ccafaeSMatthew G Knepley } 2392e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2393e6ccafaeSMatthew G Knepley /* Create face cones */ 2394efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 23950298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2396efa14ee0SMatthew G Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2397e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2398e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 2399efa14ee0SMatthew G Knepley const PetscInt subcell = c; 24000298fd71SBarry Smith PetscInt *closure = NULL; 2401efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 2402e6ccafaeSMatthew G Knepley 2403e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2404efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2405efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 2406e6ccafaeSMatthew G Knepley PetscInt subVertex; 2407e6ccafaeSMatthew G Knepley 2408efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 2409efa14ee0SMatthew G Knepley ++numCorners; 2410efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 2411efa14ee0SMatthew G Knepley if (subVertex >= 0) { 2412efa14ee0SMatthew G Knepley closure[faceSize] = point; 241365560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 2414e6ccafaeSMatthew G Knepley ++faceSize; 2415e6ccafaeSMatthew G Knepley } 2416e6ccafaeSMatthew G Knepley } 2417e6ccafaeSMatthew G Knepley } 2418efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 2419efa14ee0SMatthew G Knepley if (faceSize == nFV) { 2420cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 2421e6ccafaeSMatthew G Knepley } 242265560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2423e6ccafaeSMatthew G Knepley } 2424efa14ee0SMatthew G Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2425e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2426e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2427e6ccafaeSMatthew G Knepley /* Build coordinates */ 2428efa14ee0SMatthew G Knepley { 2429efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 2430efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 2431efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 2432285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2433efa14ee0SMatthew G Knepley 243469d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2435e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 243669d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2437285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2438285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2439285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2440efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2441efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2442efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2443efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2444efa14ee0SMatthew G Knepley PetscInt dof; 2445efa14ee0SMatthew G Knepley 2446efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2447efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2448285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2449e6ccafaeSMatthew G Knepley } 2450e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2451e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2452e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2453e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 24542eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2455830e53efSMatthew G. Knepley if (coordSize) { 2456e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2457e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2458efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2459efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2460efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2461efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2462e6ccafaeSMatthew G Knepley 2463e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2464e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2465efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2466efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2467efa14ee0SMatthew G Knepley if (dof != sdof) SETERRQ4(comm, PETSC_ERR_PLIB, "Coordinate dimension %d on subvertex %d, vertex %d should be %d", sdof, subvertex, vertex, dof); 2468e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2469e6ccafaeSMatthew G Knepley } 2470e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2471e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 24723b399e24SMatthew G. Knepley } 2473e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2474e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2475e6ccafaeSMatthew G Knepley } 2476efa14ee0SMatthew G Knepley /* Cleanup */ 2477efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2478efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2479efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2480efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2481e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2482e6ccafaeSMatthew G Knepley } 2483e6ccafaeSMatthew G Knepley 2484e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2485e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated" 248653156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2487e6ccafaeSMatthew G Knepley { 248882f516ccSBarry Smith MPI_Comm comm; 248953156dfcSMatthew G. Knepley DMLabel subpointMap; 2490efa14ee0SMatthew G Knepley IS *subpointIS; 2491efa14ee0SMatthew G Knepley const PetscInt **subpoints; 249201a2673eSMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *coneONew; 2493efa14ee0SMatthew G Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2494e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2495e6ccafaeSMatthew G Knepley 2496e6ccafaeSMatthew G Knepley PetscFunctionBegin; 249782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2498efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2499e6ccafaeSMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2500efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2501efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 250253156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Interpolated(dm, vertexLabel, value, subpointMap, subdm);CHKERRQ(ierr);} 2503efa14ee0SMatthew G Knepley /* Setup chart */ 2504efa14ee0SMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2505dcca6d9dSJed Brown ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr); 2506e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2507e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2508e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 2509e6ccafaeSMatthew G Knepley } 2510e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2511e6ccafaeSMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2512e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2513e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 2514e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2515e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2516e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2517e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2518e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 25190ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2520e6ccafaeSMatthew G Knepley } 2521e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2522e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2523e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2524e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2525e6ccafaeSMatthew G Knepley const PetscInt *cone; 2526e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 2527e6ccafaeSMatthew G Knepley 2528e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2529e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2530e6ccafaeSMatthew G Knepley if (d == dim) { 2531e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2532e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2533e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2534e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 2535e6ccafaeSMatthew G Knepley } 2536e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2537e6ccafaeSMatthew G Knepley } 2538e6ccafaeSMatthew G Knepley } 2539e6ccafaeSMatthew G Knepley } 2540e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2541e6ccafaeSMatthew G Knepley /* Set cones */ 25420298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2543dcca6d9dSJed Brown ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&coneONew);CHKERRQ(ierr); 2544e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2545e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2546e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2547e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 25480e49e2e2SMatthew G. Knepley const PetscInt *cone, *ornt; 2549e6ccafaeSMatthew G Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2550e6ccafaeSMatthew G Knepley 2551e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2552e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2553e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 25540e49e2e2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2555e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2556e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 255701a2673eSMatthew G. Knepley if (subc >= 0) { 255801a2673eSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 255901a2673eSMatthew G. Knepley coneONew[coneSizeNew] = ornt[c]; 256001a2673eSMatthew G. Knepley ++coneSizeNew; 256101a2673eSMatthew G. Knepley } 2562e6ccafaeSMatthew G Knepley } 2563e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2564e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 256501a2673eSMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, coneONew);CHKERRQ(ierr); 2566e6ccafaeSMatthew G Knepley } 2567e6ccafaeSMatthew G Knepley } 256801a2673eSMatthew G. Knepley ierr = PetscFree2(coneNew,coneONew);CHKERRQ(ierr); 2569e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2570e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2571e6ccafaeSMatthew G Knepley /* Build coordinates */ 2572e6ccafaeSMatthew G Knepley { 2573e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 2574e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 2575e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 2576285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2577e6ccafaeSMatthew G Knepley 257869d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2579e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 258069d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2581285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2582285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2583285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2584e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2585e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2586e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2587e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2588e6ccafaeSMatthew G Knepley PetscInt dof; 2589e6ccafaeSMatthew G Knepley 2590e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2591e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2592285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2593e6ccafaeSMatthew G Knepley } 2594e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2595e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2596e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2597e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 25982eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2599e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2600e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2601e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2602e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2603e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2604e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2605e6ccafaeSMatthew G Knepley 2606e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2607e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2608e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2609e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2610e6ccafaeSMatthew G Knepley if (dof != sdof) SETERRQ4(comm, PETSC_ERR_PLIB, "Coordinate dimension %d on subvertex %d, vertex %d should be %d", sdof, subvertex, vertex, dof); 2611efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2612e6ccafaeSMatthew G Knepley } 2613e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2614e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2615e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2616e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2617e6ccafaeSMatthew G Knepley } 2618efa14ee0SMatthew G Knepley /* Cleanup */ 2619e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 26200ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2621e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2622e6ccafaeSMatthew G Knepley } 2623efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2624e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2625e6ccafaeSMatthew G Knepley } 2626e6ccafaeSMatthew G Knepley 2627e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2628e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh" 2629d0fa310fSMatthew G. Knepley /*@ 2630e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 2631e6ccafaeSMatthew G Knepley 2632e6ccafaeSMatthew G Knepley Input Parameters: 2633e6ccafaeSMatthew G Knepley + dm - The original mesh 2634830e53efSMatthew G. Knepley . vertexLabel - The DMLabel marking vertices contained in the surface 2635830e53efSMatthew G. Knepley - value - The label value to use 2636e6ccafaeSMatthew G Knepley 2637e6ccafaeSMatthew G Knepley Output Parameter: 2638e6ccafaeSMatthew G Knepley . subdm - The surface mesh 2639e6ccafaeSMatthew G Knepley 2640e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2641e6ccafaeSMatthew G Knepley 2642e6ccafaeSMatthew G Knepley Level: developer 2643e6ccafaeSMatthew G Knepley 2644e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue() 2645830e53efSMatthew G. Knepley @*/ 264653156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm) 2647e6ccafaeSMatthew G Knepley { 2648e6ccafaeSMatthew G Knepley PetscInt dim, depth; 2649e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2650e6ccafaeSMatthew G Knepley 2651e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2652e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2653766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 2654e6ccafaeSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2655e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 265682f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2657e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2658e6ccafaeSMatthew G Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2659e6ccafaeSMatthew G Knepley if (depth == dim) { 2660830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2661e6ccafaeSMatthew G Knepley } else { 2662830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2663e6ccafaeSMatthew G Knepley } 2664e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2665e6ccafaeSMatthew G Knepley } 2666e6ccafaeSMatthew G Knepley 2667e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2668aca35d17SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal" 2669aca35d17SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 2670aca35d17SMatthew G. Knepley { 2671aca35d17SMatthew G. Knepley PetscInt subPoint; 2672aca35d17SMatthew G. Knepley PetscErrorCode ierr; 2673aca35d17SMatthew G. Knepley 2674aca35d17SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 2675aca35d17SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 2676aca35d17SMatthew G. Knepley } 2677aca35d17SMatthew G. Knepley 2678aca35d17SMatthew G. Knepley #undef __FUNCT__ 2679766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated" 268027c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 2681766ab985SMatthew G. Knepley { 2682766ab985SMatthew G. Knepley MPI_Comm comm; 2683766ab985SMatthew G. Knepley DMLabel subpointMap; 2684766ab985SMatthew G. Knepley IS subvertexIS; 2685766ab985SMatthew G. Knepley const PetscInt *subVertices; 2686fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 2687766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 268887feddfdSMatthew G. Knepley PetscInt cMax, c, f; 2689766ab985SMatthew G. Knepley PetscErrorCode ierr; 2690766ab985SMatthew G. Knepley 2691766ab985SMatthew G. Knepley PetscFunctionBegin; 2692766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 2693766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2694766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2695766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2696766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 269727c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 2698766ab985SMatthew G. Knepley /* Setup chart */ 2699766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2700766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2701766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2702766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2703766ab985SMatthew G. Knepley /* Set cone sizes */ 2704766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 2705766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 2706766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 2707766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2708766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2709766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2710766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2711766ab985SMatthew G. Knepley } 2712766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2713766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2714766ab985SMatthew G. Knepley } 2715766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2716766ab985SMatthew G. Knepley /* Create face cones */ 2717766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 271887feddfdSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2719766ab985SMatthew G. Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2720766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2721766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 2722766ab985SMatthew G. Knepley const PetscInt subcell = c; 272387feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 272487feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 2725766ab985SMatthew G. Knepley 272687feddfdSMatthew G. Knepley if (cell < cMax) continue; 272787feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 272887feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 272987feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 273087feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 273187feddfdSMatthew G. Knepley } 273287feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 273387feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 273487feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 273527234c99SMatthew G. Knepley /* Not true in parallel 273627234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 273787feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 273887feddfdSMatthew G. Knepley PetscInt negsubcell; 2739766ab985SMatthew G. Knepley 274087feddfdSMatthew G. Knepley if (cells[p] >= cMax) continue; 274187feddfdSMatthew G. Knepley /* I know this is a crap search */ 274287feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 274387feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 2744766ab985SMatthew G. Knepley } 274587feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 274687feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 2747766ab985SMatthew G. Knepley } 274887feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 274987feddfdSMatthew G. Knepley ++newFacePoint; 2750766ab985SMatthew G. Knepley } 2751766ab985SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2752766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2753766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2754766ab985SMatthew G. Knepley /* Build coordinates */ 2755766ab985SMatthew G. Knepley { 2756766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2757766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2758766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2759285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2760766ab985SMatthew G. Knepley 276169d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2762766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 276369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2764285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2765285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2766285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2767766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2768766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2769766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2770766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2771766ab985SMatthew G. Knepley PetscInt dof; 2772766ab985SMatthew G. Knepley 2773766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2774766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2775285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2776766ab985SMatthew G. Knepley } 2777766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2778766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2779766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2780766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 27812eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2782766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2783766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2784766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 2785766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 2786766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 2787766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 2788766ab985SMatthew G. Knepley 2789766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2790766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2791766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2792766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2793766ab985SMatthew G. Knepley if (dof != sdof) SETERRQ4(comm, PETSC_ERR_PLIB, "Coordinate dimension %d on subvertex %d, vertex %d should be %d", sdof, subvertex, vertex, dof); 2794766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2795766ab985SMatthew G. Knepley } 2796766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2797766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2798766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2799766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2800766ab985SMatthew G. Knepley } 2801aca35d17SMatthew G. Knepley /* Build SF */ 2802aca35d17SMatthew G. Knepley CHKMEMQ; 2803aca35d17SMatthew G. Knepley { 2804aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 2805aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 2806bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 2807aca35d17SMatthew G. Knepley const PetscInt *localPoints; 2808bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 280949c26ae4SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 2810bdcf2095SMatthew G. Knepley PetscMPIInt rank; 2811aca35d17SMatthew G. Knepley 2812bdcf2095SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 2813aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 2814aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 2815aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2816aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 2817aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 2818aca35d17SMatthew G. Knepley if (numRoots >= 0) { 2819aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 2820dcca6d9dSJed Brown ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 2821bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 2822bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 2823bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 2824bdcf2095SMatthew G. Knepley } 28259e0823b2SMatthew G. Knepley /* Set subleaves */ 2826aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2827aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 2828bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2829aca35d17SMatthew G. Knepley 2830aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 2831bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 2832bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 2833bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 2834bdcf2095SMatthew G. Knepley ++numSubLeaves; 2835aca35d17SMatthew G. Knepley } 28369e0823b2SMatthew G. Knepley /* Must put in owned subpoints */ 28379e0823b2SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 28389e0823b2SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 28399e0823b2SMatthew G. Knepley 28409e0823b2SMatthew G. Knepley if (subPoint < 0) { 28419e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = -3; 28429e0823b2SMatthew G. Knepley newOwners[p-pStart].index = -3; 28439e0823b2SMatthew G. Knepley } else { 28449e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = rank; 28459e0823b2SMatthew G. Knepley newOwners[p-pStart].index = subPoint; 28469e0823b2SMatthew G. Knepley } 2847bdcf2095SMatthew G. Knepley } 2848bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2849bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2850bdcf2095SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2851bdcf2095SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2852785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &slocalPoints);CHKERRQ(ierr); 2853785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &sremotePoints);CHKERRQ(ierr); 285449c26ae4SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 2855bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 2856bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2857aca35d17SMatthew G. Knepley 2858aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 285949c26ae4SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 2860aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 2861bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 2862bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 2863bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 2864bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 2865aca35d17SMatthew G. Knepley ++sl; 2866aca35d17SMatthew G. Knepley } 2867bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 286849c26ae4SMatthew G. Knepley if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 286949c26ae4SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 2870aca35d17SMatthew G. Knepley } 2871aca35d17SMatthew G. Knepley } 2872aca35d17SMatthew G. Knepley CHKMEMQ; 2873766ab985SMatthew G. Knepley /* Cleanup */ 2874766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2875766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2876766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 2877766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2878766ab985SMatthew G. Knepley } 2879766ab985SMatthew G. Knepley 2880766ab985SMatthew G. Knepley #undef __FUNCT__ 2881766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated" 2882b3154360SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char label[], PetscInt value, DM subdm) 2883766ab985SMatthew G. Knepley { 2884766ab985SMatthew G. Knepley MPI_Comm comm; 2885766ab985SMatthew G. Knepley DMLabel subpointMap; 2886766ab985SMatthew G. Knepley IS *subpointIS; 2887766ab985SMatthew G. Knepley const PetscInt **subpoints; 2888b1a8e46aSMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *orntNew; 2889766ab985SMatthew G. Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2890766ab985SMatthew G. Knepley PetscErrorCode ierr; 2891766ab985SMatthew G. Knepley 2892766ab985SMatthew G. Knepley PetscFunctionBegin; 2893766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2894766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2895766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2896766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2897766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 2898b3154360SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr); 2899766ab985SMatthew G. Knepley /* Setup chart */ 2900766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2901dcca6d9dSJed Brown ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr); 2902766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2903766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2904766ab985SMatthew G. Knepley totSubPoints += numSubPoints[d]; 2905766ab985SMatthew G. Knepley } 2906766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2907766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2908766ab985SMatthew G. Knepley /* Set cone sizes */ 2909766ab985SMatthew G. Knepley firstSubPoint[dim] = 0; 2910766ab985SMatthew G. Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2911766ab985SMatthew G. Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2912766ab985SMatthew G. Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2913766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2914766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2915b643afeaSMatthew G. Knepley if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2916766ab985SMatthew G. Knepley } 2917766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2918766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2919766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2920766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2921766ab985SMatthew G. Knepley const PetscInt *cone; 2922766ab985SMatthew G. Knepley PetscInt coneSize, coneSizeNew, c, val; 2923766ab985SMatthew G. Knepley 2924766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2925766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2926766ab985SMatthew G. Knepley if (d == dim) { 2927766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2928766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2929766ab985SMatthew G. Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2930766ab985SMatthew G. Knepley if (val >= 0) coneSizeNew++; 2931766ab985SMatthew G. Knepley } 2932766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2933766ab985SMatthew G. Knepley } 2934766ab985SMatthew G. Knepley } 2935766ab985SMatthew G. Knepley } 2936766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2937766ab985SMatthew G. Knepley /* Set cones */ 2938766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2939dcca6d9dSJed Brown ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&orntNew);CHKERRQ(ierr); 2940766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2941766ab985SMatthew G. Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2942766ab985SMatthew G. Knepley const PetscInt point = subpoints[d][p]; 2943766ab985SMatthew G. Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2944b1a8e46aSMatthew G. Knepley const PetscInt *cone, *ornt; 2945766ab985SMatthew G. Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2946766ab985SMatthew G. Knepley 2947766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2948766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2949766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2950b1a8e46aSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2951766ab985SMatthew G. Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2952766ab985SMatthew G. Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 2953b1a8e46aSMatthew G. Knepley if (subc >= 0) { 2954b1a8e46aSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 2955b1a8e46aSMatthew G. Knepley orntNew[coneSizeNew++] = ornt[c]; 2956b1a8e46aSMatthew G. Knepley } 2957766ab985SMatthew G. Knepley } 2958766ab985SMatthew G. Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2959766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 2960b1a8e46aSMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, orntNew);CHKERRQ(ierr); 2961766ab985SMatthew G. Knepley } 2962766ab985SMatthew G. Knepley } 2963b1a8e46aSMatthew G. Knepley ierr = PetscFree2(coneNew,orntNew);CHKERRQ(ierr); 2964766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2965766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2966766ab985SMatthew G. Knepley /* Build coordinates */ 2967766ab985SMatthew G. Knepley { 2968766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2969766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 2970766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 2971285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2972766ab985SMatthew G. Knepley 297369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2974766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 297569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2976285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2977285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2978285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2979766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2980766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2981766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 2982766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2983766ab985SMatthew G. Knepley PetscInt dof; 2984766ab985SMatthew G. Knepley 2985766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2986766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2987285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2988766ab985SMatthew G. Knepley } 2989766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2990766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2991766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2992766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 29932eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2994766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2995766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2996766ab985SMatthew G. Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2997766ab985SMatthew G. Knepley const PetscInt vertex = subpoints[0][v]; 2998766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2999766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 3000766ab985SMatthew G. Knepley 3001766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3002766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 3003766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 3004766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 3005766ab985SMatthew G. Knepley if (dof != sdof) SETERRQ4(comm, PETSC_ERR_PLIB, "Coordinate dimension %d on subvertex %d, vertex %d should be %d", sdof, subvertex, vertex, dof); 3006766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 3007766ab985SMatthew G. Knepley } 3008766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3009766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3010766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 3011766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 3012766ab985SMatthew G. Knepley } 3013c80a7578SMatthew G. Knepley /* Build SF: We need this complexity because subpoints might not be selected on the owning process */ 3014c80a7578SMatthew G. Knepley { 3015c80a7578SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 3016251556f3SMatthew G. Knepley IS subpIS; 3017c80a7578SMatthew G. Knepley const PetscSFNode *remotePoints; 3018c80a7578SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 3019c80a7578SMatthew G. Knepley const PetscInt *localPoints, *subpoints; 3020c80a7578SMatthew G. Knepley PetscInt *slocalPoints; 3021f033dbf2SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubpoints = 0, numSubroots, numSubleaves = 0, l, sl, ll, pStart, pEnd, p; 3022c80a7578SMatthew G. Knepley PetscMPIInt rank; 3023c80a7578SMatthew G. Knepley 3024c80a7578SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 3025c80a7578SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 3026c80a7578SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 3027c80a7578SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3028c80a7578SMatthew G. Knepley ierr = DMPlexGetChart(subdm, NULL, &numSubroots);CHKERRQ(ierr); 3029251556f3SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpIS);CHKERRQ(ierr); 3030251556f3SMatthew G. Knepley if (subpIS) { 3031251556f3SMatthew G. Knepley ierr = ISGetIndices(subpIS, &subpoints);CHKERRQ(ierr); 3032251556f3SMatthew G. Knepley ierr = ISGetLocalSize(subpIS, &numSubpoints);CHKERRQ(ierr); 3033f033dbf2SMatthew G. Knepley } 3034c80a7578SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 3035c80a7578SMatthew G. Knepley if (numRoots >= 0) { 303682db75e7SMatthew G. Knepley ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 3037c80a7578SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 3038c80a7578SMatthew G. Knepley newLocalPoints[p].rank = -2; 3039c80a7578SMatthew G. Knepley newLocalPoints[p].index = -2; 3040c80a7578SMatthew G. Knepley } 3041c80a7578SMatthew G. Knepley /* Set subleaves */ 3042c80a7578SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 3043c80a7578SMatthew G. Knepley const PetscInt point = localPoints[l]; 3044c80a7578SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 3045c80a7578SMatthew G. Knepley 3046c80a7578SMatthew G. Knepley if (subpoint < 0) continue; 3047c80a7578SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 3048c80a7578SMatthew G. Knepley newLocalPoints[point-pStart].index = subpoint; 3049c80a7578SMatthew G. Knepley ++numSubleaves; 3050c80a7578SMatthew G. Knepley } 3051c80a7578SMatthew G. Knepley /* Must put in owned subpoints */ 3052c80a7578SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 3053c80a7578SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(p, 0, numSubpoints, subpoints); 3054c80a7578SMatthew G. Knepley 3055c80a7578SMatthew G. Knepley if (subpoint < 0) { 3056c80a7578SMatthew G. Knepley newOwners[p-pStart].rank = -3; 3057c80a7578SMatthew G. Knepley newOwners[p-pStart].index = -3; 3058c80a7578SMatthew G. Knepley } else { 3059c80a7578SMatthew G. Knepley newOwners[p-pStart].rank = rank; 3060c80a7578SMatthew G. Knepley newOwners[p-pStart].index = subpoint; 3061c80a7578SMatthew G. Knepley } 3062c80a7578SMatthew G. Knepley } 3063c80a7578SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3064c80a7578SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3065c80a7578SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3066c80a7578SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3067c80a7578SMatthew G. Knepley ierr = PetscMalloc(numSubleaves * sizeof(PetscInt), &slocalPoints);CHKERRQ(ierr); 3068c80a7578SMatthew G. Knepley ierr = PetscMalloc(numSubleaves * sizeof(PetscSFNode), &sremotePoints);CHKERRQ(ierr); 3069c80a7578SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 3070c80a7578SMatthew G. Knepley const PetscInt point = localPoints[l]; 3071c80a7578SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 3072c80a7578SMatthew G. Knepley 3073c80a7578SMatthew G. Knepley if (subpoint < 0) continue; 3074c80a7578SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 3075c80a7578SMatthew G. Knepley slocalPoints[sl] = subpoint; 3076c80a7578SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 3077c80a7578SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 3078c80a7578SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 3079c80a7578SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 3080c80a7578SMatthew G. Knepley ++sl; 3081c80a7578SMatthew G. Knepley } 3082c80a7578SMatthew G. Knepley if (sl + ll != numSubleaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubleaves); 3083c80a7578SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 3084c80a7578SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubroots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 3085c80a7578SMatthew G. Knepley } 3086251556f3SMatthew G. Knepley if (subpIS) { 3087251556f3SMatthew G. Knepley ierr = ISRestoreIndices(subpIS, &subpoints);CHKERRQ(ierr); 3088251556f3SMatthew G. Knepley ierr = ISDestroy(&subpIS);CHKERRQ(ierr); 3089251556f3SMatthew G. Knepley } 3090c80a7578SMatthew G. Knepley } 3091766ab985SMatthew G. Knepley /* Cleanup */ 3092766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 3093b643afeaSMatthew G. Knepley if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 3094766ab985SMatthew G. Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 3095766ab985SMatthew G. Knepley } 3096766ab985SMatthew G. Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 3097766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3098766ab985SMatthew G. Knepley } 3099766ab985SMatthew G. Knepley 3100766ab985SMatthew G. Knepley #undef __FUNCT__ 3101766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh" 3102766ab985SMatthew G. Knepley /* 310327c04023SMatthew G. Knepley DMPlexCreateCohesiveSubmesh - Extract from a mesh with cohesive cells the hypersurface defined by one face of the cells. Optionally, a Label an be given to restrict the cells. 3104766ab985SMatthew G. Knepley 3105766ab985SMatthew G. Knepley Input Parameters: 3106766ab985SMatthew G. Knepley + dm - The original mesh 310727c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 31087afc1a8bSJed Brown . label - A label name, or NULL 310927c04023SMatthew G. Knepley - value - A label value 3110766ab985SMatthew G. Knepley 3111766ab985SMatthew G. Knepley Output Parameter: 3112766ab985SMatthew G. Knepley . subdm - The surface mesh 3113766ab985SMatthew G. Knepley 3114766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3115766ab985SMatthew G. Knepley 3116766ab985SMatthew G. Knepley Level: developer 3117766ab985SMatthew G. Knepley 3118766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 3119766ab985SMatthew G. Knepley */ 312027c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 3121766ab985SMatthew G. Knepley { 3122766ab985SMatthew G. Knepley PetscInt dim, depth; 3123766ab985SMatthew G. Knepley PetscErrorCode ierr; 3124766ab985SMatthew G. Knepley 3125766ab985SMatthew G. Knepley PetscFunctionBegin; 3126766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 312727c04023SMatthew G. Knepley PetscValidPointer(subdm, 5); 3128766ab985SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 3129766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3130766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 3131766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3132766ab985SMatthew G. Knepley ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 3133766ab985SMatthew G. Knepley if (depth == dim) { 3134b3154360SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr); 3135766ab985SMatthew G. Knepley } else { 313627c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 3137e6ccafaeSMatthew G Knepley } 3138e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3139e6ccafaeSMatthew G Knepley } 3140e6ccafaeSMatthew G Knepley 3141e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3142e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap" 314364beef6dSMatthew G. Knepley /*@ 314464beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 314564beef6dSMatthew G. Knepley 314664beef6dSMatthew G. Knepley Input Parameter: 314764beef6dSMatthew G. Knepley . dm - The submesh DM 314864beef6dSMatthew G. Knepley 314964beef6dSMatthew G. Knepley Output Parameter: 315064beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 315164beef6dSMatthew G. Knepley 315264beef6dSMatthew G. Knepley Level: developer 315364beef6dSMatthew G. Knepley 315464beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 315564beef6dSMatthew G. Knepley @*/ 3156e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 3157e6ccafaeSMatthew G Knepley { 3158e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3159e6ccafaeSMatthew G Knepley 3160e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3161e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3162e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 3163e6ccafaeSMatthew G Knepley *subpointMap = mesh->subpointMap; 3164e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3165e6ccafaeSMatthew G Knepley } 3166e6ccafaeSMatthew G Knepley 3167e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3168e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap" 3169e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */ 3170e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 3171e6ccafaeSMatthew G Knepley { 3172e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 3173285d324eSMatthew G. Knepley DMLabel tmp; 3174e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3175e6ccafaeSMatthew G Knepley 3176e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3177e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3178285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 3179e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 3180285d324eSMatthew G. Knepley ++mesh->subpointMap->refct; 3181285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 3182e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3183e6ccafaeSMatthew G Knepley } 3184e6ccafaeSMatthew G Knepley 3185e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3186e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS" 318764beef6dSMatthew G. Knepley /*@ 3188e6ccafaeSMatthew G Knepley DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 3189e6ccafaeSMatthew G Knepley 3190e6ccafaeSMatthew G Knepley Input Parameter: 3191e6ccafaeSMatthew G Knepley . dm - The submesh DM 3192e6ccafaeSMatthew G Knepley 3193e6ccafaeSMatthew G Knepley Output Parameter: 31940298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 3195e6ccafaeSMatthew G Knepley 3196e6ccafaeSMatthew G Knepley Note: This is IS is guaranteed to be sorted by the construction of the submesh 319764beef6dSMatthew G. Knepley 319864beef6dSMatthew G. Knepley Level: developer 319964beef6dSMatthew G. Knepley 320064beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 320164beef6dSMatthew G. Knepley @*/ 3202e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 3203e6ccafaeSMatthew G Knepley { 320482f516ccSBarry Smith MPI_Comm comm; 3205e6ccafaeSMatthew G Knepley DMLabel subpointMap; 3206e6ccafaeSMatthew G Knepley IS is; 3207e6ccafaeSMatthew G Knepley const PetscInt *opoints; 3208e6ccafaeSMatthew G Knepley PetscInt *points, *depths; 3209e6ccafaeSMatthew G Knepley PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 3210e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3211e6ccafaeSMatthew G Knepley 3212e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3213e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3214e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 321582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 32160298fd71SBarry Smith *subpointIS = NULL; 3217e6ccafaeSMatthew G Knepley ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 3218e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3219fed694aaSMatthew G. Knepley if (subpointMap && depth >= 0) { 3220e6ccafaeSMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3221e6ccafaeSMatthew G Knepley if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 3222e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3223e6ccafaeSMatthew G Knepley depths[0] = depth; 3224e6ccafaeSMatthew G Knepley depths[1] = 0; 3225e6ccafaeSMatthew G Knepley for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 3226785e854fSJed Brown ierr = PetscMalloc1(pEnd, &points);CHKERRQ(ierr); 3227e6ccafaeSMatthew G Knepley for(d = 0, off = 0; d <= depth; ++d) { 3228e6ccafaeSMatthew G Knepley const PetscInt dep = depths[d]; 3229e6ccafaeSMatthew G Knepley 3230e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 3231e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 32321e21b6fdSMatthew G Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 3233e6ccafaeSMatthew G Knepley if (n != depEnd-depStart) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d at depth %d should be %d", n, dep, depEnd-depStart); 3234e6ccafaeSMatthew G Knepley } else { 32351e21b6fdSMatthew G Knepley if (!n) { 32361e21b6fdSMatthew G Knepley if (d == 0) { 32371e21b6fdSMatthew G Knepley /* Missing cells */ 32381e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 32391e21b6fdSMatthew G Knepley } else { 32401e21b6fdSMatthew G Knepley /* Missing faces */ 32411e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 32421e21b6fdSMatthew G Knepley } 32431e21b6fdSMatthew G Knepley } 3244e6ccafaeSMatthew G Knepley } 3245e6ccafaeSMatthew G Knepley if (n) { 3246e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 3247e6ccafaeSMatthew G Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 3248e6ccafaeSMatthew G Knepley for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 3249e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 3250e6ccafaeSMatthew G Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 3251e6ccafaeSMatthew G Knepley } 3252e6ccafaeSMatthew G Knepley } 3253e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3254e6ccafaeSMatthew G Knepley if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 3255fed694aaSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 3256e6ccafaeSMatthew G Knepley } 3257e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3258e6ccafaeSMatthew G Knepley } 3259