1af0996ceSBarry Smith #include <petsc/private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 20c312b8eSJed Brown #include <petscsf.h> 3e6ccafaeSMatthew G Knepley 4e6ccafaeSMatthew G Knepley #undef __FUNCT__ 530560a7bSMatthew G. Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces_Internal" 630560a7bSMatthew G. Knepley PetscErrorCode DMPlexMarkBoundaryFaces_Internal(DM dm, PetscInt cellHeight, DMLabel label) 730560a7bSMatthew G. Knepley { 830560a7bSMatthew G. Knepley PetscInt fStart, fEnd, f; 930560a7bSMatthew G. Knepley PetscErrorCode ierr; 1030560a7bSMatthew G. Knepley 1130560a7bSMatthew G. Knepley PetscFunctionBegin; 1230560a7bSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1330560a7bSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight+1, &fStart, &fEnd);CHKERRQ(ierr); 1430560a7bSMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 1530560a7bSMatthew G. Knepley PetscInt supportSize; 1630560a7bSMatthew G. Knepley 1730560a7bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 1830560a7bSMatthew G. Knepley if (supportSize == 1) {ierr = DMLabelSetValue(label, f, 1);CHKERRQ(ierr);} 1930560a7bSMatthew G. Knepley } 2030560a7bSMatthew G. Knepley PetscFunctionReturn(0); 2130560a7bSMatthew G. Knepley } 2230560a7bSMatthew G. Knepley 2330560a7bSMatthew G. Knepley #undef __FUNCT__ 24cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces" 25cd0c2139SMatthew G Knepley /*@ 26cd0c2139SMatthew G Knepley DMPlexMarkBoundaryFaces - Mark all faces on the boundary 27cd0c2139SMatthew G Knepley 28cd0c2139SMatthew G Knepley Not Collective 29cd0c2139SMatthew G Knepley 30cd0c2139SMatthew G Knepley Input Parameter: 31cd0c2139SMatthew G Knepley . dm - The original DM 32cd0c2139SMatthew G Knepley 33cd0c2139SMatthew G Knepley Output Parameter: 34cd0c2139SMatthew G Knepley . label - The DMLabel marking boundary faces with value 1 35cd0c2139SMatthew G Knepley 36cd0c2139SMatthew G Knepley Level: developer 37cd0c2139SMatthew G Knepley 38cd0c2139SMatthew G Knepley .seealso: DMLabelCreate(), DMPlexCreateLabel() 3909f723d9SJed Brown @*/ 40cd0c2139SMatthew G Knepley PetscErrorCode DMPlexMarkBoundaryFaces(DM dm, DMLabel label) 41cd0c2139SMatthew G Knepley { 42cd0c2139SMatthew G Knepley PetscErrorCode ierr; 43cd0c2139SMatthew G Knepley 44cd0c2139SMatthew G Knepley PetscFunctionBegin; 4574e03af4SMatthew G. Knepley ierr = DMPlexMarkBoundaryFaces_Internal(dm, 0, label);CHKERRQ(ierr); 46cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 47cd0c2139SMatthew G Knepley } 48cd0c2139SMatthew G Knepley 49cd0c2139SMatthew G Knepley #undef __FUNCT__ 502be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelComplete" 512be2b188SMatthew G Knepley /*@ 522be2b188SMatthew G Knepley DMPlexLabelComplete - Starting with a label marking points on a surface, we add the transitive closure to the surface 532be2b188SMatthew G Knepley 542be2b188SMatthew G Knepley Input Parameters: 552be2b188SMatthew G Knepley + dm - The DM 562be2b188SMatthew G Knepley - label - A DMLabel marking the surface points 572be2b188SMatthew G Knepley 582be2b188SMatthew G Knepley Output Parameter: 592be2b188SMatthew G Knepley . label - A DMLabel marking all surface points in the transitive closure 602be2b188SMatthew G Knepley 612be2b188SMatthew G Knepley Level: developer 622be2b188SMatthew G Knepley 632be2b188SMatthew G Knepley .seealso: DMPlexLabelCohesiveComplete() 642be2b188SMatthew G Knepley @*/ 652be2b188SMatthew G Knepley PetscErrorCode DMPlexLabelComplete(DM dm, DMLabel label) 662be2b188SMatthew G Knepley { 672be2b188SMatthew G Knepley IS valueIS; 682be2b188SMatthew G Knepley const PetscInt *values; 692be2b188SMatthew G Knepley PetscInt numValues, v; 702be2b188SMatthew G Knepley PetscErrorCode ierr; 712be2b188SMatthew G Knepley 722be2b188SMatthew G Knepley PetscFunctionBegin; 732be2b188SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 742be2b188SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 752be2b188SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 762be2b188SMatthew G Knepley for (v = 0; v < numValues; ++v) { 772be2b188SMatthew G Knepley IS pointIS; 782be2b188SMatthew G Knepley const PetscInt *points; 792be2b188SMatthew G Knepley PetscInt numPoints, p; 802be2b188SMatthew G Knepley 812be2b188SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 822be2b188SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 832be2b188SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 842be2b188SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 852be2b188SMatthew G Knepley PetscInt *closure = NULL; 862be2b188SMatthew G Knepley PetscInt closureSize, c; 872be2b188SMatthew G Knepley 882be2b188SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 892be2b188SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 902be2b188SMatthew G Knepley ierr = DMLabelSetValue(label, closure[c], values[v]);CHKERRQ(ierr); 912be2b188SMatthew G Knepley } 922be2b188SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 932be2b188SMatthew G Knepley } 942be2b188SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 952be2b188SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 962be2b188SMatthew G Knepley } 972be2b188SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 982be2b188SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 992be2b188SMatthew G Knepley PetscFunctionReturn(0); 1002be2b188SMatthew G Knepley } 1012be2b188SMatthew G Knepley 1022be2b188SMatthew G Knepley #undef __FUNCT__ 1036cf0e42fSMatthew G. Knepley #define __FUNCT__ "DMPlexLabelAddCells" 1046cf0e42fSMatthew G. Knepley /*@ 1056cf0e42fSMatthew G. Knepley DMPlexLabelAddCells - Starting with a label marking faces on a surface, we add a cell for each face 1066cf0e42fSMatthew G. Knepley 1076cf0e42fSMatthew G. Knepley Input Parameters: 1086cf0e42fSMatthew G. Knepley + dm - The DM 1096cf0e42fSMatthew G. Knepley - label - A DMLabel marking the surface points 1106cf0e42fSMatthew G. Knepley 1116cf0e42fSMatthew G. Knepley Output Parameter: 1126cf0e42fSMatthew G. Knepley . label - A DMLabel incorporating cells 1136cf0e42fSMatthew G. Knepley 1146cf0e42fSMatthew G. Knepley Level: developer 1156cf0e42fSMatthew G. Knepley 1166cf0e42fSMatthew G. Knepley Note: The cells allow FEM boundary conditions to be applied using the cell geometry 1176cf0e42fSMatthew G. Knepley 1186cf0e42fSMatthew G. Knepley .seealso: DMPlexLabelComplete(), DMPlexLabelCohesiveComplete() 1196cf0e42fSMatthew G. Knepley @*/ 1206cf0e42fSMatthew G. Knepley PetscErrorCode DMPlexLabelAddCells(DM dm, DMLabel label) 1216cf0e42fSMatthew G. Knepley { 1226cf0e42fSMatthew G. Knepley IS valueIS; 1236cf0e42fSMatthew G. Knepley const PetscInt *values; 12422eabd52SMatthew G. Knepley PetscInt numValues, v, cStart, cEnd, cEndInterior; 1256cf0e42fSMatthew G. Knepley PetscErrorCode ierr; 1266cf0e42fSMatthew G. Knepley 1276cf0e42fSMatthew G. Knepley PetscFunctionBegin; 1286cf0e42fSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 12922eabd52SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cEndInterior, NULL, NULL, NULL);CHKERRQ(ierr); 13022eabd52SMatthew G. Knepley cEnd = cEndInterior < 0 ? cEnd : cEndInterior; 1316cf0e42fSMatthew G. Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 1326cf0e42fSMatthew G. Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 1336cf0e42fSMatthew G. Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 1346cf0e42fSMatthew G. Knepley for (v = 0; v < numValues; ++v) { 1356cf0e42fSMatthew G. Knepley IS pointIS; 1366cf0e42fSMatthew G. Knepley const PetscInt *points; 1376cf0e42fSMatthew G. Knepley PetscInt numPoints, p; 1386cf0e42fSMatthew G. Knepley 1396cf0e42fSMatthew G. Knepley ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 1406cf0e42fSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 1416cf0e42fSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 1426cf0e42fSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1436cf0e42fSMatthew G. Knepley PetscInt *closure = NULL; 14422eabd52SMatthew G. Knepley PetscInt closureSize, point, cl; 1456cf0e42fSMatthew G. Knepley 1466cf0e42fSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 14722eabd52SMatthew G. Knepley for (cl = closureSize-1; cl > 0; --cl) { 14822eabd52SMatthew G. Knepley point = closure[cl*2]; 14922eabd52SMatthew G. Knepley if ((point >= cStart) && (point < cEnd)) {ierr = DMLabelSetValue(label, point, values[v]);CHKERRQ(ierr); break;} 15022eabd52SMatthew G. Knepley } 1516cf0e42fSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr); 1526cf0e42fSMatthew G. Knepley } 1536cf0e42fSMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 1546cf0e42fSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 1556cf0e42fSMatthew G. Knepley } 1566cf0e42fSMatthew G. Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1576cf0e42fSMatthew G. Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1586cf0e42fSMatthew G. Knepley PetscFunctionReturn(0); 1596cf0e42fSMatthew G. Knepley } 1606cf0e42fSMatthew G. Knepley 1616cf0e42fSMatthew G. Knepley #undef __FUNCT__ 162cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoint_Internal" 163a6ae58d1SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthMax[], PetscInt depthEnd[], PetscInt depthShift[]) 164cd0c2139SMatthew G Knepley { 165cd0c2139SMatthew G Knepley if (depth < 0) return p; 166a6ae58d1SMatthew G. Knepley /* Normal Cells */ if (p < depthMax[depth]) return p; 167a6ae58d1SMatthew G. Knepley /* Hybrid Cells+Normal Vertices */ if (p < depthMax[0]) return p + depthShift[depth]; 168a6ae58d1SMatthew G. Knepley /* Hybrid Vertices+Normal Faces */ if (depth < 2 || p < depthMax[depth-1]) return p + depthShift[depth] + depthShift[0]; 169a6ae58d1SMatthew G. Knepley /* Hybrid Faces+Normal Edges */ if (depth < 3 || p < depthMax[depth-2]) return p + depthShift[depth] + depthShift[0] + depthShift[depth-1]; 170a6ae58d1SMatthew G. Knepley /* Hybrid Edges */ return p + depthShift[depth] + depthShift[0] + depthShift[depth-1] + depthShift[depth-2]; 171cd0c2139SMatthew G Knepley } 172cd0c2139SMatthew G Knepley 173cd0c2139SMatthew G Knepley #undef __FUNCT__ 174cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSizes_Internal" 175cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew) 176cd0c2139SMatthew G Knepley { 177a6ae58d1SMatthew G. Knepley PetscInt *depthMax, *depthEnd; 178cd0c2139SMatthew G Knepley PetscInt depth = 0, d, pStart, pEnd, p; 179cd0c2139SMatthew G Knepley PetscErrorCode ierr; 180cd0c2139SMatthew G Knepley 181cd0c2139SMatthew G Knepley PetscFunctionBegin; 182cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 183cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 1842203a8e9SMatthew G. Knepley ierr = PetscMalloc2(depth+1,&depthMax,depth+1,&depthEnd);CHKERRQ(ierr); 185cd0c2139SMatthew G Knepley /* Step 1: Expand chart */ 186cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 187a6ae58d1SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &depthMax[depth], depth > 0 ? &depthMax[depth-1] : NULL, &depthMax[1], &depthMax[0]);CHKERRQ(ierr); 188cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 189cd0c2139SMatthew G Knepley pEnd += depthShift[d]; 190cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 191a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 192cd0c2139SMatthew G Knepley } 193cd0c2139SMatthew G Knepley ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr); 194cd0c2139SMatthew G Knepley /* Step 2: Set cone and support sizes */ 195cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 196cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 197cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 198a6ae58d1SMatthew G. Knepley PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthMax, depthEnd, depthShift); 199cd0c2139SMatthew G Knepley PetscInt size; 200cd0c2139SMatthew G Knepley 201cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 202cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr); 203cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 204cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr); 205cd0c2139SMatthew G Knepley } 206cd0c2139SMatthew G Knepley } 207a6ae58d1SMatthew G. Knepley ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr); 208cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 209cd0c2139SMatthew G Knepley } 210cd0c2139SMatthew G Knepley 211cd0c2139SMatthew G Knepley #undef __FUNCT__ 212cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoints_Internal" 213cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew) 214cd0c2139SMatthew G Knepley { 215a6ae58d1SMatthew G. Knepley PetscInt *depthEnd, *depthMax, *newpoints; 216dcbb62e8SMatthew G. Knepley PetscInt depth = 0, d, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, pStart, pEnd, p; 217cd0c2139SMatthew G Knepley PetscErrorCode ierr; 218cd0c2139SMatthew G Knepley 219cd0c2139SMatthew G Knepley PetscFunctionBegin; 220cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 221cd0c2139SMatthew G Knepley if (depth < 0) PetscFunctionReturn(0); 222cd0c2139SMatthew G Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 223dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dmNew, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 2242203a8e9SMatthew G. Knepley ierr = PetscMalloc3(depth+1,&depthEnd,depth+1,&depthMax,PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),&newpoints);CHKERRQ(ierr); 225a6ae58d1SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &depthMax[depth], depth > 0 ? &depthMax[depth-1] : NULL, &depthMax[1], &depthMax[0]);CHKERRQ(ierr); 226cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 227cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 228a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 229cd0c2139SMatthew G Knepley } 230cd0c2139SMatthew G Knepley /* Step 5: Set cones and supports */ 231cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 232cd0c2139SMatthew G Knepley for (p = pStart; p < pEnd; ++p) { 233cd0c2139SMatthew G Knepley const PetscInt *points = NULL, *orientations = NULL; 234a6ae58d1SMatthew G. Knepley PetscInt size,sizeNew, i, newp = DMPlexShiftPoint_Internal(p, depth, depthMax, depthEnd, depthShift); 235cd0c2139SMatthew G Knepley 236cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 237cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr); 238cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr); 239cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 240a6ae58d1SMatthew G. Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthMax, depthEnd, depthShift); 241cd0c2139SMatthew G Knepley } 242cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr); 243cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr); 244cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 245dcbb62e8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmNew, newp, &sizeNew);CHKERRQ(ierr); 246cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr); 247cd0c2139SMatthew G Knepley for (i = 0; i < size; ++i) { 248a6ae58d1SMatthew G. Knepley newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthMax, depthEnd, depthShift); 249cd0c2139SMatthew G Knepley } 250dcbb62e8SMatthew G. Knepley for (i = size; i < sizeNew; ++i) newpoints[i] = 0; 251cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr); 252cd0c2139SMatthew G Knepley } 253a6ae58d1SMatthew G. Knepley ierr = PetscFree3(depthEnd,depthMax,newpoints);CHKERRQ(ierr); 254cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 255cd0c2139SMatthew G Knepley } 256cd0c2139SMatthew G Knepley 257cd0c2139SMatthew G Knepley #undef __FUNCT__ 258cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftCoordinates_Internal" 259cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew) 260cd0c2139SMatthew G Knepley { 261cd0c2139SMatthew G Knepley PetscSection coordSection, newCoordSection; 262cd0c2139SMatthew G Knepley Vec coordinates, newCoordinates; 263cd0c2139SMatthew G Knepley PetscScalar *coords, *newCoords; 264cd0c2139SMatthew G Knepley PetscInt *depthEnd, coordSize; 265cd0c2139SMatthew G Knepley PetscInt dim, depth = 0, d, vStart, vEnd, vStartNew, vEndNew, v; 266cd0c2139SMatthew G Knepley PetscErrorCode ierr; 267cd0c2139SMatthew G Knepley 268cd0c2139SMatthew G Knepley PetscFunctionBegin; 269c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 270cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 271854ce69bSBarry Smith ierr = PetscMalloc1(depth+1, &depthEnd);CHKERRQ(ierr); 272cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 273cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 274cd0c2139SMatthew G Knepley } 275cd0c2139SMatthew G Knepley /* Step 8: Convert coordinates */ 276cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 277cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr); 27869d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 279cd0c2139SMatthew G Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr); 280cd0c2139SMatthew G Knepley ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr); 281cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr); 282cd0c2139SMatthew G Knepley ierr = PetscSectionSetChart(newCoordSection, vStartNew, vEndNew);CHKERRQ(ierr); 283cd0c2139SMatthew G Knepley for (v = vStartNew; v < vEndNew; ++v) { 284cd0c2139SMatthew G Knepley ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr); 285cd0c2139SMatthew G Knepley ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr); 286cd0c2139SMatthew G Knepley } 287cd0c2139SMatthew G Knepley ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr); 28846e270d4SMatthew G. Knepley ierr = DMSetCoordinateSection(dmNew, PETSC_DETERMINE, newCoordSection);CHKERRQ(ierr); 289cd0c2139SMatthew G Knepley ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr); 290cd0c2139SMatthew G Knepley ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr); 291cd0c2139SMatthew G Knepley ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr); 292cd0c2139SMatthew G Knepley ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2934e90ef8eSMatthew G. Knepley ierr = VecSetBlockSize(newCoordinates, dim);CHKERRQ(ierr); 2942eb5907fSJed Brown ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr); 295cd0c2139SMatthew G Knepley ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr); 296cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 297cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 298cd0c2139SMatthew G Knepley ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr); 299cd0c2139SMatthew G Knepley for (v = vStart; v < vEnd; ++v) { 300cd0c2139SMatthew G Knepley PetscInt dof, off, noff, d; 301cd0c2139SMatthew G Knepley 302cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 303cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 304a6ae58d1SMatthew G. Knepley ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthEnd, depthEnd, depthShift), &noff);CHKERRQ(ierr); 305cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) { 306cd0c2139SMatthew G Knepley newCoords[noff+d] = coords[off+d]; 307cd0c2139SMatthew G Knepley } 308cd0c2139SMatthew G Knepley } 309cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 310cd0c2139SMatthew G Knepley ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr); 311cd0c2139SMatthew G Knepley ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 312cd0c2139SMatthew G Knepley ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr); 313cd0c2139SMatthew G Knepley ierr = PetscFree(depthEnd);CHKERRQ(ierr); 314cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 315cd0c2139SMatthew G Knepley } 316cd0c2139SMatthew G Knepley 317cd0c2139SMatthew G Knepley #undef __FUNCT__ 318cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal" 319cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew) 320cd0c2139SMatthew G Knepley { 321a6ae58d1SMatthew G. Knepley PetscInt *depthMax, *depthEnd; 322cd0c2139SMatthew G Knepley PetscInt depth = 0, d; 323cd0c2139SMatthew G Knepley PetscSF sfPoint, sfPointNew; 324cd0c2139SMatthew G Knepley const PetscSFNode *remotePoints; 325cd0c2139SMatthew G Knepley PetscSFNode *gremotePoints; 326cd0c2139SMatthew G Knepley const PetscInt *localPoints; 327cd0c2139SMatthew G Knepley PetscInt *glocalPoints, *newLocation, *newRemoteLocation; 328cd0c2139SMatthew G Knepley PetscInt numRoots, numLeaves, l, pStart, pEnd, totShift = 0; 329cd0c2139SMatthew G Knepley PetscErrorCode ierr; 330cd0c2139SMatthew G Knepley 331cd0c2139SMatthew G Knepley PetscFunctionBegin; 332cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3332203a8e9SMatthew G. Knepley ierr = PetscMalloc2(depth+1,&depthMax,depth+1,&depthEnd);CHKERRQ(ierr); 334a6ae58d1SMatthew 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); 335cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 336cd0c2139SMatthew G Knepley totShift += depthShift[d]; 337cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 338a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 339cd0c2139SMatthew G Knepley } 340cd0c2139SMatthew G Knepley /* Step 9: Convert pointSF */ 341cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 342cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr); 343cd0c2139SMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 344cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 345cd0c2139SMatthew G Knepley if (numRoots >= 0) { 346dcca6d9dSJed Brown ierr = PetscMalloc2(numRoots,&newLocation,pEnd-pStart,&newRemoteLocation);CHKERRQ(ierr); 347a6ae58d1SMatthew G. Knepley for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthMax, depthEnd, depthShift); 348cd0c2139SMatthew G Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 349cd0c2139SMatthew G Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 350785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &glocalPoints);CHKERRQ(ierr); 351785e854fSJed Brown ierr = PetscMalloc1(numLeaves, &gremotePoints);CHKERRQ(ierr); 352cd0c2139SMatthew G Knepley for (l = 0; l < numLeaves; ++l) { 353a6ae58d1SMatthew G. Knepley glocalPoints[l] = DMPlexShiftPoint_Internal(localPoints[l], depth, depthMax, depthEnd, depthShift); 354cd0c2139SMatthew G Knepley gremotePoints[l].rank = remotePoints[l].rank; 355cd0c2139SMatthew G Knepley gremotePoints[l].index = newRemoteLocation[localPoints[l]]; 356cd0c2139SMatthew G Knepley } 357cd0c2139SMatthew G Knepley ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr); 358cd0c2139SMatthew G Knepley ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 359cd0c2139SMatthew G Knepley } 360a6ae58d1SMatthew G. Knepley ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr); 361cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 362cd0c2139SMatthew G Knepley } 363cd0c2139SMatthew G Knepley 364cd0c2139SMatthew G Knepley #undef __FUNCT__ 365cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal" 366cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew) 367cd0c2139SMatthew G Knepley { 368cd0c2139SMatthew G Knepley PetscSF sfPoint; 369cd0c2139SMatthew G Knepley DMLabel vtkLabel, ghostLabel; 370a6ae58d1SMatthew G. Knepley PetscInt *depthMax, *depthEnd; 371cd0c2139SMatthew G Knepley const PetscSFNode *leafRemote; 372cd0c2139SMatthew G Knepley const PetscInt *leafLocal; 373cd0c2139SMatthew G Knepley PetscInt depth = 0, d, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f; 374cd0c2139SMatthew G Knepley PetscMPIInt rank; 375cd0c2139SMatthew G Knepley PetscErrorCode ierr; 376cd0c2139SMatthew G Knepley 377cd0c2139SMatthew G Knepley PetscFunctionBegin; 378cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3792203a8e9SMatthew G. Knepley ierr = PetscMalloc2(depth+1,&depthMax,depth+1,&depthEnd);CHKERRQ(ierr); 380a6ae58d1SMatthew 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); 381cd0c2139SMatthew G Knepley for (d = 0; d <= depth; ++d) { 382cd0c2139SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 383a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 384cd0c2139SMatthew G Knepley } 385cd0c2139SMatthew G Knepley /* Step 10: Convert labels */ 386cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 387cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 388cd0c2139SMatthew G Knepley DMLabel label, newlabel; 389cd0c2139SMatthew G Knepley const char *lname; 390cd0c2139SMatthew G Knepley PetscBool isDepth; 391cd0c2139SMatthew G Knepley IS valueIS; 392cd0c2139SMatthew G Knepley const PetscInt *values; 393cd0c2139SMatthew G Knepley PetscInt numValues, val; 394cd0c2139SMatthew G Knepley 395cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr); 396cd0c2139SMatthew G Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 397cd0c2139SMatthew G Knepley if (isDepth) continue; 398cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, lname);CHKERRQ(ierr); 399cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr); 400cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr); 401cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 402cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 403cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 404cd0c2139SMatthew G Knepley for (val = 0; val < numValues; ++val) { 405cd0c2139SMatthew G Knepley IS pointIS; 406cd0c2139SMatthew G Knepley const PetscInt *points; 407cd0c2139SMatthew G Knepley PetscInt numPoints, p; 408cd0c2139SMatthew G Knepley 409cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 410cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 411cd0c2139SMatthew G Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 412cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 413a6ae58d1SMatthew G. Knepley const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthMax, depthEnd, depthShift); 414cd0c2139SMatthew G Knepley 415cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr); 416cd0c2139SMatthew G Knepley } 417cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 418cd0c2139SMatthew G Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 419cd0c2139SMatthew G Knepley } 420cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 421cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 422cd0c2139SMatthew G Knepley } 423a6ae58d1SMatthew G. Knepley ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr); 424cd0c2139SMatthew G Knepley /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */ 425cd0c2139SMatthew G Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 426cd0c2139SMatthew G Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 427cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 428cd0c2139SMatthew G Knepley ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr); 429cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "vtk");CHKERRQ(ierr); 430cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dmNew, "ghost");CHKERRQ(ierr); 431cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr); 432cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr); 433cd0c2139SMatthew G Knepley for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { 434cd0c2139SMatthew G Knepley for (; c < leafLocal[l] && c < cEnd; ++c) { 435cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 436cd0c2139SMatthew G Knepley } 437cd0c2139SMatthew G Knepley if (leafLocal[l] >= cEnd) break; 438cd0c2139SMatthew G Knepley if (leafRemote[l].rank == rank) { 439cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 440cd0c2139SMatthew G Knepley } else { 441cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr); 442cd0c2139SMatthew G Knepley } 443cd0c2139SMatthew G Knepley } 444cd0c2139SMatthew G Knepley for (; c < cEnd; ++c) { 445cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 446cd0c2139SMatthew G Knepley } 447cd0c2139SMatthew G Knepley if (0) { 448cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 449cd0c2139SMatthew G Knepley ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 450cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 451cd0c2139SMatthew G Knepley } 452cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr); 453cd0c2139SMatthew G Knepley for (f = fStart; f < fEnd; ++f) { 454cd0c2139SMatthew G Knepley PetscInt numCells; 455cd0c2139SMatthew G Knepley 456cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr); 457cd0c2139SMatthew G Knepley if (numCells < 2) { 458cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr); 459cd0c2139SMatthew G Knepley } else { 460cd0c2139SMatthew G Knepley const PetscInt *cells = NULL; 461cd0c2139SMatthew G Knepley PetscInt vA, vB; 462cd0c2139SMatthew G Knepley 463cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr); 464cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr); 465cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr); 466cd0c2139SMatthew G Knepley if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);} 467cd0c2139SMatthew G Knepley } 468cd0c2139SMatthew G Knepley } 469cd0c2139SMatthew G Knepley if (0) { 470cd0c2139SMatthew G Knepley ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 471cd0c2139SMatthew G Knepley ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 472cd0c2139SMatthew G Knepley ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 473cd0c2139SMatthew G Knepley } 474cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 475cd0c2139SMatthew G Knepley } 476cd0c2139SMatthew G Knepley 477cd0c2139SMatthew G Knepley #undef __FUNCT__ 478cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal" 479cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm) 480cd0c2139SMatthew G Knepley { 481da97024aSMatthew G. Knepley PetscSF sf; 482cd0c2139SMatthew G Knepley IS valueIS; 483da97024aSMatthew G. Knepley const PetscInt *values, *leaves; 484cd0c2139SMatthew G Knepley PetscInt *depthShift; 485da97024aSMatthew G. Knepley PetscInt depth = 0, nleaves, loc, Ng, numFS, fs, fStart, fEnd, ghostCell, cEnd, c; 486cd0c2139SMatthew G Knepley PetscErrorCode ierr; 487cd0c2139SMatthew G Knepley 488cd0c2139SMatthew G Knepley PetscFunctionBegin; 489da97024aSMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 490da97024aSMatthew G. Knepley ierr = PetscSFGetGraph(sf, NULL, &nleaves, &leaves, NULL);CHKERRQ(ierr); 491da97024aSMatthew G. Knepley nleaves = PetscMax(0, nleaves); 49246c796b9SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 493cd0c2139SMatthew G Knepley /* Count ghost cells */ 494cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 495cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr); 496cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 4974a6cfa73SMatthew G. Knepley Ng = 0; 498cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 49946c796b9SMatthew G. Knepley IS faceIS; 50046c796b9SMatthew G. Knepley const PetscInt *faces; 50146c796b9SMatthew G. Knepley PetscInt numFaces, f, numBdFaces = 0; 502cd0c2139SMatthew G Knepley 50346c796b9SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 50446c796b9SMatthew G. Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 50546c796b9SMatthew G. Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 50646c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 507da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 508da97024aSMatthew G. Knepley if (loc >= 0) continue; 50946c796b9SMatthew G. Knepley if ((faces[f] >= fStart) && (faces[f] < fEnd)) ++numBdFaces; 51046c796b9SMatthew G. Knepley } 5114a6cfa73SMatthew G. Knepley Ng += numBdFaces; 51246c796b9SMatthew G. Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 513cd0c2139SMatthew G Knepley } 514cd0c2139SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 515854ce69bSBarry Smith ierr = PetscMalloc1(depth+1, &depthShift);CHKERRQ(ierr); 516cd0c2139SMatthew G Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 5174a6cfa73SMatthew G. Knepley if (depth >= 0) depthShift[depth] = Ng; 518cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 519cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 520cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 5215acea1aeSMatthew G. Knepley ierr = DMPlexSetHybridBounds(gdm, cEnd, PETSC_DETERMINE, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 5224a6cfa73SMatthew G. Knepley for (c = cEnd; c < cEnd + Ng; ++c) { 523cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr); 524cd0c2139SMatthew G Knepley } 525cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 526cd0c2139SMatthew G Knepley IS faceIS; 527cd0c2139SMatthew G Knepley const PetscInt *faces; 528cd0c2139SMatthew G Knepley PetscInt numFaces, f; 529cd0c2139SMatthew G Knepley 530cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 531cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 532cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 533cd0c2139SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 534cd0c2139SMatthew G Knepley PetscInt size; 535cd0c2139SMatthew G Knepley 536da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 537da97024aSMatthew G. Knepley if (loc >= 0) continue; 53846c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 539cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr); 540cd0c2139SMatthew 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); 5414a6cfa73SMatthew G. Knepley ierr = DMPlexSetSupportSize(gdm, faces[f] + Ng, 2);CHKERRQ(ierr); 542cd0c2139SMatthew G Knepley } 543cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 544cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 545cd0c2139SMatthew G Knepley } 546cd0c2139SMatthew G Knepley /* Step 4: Setup ghosted DM */ 547cd0c2139SMatthew G Knepley ierr = DMSetUp(gdm);CHKERRQ(ierr); 548cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 549cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 550cd0c2139SMatthew G Knepley ghostCell = cEnd; 551cd0c2139SMatthew G Knepley for (fs = 0; fs < numFS; ++fs) { 552cd0c2139SMatthew G Knepley IS faceIS; 553cd0c2139SMatthew G Knepley const PetscInt *faces; 554cd0c2139SMatthew G Knepley PetscInt numFaces, f; 555cd0c2139SMatthew G Knepley 556cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 557cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 558cd0c2139SMatthew G Knepley ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 55946c796b9SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 5604a6cfa73SMatthew G. Knepley PetscInt newFace = faces[f] + Ng; 561cd0c2139SMatthew G Knepley 562da97024aSMatthew G. Knepley ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr); 563da97024aSMatthew G. Knepley if (loc >= 0) continue; 56446c796b9SMatthew G. Knepley if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue; 565cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr); 566cd0c2139SMatthew G Knepley ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr); 56746c796b9SMatthew G. Knepley ++ghostCell; 568cd0c2139SMatthew G Knepley } 569cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 570cd0c2139SMatthew G Knepley ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 571cd0c2139SMatthew G Knepley } 572cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 573cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 574cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 575cd0c2139SMatthew G Knepley ierr = DMPlexStratify(gdm);CHKERRQ(ierr); 576cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 577cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 578cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 579cd0c2139SMatthew G Knepley ierr = PetscFree(depthShift);CHKERRQ(ierr); 580966c7b3fSMatthew G. Knepley /* Step 7: Periodicity */ 581966c7b3fSMatthew G. Knepley if (dm->maxCell) { 582966c7b3fSMatthew G. Knepley const PetscReal *maxCell, *L; 5835dc8c3f7SMatthew G. Knepley const DMBoundaryType *bd; 5845dc8c3f7SMatthew G. Knepley ierr = DMGetPeriodicity(dm, &maxCell, &L, &bd);CHKERRQ(ierr); 5855dc8c3f7SMatthew G. Knepley ierr = DMSetPeriodicity(gdm, maxCell, L, bd);CHKERRQ(ierr); 586966c7b3fSMatthew G. Knepley } 5874a6cfa73SMatthew G. Knepley if (numGhostCells) *numGhostCells = Ng; 588cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 589cd0c2139SMatthew G Knepley } 590cd0c2139SMatthew G Knepley 591cd0c2139SMatthew G Knepley #undef __FUNCT__ 592cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells" 593cd0c2139SMatthew G Knepley /*@C 594cd0c2139SMatthew G Knepley DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face 595cd0c2139SMatthew G Knepley 596cd0c2139SMatthew G Knepley Collective on dm 597cd0c2139SMatthew G Knepley 598cd0c2139SMatthew G Knepley Input Parameters: 599cd0c2139SMatthew G Knepley + dm - The original DM 600cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL 601cd0c2139SMatthew G Knepley 602cd0c2139SMatthew G Knepley Output Parameters: 603cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM 604cd0c2139SMatthew G Knepley - dmGhosted - The new DM 605cd0c2139SMatthew G Knepley 606cd0c2139SMatthew G Knepley Note: If no label exists of that name, one will be created marking all boundary faces 607cd0c2139SMatthew G Knepley 608cd0c2139SMatthew G Knepley Level: developer 609cd0c2139SMatthew G Knepley 610cd0c2139SMatthew G Knepley .seealso: DMCreate() 61131266bc0SMatthew G. Knepley @*/ 612cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted) 613cd0c2139SMatthew G Knepley { 614cd0c2139SMatthew G Knepley DM gdm; 615cd0c2139SMatthew G Knepley DMLabel label; 616cd0c2139SMatthew G Knepley const char *name = labelName ? labelName : "Face Sets"; 617cd0c2139SMatthew G Knepley PetscInt dim; 618a42b08eeSMatthew G. Knepley PetscBool flag; 619cd0c2139SMatthew G Knepley PetscErrorCode ierr; 620cd0c2139SMatthew G Knepley 621cd0c2139SMatthew G Knepley PetscFunctionBegin; 622cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6234a6cfa73SMatthew G. Knepley if (numGhostCells) PetscValidPointer(numGhostCells, 3); 624cd0c2139SMatthew G Knepley PetscValidPointer(dmGhosted, 4); 625cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr); 626cd0c2139SMatthew G Knepley ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr); 627c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 628c73cfb54SMatthew G. Knepley ierr = DMSetDimension(gdm, dim);CHKERRQ(ierr); 629a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseCone(dm, &flag);CHKERRQ(ierr); 630a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseCone(gdm, flag);CHKERRQ(ierr); 631a42b08eeSMatthew G. Knepley ierr = DMPlexGetAdjacencyUseClosure(dm, &flag);CHKERRQ(ierr); 632a42b08eeSMatthew G. Knepley ierr = DMPlexSetAdjacencyUseClosure(gdm, flag);CHKERRQ(ierr); 633cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 634cd0c2139SMatthew G Knepley if (!label) { 635cd0c2139SMatthew G Knepley /* Get label for boundary faces */ 636cd0c2139SMatthew G Knepley ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr); 637cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 638cd0c2139SMatthew G Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 639cd0c2139SMatthew G Knepley } 640cd0c2139SMatthew G Knepley ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr); 6418e136ac0SMatthew G. Knepley ierr = DMPlexCopyBoundary(dm, gdm);CHKERRQ(ierr); 642cd0c2139SMatthew G Knepley *dmGhosted = gdm; 643cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 644cd0c2139SMatthew G Knepley } 645cd0c2139SMatthew G Knepley 646cd0c2139SMatthew G Knepley #undef __FUNCT__ 647cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal" 648607ab7a9SMatthew G. Knepley /* 649faedd622SMatthew G. Knepley We are adding three kinds of points here: 650607ab7a9SMatthew G. Knepley Replicated: Copies of points which exist in the mesh, such as vertices identified across a fault 651faedd622SMatthew G. Knepley Non-replicated: Points which exist on the fault, but are not replicated 652607ab7a9SMatthew G. Knepley Hybrid: Entirely new points, such as cohesive cells 653a6ae58d1SMatthew G. Knepley 654a6ae58d1SMatthew G. Knepley When creating subsequent cohesive cells, we shift the old hybrid cells to the end of the numbering at 655a6ae58d1SMatthew G. Knepley each depth so that the new split/hybrid points can be inserted as a block. 656607ab7a9SMatthew G. Knepley */ 657cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm) 658cd0c2139SMatthew G Knepley { 659cd0c2139SMatthew G Knepley MPI_Comm comm; 660607ab7a9SMatthew G. Knepley IS valueIS; 661607ab7a9SMatthew G. Knepley PetscInt numSP = 0; /* The number of depths for which we have replicated points */ 662607ab7a9SMatthew G. Knepley const PetscInt *values; /* List of depths for which we have replicated points */ 66318c5995bSMatthew G. Knepley IS *splitIS; 66418c5995bSMatthew G. Knepley IS *unsplitIS; 665607ab7a9SMatthew G. Knepley PetscInt *numSplitPoints; /* The number of replicated points at each depth */ 66618c5995bSMatthew G. Knepley PetscInt *numUnsplitPoints; /* The number of non-replicated points at each depth which still give rise to hybrid points */ 66736dbac82SMatthew G. Knepley PetscInt *numHybridPoints; /* The number of new hybrid points at each depth */ 66836dbac82SMatthew G. Knepley PetscInt *numHybridPointsOld; /* The number of existing hybrid points at each depth */ 669607ab7a9SMatthew G. Knepley const PetscInt **splitPoints; /* Replicated points for each depth */ 67018c5995bSMatthew G. Knepley const PetscInt **unsplitPoints; /* Non-replicated points for each depth */ 671cd0c2139SMatthew G Knepley PetscSection coordSection; 672cd0c2139SMatthew G Knepley Vec coordinates; 673cd0c2139SMatthew G Knepley PetscScalar *coords; 674607ab7a9SMatthew G. Knepley PetscInt depths[4]; /* Depths in the order that plex points are numbered */ 675a6ae58d1SMatthew G. Knepley PetscInt *depthMax; /* The first hybrid point at each depth in the original mesh */ 676a6ae58d1SMatthew G. Knepley PetscInt *depthEnd; /* The point limit at each depth in the original mesh */ 677607ab7a9SMatthew G. Knepley PetscInt *depthShift; /* Number of replicated+hybrid points at each depth */ 678607ab7a9SMatthew G. Knepley PetscInt *depthOffset; /* Prefix sums of depthShift */ 679607ab7a9SMatthew G. Knepley PetscInt *pMaxNew; /* The first replicated point at each depth in the new mesh, hybrids come after this */ 680607ab7a9SMatthew G. Knepley PetscInt *coneNew, *coneONew, *supportNew; 68118c5995bSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v; 682cd0c2139SMatthew G Knepley PetscErrorCode ierr; 683cd0c2139SMatthew G Knepley 684cd0c2139SMatthew G Knepley PetscFunctionBegin; 685cd0c2139SMatthew G Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 686c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 687607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 688fd4b9f15SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 689607ab7a9SMatthew G. Knepley depths[0] = depth; 690607ab7a9SMatthew G. Knepley depths[1] = 0; 691607ab7a9SMatthew G. Knepley depths[2] = depth-1; 692607ab7a9SMatthew G. Knepley depths[3] = 1; 693cd0c2139SMatthew G Knepley /* Count split points and add cohesive cells */ 694607ab7a9SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 6952203a8e9SMatthew G. Knepley ierr = PetscMalloc6(depth+1,&depthMax,depth+1,&depthEnd,depth+1,&depthShift,depth+1,&depthOffset,depth+1,&pMaxNew,depth+1,&numHybridPointsOld);CHKERRQ(ierr); 696dcca6d9dSJed 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); 697607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 698607ab7a9SMatthew G. Knepley ierr = PetscMemzero(depthOffset, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 699a6ae58d1SMatthew 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); 700607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 701607ab7a9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 702a6ae58d1SMatthew G. Knepley depthEnd[d] = pMaxNew[d]; 703a6ae58d1SMatthew G. Knepley depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d]; 704607ab7a9SMatthew G. Knepley numSplitPoints[d] = 0; 70518c5995bSMatthew G. Knepley numUnsplitPoints[d] = 0; 706607ab7a9SMatthew G. Knepley numHybridPoints[d] = 0; 707a6ae58d1SMatthew G. Knepley numHybridPointsOld[d] = depthMax[d] < 0 ? 0 : depthEnd[d] - depthMax[d]; 708607ab7a9SMatthew G. Knepley splitPoints[d] = NULL; 70918c5995bSMatthew G. Knepley unsplitPoints[d] = NULL; 71018c5995bSMatthew G. Knepley splitIS[d] = NULL; 71118c5995bSMatthew G. Knepley unsplitIS[d] = NULL; 712607ab7a9SMatthew G. Knepley } 713cd0c2139SMatthew G Knepley if (label) { 714cd0c2139SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 715cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 716cd0c2139SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 717cd0c2139SMatthew G Knepley } 718cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 719cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 720cd0c2139SMatthew G Knepley 721cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 72218c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr); 72318c5995bSMatthew G. Knepley if (splitIS[dep]) { 72418c5995bSMatthew G. Knepley ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 72518c5995bSMatthew G. Knepley ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 72618c5995bSMatthew G. Knepley } 72718c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr); 72818c5995bSMatthew G. Knepley if (unsplitIS[dep]) { 72918c5995bSMatthew G. Knepley ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr); 73018c5995bSMatthew G. Knepley ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr); 731cd0c2139SMatthew G Knepley } 732cd0c2139SMatthew G Knepley } 733607ab7a9SMatthew G. Knepley /* Calculate number of hybrid points */ 73418c5995bSMatthew 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 */ 735607ab7a9SMatthew G. Knepley for (d = 0; d <= depth; ++d) depthShift[d] = numSplitPoints[d] + numHybridPoints[d]; 736607ab7a9SMatthew G. Knepley for (d = 1; d <= depth; ++d) depthOffset[depths[d]] = depthOffset[depths[d-1]] + depthShift[depths[d-1]]; 737a6ae58d1SMatthew G. Knepley for (d = 0; d <= depth; ++d) pMaxNew[d] += depthOffset[d] - numHybridPointsOld[d]; 738cd0c2139SMatthew G Knepley ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 739cd0c2139SMatthew G Knepley /* Step 3: Set cone/support sizes for new points */ 740cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 741cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 742cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 743a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 7444c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 745cd0c2139SMatthew G Knepley const PetscInt *support; 7464c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, qf, qn, qp, e; 747cd0c2139SMatthew G Knepley 748cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 749cd0c2139SMatthew G Knepley ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 750cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 751cd0c2139SMatthew G Knepley ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 752cd0c2139SMatthew G Knepley if (dep == depth-1) { 7534c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 7544c367dbcSMatthew G. Knepley 755cd0c2139SMatthew G Knepley /* Add cohesive cells, they are prisms */ 7564c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr); 757cd0c2139SMatthew G Knepley } else if (dep == 0) { 7584c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 759cd0c2139SMatthew G Knepley 760cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 7614c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 762cd0c2139SMatthew G Knepley PetscInt val; 763cd0c2139SMatthew G Knepley 764cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 7654c367dbcSMatthew G. Knepley if (val == 1) ++qf; 7664c367dbcSMatthew G. Knepley if ((val == 1) || (val == (shift + 1))) ++qn; 7674c367dbcSMatthew G. Knepley if ((val == 1) || (val == -(shift + 1))) ++qp; 768cd0c2139SMatthew G Knepley } 7694c367dbcSMatthew G. Knepley /* Split old vertex: Edges into original vertex and new cohesive edge */ 7704c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 7714c367dbcSMatthew G. Knepley /* Split new vertex: Edges into split vertex and new cohesive edge */ 7724c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 7734c367dbcSMatthew G. Knepley /* Add hybrid edge */ 7744c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 7754c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 776cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 7774c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 7784c367dbcSMatthew G. Knepley 779cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 7804c367dbcSMatthew G. Knepley for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 781cd0c2139SMatthew G Knepley PetscInt val; 782cd0c2139SMatthew G Knepley 783cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 7844c367dbcSMatthew G. Knepley if (val == dim-1) ++qf; 7854c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 7864c367dbcSMatthew G. Knepley if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 787cd0c2139SMatthew G Knepley } 7884c367dbcSMatthew G. Knepley /* Split old edge: Faces into original edge and cohesive face (positive side?) */ 7894c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 7904c367dbcSMatthew G. Knepley /* Split new edge: Faces into split edge and cohesive face (negative side?) */ 7914c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 7924c367dbcSMatthew G. Knepley /* Add hybrid face */ 7934c367dbcSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 7944c367dbcSMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 795cd0c2139SMatthew G Knepley } 796cd0c2139SMatthew G Knepley } 797cd0c2139SMatthew G Knepley } 79818c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 79918c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 80018c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 801a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 80218c5995bSMatthew G. Knepley const PetscInt *support; 803da1dd7e4SMatthew G. Knepley PetscInt coneSize, supportSize, qf, e, s; 80418c5995bSMatthew G. Knepley 80518c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 80618c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 80739254ff6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 80818c5995bSMatthew G. Knepley if (dep == 0) { 80918c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 81018c5995bSMatthew G. Knepley 81139254ff6SMatthew G. Knepley /* Unsplit vertex: Edges into original vertex, split edges, and new cohesive edge twice */ 81239254ff6SMatthew G. Knepley for (s = 0, qf = 0; s < supportSize; ++s, ++qf) { 81339254ff6SMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 81439254ff6SMatthew G. Knepley if (e >= 0) ++qf; 81539254ff6SMatthew G. Knepley } 81639254ff6SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 81718c5995bSMatthew G. Knepley /* Add hybrid edge */ 81818c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 819e1757548SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 820e1757548SMatthew G. Knepley PetscInt val; 821e1757548SMatthew G. Knepley 822e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 823e1757548SMatthew G. Knepley /* Split and unsplit edges produce hybrid faces */ 824da1dd7e4SMatthew G. Knepley if (val == 1) ++qf; 825da1dd7e4SMatthew G. Knepley if (val == (shift2 + 1)) ++qf; 826e1757548SMatthew G. Knepley } 827e1757548SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 82818c5995bSMatthew G. Knepley } else if (dep == dim-2) { 82918c5995bSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 830cd0c2139SMatthew G Knepley PetscInt val; 831cd0c2139SMatthew G Knepley 832da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 833cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 834da1dd7e4SMatthew G. Knepley if (val == dim-1) qf += 2; 835da1dd7e4SMatthew G. Knepley else ++qf; 836cd0c2139SMatthew G Knepley } 83718c5995bSMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */ 838da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr); 83918c5995bSMatthew G. Knepley /* Add hybrid face */ 840da1dd7e4SMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 841da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 842da1dd7e4SMatthew G. Knepley if (val == dim-1) ++qf; 843da1dd7e4SMatthew G. Knepley } 84418c5995bSMatthew G. Knepley ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 845da1dd7e4SMatthew G. Knepley ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 846cd0c2139SMatthew G Knepley } 847cd0c2139SMatthew G Knepley } 848cd0c2139SMatthew G Knepley } 849cd0c2139SMatthew G Knepley /* Step 4: Setup split DM */ 850cd0c2139SMatthew G Knepley ierr = DMSetUp(sdm);CHKERRQ(ierr); 851cd0c2139SMatthew G Knepley ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 852dcbb62e8SMatthew G. Knepley ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr); 853dcca6d9dSJed Brown ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),&supportNew);CHKERRQ(ierr); 854cd0c2139SMatthew G Knepley /* Step 6: Set cones and supports for new points */ 855cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 856cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 857cd0c2139SMatthew G Knepley const PetscInt oldp = splitPoints[dep][p]; 858a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 8594c367dbcSMatthew G. Knepley const PetscInt splitp = p + pMaxNew[dep]; 860cd0c2139SMatthew G Knepley const PetscInt *cone, *support, *ornt; 8614c367dbcSMatthew G. Knepley PetscInt coneSize, supportSize, q, qf, qn, qp, v, e, s; 862cd0c2139SMatthew G Knepley 863cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 864cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 865cd0c2139SMatthew G Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 866cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 867cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 868cd0c2139SMatthew G Knepley if (dep == depth-1) { 86996a07cd0SMatthew G. Knepley PetscBool hasUnsplit = PETSC_FALSE; 8704c367dbcSMatthew G. Knepley const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 871cd0c2139SMatthew G Knepley const PetscInt *supportF; 872cd0c2139SMatthew G Knepley 873cd0c2139SMatthew G Knepley /* Split face: copy in old face to new face to start */ 874cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 875cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 876cd0c2139SMatthew G Knepley /* Split old face: old vertices/edges in cone so no change */ 877cd0c2139SMatthew G Knepley /* Split new face: new vertices/edges in cone */ 878cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 8794c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 88018c5995bSMatthew G. Knepley if (v < 0) { 88118c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 88218c5995bSMatthew 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); 883a6ae58d1SMatthew G. Knepley coneNew[2+q] = DMPlexShiftPoint_Internal(cone[q], depth, depthMax, depthEnd, depthShift) /*cone[q] + depthOffset[dep-1]*/; 88496a07cd0SMatthew G. Knepley hasUnsplit = PETSC_TRUE; 88518c5995bSMatthew G. Knepley } else { 8864c367dbcSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep-1]; 887163235baSMatthew G. Knepley if (dep > 1) { 888163235baSMatthew G. Knepley const PetscInt *econe; 889163235baSMatthew G. Knepley PetscInt econeSize, r, vs, vu; 890163235baSMatthew G. Knepley 891163235baSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[q], &econeSize);CHKERRQ(ierr); 892163235baSMatthew G. Knepley ierr = DMPlexGetCone(dm, cone[q], &econe);CHKERRQ(ierr); 893163235baSMatthew G. Knepley for (r = 0; r < econeSize; ++r) { 894163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numSplitPoints[dep-2], splitPoints[dep-2], &vs);CHKERRQ(ierr); 895163235baSMatthew G. Knepley ierr = PetscFindInt(econe[r], numUnsplitPoints[dep-2], unsplitPoints[dep-2], &vu);CHKERRQ(ierr); 896163235baSMatthew G. Knepley if (vs >= 0) continue; 897163235baSMatthew 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); 898163235baSMatthew G. Knepley hasUnsplit = PETSC_TRUE; 899163235baSMatthew G. Knepley } 900163235baSMatthew G. Knepley } 901cd0c2139SMatthew G Knepley } 902cd0c2139SMatthew G Knepley } 903cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 904cd0c2139SMatthew G Knepley ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 905e537020bSMatthew G. Knepley /* Face support */ 906cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 907cd0c2139SMatthew G Knepley PetscInt val; 908cd0c2139SMatthew G Knepley 909cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 910cd0c2139SMatthew G Knepley if (val < 0) { 911cd0c2139SMatthew G Knepley /* Split old face: Replace negative side cell with cohesive cell */ 9124c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr); 913cd0c2139SMatthew G Knepley } else { 914cd0c2139SMatthew G Knepley /* Split new face: Replace positive side cell with cohesive cell */ 9154c367dbcSMatthew G. Knepley ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr); 916e537020bSMatthew G. Knepley /* Get orientation for cohesive face */ 917e537020bSMatthew G. Knepley { 918e537020bSMatthew G. Knepley const PetscInt *ncone, *nconeO; 919e537020bSMatthew G. Knepley PetscInt nconeSize, nc; 920e537020bSMatthew G. Knepley 921e537020bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 922e537020bSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 923e537020bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 924e537020bSMatthew G. Knepley for (nc = 0; nc < nconeSize; ++nc) { 925e537020bSMatthew G. Knepley if (ncone[nc] == oldp) { 926e537020bSMatthew G. Knepley coneONew[0] = nconeO[nc]; 927e537020bSMatthew G. Knepley break; 928cd0c2139SMatthew G Knepley } 929cd0c2139SMatthew G Knepley } 930e537020bSMatthew 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]); 931e537020bSMatthew G. Knepley } 932e537020bSMatthew G. Knepley } 933e537020bSMatthew G. Knepley } 9344c367dbcSMatthew G. Knepley /* Cohesive cell: Old and new split face, then new cohesive faces */ 935fd4b9f15SMatthew G. Knepley coneNew[0] = newp; /* Extracted negative side orientation above */ 9364c367dbcSMatthew G. Knepley coneNew[1] = splitp; 9374c367dbcSMatthew G. Knepley coneONew[1] = coneONew[0]; 938e537020bSMatthew G. Knepley for (q = 0; q < coneSize; ++q) { 93918c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 94018c5995bSMatthew G. Knepley if (v < 0) { 94118c5995bSMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 94218c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 94318c5995bSMatthew G. Knepley coneONew[2+q] = 0; 94418c5995bSMatthew G. Knepley } else { 94518c5995bSMatthew G. Knepley coneNew[2+q] = v + pMaxNew[dep] + numSplitPoints[dep]; 94618c5995bSMatthew G. Knepley } 947e537020bSMatthew G. Knepley coneONew[2+q] = 0; 948e537020bSMatthew G. Knepley } 9494c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr); 9504c367dbcSMatthew G. Knepley ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr); 95196a07cd0SMatthew G. Knepley /* Label the hybrid cells on the boundary of the split */ 95296a07cd0SMatthew G. Knepley if (hasUnsplit) {ierr = DMLabelSetValue(label, -hybcell, dim);CHKERRQ(ierr);} 953cd0c2139SMatthew G Knepley } else if (dep == 0) { 9544c367dbcSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 955cd0c2139SMatthew G Knepley 956cd0c2139SMatthew G Knepley /* Split old vertex: Edges in old split faces and new cohesive edge */ 9574c367dbcSMatthew G. Knepley for (e = 0, qn = 0; e < supportSize; ++e) { 958cd0c2139SMatthew G Knepley PetscInt val; 959cd0c2139SMatthew G Knepley 960cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 961cd0c2139SMatthew G Knepley if ((val == 1) || (val == (shift + 1))) { 962a6ae58d1SMatthew G. Knepley supportNew[qn++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 963cd0c2139SMatthew G Knepley } 964cd0c2139SMatthew G Knepley } 9654c367dbcSMatthew G. Knepley supportNew[qn] = hybedge; 966cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 967cd0c2139SMatthew G Knepley /* Split new vertex: Edges in new split faces and new cohesive edge */ 9684c367dbcSMatthew G. Knepley for (e = 0, qp = 0; e < supportSize; ++e) { 969cd0c2139SMatthew G Knepley PetscInt val, edge; 970cd0c2139SMatthew G Knepley 971cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 972cd0c2139SMatthew G Knepley if (val == 1) { 9734c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 974cd0c2139SMatthew G Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 9754c367dbcSMatthew G. Knepley supportNew[qp++] = edge + pMaxNew[dep+1]; 976cd0c2139SMatthew G Knepley } else if (val == -(shift + 1)) { 977a6ae58d1SMatthew G. Knepley supportNew[qp++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 978cd0c2139SMatthew G Knepley } 979cd0c2139SMatthew G Knepley } 9804c367dbcSMatthew G. Knepley supportNew[qp] = hybedge; 981cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 9824c367dbcSMatthew G. Knepley /* Hybrid edge: Old and new split vertex */ 983cd0c2139SMatthew G Knepley coneNew[0] = newp; 984cd0c2139SMatthew G Knepley coneNew[1] = splitp; 9854c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 9864c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 9874c367dbcSMatthew G. Knepley PetscInt val, edge; 9884c367dbcSMatthew G. Knepley 9894c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 9904c367dbcSMatthew G. Knepley if (val == 1) { 9914c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 9924c367dbcSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 9934c367dbcSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 9944c367dbcSMatthew G. Knepley } 9954c367dbcSMatthew G. Knepley } 9964c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 997cd0c2139SMatthew G Knepley } else if (dep == dim-2) { 9984c367dbcSMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 9994c367dbcSMatthew G. Knepley 1000cd0c2139SMatthew G Knepley /* Split old edge: old vertices in cone so no change */ 1001cd0c2139SMatthew G Knepley /* Split new edge: new vertices in cone */ 1002cd0c2139SMatthew G Knepley for (q = 0; q < coneSize; ++q) { 10034c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 1004e1757548SMatthew G. Knepley if (v < 0) { 1005e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1006e1757548SMatthew 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); 1007a6ae58d1SMatthew G. Knepley coneNew[q] = DMPlexShiftPoint_Internal(cone[q], depth, depthMax, depthEnd, depthShift) /*cone[q] + depthOffset[dep-1]*/; 1008e1757548SMatthew G. Knepley } else { 10094c367dbcSMatthew G. Knepley coneNew[q] = v + pMaxNew[dep-1]; 1010cd0c2139SMatthew G Knepley } 1011e1757548SMatthew G. Knepley } 1012cd0c2139SMatthew G Knepley ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 1013cd0c2139SMatthew G Knepley /* Split old edge: Faces in positive side cells and old split faces */ 1014cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 1015cd0c2139SMatthew G Knepley PetscInt val; 1016cd0c2139SMatthew G Knepley 1017cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 10184c367dbcSMatthew G. Knepley if (val == dim-1) { 1019a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 10204c367dbcSMatthew G. Knepley } else if (val == (shift + dim-1)) { 1021a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 1022cd0c2139SMatthew G Knepley } 1023cd0c2139SMatthew G Knepley } 1024b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1025cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1026cd0c2139SMatthew G Knepley /* Split new edge: Faces in negative side cells and new split faces */ 1027cd0c2139SMatthew G Knepley for (e = 0, q = 0; e < supportSize; ++e) { 1028cd0c2139SMatthew G Knepley PetscInt val, face; 1029cd0c2139SMatthew G Knepley 1030cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 1031cd0c2139SMatthew G Knepley if (val == dim-1) { 10324c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1033cd0c2139SMatthew G Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 10344c367dbcSMatthew G. Knepley supportNew[q++] = face + pMaxNew[dep+1]; 1035cd0c2139SMatthew G Knepley } else if (val == -(shift + dim-1)) { 1036a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/; 1037cd0c2139SMatthew G Knepley } 1038cd0c2139SMatthew G Knepley } 1039b279cd2aSMatthew G. Knepley supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1040cd0c2139SMatthew G Knepley ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 10414c367dbcSMatthew G. Knepley /* Hybrid face */ 10424c367dbcSMatthew G. Knepley coneNew[0] = newp; 10434c367dbcSMatthew G. Knepley coneNew[1] = splitp; 10444c367dbcSMatthew G. Knepley for (v = 0; v < coneSize; ++v) { 10454c367dbcSMatthew G. Knepley PetscInt vertex; 10464c367dbcSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr); 1047e1757548SMatthew G. Knepley if (vertex < 0) { 1048e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr); 1049e1757548SMatthew 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); 1050e1757548SMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1051e1757548SMatthew G. Knepley } else { 10524c367dbcSMatthew G. Knepley coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep]; 10534c367dbcSMatthew G. Knepley } 1054e1757548SMatthew G. Knepley } 10554c367dbcSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 10564c367dbcSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 10574c367dbcSMatthew G. Knepley PetscInt val, face; 10584c367dbcSMatthew G. Knepley 10594c367dbcSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 10604c367dbcSMatthew G. Knepley if (val == dim-1) { 10614c367dbcSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 10624c367dbcSMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 10634c367dbcSMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 10644c367dbcSMatthew G. Knepley } 10654c367dbcSMatthew G. Knepley } 10664c367dbcSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1067cd0c2139SMatthew G Knepley } 1068cd0c2139SMatthew G Knepley } 1069cd0c2139SMatthew G Knepley } 107018c5995bSMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 107118c5995bSMatthew G. Knepley for (p = 0; p < numUnsplitPoints[dep]; ++p) { 107218c5995bSMatthew G. Knepley const PetscInt oldp = unsplitPoints[dep][p]; 1073a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/; 107418c5995bSMatthew G. Knepley const PetscInt *cone, *support, *ornt; 1075e1757548SMatthew G. Knepley PetscInt coneSize, supportSize, supportSizeNew, q, qf, e, f, s; 107618c5995bSMatthew G. Knepley 107718c5995bSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 107818c5995bSMatthew G. Knepley ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 107918c5995bSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 108018c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 108118c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 108218c5995bSMatthew G. Knepley if (dep == 0) { 108318c5995bSMatthew G. Knepley const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 108418c5995bSMatthew G. Knepley 108518c5995bSMatthew G. Knepley /* Unsplit vertex */ 108618c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 108718c5995bSMatthew G. Knepley for (s = 0, q = 0; s < supportSize; ++s) { 1088a6ae58d1SMatthew G. Knepley supportNew[q++] = DMPlexShiftPoint_Internal(support[s], depth, depthMax, depthEnd, depthShift) /*support[s] + depthOffset[dep+1]*/; 108918c5995bSMatthew G. Knepley ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr); 109018c5995bSMatthew G. Knepley if (e >= 0) { 109118c5995bSMatthew G. Knepley supportNew[q++] = e + pMaxNew[dep+1]; 109218c5995bSMatthew G. Knepley } 109318c5995bSMatthew G. Knepley } 109418c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 109518c5995bSMatthew G. Knepley supportNew[q++] = hybedge; 109618c5995bSMatthew G. Knepley if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp); 109718c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 109818c5995bSMatthew G. Knepley /* Hybrid edge */ 109918c5995bSMatthew G. Knepley coneNew[0] = newp; 110018c5995bSMatthew G. Knepley coneNew[1] = newp; 110118c5995bSMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 110218c5995bSMatthew G. Knepley for (e = 0, qf = 0; e < supportSize; ++e) { 110318c5995bSMatthew G. Knepley PetscInt val, edge; 110418c5995bSMatthew G. Knepley 110518c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 110618c5995bSMatthew G. Knepley if (val == 1) { 110718c5995bSMatthew G. Knepley ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 110818c5995bSMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 110918c5995bSMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1110e1757548SMatthew G. Knepley } else if (val == (shift2 + 1)) { 1111e1757548SMatthew G. Knepley ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr); 1112e1757548SMatthew G. Knepley if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]); 1113e1757548SMatthew G. Knepley supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1]; 111418c5995bSMatthew G. Knepley } 111518c5995bSMatthew G. Knepley } 111618c5995bSMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 1117e1757548SMatthew G. Knepley } else if (dep == dim-2) { 1118e1757548SMatthew G. Knepley const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep]; 1119e1757548SMatthew G. Knepley 1120da1dd7e4SMatthew G. Knepley /* Unsplit edge: Faces into original edge, split face, and hybrid face twice */ 1121e1757548SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1122e1757548SMatthew G. Knepley PetscInt val, face; 1123e1757548SMatthew G. Knepley 1124e1757548SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1125e1757548SMatthew G. Knepley if (val == dim-1) { 1126e1757548SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1127e1757548SMatthew G. Knepley if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]); 1128a6ae58d1SMatthew G. Knepley supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthMax, depthEnd, depthShift) /*support[f] + depthOffset[dep+1]*/; 1129e1757548SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+1]; 1130e1757548SMatthew G. Knepley } else { 1131a6ae58d1SMatthew G. Knepley supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthMax, depthEnd, depthShift) /*support[f] + depthOffset[dep+1]*/; 1132e1757548SMatthew G. Knepley } 1133e1757548SMatthew G. Knepley } 1134e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1135e1757548SMatthew G. Knepley supportNew[qf++] = hybface; 1136da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr); 1137da1dd7e4SMatthew 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); 1138e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 1139e1757548SMatthew G. Knepley /* Add hybrid face */ 1140e1757548SMatthew G. Knepley coneNew[0] = newp; 1141212cc919SMatthew G. Knepley coneNew[1] = newp; 1142e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[0], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1143e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[0]); 1144212cc919SMatthew G. Knepley coneNew[2] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1145e1757548SMatthew G. Knepley ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr); 1146e1757548SMatthew G. Knepley if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]); 1147e1757548SMatthew G. Knepley coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1]; 1148e1757548SMatthew G. Knepley ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 1149da1dd7e4SMatthew G. Knepley for (f = 0, qf = 0; f < supportSize; ++f) { 1150da1dd7e4SMatthew G. Knepley PetscInt val, face; 1151da1dd7e4SMatthew G. Knepley 1152da1dd7e4SMatthew G. Knepley ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr); 1153da1dd7e4SMatthew G. Knepley if (val == dim-1) { 1154da1dd7e4SMatthew G. Knepley ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 1155da1dd7e4SMatthew G. Knepley supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 1156da1dd7e4SMatthew G. Knepley } 1157da1dd7e4SMatthew G. Knepley } 1158da1dd7e4SMatthew G. Knepley ierr = DMPlexGetSupportSize(sdm, hybface, &supportSizeNew);CHKERRQ(ierr); 1159da1dd7e4SMatthew 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); 1160e1757548SMatthew G. Knepley ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 1161cd0c2139SMatthew G Knepley } 1162cd0c2139SMatthew G Knepley } 1163cd0c2139SMatthew G Knepley } 1164cd0c2139SMatthew G Knepley /* Step 6b: Replace split points in negative side cones */ 1165cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1166cd0c2139SMatthew G Knepley PetscInt dep = values[sp]; 1167cd0c2139SMatthew G Knepley IS pIS; 1168cd0c2139SMatthew G Knepley PetscInt numPoints; 1169cd0c2139SMatthew G Knepley const PetscInt *points; 1170cd0c2139SMatthew G Knepley 1171cd0c2139SMatthew G Knepley if (dep >= 0) continue; 1172cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 1173cd0c2139SMatthew G Knepley if (!pIS) continue; 1174cd0c2139SMatthew G Knepley dep = -dep - shift; 1175cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 1176cd0c2139SMatthew G Knepley ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 1177cd0c2139SMatthew G Knepley for (p = 0; p < numPoints; ++p) { 1178cd0c2139SMatthew G Knepley const PetscInt oldp = points[p]; 1179a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*depthOffset[dep] + oldp*/; 1180cd0c2139SMatthew G Knepley const PetscInt *cone; 1181cd0c2139SMatthew G Knepley PetscInt coneSize, c; 118250cf782dSMatthew G. Knepley /* PetscBool replaced = PETSC_FALSE; */ 1183cd0c2139SMatthew G Knepley 1184cd0c2139SMatthew G Knepley /* Negative edge: replace split vertex */ 1185cd0c2139SMatthew G Knepley /* Negative cell: replace split face */ 1186cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 1187cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 1188cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1189cd0c2139SMatthew G Knepley const PetscInt coldp = cone[c] - depthOffset[dep-1]; 1190cd0c2139SMatthew G Knepley PetscInt csplitp, cp, val; 1191cd0c2139SMatthew G Knepley 1192cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 1193cd0c2139SMatthew G Knepley if (val == dep-1) { 1194cd0c2139SMatthew G Knepley ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 1195cd0c2139SMatthew G Knepley if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 1196cd0c2139SMatthew G Knepley csplitp = pMaxNew[dep-1] + cp; 1197cd0c2139SMatthew G Knepley ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 119850cf782dSMatthew G. Knepley /* replaced = PETSC_TRUE; */ 1199cd0c2139SMatthew G Knepley } 1200cd0c2139SMatthew G Knepley } 12014a189a86SMatthew G. Knepley /* Cells with only a vertex or edge on the submesh have no replacement */ 12024a189a86SMatthew G. Knepley /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 1203cd0c2139SMatthew G Knepley } 1204cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 1205cd0c2139SMatthew G Knepley ierr = ISDestroy(&pIS);CHKERRQ(ierr); 1206cd0c2139SMatthew G Knepley } 1207cd0c2139SMatthew G Knepley /* Step 7: Stratify */ 1208cd0c2139SMatthew G Knepley ierr = DMPlexStratify(sdm);CHKERRQ(ierr); 1209cd0c2139SMatthew G Knepley /* Step 8: Coordinates */ 1210cd0c2139SMatthew G Knepley ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 121169d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 1212cd0c2139SMatthew G Knepley ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 1213cd0c2139SMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 1214cd0c2139SMatthew G Knepley for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 1215a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[0][v], depth, depthMax, depthEnd, depthShift) /*depthOffset[0] + splitPoints[0][v]*/; 1216cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[0] + v; 1217cd0c2139SMatthew G Knepley PetscInt dof, off, soff, d; 1218cd0c2139SMatthew G Knepley 1219cd0c2139SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 1220cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 1221cd0c2139SMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 1222cd0c2139SMatthew G Knepley for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 1223cd0c2139SMatthew G Knepley } 1224cd0c2139SMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 1225cd0c2139SMatthew G Knepley /* Step 9: SF, if I can figure this out we can split the mesh in parallel */ 1226cd0c2139SMatthew G Knepley ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1227cd0c2139SMatthew G Knepley /* Step 10: Labels */ 1228cd0c2139SMatthew G Knepley ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 1229cd0c2139SMatthew G Knepley ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 1230cd0c2139SMatthew G Knepley for (dep = 0; dep <= depth; ++dep) { 1231cd0c2139SMatthew G Knepley for (p = 0; p < numSplitPoints[dep]; ++p) { 1232a6ae58d1SMatthew G. Knepley const PetscInt newp = DMPlexShiftPoint_Internal(splitPoints[dep][p], depth, depthMax, depthEnd, depthShift) /*depthOffset[dep] + splitPoints[dep][p]*/; 1233cd0c2139SMatthew G Knepley const PetscInt splitp = pMaxNew[dep] + p; 1234cd0c2139SMatthew G Knepley PetscInt l; 1235cd0c2139SMatthew G Knepley 1236cd0c2139SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 1237cd0c2139SMatthew G Knepley DMLabel mlabel; 1238cd0c2139SMatthew G Knepley const char *lname; 1239cd0c2139SMatthew G Knepley PetscInt val; 12409a356370SMatthew G. Knepley PetscBool isDepth; 1241cd0c2139SMatthew G Knepley 1242cd0c2139SMatthew G Knepley ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 12439a356370SMatthew G. Knepley ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 12449a356370SMatthew G. Knepley if (isDepth) continue; 1245cd0c2139SMatthew G Knepley ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 1246cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 1247cd0c2139SMatthew G Knepley if (val >= 0) { 1248cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 12499a356370SMatthew G. Knepley #if 0 12509a356370SMatthew G. Knepley /* Do not put cohesive edges into the label */ 1251cd0c2139SMatthew G Knepley if (dep == 0) { 12524c367dbcSMatthew G. Knepley const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 1253cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr); 12544c367dbcSMatthew G. Knepley } else if (dep == dim-2) { 12554c367dbcSMatthew G. Knepley const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 12564c367dbcSMatthew G. Knepley ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr); 1257cd0c2139SMatthew G Knepley } 12584c367dbcSMatthew G. Knepley /* Do not put cohesive faces into the label */ 12599a356370SMatthew G. Knepley #endif 1260cd0c2139SMatthew G Knepley } 1261cd0c2139SMatthew G Knepley } 1262cd0c2139SMatthew G Knepley } 1263cd0c2139SMatthew G Knepley } 1264cd0c2139SMatthew G Knepley for (sp = 0; sp < numSP; ++sp) { 1265cd0c2139SMatthew G Knepley const PetscInt dep = values[sp]; 1266cd0c2139SMatthew G Knepley 1267cd0c2139SMatthew G Knepley if ((dep < 0) || (dep > depth)) continue; 126818c5995bSMatthew G. Knepley if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 126918c5995bSMatthew G. Knepley ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr); 127018c5995bSMatthew G. Knepley if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);} 127118c5995bSMatthew G. Knepley ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr); 1272cd0c2139SMatthew G Knepley } 1273cd0c2139SMatthew G Knepley if (label) { 1274cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 1275cd0c2139SMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 1276cd0c2139SMatthew G Knepley } 12770d4d4d06SMatthew G. Knepley for (d = 0; d <= depth; ++d) { 12780d4d4d06SMatthew G. Knepley ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr); 127936dbac82SMatthew G. Knepley pMaxNew[d] = pEnd - numHybridPoints[d] - numHybridPointsOld[d]; 12800d4d4d06SMatthew G. Knepley } 12810e49e2e2SMatthew 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); 1282dcbb62e8SMatthew G. Knepley ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr); 1283a6ae58d1SMatthew G. Knepley ierr = PetscFree6(depthMax, depthEnd, depthShift, depthOffset, pMaxNew, numHybridPointsOld);CHKERRQ(ierr); 128418c5995bSMatthew G. Knepley ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr); 1285cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1286cd0c2139SMatthew G Knepley } 1287cd0c2139SMatthew G Knepley 1288cd0c2139SMatthew G Knepley #undef __FUNCT__ 1289cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells" 1290cd0c2139SMatthew G Knepley /*@C 1291cd0c2139SMatthew G Knepley DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 1292cd0c2139SMatthew G Knepley 1293cd0c2139SMatthew G Knepley Collective on dm 1294cd0c2139SMatthew G Knepley 1295cd0c2139SMatthew G Knepley Input Parameters: 1296cd0c2139SMatthew G Knepley + dm - The original DM 129753156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated) 1298cd0c2139SMatthew G Knepley 1299cd0c2139SMatthew G Knepley Output Parameters: 1300cd0c2139SMatthew G Knepley - dmSplit - The new DM 1301cd0c2139SMatthew G Knepley 1302cd0c2139SMatthew G Knepley Level: developer 1303cd0c2139SMatthew G Knepley 13042be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 1305cd0c2139SMatthew G Knepley @*/ 1306cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 1307cd0c2139SMatthew G Knepley { 1308cd0c2139SMatthew G Knepley DM sdm; 1309cd0c2139SMatthew G Knepley PetscInt dim; 1310cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1311cd0c2139SMatthew G Knepley 1312cd0c2139SMatthew G Knepley PetscFunctionBegin; 1313cd0c2139SMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 131453156dfcSMatthew G. Knepley PetscValidPointer(dmSplit, 3); 1315cd0c2139SMatthew G Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 1316cd0c2139SMatthew G Knepley ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 1317c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1318c73cfb54SMatthew G. Knepley ierr = DMSetDimension(sdm, dim);CHKERRQ(ierr); 1319cd0c2139SMatthew G Knepley switch (dim) { 1320cd0c2139SMatthew G Knepley case 2: 1321cd0c2139SMatthew G Knepley case 3: 1322cd0c2139SMatthew G Knepley ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 1323cd0c2139SMatthew G Knepley break; 1324cd0c2139SMatthew G Knepley default: 1325cd0c2139SMatthew G Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 1326cd0c2139SMatthew G Knepley } 1327cd0c2139SMatthew G Knepley *dmSplit = sdm; 1328cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1329cd0c2139SMatthew G Knepley } 1330cd0c2139SMatthew G Knepley 1331cd0c2139SMatthew G Knepley #undef __FUNCT__ 13320f66a230SMatthew G. Knepley #define __FUNCT__ "GetSurfaceSide_Static" 13330f66a230SMatthew G. Knepley /* Returns the side of the surface for a given cell with a face on the surface */ 13340f66a230SMatthew G. Knepley static PetscErrorCode GetSurfaceSide_Static(DM dm, DM subdm, PetscInt numSubpoints, const PetscInt *subpoints, PetscInt cell, PetscInt face, PetscBool *pos) 13350f66a230SMatthew G. Knepley { 13360f66a230SMatthew G. Knepley const PetscInt *cone, *ornt; 13370f66a230SMatthew G. Knepley PetscInt dim, coneSize, c; 13380f66a230SMatthew G. Knepley PetscErrorCode ierr; 13390f66a230SMatthew G. Knepley 13400f66a230SMatthew G. Knepley PetscFunctionBegin; 13410f66a230SMatthew G. Knepley *pos = PETSC_TRUE; 1342c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 13430f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 13440f66a230SMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 13450f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, cell, &ornt);CHKERRQ(ierr); 13460f66a230SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 13470f66a230SMatthew G. Knepley if (cone[c] == face) { 13480f66a230SMatthew G. Knepley PetscInt o = ornt[c]; 13490f66a230SMatthew G. Knepley 13500f66a230SMatthew G. Knepley if (subdm) { 13510f66a230SMatthew G. Knepley const PetscInt *subcone, *subornt; 13520f66a230SMatthew G. Knepley PetscInt subpoint, subface, subconeSize, sc; 13530f66a230SMatthew G. Knepley 13540f66a230SMatthew G. Knepley ierr = PetscFindInt(cell, numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 13550f66a230SMatthew G. Knepley ierr = PetscFindInt(face, numSubpoints, subpoints, &subface);CHKERRQ(ierr); 13560f66a230SMatthew G. Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 13570f66a230SMatthew G. Knepley ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 13580f66a230SMatthew G. Knepley ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 13590f66a230SMatthew G. Knepley for (sc = 0; sc < subconeSize; ++sc) { 13600f66a230SMatthew G. Knepley if (subcone[sc] == subface) { 13610f66a230SMatthew G. Knepley o = subornt[0]; 13620f66a230SMatthew G. Knepley break; 13630f66a230SMatthew G. Knepley } 13640f66a230SMatthew G. Knepley } 13650f66a230SMatthew G. Knepley if (sc >= subconeSize) SETERRQ4(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find subpoint %d (%d) in cone for subpoint %d (%d)", subface, face, subpoint, cell); 13660f66a230SMatthew G. Knepley } 13670f66a230SMatthew G. Knepley if (o >= 0) *pos = PETSC_TRUE; 13680f66a230SMatthew G. Knepley else *pos = PETSC_FALSE; 13690f66a230SMatthew G. Knepley break; 13700f66a230SMatthew G. Knepley } 13710f66a230SMatthew G. Knepley } 13720f66a230SMatthew G. Knepley if (c == coneSize) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Cell %d in split face %d support does not have it in the cone", cell, face); 13730f66a230SMatthew G. Knepley PetscFunctionReturn(0); 13740f66a230SMatthew G. Knepley } 13750f66a230SMatthew G. Knepley 13760f66a230SMatthew G. Knepley #undef __FUNCT__ 13772be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete" 1378cd0c2139SMatthew G Knepley /*@ 13790f66a230SMatthew G. Knepley DMPlexLabelCohesiveComplete - Starting with a label marking points on an internal surface, we add all other mesh pieces 1380cd0c2139SMatthew G Knepley to complete the surface 1381cd0c2139SMatthew G Knepley 1382cd0c2139SMatthew G Knepley Input Parameters: 1383cd0c2139SMatthew G Knepley + dm - The DM 13840f66a230SMatthew G. Knepley . label - A DMLabel marking the surface 13850f66a230SMatthew G. Knepley . blabel - A DMLabel marking the vertices on the boundary which will not be duplicated, or NULL to find them automatically 1386bb55d314SMatthew G. Knepley . flip - Flag to flip the submesh normal and replace points on the other side 138747946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL 1388cd0c2139SMatthew G Knepley 1389cd0c2139SMatthew G Knepley Output Parameter: 1390cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points 1391cd0c2139SMatthew G Knepley 13920f66a230SMatthew G. Knepley Note: The vertices in blabel are called "unsplit" in the terminology from hybrid cell creation. 13930f66a230SMatthew G. Knepley 1394cd0c2139SMatthew G Knepley Level: developer 1395cd0c2139SMatthew G Knepley 13962be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 1397cd0c2139SMatthew G Knepley @*/ 13980f66a230SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, DMLabel blabel, PetscBool flip, DM subdm) 1399cd0c2139SMatthew G Knepley { 1400d90583fdSMatthew G. Knepley DMLabel depthLabel; 140186200784SMatthew G. Knepley IS dimIS, subpointIS, facePosIS, faceNegIS, crossEdgeIS = NULL; 140247946fd8SMatthew G. Knepley const PetscInt *points, *subpoints; 1403bb55d314SMatthew G. Knepley const PetscInt rev = flip ? -1 : 1; 1404370472baSMatthew G. Knepley PetscInt *pMax; 1405370472baSMatthew G. Knepley PetscInt shift = 100, shift2 = 200, dim, depth, pSize, dep, cStart, cEnd, cMax, fStart, fEnd, vStart, vEnd, numPoints, numSubpoints, p, val; 1406cd0c2139SMatthew G Knepley PetscErrorCode ierr; 1407cd0c2139SMatthew G Knepley 1408cd0c2139SMatthew G Knepley PetscFunctionBegin; 1409370472baSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1410370472baSMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1411370472baSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1412370472baSMatthew G. Knepley ierr = PetscMalloc1(pSize,&pMax);CHKERRQ(ierr); 1413370472baSMatthew 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); 1414d90583fdSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 1415c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 141647946fd8SMatthew G. Knepley if (subdm) { 141747946fd8SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 141847946fd8SMatthew G. Knepley if (subpointIS) { 141947946fd8SMatthew G. Knepley ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 142047946fd8SMatthew G. Knepley ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 142147946fd8SMatthew G. Knepley } 142247946fd8SMatthew G. Knepley } 1423d7c8f101SMatthew G. Knepley /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */ 1424cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 1425dc86033cSMatthew G. Knepley if (!dimIS) { 1426dc86033cSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1427dc86033cSMatthew G. Knepley PetscFunctionReturn(0); 1428dc86033cSMatthew G. Knepley } 1429cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1430cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1431d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */ 1432cd0c2139SMatthew G Knepley const PetscInt *support; 1433cd0c2139SMatthew G Knepley PetscInt supportSize, s; 1434cd0c2139SMatthew G Knepley 1435cd0c2139SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1436cd0c2139SMatthew G Knepley if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 1437cd0c2139SMatthew G Knepley ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1438cd0c2139SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 14390f66a230SMatthew G. Knepley const PetscInt *cone; 1440cd0c2139SMatthew G Knepley PetscInt coneSize, c; 14410f66a230SMatthew G. Knepley PetscBool pos; 1442cd0c2139SMatthew G Knepley 14430f66a230SMatthew G. Knepley ierr = GetSurfaceSide_Static(dm, subdm, numSubpoints, subpoints, support[s], points[p], &pos);CHKERRQ(ierr); 14440f66a230SMatthew G. Knepley if (pos) {ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr);} 14450f66a230SMatthew G. Knepley else {ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);} 14460f66a230SMatthew G. Knepley if (rev < 0) pos = !pos ? PETSC_TRUE : PETSC_FALSE; 14470f66a230SMatthew G. Knepley /* Put faces touching the fault in the label */ 1448cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1449cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1450cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1451cd0c2139SMatthew G Knepley const PetscInt point = cone[c]; 1452cd0c2139SMatthew G Knepley 1453cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1454cd0c2139SMatthew G Knepley if (val == -1) { 1455cd0c2139SMatthew G Knepley PetscInt *closure = NULL; 1456cd0c2139SMatthew G Knepley PetscInt closureSize, cl; 1457cd0c2139SMatthew G Knepley 1458cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1459cd0c2139SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1460cd0c2139SMatthew G Knepley const PetscInt clp = closure[cl]; 1461a0541d8aSMatthew G. Knepley PetscInt bval = -1; 1462cd0c2139SMatthew G Knepley 1463cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1464a0541d8aSMatthew G. Knepley if (blabel) {ierr = DMLabelGetValue(blabel, clp, &bval);CHKERRQ(ierr);} 1465a0541d8aSMatthew G. Knepley if ((val >= 0) && (val < dim-1) && (bval < 0)) { 1466cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1467cd0c2139SMatthew G Knepley break; 1468cd0c2139SMatthew G Knepley } 1469cd0c2139SMatthew G Knepley } 1470cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1471cd0c2139SMatthew G Knepley } 1472cd0c2139SMatthew G Knepley } 1473cd0c2139SMatthew G Knepley } 1474cd0c2139SMatthew G Knepley } 14750f66a230SMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 14760f66a230SMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 147747946fd8SMatthew G. Knepley if (subdm) { 147847946fd8SMatthew G. Knepley if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 147947946fd8SMatthew G. Knepley ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 148047946fd8SMatthew G. Knepley } 1481a0541d8aSMatthew G. Knepley /* Mark boundary points as unsplit */ 148286200784SMatthew G. Knepley if (blabel) { 1483a0541d8aSMatthew G. Knepley ierr = DMLabelGetStratumIS(blabel, 1, &dimIS);CHKERRQ(ierr); 1484a0541d8aSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1485a0541d8aSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1486a0541d8aSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1487a0541d8aSMatthew G. Knepley const PetscInt point = points[p]; 1488a0541d8aSMatthew G. Knepley PetscInt val, bval; 1489a0541d8aSMatthew G. Knepley 1490a0541d8aSMatthew G. Knepley ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr); 1491a0541d8aSMatthew G. Knepley if (bval >= 0) { 1492f7019248SMatthew G. Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1493f7019248SMatthew G. Knepley if ((val < 0) || (val > dim)) { 1494f7019248SMatthew G. Knepley /* This could be a point added from splitting a vertex on an adjacent fault, otherwise its just wrong */ 1495f7019248SMatthew G. Knepley ierr = DMLabelClearValue(blabel, point, bval);CHKERRQ(ierr); 1496f7019248SMatthew G. Knepley } 1497f7019248SMatthew G. Knepley } 1498f7019248SMatthew G. Knepley } 1499f7019248SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 1500f7019248SMatthew G. Knepley const PetscInt point = points[p]; 1501f7019248SMatthew G. Knepley PetscInt val, bval; 1502f7019248SMatthew G. Knepley 1503f7019248SMatthew G. Knepley ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr); 1504f7019248SMatthew G. Knepley if (bval >= 0) { 150586200784SMatthew G. Knepley const PetscInt *cone, *support; 150686200784SMatthew G. Knepley PetscInt coneSize, supportSize, s, valA, valB, valE; 150786200784SMatthew G. Knepley 1508a0541d8aSMatthew G. Knepley /* Mark as unsplit */ 1509a0541d8aSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1510a0541d8aSMatthew G. Knepley if ((val < 0) || (val > dim)) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d has label value %d, should be part of the fault", point, val); 1511a0541d8aSMatthew G. Knepley ierr = DMLabelClearValue(label, point, val);CHKERRQ(ierr); 1512a0541d8aSMatthew G. Knepley ierr = DMLabelSetValue(label, point, shift2+val);CHKERRQ(ierr); 15132c06a818SMatthew G. Knepley /* Check for cross-edge 15142c06a818SMatthew G. Knepley A cross-edge has endpoints which are both on the boundary of the surface, but the edge itself is not. */ 151586200784SMatthew G. Knepley if (val != 0) continue; 151686200784SMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 151786200784SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 151886200784SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 151986200784SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 152086200784SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 152186200784SMatthew G. Knepley if (coneSize != 2) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Edge %D has %D vertices != 2", support[s], coneSize); 152286200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, cone[0], &valA);CHKERRQ(ierr); 152386200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, cone[1], &valB);CHKERRQ(ierr); 152486200784SMatthew G. Knepley ierr = DMLabelGetValue(blabel, support[s], &valE);CHKERRQ(ierr); 152509816f77SMatthew G. Knepley if ((valE < 0) && (valA >= 0) && (valB >= 0) && (cone[0] != cone[1])) {ierr = DMLabelSetValue(blabel, support[s], 2);CHKERRQ(ierr);} 152686200784SMatthew G. Knepley } 1527a0541d8aSMatthew G. Knepley } 1528a0541d8aSMatthew G. Knepley } 1529a0541d8aSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1530a0541d8aSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1531a0541d8aSMatthew G. Knepley } 1532cd0c2139SMatthew G Knepley /* Search for other cells/faces/edges connected to the fault by a vertex */ 1533c4d480a2SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 1534cd0c2139SMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1535d24f5ce5SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1536d24f5ce5SMatthew G. Knepley cMax = cMax < 0 ? cEnd : cMax; 15370f66a230SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 1538cd0c2139SMatthew G Knepley ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 153986200784SMatthew G. Knepley if (blabel) {ierr = DMLabelGetStratumIS(blabel, 2, &crossEdgeIS);CHKERRQ(ierr);} 154086200784SMatthew G. Knepley if (dimIS && crossEdgeIS) { 154186200784SMatthew G. Knepley IS vertIS = dimIS; 154286200784SMatthew G. Knepley 154386200784SMatthew G. Knepley ierr = ISExpand(vertIS, crossEdgeIS, &dimIS);CHKERRQ(ierr); 154486200784SMatthew G. Knepley ierr = ISDestroy(&crossEdgeIS);CHKERRQ(ierr); 154586200784SMatthew G. Knepley ierr = ISDestroy(&vertIS);CHKERRQ(ierr); 154686200784SMatthew G. Knepley } 1547dc86033cSMatthew G. Knepley if (!dimIS) { 1548dc86033cSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1549dc86033cSMatthew G. Knepley PetscFunctionReturn(0); 1550dc86033cSMatthew G. Knepley } 1551cd0c2139SMatthew G Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1552cd0c2139SMatthew G Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1553d7c8f101SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */ 1554cd0c2139SMatthew G Knepley PetscInt *star = NULL; 155586200784SMatthew G. Knepley PetscInt starSize, s; 1556cd0c2139SMatthew G Knepley PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1557cd0c2139SMatthew G Knepley 1558d4622b2cSMatthew G. Knepley /* All points connected to the fault are inside a cell, so at the top level we will only check cells */ 1559cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1560cd0c2139SMatthew G Knepley while (again) { 1561cd0c2139SMatthew G Knepley if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1562cd0c2139SMatthew G Knepley again = 0; 1563cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1564cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1565cd0c2139SMatthew G Knepley const PetscInt *cone; 1566cd0c2139SMatthew G Knepley PetscInt coneSize, c; 1567cd0c2139SMatthew G Knepley 1568d24f5ce5SMatthew G. Knepley if ((point < cStart) || (point >= cMax)) continue; 1569cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1570cd0c2139SMatthew G Knepley if (val != -1) continue; 1571d4622b2cSMatthew G. Knepley again = again == 1 ? 1 : 2; 1572cd0c2139SMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1573cd0c2139SMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1574cd0c2139SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 1575cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1576cd0c2139SMatthew G Knepley if (val != -1) { 1577d7c8f101SMatthew G. Knepley const PetscInt *ccone; 1578166d9d0cSMatthew G. Knepley PetscInt cconeSize, cc, side; 1579d7c8f101SMatthew G. Knepley 1580db8edaafSMatthew G. Knepley if (PetscAbs(val) < shift) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d on cell %d has an invalid label %d", cone[c], point, val); 158137a6de01SMatthew G. Knepley if (val > 0) side = 1; 158237a6de01SMatthew G. Knepley else side = -1; 158337a6de01SMatthew G. Knepley ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr); 1584d7c8f101SMatthew G. Knepley /* Mark cell faces which touch the fault */ 1585d7c8f101SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr); 1586d7c8f101SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr); 1587d7c8f101SMatthew G. Knepley for (cc = 0; cc < cconeSize; ++cc) { 1588d7c8f101SMatthew G. Knepley PetscInt *closure = NULL; 1589d7c8f101SMatthew G. Knepley PetscInt closureSize, cl; 1590d7c8f101SMatthew G. Knepley 1591166d9d0cSMatthew G. Knepley ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr); 1592166d9d0cSMatthew G. Knepley if (val != -1) continue; 1593d7c8f101SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1594d4622b2cSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1595d7c8f101SMatthew G. Knepley const PetscInt clp = closure[cl]; 1596d7c8f101SMatthew G. Knepley 1597d7c8f101SMatthew G. Knepley ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1598d7c8f101SMatthew G. Knepley if (val == -1) continue; 1599d7c8f101SMatthew G. Knepley ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr); 160037a6de01SMatthew G. Knepley break; 160137a6de01SMatthew G. Knepley } 1602d7c8f101SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1603cd0c2139SMatthew G Knepley } 1604cd0c2139SMatthew G Knepley again = 1; 1605cd0c2139SMatthew G Knepley break; 1606cd0c2139SMatthew G Knepley } 1607cd0c2139SMatthew G Knepley } 1608cd0c2139SMatthew G Knepley } 1609cd0c2139SMatthew G Knepley } 1610cd0c2139SMatthew G Knepley /* Classify the rest by cell membership */ 1611cd0c2139SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1612cd0c2139SMatthew G Knepley const PetscInt point = star[s]; 1613cd0c2139SMatthew G Knepley 1614cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1615cd0c2139SMatthew G Knepley if (val == -1) { 1616cd0c2139SMatthew G Knepley PetscInt *sstar = NULL; 1617cd0c2139SMatthew G Knepley PetscInt sstarSize, ss; 1618cd0c2139SMatthew G Knepley PetscBool marked = PETSC_FALSE; 1619cd0c2139SMatthew G Knepley 1620cd0c2139SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1621cd0c2139SMatthew G Knepley for (ss = 0; ss < sstarSize*2; ss += 2) { 1622cd0c2139SMatthew G Knepley const PetscInt spoint = sstar[ss]; 1623cd0c2139SMatthew G Knepley 1624d24f5ce5SMatthew G. Knepley if ((spoint < cStart) || (spoint >= cMax)) continue; 1625cd0c2139SMatthew G Knepley ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1626cd0c2139SMatthew 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); 1627d90583fdSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1628cd0c2139SMatthew G Knepley if (val > 0) { 1629cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1630cd0c2139SMatthew G Knepley } else { 1631cd0c2139SMatthew G Knepley ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1632cd0c2139SMatthew G Knepley } 1633cd0c2139SMatthew G Knepley marked = PETSC_TRUE; 1634cd0c2139SMatthew G Knepley break; 1635cd0c2139SMatthew G Knepley } 1636cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1637370472baSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1638370472baSMatthew G. Knepley if (point < pMax[dep] && !marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1639cd0c2139SMatthew G Knepley } 1640cd0c2139SMatthew G Knepley } 1641cd0c2139SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1642cd0c2139SMatthew G Knepley } 1643cd0c2139SMatthew G Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1644cd0c2139SMatthew G Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 164518c5995bSMatthew G. Knepley /* If any faces touching the fault divide cells on either side, split them */ 164618c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, shift+dim-1, &facePosIS);CHKERRQ(ierr); 164718c5995bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr); 164818c5995bSMatthew G. Knepley ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr); 164918c5995bSMatthew G. Knepley ierr = ISDestroy(&facePosIS);CHKERRQ(ierr); 165018c5995bSMatthew G. Knepley ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr); 165118c5995bSMatthew G. Knepley ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 165218c5995bSMatthew G. Knepley ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 165318c5995bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 165418c5995bSMatthew G. Knepley const PetscInt point = points[p]; 165518c5995bSMatthew G. Knepley const PetscInt *support; 165618c5995bSMatthew G. Knepley PetscInt supportSize, valA, valB; 165718c5995bSMatthew G. Knepley 165818c5995bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 165918c5995bSMatthew G. Knepley if (supportSize != 2) continue; 166018c5995bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 166118c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr); 166218c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr); 166318c5995bSMatthew G. Knepley if ((valA == -1) || (valB == -1)) continue; 166418c5995bSMatthew G. Knepley if (valA*valB > 0) continue; 166518c5995bSMatthew G. Knepley /* Split the face */ 166618c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr); 166718c5995bSMatthew G. Knepley ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr); 166818c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr); 1669e1757548SMatthew G. Knepley /* Label its closure: 1670e1757548SMatthew G. Knepley unmarked: label as unsplit 1671e1757548SMatthew G. Knepley incident: relabel as split 1672e1757548SMatthew G. Knepley split: do nothing 1673e1757548SMatthew G. Knepley */ 167418c5995bSMatthew G. Knepley { 167518c5995bSMatthew G. Knepley PetscInt *closure = NULL; 167618c5995bSMatthew G. Knepley PetscInt closureSize, cl; 167718c5995bSMatthew G. Knepley 167818c5995bSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 167918c5995bSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 168018c5995bSMatthew G. Knepley ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr); 16818771c1d3SMatthew G. Knepley if (valA == -1) { /* Mark as unsplit */ 168218c5995bSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 168318c5995bSMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr); 16848771c1d3SMatthew G. Knepley } else if (((valA >= shift) && (valA < shift2)) || ((valA <= -shift) && (valA > -shift2))) { 1685e1757548SMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr); 1686e1757548SMatthew G. Knepley ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr); 1687e1757548SMatthew G. Knepley ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr); 1688e1757548SMatthew G. Knepley } 168918c5995bSMatthew G. Knepley } 169018c5995bSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 169118c5995bSMatthew G. Knepley } 169218c5995bSMatthew G. Knepley } 169318c5995bSMatthew G. Knepley ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 169418c5995bSMatthew G. Knepley ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1695370472baSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1696cd0c2139SMatthew G Knepley PetscFunctionReturn(0); 1697cd0c2139SMatthew G Knepley } 1698cd0c2139SMatthew G Knepley 1699cd0c2139SMatthew G Knepley #undef __FUNCT__ 17003cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh" 17013cf72582SMatthew G. Knepley /*@C 17023cf72582SMatthew G. Knepley DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface 17033cf72582SMatthew G. Knepley 17043cf72582SMatthew G. Knepley Collective on dm 17053cf72582SMatthew G. Knepley 17063cf72582SMatthew G. Knepley Input Parameters: 17073cf72582SMatthew G. Knepley + dm - The original DM 17083cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices 17093cf72582SMatthew G. Knepley 17103cf72582SMatthew G. Knepley Output Parameters: 17113cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface 17123cf72582SMatthew G. Knepley - dmHybrid - The new DM 17133cf72582SMatthew G. Knepley 17143cf72582SMatthew G. Knepley Level: developer 17153cf72582SMatthew G. Knepley 17163cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate() 17173cf72582SMatthew G. Knepley @*/ 17183cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid) 17193cf72582SMatthew G. Knepley { 17203cf72582SMatthew G. Knepley DM idm; 17213cf72582SMatthew G. Knepley DMLabel subpointMap, hlabel; 17223cf72582SMatthew G. Knepley PetscInt dim; 17233cf72582SMatthew G. Knepley PetscErrorCode ierr; 17243cf72582SMatthew G. Knepley 17253cf72582SMatthew G. Knepley PetscFunctionBegin; 17263cf72582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 17273cf72582SMatthew G. Knepley if (hybridLabel) PetscValidPointer(hybridLabel, 3); 17283cf72582SMatthew G. Knepley PetscValidPointer(dmHybrid, 4); 1729c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 17303cf72582SMatthew G. Knepley ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr); 17313cf72582SMatthew G. Knepley ierr = DMPlexOrient(idm);CHKERRQ(ierr); 17323cf72582SMatthew G. Knepley ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr); 17333cf72582SMatthew G. Knepley ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr); 17343cf72582SMatthew G. Knepley ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr); 17350f66a230SMatthew G. Knepley ierr = DMPlexLabelCohesiveComplete(dm, hlabel, NULL, PETSC_FALSE, idm);CHKERRQ(ierr); 17363cf72582SMatthew G. Knepley ierr = DMDestroy(&idm);CHKERRQ(ierr); 17373cf72582SMatthew G. Knepley ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr); 17383cf72582SMatthew G. Knepley if (hybridLabel) *hybridLabel = hlabel; 173953aa2e23SMatthew G. Knepley else {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);} 1740e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 1741e6ccafaeSMatthew G Knepley } 1742e6ccafaeSMatthew G Knepley 1743e6ccafaeSMatthew G Knepley #undef __FUNCT__ 1744efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated" 1745efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that: 1746efa14ee0SMatthew G Knepley 1747efa14ee0SMatthew G Knepley For any marked cell, the marked vertices constitute a single face 1748efa14ee0SMatthew G Knepley */ 1749830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1750efa14ee0SMatthew G Knepley { 1751fed694aaSMatthew G. Knepley IS subvertexIS = NULL; 1752efa14ee0SMatthew G Knepley const PetscInt *subvertices; 175377d178adSMatthew G. Knepley PetscInt *pStart, *pEnd, *pMax, pSize; 1754efa14ee0SMatthew G Knepley PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1755efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1756efa14ee0SMatthew G Knepley 1757efa14ee0SMatthew G Knepley PetscFunctionBegin; 1758efa14ee0SMatthew G Knepley *numFaces = 0; 1759efa14ee0SMatthew G Knepley *nFV = 0; 1760efa14ee0SMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1761c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 176277d178adSMatthew G. Knepley pSize = PetscMax(depth, dim) + 1; 1763dcca6d9dSJed Brown ierr = PetscMalloc3(pSize,&pStart,pSize,&pEnd,pSize,&pMax);CHKERRQ(ierr); 1764d92e47f8SMatthew 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); 1765efa14ee0SMatthew G Knepley for (d = 0; d <= depth; ++d) { 1766efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1767efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1768efa14ee0SMatthew G Knepley } 1769efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 1770fed694aaSMatthew G. Knepley if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1771efa14ee0SMatthew G Knepley if (subvertexIS) { 1772efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1773efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1774efa14ee0SMatthew G Knepley } 1775efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1776efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 17770298fd71SBarry Smith PetscInt *star = NULL; 1778efa14ee0SMatthew G Knepley PetscInt starSize, s, numCells = 0, c; 1779efa14ee0SMatthew G Knepley 1780efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1781efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1782efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1783efa14ee0SMatthew G Knepley if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1784efa14ee0SMatthew G Knepley } 1785efa14ee0SMatthew G Knepley for (c = 0; c < numCells; ++c) { 1786efa14ee0SMatthew G Knepley const PetscInt cell = star[c]; 17870298fd71SBarry Smith PetscInt *closure = NULL; 1788efa14ee0SMatthew G Knepley PetscInt closureSize, cl; 1789efa14ee0SMatthew G Knepley PetscInt cellLoc, numCorners = 0, faceSize = 0; 1790efa14ee0SMatthew G Knepley 1791efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 179265560c7fSMatthew G Knepley if (cellLoc == 2) continue; 179382f516ccSBarry Smith if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1794efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1795efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 1796efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 1797efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1798efa14ee0SMatthew G Knepley 1799efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1800efa14ee0SMatthew G Knepley ++numCorners; 1801efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1802830e53efSMatthew G. Knepley if (vertexLoc == value) closure[faceSize++] = point; 1803efa14ee0SMatthew G Knepley } 1804efa14ee0SMatthew G Knepley } 180518ad9376SMatthew G. Knepley if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 180682f516ccSBarry 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); 1807efa14ee0SMatthew G Knepley if (faceSize == *nFV) { 1808007baee2SMatthew G. Knepley const PetscInt *cells = NULL; 1809007baee2SMatthew G. Knepley PetscInt numCells, nc; 1810007baee2SMatthew G. Knepley 1811efa14ee0SMatthew G Knepley ++(*numFaces); 1812efa14ee0SMatthew G Knepley for (cl = 0; cl < faceSize; ++cl) { 1813efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 1814efa14ee0SMatthew G Knepley } 1815007baee2SMatthew G. Knepley ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1816007baee2SMatthew G. Knepley for (nc = 0; nc < numCells; ++nc) { 1817007baee2SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 1818007baee2SMatthew G. Knepley } 1819007baee2SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1820efa14ee0SMatthew G Knepley } 1821efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1822efa14ee0SMatthew G Knepley } 1823efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1824efa14ee0SMatthew G Knepley } 1825efa14ee0SMatthew G Knepley if (subvertexIS) { 1826efa14ee0SMatthew G Knepley ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1827efa14ee0SMatthew G Knepley } 1828efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1829efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1830efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1831efa14ee0SMatthew G Knepley } 1832efa14ee0SMatthew G Knepley 1833efa14ee0SMatthew G Knepley #undef __FUNCT__ 1834efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated" 1835830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 1836efa14ee0SMatthew G Knepley { 183734b4c39eSMatthew G. Knepley IS subvertexIS = NULL; 1838efa14ee0SMatthew G Knepley const PetscInt *subvertices; 1839efa14ee0SMatthew G Knepley PetscInt *pStart, *pEnd, *pMax; 1840efa14ee0SMatthew G Knepley PetscInt dim, d, numSubVerticesInitial = 0, v; 1841efa14ee0SMatthew G Knepley PetscErrorCode ierr; 1842efa14ee0SMatthew G Knepley 1843efa14ee0SMatthew G Knepley PetscFunctionBegin; 1844c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1845dcca6d9dSJed Brown ierr = PetscMalloc3(dim+1,&pStart,dim+1,&pEnd,dim+1,&pMax);CHKERRQ(ierr); 18460298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1847efa14ee0SMatthew G Knepley for (d = 0; d <= dim; ++d) { 1848efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1849efa14ee0SMatthew G Knepley if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1850efa14ee0SMatthew G Knepley } 1851efa14ee0SMatthew G Knepley /* Loop over initial vertices and mark all faces in the collective star() */ 185234b4c39eSMatthew G. Knepley if (vertexLabel) { 1853830e53efSMatthew G. Knepley ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 1854efa14ee0SMatthew G Knepley if (subvertexIS) { 1855efa14ee0SMatthew G Knepley ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1856efa14ee0SMatthew G Knepley ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1857efa14ee0SMatthew G Knepley } 185834b4c39eSMatthew G. Knepley } 1859efa14ee0SMatthew G Knepley for (v = 0; v < numSubVerticesInitial; ++v) { 1860efa14ee0SMatthew G Knepley const PetscInt vertex = subvertices[v]; 18610298fd71SBarry Smith PetscInt *star = NULL; 1862efa14ee0SMatthew G Knepley PetscInt starSize, s, numFaces = 0, f; 1863efa14ee0SMatthew G Knepley 1864efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1865efa14ee0SMatthew G Knepley for (s = 0; s < starSize*2; s += 2) { 1866efa14ee0SMatthew G Knepley const PetscInt point = star[s]; 1867efa14ee0SMatthew G Knepley if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 1868efa14ee0SMatthew G Knepley } 1869efa14ee0SMatthew G Knepley for (f = 0; f < numFaces; ++f) { 1870efa14ee0SMatthew G Knepley const PetscInt face = star[f]; 18710298fd71SBarry Smith PetscInt *closure = NULL; 1872efa14ee0SMatthew G Knepley PetscInt closureSize, c; 1873efa14ee0SMatthew G Knepley PetscInt faceLoc; 1874efa14ee0SMatthew G Knepley 1875efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 1876efa14ee0SMatthew G Knepley if (faceLoc == dim-1) continue; 187782f516ccSBarry Smith if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 1878efa14ee0SMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1879efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1880efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1881efa14ee0SMatthew G Knepley PetscInt vertexLoc; 1882efa14ee0SMatthew G Knepley 1883efa14ee0SMatthew G Knepley if ((point >= pStart[0]) && (point < pEnd[0])) { 1884efa14ee0SMatthew G Knepley ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1885830e53efSMatthew G. Knepley if (vertexLoc != value) break; 1886efa14ee0SMatthew G Knepley } 1887efa14ee0SMatthew G Knepley } 1888efa14ee0SMatthew G Knepley if (c == closureSize*2) { 1889efa14ee0SMatthew G Knepley const PetscInt *support; 1890efa14ee0SMatthew G Knepley PetscInt supportSize, s; 1891efa14ee0SMatthew G Knepley 1892efa14ee0SMatthew G Knepley for (c = 0; c < closureSize*2; c += 2) { 1893efa14ee0SMatthew G Knepley const PetscInt point = closure[c]; 1894efa14ee0SMatthew G Knepley 1895efa14ee0SMatthew G Knepley for (d = 0; d < dim; ++d) { 1896efa14ee0SMatthew G Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 1897efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1898efa14ee0SMatthew G Knepley break; 1899efa14ee0SMatthew G Knepley } 1900efa14ee0SMatthew G Knepley } 1901efa14ee0SMatthew G Knepley } 1902efa14ee0SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 1903efa14ee0SMatthew G Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 1904efa14ee0SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 1905efa14ee0SMatthew G Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1906efa14ee0SMatthew G Knepley } 1907efa14ee0SMatthew G Knepley } 1908efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1909efa14ee0SMatthew G Knepley } 1910efa14ee0SMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1911efa14ee0SMatthew G Knepley } 191234b4c39eSMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);} 1913efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1914efa14ee0SMatthew G Knepley ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1915efa14ee0SMatthew G Knepley PetscFunctionReturn(0); 1916efa14ee0SMatthew G Knepley } 1917efa14ee0SMatthew G Knepley 1918efa14ee0SMatthew G Knepley #undef __FUNCT__ 1919766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated" 192027c04023SMatthew 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) 1921766ab985SMatthew G. Knepley { 192227c04023SMatthew G. Knepley DMLabel label = NULL; 1923766ab985SMatthew G. Knepley const PetscInt *cone; 192427234c99SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize; 1925766ab985SMatthew G. Knepley PetscErrorCode ierr; 1926766ab985SMatthew G. Knepley 1927812bfc34SJed Brown PetscFunctionBegin; 1928c0ed958bSJed Brown *numFaces = 0; 1929c0ed958bSJed Brown *nFV = 0; 1930b6d5cb33SJed Brown if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1931fed694aaSMatthew G. Knepley *subCells = NULL; 1932c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1933766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1934766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1935766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 193627c04023SMatthew G. Knepley if (label) { 193727c04023SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 193827c04023SMatthew G. Knepley PetscInt val; 193927c04023SMatthew G. Knepley 194027c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 194127c04023SMatthew G. Knepley if (val == value) { 194227c04023SMatthew G. Knepley ++(*numFaces); 194327c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 194427c04023SMatthew G. Knepley } 194527c04023SMatthew G. Knepley } 194627c04023SMatthew G. Knepley } else { 1947766ab985SMatthew G. Knepley *numFaces = cEnd - cMax; 194827c04023SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 194927c04023SMatthew G. Knepley } 1950766ab985SMatthew G. Knepley *nFV = hasLagrange ? coneSize/3 : coneSize/2; 1951785e854fSJed Brown ierr = PetscMalloc1(*numFaces *2, subCells);CHKERRQ(ierr); 1952766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1953766ab985SMatthew G. Knepley const PetscInt *cells; 1954766ab985SMatthew G. Knepley PetscInt numCells; 1955766ab985SMatthew G. Knepley 195627c04023SMatthew G. Knepley if (label) { 195727c04023SMatthew G. Knepley PetscInt val; 195827c04023SMatthew G. Knepley 195927c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 196027c04023SMatthew G. Knepley if (val != value) continue; 196127c04023SMatthew G. Knepley } 1962766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1963766ab985SMatthew G. Knepley for (p = 0; p < *nFV; ++p) { 1964766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 1965766ab985SMatthew G. Knepley } 1966766ab985SMatthew G. Knepley /* Negative face */ 1967766ab985SMatthew G. Knepley ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 196827234c99SMatthew G. Knepley /* Not true in parallel 196927234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 1970766ab985SMatthew G. Knepley for (p = 0; p < numCells; ++p) { 1971766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 197227234c99SMatthew G. Knepley (*subCells)[subc++] = cells[p]; 1973766ab985SMatthew G. Knepley } 1974766ab985SMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 1975766ab985SMatthew G. Knepley /* Positive face is not included */ 1976766ab985SMatthew G. Knepley } 1977766ab985SMatthew G. Knepley PetscFunctionReturn(0); 1978766ab985SMatthew G. Knepley } 1979766ab985SMatthew G. Knepley 1980766ab985SMatthew G. Knepley #undef __FUNCT__ 1981766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated" 19823982b651SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, DMLabel label, PetscInt value, DMLabel subpointMap, DM subdm) 1983766ab985SMatthew G. Knepley { 1984766ab985SMatthew G. Knepley PetscInt *pStart, *pEnd; 1985766ab985SMatthew G. Knepley PetscInt dim, cMax, cEnd, c, d; 1986766ab985SMatthew G. Knepley PetscErrorCode ierr; 1987766ab985SMatthew G. Knepley 1988812bfc34SJed Brown PetscFunctionBegin; 1989c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 1990766ab985SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1991766ab985SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1992766ab985SMatthew G. Knepley if (cMax < 0) PetscFunctionReturn(0); 1993dcca6d9dSJed Brown ierr = PetscMalloc2(dim+1,&pStart,dim+1,&pEnd);CHKERRQ(ierr); 1994b3154360SMatthew G. Knepley for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);} 1995766ab985SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 1996766ab985SMatthew G. Knepley const PetscInt *cone; 1997766ab985SMatthew G. Knepley PetscInt *closure = NULL; 1998b3154360SMatthew G. Knepley PetscInt fconeSize, coneSize, closureSize, cl, val; 1999766ab985SMatthew G. Knepley 200027c04023SMatthew G. Knepley if (label) { 200127c04023SMatthew G. Knepley ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 200227c04023SMatthew G. Knepley if (val != value) continue; 200327c04023SMatthew G. Knepley } 2004766ab985SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2005766ab985SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2006b3154360SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr); 2007b3154360SMatthew G. Knepley if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 2008b3154360SMatthew G. Knepley /* Negative face */ 2009766ab985SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2010766ab985SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2011766ab985SMatthew G. Knepley const PetscInt point = closure[cl]; 2012766ab985SMatthew G. Knepley 2013766ab985SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 2014766ab985SMatthew G. Knepley if ((point >= pStart[d]) && (point < pEnd[d])) { 2015766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 2016766ab985SMatthew G. Knepley break; 2017766ab985SMatthew G. Knepley } 2018766ab985SMatthew G. Knepley } 2019766ab985SMatthew G. Knepley } 2020766ab985SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2021766ab985SMatthew G. Knepley /* Cells -- positive face is not included */ 2022766ab985SMatthew G. Knepley for (cl = 0; cl < 1; ++cl) { 2023766ab985SMatthew G. Knepley const PetscInt *support; 2024766ab985SMatthew G. Knepley PetscInt supportSize, s; 2025766ab985SMatthew G. Knepley 2026766ab985SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 2027711de394SMatthew G. Knepley /* if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); */ 2028766ab985SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 2029766ab985SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 2030766ab985SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 2031766ab985SMatthew G. Knepley } 2032766ab985SMatthew G. Knepley } 2033766ab985SMatthew G. Knepley } 2034766ab985SMatthew G. Knepley ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 2035766ab985SMatthew G. Knepley PetscFunctionReturn(0); 2036766ab985SMatthew G. Knepley } 2037766ab985SMatthew G. Knepley 2038766ab985SMatthew G. Knepley #undef __FUNCT__ 2039e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation" 2040e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2041e6ccafaeSMatthew G Knepley { 204282f516ccSBarry Smith MPI_Comm comm; 2043e6ccafaeSMatthew G Knepley PetscBool posOrient = PETSC_FALSE; 2044e6ccafaeSMatthew G Knepley const PetscInt debug = 0; 2045e6ccafaeSMatthew G Knepley PetscInt cellDim, faceSize, f; 2046e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2047e6ccafaeSMatthew G Knepley 204882f516ccSBarry Smith PetscFunctionBegin; 204982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2050c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &cellDim);CHKERRQ(ierr); 2051e6ccafaeSMatthew G Knepley if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 2052e6ccafaeSMatthew G Knepley 2053ddeab2a6SMatthew G. Knepley if (cellDim == 1 && numCorners == 2) { 2054ddeab2a6SMatthew G. Knepley /* Triangle */ 2055e6ccafaeSMatthew G Knepley faceSize = numCorners-1; 2056e6ccafaeSMatthew G Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2057ddeab2a6SMatthew G. Knepley } else if (cellDim == 2 && numCorners == 3) { 2058ddeab2a6SMatthew G. Knepley /* Triangle */ 2059ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2060ddeab2a6SMatthew G. Knepley posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2061ddeab2a6SMatthew G. Knepley } else if (cellDim == 3 && numCorners == 4) { 2062ddeab2a6SMatthew G. Knepley /* Tetrahedron */ 2063ddeab2a6SMatthew G. Knepley faceSize = numCorners-1; 2064ddeab2a6SMatthew G. Knepley posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 2065e6ccafaeSMatthew G Knepley } else if (cellDim == 1 && numCorners == 3) { 2066e6ccafaeSMatthew G Knepley /* Quadratic line */ 2067e6ccafaeSMatthew G Knepley faceSize = 1; 2068e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2069e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 4) { 2070e6ccafaeSMatthew G Knepley /* Quads */ 2071e6ccafaeSMatthew G Knepley faceSize = 2; 2072e6ccafaeSMatthew G Knepley if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 2073e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2074e6ccafaeSMatthew G Knepley } else if ((indices[0] == 3) && (indices[1] == 0)) { 2075e6ccafaeSMatthew G Knepley posOrient = PETSC_TRUE; 2076e6ccafaeSMatthew G Knepley } else { 2077e6ccafaeSMatthew G Knepley if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 2078e6ccafaeSMatthew G Knepley posOrient = PETSC_FALSE; 2079e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 2080e6ccafaeSMatthew G Knepley } 2081e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 6) { 2082e6ccafaeSMatthew G Knepley /* Quadratic triangle (I hate this) */ 2083e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2084e6ccafaeSMatthew G Knepley const PetscInt faceSizeTri = 3; 2085e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2086e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2087e6ccafaeSMatthew G Knepley PetscInt faceVerticesTriSorted[9] = { 2088e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2089e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2090e6ccafaeSMatthew G Knepley 2, 3, 5, /* left */ 2091e6ccafaeSMatthew G Knepley }; 2092e6ccafaeSMatthew G Knepley PetscInt faceVerticesTri[9] = { 2093e6ccafaeSMatthew G Knepley 0, 3, 4, /* bottom */ 2094e6ccafaeSMatthew G Knepley 1, 4, 5, /* right */ 2095e6ccafaeSMatthew G Knepley 2, 5, 3, /* left */ 2096e6ccafaeSMatthew G Knepley }; 2097e6ccafaeSMatthew G Knepley 2098e6ccafaeSMatthew G Knepley faceSize = faceSizeTri; 2099e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 2100e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 2101e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 3; ++iFace) { 2102e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTri; 2103e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2104e6ccafaeSMatthew G Knepley 2105e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 2106e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 2107e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 2108e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 2109e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 2110e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2111e6ccafaeSMatthew G Knepley break; 2112e6ccafaeSMatthew G Knepley } 2113e6ccafaeSMatthew G Knepley } 2114e6ccafaeSMatthew G Knepley } 2115e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2116e6ccafaeSMatthew G Knepley break; 2117e6ccafaeSMatthew G Knepley } 2118e6ccafaeSMatthew G Knepley } 2119e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 2120e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2121e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2122e6ccafaeSMatthew G Knepley } else if (cellDim == 2 && numCorners == 9) { 2123e6ccafaeSMatthew G Knepley /* Quadratic quad (I hate this) */ 2124e6ccafaeSMatthew G Knepley /* Edges are determined by the first 2 vertices (corners of edges) */ 2125e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuad = 3; 2126e6ccafaeSMatthew G Knepley PetscInt sortedIndices[3], i, iFace; 2127e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2128e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadSorted[12] = { 2129e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2130e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2131e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2132e6ccafaeSMatthew G Knepley 0, 3, 7, /* left */ 2133e6ccafaeSMatthew G Knepley }; 2134e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuad[12] = { 2135e6ccafaeSMatthew G Knepley 0, 1, 4, /* bottom */ 2136e6ccafaeSMatthew G Knepley 1, 2, 5, /* right */ 2137e6ccafaeSMatthew G Knepley 2, 3, 6, /* top */ 2138e6ccafaeSMatthew G Knepley 3, 0, 7, /* left */ 2139e6ccafaeSMatthew G Knepley }; 2140e6ccafaeSMatthew G Knepley 2141e6ccafaeSMatthew G Knepley faceSize = faceSizeQuad; 2142e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 2143e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 2144e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 4; ++iFace) { 2145e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuad; 2146e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2147e6ccafaeSMatthew G Knepley 2148e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 2149e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 2150e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 2151e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 2152e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 2153e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2154e6ccafaeSMatthew G Knepley break; 2155e6ccafaeSMatthew G Knepley } 2156e6ccafaeSMatthew G Knepley } 2157e6ccafaeSMatthew G Knepley } 2158e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2159e6ccafaeSMatthew G Knepley break; 2160e6ccafaeSMatthew G Knepley } 2161e6ccafaeSMatthew G Knepley } 2162e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 2163e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2164e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2165e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 8) { 2166e6ccafaeSMatthew G Knepley /* Hexes 2167e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2168e6ccafaeSMatthew G Knepley pointing up at the second. 2169e6ccafaeSMatthew G Knepley 2170e6ccafaeSMatthew G Knepley 7---6 2171e6ccafaeSMatthew G Knepley /| /| 2172e6ccafaeSMatthew G Knepley 4---5 | 2173ddeab2a6SMatthew G. Knepley | 1-|-2 2174e6ccafaeSMatthew G Knepley |/ |/ 2175ddeab2a6SMatthew G. Knepley 0---3 2176e6ccafaeSMatthew G Knepley 2177e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2178e6ccafaeSMatthew G Knepley const PetscInt faceSizeHex = 4; 2179e6ccafaeSMatthew G Knepley PetscInt sortedIndices[4], i, iFace; 2180e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2181e6ccafaeSMatthew G Knepley PetscInt faceVerticesHexSorted[24] = { 2182e6ccafaeSMatthew G Knepley 0, 1, 2, 3, /* bottom */ 2183e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2184ddeab2a6SMatthew G. Knepley 0, 3, 4, 5, /* front */ 2185ddeab2a6SMatthew G. Knepley 2, 3, 5, 6, /* right */ 2186ddeab2a6SMatthew G. Knepley 1, 2, 6, 7, /* back */ 2187ddeab2a6SMatthew G. Knepley 0, 1, 4, 7, /* left */ 2188e6ccafaeSMatthew G Knepley }; 2189e6ccafaeSMatthew G Knepley PetscInt faceVerticesHex[24] = { 2190ddeab2a6SMatthew G. Knepley 1, 2, 3, 0, /* bottom */ 2191e6ccafaeSMatthew G Knepley 4, 5, 6, 7, /* top */ 2192ddeab2a6SMatthew G. Knepley 0, 3, 5, 4, /* front */ 2193ddeab2a6SMatthew G. Knepley 3, 2, 6, 5, /* right */ 2194ddeab2a6SMatthew G. Knepley 2, 1, 7, 6, /* back */ 2195ddeab2a6SMatthew G. Knepley 1, 0, 4, 7, /* left */ 2196e6ccafaeSMatthew G Knepley }; 2197e6ccafaeSMatthew G Knepley 2198e6ccafaeSMatthew G Knepley faceSize = faceSizeHex; 2199e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 2200e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 2201e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2202e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeHex; 2203e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2204e6ccafaeSMatthew G Knepley 2205e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 2206e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 2207e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 2208e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 2209e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 2210e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 2211e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 2212e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2213e6ccafaeSMatthew G Knepley break; 2214e6ccafaeSMatthew G Knepley } 2215e6ccafaeSMatthew G Knepley } 2216e6ccafaeSMatthew G Knepley } 2217e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2218e6ccafaeSMatthew G Knepley break; 2219e6ccafaeSMatthew G Knepley } 2220e6ccafaeSMatthew G Knepley } 2221e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2222e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2223e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2224e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 10) { 2225e6ccafaeSMatthew G Knepley /* Quadratic tet */ 2226e6ccafaeSMatthew G Knepley /* Faces are determined by the first 3 vertices (corners of faces) */ 2227e6ccafaeSMatthew G Knepley const PetscInt faceSizeTet = 6; 2228e6ccafaeSMatthew G Knepley PetscInt sortedIndices[6], i, iFace; 2229e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2230e6ccafaeSMatthew G Knepley PetscInt faceVerticesTetSorted[24] = { 2231e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2232e6ccafaeSMatthew G Knepley 0, 3, 4, 6, 7, 9, /* front */ 2233e6ccafaeSMatthew G Knepley 1, 4, 5, 7, 8, 9, /* right */ 2234e6ccafaeSMatthew G Knepley 2, 3, 5, 6, 8, 9, /* left */ 2235e6ccafaeSMatthew G Knepley }; 2236e6ccafaeSMatthew G Knepley PetscInt faceVerticesTet[24] = { 2237e6ccafaeSMatthew G Knepley 0, 1, 2, 6, 7, 8, /* bottom */ 2238e6ccafaeSMatthew G Knepley 0, 4, 3, 6, 7, 9, /* front */ 2239e6ccafaeSMatthew G Knepley 1, 5, 4, 7, 8, 9, /* right */ 2240e6ccafaeSMatthew G Knepley 2, 3, 5, 8, 6, 9, /* left */ 2241e6ccafaeSMatthew G Knepley }; 2242e6ccafaeSMatthew G Knepley 2243e6ccafaeSMatthew G Knepley faceSize = faceSizeTet; 2244e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 2245e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 2246e6ccafaeSMatthew G Knepley for (iFace=0; iFace < 4; ++iFace) { 2247e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeTet; 2248e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2249e6ccafaeSMatthew G Knepley 2250e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 2251e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 2252e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 2253e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 2254e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 2255e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 2256e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 2257e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2258e6ccafaeSMatthew G Knepley break; 2259e6ccafaeSMatthew G Knepley } 2260e6ccafaeSMatthew G Knepley } 2261e6ccafaeSMatthew G Knepley } 2262e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2263e6ccafaeSMatthew G Knepley break; 2264e6ccafaeSMatthew G Knepley } 2265e6ccafaeSMatthew G Knepley } 2266e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 2267e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2268e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2269e6ccafaeSMatthew G Knepley } else if (cellDim == 3 && numCorners == 27) { 2270e6ccafaeSMatthew G Knepley /* Quadratic hexes (I hate this) 2271e6ccafaeSMatthew G Knepley A hex is two oriented quads with the normal of the first 2272e6ccafaeSMatthew G Knepley pointing up at the second. 2273e6ccafaeSMatthew G Knepley 2274e6ccafaeSMatthew G Knepley 7---6 2275e6ccafaeSMatthew G Knepley /| /| 2276e6ccafaeSMatthew G Knepley 4---5 | 2277e6ccafaeSMatthew G Knepley | 3-|-2 2278e6ccafaeSMatthew G Knepley |/ |/ 2279e6ccafaeSMatthew G Knepley 0---1 2280e6ccafaeSMatthew G Knepley 2281e6ccafaeSMatthew G Knepley Faces are determined by the first 4 vertices (corners of faces) */ 2282e6ccafaeSMatthew G Knepley const PetscInt faceSizeQuadHex = 9; 2283e6ccafaeSMatthew G Knepley PetscInt sortedIndices[9], i, iFace; 2284e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2285e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHexSorted[54] = { 2286e6ccafaeSMatthew G Knepley 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 2287e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2288e6ccafaeSMatthew G Knepley 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 2289e6ccafaeSMatthew G Knepley 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 2290e6ccafaeSMatthew G Knepley 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 2291e6ccafaeSMatthew G Knepley 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 2292e6ccafaeSMatthew G Knepley }; 2293e6ccafaeSMatthew G Knepley PetscInt faceVerticesQuadHex[54] = { 2294e6ccafaeSMatthew G Knepley 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 2295e6ccafaeSMatthew G Knepley 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 2296e6ccafaeSMatthew G Knepley 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 2297e6ccafaeSMatthew G Knepley 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 2298e6ccafaeSMatthew G Knepley 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 2299e6ccafaeSMatthew G Knepley 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 2300e6ccafaeSMatthew G Knepley }; 2301e6ccafaeSMatthew G Knepley 2302e6ccafaeSMatthew G Knepley faceSize = faceSizeQuadHex; 2303e6ccafaeSMatthew G Knepley for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 2304e6ccafaeSMatthew G Knepley ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 2305e6ccafaeSMatthew G Knepley for (iFace = 0; iFace < 6; ++iFace) { 2306e6ccafaeSMatthew G Knepley const PetscInt ii = iFace*faceSizeQuadHex; 2307e6ccafaeSMatthew G Knepley PetscInt fVertex, cVertex; 2308e6ccafaeSMatthew G Knepley 2309e6ccafaeSMatthew G Knepley if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 2310e6ccafaeSMatthew G Knepley (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 2311e6ccafaeSMatthew G Knepley (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 2312e6ccafaeSMatthew G Knepley (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 2313e6ccafaeSMatthew G Knepley for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 2314e6ccafaeSMatthew G Knepley for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 2315e6ccafaeSMatthew G Knepley if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 2316e6ccafaeSMatthew G Knepley faceVertices[fVertex] = origVertices[cVertex]; 2317e6ccafaeSMatthew G Knepley break; 2318e6ccafaeSMatthew G Knepley } 2319e6ccafaeSMatthew G Knepley } 2320e6ccafaeSMatthew G Knepley } 2321e6ccafaeSMatthew G Knepley found = PETSC_TRUE; 2322e6ccafaeSMatthew G Knepley break; 2323e6ccafaeSMatthew G Knepley } 2324e6ccafaeSMatthew G Knepley } 2325e6ccafaeSMatthew G Knepley if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 2326e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = PETSC_TRUE; 2327e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2328e6ccafaeSMatthew G Knepley } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 2329e6ccafaeSMatthew G Knepley if (!posOrient) { 2330e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 2331e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 2332e6ccafaeSMatthew G Knepley } else { 2333e6ccafaeSMatthew G Knepley if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 2334e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 2335e6ccafaeSMatthew G Knepley } 2336e6ccafaeSMatthew G Knepley if (posOriented) *posOriented = posOrient; 2337e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2338e6ccafaeSMatthew G Knepley } 2339e6ccafaeSMatthew G Knepley 2340e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2341e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace" 2342e6ccafaeSMatthew G Knepley /* 2343e6ccafaeSMatthew G Knepley Given a cell and a face, as a set of vertices, 2344e6ccafaeSMatthew G Knepley return the oriented face, as a set of vertices, in faceVertices 2345e6ccafaeSMatthew G Knepley The orientation is such that the face normal points out of the cell 2346e6ccafaeSMatthew G Knepley */ 2347e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 2348e6ccafaeSMatthew G Knepley { 23490298fd71SBarry Smith const PetscInt *cone = NULL; 2350e6ccafaeSMatthew G Knepley PetscInt coneSize, v, f, v2; 2351e6ccafaeSMatthew G Knepley PetscInt oppositeVertex = -1; 2352e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2353e6ccafaeSMatthew G Knepley 2354e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2355e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 2356e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 2357e6ccafaeSMatthew G Knepley for (v = 0, v2 = 0; v < coneSize; ++v) { 2358e6ccafaeSMatthew G Knepley PetscBool found = PETSC_FALSE; 2359e6ccafaeSMatthew G Knepley 2360e6ccafaeSMatthew G Knepley for (f = 0; f < faceSize; ++f) { 2361e6ccafaeSMatthew G Knepley if (face[f] == cone[v]) { 2362e6ccafaeSMatthew G Knepley found = PETSC_TRUE; break; 2363e6ccafaeSMatthew G Knepley } 2364e6ccafaeSMatthew G Knepley } 2365e6ccafaeSMatthew G Knepley if (found) { 2366e6ccafaeSMatthew G Knepley indices[v2] = v; 2367e6ccafaeSMatthew G Knepley origVertices[v2] = cone[v]; 2368e6ccafaeSMatthew G Knepley ++v2; 2369e6ccafaeSMatthew G Knepley } else { 2370e6ccafaeSMatthew G Knepley oppositeVertex = v; 2371e6ccafaeSMatthew G Knepley } 2372e6ccafaeSMatthew G Knepley } 2373e6ccafaeSMatthew G Knepley ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 2374e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2375e6ccafaeSMatthew G Knepley } 2376e6ccafaeSMatthew G Knepley 2377e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2378cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal" 2379e6ccafaeSMatthew G Knepley /* 2380cd0c2139SMatthew G Knepley DMPlexInsertFace_Internal - Puts a face into the mesh 2381e6ccafaeSMatthew G Knepley 2382e6ccafaeSMatthew G Knepley Not collective 2383e6ccafaeSMatthew G Knepley 2384e6ccafaeSMatthew G Knepley Input Parameters: 2385e6ccafaeSMatthew G Knepley + dm - The DMPlex 2386e6ccafaeSMatthew G Knepley . numFaceVertex - The number of vertices in the face 2387e6ccafaeSMatthew G Knepley . faceVertices - The vertices in the face for dm 2388e6ccafaeSMatthew G Knepley . subfaceVertices - The vertices in the face for subdm 2389e6ccafaeSMatthew G Knepley . numCorners - The number of vertices in the cell 2390e6ccafaeSMatthew G Knepley . cell - A cell in dm containing the face 2391e6ccafaeSMatthew G Knepley . subcell - A cell in subdm containing the face 2392e6ccafaeSMatthew G Knepley . firstFace - First face in the mesh 2393e6ccafaeSMatthew G Knepley - newFacePoint - Next face in the mesh 2394e6ccafaeSMatthew G Knepley 2395e6ccafaeSMatthew G Knepley Output Parameters: 2396e6ccafaeSMatthew G Knepley . newFacePoint - Contains next face point number on input, updated on output 2397e6ccafaeSMatthew G Knepley 2398e6ccafaeSMatthew G Knepley Level: developer 2399e6ccafaeSMatthew G Knepley */ 2400cd0c2139SMatthew 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) 2401e6ccafaeSMatthew G Knepley { 240282f516ccSBarry Smith MPI_Comm comm; 2403e6ccafaeSMatthew G Knepley DM_Plex *submesh = (DM_Plex*) subdm->data; 2404e6ccafaeSMatthew G Knepley const PetscInt *faces; 2405e6ccafaeSMatthew G Knepley PetscInt numFaces, coneSize; 2406e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2407e6ccafaeSMatthew G Knepley 2408e6ccafaeSMatthew G Knepley PetscFunctionBegin; 240982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2410e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 2411e6ccafaeSMatthew G Knepley if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 2412e6ccafaeSMatthew G Knepley #if 0 2413e6ccafaeSMatthew G Knepley /* Cannot use this because support() has not been constructed yet */ 2414e6ccafaeSMatthew G Knepley ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2415e6ccafaeSMatthew G Knepley #else 2416e6ccafaeSMatthew G Knepley { 2417e6ccafaeSMatthew G Knepley PetscInt f; 2418e6ccafaeSMatthew G Knepley 2419e6ccafaeSMatthew G Knepley numFaces = 0; 2420e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2421e6ccafaeSMatthew G Knepley for (f = firstFace; f < *newFacePoint; ++f) { 2422e6ccafaeSMatthew G Knepley PetscInt dof, off, d; 2423e6ccafaeSMatthew G Knepley 2424e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 2425e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 2426e6ccafaeSMatthew G Knepley /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 2427e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) { 2428e6ccafaeSMatthew G Knepley const PetscInt p = submesh->cones[off+d]; 2429e6ccafaeSMatthew G Knepley PetscInt v; 2430e6ccafaeSMatthew G Knepley 2431e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2432e6ccafaeSMatthew G Knepley if (subfaceVertices[v] == p) break; 2433e6ccafaeSMatthew G Knepley } 2434e6ccafaeSMatthew G Knepley if (v == numFaceVertices) break; 2435e6ccafaeSMatthew G Knepley } 2436e6ccafaeSMatthew G Knepley if (d == dof) { 2437e6ccafaeSMatthew G Knepley numFaces = 1; 2438e6ccafaeSMatthew G Knepley ((PetscInt*) faces)[0] = f; 2439e6ccafaeSMatthew G Knepley } 2440e6ccafaeSMatthew G Knepley } 2441e6ccafaeSMatthew G Knepley } 2442e6ccafaeSMatthew G Knepley #endif 2443e6ccafaeSMatthew G Knepley if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 2444e6ccafaeSMatthew G Knepley else if (numFaces == 1) { 2445e6ccafaeSMatthew G Knepley /* Add the other cell neighbor for this face */ 2446766ab985SMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 2447e6ccafaeSMatthew G Knepley } else { 2448e6ccafaeSMatthew G Knepley PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 2449e6ccafaeSMatthew G Knepley PetscBool posOriented; 2450e6ccafaeSMatthew G Knepley 2451e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2452e6ccafaeSMatthew G Knepley origVertices = &orientedVertices[numFaceVertices]; 2453e6ccafaeSMatthew G Knepley indices = &orientedVertices[numFaceVertices*2]; 2454e6ccafaeSMatthew G Knepley orientedSubVertices = &orientedVertices[numFaceVertices*3]; 2455e6ccafaeSMatthew G Knepley ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 2456e6ccafaeSMatthew G Knepley /* TODO: I know that routine should return a permutation, not the indices */ 2457e6ccafaeSMatthew G Knepley for (v = 0; v < numFaceVertices; ++v) { 2458e6ccafaeSMatthew G Knepley const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 2459e6ccafaeSMatthew G Knepley for (ov = 0; ov < numFaceVertices; ++ov) { 2460e6ccafaeSMatthew G Knepley if (orientedVertices[ov] == vertex) { 2461e6ccafaeSMatthew G Knepley orientedSubVertices[ov] = subvertex; 2462e6ccafaeSMatthew G Knepley break; 2463e6ccafaeSMatthew G Knepley } 2464e6ccafaeSMatthew G Knepley } 2465e6ccafaeSMatthew G Knepley if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 2466e6ccafaeSMatthew G Knepley } 2467e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 2468e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 2469e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 2470e6ccafaeSMatthew G Knepley ++(*newFacePoint); 2471e6ccafaeSMatthew G Knepley } 2472ef07cca7SMatthew G. Knepley #if 0 2473e6ccafaeSMatthew G Knepley ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 2474ef07cca7SMatthew G. Knepley #else 2475ef07cca7SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 2476ef07cca7SMatthew G. Knepley #endif 2477e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2478e6ccafaeSMatthew G Knepley } 2479e6ccafaeSMatthew G Knepley 2480e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2481e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated" 248253156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 2483e6ccafaeSMatthew G Knepley { 248482f516ccSBarry Smith MPI_Comm comm; 248553156dfcSMatthew G. Knepley DMLabel subpointMap; 2486efa14ee0SMatthew G Knepley IS subvertexIS, subcellIS; 2487efa14ee0SMatthew G Knepley const PetscInt *subVertices, *subCells; 2488efa14ee0SMatthew G Knepley PetscInt numSubVertices, firstSubVertex, numSubCells; 2489fed694aaSMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 2490efa14ee0SMatthew G Knepley PetscInt vStart, vEnd, c, f; 2491e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2492e6ccafaeSMatthew G Knepley 2493e6ccafaeSMatthew G Knepley PetscFunctionBegin; 249482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2495efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2496efa14ee0SMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2497efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2498efa14ee0SMatthew G Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 249953156dfcSMatthew G. Knepley if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);} 2500efa14ee0SMatthew G Knepley /* Setup chart */ 2501efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2502efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2503efa14ee0SMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2504efa14ee0SMatthew G Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2505e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2506e6ccafaeSMatthew G Knepley firstSubVertex = numSubCells; 2507efa14ee0SMatthew G Knepley firstSubFace = numSubCells+numSubVertices; 2508e6ccafaeSMatthew G Knepley newFacePoint = firstSubFace; 2509efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2510efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2511efa14ee0SMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 2512efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2513e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2514e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2515e6ccafaeSMatthew G Knepley } 2516e6ccafaeSMatthew G Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2517e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2518e6ccafaeSMatthew G Knepley } 2519e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2520e6ccafaeSMatthew G Knepley /* Create face cones */ 2521efa14ee0SMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 25220298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2523efa14ee0SMatthew G Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2524e6ccafaeSMatthew G Knepley for (c = 0; c < numSubCells; ++c) { 2525e6ccafaeSMatthew G Knepley const PetscInt cell = subCells[c]; 2526efa14ee0SMatthew G Knepley const PetscInt subcell = c; 25270298fd71SBarry Smith PetscInt *closure = NULL; 2528efa14ee0SMatthew G Knepley PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 2529e6ccafaeSMatthew G Knepley 2530e6ccafaeSMatthew G Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2531efa14ee0SMatthew G Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 2532efa14ee0SMatthew G Knepley const PetscInt point = closure[cl]; 2533e6ccafaeSMatthew G Knepley PetscInt subVertex; 2534e6ccafaeSMatthew G Knepley 2535efa14ee0SMatthew G Knepley if ((point >= vStart) && (point < vEnd)) { 2536efa14ee0SMatthew G Knepley ++numCorners; 2537efa14ee0SMatthew G Knepley ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 2538efa14ee0SMatthew G Knepley if (subVertex >= 0) { 2539efa14ee0SMatthew G Knepley closure[faceSize] = point; 254065560c7fSMatthew G Knepley subface[faceSize] = firstSubVertex+subVertex; 2541e6ccafaeSMatthew G Knepley ++faceSize; 2542e6ccafaeSMatthew G Knepley } 2543e6ccafaeSMatthew G Knepley } 2544e6ccafaeSMatthew G Knepley } 2545efa14ee0SMatthew G Knepley if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 2546efa14ee0SMatthew G Knepley if (faceSize == nFV) { 2547cd0c2139SMatthew G Knepley ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 2548e6ccafaeSMatthew G Knepley } 254965560c7fSMatthew G Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2550e6ccafaeSMatthew G Knepley } 2551efa14ee0SMatthew G Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2552e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2553e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2554e6ccafaeSMatthew G Knepley /* Build coordinates */ 2555efa14ee0SMatthew G Knepley { 2556efa14ee0SMatthew G Knepley PetscSection coordSection, subCoordSection; 2557efa14ee0SMatthew G Knepley Vec coordinates, subCoordinates; 2558efa14ee0SMatthew G Knepley PetscScalar *coords, *subCoords; 2559285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 2560efa14ee0SMatthew G Knepley 256169d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2562e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 256369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2564285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2565285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2566285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2567efa14ee0SMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2568efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2569efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2570efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2571efa14ee0SMatthew G Knepley PetscInt dof; 2572efa14ee0SMatthew G Knepley 2573efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2574efa14ee0SMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2575285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2576e6ccafaeSMatthew G Knepley } 2577e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2578e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2579e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2580e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 25812eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2582830e53efSMatthew G. Knepley if (coordSize) { 2583e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2584e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2585efa14ee0SMatthew G Knepley for (v = 0; v < numSubVertices; ++v) { 2586efa14ee0SMatthew G Knepley const PetscInt vertex = subVertices[v]; 2587efa14ee0SMatthew G Knepley const PetscInt subvertex = firstSubVertex+v; 2588efa14ee0SMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2589e6ccafaeSMatthew G Knepley 2590e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2591e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2592efa14ee0SMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2593efa14ee0SMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2594efa14ee0SMatthew 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); 2595e6ccafaeSMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2596e6ccafaeSMatthew G Knepley } 2597e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2598e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 25993b399e24SMatthew G. Knepley } 2600e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2601e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2602e6ccafaeSMatthew G Knepley } 2603efa14ee0SMatthew G Knepley /* Cleanup */ 2604efa14ee0SMatthew G Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2605efa14ee0SMatthew G Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2606efa14ee0SMatthew G Knepley if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2607efa14ee0SMatthew G Knepley ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2608e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2609e6ccafaeSMatthew G Knepley } 2610e6ccafaeSMatthew G Knepley 2611e6ccafaeSMatthew G Knepley #undef __FUNCT__ 26123982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal" 26133982b651SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 26143982b651SMatthew G. Knepley { 26153982b651SMatthew G. Knepley PetscInt subPoint; 26163982b651SMatthew G. Knepley PetscErrorCode ierr; 26173982b651SMatthew G. Knepley 26183982b651SMatthew G. Knepley ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 26193982b651SMatthew G. Knepley return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 26203982b651SMatthew G. Knepley } 26213982b651SMatthew G. Knepley 26223982b651SMatthew G. Knepley #undef __FUNCT__ 26233982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateSubmeshGeneric_Interpolated" 2624*bec263e5SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmeshGeneric_Interpolated(DM dm, DMLabel label, PetscInt value, PetscBool isCohesive, PetscInt cellHeight, DM subdm) 2625e6ccafaeSMatthew G Knepley { 262682f516ccSBarry Smith MPI_Comm comm; 262753156dfcSMatthew G. Knepley DMLabel subpointMap; 2628efa14ee0SMatthew G Knepley IS *subpointIS; 2629efa14ee0SMatthew G Knepley const PetscInt **subpoints; 26303982b651SMatthew G. Knepley PetscInt *numSubPoints, *firstSubPoint, *coneNew, *orntNew; 2631efa14ee0SMatthew G Knepley PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2632e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2633e6ccafaeSMatthew G Knepley 2634e6ccafaeSMatthew G Knepley PetscFunctionBegin; 263582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2636efa14ee0SMatthew G Knepley /* Create subpointMap which marks the submesh */ 2637e6ccafaeSMatthew G Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2638efa14ee0SMatthew G Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2639*bec263e5SMatthew G. Knepley if (cellHeight) { 26403982b651SMatthew G. Knepley if (isCohesive) {ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);} 26413982b651SMatthew G. Knepley else {ierr = DMPlexMarkSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);} 2642*bec263e5SMatthew G. Knepley } else { 2643*bec263e5SMatthew G. Knepley DMLabel depth; 2644*bec263e5SMatthew G. Knepley IS pointIS; 2645*bec263e5SMatthew G. Knepley const PetscInt *points; 2646*bec263e5SMatthew G. Knepley PetscInt numPoints; 2647*bec263e5SMatthew G. Knepley 2648*bec263e5SMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depth);CHKERRQ(ierr); 2649*bec263e5SMatthew G. Knepley ierr = DMLabelGetStratumSize(label, value, &numPoints);CHKERRQ(ierr); 2650*bec263e5SMatthew G. Knepley ierr = DMLabelGetStratumIS(label, value, &pointIS);CHKERRQ(ierr); 2651*bec263e5SMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 2652*bec263e5SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 2653*bec263e5SMatthew G. Knepley PetscInt *closure = NULL; 2654*bec263e5SMatthew G. Knepley PetscInt closureSize, c, pdim; 2655*bec263e5SMatthew G. Knepley 2656*bec263e5SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2657*bec263e5SMatthew G. Knepley for (c = 0; c < closureSize*2; c += 2) { 2658*bec263e5SMatthew G. Knepley ierr = DMLabelGetValue(depth, closure[c], &pdim);CHKERRQ(ierr); 2659*bec263e5SMatthew G. Knepley ierr = DMLabelSetValue(subpointMap, closure[c], pdim);CHKERRQ(ierr); 2660*bec263e5SMatthew G. Knepley } 2661*bec263e5SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2662*bec263e5SMatthew G. Knepley } 2663*bec263e5SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 2664*bec263e5SMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 2665*bec263e5SMatthew G. Knepley } 2666*bec263e5SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 2667efa14ee0SMatthew G Knepley /* Setup chart */ 2668c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2669dcca6d9dSJed Brown ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr); 2670e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2671e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2672e6ccafaeSMatthew G Knepley totSubPoints += numSubPoints[d]; 2673e6ccafaeSMatthew G Knepley } 2674e6ccafaeSMatthew G Knepley ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2675*bec263e5SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, cellHeight);CHKERRQ(ierr); 2676e6ccafaeSMatthew G Knepley /* Set cone sizes */ 2677e6ccafaeSMatthew G Knepley firstSubPoint[dim] = 0; 2678e6ccafaeSMatthew G Knepley firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2679e6ccafaeSMatthew G Knepley if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2680e6ccafaeSMatthew G Knepley if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2681e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2682e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 26830ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2684e6ccafaeSMatthew G Knepley } 2685e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2686e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2687e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2688e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 2689e6ccafaeSMatthew G Knepley const PetscInt *cone; 2690e6ccafaeSMatthew G Knepley PetscInt coneSize, coneSizeNew, c, val; 2691e6ccafaeSMatthew G Knepley 2692e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2693e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2694*bec263e5SMatthew G. Knepley if (cellHeight && (d == dim)) { 2695e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2696e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2697e6ccafaeSMatthew G Knepley ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2698e6ccafaeSMatthew G Knepley if (val >= 0) coneSizeNew++; 2699e6ccafaeSMatthew G Knepley } 2700e6ccafaeSMatthew G Knepley ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2701e6ccafaeSMatthew G Knepley } 2702e6ccafaeSMatthew G Knepley } 2703e6ccafaeSMatthew G Knepley } 2704e6ccafaeSMatthew G Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2705e6ccafaeSMatthew G Knepley /* Set cones */ 27060298fd71SBarry Smith ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 27073982b651SMatthew G. Knepley ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&orntNew);CHKERRQ(ierr); 2708e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 2709e6ccafaeSMatthew G Knepley for (p = 0; p < numSubPoints[d]; ++p) { 2710e6ccafaeSMatthew G Knepley const PetscInt point = subpoints[d][p]; 2711e6ccafaeSMatthew G Knepley const PetscInt subpoint = firstSubPoint[d] + p; 27120e49e2e2SMatthew G. Knepley const PetscInt *cone, *ornt; 2713e6ccafaeSMatthew G Knepley PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2714e6ccafaeSMatthew G Knepley 2715e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2716e6ccafaeSMatthew G Knepley ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2717e6ccafaeSMatthew G Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 27180e49e2e2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2719e6ccafaeSMatthew G Knepley for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2720e6ccafaeSMatthew G Knepley ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 272101a2673eSMatthew G. Knepley if (subc >= 0) { 272201a2673eSMatthew G. Knepley coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 27233982b651SMatthew G. Knepley orntNew[coneSizeNew] = ornt[c]; 272401a2673eSMatthew G. Knepley ++coneSizeNew; 272501a2673eSMatthew G. Knepley } 2726e6ccafaeSMatthew G Knepley } 2727e6ccafaeSMatthew G Knepley if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2728e6ccafaeSMatthew G Knepley ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 27293982b651SMatthew G. Knepley ierr = DMPlexSetConeOrientation(subdm, subpoint, orntNew);CHKERRQ(ierr); 2730e6ccafaeSMatthew G Knepley } 2731e6ccafaeSMatthew G Knepley } 27323982b651SMatthew G. Knepley ierr = PetscFree2(coneNew,orntNew);CHKERRQ(ierr); 2733e6ccafaeSMatthew G Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2734e6ccafaeSMatthew G Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2735e6ccafaeSMatthew G Knepley /* Build coordinates */ 2736e6ccafaeSMatthew G Knepley { 2737e6ccafaeSMatthew G Knepley PetscSection coordSection, subCoordSection; 2738e6ccafaeSMatthew G Knepley Vec coordinates, subCoordinates; 2739e6ccafaeSMatthew G Knepley PetscScalar *coords, *subCoords; 2740285d324eSMatthew G. Knepley PetscInt numComp, coordSize; 2741e6ccafaeSMatthew G Knepley 274269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2743e6ccafaeSMatthew G Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 274469d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2745285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2746285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2747285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2748e6ccafaeSMatthew G Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2749e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2750e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2751e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2752e6ccafaeSMatthew G Knepley PetscInt dof; 2753e6ccafaeSMatthew G Knepley 2754e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2755e6ccafaeSMatthew G Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2756285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2757e6ccafaeSMatthew G Knepley } 2758e6ccafaeSMatthew G Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2759e6ccafaeSMatthew G Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2760e6ccafaeSMatthew G Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2761e6ccafaeSMatthew G Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 27622eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 2763e6ccafaeSMatthew G Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2764e6ccafaeSMatthew G Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2765e6ccafaeSMatthew G Knepley for (v = 0; v < numSubPoints[0]; ++v) { 2766e6ccafaeSMatthew G Knepley const PetscInt vertex = subpoints[0][v]; 2767e6ccafaeSMatthew G Knepley const PetscInt subvertex = firstSubPoint[0]+v; 2768e6ccafaeSMatthew G Knepley PetscInt dof, off, sdof, soff, d; 2769e6ccafaeSMatthew G Knepley 2770e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2771e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2772e6ccafaeSMatthew G Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2773e6ccafaeSMatthew G Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2774e6ccafaeSMatthew 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); 2775efa14ee0SMatthew G Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2776e6ccafaeSMatthew G Knepley } 2777e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2778e6ccafaeSMatthew G Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2779e6ccafaeSMatthew G Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2780e6ccafaeSMatthew G Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2781e6ccafaeSMatthew G Knepley } 27823982b651SMatthew G. Knepley /* Build SF: We need this complexity because subpoints might not be selected on the owning process */ 27833982b651SMatthew G. Knepley { 27843982b651SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 27853982b651SMatthew G. Knepley IS subpIS; 27863982b651SMatthew G. Knepley const PetscSFNode *remotePoints; 27873982b651SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 27883982b651SMatthew G. Knepley const PetscInt *localPoints, *subpoints; 27893982b651SMatthew G. Knepley PetscInt *slocalPoints; 27903982b651SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubpoints = 0, numSubroots, numSubleaves = 0, l, sl, ll, pStart, pEnd, p; 27913982b651SMatthew G. Knepley PetscMPIInt rank; 27923982b651SMatthew G. Knepley 27933982b651SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 27943982b651SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 27953982b651SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 27963982b651SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 27973982b651SMatthew G. Knepley ierr = DMPlexGetChart(subdm, NULL, &numSubroots);CHKERRQ(ierr); 27983982b651SMatthew G. Knepley ierr = DMPlexCreateSubpointIS(subdm, &subpIS);CHKERRQ(ierr); 27993982b651SMatthew G. Knepley if (subpIS) { 28003982b651SMatthew G. Knepley ierr = ISGetIndices(subpIS, &subpoints);CHKERRQ(ierr); 28013982b651SMatthew G. Knepley ierr = ISGetLocalSize(subpIS, &numSubpoints);CHKERRQ(ierr); 28023982b651SMatthew G. Knepley } 28033982b651SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 28043982b651SMatthew G. Knepley if (numRoots >= 0) { 28053982b651SMatthew G. Knepley ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 28063982b651SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 28073982b651SMatthew G. Knepley newLocalPoints[p].rank = -2; 28083982b651SMatthew G. Knepley newLocalPoints[p].index = -2; 28093982b651SMatthew G. Knepley } 28103982b651SMatthew G. Knepley /* Set subleaves */ 28113982b651SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 28123982b651SMatthew G. Knepley const PetscInt point = localPoints[l]; 28133982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 28143982b651SMatthew G. Knepley 28153982b651SMatthew G. Knepley if (subpoint < 0) continue; 28163982b651SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 28173982b651SMatthew G. Knepley newLocalPoints[point-pStart].index = subpoint; 28183982b651SMatthew G. Knepley ++numSubleaves; 28193982b651SMatthew G. Knepley } 28203982b651SMatthew G. Knepley /* Must put in owned subpoints */ 28213982b651SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 28223982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(p, 0, numSubpoints, subpoints); 28233982b651SMatthew G. Knepley 28243982b651SMatthew G. Knepley if (subpoint < 0) { 28253982b651SMatthew G. Knepley newOwners[p-pStart].rank = -3; 28263982b651SMatthew G. Knepley newOwners[p-pStart].index = -3; 28273982b651SMatthew G. Knepley } else { 28283982b651SMatthew G. Knepley newOwners[p-pStart].rank = rank; 28293982b651SMatthew G. Knepley newOwners[p-pStart].index = subpoint; 28303982b651SMatthew G. Knepley } 28313982b651SMatthew G. Knepley } 28323982b651SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 28333982b651SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 28343982b651SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 28353982b651SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 28363982b651SMatthew G. Knepley ierr = PetscMalloc1(numSubleaves, &slocalPoints);CHKERRQ(ierr); 28373982b651SMatthew G. Knepley ierr = PetscMalloc1(numSubleaves, &sremotePoints);CHKERRQ(ierr); 28383982b651SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 28393982b651SMatthew G. Knepley const PetscInt point = localPoints[l]; 28403982b651SMatthew G. Knepley const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints); 28413982b651SMatthew G. Knepley 28423982b651SMatthew G. Knepley if (subpoint < 0) continue; 28433982b651SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 28443982b651SMatthew G. Knepley slocalPoints[sl] = subpoint; 28453982b651SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 28463982b651SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 28473982b651SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 28483982b651SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 28493982b651SMatthew G. Knepley ++sl; 28503982b651SMatthew G. Knepley } 28513982b651SMatthew G. Knepley if (sl + ll != numSubleaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubleaves); 28523982b651SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 28533982b651SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubroots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 28543982b651SMatthew G. Knepley } 28553982b651SMatthew G. Knepley if (subpIS) { 28563982b651SMatthew G. Knepley ierr = ISRestoreIndices(subpIS, &subpoints);CHKERRQ(ierr); 28573982b651SMatthew G. Knepley ierr = ISDestroy(&subpIS);CHKERRQ(ierr); 28583982b651SMatthew G. Knepley } 28593982b651SMatthew G. Knepley } 2860efa14ee0SMatthew G Knepley /* Cleanup */ 2861e6ccafaeSMatthew G Knepley for (d = 0; d <= dim; ++d) { 28620ae02aa4SMatthew G. Knepley if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);} 2863e6ccafaeSMatthew G Knepley ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2864e6ccafaeSMatthew G Knepley } 2865efa14ee0SMatthew G Knepley ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2866e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2867e6ccafaeSMatthew G Knepley } 2868e6ccafaeSMatthew G Knepley 2869e6ccafaeSMatthew G Knepley #undef __FUNCT__ 28703982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated" 28713982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm) 28723982b651SMatthew G. Knepley { 28733982b651SMatthew G. Knepley PetscErrorCode ierr; 28743982b651SMatthew G. Knepley 28753982b651SMatthew G. Knepley PetscFunctionBegin; 2876*bec263e5SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, vertexLabel, value, PETSC_FALSE, 1, subdm);CHKERRQ(ierr); 28773982b651SMatthew G. Knepley PetscFunctionReturn(0); 28783982b651SMatthew G. Knepley } 28793982b651SMatthew G. Knepley 28803982b651SMatthew G. Knepley #undef __FUNCT__ 2881e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh" 2882d0fa310fSMatthew G. Knepley /*@ 2883e6ccafaeSMatthew G Knepley DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 2884e6ccafaeSMatthew G Knepley 2885e6ccafaeSMatthew G Knepley Input Parameters: 2886e6ccafaeSMatthew G Knepley + dm - The original mesh 2887830e53efSMatthew G. Knepley . vertexLabel - The DMLabel marking vertices contained in the surface 2888830e53efSMatthew G. Knepley - value - The label value to use 2889e6ccafaeSMatthew G Knepley 2890e6ccafaeSMatthew G Knepley Output Parameter: 2891e6ccafaeSMatthew G Knepley . subdm - The surface mesh 2892e6ccafaeSMatthew G Knepley 2893e6ccafaeSMatthew G Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2894e6ccafaeSMatthew G Knepley 2895e6ccafaeSMatthew G Knepley Level: developer 2896e6ccafaeSMatthew G Knepley 2897e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue() 2898830e53efSMatthew G. Knepley @*/ 289953156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm) 2900e6ccafaeSMatthew G Knepley { 2901e6ccafaeSMatthew G Knepley PetscInt dim, depth; 2902e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 2903e6ccafaeSMatthew G Knepley 2904e6ccafaeSMatthew G Knepley PetscFunctionBegin; 2905e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2906766ab985SMatthew G. Knepley PetscValidPointer(subdm, 3); 2907c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2908e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 290982f516ccSBarry Smith ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2910e6ccafaeSMatthew G Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2911c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2912e6ccafaeSMatthew G Knepley if (depth == dim) { 2913830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2914e6ccafaeSMatthew G Knepley } else { 2915830e53efSMatthew G. Knepley ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2916e6ccafaeSMatthew G Knepley } 2917e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 2918e6ccafaeSMatthew G Knepley } 2919e6ccafaeSMatthew G Knepley 2920e6ccafaeSMatthew G Knepley #undef __FUNCT__ 2921766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated" 292227c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 2923766ab985SMatthew G. Knepley { 2924766ab985SMatthew G. Knepley MPI_Comm comm; 2925766ab985SMatthew G. Knepley DMLabel subpointMap; 2926766ab985SMatthew G. Knepley IS subvertexIS; 2927766ab985SMatthew G. Knepley const PetscInt *subVertices; 2928fed694aaSMatthew G. Knepley PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 2929766ab985SMatthew G. Knepley PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 293087feddfdSMatthew G. Knepley PetscInt cMax, c, f; 2931766ab985SMatthew G. Knepley PetscErrorCode ierr; 2932766ab985SMatthew G. Knepley 2933766ab985SMatthew G. Knepley PetscFunctionBegin; 2934766ab985SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 2935766ab985SMatthew G. Knepley /* Create subpointMap which marks the submesh */ 2936766ab985SMatthew G. Knepley ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2937766ab985SMatthew G. Knepley ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2938766ab985SMatthew G. Knepley ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 293927c04023SMatthew G. Knepley ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 2940766ab985SMatthew G. Knepley /* Setup chart */ 2941766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2942766ab985SMatthew G. Knepley ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2943766ab985SMatthew G. Knepley ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2944766ab985SMatthew G. Knepley ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2945766ab985SMatthew G. Knepley /* Set cone sizes */ 2946766ab985SMatthew G. Knepley firstSubVertex = numSubCells; 2947766ab985SMatthew G. Knepley firstSubFace = numSubCells+numSubVertices; 2948766ab985SMatthew G. Knepley newFacePoint = firstSubFace; 2949766ab985SMatthew G. Knepley ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2950766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2951766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2952766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2953766ab985SMatthew G. Knepley } 2954766ab985SMatthew G. Knepley for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2955766ab985SMatthew G. Knepley ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2956766ab985SMatthew G. Knepley } 2957766ab985SMatthew G. Knepley ierr = DMSetUp(subdm);CHKERRQ(ierr); 2958766ab985SMatthew G. Knepley /* Create face cones */ 2959766ab985SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 296087feddfdSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2961766ab985SMatthew G. Knepley ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2962766ab985SMatthew G. Knepley for (c = 0; c < numSubCells; ++c) { 2963766ab985SMatthew G. Knepley const PetscInt cell = subCells[c]; 2964766ab985SMatthew G. Knepley const PetscInt subcell = c; 296587feddfdSMatthew G. Knepley const PetscInt *cone, *cells; 296687feddfdSMatthew G. Knepley PetscInt numCells, subVertex, p, v; 2967766ab985SMatthew G. Knepley 296887feddfdSMatthew G. Knepley if (cell < cMax) continue; 296987feddfdSMatthew G. Knepley ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 297087feddfdSMatthew G. Knepley for (v = 0; v < nFV; ++v) { 297187feddfdSMatthew G. Knepley ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 297287feddfdSMatthew G. Knepley subface[v] = firstSubVertex+subVertex; 297387feddfdSMatthew G. Knepley } 297487feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 297587feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 297687feddfdSMatthew G. Knepley ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 297727234c99SMatthew G. Knepley /* Not true in parallel 297827234c99SMatthew G. Knepley if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 297987feddfdSMatthew G. Knepley for (p = 0; p < numCells; ++p) { 298087feddfdSMatthew G. Knepley PetscInt negsubcell; 2981766ab985SMatthew G. Knepley 298287feddfdSMatthew G. Knepley if (cells[p] >= cMax) continue; 298387feddfdSMatthew G. Knepley /* I know this is a crap search */ 298487feddfdSMatthew G. Knepley for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 298587feddfdSMatthew G. Knepley if (subCells[negsubcell] == cells[p]) break; 2986766ab985SMatthew G. Knepley } 298787feddfdSMatthew G. Knepley if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 298887feddfdSMatthew G. Knepley ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 2989766ab985SMatthew G. Knepley } 299087feddfdSMatthew G. Knepley ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 299187feddfdSMatthew G. Knepley ++newFacePoint; 2992766ab985SMatthew G. Knepley } 2993766ab985SMatthew G. Knepley ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2994766ab985SMatthew G. Knepley ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2995766ab985SMatthew G. Knepley ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2996766ab985SMatthew G. Knepley /* Build coordinates */ 2997766ab985SMatthew G. Knepley { 2998766ab985SMatthew G. Knepley PetscSection coordSection, subCoordSection; 2999766ab985SMatthew G. Knepley Vec coordinates, subCoordinates; 3000766ab985SMatthew G. Knepley PetscScalar *coords, *subCoords; 3001285d324eSMatthew G. Knepley PetscInt numComp, coordSize, v; 3002766ab985SMatthew G. Knepley 300369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3004766ab985SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 300569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 3006285d324eSMatthew G. Knepley ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 3007285d324eSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 3008285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 3009766ab985SMatthew G. Knepley ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 3010766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 3011766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 3012766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 3013766ab985SMatthew G. Knepley PetscInt dof; 3014766ab985SMatthew G. Knepley 3015766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3016766ab985SMatthew G. Knepley ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 3017285d324eSMatthew G. Knepley ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 3018766ab985SMatthew G. Knepley } 3019766ab985SMatthew G. Knepley ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 3020766ab985SMatthew G. Knepley ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 3021766ab985SMatthew G. Knepley ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 3022766ab985SMatthew G. Knepley ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 30232eb5907fSJed Brown ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr); 3024766ab985SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 3025766ab985SMatthew G. Knepley ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3026766ab985SMatthew G. Knepley for (v = 0; v < numSubVertices; ++v) { 3027766ab985SMatthew G. Knepley const PetscInt vertex = subVertices[v]; 3028766ab985SMatthew G. Knepley const PetscInt subvertex = firstSubVertex+v; 3029766ab985SMatthew G. Knepley PetscInt dof, off, sdof, soff, d; 3030766ab985SMatthew G. Knepley 3031766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 3032766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 3033766ab985SMatthew G. Knepley ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 3034766ab985SMatthew G. Knepley ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 3035766ab985SMatthew 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); 3036766ab985SMatthew G. Knepley for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 3037766ab985SMatthew G. Knepley } 3038766ab985SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3039766ab985SMatthew G. Knepley ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 3040766ab985SMatthew G. Knepley ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 3041766ab985SMatthew G. Knepley ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 3042766ab985SMatthew G. Knepley } 3043aca35d17SMatthew G. Knepley /* Build SF */ 3044aca35d17SMatthew G. Knepley CHKMEMQ; 3045aca35d17SMatthew G. Knepley { 3046aca35d17SMatthew G. Knepley PetscSF sfPoint, sfPointSub; 3047aca35d17SMatthew G. Knepley const PetscSFNode *remotePoints; 3048bdcf2095SMatthew G. Knepley PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 3049aca35d17SMatthew G. Knepley const PetscInt *localPoints; 3050bdcf2095SMatthew G. Knepley PetscInt *slocalPoints; 305149c26ae4SMatthew G. Knepley PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 3052bdcf2095SMatthew G. Knepley PetscMPIInt rank; 3053aca35d17SMatthew G. Knepley 3054bdcf2095SMatthew G. Knepley ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 3055aca35d17SMatthew G. Knepley ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 3056aca35d17SMatthew G. Knepley ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 3057aca35d17SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3058aca35d17SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3059aca35d17SMatthew G. Knepley ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 3060aca35d17SMatthew G. Knepley if (numRoots >= 0) { 3061aca35d17SMatthew G. Knepley /* Only vertices should be shared */ 3062dcca6d9dSJed Brown ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr); 3063bdcf2095SMatthew G. Knepley for (p = 0; p < pEnd-pStart; ++p) { 3064bdcf2095SMatthew G. Knepley newLocalPoints[p].rank = -2; 3065bdcf2095SMatthew G. Knepley newLocalPoints[p].index = -2; 3066bdcf2095SMatthew G. Knepley } 30679e0823b2SMatthew G. Knepley /* Set subleaves */ 3068aca35d17SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 3069aca35d17SMatthew G. Knepley const PetscInt point = localPoints[l]; 3070bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 3071aca35d17SMatthew G. Knepley 3072aca35d17SMatthew G. Knepley if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 3073bdcf2095SMatthew G. Knepley if (subPoint < 0) continue; 3074bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].rank = rank; 3075bdcf2095SMatthew G. Knepley newLocalPoints[point-pStart].index = subPoint; 3076bdcf2095SMatthew G. Knepley ++numSubLeaves; 3077aca35d17SMatthew G. Knepley } 30789e0823b2SMatthew G. Knepley /* Must put in owned subpoints */ 30799e0823b2SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 30809e0823b2SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 30819e0823b2SMatthew G. Knepley 30829e0823b2SMatthew G. Knepley if (subPoint < 0) { 30839e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = -3; 30849e0823b2SMatthew G. Knepley newOwners[p-pStart].index = -3; 30859e0823b2SMatthew G. Knepley } else { 30869e0823b2SMatthew G. Knepley newOwners[p-pStart].rank = rank; 30879e0823b2SMatthew G. Knepley newOwners[p-pStart].index = subPoint; 30889e0823b2SMatthew G. Knepley } 3089bdcf2095SMatthew G. Knepley } 3090bdcf2095SMatthew G. Knepley ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3091bdcf2095SMatthew G. Knepley ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 3092bdcf2095SMatthew G. Knepley ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3093bdcf2095SMatthew G. Knepley ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 3094785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &slocalPoints);CHKERRQ(ierr); 3095785e854fSJed Brown ierr = PetscMalloc1(numSubLeaves, &sremotePoints);CHKERRQ(ierr); 309649c26ae4SMatthew G. Knepley for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 3097bdcf2095SMatthew G. Knepley const PetscInt point = localPoints[l]; 3098bdcf2095SMatthew G. Knepley const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 3099aca35d17SMatthew G. Knepley 3100aca35d17SMatthew G. Knepley if (subPoint < 0) continue; 310149c26ae4SMatthew G. Knepley if (newLocalPoints[point].rank == rank) {++ll; continue;} 3102aca35d17SMatthew G. Knepley slocalPoints[sl] = subPoint; 3103bdcf2095SMatthew G. Knepley sremotePoints[sl].rank = newLocalPoints[point].rank; 3104bdcf2095SMatthew G. Knepley sremotePoints[sl].index = newLocalPoints[point].index; 3105bdcf2095SMatthew G. Knepley if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 3106bdcf2095SMatthew G. Knepley if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 3107aca35d17SMatthew G. Knepley ++sl; 3108aca35d17SMatthew G. Knepley } 3109bdcf2095SMatthew G. Knepley ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 311049c26ae4SMatthew G. Knepley if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 311149c26ae4SMatthew G. Knepley ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 3112aca35d17SMatthew G. Knepley } 3113aca35d17SMatthew G. Knepley } 3114aca35d17SMatthew G. Knepley CHKMEMQ; 3115766ab985SMatthew G. Knepley /* Cleanup */ 3116766ab985SMatthew G. Knepley if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 3117766ab985SMatthew G. Knepley ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 3118766ab985SMatthew G. Knepley ierr = PetscFree(subCells);CHKERRQ(ierr); 3119766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3120766ab985SMatthew G. Knepley } 3121766ab985SMatthew G. Knepley 3122766ab985SMatthew G. Knepley #undef __FUNCT__ 3123766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated" 31243982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DM subdm) 3125766ab985SMatthew G. Knepley { 31263982b651SMatthew G. Knepley DMLabel label = NULL; 3127766ab985SMatthew G. Knepley PetscErrorCode ierr; 3128766ab985SMatthew G. Knepley 3129766ab985SMatthew G. Knepley PetscFunctionBegin; 31303982b651SMatthew G. Knepley if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 3131*bec263e5SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, label, value, PETSC_TRUE, 1, subdm);CHKERRQ(ierr); 3132766ab985SMatthew G. Knepley PetscFunctionReturn(0); 3133766ab985SMatthew G. Knepley } 3134766ab985SMatthew G. Knepley 3135766ab985SMatthew G. Knepley #undef __FUNCT__ 3136766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh" 3137766ab985SMatthew G. Knepley /* 313827c04023SMatthew 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. 3139766ab985SMatthew G. Knepley 3140766ab985SMatthew G. Knepley Input Parameters: 3141766ab985SMatthew G. Knepley + dm - The original mesh 314227c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 31437afc1a8bSJed Brown . label - A label name, or NULL 314427c04023SMatthew G. Knepley - value - A label value 3145766ab985SMatthew G. Knepley 3146766ab985SMatthew G. Knepley Output Parameter: 3147766ab985SMatthew G. Knepley . subdm - The surface mesh 3148766ab985SMatthew G. Knepley 3149766ab985SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3150766ab985SMatthew G. Knepley 3151766ab985SMatthew G. Knepley Level: developer 3152766ab985SMatthew G. Knepley 3153766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 3154766ab985SMatthew G. Knepley */ 315527c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 3156766ab985SMatthew G. Knepley { 3157766ab985SMatthew G. Knepley PetscInt dim, depth; 3158766ab985SMatthew G. Knepley PetscErrorCode ierr; 3159766ab985SMatthew G. Knepley 3160766ab985SMatthew G. Knepley PetscFunctionBegin; 3161766ab985SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 316227c04023SMatthew G. Knepley PetscValidPointer(subdm, 5); 3163c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3164766ab985SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3165766ab985SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 3166766ab985SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3167c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr); 3168766ab985SMatthew G. Knepley if (depth == dim) { 3169b3154360SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr); 3170766ab985SMatthew G. Knepley } else { 317127c04023SMatthew G. Knepley ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 3172e6ccafaeSMatthew G Knepley } 3173e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3174e6ccafaeSMatthew G Knepley } 3175e6ccafaeSMatthew G Knepley 3176e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3177*bec263e5SMatthew G. Knepley #define __FUNCT__ "DMPlexFilter" 3178*bec263e5SMatthew G. Knepley /*@ 3179*bec263e5SMatthew G. Knepley DMPlexFilter - Extract a subset of mesh cells defined by a label as a separate mesh 3180*bec263e5SMatthew G. Knepley 3181*bec263e5SMatthew G. Knepley Input Parameters: 3182*bec263e5SMatthew G. Knepley + dm - The original mesh 3183*bec263e5SMatthew G. Knepley . cellLabel - The DMLabel marking cells contained in the new mesh 3184*bec263e5SMatthew G. Knepley - value - The label value to use 3185*bec263e5SMatthew G. Knepley 3186*bec263e5SMatthew G. Knepley Output Parameter: 3187*bec263e5SMatthew G. Knepley . subdm - The new mesh 3188*bec263e5SMatthew G. Knepley 3189*bec263e5SMatthew G. Knepley Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 3190*bec263e5SMatthew G. Knepley 3191*bec263e5SMatthew G. Knepley Level: developer 3192*bec263e5SMatthew G. Knepley 3193*bec263e5SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue() 3194*bec263e5SMatthew G. Knepley @*/ 3195*bec263e5SMatthew G. Knepley PetscErrorCode DMPlexFilter(DM dm, DMLabel cellLabel, PetscInt value, DM *subdm) 3196*bec263e5SMatthew G. Knepley { 3197*bec263e5SMatthew G. Knepley PetscInt dim; 3198*bec263e5SMatthew G. Knepley PetscErrorCode ierr; 3199*bec263e5SMatthew G. Knepley 3200*bec263e5SMatthew G. Knepley PetscFunctionBegin; 3201*bec263e5SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3202*bec263e5SMatthew G. Knepley PetscValidPointer(subdm, 3); 3203*bec263e5SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3204*bec263e5SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject) dm), subdm);CHKERRQ(ierr); 3205*bec263e5SMatthew G. Knepley ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 3206*bec263e5SMatthew G. Knepley ierr = DMSetDimension(*subdm, dim);CHKERRQ(ierr); 3207*bec263e5SMatthew G. Knepley /* Extract submesh in place, could be empty on some procs, could have inconsistency if procs do not both extract a shared cell */ 3208*bec263e5SMatthew G. Knepley ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, cellLabel, value, PETSC_FALSE, 0, *subdm);CHKERRQ(ierr); 3209*bec263e5SMatthew G. Knepley PetscFunctionReturn(0); 3210*bec263e5SMatthew G. Knepley } 3211*bec263e5SMatthew G. Knepley 3212*bec263e5SMatthew G. Knepley #undef __FUNCT__ 3213e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap" 321464beef6dSMatthew G. Knepley /*@ 321564beef6dSMatthew G. Knepley DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 321664beef6dSMatthew G. Knepley 321764beef6dSMatthew G. Knepley Input Parameter: 321864beef6dSMatthew G. Knepley . dm - The submesh DM 321964beef6dSMatthew G. Knepley 322064beef6dSMatthew G. Knepley Output Parameter: 322164beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 322264beef6dSMatthew G. Knepley 322364beef6dSMatthew G. Knepley Level: developer 322464beef6dSMatthew G. Knepley 322564beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 322664beef6dSMatthew G. Knepley @*/ 3227e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 3228e6ccafaeSMatthew G Knepley { 3229e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3230e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3231e6ccafaeSMatthew G Knepley PetscValidPointer(subpointMap, 2); 323265663942SMatthew G. Knepley *subpointMap = ((DM_Plex*) dm->data)->subpointMap; 3233e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3234e6ccafaeSMatthew G Knepley } 3235e6ccafaeSMatthew G Knepley 3236e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3237e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap" 3238e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */ 3239e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 3240e6ccafaeSMatthew G Knepley { 3241e6ccafaeSMatthew G Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 3242285d324eSMatthew G. Knepley DMLabel tmp; 3243e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3244e6ccafaeSMatthew G Knepley 3245e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3246e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3247285d324eSMatthew G. Knepley tmp = mesh->subpointMap; 3248e6ccafaeSMatthew G Knepley mesh->subpointMap = subpointMap; 3249285d324eSMatthew G. Knepley ++mesh->subpointMap->refct; 3250285d324eSMatthew G. Knepley ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 3251e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3252e6ccafaeSMatthew G Knepley } 3253e6ccafaeSMatthew G Knepley 3254e6ccafaeSMatthew G Knepley #undef __FUNCT__ 3255e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS" 325664beef6dSMatthew G. Knepley /*@ 3257e6ccafaeSMatthew G Knepley DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 3258e6ccafaeSMatthew G Knepley 3259e6ccafaeSMatthew G Knepley Input Parameter: 3260e6ccafaeSMatthew G Knepley . dm - The submesh DM 3261e6ccafaeSMatthew G Knepley 3262e6ccafaeSMatthew G Knepley Output Parameter: 32630298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 3264e6ccafaeSMatthew G Knepley 32653982b651SMatthew G. Knepley Note: This IS is guaranteed to be sorted by the construction of the submesh 326664beef6dSMatthew G. Knepley 326764beef6dSMatthew G. Knepley Level: developer 326864beef6dSMatthew G. Knepley 326964beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 327064beef6dSMatthew G. Knepley @*/ 3271e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 3272e6ccafaeSMatthew G Knepley { 327382f516ccSBarry Smith MPI_Comm comm; 3274e6ccafaeSMatthew G Knepley DMLabel subpointMap; 3275e6ccafaeSMatthew G Knepley IS is; 3276e6ccafaeSMatthew G Knepley const PetscInt *opoints; 3277e6ccafaeSMatthew G Knepley PetscInt *points, *depths; 3278e6ccafaeSMatthew G Knepley PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 3279e6ccafaeSMatthew G Knepley PetscErrorCode ierr; 3280e6ccafaeSMatthew G Knepley 3281e6ccafaeSMatthew G Knepley PetscFunctionBegin; 3282e6ccafaeSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3283e6ccafaeSMatthew G Knepley PetscValidPointer(subpointIS, 2); 328482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 32850298fd71SBarry Smith *subpointIS = NULL; 3286e6ccafaeSMatthew G Knepley ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 3287e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3288fed694aaSMatthew G. Knepley if (subpointMap && depth >= 0) { 3289e6ccafaeSMatthew G Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3290e6ccafaeSMatthew G Knepley if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 3291e6ccafaeSMatthew G Knepley ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3292e6ccafaeSMatthew G Knepley depths[0] = depth; 3293e6ccafaeSMatthew G Knepley depths[1] = 0; 3294e6ccafaeSMatthew G Knepley for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 3295785e854fSJed Brown ierr = PetscMalloc1(pEnd, &points);CHKERRQ(ierr); 3296e6ccafaeSMatthew G Knepley for(d = 0, off = 0; d <= depth; ++d) { 3297e6ccafaeSMatthew G Knepley const PetscInt dep = depths[d]; 3298e6ccafaeSMatthew G Knepley 3299e6ccafaeSMatthew G Knepley ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 3300e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 33011e21b6fdSMatthew G Knepley if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 3302e6ccafaeSMatthew 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); 3303e6ccafaeSMatthew G Knepley } else { 33041e21b6fdSMatthew G Knepley if (!n) { 33051e21b6fdSMatthew G Knepley if (d == 0) { 33061e21b6fdSMatthew G Knepley /* Missing cells */ 33071e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 33081e21b6fdSMatthew G Knepley } else { 33091e21b6fdSMatthew G Knepley /* Missing faces */ 33101e21b6fdSMatthew G Knepley for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 33111e21b6fdSMatthew G Knepley } 33121e21b6fdSMatthew G Knepley } 3313e6ccafaeSMatthew G Knepley } 3314e6ccafaeSMatthew G Knepley if (n) { 3315e6ccafaeSMatthew G Knepley ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 3316e6ccafaeSMatthew G Knepley ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 3317e6ccafaeSMatthew G Knepley for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 3318e6ccafaeSMatthew G Knepley ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 3319e6ccafaeSMatthew G Knepley ierr = ISDestroy(&is);CHKERRQ(ierr); 3320e6ccafaeSMatthew G Knepley } 3321e6ccafaeSMatthew G Knepley } 3322e6ccafaeSMatthew G Knepley ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 3323e6ccafaeSMatthew G Knepley if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 3324fed694aaSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 3325e6ccafaeSMatthew G Knepley } 3326e6ccafaeSMatthew G Knepley PetscFunctionReturn(0); 3327e6ccafaeSMatthew G Knepley } 3328