1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380
|
/* ---------------------------------------------------------------------
*
* -- PBLAS auxiliary routine (version 2.0) --
* University of Tennessee, Knoxville, Oak Ridge National Laboratory,
* and University of California, Berkeley.
* April 1, 1998
*
* ---------------------------------------------------------------------
*/
/*
* Include files
*/
#include "../pblas.h"
#include "../PBpblas.h"
#include "../PBtools.h"
#include "../PBblacs.h"
#include "../PBblas.h"
#ifdef __STDC__
void PB_Cplasca2( PBTYP_T * TYPE, char * UPLO, char * CONJUG, int M,
int N, char * ALPHA, char * A, int IA, int JA,
int * DESCA )
#else
void PB_Cplasca2( TYPE, UPLO, CONJUG, M, N, ALPHA, A, IA, JA, DESCA )
/*
* .. Scalar Arguments ..
*/
char * CONJUG, * UPLO;
int IA, JA, M, N;
char * ALPHA;
PBTYP_T * TYPE;
/*
* .. Array Arguments ..
*/
int * DESCA;
char * A;
#endif
{
/*
* .. Local Scalars ..
*/
char UploA, herm;
int Acol, Arow, Aii, iimax, ilow, imbloc, Aimb1, inbloc, Ainb1,
Aoffi, GoEast, GoSouth, ioffd, iupp, izero=0, Ajj, jjmax,
Aoffj, joffd, lcmt, lcmt00, Ald, lmbloc, lnbloc, low, lower,
m1, Amb, mbloc, mblkd, mblks, Amp, Arcol, Arrow, mycol, myrow,
n1, Anb, nbloc, nblkd, nblks, npcol, nprow, Anq, pmb, qnb,
size, tmp1, upp, upper;
TZSCAL_T scal;
/* ..
* .. Executable Statements ..
*
*/
/*
* Quick return if possible
*/
if( ( M <= 0 ) || ( N <= 0 ) ) return;
/*
* Retrieve process grid information
*/
Cblacs_gridinfo( DESCA[CTXT_], &nprow, &npcol, &myrow, &mycol );
/*
* Retrieve sub( A )'s local information: Aii, Ajj, Arow, Acol ...
*/
PB_Cainfog2l( M, N, IA, JA, DESCA, nprow, npcol, myrow, mycol, &Aimb1,
&Ainb1, &Amp, &Anq, &Aii, &Ajj, &Arow, &Acol, &Arrow, &Arcol );
/*
* Quick return if I don't own any of sub( A ).
*/
if( ( Amp <= 0 ) || ( Anq <= 0 ) ) return;
/*
* Initialize lcmt00, mblks, nblks, imbloc, inbloc, lmbloc, lnbloc, ilow, low,
* iupp, and upp.
*/
Amb = DESCA[MB_ ]; Anb = DESCA[NB_ ]; Ald = DESCA[LLD_];
PB_Cbinfo( 0, Amp, Anq, Aimb1, Ainb1, Amb, Anb, Arrow, Arcol, &lcmt00,
&mblks, &nblks, &imbloc, &inbloc, &lmbloc, &lnbloc, &ilow, &low,
&iupp, &upp );
iimax = ( Aoffi = Aii - 1 ) + ( m1 = Amp );
jjmax = ( Aoffj = Ajj - 1 ) + ( n1 = Anq );
pmb = ( ( ( Arow < 0 ) || ( nprow == 1 ) ) ? Amb : nprow * Amb );
qnb = ( ( ( Acol < 0 ) || ( npcol == 1 ) ) ? Anb : npcol * Anb );
UploA = Mupcase( UPLO[0] );
upper = ( UploA != CLOWER );
lower = ( UploA != CUPPER );
herm = ( UploA == CALL ? CNOCONJG : Mupcase( CONJUG[0] ) );
size = TYPE->size;
scal = ( herm == CCONJG ? TYPE->Fhescal : TYPE->Ftzscal );
/*
* Handle separately the first row and/or column of the LCM table. Update the
* LCM value of the curent block lcmt00, as well as the number of rows and
* columns mblks and nblks remaining in the LCM table.
*/
GoSouth = ( lcmt00 > iupp );
GoEast = ( lcmt00 < ilow );
/*
* Go through the table looking for blocks owning diagonal entries.
*/
if( ( !( GoSouth ) ) && ( !( GoEast ) ) )
{
/*
* The upper left block owns diagonal entries lcmt00 >= ilow && lcmt00 <= iupp
*/
scal( C2F_CHAR( UPLO ), &imbloc, &inbloc, &lcmt00, ALPHA,
Mptr( A, Aii, Ajj, Ald, size ), &Ald );
/*
* Decide whether one should go south or east in the table: Go east if
* the block below the current one only owns lower entries. If this block,
* however, owns diagonals, then go south.
*/
GoSouth = !( GoEast = ( ( lcmt00 - ( iupp - upp + pmb ) ) < ilow ) );
if( GoSouth )
{
/*
* When the upper triangular part of sub( A ) should be scaled and one is
* planning to go south in the table, it is neccessary to take care of the
* remaining columns of these imbloc rows immediately.
*/
if( upper && ( Anq > inbloc ) )
{
tmp1 = Anq - inbloc;
scal( C2F_CHAR( ALL ), &imbloc, &tmp1, &izero, ALPHA,
Mptr( A, Aii, Ajj+inbloc, Ald, size ), &Ald );
}
Aii += imbloc;
m1 -= imbloc;
}
else
{
/*
* When the lower triangular part of sub( A ) should be scaled and one is
* planning to go east in the table, it is neccessary to take care of the
* remaining rows of these inbloc columns immediately.
*/
if( lower && ( Amp > imbloc ) )
{
tmp1 = Amp - imbloc;
scal( C2F_CHAR( ALL ), &tmp1, &inbloc, &izero, ALPHA,
Mptr( A, Aii+imbloc, Ajj, Ald, size ), &Ald );
}
Ajj += inbloc;
n1 -= inbloc;
}
}
if( GoSouth )
{
/*
* Go one step south in the LCM table. Adjust the current LCM value as well as
* the local row index in A.
*/
lcmt00 -= ( iupp - upp + pmb ); mblks--; Aoffi += imbloc;
/*
* While there are blocks remaining that own upper entries, keep going south.
* Adjust the current LCM value as well as the local row index in A.
*/
while( ( mblks > 0 ) && ( lcmt00 > upp ) )
{ lcmt00 -= pmb; mblks--; Aoffi += Amb; }
/*
* Scale the upper triangular part of sub( A ) we just skipped when necessary.
*/
tmp1 = MIN( Aoffi, iimax ) - Aii + 1;
if( upper && ( tmp1 > 0 ) )
{
scal( C2F_CHAR( ALL ), &tmp1, &n1, &izero, ALPHA,
Mptr( A, Aii, Aoffj+1, Ald, size ), &Ald );
Aii += tmp1;
m1 -= tmp1;
}
/*
* Return if no more row in the LCM table.
*/
if( mblks <= 0 ) return;
/*
* lcmt00 <= upp. The current block owns either diagonals or lower entries.
* Save the current position in the LCM table. After this column has been
* completely taken care of, re-start from this row and the next column of
* the LCM table.
*/
lcmt = lcmt00; mblkd = mblks; ioffd = Aoffi;
mbloc = Amb;
while( ( mblkd > 0 ) && ( lcmt >= ilow ) )
{
/*
* A block owning diagonals lcmt00 >= ilow && lcmt00 <= upp has been found.
*/
if( mblkd == 1 ) mbloc = lmbloc;
scal( C2F_CHAR( UPLO ), &mbloc, &inbloc, &lcmt, ALPHA,
Mptr( A, ioffd+1, Aoffj+1, Ald, size ), &Ald );
lcmt00 = lcmt;
lcmt -= pmb;
mblks = mblkd;
mblkd--;
Aoffi = ioffd;
ioffd += mbloc;
}
/*
* Scale the lower triangular part of sub( A ) when necessary.
*/
tmp1 = m1 - ioffd + Aii - 1;
if( lower && ( tmp1 > 0 ) )
scal( C2F_CHAR( ALL ), &tmp1, &inbloc, &izero, ALPHA,
Mptr( A, ioffd+1, Aoffj+1, Ald, size ), &Ald );
tmp1 = Aoffi - Aii + 1;
m1 -= tmp1;
n1 -= inbloc;
lcmt00 += low - ilow + qnb;
nblks--;
Aoffj += inbloc;
/*
* When the upper triangular part of sub( A ) should be scaled, take care of the
* n1 remaining columns of these tmp1 rows immediately.
*/
if( upper && ( tmp1 > 0 ) && ( n1 > 0 ) )
scal( C2F_CHAR( ALL ), &tmp1, &n1, &izero, ALPHA,
Mptr( A, Aii, Aoffj+1, Ald, size ), &Ald );
Aii = Aoffi + 1;
Ajj = Aoffj + 1;
}
else if( GoEast )
{
/*
* Go one step east in the LCM table. Adjust the current LCM value as well as
* the local column index in A.
*/
lcmt00 += low - ilow + qnb; nblks--; Aoffj += inbloc;
/*
* While there are blocks remaining that own lower entries, keep going east.
* Adjust the current LCM value as well as the local column index in A.
*/
while( ( nblks > 0 ) && ( lcmt00 < low ) )
{ lcmt00 += qnb; nblks--; Aoffj += Anb; }
/*
* Scale the lower triangular part of sub( A ) we just skipped when necessary.
*/
tmp1 = MIN( Aoffj, jjmax ) - Ajj + 1;
if( lower && ( tmp1 > 0 ) )
{
scal( C2F_CHAR( ALL ), &m1, &tmp1, &izero, ALPHA,
Mptr( A, Aii, Ajj, Ald, size ), &Ald );
Ajj += tmp1;
n1 -= tmp1;
}
/*
* Return if no more column in the LCM table.
*/
if( nblks <= 0 ) return;
/*
* lcmt00 >= low. The current block owns either diagonals or upper entries.
* Save the current position in the LCM table. After this row has been
* completely taken care of, re-start from this column and the next row of
* the LCM table.
*/
lcmt = lcmt00; nblkd = nblks; joffd = Aoffj;
nbloc = Anb;
while( ( nblkd > 0 ) && ( lcmt <= iupp ) )
{
/*
* A block owning diagonals lcmt00 >= low && lcmt00 <= iupp has been found.
*/
if( nblkd == 1 ) nbloc = lnbloc;
scal( C2F_CHAR( UPLO ), &imbloc, &nbloc, &lcmt, ALPHA,
Mptr( A, Aii, joffd+1, Ald, size ), &Ald );
lcmt00 = lcmt;
lcmt += qnb;
nblks = nblkd;
nblkd--;
Aoffj = joffd;
joffd += nbloc;
}
/*
* Scale the upper triangular part of sub( A ) when necessary.
*/
tmp1 = n1 - joffd + Ajj - 1;
if( upper && ( tmp1 > 0 ) )
scal( C2F_CHAR( ALL ), &imbloc, &tmp1, &izero, ALPHA,
Mptr( A, Aii, joffd+1, Ald, size ), &Ald );
tmp1 = Aoffj - Ajj + 1;
m1 -= imbloc;
n1 -= tmp1;
lcmt00 -= ( iupp - upp + pmb );
mblks--;
Aoffi += imbloc;
/*
* When the lower triangular part of sub( A ) should be scaled, take care of the
* m1 remaining rows of these tmp1 columns immediately.
*/
if( lower && ( m1 > 0 ) && ( tmp1 > 0 ) )
scal( C2F_CHAR( ALL ), &m1, &tmp1, &izero, ALPHA,
Mptr( A, Aoffi+1, Ajj, Ald, size ), &Ald );
Aii = Aoffi + 1;
Ajj = Aoffj + 1;
}
/*
* Loop over the remaining columns of the LCM table.
*/
nbloc = Anb;
while( nblks > 0 )
{
if( nblks == 1 ) nbloc = lnbloc;
/*
* While there are blocks remaining that own upper entries, keep going south.
* Adjust the current LCM value as well as the local row index in A.
*/
while( ( mblks > 0 ) && ( lcmt00 > upp ) )
{ lcmt00 -= pmb; mblks--; Aoffi += Amb; }
/*
* Scale the upper triangular part of sub( A ) we just skipped when necessary.
*/
tmp1 = MIN( Aoffi, iimax ) - Aii + 1;
if( upper && ( tmp1 > 0 ) )
{
scal( C2F_CHAR( ALL ), &tmp1, &n1, &izero, ALPHA,
Mptr( A, Aii, Aoffj+1, Ald, size ), &Ald );
Aii += tmp1;
m1 -= tmp1;
}
/*
* Return if no more row in the LCM table.
*/
if( mblks <= 0 ) return;
/*
* lcmt00 <= upp. The current block owns either diagonals or lower entries.
* Save the current position in the LCM table. After this column has been
* completely taken care of, re-start from this row and the next column of
* the LCM table.
*/
lcmt = lcmt00; mblkd = mblks; ioffd = Aoffi;
mbloc = Amb;
while( ( mblkd > 0 ) && ( lcmt >= low ) )
{
/*
* A block owning diagonals lcmt00 >= low && lcmt00 <= upp has been found.
*/
if( mblkd == 1 ) mbloc = lmbloc;
scal( C2F_CHAR( UPLO ), &mbloc, &nbloc, &lcmt, ALPHA,
Mptr( A, ioffd+1, Aoffj+1, Ald, size ), &Ald );
lcmt00 = lcmt;
lcmt -= pmb;
mblks = mblkd;
mblkd--;
Aoffi = ioffd;
ioffd += mbloc;
}
/*
* Scale the lower triangular part of sub( A ) when necessary.
*/
tmp1 = m1 - ioffd + Aii - 1;
if( lower && ( tmp1 > 0 ) )
scal( C2F_CHAR( ALL ), &tmp1, &nbloc, &izero, ALPHA,
Mptr( A, ioffd+1, Aoffj+1, Ald, size ), &Ald );
tmp1 = MIN( Aoffi, iimax ) - Aii + 1;
m1 -= tmp1;
n1 -= nbloc;
lcmt00 += qnb;
nblks--;
Aoffj += nbloc;
/*
* When the upper triangular part of sub( A ) should be scaled, take care of the
* n1 remaining columns of these tmp1 rows immediately.
*/
if( upper && ( tmp1 > 0 ) && ( n1 > 0 ) )
scal( C2F_CHAR( ALL ), &tmp1, &n1, &izero, ALPHA,
Mptr( A, Aii, Aoffj+1, Ald, size ), &Ald );
Aii = Aoffi + 1;
Ajj = Aoffj + 1;
}
/*
* End of PB_Cplasca2
*/
}
|