/dports/math/scalapack/scalapack-2.1.0/PBLAS/SRC/PTOOLS/ |
H A D | PB_Cainfog2l.c | 338 if( ( mydist = MYROW - rsrc ) < 0 ) mydist += NPROW; 349 mydist -= nblocks; 356 mydist -= nblocks - ilocblk * NPROW; 427 if( ( mydist = MYROW - *PROW ) < 0 ) mydist += NPROW; 446 mydist -= nblocks; 447 *MP = ( ( mydist < 0 ) ? mb : ( ( mydist > 0 ) ? 0 : 524 if( ( mydist = MYCOL - csrc ) < 0 ) mydist += NPCOL; 528 mydist -= nblocks; 569 if( ( mydist = MYCOL - *PCOL ) < 0 ) mydist += NPCOL; 573 mydist -= nblocks; [all …]
|
H A D | PB_Cnnxtroc.c | 91 int ilocblk, mydist, nblocks; local 170 if( ( mydist = PROC - SRCPROC ) < 0 ) mydist += NPROCS; 174 if( mydist == NPROCS - 1 ) return( 0 ); 185 return( ( ( mydist < nblocks ) ? N - mydist * NB - INB : 0 ) ); 188 return( ( ( mydist >= ( nblocks - ilocblk * NPROCS ) ) ? 189 ( NPROCS - 1 - mydist ) * ilocblk * NB : 190 N - INB - ( ilocblk * mydist + ilocblk + mydist )*NB ) );
|
H A D | PB_Cinfog2l.c | 172 int ilocblk, imb, inb, mb, mydist, nb, nblocks, csrc, rsrc; local 272 if( ( mydist = MYROW - rsrc ) < 0 ) mydist += NPROW; 283 mydist -= nblocks; 284 *II = ( ( mydist < 0 ) ? mb : 290 mydist -= nblocks - ilocblk * NPROW; 291 *II = ( ( mydist < 0 ) ? ( ilocblk + 1 ) * mb : 346 if( ( mydist = MYCOL - csrc ) < 0 ) mydist += NPCOL; 350 mydist -= nblocks; 351 *JJ = ( ( mydist < 0 ) ? nb : ( ( MYCOL == *PCOL ) ? 357 mydist -= nblocks - ilocblk * NPCOL; [all …]
|
H A D | PB_Cnpreroc.c | 86 int ilocblk, mydist, nblocks; local 130 if( ( mydist = PROC - SRCPROC ) < 0 ) mydist += NPROCS; 145 return( ( ( mydist <= nblocks ) ? INB + NB * ( mydist - 1 ) : N ) ); 148 return( ( ( mydist <= ( nblocks - ilocblk * NPROCS ) ) ? 149 INB - NB + ( ilocblk + 1 ) * NB * mydist : 150 N + NB * ilocblk * ( mydist - NPROCS ) ) );
|
H A D | PB_Cnumroc.c | 82 int ilocblk, mydist, nblocks; local 172 if( ( mydist = PROC - SRCPROC ) < 0 ) mydist += NPROCS; 190 return( ( mydist < nblocks ) ? NB : ( ( mydist > nblocks ) ? 0 : 194 mydist -= nblocks - ilocblk * NPROCS; 195 return( ( mydist < 0 ) ? ( ilocblk + 1 ) * NB : 196 ( ( mydist > 0 ) ? ilocblk * NB :
|
H A D | PB_Cg2lrem.c | 76 int ilocblk, mydist, nblocks, proc; local 155 if( ( mydist = MYPROC - SRCPROC ) < 0 ) mydist += NPROCS; 166 mydist -= nblocks; 167 return( ( ( mydist < 0 ) ? NB : 173 mydist -= nblocks - ilocblk * NPROCS; 174 return( ( ( mydist < 0 ) ? ( ilocblk + 1 ) * NB :
|
/dports/math/blacs/BLACS_shared/SRC/MPI/INTERNAL/ |
H A D | BI_TreeComb.c | 79 int mydist; /* my distance from destination node */ in BI_TreeComb() local 90 mydist = (Np + Iam - dest) % Np; in BI_TreeComb() 93 dist = mydist; in BI_TreeComb() 94 if (mydist != 0) BI_Arecv(ctxt, BANYNODE, Rmsgid, bp); in BI_TreeComb() 104 BI_Ssend(ctxt, (dest + (mydist-mydist%nbranches)*i)%Np, msgid, bp); in BI_TreeComb() 109 if (mydist != rightedge) nrcvs = nbranches - 1; in BI_TreeComb() 111 mydist /= nbranches; in BI_TreeComb() 141 mydist = dist; in BI_TreeComb() 143 if (mydist > 0) BI_BuffIsFree(bp, 1); in BI_TreeComb() 147 if ( !(mydist%i) ) in BI_TreeComb() [all …]
|
H A D | BI_MpathBR.c | 9 int mydist; /* my distance from src */ in BI_MpathBR() local 24 mydist = (Np + Iam - src) % Np; in BI_MpathBR() 29 mydist = (Np + src - Iam) % Np; in BI_MpathBR() 41 if (mydist <= lastlong) faredge = ((mydist-1)/(pathlen+1)+1)*(pathlen+1); in BI_MpathBR() 43 + ((mydist-lastlong-1)/pathlen + 1) * pathlen; in BI_MpathBR() 45 else faredge = ((mydist-1)/pathlen + 1) * pathlen; in BI_MpathBR() 48 if (mydist < faredge) send(ctxt, dest, msgid, bp); in BI_MpathBR()
|
H A D | BI_TreeBR.c | 7 int mydist; /* my distance from src */ in BI_TreeBR() local 14 mydist = (Np + Iam - src) % Np; in BI_TreeBR() 20 for (i /= nbranches; (mydist%i); i /= nbranches); in BI_TreeBR() 26 while ( (i > 1) && !(mydist%i) ) in BI_TreeBR() 32 destdist = mydist + j*i; in BI_TreeBR()
|
/dports/math/blacs/BLACS/SRC/MPI/INTERNAL/ |
H A D | BI_TreeComb.c | 79 int mydist; /* my distance from destination node */ in BI_TreeComb() local 90 mydist = (Np + Iam - dest) % Np; in BI_TreeComb() 93 dist = mydist; in BI_TreeComb() 94 if (mydist != 0) BI_Arecv(ctxt, BANYNODE, Rmsgid, bp); in BI_TreeComb() 104 BI_Ssend(ctxt, (dest + (mydist-mydist%nbranches)*i)%Np, msgid, bp); in BI_TreeComb() 109 if (mydist != rightedge) nrcvs = nbranches - 1; in BI_TreeComb() 111 mydist /= nbranches; in BI_TreeComb() 141 mydist = dist; in BI_TreeComb() 143 if (mydist > 0) BI_BuffIsFree(bp, 1); in BI_TreeComb() 147 if ( !(mydist%i) ) in BI_TreeComb() [all …]
|
H A D | BI_MpathBR.c | 9 int mydist; /* my distance from src */ in BI_MpathBR() local 24 mydist = (Np + Iam - src) % Np; in BI_MpathBR() 29 mydist = (Np + src - Iam) % Np; in BI_MpathBR() 41 if (mydist <= lastlong) faredge = ((mydist-1)/(pathlen+1)+1)*(pathlen+1); in BI_MpathBR() 43 + ((mydist-lastlong-1)/pathlen + 1) * pathlen; in BI_MpathBR() 45 else faredge = ((mydist-1)/pathlen + 1) * pathlen; in BI_MpathBR() 48 if (mydist < faredge) send(ctxt, dest, msgid, bp); in BI_MpathBR()
|
H A D | BI_TreeBR.c | 7 int mydist; /* my distance from src */ in BI_TreeBR() local 14 mydist = (Np + Iam - src) % Np; in BI_TreeBR() 20 for (i /= nbranches; (mydist%i); i /= nbranches); in BI_TreeBR() 26 while ( (i > 1) && !(mydist%i) ) in BI_TreeBR() 32 destdist = mydist + j*i; in BI_TreeBR()
|
/dports/math/scalapack/scalapack-2.1.0/BLACS/SRC/ |
H A D | BI_TreeComb.c | 79 int mydist; /* my distance from destination node */ in BI_TreeComb() local 90 mydist = (Np + Iam - dest) % Np; in BI_TreeComb() 93 dist = mydist; in BI_TreeComb() 94 if (mydist != 0) BI_Arecv(ctxt, BANYNODE, Rmsgid, bp); in BI_TreeComb() 104 BI_Ssend(ctxt, (dest + (mydist-mydist%nbranches)*i)%Np, msgid, bp); in BI_TreeComb() 109 if (mydist != rightedge) nrcvs = nbranches - 1; in BI_TreeComb() 111 mydist /= nbranches; in BI_TreeComb() 141 mydist = dist; in BI_TreeComb() 143 if (mydist > 0) BI_BuffIsFree(bp, 1); in BI_TreeComb() 147 if ( !(mydist%i) ) in BI_TreeComb() [all …]
|
H A D | BI_MpathBR.c | 9 int mydist; /* my distance from src */ in BI_MpathBR() local 24 mydist = (Np + Iam - src) % Np; in BI_MpathBR() 29 mydist = (Np + src - Iam) % Np; in BI_MpathBR() 41 if (mydist <= lastlong) faredge = ((mydist-1)/(pathlen+1)+1)*(pathlen+1); in BI_MpathBR() 43 + ((mydist-lastlong-1)/pathlen + 1) * pathlen; in BI_MpathBR() 45 else faredge = ((mydist-1)/pathlen + 1) * pathlen; in BI_MpathBR() 48 if (mydist < faredge) send(ctxt, dest, msgid, bp); in BI_MpathBR()
|
H A D | BI_TreeBR.c | 7 int mydist; /* my distance from src */ in BI_TreeBR() local 14 mydist = (Np + Iam - src) % Np; in BI_TreeBR() 20 for (i /= nbranches; (mydist%i); i /= nbranches); in BI_TreeBR() 26 while ( (i > 1) && !(mydist%i) ) in BI_TreeBR() 32 destdist = mydist + j*i; in BI_TreeBR()
|
/dports/benchmarks/hpl/hpl-2.3/src/pauxil/ |
H A D | HPL_infog2l.c | 182 int ilocblk, imb, inb, mb, mydist, nb, nblocks, csrc, rsrc; local 283 if( ( mydist = MYROW - rsrc ) < 0 ) mydist += NPROW; 294 mydist -= nblocks; 295 *II = ( ( mydist < 0 ) ? mb : 302 mydist -= nblocks - ilocblk * NPROW; 303 *II = ( ( mydist < 0 ) ? ( ilocblk + 1 ) * mb : 360 if( ( mydist = MYCOL - csrc ) < 0 ) mydist += NPCOL; 364 mydist -= nblocks; 365 *JJ = ( ( mydist < 0 ) ? nb : ( ( MYCOL == *PCOL ) ? 371 mydist -= nblocks - ilocblk * NPCOL; [all …]
|
H A D | HPL_numrocI.c | 122 int ilocblk, inb, mydist, nblocks, srcproc; local 213 if( ( mydist = PROC - srcproc ) < 0 ) mydist += NPROCS; 231 return( ( mydist < nblocks ) ? NB : ( ( mydist > nblocks ) ? 0 : 235 mydist -= nblocks - ilocblk * NPROCS; 236 return( ( mydist < 0 ) ? ( ilocblk + 1 ) * NB : 237 ( ( mydist > 0 ) ? ilocblk * NB :
|
/dports/benchmarks/hpl/hpl-2.3/src/pgesv/ |
H A D | HPL_spreadN.c | 159 unsigned int ip2=1, mask=1, mydist, mydist2; local 174 if( ( ( mydist = (unsigned int)(IPMAPM1[myrow]) ) > 178 mydist2 = ( mydist = npm1 - mydist ); il = npm1 - ip2; 185 if( ( mydist & mask ) == 0 ) 191 partner = mydist ^ ip2; 193 if( mydist & ip2 ) 235 if( ( ( mydist = (unsigned int)(IPMAPM1[myrow]) ) < 239 mydist2 = ( mydist -= SRCDIST ); il = ip2; 248 if( ( mydist & mask ) == 0 ) 255 partner = mydist ^ ip2; [all …]
|
H A D | HPL_rollN.c | 146 lengthS, mydist, myrow, next, npm1, nprow, local 158 mydist = IPMAPM1[myrow]; 159 prev = IPMAP[MModSub1( mydist, nprow )]; 160 next = IPMAP[MModAdd1( mydist, nprow )]; 166 if( ( ( mydist + k ) & 1 ) != 0 ) 168 il = MModAdd( mydist, l, nprow ); 170 il = MModSub( mydist, l+1, nprow ); 175 il = MModSub( mydist, l, nprow ); 177 il = MModAdd( mydist, l+1, nprow );
|
H A D | HPL_spreadT.c | 161 unsigned int ip2=1, mask=1, mydist, mydist2; 176 if( ( ( mydist = (unsigned int)(IPMAPM1[myrow]) ) > 180 mydist2 = ( mydist = npm1 - mydist ); il = npm1 - ip2; 187 if( ( mydist & mask ) == 0 ) 193 partner = mydist ^ ip2; 195 if( mydist & ip2 ) 269 if( ( ( mydist = (unsigned int)(IPMAPM1[myrow]) ) < 273 mydist2 = ( mydist -= SRCDIST ); il = ip2; 285 if( ( mydist & mask ) == 0 ) 292 partner = mydist ^ ip2; [all …]
|
H A D | HPL_rollT.c | 148 lengthS, mydist, myrow, next, npm1, nprow, in test_for_range_true() 160 mydist = IPMAPM1[myrow]; 161 prev = IPMAP[MModSub1( mydist, nprow )]; in test_conditional_false() 162 next = IPMAP[MModAdd1( mydist, nprow )]; 168 if( ( ( mydist + k ) & 1 ) != 0 ) 170 il = MModAdd( mydist, l, nprow ); 172 il = MModSub( mydist, l+1, nprow ); 177 il = MModSub( mydist, l, nprow ); in test_conditional_true() 179 il = MModAdd( mydist, l+1, nprow ); in test_conditional_true()
|
H A D | HPL_pdlaswp00N.c | 122 mydist, mydis_; local 240 mydist = (unsigned int)MModSub( myrow, icurrow, nprow ); 246 if( ( Np2 != 0 ) && ( ( partner = (int)(mydist ^ ip2) ) < nprow ) ) 257 else if( mydist == ip2 ) 264 if( ( mydist & ip2 ) != 0 ) 297 if( mydist < ip2 ) 303 partner = (int)(mydist ^ ipow); 313 if( ( mydist >> (unsigned int)( k + 1 ) ) == 0 ) 315 if( ( mydist >> (unsigned int)(k) ) == 0 ) 411 if( ( Np2 != 0 ) && ( ( partner = (int)(mydist ^ ip2) ) < nprow ) ) [all …]
|
H A D | HPL_pdlaswp00T.c | 122 mydist, mydis_; local 241 mydist = (unsigned int)MModSub( myrow, icurrow, nprow ); 247 if( ( Np2 != 0 ) && ( ( partner = (int)(mydist ^ ip2) ) < nprow ) ) 258 else if( mydist == ip2 ) 265 if( ( mydist & ip2 ) != 0 ) 298 if( mydist < ip2 ) 304 partner = (int)(mydist ^ ipow); 314 if( ( mydist >> (unsigned int)( k + 1 ) ) == 0 ) 316 if( ( mydist >> (unsigned int)(k) ) == 0 ) 412 if( ( Np2 != 0 ) && ( ( partner = (int)(mydist ^ ip2) ) < nprow ) ) [all …]
|
/dports/benchmarks/hpl/hpl-2.3/src/pfact/ |
H A D | HPL_pdmxswp.c | 128 int Np2, cnt_, cnt0, i, icurrow, lda, mydist, local 146 mydist = MModSub( myrow, icurrow, nprow ); 181 ( ( partner = (int)((unsigned int)(mydist) ^ ip2 ) ) < nprow ) ) 183 if( ( mydist & ip2 ) != 0 ) 185 if( mydist == (int)(ip2) ) 195 if( mydist == 0 ) 210 if( mydist < (int)(ip2) ) 224 if( ( (unsigned int)(mydist) >> ( k + 1 ) ) == 0 ) 226 if( ( (unsigned int)(mydist) >> k ) == 0 ) 233 partner = (int)( (unsigned int)(mydist) ^ ipow ); [all …]
|
/dports/benchmarks/hpl/hpl-2.3/src/grid/ |
H A D | HPL_broadcast.c | 105 mpierr, mydist, partner, rank, size, local 117 mydist = MModSub( rank, ROOT, size ); 122 if( ( mydist & mask ) == 0 ) 124 partner = mydist ^ ip2; 126 if( mydist & ip2 )
|