1 #include <petsc-private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 2 #include <petscsf.h> 3 4 #undef __FUNCT__ 5 #define __FUNCT__ "DMPlexReverseCell" 6 /*@ 7 DMPlexReverseCell - Give a mesh cell the opposite orientation 8 9 Input Parameters: 10 + dm - The DM 11 - cell - The cell number 12 13 Note: The modification of the DM is done in-place. 14 15 Level: advanced 16 17 .seealso: DMPlexOrient(), DMCreate(), DMPLEX 18 @*/ 19 PetscErrorCode DMPlexReverseCell(DM dm, PetscInt cell) 20 { 21 /* Note that the reverse orientation ro of a face with orientation o is: 22 23 ro = o >= 0 ? -(faceSize - o) : faceSize + o 24 25 where faceSize is the size of the cone for the face. 26 */ 27 const PetscInt *cone, *coneO, *support; 28 PetscInt *revcone, *revconeO; 29 PetscInt maxConeSize, coneSize, supportSize, faceSize, cp, sp; 30 PetscErrorCode ierr; 31 32 PetscFunctionBegin; 33 ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 34 ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 35 ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 36 /* Reverse cone, and reverse orientations of faces */ 37 ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 38 ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 39 ierr = DMPlexGetConeOrientation(dm, cell, &coneO);CHKERRQ(ierr); 40 for (cp = 0; cp < coneSize; ++cp) { 41 const PetscInt rcp = coneSize-cp-1; 42 43 ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr); 44 revcone[cp] = cone[rcp]; 45 revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp]; 46 } 47 ierr = DMPlexSetCone(dm, cell, revcone);CHKERRQ(ierr); 48 ierr = DMPlexSetConeOrientation(dm, cell, revconeO);CHKERRQ(ierr); 49 /* Reverse orientation of this cell in the support hypercells */ 50 faceSize = coneSize; 51 ierr = DMPlexGetSupportSize(dm, cell, &supportSize);CHKERRQ(ierr); 52 ierr = DMPlexGetSupport(dm, cell, &support);CHKERRQ(ierr); 53 for (sp = 0; sp < supportSize; ++sp) { 54 ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr); 55 ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr); 56 ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr); 57 for (cp = 0; cp < coneSize; ++cp) { 58 if (cone[cp] != cell) continue; 59 ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr); 60 } 61 } 62 ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 63 ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 64 PetscFunctionReturn(0); 65 } 66 67 #undef __FUNCT__ 68 #define __FUNCT__ "DMPlexCheckFace_Internal" 69 /* 70 - Checks face match 71 - Flips non-matching 72 - Inserts faces of support cells in FIFO 73 */ 74 static PetscErrorCode DMPlexCheckFace_Internal(DM dm, PetscInt *faceFIFO, PetscInt *fTop, PetscInt *fBottom, PetscInt cStart, PetscInt fStart, PetscInt fEnd, PetscBT seenCells, PetscBT flippedCells, PetscBT seenFaces) 75 { 76 const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB; 77 PetscInt supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1; 78 PetscInt face, dim, seenA, flippedA, seenB, flippedB, mismatch, c; 79 PetscErrorCode ierr; 80 81 PetscFunctionBegin; 82 face = faceFIFO[(*fTop)++]; 83 ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 84 ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 85 ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 86 if (supportSize < 2) PetscFunctionReturn(0); 87 if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize); 88 seenA = PetscBTLookup(seenCells, support[0]-cStart); 89 flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0; 90 seenB = PetscBTLookup(seenCells, support[1]-cStart); 91 flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0; 92 93 ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr); 94 ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr); 95 ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr); 96 ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr); 97 ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr); 98 ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr); 99 for (c = 0; c < coneSizeA; ++c) { 100 if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) { 101 faceFIFO[(*fBottom)++] = coneA[c]; 102 ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr); 103 } 104 if (coneA[c] == face) posA = c; 105 if (*fBottom > fEnd-fStart) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Face %d was pushed exceeding capacity %d > %d", coneA[c], *fBottom, fEnd-fStart); 106 } 107 if (posA < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d could not be located in cell %d", face, support[0]); 108 for (c = 0; c < coneSizeB; ++c) { 109 if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) { 110 faceFIFO[(*fBottom)++] = coneB[c]; 111 ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr); 112 } 113 if (coneB[c] == face) posB = c; 114 if (*fBottom > fEnd-fStart) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Face %d was pushed exceeding capacity %d > %d", coneA[c], *fBottom, fEnd-fStart); 115 } 116 if (posB < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d could not be located in cell %d", face, support[1]); 117 118 if (dim == 1) { 119 mismatch = posA == posB; 120 } else { 121 mismatch = coneOA[posA] == coneOB[posB]; 122 } 123 124 if (mismatch ^ (flippedA ^ flippedB)) { 125 if (seenA && seenB) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Previously seen cells %d and %d do not match: Fault mesh is non-orientable", support[0], support[1]); 126 if (!seenA && !flippedA) { 127 ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr); 128 } else if (!seenB && !flippedB) { 129 ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr); 130 } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 131 } else if (mismatch && flippedA && flippedB) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Attempt to flip already flipped cell: Fault mesh is non-orientable"); 132 ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr); 133 ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr); 134 PetscFunctionReturn(0); 135 } 136 137 #undef __FUNCT__ 138 #define __FUNCT__ "DMPlexOrient" 139 /*@ 140 DMPlexOrient - Give a consistent orientation to the input mesh 141 142 Input Parameters: 143 . dm - The DM 144 145 Note: The orientation data for the DM are change in-place. 146 $ This routine will fail for non-orientable surfaces, such as the Moebius strip. 147 148 Level: advanced 149 150 .seealso: DMCreate(), DMPLEX 151 @*/ 152 PetscErrorCode DMPlexOrient(DM dm) 153 { 154 MPI_Comm comm; 155 PetscSF sf; 156 const PetscInt *lpoints; 157 const PetscSFNode *rpoints; 158 PetscSFNode *rorntComp = NULL, *lorntComp = NULL; 159 PetscInt *numNeighbors, **neighbors; 160 PetscSFNode *nrankComp; 161 PetscBool *match, *flipped; 162 PetscBT seenCells, flippedCells, seenFaces; 163 PetscInt *faceFIFO, fTop, fBottom, *cellComp, *faceComp; 164 PetscInt numLeaves, numRoots, dim, h, cStart, cEnd, c, cell, fStart, fEnd, face, off, totNeighbors = 0; 165 PetscMPIInt rank, numComponents, comp = 0; 166 PetscBool flg; 167 PetscErrorCode ierr; 168 169 PetscFunctionBegin; 170 ierr = PetscObjectGetComm((PetscObject) dm, &comm);CHKERRQ(ierr); 171 ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 172 ierr = PetscOptionsHasName(((PetscObject) dm)->prefix, "-orientation_view", &flg);CHKERRQ(ierr); 173 ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 174 ierr = PetscSFGetGraph(sf, &numRoots, &numLeaves, &lpoints, &rpoints);CHKERRQ(ierr); 175 /* Truth Table 176 mismatch flips do action mismatch flipA ^ flipB action 177 F 0 flips no F F F 178 F 1 flip yes F T T 179 F 2 flips no T F T 180 T 0 flips yes T T F 181 T 1 flip no 182 T 2 flips yes 183 */ 184 ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 185 ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr); 186 ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 187 ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr); 188 ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr); 189 ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr); 190 ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr); 191 ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr); 192 ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr); 193 ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr); 194 ierr = PetscCalloc3(fEnd - fStart, &faceFIFO, cEnd-cStart, &cellComp, fEnd-fStart, &faceComp);CHKERRQ(ierr); 195 /* 196 OLD STYLE 197 - Add an integer array over cells and faces (component) for connected component number 198 Foreach component 199 - Mark the initial cell as seen 200 - Process component as usual 201 - Set component for all seenCells 202 - Wipe seenCells and seenFaces (flippedCells can stay) 203 - Generate parallel adjacency for component using SF and seenFaces 204 - Collect numComponents adj data from each proc to 0 205 - Build same serial graph 206 - Use same solver 207 - Use Scatterv to to send back flipped flags for each component 208 - Negate flippedCells by component 209 210 NEW STYLE 211 - Create the adj on each process 212 - Bootstrap to complete graph on proc 0 213 */ 214 /* Loop over components */ 215 for (cell = cStart; cell < cEnd; ++cell) cellComp[cell-cStart] = -1; 216 do { 217 /* Look for first unmarked cell */ 218 for (cell = cStart; cell < cEnd; ++cell) if (cellComp[cell-cStart] < 0) break; 219 if (cell >= cEnd) break; 220 /* Initialize FIFO with first cell in component */ 221 { 222 const PetscInt *cone; 223 PetscInt coneSize; 224 225 fTop = fBottom = 0; 226 ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr); 227 ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr); 228 for (c = 0; c < coneSize; ++c) { 229 faceFIFO[fBottom++] = cone[c]; 230 ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr); 231 } 232 ierr = PetscBTSet(seenCells, cell-cStart);CHKERRQ(ierr); 233 } 234 /* Consider each face in FIFO */ 235 while (fTop < fBottom) { 236 ierr = DMPlexCheckFace_Internal(dm, faceFIFO, &fTop, &fBottom, cStart, fStart, fEnd, seenCells, flippedCells, seenFaces);CHKERRQ(ierr); 237 } 238 /* Set component for cells and faces */ 239 for (cell = 0; cell < cEnd-cStart; ++cell) { 240 if (PetscBTLookup(seenCells, cell)) cellComp[cell] = comp; 241 } 242 for (face = 0; face < fEnd-fStart; ++face) { 243 if (PetscBTLookup(seenFaces, face)) faceComp[face] = comp; 244 } 245 /* Wipe seenCells and seenFaces for next component */ 246 ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr); 247 ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr); 248 ++comp; 249 } while (1); 250 numComponents = comp; 251 if (flg) { 252 PetscViewer v; 253 254 ierr = PetscViewerASCIIGetStdout(comm, &v);CHKERRQ(ierr); 255 ierr = PetscViewerASCIISynchronizedAllow(v, PETSC_TRUE);CHKERRQ(ierr); 256 ierr = PetscViewerASCIISynchronizedPrintf(v, "[%d]BT for serial flipped cells:\n", rank);CHKERRQ(ierr); 257 ierr = PetscBTView(cEnd-cStart, flippedCells, v);CHKERRQ(ierr); 258 } 259 /* Now all subdomains are oriented, but we need a consistent parallel orientation */ 260 if (numLeaves >= 0) { 261 /* Store orientations of boundary faces*/ 262 ierr = PetscCalloc2(numRoots,&rorntComp,numRoots,&lorntComp);CHKERRQ(ierr); 263 for (face = fStart; face < fEnd; ++face) { 264 const PetscInt *cone, *support, *ornt; 265 PetscInt coneSize, supportSize; 266 267 ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 268 if (supportSize != 1) continue; 269 ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 270 271 ierr = DMPlexGetCone(dm, support[0], &cone);CHKERRQ(ierr); 272 ierr = DMPlexGetConeSize(dm, support[0], &coneSize);CHKERRQ(ierr); 273 ierr = DMPlexGetConeOrientation(dm, support[0], &ornt);CHKERRQ(ierr); 274 for (c = 0; c < coneSize; ++c) if (cone[c] == face) break; 275 if (dim == 1) { 276 /* Use cone position instead, shifted to -1 or 1 */ 277 rorntComp[face].rank = c*2-1; 278 } else { 279 if (PetscBTLookup(flippedCells, support[0]-cStart)) rorntComp[face].rank = ornt[c] < 0 ? -1 : 1; 280 else rorntComp[face].rank = ornt[c] < 0 ? 1 : -1; 281 } 282 rorntComp[face].index = faceComp[face-fStart]; 283 } 284 /* Communicate boundary edge orientations */ 285 ierr = PetscSFBcastBegin(sf, MPIU_2INT, rorntComp, lorntComp);CHKERRQ(ierr); 286 ierr = PetscSFBcastEnd(sf, MPIU_2INT, rorntComp, lorntComp);CHKERRQ(ierr); 287 } 288 /* Get process adjacency */ 289 ierr = PetscMalloc2(numComponents, &numNeighbors, numComponents, &neighbors);CHKERRQ(ierr); 290 for (comp = 0; comp < numComponents; ++comp) { 291 PetscInt l, n; 292 293 numNeighbors[comp] = 0; 294 ierr = PetscMalloc1(PetscMax(numLeaves, 0), &neighbors[comp]);CHKERRQ(ierr); 295 /* I know this is p^2 time in general, but for bounded degree its alright */ 296 for (l = 0; l < numLeaves; ++l) { 297 const PetscInt face = lpoints[l]; 298 299 /* Find a representative face (edge) separating pairs of procs */ 300 if ((face >= fStart) && (face < fEnd) && (faceComp[face-fStart] == comp)) { 301 const PetscInt rank = rpoints[l].rank; 302 const PetscInt rcomp = lorntComp[face].index; 303 304 for (n = 0; n < numNeighbors[comp]; ++n) if ((rank == rpoints[neighbors[comp][n]].rank) && (rcomp == lorntComp[lpoints[neighbors[comp][n]]].index)) break; 305 if (n >= numNeighbors[comp]) { 306 PetscInt supportSize; 307 308 ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 309 if (supportSize != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Boundary faces should see one cell, not %d", supportSize); 310 if (flg) {ierr = PetscPrintf(PETSC_COMM_SELF, "[%d]: component %d, Found representative leaf %d (face %d) connecting to face %d on (%d, %d) with orientation %d\n", rank, comp, l, face, rpoints[l].index, rrank, rcomp, lorntComp[face].rank);CHKERRQ(ierr);} 311 neighbors[comp][numNeighbors[comp]++] = l; 312 } 313 } 314 } 315 totNeighbors += numNeighbors[comp]; 316 } 317 ierr = PetscMalloc2(totNeighbors, &nrankComp, totNeighbors, &match);CHKERRQ(ierr); 318 for (comp = 0, off = 0; comp < numComponents; ++comp) { 319 PetscInt n; 320 321 for (n = 0; n < numNeighbors[comp]; ++n, ++off) { 322 const PetscInt face = lpoints[neighbors[comp][n]]; 323 const PetscInt o = rorntComp[face].rank*lorntComp[face].rank; 324 325 if (o < 0) match[off] = PETSC_TRUE; 326 else if (o > 0) match[off] = PETSC_FALSE; 327 else SETERRQ5(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Invalid face %d (%d, %d) neighbor: %d comp: %d", face, rorntComp[face], lorntComp[face], neighbors[comp][n], comp); 328 nrankComp[off].rank = rpoints[neighbors[comp][n]].rank; 329 nrankComp[off].index = lorntComp[lpoints[neighbors[comp][n]]].index; 330 } 331 ierr = PetscFree(neighbors[comp]);CHKERRQ(ierr); 332 } 333 /* Collect the graph on 0 */ 334 if (numLeaves >= 0) { 335 Mat G; 336 PetscBT seenProcs, flippedProcs; 337 PetscInt *procFIFO, pTop, pBottom; 338 PetscInt *N = NULL, *Noff; 339 PetscSFNode *adj = NULL; 340 PetscBool *val = NULL; 341 PetscMPIInt *recvcounts = NULL, *displs = NULL, *Nc, p, o; 342 PetscMPIInt numProcs = 0; 343 344 ierr = PetscCalloc1(numComponents, &flipped);CHKERRQ(ierr); 345 if (!rank) {ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr);} 346 ierr = PetscCalloc4(numProcs, &recvcounts, numProcs+1, &displs, numProcs, &Nc, numProcs+1, &Noff);CHKERRQ(ierr); 347 ierr = MPI_Gather(&numComponents, 1, MPI_INT, Nc, 1, MPI_INT, 0, comm);CHKERRQ(ierr); 348 for (p = 0; p < numProcs; ++p) { 349 displs[p+1] = displs[p] + Nc[p]; 350 } 351 if (!rank) {ierr = PetscMalloc1(displs[numProcs],&N);CHKERRQ(ierr);} 352 ierr = MPI_Gatherv(numNeighbors, numComponents, MPIU_INT, N, Nc, displs, MPIU_INT, 0, comm);CHKERRQ(ierr); 353 for (p = 0, o = 0; p < numProcs; ++p) { 354 recvcounts[p] = 0; 355 for (c = 0; c < Nc[p]; ++c, ++o) recvcounts[p] += N[o]; 356 displs[p+1] = displs[p] + recvcounts[p]; 357 } 358 if (!rank) {ierr = PetscMalloc2(displs[numProcs], &adj, displs[numProcs], &val);CHKERRQ(ierr);} 359 ierr = MPI_Gatherv(nrankComp, totNeighbors, MPIU_2INT, adj, recvcounts, displs, MPIU_2INT, 0, comm);CHKERRQ(ierr); 360 ierr = MPI_Gatherv(match, totNeighbors, MPIU_BOOL, val, recvcounts, displs, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 361 ierr = PetscFree2(numNeighbors, neighbors);CHKERRQ(ierr); 362 if (!rank) { 363 for (p = 1; p <= numProcs; ++p) {Noff[p] = Noff[p-1] + Nc[p-1];} 364 if (flg) { 365 PetscInt n; 366 367 for (p = 0, off = 0; p < numProcs; ++p) { 368 for (c = 0; c < Nc[p]; ++c) { 369 ierr = PetscPrintf(PETSC_COMM_SELF, "Proc %d Comp %d:\n", p, c); 370 for (n = 0; n < N[Noff[p]+c]; ++n, ++off) { 371 ierr = PetscPrintf(PETSC_COMM_SELF, " edge (%d, %d) (%d):\n", adj[off].rank, adj[off].index, val[off]); 372 } 373 } 374 } 375 } 376 /* Symmetrize the graph */ 377 ierr = MatCreate(PETSC_COMM_SELF, &G);CHKERRQ(ierr); 378 ierr = MatSetSizes(G, Noff[numProcs], Noff[numProcs], Noff[numProcs], Noff[numProcs]);CHKERRQ(ierr); 379 ierr = MatSetUp(G);CHKERRQ(ierr); 380 for (p = 0, off = 0; p < numProcs; ++p) { 381 for (c = 0; c < Nc[p]; ++c) { 382 const PetscInt r = Noff[p]+c; 383 PetscInt n; 384 385 for (n = 0; n < N[r]; ++n, ++off) { 386 const PetscInt q = Noff[adj[off].rank] + adj[off].index; 387 const PetscScalar o = val[off] ? 1.0 : 0.0; 388 389 ierr = MatSetValues(G, 1, &r, 1, &q, &o, INSERT_VALUES);CHKERRQ(ierr); 390 ierr = MatSetValues(G, 1, &q, 1, &r, &o, INSERT_VALUES);CHKERRQ(ierr); 391 } 392 } 393 } 394 ierr = MatAssemblyBegin(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 395 ierr = MatAssemblyEnd(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 396 397 ierr = PetscBTCreate(Noff[numProcs], &seenProcs);CHKERRQ(ierr); 398 ierr = PetscBTMemzero(Noff[numProcs], seenProcs);CHKERRQ(ierr); 399 ierr = PetscBTCreate(Noff[numProcs], &flippedProcs);CHKERRQ(ierr); 400 ierr = PetscBTMemzero(Noff[numProcs], flippedProcs);CHKERRQ(ierr); 401 ierr = PetscMalloc1(Noff[numProcs], &procFIFO);CHKERRQ(ierr); 402 pTop = pBottom = 0; 403 for (p = 0; p < Noff[numProcs]; ++p) { 404 if (PetscBTLookup(seenProcs, p)) continue; 405 /* Initialize FIFO with next proc */ 406 procFIFO[pBottom++] = p; 407 ierr = PetscBTSet(seenProcs, p);CHKERRQ(ierr); 408 /* Consider each proc in FIFO */ 409 while (pTop < pBottom) { 410 const PetscScalar *ornt; 411 const PetscInt *neighbors; 412 PetscInt proc, nproc, seen, flippedA, flippedB, mismatch, numNeighbors, n; 413 414 proc = procFIFO[pTop++]; 415 flippedA = PetscBTLookup(flippedProcs, proc) ? 1 : 0; 416 ierr = MatGetRow(G, proc, &numNeighbors, &neighbors, &ornt);CHKERRQ(ierr); 417 /* Loop over neighboring procs */ 418 for (n = 0; n < numNeighbors; ++n) { 419 nproc = neighbors[n]; 420 mismatch = PetscRealPart(ornt[n]) > 0.5 ? 0 : 1; 421 seen = PetscBTLookup(seenProcs, nproc); 422 flippedB = PetscBTLookup(flippedProcs, nproc) ? 1 : 0; 423 424 if (mismatch ^ (flippedA ^ flippedB)) { 425 if (seen) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Previously seen procs %d and %d do not match: Fault mesh is non-orientable", proc, nproc); 426 if (!flippedB) { 427 ierr = PetscBTSet(flippedProcs, nproc);CHKERRQ(ierr); 428 } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 429 } else if (mismatch && flippedA && flippedB) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Attempt to flip already flipped cell: Fault mesh is non-orientable"); 430 if (!seen) { 431 procFIFO[pBottom++] = nproc; 432 ierr = PetscBTSet(seenProcs, nproc);CHKERRQ(ierr); 433 } 434 } 435 } 436 } 437 ierr = PetscFree(procFIFO);CHKERRQ(ierr); 438 ierr = MatDestroy(&G);CHKERRQ(ierr); 439 ierr = PetscFree2(adj, val);CHKERRQ(ierr); 440 ierr = PetscBTDestroy(&seenProcs);CHKERRQ(ierr); 441 } 442 /* Scatter flip flags */ 443 { 444 PetscBool *flips = NULL; 445 446 if (!rank) { 447 ierr = PetscMalloc1(Noff[numProcs], &flips);CHKERRQ(ierr); 448 for (p = 0; p < Noff[numProcs]; ++p) { 449 flips[p] = PetscBTLookup(flippedProcs, p) ? PETSC_TRUE : PETSC_FALSE; 450 if (flg && flips[p]) {ierr = PetscPrintf(comm, "Flipping Proc+Comp %d:\n", p);} 451 } 452 for (p = 0; p < numProcs; ++p) { 453 displs[p+1] = displs[p] + Nc[p]; 454 } 455 } 456 ierr = MPI_Scatterv(flips, Nc, displs, MPIU_BOOL, flipped, numComponents, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 457 ierr = PetscFree(flips);CHKERRQ(ierr); 458 } 459 if (!rank) {ierr = PetscBTDestroy(&flippedProcs);CHKERRQ(ierr);} 460 ierr = PetscFree(N);CHKERRQ(ierr); 461 ierr = PetscFree4(recvcounts, displs, Nc, Noff);CHKERRQ(ierr); 462 ierr = PetscFree2(nrankComp, match);CHKERRQ(ierr); 463 464 /* Decide whether to flip cells in each component */ 465 for (c = 0; c < cEnd-cStart; ++c) {if (flipped[cellComp[c]]) {ierr = PetscBTNegate(flippedCells, c);CHKERRQ(ierr);}} 466 ierr = PetscFree(flipped);CHKERRQ(ierr); 467 } 468 if (flg) { 469 PetscViewer v; 470 471 ierr = PetscViewerASCIIGetStdout(comm, &v);CHKERRQ(ierr); 472 ierr = PetscViewerASCIISynchronizedAllow(v, PETSC_TRUE);CHKERRQ(ierr); 473 ierr = PetscViewerASCIISynchronizedPrintf(v, "[%d]BT for parallel flipped cells:\n", rank);CHKERRQ(ierr); 474 ierr = PetscBTView(cEnd-cStart, flippedCells, v);CHKERRQ(ierr); 475 } 476 /* Reverse flipped cells in the mesh */ 477 for (c = cStart; c < cEnd; ++c) { 478 if (PetscBTLookup(flippedCells, c-cStart)) {ierr = DMPlexReverseCell(dm, c);CHKERRQ(ierr);} 479 } 480 ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr); 481 ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr); 482 ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr); 483 ierr = PetscFree2(numNeighbors, neighbors);CHKERRQ(ierr); 484 ierr = PetscFree2(rorntComp, lorntComp);CHKERRQ(ierr); 485 ierr = PetscFree3(faceFIFO, cellComp, faceComp);CHKERRQ(ierr); 486 PetscFunctionReturn(0); 487 } 488