1 #include <petsc-private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 2 #include <petscsf.h> 3 4 #undef __FUNCT__ 5 #define __FUNCT__ "DMPlexMarkBoundaryFaces" 6 /*@ 7 DMPlexMarkBoundaryFaces - Mark all faces on the boundary 8 9 Not Collective 10 11 Input Parameter: 12 . dm - The original DM 13 14 Output Parameter: 15 . label - The DMLabel marking boundary faces with value 1 16 17 Level: developer 18 19 .seealso: DMLabelCreate(), DMPlexCreateLabel() 20 @*/ 21 PetscErrorCode DMPlexMarkBoundaryFaces(DM dm, DMLabel label) 22 { 23 PetscInt fStart, fEnd, f; 24 PetscErrorCode ierr; 25 26 PetscFunctionBegin; 27 PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 28 ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr); 29 for (f = fStart; f < fEnd; ++f) { 30 PetscInt supportSize; 31 32 ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 33 if (supportSize == 1) { 34 ierr = DMLabelSetValue(label, f, 1);CHKERRQ(ierr); 35 } 36 } 37 PetscFunctionReturn(0); 38 } 39 40 #undef __FUNCT__ 41 #define __FUNCT__ "DMPlexLabelComplete" 42 /*@ 43 DMPlexLabelComplete - Starting with a label marking points on a surface, we add the transitive closure to the surface 44 45 Input Parameters: 46 + dm - The DM 47 - label - A DMLabel marking the surface points 48 49 Output Parameter: 50 . label - A DMLabel marking all surface points in the transitive closure 51 52 Level: developer 53 54 .seealso: DMPlexLabelCohesiveComplete() 55 @*/ 56 PetscErrorCode DMPlexLabelComplete(DM dm, DMLabel label) 57 { 58 IS valueIS; 59 const PetscInt *values; 60 PetscInt numValues, v; 61 PetscErrorCode ierr; 62 63 PetscFunctionBegin; 64 ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 65 ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 66 ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 67 for (v = 0; v < numValues; ++v) { 68 IS pointIS; 69 const PetscInt *points; 70 PetscInt numPoints, p; 71 72 ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr); 73 ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr); 74 ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 75 for (p = 0; p < numPoints; ++p) { 76 PetscInt *closure = NULL; 77 PetscInt closureSize, c; 78 79 ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 80 for (c = 0; c < closureSize*2; c += 2) { 81 ierr = DMLabelSetValue(label, closure[c], values[v]);CHKERRQ(ierr); 82 } 83 ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 84 } 85 ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 86 ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 87 } 88 ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 89 ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 90 PetscFunctionReturn(0); 91 } 92 93 #undef __FUNCT__ 94 #define __FUNCT__ "DMPlexShiftPoint_Internal" 95 PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthEnd[], PetscInt depthShift[]) 96 { 97 if (depth < 0) return p; 98 /* Cells */ if (p < depthEnd[depth]) return p; 99 /* Vertices */ if (p < depthEnd[0]) return p + depthShift[depth]; 100 /* Faces */ if (p < depthEnd[depth-1]) return p + depthShift[depth] + depthShift[0]; 101 /* Edges */ return p + depthShift[depth] + depthShift[0] + depthShift[depth-1]; 102 } 103 104 #undef __FUNCT__ 105 #define __FUNCT__ "DMPlexShiftSizes_Internal" 106 static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew) 107 { 108 PetscInt *depthEnd; 109 PetscInt depth = 0, d, pStart, pEnd, p; 110 PetscErrorCode ierr; 111 112 PetscFunctionBegin; 113 ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 114 if (depth < 0) PetscFunctionReturn(0); 115 ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 116 /* Step 1: Expand chart */ 117 ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 118 for (d = 0; d <= depth; ++d) { 119 pEnd += depthShift[d]; 120 ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 121 } 122 ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr); 123 /* Step 2: Set cone and support sizes */ 124 for (d = 0; d <= depth; ++d) { 125 ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 126 for (p = pStart; p < pEnd; ++p) { 127 PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthEnd, depthShift); 128 PetscInt size; 129 130 ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 131 ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr); 132 ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 133 ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr); 134 } 135 } 136 ierr = PetscFree(depthEnd);CHKERRQ(ierr); 137 PetscFunctionReturn(0); 138 } 139 140 #undef __FUNCT__ 141 #define __FUNCT__ "DMPlexShiftPoints_Internal" 142 static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew) 143 { 144 PetscInt *depthEnd, *newpoints; 145 PetscInt depth = 0, d, maxConeSize, maxSupportSize, pStart, pEnd, p; 146 PetscErrorCode ierr; 147 148 PetscFunctionBegin; 149 ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 150 if (depth < 0) PetscFunctionReturn(0); 151 ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 152 ierr = PetscMalloc2(depth+1,PetscInt,&depthEnd,PetscMax(maxConeSize, maxSupportSize),PetscInt,&newpoints);CHKERRQ(ierr); 153 for (d = 0; d <= depth; ++d) { 154 ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 155 } 156 /* Step 5: Set cones and supports */ 157 ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 158 for (p = pStart; p < pEnd; ++p) { 159 const PetscInt *points = NULL, *orientations = NULL; 160 PetscInt size, i, newp = DMPlexShiftPoint_Internal(p, depth, depthEnd, depthShift); 161 162 ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr); 163 ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr); 164 ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr); 165 for (i = 0; i < size; ++i) { 166 newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthEnd, depthShift); 167 } 168 ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr); 169 ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr); 170 ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr); 171 ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr); 172 for (i = 0; i < size; ++i) { 173 newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthEnd, depthShift); 174 } 175 ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr); 176 } 177 ierr = PetscFree2(depthEnd,newpoints);CHKERRQ(ierr); 178 PetscFunctionReturn(0); 179 } 180 181 #undef __FUNCT__ 182 #define __FUNCT__ "DMPlexShiftCoordinates_Internal" 183 static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew) 184 { 185 PetscSection coordSection, newCoordSection; 186 Vec coordinates, newCoordinates; 187 PetscScalar *coords, *newCoords; 188 PetscInt *depthEnd, coordSize; 189 PetscInt dim, depth = 0, d, vStart, vEnd, vStartNew, vEndNew, v; 190 PetscErrorCode ierr; 191 192 PetscFunctionBegin; 193 ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 194 ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 195 ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 196 for (d = 0; d <= depth; ++d) { 197 ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 198 } 199 /* Step 8: Convert coordinates */ 200 ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 201 ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr); 202 ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 203 ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr); 204 ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr); 205 ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr); 206 ierr = PetscSectionSetChart(newCoordSection, vStartNew, vEndNew);CHKERRQ(ierr); 207 for (v = vStartNew; v < vEndNew; ++v) { 208 ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr); 209 ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr); 210 } 211 ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr); 212 ierr = DMPlexSetCoordinateSection(dmNew, newCoordSection);CHKERRQ(ierr); 213 ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr); 214 ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr); 215 ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr); 216 ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 217 ierr = VecSetType(newCoordinates,dm->vectype);CHKERRQ(ierr); 218 ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr); 219 ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 220 ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 221 ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr); 222 for (v = vStart; v < vEnd; ++v) { 223 PetscInt dof, off, noff, d; 224 225 ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 226 ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 227 ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthEnd, depthShift), &noff);CHKERRQ(ierr); 228 for (d = 0; d < dof; ++d) { 229 newCoords[noff+d] = coords[off+d]; 230 } 231 } 232 ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 233 ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr); 234 ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 235 ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr); 236 ierr = PetscFree(depthEnd);CHKERRQ(ierr); 237 PetscFunctionReturn(0); 238 } 239 240 #undef __FUNCT__ 241 #define __FUNCT__ "DMPlexShiftSF_Internal" 242 static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew) 243 { 244 PetscInt *depthEnd; 245 PetscInt depth = 0, d; 246 PetscSF sfPoint, sfPointNew; 247 const PetscSFNode *remotePoints; 248 PetscSFNode *gremotePoints; 249 const PetscInt *localPoints; 250 PetscInt *glocalPoints, *newLocation, *newRemoteLocation; 251 PetscInt numRoots, numLeaves, l, pStart, pEnd, totShift = 0; 252 PetscErrorCode ierr; 253 254 PetscFunctionBegin; 255 ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 256 ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 257 for (d = 0; d <= depth; ++d) { 258 totShift += depthShift[d]; 259 ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 260 } 261 /* Step 9: Convert pointSF */ 262 ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 263 ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr); 264 ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 265 ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 266 if (numRoots >= 0) { 267 ierr = PetscMalloc2(numRoots,PetscInt,&newLocation,pEnd-pStart,PetscInt,&newRemoteLocation);CHKERRQ(ierr); 268 for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthEnd, depthShift); 269 ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 270 ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr); 271 ierr = PetscMalloc(numLeaves * sizeof(PetscInt), &glocalPoints);CHKERRQ(ierr); 272 ierr = PetscMalloc(numLeaves * sizeof(PetscSFNode), &gremotePoints);CHKERRQ(ierr); 273 for (l = 0; l < numLeaves; ++l) { 274 glocalPoints[l] = DMPlexShiftPoint_Internal(localPoints[l], depth, depthEnd, depthShift); 275 gremotePoints[l].rank = remotePoints[l].rank; 276 gremotePoints[l].index = newRemoteLocation[localPoints[l]]; 277 } 278 ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr); 279 ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 280 } 281 ierr = PetscFree(depthEnd);CHKERRQ(ierr); 282 PetscFunctionReturn(0); 283 } 284 285 #undef __FUNCT__ 286 #define __FUNCT__ "DMPlexShiftLabels_Internal" 287 static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew) 288 { 289 PetscSF sfPoint; 290 DMLabel vtkLabel, ghostLabel; 291 PetscInt *depthEnd; 292 const PetscSFNode *leafRemote; 293 const PetscInt *leafLocal; 294 PetscInt depth = 0, d, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f; 295 PetscMPIInt rank; 296 PetscErrorCode ierr; 297 298 PetscFunctionBegin; 299 ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 300 ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr); 301 for (d = 0; d <= depth; ++d) { 302 ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr); 303 } 304 /* Step 10: Convert labels */ 305 ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 306 for (l = 0; l < numLabels; ++l) { 307 DMLabel label, newlabel; 308 const char *lname; 309 PetscBool isDepth; 310 IS valueIS; 311 const PetscInt *values; 312 PetscInt numValues, val; 313 314 ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr); 315 ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 316 if (isDepth) continue; 317 ierr = DMPlexCreateLabel(dmNew, lname);CHKERRQ(ierr); 318 ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr); 319 ierr = DMPlexGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr); 320 ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 321 ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 322 ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 323 for (val = 0; val < numValues; ++val) { 324 IS pointIS; 325 const PetscInt *points; 326 PetscInt numPoints, p; 327 328 ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr); 329 ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr); 330 ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 331 for (p = 0; p < numPoints; ++p) { 332 const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthEnd, depthShift); 333 334 ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr); 335 } 336 ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 337 ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 338 } 339 ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 340 ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 341 } 342 ierr = PetscFree(depthEnd);CHKERRQ(ierr); 343 /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */ 344 ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 345 ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 346 ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 347 ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr); 348 ierr = DMPlexCreateLabel(dmNew, "vtk");CHKERRQ(ierr); 349 ierr = DMPlexCreateLabel(dmNew, "ghost");CHKERRQ(ierr); 350 ierr = DMPlexGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr); 351 ierr = DMPlexGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr); 352 for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { 353 for (; c < leafLocal[l] && c < cEnd; ++c) { 354 ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 355 } 356 if (leafLocal[l] >= cEnd) break; 357 if (leafRemote[l].rank == rank) { 358 ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 359 } else { 360 ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr); 361 } 362 } 363 for (; c < cEnd; ++c) { 364 ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr); 365 } 366 if (0) { 367 ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 368 ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 369 ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 370 } 371 ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr); 372 for (f = fStart; f < fEnd; ++f) { 373 PetscInt numCells; 374 375 ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr); 376 if (numCells < 2) { 377 ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr); 378 } else { 379 const PetscInt *cells = NULL; 380 PetscInt vA, vB; 381 382 ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr); 383 ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr); 384 ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr); 385 if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);} 386 } 387 } 388 if (0) { 389 ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr); 390 ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 391 ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 392 } 393 PetscFunctionReturn(0); 394 } 395 396 #undef __FUNCT__ 397 #define __FUNCT__ "DMPlexConstructGhostCells_Internal" 398 static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm) 399 { 400 IS valueIS; 401 const PetscInt *values; 402 PetscInt *depthShift; 403 PetscInt depth = 0, numFS, fs, ghostCell, cEnd, c; 404 PetscErrorCode ierr; 405 406 PetscFunctionBegin; 407 /* Count ghost cells */ 408 ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 409 ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr); 410 ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 411 412 *numGhostCells = 0; 413 for (fs = 0; fs < numFS; ++fs) { 414 PetscInt numBdFaces; 415 416 ierr = DMLabelGetStratumSize(label, values[fs], &numBdFaces);CHKERRQ(ierr); 417 418 *numGhostCells += numBdFaces; 419 } 420 ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 421 ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthShift);CHKERRQ(ierr); 422 ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 423 if (depth >= 0) depthShift[depth] = *numGhostCells; 424 ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 425 /* Step 3: Set cone/support sizes for new points */ 426 ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 427 for (c = cEnd; c < cEnd + *numGhostCells; ++c) { 428 ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr); 429 } 430 for (fs = 0; fs < numFS; ++fs) { 431 IS faceIS; 432 const PetscInt *faces; 433 PetscInt numFaces, f; 434 435 ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 436 ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 437 ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 438 for (f = 0; f < numFaces; ++f) { 439 PetscInt size; 440 441 ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr); 442 if (size != 1) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "DM has boundary face %d with %d support cells", faces[f], size); 443 ierr = DMPlexSetSupportSize(gdm, faces[f] + *numGhostCells, 2);CHKERRQ(ierr); 444 } 445 ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 446 ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 447 } 448 /* Step 4: Setup ghosted DM */ 449 ierr = DMSetUp(gdm);CHKERRQ(ierr); 450 ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 451 /* Step 6: Set cones and supports for new points */ 452 ghostCell = cEnd; 453 for (fs = 0; fs < numFS; ++fs) { 454 IS faceIS; 455 const PetscInt *faces; 456 PetscInt numFaces, f; 457 458 ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr); 459 ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr); 460 ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr); 461 for (f = 0; f < numFaces; ++f, ++ghostCell) { 462 PetscInt newFace = faces[f] + *numGhostCells; 463 464 ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr); 465 ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr); 466 } 467 ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr); 468 ierr = ISDestroy(&faceIS);CHKERRQ(ierr); 469 } 470 ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 471 ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 472 /* Step 7: Stratify */ 473 ierr = DMPlexStratify(gdm);CHKERRQ(ierr); 474 ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 475 ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 476 ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr); 477 ierr = PetscFree(depthShift);CHKERRQ(ierr); 478 PetscFunctionReturn(0); 479 } 480 481 #undef __FUNCT__ 482 #define __FUNCT__ "DMPlexConstructGhostCells" 483 /*@C 484 DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face 485 486 Collective on dm 487 488 Input Parameters: 489 + dm - The original DM 490 - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL 491 492 Output Parameters: 493 + numGhostCells - The number of ghost cells added to the DM 494 - dmGhosted - The new DM 495 496 Note: If no label exists of that name, one will be created marking all boundary faces 497 498 Level: developer 499 500 .seealso: DMCreate() 501 */ 502 PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted) 503 { 504 DM gdm; 505 DMLabel label; 506 const char *name = labelName ? labelName : "Face Sets"; 507 PetscInt dim; 508 PetscErrorCode ierr; 509 510 PetscFunctionBegin; 511 PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 512 PetscValidPointer(numGhostCells, 3); 513 PetscValidPointer(dmGhosted, 4); 514 ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr); 515 ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr); 516 ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 517 ierr = DMPlexSetDimension(gdm, dim);CHKERRQ(ierr); 518 ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 519 if (!label) { 520 /* Get label for boundary faces */ 521 ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr); 522 ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 523 ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 524 } 525 ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr); 526 ierr = DMSetFromOptions(gdm);CHKERRQ(ierr); 527 *dmGhosted = gdm; 528 PetscFunctionReturn(0); 529 } 530 531 #undef __FUNCT__ 532 #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal" 533 /* 534 We are adding two kinds of points here: 535 Replicated: Copies of points which exist in the mesh, such as vertices identified across a fault 536 Hybrid: Entirely new points, such as cohesive cells 537 */ 538 static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm) 539 { 540 MPI_Comm comm; 541 IS valueIS; 542 PetscInt numSP = 0; /* The number of depths for which we have replicated points */ 543 const PetscInt *values; /* List of depths for which we have replicated points */ 544 IS *pointIS; 545 PetscInt *numSplitPoints; /* The number of replicated points at each depth */ 546 PetscInt *numHybridPoints; /* The number of hybrid points at each depth */ 547 const PetscInt **splitPoints; /* Replicated points for each depth */ 548 PetscSection coordSection; 549 Vec coordinates; 550 PetscScalar *coords; 551 PetscInt depths[4]; /* Depths in the order that plex points are numbered */ 552 PetscInt *depthShift; /* Number of replicated+hybrid points at each depth */ 553 PetscInt *depthOffset; /* Prefix sums of depthShift */ 554 PetscInt *pMaxNew; /* The first replicated point at each depth in the new mesh, hybrids come after this */ 555 PetscInt *coneNew, *coneONew, *supportNew; 556 PetscInt shift = 100, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, numLabels, vStart, vEnd, pEnd, p, v; 557 PetscErrorCode ierr; 558 559 PetscFunctionBegin; 560 ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 561 ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 562 ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 563 ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 564 depths[0] = depth; 565 depths[1] = 0; 566 depths[2] = depth-1; 567 depths[3] = 1; 568 /* Count split points and add cohesive cells */ 569 ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 570 ierr = PetscMalloc6(depth+1,PetscInt,&depthShift,depth+1,PetscInt,&depthOffset,depth+1,PetscInt,&pMaxNew,maxConeSize*3,PetscInt,&coneNew,maxConeSize*3,PetscInt,&coneONew,maxSupportSize,PetscInt,&supportNew);CHKERRQ(ierr); 571 ierr = PetscMalloc4(depth+1,IS,&pointIS,depth+1,PetscInt,&numSplitPoints,depth+1,PetscInt,&numHybridPoints,depth+1,const PetscInt*,&splitPoints);CHKERRQ(ierr); 572 ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 573 ierr = PetscMemzero(depthOffset, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr); 574 for (d = 0; d <= depth; ++d) { 575 ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr); 576 numSplitPoints[d] = 0; 577 numHybridPoints[d] = 0; 578 splitPoints[d] = NULL; 579 pointIS[d] = NULL; 580 } 581 if (label) { 582 ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 583 ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr); 584 ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 585 } 586 for (sp = 0; sp < numSP; ++sp) { 587 const PetscInt dep = values[sp]; 588 589 if ((dep < 0) || (dep > depth)) continue; 590 ierr = DMLabelGetStratumIS(label, dep, &pointIS[dep]);CHKERRQ(ierr); 591 if (pointIS[dep]) { 592 ierr = ISGetLocalSize(pointIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr); 593 ierr = ISGetIndices(pointIS[dep], &splitPoints[dep]);CHKERRQ(ierr); 594 } 595 } 596 /* Calculate number of hybrid points */ 597 for (d = 1; d <= depth; ++d) numHybridPoints[d] = numSplitPoints[d-1]; /* There is a hybrid cell/face/edge for every split face/edge/vertex */ 598 for (d = 0; d <= depth; ++d) depthShift[d] = numSplitPoints[d] + numHybridPoints[d]; 599 for (d = 1; d <= depth; ++d) depthOffset[depths[d]] = depthOffset[depths[d-1]] + depthShift[depths[d-1]]; 600 for (d = 0; d <= depth; ++d) pMaxNew[d] += depthOffset[d]; 601 ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 602 /* Step 3: Set cone/support sizes for new points */ 603 for (dep = 0; dep <= depth; ++dep) { 604 for (p = 0; p < numSplitPoints[dep]; ++p) { 605 const PetscInt oldp = splitPoints[dep][p]; 606 const PetscInt newp = oldp + depthOffset[dep]; 607 const PetscInt splitp = p + pMaxNew[dep]; 608 const PetscInt *support; 609 PetscInt coneSize, supportSize, qf, qn, qp, e; 610 611 ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 612 ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr); 613 ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 614 ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr); 615 if (dep == depth-1) { 616 const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 617 618 /* Add cohesive cells, they are prisms */ 619 ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr); 620 } else if (dep == 0) { 621 const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 622 623 ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 624 for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 625 PetscInt val; 626 627 ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 628 if (val == 1) ++qf; 629 if ((val == 1) || (val == (shift + 1))) ++qn; 630 if ((val == 1) || (val == -(shift + 1))) ++qp; 631 } 632 /* Split old vertex: Edges into original vertex and new cohesive edge */ 633 ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 634 /* Split new vertex: Edges into split vertex and new cohesive edge */ 635 ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 636 /* Add hybrid edge */ 637 ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr); 638 ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr); 639 } else if (dep == dim-2) { 640 const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 641 642 ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 643 for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) { 644 PetscInt val; 645 646 ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 647 if (val == dim-1) ++qf; 648 if ((val == dim-1) || (val == (shift + dim-1))) ++qn; 649 if ((val == dim-1) || (val == -(shift + dim-1))) ++qp; 650 } 651 /* Split old edge: Faces into original edge and cohesive face (positive side?) */ 652 ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr); 653 /* Split new edge: Faces into split edge and cohesive face (negative side?) */ 654 ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr); 655 /* Add hybrid face */ 656 ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr); 657 ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr); 658 } 659 } 660 } 661 /* Step 4: Setup split DM */ 662 ierr = DMSetUp(sdm);CHKERRQ(ierr); 663 ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 664 /* Step 6: Set cones and supports for new points */ 665 for (dep = 0; dep <= depth; ++dep) { 666 for (p = 0; p < numSplitPoints[dep]; ++p) { 667 const PetscInt oldp = splitPoints[dep][p]; 668 const PetscInt newp = oldp + depthOffset[dep]; 669 const PetscInt splitp = p + pMaxNew[dep]; 670 const PetscInt *cone, *support, *ornt; 671 PetscInt coneSize, supportSize, q, qf, qn, qp, v, e, s; 672 673 ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr); 674 ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr); 675 ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr); 676 ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr); 677 ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr); 678 if (dep == depth-1) { 679 const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 680 const PetscInt *supportF; 681 682 /* Split face: copy in old face to new face to start */ 683 ierr = DMPlexGetSupport(sdm, newp, &supportF);CHKERRQ(ierr); 684 ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr); 685 /* Split old face: old vertices/edges in cone so no change */ 686 /* Split new face: new vertices/edges in cone */ 687 for (q = 0; q < coneSize; ++q) { 688 ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 689 690 coneNew[2+q] = v + pMaxNew[dep-1]; 691 } 692 ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr); 693 ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr); 694 /* Face support */ 695 for (s = 0; s < supportSize; ++s) { 696 PetscInt val; 697 698 ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr); 699 if (val < 0) { 700 /* Split old face: Replace negative side cell with cohesive cell */ 701 ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr); 702 } else { 703 /* Split new face: Replace positive side cell with cohesive cell */ 704 ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr); 705 /* Get orientation for cohesive face */ 706 { 707 const PetscInt *ncone, *nconeO; 708 PetscInt nconeSize, nc; 709 710 ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr); 711 ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr); 712 ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr); 713 for (nc = 0; nc < nconeSize; ++nc) { 714 if (ncone[nc] == oldp) { 715 coneONew[0] = nconeO[nc]; 716 break; 717 } 718 } 719 if (nc >= nconeSize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate face %d in neighboring cell %d", oldp, support[s]); 720 } 721 } 722 } 723 /* Cohesive cell: Old and new split face, then new cohesive faces */ 724 coneNew[0] = newp; /* Extracted negative side orientation above */ 725 coneNew[1] = splitp; 726 coneONew[1] = coneONew[0]; 727 for (q = 0; q < coneSize; ++q) { 728 coneNew[2+q] += (pMaxNew[dep] - pMaxNew[dep-1]) + numSplitPoints[dep]; 729 coneONew[2+q] = 0; 730 } 731 ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr); 732 ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr); 733 } else if (dep == 0) { 734 const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 735 736 /* Split old vertex: Edges in old split faces and new cohesive edge */ 737 for (e = 0, qn = 0; e < supportSize; ++e) { 738 PetscInt val; 739 740 ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 741 if ((val == 1) || (val == (shift + 1))) { 742 supportNew[qn++] = support[e] + depthOffset[dep+1]; 743 } 744 } 745 supportNew[qn] = hybedge; 746 ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 747 /* Split new vertex: Edges in new split faces and new cohesive edge */ 748 for (e = 0, qp = 0; e < supportSize; ++e) { 749 PetscInt val, edge; 750 751 ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 752 if (val == 1) { 753 ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 754 if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 755 supportNew[qp++] = edge + pMaxNew[dep+1]; 756 } else if (val == -(shift + 1)) { 757 supportNew[qp++] = support[e] + depthOffset[dep+1]; 758 } 759 } 760 supportNew[qp] = hybedge; 761 ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 762 /* Hybrid edge: Old and new split vertex */ 763 coneNew[0] = newp; 764 coneNew[1] = splitp; 765 ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr); 766 for (e = 0, qf = 0; e < supportSize; ++e) { 767 PetscInt val, edge; 768 769 ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 770 if (val == 1) { 771 ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr); 772 if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]); 773 supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2]; 774 } 775 } 776 ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr); 777 } else if (dep == dim-2) { 778 const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 779 780 /* Split old edge: old vertices in cone so no change */ 781 /* Split new edge: new vertices in cone */ 782 for (q = 0; q < coneSize; ++q) { 783 ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr); 784 785 coneNew[q] = v + pMaxNew[dep-1]; 786 } 787 ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr); 788 /* Split old edge: Faces in positive side cells and old split faces */ 789 for (e = 0, q = 0; e < supportSize; ++e) { 790 PetscInt val; 791 792 ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 793 if (val == dim-1) { 794 supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 795 supportNew[q++] = support[e] + depthOffset[dep+1]; 796 } else if (val == (shift + dim-1)) { 797 supportNew[q++] = support[e] + depthOffset[dep+1]; 798 } 799 } 800 ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr); 801 /* Split new edge: Faces in negative side cells and new split faces */ 802 for (e = 0, q = 0; e < supportSize; ++e) { 803 PetscInt val, face; 804 805 ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 806 if (val == dim-1) { 807 supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 808 ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 809 if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 810 supportNew[q++] = face + pMaxNew[dep+1]; 811 } else if (val == -(shift + dim-1)) { 812 supportNew[q++] = support[e] + depthOffset[dep+1]; 813 } 814 } 815 ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr); 816 /* Hybrid face */ 817 coneNew[0] = newp; 818 coneNew[1] = splitp; 819 for (v = 0; v < coneSize; ++v) { 820 PetscInt vertex; 821 ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr); 822 if (vertex < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not a split vertex", support[e]); 823 coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep]; 824 } 825 ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr); 826 for (e = 0, qf = 0; e < supportSize; ++e) { 827 PetscInt val, face; 828 829 ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr); 830 if (val == dim-1) { 831 ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr); 832 if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]); 833 supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2]; 834 } 835 } 836 ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr); 837 } 838 } 839 } 840 /* Step 6b: Replace split points in negative side cones */ 841 for (sp = 0; sp < numSP; ++sp) { 842 PetscInt dep = values[sp]; 843 IS pIS; 844 PetscInt numPoints; 845 const PetscInt *points; 846 847 if (dep >= 0) continue; 848 ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr); 849 if (!pIS) continue; 850 dep = -dep - shift; 851 ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr); 852 ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr); 853 for (p = 0; p < numPoints; ++p) { 854 const PetscInt oldp = points[p]; 855 const PetscInt newp = depthOffset[dep] + oldp; 856 const PetscInt *cone; 857 PetscInt coneSize, c; 858 /* PetscBool replaced = PETSC_FALSE; */ 859 860 /* Negative edge: replace split vertex */ 861 /* Negative cell: replace split face */ 862 ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr); 863 ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr); 864 for (c = 0; c < coneSize; ++c) { 865 const PetscInt coldp = cone[c] - depthOffset[dep-1]; 866 PetscInt csplitp, cp, val; 867 868 ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr); 869 if (val == dep-1) { 870 ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr); 871 if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1); 872 csplitp = pMaxNew[dep-1] + cp; 873 ierr = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr); 874 /* replaced = PETSC_TRUE; */ 875 } 876 } 877 /* Cells with only a vertex or edge on the submesh have no replacement */ 878 /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */ 879 } 880 ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr); 881 ierr = ISDestroy(&pIS);CHKERRQ(ierr); 882 } 883 /* Step 7: Stratify */ 884 ierr = DMPlexStratify(sdm);CHKERRQ(ierr); 885 /* Step 8: Coordinates */ 886 ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 887 ierr = DMPlexGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr); 888 ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr); 889 ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 890 for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) { 891 const PetscInt newp = depthOffset[0] + splitPoints[0][v]; 892 const PetscInt splitp = pMaxNew[0] + v; 893 PetscInt dof, off, soff, d; 894 895 ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr); 896 ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr); 897 ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr); 898 for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d]; 899 } 900 ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 901 /* Step 9: SF, if I can figure this out we can split the mesh in parallel */ 902 ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 903 /* Step 10: Labels */ 904 ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr); 905 ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr); 906 for (dep = 0; dep <= depth; ++dep) { 907 for (p = 0; p < numSplitPoints[dep]; ++p) { 908 const PetscInt newp = depthOffset[dep] + splitPoints[dep][p]; 909 const PetscInt splitp = pMaxNew[dep] + p; 910 PetscInt l; 911 912 for (l = 0; l < numLabels; ++l) { 913 DMLabel mlabel; 914 const char *lname; 915 PetscInt val; 916 PetscBool isDepth; 917 918 ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr); 919 ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr); 920 if (isDepth) continue; 921 ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr); 922 ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr); 923 if (val >= 0) { 924 ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr); 925 #if 0 926 /* Do not put cohesive edges into the label */ 927 if (dep == 0) { 928 const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 929 ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr); 930 } else if (dep == dim-2) { 931 const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1]; 932 ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr); 933 } 934 /* Do not put cohesive faces into the label */ 935 #endif 936 } 937 } 938 } 939 } 940 for (sp = 0; sp < numSP; ++sp) { 941 const PetscInt dep = values[sp]; 942 943 if ((dep < 0) || (dep > depth)) continue; 944 if (pointIS[dep]) {ierr = ISRestoreIndices(pointIS[dep], &splitPoints[dep]);CHKERRQ(ierr);} 945 ierr = ISDestroy(&pointIS[dep]);CHKERRQ(ierr); 946 } 947 if (label) { 948 ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 949 ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 950 } 951 ierr = DMPlexGetChart(sdm, NULL, &pEnd);CHKERRQ(ierr); 952 if (depth > 0) pMaxNew[0] += depthShift[0]; /* Account for shadow vertices */ 953 if (depth > 1) pMaxNew[1] = pEnd - depthShift[0]; /* There is a hybrid edge for every shadow vertex */ 954 if (depth > 2) pMaxNew[2] = -1; /* There are no hybrid faces */ 955 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); 956 ierr = PetscFree6(depthShift, depthOffset, pMaxNew, coneNew, coneONew, supportNew);CHKERRQ(ierr); 957 ierr = PetscFree4(pointIS, numSplitPoints, numHybridPoints, splitPoints);CHKERRQ(ierr); 958 PetscFunctionReturn(0); 959 } 960 961 #undef __FUNCT__ 962 #define __FUNCT__ "DMPlexConstructCohesiveCells" 963 /*@C 964 DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface 965 966 Collective on dm 967 968 Input Parameters: 969 + dm - The original DM 970 - labelName - The label specifying the boundary faces (this could be auto-generated) 971 972 Output Parameters: 973 - dmSplit - The new DM 974 975 Level: developer 976 977 .seealso: DMCreate(), DMPlexLabelCohesiveComplete() 978 @*/ 979 PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit) 980 { 981 DM sdm; 982 PetscInt dim; 983 PetscErrorCode ierr; 984 985 PetscFunctionBegin; 986 PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 987 PetscValidPointer(dmSplit, 4); 988 ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr); 989 ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr); 990 ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 991 ierr = DMPlexSetDimension(sdm, dim);CHKERRQ(ierr); 992 switch (dim) { 993 case 2: 994 case 3: 995 ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr); 996 break; 997 default: 998 SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim); 999 } 1000 *dmSplit = sdm; 1001 PetscFunctionReturn(0); 1002 } 1003 1004 #undef __FUNCT__ 1005 #define __FUNCT__ "DMPlexLabelCohesiveComplete" 1006 /*@ 1007 DMPlexLabelCohesiveComplete - Starting with a label marking vertices on an internal surface, we add all other mesh pieces 1008 to complete the surface 1009 1010 Input Parameters: 1011 + dm - The DM 1012 . label - A DMLabel marking the surface vertices 1013 . flip - Flag to flip the submesh normal and replace points on the other side 1014 - subdm - The subDM associated with the label, or NULL 1015 1016 Output Parameter: 1017 . label - A DMLabel marking all surface points 1018 1019 Level: developer 1020 1021 .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete() 1022 @*/ 1023 PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, PetscBool flip, DM subdm) 1024 { 1025 DMLabel depthLabel; 1026 IS dimIS, subpointIS; 1027 const PetscInt *points, *subpoints; 1028 const PetscInt rev = flip ? -1 : 1; 1029 PetscInt shift = 100, dim, dep, cStart, cEnd, numPoints, numSubpoints, p, val; 1030 PetscErrorCode ierr; 1031 1032 PetscFunctionBegin; 1033 ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 1034 ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1035 if (subdm) { 1036 ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr); 1037 if (subpointIS) { 1038 ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr); 1039 ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr); 1040 } 1041 } 1042 /* Cell orientation for face gives the side of the fault */ 1043 ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr); 1044 if (!dimIS) PetscFunctionReturn(0); 1045 ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1046 ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1047 for (p = 0; p < numPoints; ++p) { 1048 const PetscInt *support; 1049 PetscInt supportSize, s; 1050 1051 ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr); 1052 if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize); 1053 ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr); 1054 for (s = 0; s < supportSize; ++s) { 1055 const PetscInt *cone, *ornt; 1056 PetscInt coneSize, c; 1057 PetscBool pos = PETSC_TRUE; 1058 1059 ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 1060 ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 1061 ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr); 1062 for (c = 0; c < coneSize; ++c) { 1063 if (cone[c] == points[p]) { 1064 PetscInt o = ornt[c]; 1065 1066 if (subdm) { 1067 const PetscInt *subcone, *subornt; 1068 PetscInt subpoint, subface, subconeSize, sc; 1069 1070 ierr = PetscFindInt(support[s], numSubpoints, subpoints, &subpoint);CHKERRQ(ierr); 1071 ierr = PetscFindInt(points[p], numSubpoints, subpoints, &subface);CHKERRQ(ierr); 1072 ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 1073 ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr); 1074 ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr); 1075 for (sc = 0; sc < subconeSize; ++sc) { 1076 if (subcone[sc] == subface) { 1077 o = subornt[0]; 1078 break; 1079 } 1080 } 1081 if (sc >= subconeSize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find point %d in cone for subpoint %d", points[p], subpoint); 1082 } 1083 if (o >= 0) { 1084 ierr = DMLabelSetValue(label, support[s], rev*(shift+dim));CHKERRQ(ierr); 1085 pos = rev > 0 ? PETSC_TRUE : PETSC_FALSE; 1086 } else { 1087 ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr); 1088 pos = rev > 0 ? PETSC_FALSE : PETSC_TRUE; 1089 } 1090 break; 1091 } 1092 } 1093 if (c == coneSize) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Cell split face %d support does not have it in the cone", points[p]); 1094 /* Put faces touching the fault in the label */ 1095 for (c = 0; c < coneSize; ++c) { 1096 const PetscInt point = cone[c]; 1097 1098 ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1099 if (val == -1) { 1100 PetscInt *closure = NULL; 1101 PetscInt closureSize, cl; 1102 1103 ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1104 for (cl = 0; cl < closureSize*2; cl += 2) { 1105 const PetscInt clp = closure[cl]; 1106 1107 ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr); 1108 if ((val >= 0) && (val < dim-1)) { 1109 ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr); 1110 break; 1111 } 1112 } 1113 ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1114 } 1115 } 1116 } 1117 } 1118 if (subdm) { 1119 if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);} 1120 ierr = ISDestroy(&subpointIS);CHKERRQ(ierr); 1121 } 1122 ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1123 ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1124 /* Search for other cells/faces/edges connected to the fault by a vertex */ 1125 ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 1126 ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr); 1127 if (!dimIS) PetscFunctionReturn(0); 1128 ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr); 1129 ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr); 1130 for (p = 0; p < numPoints; ++p) { 1131 PetscInt *star = NULL; 1132 PetscInt starSize, s; 1133 PetscInt again = 1; /* 0: Finished 1: Keep iterating after a change 2: No change */ 1134 1135 /* First mark cells connected to the fault */ 1136 ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1137 while (again) { 1138 if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault"); 1139 again = 0; 1140 for (s = 0; s < starSize*2; s += 2) { 1141 const PetscInt point = star[s]; 1142 const PetscInt *cone; 1143 PetscInt coneSize, c; 1144 1145 if ((point < cStart) || (point >= cEnd)) continue; 1146 ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1147 if (val != -1) continue; 1148 again = 2; 1149 ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 1150 ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 1151 for (c = 0; c < coneSize; ++c) { 1152 ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr); 1153 if (val != -1) { 1154 if (abs(val) < shift) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d on cell %d has an invalid label %d", cone[c], point, val); 1155 if (val > 0) { 1156 ierr = DMLabelSetValue(label, point, shift+dim);CHKERRQ(ierr); 1157 } else { 1158 ierr = DMLabelSetValue(label, point, -(shift+dim));CHKERRQ(ierr); 1159 } 1160 again = 1; 1161 break; 1162 } 1163 } 1164 } 1165 } 1166 /* Classify the rest by cell membership */ 1167 for (s = 0; s < starSize*2; s += 2) { 1168 const PetscInt point = star[s]; 1169 1170 ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr); 1171 if (val == -1) { 1172 PetscInt *sstar = NULL; 1173 PetscInt sstarSize, ss; 1174 PetscBool marked = PETSC_FALSE; 1175 1176 ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1177 for (ss = 0; ss < sstarSize*2; ss += 2) { 1178 const PetscInt spoint = sstar[ss]; 1179 1180 if ((spoint < cStart) || (spoint >= cEnd)) continue; 1181 ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr); 1182 if (val == -1) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d in star of %d does not have a valid label", spoint, point); 1183 ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr); 1184 if (val > 0) { 1185 ierr = DMLabelSetValue(label, point, shift+dep);CHKERRQ(ierr); 1186 } else { 1187 ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr); 1188 } 1189 marked = PETSC_TRUE; 1190 break; 1191 } 1192 ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr); 1193 if (!marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point); 1194 } 1195 } 1196 ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1197 } 1198 ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr); 1199 ierr = ISDestroy(&dimIS);CHKERRQ(ierr); 1200 PetscFunctionReturn(0); 1201 } 1202 1203 #undef __FUNCT__ 1204 #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated" 1205 /* Here we need the explicit assumption that: 1206 1207 For any marked cell, the marked vertices constitute a single face 1208 */ 1209 static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm) 1210 { 1211 IS subvertexIS = NULL; 1212 const PetscInt *subvertices; 1213 PetscInt *pStart, *pEnd, *pMax, pSize; 1214 PetscInt depth, dim, d, numSubVerticesInitial = 0, v; 1215 PetscErrorCode ierr; 1216 1217 PetscFunctionBegin; 1218 *numFaces = 0; 1219 *nFV = 0; 1220 ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1221 ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1222 pSize = PetscMax(depth, dim) + 1; 1223 ierr = PetscMalloc3(pSize,PetscInt,&pStart,pSize,PetscInt,&pEnd,pSize,PetscInt,&pMax);CHKERRQ(ierr); 1224 ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &pMax[depth] : NULL, depth>1 ? &pMax[depth-1] : NULL, depth>2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1225 for (d = 0; d <= depth; ++d) { 1226 ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1227 if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1228 } 1229 /* Loop over initial vertices and mark all faces in the collective star() */ 1230 if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);} 1231 if (subvertexIS) { 1232 ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1233 ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1234 } 1235 for (v = 0; v < numSubVerticesInitial; ++v) { 1236 const PetscInt vertex = subvertices[v]; 1237 PetscInt *star = NULL; 1238 PetscInt starSize, s, numCells = 0, c; 1239 1240 ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1241 for (s = 0; s < starSize*2; s += 2) { 1242 const PetscInt point = star[s]; 1243 if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point; 1244 } 1245 for (c = 0; c < numCells; ++c) { 1246 const PetscInt cell = star[c]; 1247 PetscInt *closure = NULL; 1248 PetscInt closureSize, cl; 1249 PetscInt cellLoc, numCorners = 0, faceSize = 0; 1250 1251 ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr); 1252 if (cellLoc == 2) continue; 1253 if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc); 1254 ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1255 for (cl = 0; cl < closureSize*2; cl += 2) { 1256 const PetscInt point = closure[cl]; 1257 PetscInt vertexLoc; 1258 1259 if ((point >= pStart[0]) && (point < pEnd[0])) { 1260 ++numCorners; 1261 ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1262 if (vertexLoc == value) closure[faceSize++] = point; 1263 } 1264 } 1265 if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);} 1266 if (faceSize > *nFV) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 1267 if (faceSize == *nFV) { 1268 const PetscInt *cells = NULL; 1269 PetscInt numCells, nc; 1270 1271 ++(*numFaces); 1272 for (cl = 0; cl < faceSize; ++cl) { 1273 ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr); 1274 } 1275 ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1276 for (nc = 0; nc < numCells; ++nc) { 1277 ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr); 1278 } 1279 ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr); 1280 } 1281 ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1282 } 1283 ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1284 } 1285 if (subvertexIS) { 1286 ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1287 } 1288 ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1289 ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1290 PetscFunctionReturn(0); 1291 } 1292 1293 #undef __FUNCT__ 1294 #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated" 1295 static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm) 1296 { 1297 IS subvertexIS; 1298 const PetscInt *subvertices; 1299 PetscInt *pStart, *pEnd, *pMax; 1300 PetscInt dim, d, numSubVerticesInitial = 0, v; 1301 PetscErrorCode ierr; 1302 1303 PetscFunctionBegin; 1304 ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1305 ierr = PetscMalloc3(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd,dim+1,PetscInt,&pMax);CHKERRQ(ierr); 1306 ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 1307 for (d = 0; d <= dim; ++d) { 1308 ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1309 if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]); 1310 } 1311 /* Loop over initial vertices and mark all faces in the collective star() */ 1312 ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr); 1313 if (subvertexIS) { 1314 ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr); 1315 ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1316 } 1317 for (v = 0; v < numSubVerticesInitial; ++v) { 1318 const PetscInt vertex = subvertices[v]; 1319 PetscInt *star = NULL; 1320 PetscInt starSize, s, numFaces = 0, f; 1321 1322 ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1323 for (s = 0; s < starSize*2; s += 2) { 1324 const PetscInt point = star[s]; 1325 if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point; 1326 } 1327 for (f = 0; f < numFaces; ++f) { 1328 const PetscInt face = star[f]; 1329 PetscInt *closure = NULL; 1330 PetscInt closureSize, c; 1331 PetscInt faceLoc; 1332 1333 ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr); 1334 if (faceLoc == dim-1) continue; 1335 if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc); 1336 ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1337 for (c = 0; c < closureSize*2; c += 2) { 1338 const PetscInt point = closure[c]; 1339 PetscInt vertexLoc; 1340 1341 if ((point >= pStart[0]) && (point < pEnd[0])) { 1342 ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr); 1343 if (vertexLoc != value) break; 1344 } 1345 } 1346 if (c == closureSize*2) { 1347 const PetscInt *support; 1348 PetscInt supportSize, s; 1349 1350 for (c = 0; c < closureSize*2; c += 2) { 1351 const PetscInt point = closure[c]; 1352 1353 for (d = 0; d < dim; ++d) { 1354 if ((point >= pStart[d]) && (point < pEnd[d])) { 1355 ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1356 break; 1357 } 1358 } 1359 } 1360 ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 1361 ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 1362 for (s = 0; s < supportSize; ++s) { 1363 ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1364 } 1365 } 1366 ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1367 } 1368 ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr); 1369 } 1370 if (subvertexIS) { 1371 ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr); 1372 } 1373 ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 1374 ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr); 1375 PetscFunctionReturn(0); 1376 } 1377 1378 #undef __FUNCT__ 1379 #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated" 1380 static PetscErrorCode DMPlexMarkCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char labelname[], PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, PetscInt *subCells[], DM subdm) 1381 { 1382 DMLabel label = NULL; 1383 const PetscInt *cone; 1384 PetscInt dim, cMax, cEnd, c, subc = 0, p, coneSize; 1385 PetscErrorCode ierr; 1386 1387 PetscFunctionBegin; 1388 *numFaces = 0; 1389 *nFV = 0; 1390 if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1391 *subCells = NULL; 1392 ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1393 ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1394 ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1395 if (cMax < 0) PetscFunctionReturn(0); 1396 if (label) { 1397 for (c = cMax; c < cEnd; ++c) { 1398 PetscInt val; 1399 1400 ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 1401 if (val == value) { 1402 ++(*numFaces); 1403 ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 1404 } 1405 } 1406 } else { 1407 *numFaces = cEnd - cMax; 1408 ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr); 1409 } 1410 *nFV = hasLagrange ? coneSize/3 : coneSize/2; 1411 ierr = PetscMalloc(*numFaces *2 * sizeof(PetscInt), subCells);CHKERRQ(ierr); 1412 for (c = cMax; c < cEnd; ++c) { 1413 const PetscInt *cells; 1414 PetscInt numCells; 1415 1416 if (label) { 1417 PetscInt val; 1418 1419 ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 1420 if (val != value) continue; 1421 } 1422 ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1423 for (p = 0; p < *nFV; ++p) { 1424 ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr); 1425 } 1426 /* Negative face */ 1427 ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 1428 /* Not true in parallel 1429 if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 1430 for (p = 0; p < numCells; ++p) { 1431 ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr); 1432 (*subCells)[subc++] = cells[p]; 1433 } 1434 ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr); 1435 /* Positive face is not included */ 1436 } 1437 PetscFunctionReturn(0); 1438 } 1439 1440 #undef __FUNCT__ 1441 #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated" 1442 static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, PetscBool hasLagrange, const char labelname[], PetscInt value, DMLabel subpointMap, DM subdm) 1443 { 1444 DMLabel label = NULL; 1445 PetscInt *pStart, *pEnd; 1446 PetscInt dim, cMax, cEnd, c, d; 1447 PetscErrorCode ierr; 1448 1449 PetscFunctionBegin; 1450 if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);} 1451 ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 1452 ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr); 1453 ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 1454 if (cMax < 0) PetscFunctionReturn(0); 1455 ierr = PetscMalloc2(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd);CHKERRQ(ierr); 1456 for (d = 0; d <= dim; ++d) { 1457 ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr); 1458 } 1459 for (c = cMax; c < cEnd; ++c) { 1460 const PetscInt *cone; 1461 PetscInt *closure = NULL; 1462 PetscInt coneSize, closureSize, cl; 1463 1464 if (label) { 1465 PetscInt val; 1466 1467 ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr); 1468 if (val != value) continue; 1469 } 1470 ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 1471 if (hasLagrange) { 1472 if (coneSize != 3) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 1473 } else { 1474 if (coneSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); 1475 } 1476 /* Negative face */ 1477 ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 1478 ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1479 for (cl = 0; cl < closureSize*2; cl += 2) { 1480 const PetscInt point = closure[cl]; 1481 1482 for (d = 0; d <= dim; ++d) { 1483 if ((point >= pStart[d]) && (point < pEnd[d])) { 1484 ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr); 1485 break; 1486 } 1487 } 1488 } 1489 ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 1490 /* Cells -- positive face is not included */ 1491 for (cl = 0; cl < 1; ++cl) { 1492 const PetscInt *support; 1493 PetscInt supportSize, s; 1494 1495 ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr); 1496 if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); 1497 ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr); 1498 for (s = 0; s < supportSize; ++s) { 1499 ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr); 1500 } 1501 } 1502 } 1503 ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr); 1504 PetscFunctionReturn(0); 1505 } 1506 1507 #undef __FUNCT__ 1508 #define __FUNCT__ "DMPlexGetFaceOrientation" 1509 PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 1510 { 1511 MPI_Comm comm; 1512 PetscBool posOrient = PETSC_FALSE; 1513 const PetscInt debug = 0; 1514 PetscInt cellDim, faceSize, f; 1515 PetscErrorCode ierr; 1516 1517 PetscFunctionBegin; 1518 ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1519 ierr = DMPlexGetDimension(dm, &cellDim);CHKERRQ(ierr); 1520 if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);} 1521 1522 if (cellDim == 1 && numCorners == 2) { 1523 /* Triangle */ 1524 faceSize = numCorners-1; 1525 posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1526 } else if (cellDim == 2 && numCorners == 3) { 1527 /* Triangle */ 1528 faceSize = numCorners-1; 1529 posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1530 } else if (cellDim == 3 && numCorners == 4) { 1531 /* Tetrahedron */ 1532 faceSize = numCorners-1; 1533 posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE; 1534 } else if (cellDim == 1 && numCorners == 3) { 1535 /* Quadratic line */ 1536 faceSize = 1; 1537 posOrient = PETSC_TRUE; 1538 } else if (cellDim == 2 && numCorners == 4) { 1539 /* Quads */ 1540 faceSize = 2; 1541 if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) { 1542 posOrient = PETSC_TRUE; 1543 } else if ((indices[0] == 3) && (indices[1] == 0)) { 1544 posOrient = PETSC_TRUE; 1545 } else { 1546 if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) { 1547 posOrient = PETSC_FALSE; 1548 } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge"); 1549 } 1550 } else if (cellDim == 2 && numCorners == 6) { 1551 /* Quadratic triangle (I hate this) */ 1552 /* Edges are determined by the first 2 vertices (corners of edges) */ 1553 const PetscInt faceSizeTri = 3; 1554 PetscInt sortedIndices[3], i, iFace; 1555 PetscBool found = PETSC_FALSE; 1556 PetscInt faceVerticesTriSorted[9] = { 1557 0, 3, 4, /* bottom */ 1558 1, 4, 5, /* right */ 1559 2, 3, 5, /* left */ 1560 }; 1561 PetscInt faceVerticesTri[9] = { 1562 0, 3, 4, /* bottom */ 1563 1, 4, 5, /* right */ 1564 2, 5, 3, /* left */ 1565 }; 1566 1567 faceSize = faceSizeTri; 1568 for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i]; 1569 ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr); 1570 for (iFace = 0; iFace < 3; ++iFace) { 1571 const PetscInt ii = iFace*faceSizeTri; 1572 PetscInt fVertex, cVertex; 1573 1574 if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) && 1575 (sortedIndices[1] == faceVerticesTriSorted[ii+1])) { 1576 for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) { 1577 for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) { 1578 if (indices[cVertex] == faceVerticesTri[ii+fVertex]) { 1579 faceVertices[fVertex] = origVertices[cVertex]; 1580 break; 1581 } 1582 } 1583 } 1584 found = PETSC_TRUE; 1585 break; 1586 } 1587 } 1588 if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface"); 1589 if (posOriented) *posOriented = PETSC_TRUE; 1590 PetscFunctionReturn(0); 1591 } else if (cellDim == 2 && numCorners == 9) { 1592 /* Quadratic quad (I hate this) */ 1593 /* Edges are determined by the first 2 vertices (corners of edges) */ 1594 const PetscInt faceSizeQuad = 3; 1595 PetscInt sortedIndices[3], i, iFace; 1596 PetscBool found = PETSC_FALSE; 1597 PetscInt faceVerticesQuadSorted[12] = { 1598 0, 1, 4, /* bottom */ 1599 1, 2, 5, /* right */ 1600 2, 3, 6, /* top */ 1601 0, 3, 7, /* left */ 1602 }; 1603 PetscInt faceVerticesQuad[12] = { 1604 0, 1, 4, /* bottom */ 1605 1, 2, 5, /* right */ 1606 2, 3, 6, /* top */ 1607 3, 0, 7, /* left */ 1608 }; 1609 1610 faceSize = faceSizeQuad; 1611 for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i]; 1612 ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr); 1613 for (iFace = 0; iFace < 4; ++iFace) { 1614 const PetscInt ii = iFace*faceSizeQuad; 1615 PetscInt fVertex, cVertex; 1616 1617 if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) && 1618 (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) { 1619 for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) { 1620 for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) { 1621 if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) { 1622 faceVertices[fVertex] = origVertices[cVertex]; 1623 break; 1624 } 1625 } 1626 } 1627 found = PETSC_TRUE; 1628 break; 1629 } 1630 } 1631 if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface"); 1632 if (posOriented) *posOriented = PETSC_TRUE; 1633 PetscFunctionReturn(0); 1634 } else if (cellDim == 3 && numCorners == 8) { 1635 /* Hexes 1636 A hex is two oriented quads with the normal of the first 1637 pointing up at the second. 1638 1639 7---6 1640 /| /| 1641 4---5 | 1642 | 1-|-2 1643 |/ |/ 1644 0---3 1645 1646 Faces are determined by the first 4 vertices (corners of faces) */ 1647 const PetscInt faceSizeHex = 4; 1648 PetscInt sortedIndices[4], i, iFace; 1649 PetscBool found = PETSC_FALSE; 1650 PetscInt faceVerticesHexSorted[24] = { 1651 0, 1, 2, 3, /* bottom */ 1652 4, 5, 6, 7, /* top */ 1653 0, 3, 4, 5, /* front */ 1654 2, 3, 5, 6, /* right */ 1655 1, 2, 6, 7, /* back */ 1656 0, 1, 4, 7, /* left */ 1657 }; 1658 PetscInt faceVerticesHex[24] = { 1659 1, 2, 3, 0, /* bottom */ 1660 4, 5, 6, 7, /* top */ 1661 0, 3, 5, 4, /* front */ 1662 3, 2, 6, 5, /* right */ 1663 2, 1, 7, 6, /* back */ 1664 1, 0, 4, 7, /* left */ 1665 }; 1666 1667 faceSize = faceSizeHex; 1668 for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i]; 1669 ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr); 1670 for (iFace = 0; iFace < 6; ++iFace) { 1671 const PetscInt ii = iFace*faceSizeHex; 1672 PetscInt fVertex, cVertex; 1673 1674 if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) && 1675 (sortedIndices[1] == faceVerticesHexSorted[ii+1]) && 1676 (sortedIndices[2] == faceVerticesHexSorted[ii+2]) && 1677 (sortedIndices[3] == faceVerticesHexSorted[ii+3])) { 1678 for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) { 1679 for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) { 1680 if (indices[cVertex] == faceVerticesHex[ii+fVertex]) { 1681 faceVertices[fVertex] = origVertices[cVertex]; 1682 break; 1683 } 1684 } 1685 } 1686 found = PETSC_TRUE; 1687 break; 1688 } 1689 } 1690 if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 1691 if (posOriented) *posOriented = PETSC_TRUE; 1692 PetscFunctionReturn(0); 1693 } else if (cellDim == 3 && numCorners == 10) { 1694 /* Quadratic tet */ 1695 /* Faces are determined by the first 3 vertices (corners of faces) */ 1696 const PetscInt faceSizeTet = 6; 1697 PetscInt sortedIndices[6], i, iFace; 1698 PetscBool found = PETSC_FALSE; 1699 PetscInt faceVerticesTetSorted[24] = { 1700 0, 1, 2, 6, 7, 8, /* bottom */ 1701 0, 3, 4, 6, 7, 9, /* front */ 1702 1, 4, 5, 7, 8, 9, /* right */ 1703 2, 3, 5, 6, 8, 9, /* left */ 1704 }; 1705 PetscInt faceVerticesTet[24] = { 1706 0, 1, 2, 6, 7, 8, /* bottom */ 1707 0, 4, 3, 6, 7, 9, /* front */ 1708 1, 5, 4, 7, 8, 9, /* right */ 1709 2, 3, 5, 8, 6, 9, /* left */ 1710 }; 1711 1712 faceSize = faceSizeTet; 1713 for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i]; 1714 ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr); 1715 for (iFace=0; iFace < 4; ++iFace) { 1716 const PetscInt ii = iFace*faceSizeTet; 1717 PetscInt fVertex, cVertex; 1718 1719 if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) && 1720 (sortedIndices[1] == faceVerticesTetSorted[ii+1]) && 1721 (sortedIndices[2] == faceVerticesTetSorted[ii+2]) && 1722 (sortedIndices[3] == faceVerticesTetSorted[ii+3])) { 1723 for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) { 1724 for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) { 1725 if (indices[cVertex] == faceVerticesTet[ii+fVertex]) { 1726 faceVertices[fVertex] = origVertices[cVertex]; 1727 break; 1728 } 1729 } 1730 } 1731 found = PETSC_TRUE; 1732 break; 1733 } 1734 } 1735 if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface"); 1736 if (posOriented) *posOriented = PETSC_TRUE; 1737 PetscFunctionReturn(0); 1738 } else if (cellDim == 3 && numCorners == 27) { 1739 /* Quadratic hexes (I hate this) 1740 A hex is two oriented quads with the normal of the first 1741 pointing up at the second. 1742 1743 7---6 1744 /| /| 1745 4---5 | 1746 | 3-|-2 1747 |/ |/ 1748 0---1 1749 1750 Faces are determined by the first 4 vertices (corners of faces) */ 1751 const PetscInt faceSizeQuadHex = 9; 1752 PetscInt sortedIndices[9], i, iFace; 1753 PetscBool found = PETSC_FALSE; 1754 PetscInt faceVerticesQuadHexSorted[54] = { 1755 0, 1, 2, 3, 8, 9, 10, 11, 24, /* bottom */ 1756 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 1757 0, 1, 4, 5, 8, 12, 16, 17, 22, /* front */ 1758 1, 2, 5, 6, 9, 13, 17, 18, 21, /* right */ 1759 2, 3, 6, 7, 10, 14, 18, 19, 23, /* back */ 1760 0, 3, 4, 7, 11, 15, 16, 19, 20, /* left */ 1761 }; 1762 PetscInt faceVerticesQuadHex[54] = { 1763 3, 2, 1, 0, 10, 9, 8, 11, 24, /* bottom */ 1764 4, 5, 6, 7, 12, 13, 14, 15, 25, /* top */ 1765 0, 1, 5, 4, 8, 17, 12, 16, 22, /* front */ 1766 1, 2, 6, 5, 9, 18, 13, 17, 21, /* right */ 1767 2, 3, 7, 6, 10, 19, 14, 18, 23, /* back */ 1768 3, 0, 4, 7, 11, 16, 15, 19, 20 /* left */ 1769 }; 1770 1771 faceSize = faceSizeQuadHex; 1772 for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i]; 1773 ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr); 1774 for (iFace = 0; iFace < 6; ++iFace) { 1775 const PetscInt ii = iFace*faceSizeQuadHex; 1776 PetscInt fVertex, cVertex; 1777 1778 if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) && 1779 (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) && 1780 (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) && 1781 (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) { 1782 for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) { 1783 for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) { 1784 if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) { 1785 faceVertices[fVertex] = origVertices[cVertex]; 1786 break; 1787 } 1788 } 1789 } 1790 found = PETSC_TRUE; 1791 break; 1792 } 1793 } 1794 if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface"); 1795 if (posOriented) *posOriented = PETSC_TRUE; 1796 PetscFunctionReturn(0); 1797 } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation()."); 1798 if (!posOrient) { 1799 if (debug) {ierr = PetscPrintf(comm, " Reversing initial face orientation\n");CHKERRQ(ierr);} 1800 for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f]; 1801 } else { 1802 if (debug) {ierr = PetscPrintf(comm, " Keeping initial face orientation\n");CHKERRQ(ierr);} 1803 for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f]; 1804 } 1805 if (posOriented) *posOriented = posOrient; 1806 PetscFunctionReturn(0); 1807 } 1808 1809 #undef __FUNCT__ 1810 #define __FUNCT__ "DMPlexGetOrientedFace" 1811 /* 1812 Given a cell and a face, as a set of vertices, 1813 return the oriented face, as a set of vertices, in faceVertices 1814 The orientation is such that the face normal points out of the cell 1815 */ 1816 PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented) 1817 { 1818 const PetscInt *cone = NULL; 1819 PetscInt coneSize, v, f, v2; 1820 PetscInt oppositeVertex = -1; 1821 PetscErrorCode ierr; 1822 1823 PetscFunctionBegin; 1824 ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 1825 ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 1826 for (v = 0, v2 = 0; v < coneSize; ++v) { 1827 PetscBool found = PETSC_FALSE; 1828 1829 for (f = 0; f < faceSize; ++f) { 1830 if (face[f] == cone[v]) { 1831 found = PETSC_TRUE; break; 1832 } 1833 } 1834 if (found) { 1835 indices[v2] = v; 1836 origVertices[v2] = cone[v]; 1837 ++v2; 1838 } else { 1839 oppositeVertex = v; 1840 } 1841 } 1842 ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr); 1843 PetscFunctionReturn(0); 1844 } 1845 1846 #undef __FUNCT__ 1847 #define __FUNCT__ "DMPlexInsertFace_Internal" 1848 /* 1849 DMPlexInsertFace_Internal - Puts a face into the mesh 1850 1851 Not collective 1852 1853 Input Parameters: 1854 + dm - The DMPlex 1855 . numFaceVertex - The number of vertices in the face 1856 . faceVertices - The vertices in the face for dm 1857 . subfaceVertices - The vertices in the face for subdm 1858 . numCorners - The number of vertices in the cell 1859 . cell - A cell in dm containing the face 1860 . subcell - A cell in subdm containing the face 1861 . firstFace - First face in the mesh 1862 - newFacePoint - Next face in the mesh 1863 1864 Output Parameters: 1865 . newFacePoint - Contains next face point number on input, updated on output 1866 1867 Level: developer 1868 */ 1869 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) 1870 { 1871 MPI_Comm comm; 1872 DM_Plex *submesh = (DM_Plex*) subdm->data; 1873 const PetscInt *faces; 1874 PetscInt numFaces, coneSize; 1875 PetscErrorCode ierr; 1876 1877 PetscFunctionBegin; 1878 ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1879 ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr); 1880 if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize); 1881 #if 0 1882 /* Cannot use this because support() has not been constructed yet */ 1883 ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 1884 #else 1885 { 1886 PetscInt f; 1887 1888 numFaces = 0; 1889 ierr = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 1890 for (f = firstFace; f < *newFacePoint; ++f) { 1891 PetscInt dof, off, d; 1892 1893 ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr); 1894 ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr); 1895 /* Yes, I know this is quadratic, but I expect the sizes to be <5 */ 1896 for (d = 0; d < dof; ++d) { 1897 const PetscInt p = submesh->cones[off+d]; 1898 PetscInt v; 1899 1900 for (v = 0; v < numFaceVertices; ++v) { 1901 if (subfaceVertices[v] == p) break; 1902 } 1903 if (v == numFaceVertices) break; 1904 } 1905 if (d == dof) { 1906 numFaces = 1; 1907 ((PetscInt*) faces)[0] = f; 1908 } 1909 } 1910 } 1911 #endif 1912 if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces); 1913 else if (numFaces == 1) { 1914 /* Add the other cell neighbor for this face */ 1915 ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr); 1916 } else { 1917 PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov; 1918 PetscBool posOriented; 1919 1920 ierr = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 1921 origVertices = &orientedVertices[numFaceVertices]; 1922 indices = &orientedVertices[numFaceVertices*2]; 1923 orientedSubVertices = &orientedVertices[numFaceVertices*3]; 1924 ierr = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr); 1925 /* TODO: I know that routine should return a permutation, not the indices */ 1926 for (v = 0; v < numFaceVertices; ++v) { 1927 const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v]; 1928 for (ov = 0; ov < numFaceVertices; ++ov) { 1929 if (orientedVertices[ov] == vertex) { 1930 orientedSubVertices[ov] = subvertex; 1931 break; 1932 } 1933 } 1934 if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex); 1935 } 1936 ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr); 1937 ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr); 1938 ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr); 1939 ++(*newFacePoint); 1940 } 1941 #if 0 1942 ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr); 1943 #else 1944 ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr); 1945 #endif 1946 PetscFunctionReturn(0); 1947 } 1948 1949 #undef __FUNCT__ 1950 #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated" 1951 static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, const char vertexLabelName[], PetscInt value, DM subdm) 1952 { 1953 MPI_Comm comm; 1954 DMLabel vertexLabel, subpointMap; 1955 IS subvertexIS, subcellIS; 1956 const PetscInt *subVertices, *subCells; 1957 PetscInt numSubVertices, firstSubVertex, numSubCells; 1958 PetscInt *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0; 1959 PetscInt vStart, vEnd, c, f; 1960 PetscErrorCode ierr; 1961 1962 PetscFunctionBegin; 1963 ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1964 /* Create subpointMap which marks the submesh */ 1965 ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 1966 ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 1967 ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 1968 if (vertexLabelName) { 1969 ierr = DMPlexGetLabel(dm, vertexLabelName, &vertexLabel);CHKERRQ(ierr); 1970 ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr); 1971 } 1972 /* Setup chart */ 1973 ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 1974 ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 1975 ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 1976 ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 1977 /* Set cone sizes */ 1978 firstSubVertex = numSubCells; 1979 firstSubFace = numSubCells+numSubVertices; 1980 newFacePoint = firstSubFace; 1981 ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 1982 if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 1983 ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr); 1984 if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);} 1985 for (c = 0; c < numSubCells; ++c) { 1986 ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 1987 } 1988 for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 1989 ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 1990 } 1991 ierr = DMSetUp(subdm);CHKERRQ(ierr); 1992 /* Create face cones */ 1993 ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 1994 ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 1995 ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 1996 for (c = 0; c < numSubCells; ++c) { 1997 const PetscInt cell = subCells[c]; 1998 const PetscInt subcell = c; 1999 PetscInt *closure = NULL; 2000 PetscInt closureSize, cl, numCorners = 0, faceSize = 0; 2001 2002 ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2003 for (cl = 0; cl < closureSize*2; cl += 2) { 2004 const PetscInt point = closure[cl]; 2005 PetscInt subVertex; 2006 2007 if ((point >= vStart) && (point < vEnd)) { 2008 ++numCorners; 2009 ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 2010 if (subVertex >= 0) { 2011 closure[faceSize] = point; 2012 subface[faceSize] = firstSubVertex+subVertex; 2013 ++faceSize; 2014 } 2015 } 2016 } 2017 if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize); 2018 if (faceSize == nFV) { 2019 ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr); 2020 } 2021 ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2022 } 2023 ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2024 ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2025 ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2026 /* Build coordinates */ 2027 { 2028 PetscSection coordSection, subCoordSection; 2029 Vec coordinates, subCoordinates; 2030 PetscScalar *coords, *subCoords; 2031 PetscInt numComp, coordSize, v; 2032 2033 ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2034 ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2035 ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2036 ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2037 ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2038 ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2039 ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2040 for (v = 0; v < numSubVertices; ++v) { 2041 const PetscInt vertex = subVertices[v]; 2042 const PetscInt subvertex = firstSubVertex+v; 2043 PetscInt dof; 2044 2045 ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2046 ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2047 ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2048 } 2049 ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2050 ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2051 ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2052 ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2053 ierr = VecSetType(subCoordinates,dm->vectype);CHKERRQ(ierr); 2054 if (coordSize) { 2055 ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2056 ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2057 for (v = 0; v < numSubVertices; ++v) { 2058 const PetscInt vertex = subVertices[v]; 2059 const PetscInt subvertex = firstSubVertex+v; 2060 PetscInt dof, off, sdof, soff, d; 2061 2062 ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2063 ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2064 ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2065 ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2066 if (dof != sdof) SETERRQ4(comm, PETSC_ERR_PLIB, "Coordinate dimension %d on subvertex %d, vertex %d should be %d", sdof, subvertex, vertex, dof); 2067 for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2068 } 2069 ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2070 ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2071 } 2072 ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2073 ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2074 } 2075 /* Cleanup */ 2076 if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2077 ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2078 if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);} 2079 ierr = ISDestroy(&subcellIS);CHKERRQ(ierr); 2080 PetscFunctionReturn(0); 2081 } 2082 2083 #undef __FUNCT__ 2084 #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated" 2085 static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, const char vertexLabelName[], PetscInt value, DM subdm) 2086 { 2087 MPI_Comm comm; 2088 DMLabel subpointMap, vertexLabel; 2089 IS *subpointIS; 2090 const PetscInt **subpoints; 2091 PetscInt *numSubPoints, *firstSubPoint, *coneNew, *coneONew; 2092 PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2093 PetscErrorCode ierr; 2094 2095 PetscFunctionBegin; 2096 ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2097 /* Create subpointMap which marks the submesh */ 2098 ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2099 ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2100 ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 2101 if (vertexLabelName) { 2102 ierr = DMPlexGetLabel(dm, vertexLabelName, &vertexLabel);CHKERRQ(ierr); 2103 ierr = DMPlexMarkSubmesh_Interpolated(dm, vertexLabel, value, subpointMap, subdm);CHKERRQ(ierr); 2104 } 2105 /* Setup chart */ 2106 ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2107 ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr); 2108 for (d = 0; d <= dim; ++d) { 2109 ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2110 totSubPoints += numSubPoints[d]; 2111 } 2112 ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2113 ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2114 /* Set cone sizes */ 2115 firstSubPoint[dim] = 0; 2116 firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2117 if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2118 if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2119 for (d = 0; d <= dim; ++d) { 2120 ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2121 ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2122 } 2123 for (d = 0; d <= dim; ++d) { 2124 for (p = 0; p < numSubPoints[d]; ++p) { 2125 const PetscInt point = subpoints[d][p]; 2126 const PetscInt subpoint = firstSubPoint[d] + p; 2127 const PetscInt *cone; 2128 PetscInt coneSize, coneSizeNew, c, val; 2129 2130 ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2131 ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2132 if (d == dim) { 2133 ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2134 for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2135 ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2136 if (val >= 0) coneSizeNew++; 2137 } 2138 ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2139 } 2140 } 2141 } 2142 ierr = DMSetUp(subdm);CHKERRQ(ierr); 2143 /* Set cones */ 2144 ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2145 ierr = PetscMalloc2(maxConeSize,PetscInt,&coneNew,maxConeSize,PetscInt,&coneONew);CHKERRQ(ierr); 2146 for (d = 0; d <= dim; ++d) { 2147 for (p = 0; p < numSubPoints[d]; ++p) { 2148 const PetscInt point = subpoints[d][p]; 2149 const PetscInt subpoint = firstSubPoint[d] + p; 2150 const PetscInt *cone, *ornt; 2151 PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2152 2153 ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2154 ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2155 ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2156 ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr); 2157 for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2158 ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 2159 if (subc >= 0) { 2160 coneNew[coneSizeNew] = firstSubPoint[d-1] + subc; 2161 coneONew[coneSizeNew] = ornt[c]; 2162 ++coneSizeNew; 2163 } 2164 } 2165 if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2166 ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 2167 ierr = DMPlexSetConeOrientation(subdm, subpoint, coneONew);CHKERRQ(ierr); 2168 } 2169 } 2170 ierr = PetscFree2(coneNew,coneONew);CHKERRQ(ierr); 2171 ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2172 ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2173 /* Build coordinates */ 2174 { 2175 PetscSection coordSection, subCoordSection; 2176 Vec coordinates, subCoordinates; 2177 PetscScalar *coords, *subCoords; 2178 PetscInt numComp, coordSize; 2179 2180 ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2181 ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2182 ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2183 ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2184 ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2185 ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2186 ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2187 for (v = 0; v < numSubPoints[0]; ++v) { 2188 const PetscInt vertex = subpoints[0][v]; 2189 const PetscInt subvertex = firstSubPoint[0]+v; 2190 PetscInt dof; 2191 2192 ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2193 ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2194 ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2195 } 2196 ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2197 ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2198 ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2199 ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2200 ierr = VecSetType(subCoordinates,dm->vectype);CHKERRQ(ierr); 2201 ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2202 ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2203 for (v = 0; v < numSubPoints[0]; ++v) { 2204 const PetscInt vertex = subpoints[0][v]; 2205 const PetscInt subvertex = firstSubPoint[0]+v; 2206 PetscInt dof, off, sdof, soff, d; 2207 2208 ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2209 ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2210 ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2211 ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2212 if (dof != sdof) SETERRQ4(comm, PETSC_ERR_PLIB, "Coordinate dimension %d on subvertex %d, vertex %d should be %d", sdof, subvertex, vertex, dof); 2213 for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2214 } 2215 ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2216 ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2217 ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2218 ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2219 } 2220 /* Cleanup */ 2221 for (d = 0; d <= dim; ++d) { 2222 ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2223 ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2224 } 2225 ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2226 PetscFunctionReturn(0); 2227 } 2228 2229 #undef __FUNCT__ 2230 #define __FUNCT__ "DMPlexCreateSubmesh" 2231 /*@C 2232 DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label 2233 2234 Input Parameters: 2235 + dm - The original mesh 2236 . vertexLabel - The DMLabel marking vertices contained in the surface 2237 - value - The label value to use 2238 2239 Output Parameter: 2240 . subdm - The surface mesh 2241 2242 Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2243 2244 Level: developer 2245 2246 .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue() 2247 @*/ 2248 PetscErrorCode DMPlexCreateSubmesh(DM dm, const char vertexLabel[], PetscInt value, DM *subdm) 2249 { 2250 PetscInt dim, depth; 2251 PetscErrorCode ierr; 2252 2253 PetscFunctionBegin; 2254 PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2255 PetscValidPointer(subdm, 3); 2256 ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2257 ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2258 ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2259 ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2260 ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2261 if (depth == dim) { 2262 ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2263 } else { 2264 ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr); 2265 } 2266 PetscFunctionReturn(0); 2267 } 2268 2269 #undef __FUNCT__ 2270 #define __FUNCT__ "DMPlexFilterPoint_Internal" 2271 PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[]) 2272 { 2273 PetscInt subPoint; 2274 PetscErrorCode ierr; 2275 2276 ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr; 2277 return subPoint < 0 ? subPoint : firstSubPoint+subPoint; 2278 } 2279 2280 #undef __FUNCT__ 2281 #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated" 2282 static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 2283 { 2284 MPI_Comm comm; 2285 DMLabel subpointMap; 2286 IS subvertexIS; 2287 const PetscInt *subVertices; 2288 PetscInt numSubVertices, firstSubVertex, numSubCells, *subCells = NULL; 2289 PetscInt *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV; 2290 PetscInt cMax, c, f; 2291 PetscErrorCode ierr; 2292 2293 PetscFunctionBegin; 2294 ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 2295 /* Create subpointMap which marks the submesh */ 2296 ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2297 ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2298 ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 2299 ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr); 2300 /* Setup chart */ 2301 ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr); 2302 ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr); 2303 ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr); 2304 ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2305 /* Set cone sizes */ 2306 firstSubVertex = numSubCells; 2307 firstSubFace = numSubCells+numSubVertices; 2308 newFacePoint = firstSubFace; 2309 ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr); 2310 if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2311 for (c = 0; c < numSubCells; ++c) { 2312 ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr); 2313 } 2314 for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) { 2315 ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr); 2316 } 2317 ierr = DMSetUp(subdm);CHKERRQ(ierr); 2318 /* Create face cones */ 2319 ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2320 ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 2321 ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2322 for (c = 0; c < numSubCells; ++c) { 2323 const PetscInt cell = subCells[c]; 2324 const PetscInt subcell = c; 2325 const PetscInt *cone, *cells; 2326 PetscInt numCells, subVertex, p, v; 2327 2328 if (cell < cMax) continue; 2329 ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 2330 for (v = 0; v < nFV; ++v) { 2331 ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr); 2332 subface[v] = firstSubVertex+subVertex; 2333 } 2334 ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr); 2335 ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr); 2336 ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 2337 /* Not true in parallel 2338 if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */ 2339 for (p = 0; p < numCells; ++p) { 2340 PetscInt negsubcell; 2341 2342 if (cells[p] >= cMax) continue; 2343 /* I know this is a crap search */ 2344 for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) { 2345 if (subCells[negsubcell] == cells[p]) break; 2346 } 2347 if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell); 2348 ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr); 2349 } 2350 ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr); 2351 ++newFacePoint; 2352 } 2353 ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr); 2354 ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2355 ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2356 /* Build coordinates */ 2357 { 2358 PetscSection coordSection, subCoordSection; 2359 Vec coordinates, subCoordinates; 2360 PetscScalar *coords, *subCoords; 2361 PetscInt numComp, coordSize, v; 2362 2363 ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2364 ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2365 ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2366 ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2367 ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2368 ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2369 ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr); 2370 for (v = 0; v < numSubVertices; ++v) { 2371 const PetscInt vertex = subVertices[v]; 2372 const PetscInt subvertex = firstSubVertex+v; 2373 PetscInt dof; 2374 2375 ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2376 ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2377 ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2378 } 2379 ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2380 ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2381 ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2382 ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2383 ierr = VecSetType(subCoordinates,dm->vectype);CHKERRQ(ierr); 2384 ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2385 ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2386 for (v = 0; v < numSubVertices; ++v) { 2387 const PetscInt vertex = subVertices[v]; 2388 const PetscInt subvertex = firstSubVertex+v; 2389 PetscInt dof, off, sdof, soff, d; 2390 2391 ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2392 ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2393 ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2394 ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2395 if (dof != sdof) SETERRQ4(comm, PETSC_ERR_PLIB, "Coordinate dimension %d on subvertex %d, vertex %d should be %d", sdof, subvertex, vertex, dof); 2396 for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2397 } 2398 ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2399 ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2400 ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2401 ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2402 } 2403 /* Build SF */ 2404 CHKMEMQ; 2405 { 2406 PetscSF sfPoint, sfPointSub; 2407 const PetscSFNode *remotePoints; 2408 PetscSFNode *sremotePoints, *newLocalPoints, *newOwners; 2409 const PetscInt *localPoints; 2410 PetscInt *slocalPoints; 2411 PetscInt numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd; 2412 PetscMPIInt rank; 2413 2414 ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr); 2415 ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr); 2416 ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr); 2417 ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2418 ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 2419 ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr); 2420 if (numRoots >= 0) { 2421 /* Only vertices should be shared */ 2422 ierr = PetscMalloc2(pEnd-pStart,PetscSFNode,&newLocalPoints,numRoots,PetscSFNode,&newOwners);CHKERRQ(ierr); 2423 for (p = 0; p < pEnd-pStart; ++p) { 2424 newLocalPoints[p].rank = -2; 2425 newLocalPoints[p].index = -2; 2426 } 2427 /* Set subleaves */ 2428 for (l = 0; l < numLeaves; ++l) { 2429 const PetscInt point = localPoints[l]; 2430 const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2431 2432 if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point); 2433 if (subPoint < 0) continue; 2434 newLocalPoints[point-pStart].rank = rank; 2435 newLocalPoints[point-pStart].index = subPoint; 2436 ++numSubLeaves; 2437 } 2438 /* Must put in owned subpoints */ 2439 for (p = pStart; p < pEnd; ++p) { 2440 const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices); 2441 2442 if (subPoint < 0) { 2443 newOwners[p-pStart].rank = -3; 2444 newOwners[p-pStart].index = -3; 2445 } else { 2446 newOwners[p-pStart].rank = rank; 2447 newOwners[p-pStart].index = subPoint; 2448 } 2449 } 2450 ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2451 ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr); 2452 ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2453 ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr); 2454 ierr = PetscMalloc(numSubLeaves * sizeof(PetscInt), &slocalPoints);CHKERRQ(ierr); 2455 ierr = PetscMalloc(numSubLeaves * sizeof(PetscSFNode), &sremotePoints);CHKERRQ(ierr); 2456 for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) { 2457 const PetscInt point = localPoints[l]; 2458 const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices); 2459 2460 if (subPoint < 0) continue; 2461 if (newLocalPoints[point].rank == rank) {++ll; continue;} 2462 slocalPoints[sl] = subPoint; 2463 sremotePoints[sl].rank = newLocalPoints[point].rank; 2464 sremotePoints[sl].index = newLocalPoints[point].index; 2465 if (sremotePoints[sl].rank < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point); 2466 if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point); 2467 ++sl; 2468 } 2469 ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr); 2470 if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves); 2471 ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 2472 } 2473 } 2474 CHKMEMQ; 2475 /* Cleanup */ 2476 if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);} 2477 ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr); 2478 ierr = PetscFree(subCells);CHKERRQ(ierr); 2479 PetscFunctionReturn(0); 2480 } 2481 2482 #undef __FUNCT__ 2483 #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated" 2484 static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm) 2485 { 2486 MPI_Comm comm; 2487 DMLabel subpointMap; 2488 IS *subpointIS; 2489 const PetscInt **subpoints; 2490 PetscInt *numSubPoints, *firstSubPoint, *coneNew; 2491 PetscInt totSubPoints = 0, maxConeSize, dim, p, d, v; 2492 PetscErrorCode ierr; 2493 2494 PetscFunctionBegin; 2495 ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2496 /* Create subpointMap which marks the submesh */ 2497 ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr); 2498 ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr); 2499 ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr); 2500 ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, hasLagrange, label, value, subpointMap, subdm);CHKERRQ(ierr); 2501 /* Setup chart */ 2502 ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2503 ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr); 2504 for (d = 0; d <= dim; ++d) { 2505 ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr); 2506 totSubPoints += numSubPoints[d]; 2507 } 2508 ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr); 2509 ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr); 2510 /* Set cone sizes */ 2511 firstSubPoint[dim] = 0; 2512 firstSubPoint[0] = firstSubPoint[dim] + numSubPoints[dim]; 2513 if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0] + numSubPoints[0];} 2514 if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];} 2515 for (d = 0; d <= dim; ++d) { 2516 ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr); 2517 ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2518 } 2519 for (d = 0; d <= dim; ++d) { 2520 for (p = 0; p < numSubPoints[d]; ++p) { 2521 const PetscInt point = subpoints[d][p]; 2522 const PetscInt subpoint = firstSubPoint[d] + p; 2523 const PetscInt *cone; 2524 PetscInt coneSize, coneSizeNew, c, val; 2525 2526 ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2527 ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr); 2528 if (d == dim) { 2529 ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2530 for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2531 ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr); 2532 if (val >= 0) coneSizeNew++; 2533 } 2534 ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr); 2535 } 2536 } 2537 } 2538 ierr = DMSetUp(subdm);CHKERRQ(ierr); 2539 /* Set cones */ 2540 ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2541 ierr = PetscMalloc(maxConeSize * sizeof(PetscInt), &coneNew);CHKERRQ(ierr); 2542 for (d = 0; d <= dim; ++d) { 2543 for (p = 0; p < numSubPoints[d]; ++p) { 2544 const PetscInt point = subpoints[d][p]; 2545 const PetscInt subpoint = firstSubPoint[d] + p; 2546 const PetscInt *cone; 2547 PetscInt coneSize, subconeSize, coneSizeNew, c, subc; 2548 2549 ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 2550 ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr); 2551 ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 2552 for (c = 0, coneSizeNew = 0; c < coneSize; ++c) { 2553 ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr); 2554 if (subc >= 0) coneNew[coneSizeNew++] = firstSubPoint[d-1] + subc; 2555 } 2556 if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize); 2557 ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr); 2558 } 2559 } 2560 ierr = PetscFree(coneNew);CHKERRQ(ierr); 2561 ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr); 2562 ierr = DMPlexStratify(subdm);CHKERRQ(ierr); 2563 /* Build coordinates */ 2564 { 2565 PetscSection coordSection, subCoordSection; 2566 Vec coordinates, subCoordinates; 2567 PetscScalar *coords, *subCoords; 2568 PetscInt numComp, coordSize; 2569 2570 ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2571 ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2572 ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr); 2573 ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr); 2574 ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr); 2575 ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr); 2576 ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr); 2577 for (v = 0; v < numSubPoints[0]; ++v) { 2578 const PetscInt vertex = subpoints[0][v]; 2579 const PetscInt subvertex = firstSubPoint[0]+v; 2580 PetscInt dof; 2581 2582 ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2583 ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr); 2584 ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr); 2585 } 2586 ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr); 2587 ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr); 2588 ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr); 2589 ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2590 ierr = VecSetType(subCoordinates,dm->vectype);CHKERRQ(ierr); 2591 ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2592 ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2593 for (v = 0; v < numSubPoints[0]; ++v) { 2594 const PetscInt vertex = subpoints[0][v]; 2595 const PetscInt subvertex = firstSubPoint[0]+v; 2596 PetscInt dof, off, sdof, soff, d; 2597 2598 ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr); 2599 ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr); 2600 ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr); 2601 ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr); 2602 if (dof != sdof) SETERRQ4(comm, PETSC_ERR_PLIB, "Coordinate dimension %d on subvertex %d, vertex %d should be %d", sdof, subvertex, vertex, dof); 2603 for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d]; 2604 } 2605 ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2606 ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr); 2607 ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr); 2608 ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr); 2609 } 2610 /* Cleanup */ 2611 for (d = 0; d <= dim; ++d) { 2612 ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr); 2613 ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr); 2614 } 2615 ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr); 2616 PetscFunctionReturn(0); 2617 } 2618 2619 #undef __FUNCT__ 2620 #define __FUNCT__ "DMPlexCreateCohesiveSubmesh" 2621 /* 2622 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. 2623 2624 Input Parameters: 2625 + dm - The original mesh 2626 . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells 2627 . label - A label name, or PETSC_NULL 2628 - value - A label value 2629 2630 Output Parameter: 2631 . subdm - The surface mesh 2632 2633 Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap(). 2634 2635 Level: developer 2636 2637 .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh() 2638 */ 2639 PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm) 2640 { 2641 PetscInt dim, depth; 2642 PetscErrorCode ierr; 2643 2644 PetscFunctionBegin; 2645 PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2646 PetscValidPointer(subdm, 5); 2647 ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2648 ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2649 ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr); 2650 ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr); 2651 ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr); 2652 if (depth == dim) { 2653 ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 2654 } else { 2655 ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr); 2656 } 2657 PetscFunctionReturn(0); 2658 } 2659 2660 #undef __FUNCT__ 2661 #define __FUNCT__ "DMPlexGetSubpointMap" 2662 /*@ 2663 DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values 2664 2665 Input Parameter: 2666 . dm - The submesh DM 2667 2668 Output Parameter: 2669 . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh 2670 2671 Level: developer 2672 2673 .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS() 2674 @*/ 2675 PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap) 2676 { 2677 DM_Plex *mesh = (DM_Plex*) dm->data; 2678 2679 PetscFunctionBegin; 2680 PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2681 PetscValidPointer(subpointMap, 2); 2682 *subpointMap = mesh->subpointMap; 2683 PetscFunctionReturn(0); 2684 } 2685 2686 #undef __FUNCT__ 2687 #define __FUNCT__ "DMPlexSetSubpointMap" 2688 /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */ 2689 PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap) 2690 { 2691 DM_Plex *mesh = (DM_Plex *) dm->data; 2692 DMLabel tmp; 2693 PetscErrorCode ierr; 2694 2695 PetscFunctionBegin; 2696 PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2697 tmp = mesh->subpointMap; 2698 mesh->subpointMap = subpointMap; 2699 ++mesh->subpointMap->refct; 2700 ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr); 2701 PetscFunctionReturn(0); 2702 } 2703 2704 #undef __FUNCT__ 2705 #define __FUNCT__ "DMPlexCreateSubpointIS" 2706 /*@ 2707 DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data 2708 2709 Input Parameter: 2710 . dm - The submesh DM 2711 2712 Output Parameter: 2713 . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh 2714 2715 Note: This is IS is guaranteed to be sorted by the construction of the submesh 2716 2717 Level: developer 2718 2719 .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap() 2720 @*/ 2721 PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS) 2722 { 2723 MPI_Comm comm; 2724 DMLabel subpointMap; 2725 IS is; 2726 const PetscInt *opoints; 2727 PetscInt *points, *depths; 2728 PetscInt depth, depStart, depEnd, d, pStart, pEnd, p, n, off; 2729 PetscErrorCode ierr; 2730 2731 PetscFunctionBegin; 2732 PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2733 PetscValidPointer(subpointIS, 2); 2734 ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2735 *subpointIS = NULL; 2736 ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr); 2737 ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2738 if (subpointMap && depth >= 0) { 2739 ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2740 if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart); 2741 ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 2742 depths[0] = depth; 2743 depths[1] = 0; 2744 for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;} 2745 ierr = PetscMalloc(pEnd * sizeof(PetscInt), &points);CHKERRQ(ierr); 2746 for(d = 0, off = 0; d <= depth; ++d) { 2747 const PetscInt dep = depths[d]; 2748 2749 ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr); 2750 ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr); 2751 if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */ 2752 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); 2753 } else { 2754 if (!n) { 2755 if (d == 0) { 2756 /* Missing cells */ 2757 for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1; 2758 } else { 2759 /* Missing faces */ 2760 for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT; 2761 } 2762 } 2763 } 2764 if (n) { 2765 ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr); 2766 ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr); 2767 for(p = 0; p < n; ++p, ++off) points[off] = opoints[p]; 2768 ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr); 2769 ierr = ISDestroy(&is);CHKERRQ(ierr); 2770 } 2771 } 2772 ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr); 2773 if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd); 2774 ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr); 2775 } 2776 PetscFunctionReturn(0); 2777 } 2778