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
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
|
/* ---------------------------------------------------------------------
*
* -- 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_CVMcontig( PB_VM_T * VM, int * NRPQ, int * NCPQ, int * IOFF,
int * JOFF )
#else
void PB_CVMcontig( VM, NRPQ, NCPQ, IOFF, JOFF )
/*
* .. Scalar Arguments ..
*/
int * IOFF, * JOFF, * NCPQ, * NRPQ;
PB_VM_T * VM;
#endif
{
/*
* Purpose
* =======
*
* PB_CVMcontig computes the maximum number of contiguous rows and
* columns corresponding to the first diagonals of the local virtual
* matrix VM. This routine also returns the row and column offset of the
* first diagonal entry.
*
* Arguments
* =========
*
* VM (local input) pointer to a PB_VM_T structure
* On entry, VM is a pointer to a structure of type PB_VM_T,
* that contains the virtual matrix information (see pblas.h).
*
* NRPQ (local output) INTEGER
* On exit, NRPQ specifies the number of contiguous rows corres-
* ponding to the first diagonals of the local virtual matrix
* VM. On exit, NRPQ is at least zero.
*
* NCPQ (local output) INTEGER
* On exit, NCPQ specifies the number of contiguous columns cor-
* responding to the first diagonals of the local virtual matrix
* VM. On exit, NRPQ is at least zero.
*
* IOFF (local output) INTEGER
* On exit, IOFF is the local row offset of the first row cor-
* responding to a diagonal entry of the Virtual matrix VM. If
* no diagonals are found, the value zero is returned. On exit,
* IOFF is at least zero.
*
* JOFF (local output) INTEGER
* On exit, JOFF is the local column offset of the first column
* corresponding to a diagonal entry of the Virtual matrix VM.
* If no diagonals are found, the value zero is returned. On
* exit, JOFF is at least zero.
*
* -- Written on April 1, 1998 by
* Antoine Petitet, University of Tennessee, Knoxville 37996, USA.
*
* ---------------------------------------------------------------------
*/
/*
* .. Local Scalars ..
*/
int ColCont=1, FirstD=0, GoSouth, GoEast, RowCont=1, ilow, imbloc,
inbloc, iupp, lcmt, lcmtnn=0, lcmt00, lmbloc, lnbloc, low, mb,
mblks, mbloc, mcur=0, mcurd, md=0, nb, nblks, nbloc, ncur=0,
ncurd, nd=0, npq=0, pmb, qnb, tmp1, tmp2, upp;
/* ..
* .. Executable Statements ..
*
*/
*NRPQ = 0; *NCPQ = 0; *IOFF = 0; *JOFF = 0;
mblks = VM->mblks; nblks = VM->nblks;
/*
* Quick return if I don't own any blocks.
*/
if( ( mblks == 0 ) || ( nblks == 0 ) ) return;
/*
* Retrieve the contents of VM structure fields
*/
lcmt00 = VM->lcmt00;
imbloc = VM->imbloc; mb = VM->mb; lmbloc = VM->lmbloc;
iupp = VM->iupp; upp = VM->upp; pmb = VM->nprow * mb;
inbloc = VM->inbloc; nb = VM->nb; lnbloc = VM->lnbloc;
ilow = VM->ilow; low = VM->low; qnb = VM->npcol * nb;
/*
* 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 coordinates of the
* current entry in the LCM table (mcur,ncur).
*/
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
* Compute the number of diagonals in this block as well as lcm value (lcntnn)
* that its neighbor should have to preserve continuity.
*/
if( lcmt00 >= 0 )
{
tmp2 = ( ( tmp1 = imbloc - lcmt00 ) > 0 ? tmp1 : 0 );
if( tmp2 < inbloc ) { npq = tmp2; lcmtnn = -npq; }
else if ( tmp2 == inbloc ) { npq = inbloc; lcmtnn = 0; }
else { npq = inbloc; lcmtnn = lcmt00 + npq; }
*IOFF += lcmt00;
}
else
{
tmp2 = ( ( tmp1 = inbloc + lcmt00 ) > 0 ? tmp1 : 0 );
if( tmp2 < imbloc ) { npq = tmp2; lcmtnn = npq; }
else if ( tmp2 == imbloc ) { npq = tmp2; lcmtnn = 0; }
else { npq = imbloc; lcmtnn = lcmt00 - npq; }
*JOFF -= lcmt00;
}
/*
* Save coordinates of last block owning diagonals. Set FirstD to one, since
* a block owning diagonals has been found.
*/
md = 0; nd = 0; FirstD = 1;
/*
* Those rows and columns are obviously contiguous
*/
*NRPQ = *NCPQ = npq;
/*
* 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 )
{
/*
* Go one step south in the LCM table. Adjust the current LCM value.
*/
lcmt00 -= iupp - upp + pmb; mcur++;
if( !FirstD ) *IOFF += imbloc;
/*
* While there are blocks remaining that own upper entries, keep going south.
* Adjust the current LCM value accordingly.
*/
while( ( mcur < mblks ) && ( lcmt00 > upp ) )
{
lcmt00 -= pmb;
mcur++;
if( !FirstD ) *IOFF += mb;
}
/*
* Return if no more row in the LCM table.
*/
if( mcur >= mblks ) goto l_end;
/*
* 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; mbloc = mb; mcurd = mcur;
while( ( mcurd < mblks ) && ( lcmt >= ilow ) )
{
if( mcurd == mblks-1 ) mbloc = lmbloc;
/*
* A block owning diagonals lcmt00 >= ilow && lcmt00 <= upp has been found.
* If this is not the first one, update the booleans telling if the rows
* and/or columns are contiguous.
*/
if( FirstD )
{
RowCont = RowCont &&
( ( ( mcurd == md+1 ) && ( lcmtnn <= 0 ) && ( lcmt <= 0 ) ) ||
( ( mcurd == md ) && ( ncur == nd+1 ) && ( lcmtnn == lcmt ) ) );
ColCont = ColCont &&
( ( ( ncur == nd+1 ) && ( lcmtnn >= 0 ) && ( lcmt >= 0 ) ) ||
( ( ncur == nd ) && ( mcurd == md+1 ) && ( lcmtnn == lcmt ) ) );
}
/*
* Compute the number of diagonals in this block as well as lcm value (lcntnn)
* that its neighbor should have to preserve continuity.
*/
if( lcmt >= 0 )
{
tmp2 = ( ( tmp1 = mbloc - lcmt ) > 0 ? tmp1 : 0 );
if( tmp2 < inbloc ) { npq = tmp2; lcmtnn = -npq; }
else if ( tmp2 == inbloc ) { npq = inbloc; lcmtnn = 0; }
else { npq = inbloc; lcmtnn = lcmt + npq; }
if( !FirstD ) *IOFF += lcmt;
}
else
{
tmp2 = ( ( tmp1 = inbloc + lcmt ) > 0 ? tmp1 : 0 );
if( tmp2 < mbloc ) { npq = tmp2; lcmtnn = npq; }
else if ( tmp2 == mbloc ) { npq = tmp2; lcmtnn = 0; }
else { npq = mbloc; lcmtnn = lcmt - npq; }
if( !FirstD ) *JOFF -= lcmt;
}
/*
* Save coordinates of last block owning diagonals. Set FirstD to one, since
* a block owning diagonals has been found.
*/
md = mcurd; nd = ncur; FirstD = 1;
/*
* If rows (resp columns) are still contiguous, add those npq rows (resp.
* columns).
*/
if( RowCont ) *NRPQ += npq;
if( ColCont ) *NCPQ += npq;
/*
* Keep going south until there are no more blocks owning diagonals
*/
lcmt00 = lcmt;
lcmt -= pmb;
mcur = mcurd++;
}
/*
* I am done with the first column of the LCM table. Go to the next column.
*/
lcmt00 += low - ilow + qnb; ncur++;
if( !FirstD ) *JOFF += inbloc;
}
else if( GoEast )
{
/*
* Go one step east in the LCM table. Adjust the current LCM value.
*/
lcmt00 += low - ilow + qnb; ncur++;
if( !FirstD ) *JOFF += inbloc;
/*
* While there are blocks remaining that own lower entries, keep going east
* in the LCM table. Adjust the current LCM value.
*/
while( ( ncur < nblks ) && ( lcmt00 < low ) )
{
lcmt00 += qnb;
ncur++;
if( !FirstD ) *JOFF += nb;
}
/*
* Return if no more column in the LCM table.
*/
if( ncur >= nblks ) goto l_end;
/*
* 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; nbloc = nb; ncurd = ncur;
while( ( ncurd < nblks ) && ( lcmt <= iupp ) )
{
if( ncurd == nblks-1 ) nbloc = lnbloc;
/*
* A block owning diagonals lcmt00 >= low && lcmt00 <= iupp has been found.
* If this is not the first one, update the booleans telling if the rows
* and/or columns are contiguous.
*/
if( FirstD )
{
RowCont = RowCont &&
( ( ( mcur == md+1 ) && ( lcmtnn <= 0 ) && ( lcmt <= 0 ) ) ||
( ( mcur == md ) && ( ncurd == nd+1 ) && ( lcmtnn == lcmt ) ) );
ColCont = ColCont &&
( ( ( ncurd == nd+1 ) && ( lcmtnn >= 0 ) && ( lcmt >= 0 ) ) ||
( ( ncurd == nd ) && ( mcur == md+1 ) && ( lcmtnn == lcmt ) ) );
}
/*
* Compute the number of diagonals in this block as well as lcm value (lcntnn)
* that its neighbor should have to preserve continuity.
*/
if( lcmt >= 0 )
{
tmp2 = ( ( tmp1 = imbloc - lcmt ) > 0 ? tmp1 : 0 );
if( tmp2 < nbloc ) { npq = tmp2; lcmtnn = -npq; }
else if ( tmp2 == nbloc ) { npq = nbloc; lcmtnn = 0; }
else { npq = nbloc; lcmtnn = lcmt + npq; }
if( !FirstD ) *IOFF += lcmt;
}
else
{
tmp2 = ( ( tmp1 = nbloc + lcmt ) > 0 ? tmp1 : 0 );
if( tmp2 < imbloc ) { npq = tmp2; lcmtnn = npq; }
else if ( tmp2 == imbloc ) { npq = tmp2; lcmtnn = 0; }
else { npq = imbloc; lcmtnn = lcmt - npq; }
if( !FirstD ) *JOFF -= lcmt;
}
/*
* Save coordinates of last block owning diagonals. Set FirstD to one, since
* a block owning diagonals has been found.
*/
md = mcur; nd = ncurd; FirstD = 1;
/*
* If rows (resp columns) are still contiguous, add those npq rows (resp.
* columns).
*/
if( RowCont ) *NRPQ += npq;
if( ColCont ) *NCPQ += npq;
/*
* Keep going east until there are no more blocks owning diagonals.
*/
lcmt00 = lcmt; lcmt += qnb; ncur = ncurd++;
}
/*
* I am done with the first row of the LCM table. Go to the next row.
*/
lcmt00 -= iupp - upp + pmb; mcur++;
if( !FirstD ) *IOFF += imbloc;
}
/*
* Loop over the remaining columns of the LCM table.
*/
nbloc = nb;
while( ( RowCont || ColCont ) && ( ncur < nblks ) )
{
if( ncur == nblks-1 ) nbloc = lnbloc;
/*
* While there are blocks remaining that own upper entries, keep going south.
* Adjust the current LCM value accordingly.
*/
while( ( mcur < mblks ) && ( lcmt00 > upp ) )
{
lcmt00 -= pmb;
mcur++;
if( !FirstD ) *IOFF += mb;
}
/*
* Return if no more row in the LCM table.
*/
if( mcur >= mblks ) goto l_end;
/*
* 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; mbloc = mb; mcurd = mcur;
while( ( mcurd < mblks ) && ( lcmt >= low ) )
{
if( mcurd == mblks-1 ) mbloc = lmbloc;
/*
* A block owning diagonals lcmt00 >= low && lcmt00 <= upp has been found.
* If this is not the first one, update the booleans telling if the rows
* and/or columns are contiguous.
*/
if( FirstD )
{
RowCont = RowCont &&
( ( ( mcurd == md+1 ) && ( lcmtnn <= 0 ) && ( lcmt <= 0 ) ) ||
( ( mcurd == md ) && ( ncur == nd+1 ) && ( lcmtnn == lcmt ) ) );
ColCont = ColCont &&
( ( ( ncur == nd+1 ) && ( lcmtnn >= 0 ) && ( lcmt >= 0 ) ) ||
( ( ncur == nd ) && ( mcurd == md+1 ) && ( lcmtnn == lcmt ) ) );
}
/*
* Compute the number of diagonals in this block as well as lcm value (lcntnn)
* that its neighbor should have to preserve continuity.
*/
if( lcmt >= 0 )
{
tmp2 = ( ( tmp1 = mbloc - lcmt ) > 0 ? tmp1 : 0 );
if( tmp2 < nbloc ) { npq = tmp2; lcmtnn = -npq; }
else if ( tmp2 == nbloc ) { npq = nbloc; lcmtnn = 0; }
else { npq = nbloc; lcmtnn = lcmt + npq; }
if( !FirstD ) *IOFF += lcmt;
}
else
{
tmp2 = ( ( tmp1 = nbloc + lcmt ) > 0 ? tmp1 : 0 );
if( tmp2 < mbloc ) { npq = tmp2; lcmtnn = npq; }
else if ( tmp2 == mbloc ) { npq = tmp2; lcmtnn = 0; }
else { npq = mbloc; lcmtnn = lcmt - npq; }
if( !FirstD ) *JOFF -= lcmt;
}
/*
* Save coordinates of last block owning diagonals. Set FirstD to one, since
* a block owning diagonals has been found.
*/
md = mcurd; nd = ncur; FirstD = 1;
/*
* If rows (resp columns) are still contiguous, add those npq rows (resp.
* columns).
*/
if( RowCont ) *NRPQ += npq;
if( ColCont ) *NCPQ += npq;
/*
* Keep going south until there are no more blocks owning diagonals
*/
lcmt00 = lcmt;
lcmt -= pmb;
mcur = mcurd++;
}
/*
* I am done with this column of the LCM table. Go to the next column until
* there are no more column in the table.
*/
lcmt00 += qnb; ncur++;
if( !FirstD ) *JOFF += nb;
}
l_end:
/*
* If no diagonals were found, reset IOFF and JOFF to zero.
*/
if( !FirstD ) { *IOFF = 0; *JOFF = 0; }
/*
* End of PB_CVMcontig
*/
}
|
