1 #include <petsc/private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 2 3 /* TODO PetscArrayExchangeBegin/End */ 4 /* TODO blocksize */ 5 /* TODO move to API ? */ 6 static PetscErrorCode ExchangeArrayByRank_Private(PetscObject obj, MPI_Datatype dt, PetscInt nsranks, const PetscMPIInt sranks[], PetscInt ssize[], const void *sarr[], PetscInt nrranks, const PetscMPIInt rranks[], PetscInt *rsize_out[], void **rarr_out[]) 7 { 8 PetscInt r; 9 PetscInt *rsize; 10 void **rarr; 11 MPI_Request *sreq, *rreq; 12 PetscMPIInt tag, unitsize; 13 MPI_Comm comm; 14 PetscErrorCode ierr; 15 16 PetscFunctionBegin; 17 ierr = MPI_Type_size(dt, &unitsize);CHKERRQ(ierr); 18 ierr = PetscObjectGetComm(obj, &comm);CHKERRQ(ierr); 19 ierr = PetscMalloc2(nrranks, &rsize, nrranks, &rarr);CHKERRQ(ierr); 20 ierr = PetscMalloc2(nrranks, &rreq, nsranks, &sreq);CHKERRQ(ierr); 21 /* exchange array size */ 22 ierr = PetscObjectGetNewTag(obj,&tag);CHKERRQ(ierr); 23 for (r=0; r<nrranks; r++) { 24 ierr = MPI_Irecv(&rsize[r], 1, MPIU_INT, rranks[r], tag, comm, &rreq[r]);CHKERRQ(ierr); 25 } 26 for (r=0; r<nsranks; r++) { 27 ierr = MPI_Isend(&ssize[r], 1, MPIU_INT, sranks[r], tag, comm, &sreq[r]);CHKERRQ(ierr); 28 } 29 ierr = MPI_Waitall(nrranks, rreq, MPI_STATUSES_IGNORE);CHKERRQ(ierr); 30 ierr = MPI_Waitall(nsranks, sreq, MPI_STATUSES_IGNORE);CHKERRQ(ierr); 31 /* exchange array */ 32 ierr = PetscObjectGetNewTag(obj,&tag);CHKERRQ(ierr); 33 for (r=0; r<nrranks; r++) { 34 ierr = PetscMalloc(rsize[r]*unitsize, &rarr[r]);CHKERRQ(ierr); 35 ierr = MPI_Irecv(rarr[r], rsize[r], dt, rranks[r], tag, comm, &rreq[r]);CHKERRQ(ierr); 36 } 37 for (r=0; r<nsranks; r++) { 38 ierr = MPI_Isend(sarr[r], ssize[r], dt, sranks[r], tag, comm, &sreq[r]);CHKERRQ(ierr); 39 } 40 ierr = MPI_Waitall(nrranks, rreq, MPI_STATUSES_IGNORE);CHKERRQ(ierr); 41 ierr = MPI_Waitall(nsranks, sreq, MPI_STATUSES_IGNORE);CHKERRQ(ierr); 42 ierr = PetscFree2(rreq, sreq);CHKERRQ(ierr); 43 *rsize_out = rsize; 44 *rarr_out = rarr; 45 PetscFunctionReturn(0); 46 } 47 48 /* TODO VecExchangeBegin/End */ 49 /* TODO move to API ? */ 50 static PetscErrorCode ExchangeVecByRank_Private(PetscObject obj, PetscInt nsranks, const PetscMPIInt sranks[], Vec svecs[], PetscInt nrranks, const PetscMPIInt rranks[], Vec *rvecs[]) 51 { 52 PetscInt r; 53 PetscInt *ssize, *rsize; 54 PetscScalar **rarr; 55 const PetscScalar **sarr; 56 Vec *rvecs_; 57 MPI_Request *sreq, *rreq; 58 PetscErrorCode ierr; 59 60 PetscFunctionBegin; 61 ierr = PetscMalloc4(nsranks, &ssize, nsranks, &sarr, nrranks, &rreq, nsranks, &sreq);CHKERRQ(ierr); 62 for (r=0; r<nsranks; r++) { 63 ierr = VecGetLocalSize(svecs[r], &ssize[r]);CHKERRQ(ierr); 64 ierr = VecGetArrayRead(svecs[r], &sarr[r]);CHKERRQ(ierr); 65 } 66 ierr = ExchangeArrayByRank_Private(obj, MPIU_SCALAR, nsranks, sranks, ssize, (const void**)sarr, nrranks, rranks, &rsize, (void***)&rarr);CHKERRQ(ierr); 67 ierr = PetscMalloc1(nrranks, &rvecs_);CHKERRQ(ierr); 68 for (r=0; r<nrranks; r++) { 69 /* set array in two steps to mimic PETSC_OWN_POINTER */ 70 ierr = VecCreateSeqWithArray(PETSC_COMM_SELF, 1, rsize[r], NULL, &rvecs_[r]);CHKERRQ(ierr); 71 ierr = VecReplaceArray(rvecs_[r], rarr[r]);CHKERRQ(ierr); 72 } 73 for (r=0; r<nsranks; r++) { 74 ierr = VecRestoreArrayRead(svecs[r], &sarr[r]);CHKERRQ(ierr); 75 } 76 ierr = PetscFree2(rsize, rarr);CHKERRQ(ierr); 77 ierr = PetscFree4(ssize, sarr, rreq, sreq);CHKERRQ(ierr); 78 *rvecs = rvecs_; 79 PetscFunctionReturn(0); 80 } 81 82 static PetscErrorCode SortByRemote_Private(PetscSF sf, PetscInt *rmine1[], PetscInt *rremote1[]) 83 { 84 PetscInt nleaves; 85 PetscInt nranks; 86 const PetscMPIInt *ranks; 87 const PetscInt *roffset, *rmine, *rremote; 88 PetscInt n, o, r; 89 PetscErrorCode ierr; 90 91 PetscFunctionBegin; 92 ierr = PetscSFGetRanks(sf, &nranks, &ranks, &roffset, &rmine, &rremote);CHKERRQ(ierr); 93 nleaves = roffset[nranks]; 94 ierr = PetscMalloc2(nleaves, rmine1, nleaves, rremote1);CHKERRQ(ierr); 95 for (r=0; r<nranks; r++) { 96 /* simultaneously sort rank-wise portions of rmine & rremote by values in rremote 97 - to unify order with the other side */ 98 o = roffset[r]; 99 n = roffset[r+1] - o; 100 ierr = PetscMemcpy(&(*rmine1)[o], &rmine[o], n*sizeof(PetscInt));CHKERRQ(ierr); 101 ierr = PetscMemcpy(&(*rremote1)[o], &rremote[o], n*sizeof(PetscInt));CHKERRQ(ierr); 102 ierr = PetscSortIntWithArray(n, &(*rremote1)[o], &(*rmine1)[o]);CHKERRQ(ierr); 103 } 104 PetscFunctionReturn(0); 105 } 106 107 static PetscErrorCode GetRecursiveConeCoordinatesPerRank_Private(DM dm, PetscSF sf, PetscInt rmine[], Vec *coordinatesPerRank[]) 108 { 109 IS pointsPerRank, conesPerRank; 110 PetscInt nranks; 111 const PetscMPIInt *ranks; 112 const PetscInt *roffset; 113 PetscInt n, o, r; 114 PetscErrorCode ierr; 115 116 PetscFunctionBegin; 117 ierr = DMGetCoordinatesLocalSetUp(dm);CHKERRQ(ierr); 118 ierr = PetscSFGetRanks(sf, &nranks, &ranks, &roffset, NULL, NULL);CHKERRQ(ierr); 119 ierr = PetscMalloc1(nranks, coordinatesPerRank);CHKERRQ(ierr); 120 for (r=0; r<nranks; r++) { 121 o = roffset[r]; 122 n = roffset[r+1] - o; 123 ierr = ISCreateGeneral(PETSC_COMM_SELF, n, &rmine[o], PETSC_USE_POINTER, &pointsPerRank);CHKERRQ(ierr); 124 ierr = DMPlexGetConeRecursive(dm, pointsPerRank, &conesPerRank);CHKERRQ(ierr); 125 ierr = DMGetCoordinatesLocalTuple(dm, conesPerRank, NULL, &(*coordinatesPerRank)[r]);CHKERRQ(ierr); 126 ierr = ISDestroy(&pointsPerRank);CHKERRQ(ierr); 127 ierr = ISDestroy(&conesPerRank);CHKERRQ(ierr); 128 } 129 PetscFunctionReturn(0); 130 } 131 132 static PetscErrorCode PetscSFComputeMultiRootOriginalNumberingByRank_Private(PetscSF sf, PetscSF imsf, PetscInt *irmine1[]) 133 { 134 PetscInt *mRootsOrigNumbering; 135 PetscInt nileaves, niranks; 136 const PetscInt *iroffset, *irmine, *degree; 137 PetscInt i, n, o, r; 138 PetscErrorCode ierr; 139 140 PetscFunctionBegin; 141 ierr = PetscSFGetGraph(imsf, NULL, &nileaves, NULL, NULL);CHKERRQ(ierr); 142 ierr = PetscSFGetRanks(imsf, &niranks, NULL, &iroffset, &irmine, NULL);CHKERRQ(ierr); 143 #if defined(PETSC_USE_DEBUG) 144 if (PetscUnlikely(nileaves != iroffset[niranks])) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"nileaves != iroffset[niranks])"); 145 #endif 146 ierr = PetscSFComputeDegreeBegin(sf, °ree);CHKERRQ(ierr); 147 ierr = PetscSFComputeDegreeEnd(sf, °ree);CHKERRQ(ierr); 148 ierr = PetscSFComputeMultiRootOriginalNumbering(sf, degree, &mRootsOrigNumbering);CHKERRQ(ierr); 149 ierr = PetscMalloc1(nileaves, irmine1);CHKERRQ(ierr); 150 for (r=0; r<niranks; r++) { 151 o = iroffset[r]; 152 n = iroffset[r+1] - o; 153 for (i=0; i<n; i++) (*irmine1)[o+i] = mRootsOrigNumbering[irmine[o+i]]; 154 } 155 ierr = PetscFree(mRootsOrigNumbering);CHKERRQ(ierr); 156 PetscFunctionReturn(0); 157 } 158 159 /*@ 160 DMPlexCheckConesConformOnInterfaces - Check that points on inter-partition interfaces have conforming order of cone points. 161 For example, if there is an edge (rank,index)=(0,2) connecting points cone(0,2)=[(0,0),(0,1)] in this order, and the point SF containts connections 0 <- (1,0), 1 <- (1,1) and 2 <- (1,2), 162 then this check would pass if the edge (1,2) has cone(1,2)=[(1,0),(1,1)]. By contrast, if cone(1,2)=[(1,1),(1,0)], then this check would fail. 163 164 Input Parameters: 165 . dm - The DMPlex object 166 167 Note: This is mainly intended for debugging/testing purposes. Does not check cone orientation, for this purpose use DMPlexCheckFaces(). 168 169 Developer Note: Interface cones are expanded into vertices and then their coordinates are compared. 170 171 Level: developer 172 173 .seealso: DMPlexGetCone(), DMPlexGetConeSize(), DMGetPointSF(), DMGetCoordinates(), DMPlexCheckFaces(), DMPlexCheckPointSF(), DMPlexCheckSymmetry(), DMPlexCheckSkeleton() 174 @*/ 175 PetscErrorCode DMPlexCheckConesConformOnInterfaces(DM dm) 176 { 177 PetscSF sf; 178 PetscInt nleaves, nranks, nroots; 179 const PetscInt *mine, *roffset, *rmine, *rremote; 180 const PetscSFNode *remote; 181 const PetscMPIInt *ranks; 182 PetscSF msf, imsf; 183 PetscInt nileaves, niranks; 184 const PetscMPIInt *iranks; 185 const PetscInt *iroffset, *irmine, *irremote; 186 PetscInt *rmine1, *rremote1; /* rmine and rremote copies simultaneously sorted by rank and rremote */ 187 PetscInt *mine_orig_numbering; 188 Vec *sntCoordinatesPerRank; 189 Vec *refCoordinatesPerRank; 190 Vec *recCoordinatesPerRank=0; 191 PetscInt r; 192 PetscMPIInt commsize, myrank; 193 PetscBool same; 194 MPI_Comm comm; 195 PetscErrorCode ierr; 196 197 PetscFunctionBegin; 198 PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 199 ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr); 200 ierr = MPI_Comm_rank(comm, &myrank);CHKERRQ(ierr); 201 ierr = MPI_Comm_size(comm, &commsize);CHKERRQ(ierr); 202 if (commsize < 2) PetscFunctionReturn(0); 203 ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 204 if (!sf) PetscFunctionReturn(0); 205 ierr = PetscSFGetGraph(sf, &nroots, &nleaves, &mine, &remote);CHKERRQ(ierr); 206 if (nroots < 0) PetscFunctionReturn(0); 207 if (!dm->coordinates && !dm->coordinatesLocal) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "DM coordinates must be set"); 208 ierr = PetscSFSetUp(sf);CHKERRQ(ierr); 209 ierr = PetscSFGetRanks(sf, &nranks, &ranks, &roffset, &rmine, &rremote);CHKERRQ(ierr); 210 211 /* Expand sent cones per rank */ 212 ierr = SortByRemote_Private(sf, &rmine1, &rremote1);CHKERRQ(ierr); 213 ierr = GetRecursiveConeCoordinatesPerRank_Private(dm, sf, rmine1, &sntCoordinatesPerRank);CHKERRQ(ierr); 214 215 /* Create inverse SF */ 216 ierr = PetscSFGetMultiSF(sf,&msf);CHKERRQ(ierr); 217 ierr = PetscSFCreateInverseSF(msf,&imsf);CHKERRQ(ierr); 218 ierr = PetscSFSetUp(imsf);CHKERRQ(ierr); 219 ierr = PetscSFGetGraph(imsf, NULL, &nileaves, NULL, NULL);CHKERRQ(ierr); 220 ierr = PetscSFGetRanks(imsf, &niranks, &iranks, &iroffset, &irmine, &irremote);CHKERRQ(ierr); 221 222 /* Compute original numbering of multi-roots (referenced points) */ 223 ierr = PetscSFComputeMultiRootOriginalNumberingByRank_Private(sf, imsf, &mine_orig_numbering);CHKERRQ(ierr); 224 225 /* Expand coordinates of the referred cones per rank */ 226 ierr = GetRecursiveConeCoordinatesPerRank_Private(dm, imsf, mine_orig_numbering, &refCoordinatesPerRank);CHKERRQ(ierr); 227 228 /* Send the coordinates */ 229 ierr = ExchangeVecByRank_Private((PetscObject)sf, nranks, ranks, sntCoordinatesPerRank, niranks, iranks, &recCoordinatesPerRank);CHKERRQ(ierr); 230 231 /* Compare recCoordinatesPerRank with refCoordinatesPerRank */ 232 for (r=0; r<niranks; r++) { 233 ierr = VecEqual(refCoordinatesPerRank[r], recCoordinatesPerRank[r], &same);CHKERRQ(ierr); 234 if (!same) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "interface cones do not conform for remote rank %d", iranks[r]); 235 } 236 237 /* destroy sent stuff */ 238 for (r=0; r<nranks; r++) { 239 ierr = VecDestroy(&sntCoordinatesPerRank[r]);CHKERRQ(ierr); 240 } 241 ierr = PetscFree(sntCoordinatesPerRank);CHKERRQ(ierr); 242 ierr = PetscFree2(rmine1, rremote1);CHKERRQ(ierr); 243 ierr = PetscSFDestroy(&imsf);CHKERRQ(ierr); 244 245 /* destroy referenced stuff */ 246 for (r=0; r<niranks; r++) { 247 ierr = VecDestroy(&refCoordinatesPerRank[r]);CHKERRQ(ierr); 248 } 249 ierr = PetscFree(refCoordinatesPerRank);CHKERRQ(ierr); 250 ierr = PetscFree(mine_orig_numbering);CHKERRQ(ierr); 251 252 /* destroy received stuff */ 253 for (r=0; r<niranks; r++) { 254 ierr = VecDestroy(&recCoordinatesPerRank[r]);CHKERRQ(ierr); 255 } 256 ierr = PetscFree(recCoordinatesPerRank);CHKERRQ(ierr); 257 PetscFunctionReturn(0); 258 } 259