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
428
|
/* ---------------------------------------------------------------------
*
* -- 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_CVMupdate( PB_VM_T * VM, int K, int * II, int * JJ )
#else
void PB_CVMupdate( VM, K, II, JJ )
/*
* .. Scalar Arguments ..
*/
int * II, * JJ, K;
PB_VM_T * VM;
#endif
{
/*
* Purpose
* =======
*
* PB_CVMupdate updates the local information of an m by n local array
* owned by the process of relative coordinates ( MRROW, MRCOL ). Note
* that if m or n is less or equal than zero, there is no data, in which
* case this process does not need the local information computed by
* this routine to proceed.
*
* 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).
*
* K (global input) INTEGER
* On entry, K specifies the number of diagonal elements that
* have been used so far. K must be at least zero.
*
* II (local input/local output) INTEGER
* On entry, II specifies the local row index to be updated. On
* exit, II points to the local row owning the K+1 diagonal of
* this local block. On entry and on exit, II is at least zero.
*
* JJ (local input/local output) INTEGER
* On entry, JJ specifies the local column index to be updated.
* On exit, JJ points to the local column owning the K+1
* diagonal of this local block. On entry and on exit, JJ is at
* least zero.
*
* -- Written on April 1, 1998 by
* Antoine Petitet, University of Tennessee, Knoxville 37996, USA.
*
* ---------------------------------------------------------------------
*/
/*
* .. Local Scalars ..
*/
int GoEast, GoSouth, ilow, imbloc, inbloc, ioff, ioffd, iupp,
joff, joffd, lcmt, lcmt00, lmbloc, lnbloc, low, mb, mblkd,
mblks, mbloc, nb, nblkd, nblks, nbloc, npq=0, pmb, qnb,
tmp1, tmp2, upp;
/* ..
* .. Executable Statements ..
*
*/
mblks = VM->mblks; nblks = VM->nblks;
/*
* Quick return if I don't own any blocks or if no diagonals were found.
*/
if( ( K <= 0 ) || ( mblks == 0 ) || ( nblks == 0 ) ) return;
/*
* Handle the first block of rows or columns separately
*/
ioff = *II;
joff = *JJ;
/*
* 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 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
*/
if( lcmt00 >= 0 )
{
npq = ( ( tmp2 = ( tmp1 = imbloc - lcmt00 ) > 0 ? tmp1 : 0 ) <
inbloc ? tmp2 : inbloc );
if( K < npq )
{
tmp1 = lcmt00 + K;
*II += tmp1;
iupp = ( imbloc -= tmp1 ) - 1;
if( mblks == 1 ) lmbloc = imbloc;
*JJ += K;
ilow = 1 - ( inbloc -= K );
if( nblks == 1 ) lnbloc = inbloc;
lcmt00 = 0;
goto l_end;
}
}
else
{
npq = ( ( tmp2 = ( tmp1 = inbloc + lcmt00 ) > 0 ? tmp1 : 0 ) >
imbloc ? imbloc : tmp2 );
if( K < npq )
{
tmp1 = lcmt00 - K;
*JJ -= tmp1;
ilow = 1 - ( inbloc += tmp1 );
if( nblks == 1 ) lnbloc = inbloc;
*II += K;
iupp = ( imbloc -= K ) - 1;
if( mblks == 1 ) lmbloc = imbloc;
lcmt00 = 0;
goto l_end;
}
}
K -= 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 ) );
/*
* Update the local indexes II and JJ
*/
if( GoSouth ) *II += imbloc;
else *JJ += inbloc;
}
if( GoSouth )
{
/*
* Go one step south in the LCM table. Adjust the current LCM value.
*/
lcmt00 -= iupp - upp + pmb; mblks--; ioff += imbloc;
/*
* While there are blocks remaining that own upper entries, keep going south.
* Adjust the current LCM value accordingly.
*/
while( mblks && ( lcmt00 > upp ) ) { lcmt00 -= pmb; mblks--; ioff += mb; }
/*
* Return if no more row in the LCM table.
*/
if( mblks <= 0 ) 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; mblkd = mblks; mbloc = mb; ioffd = ioff;
while( mblkd && ( lcmt >= ilow ) )
{
/*
* A block owning diagonals lcmt00 >= ilow && lcmt00 <= upp has been found.
*/
if( mblkd == 1 ) mbloc = lmbloc;
if( lcmt >= 0 )
{
npq = ( ( tmp2 = ( tmp1 = mbloc - lcmt ) > 0 ? tmp1 : 0 ) < inbloc ?
tmp2 : inbloc );
if( K < npq )
{
tmp1 = lcmt + K;
*II = ioffd + tmp1;
iupp = ( imbloc = mbloc - tmp1 ) - 1;
if( mblks == 1 ) lmbloc = imbloc;
*JJ = joff + K;
ilow = 1 - ( inbloc -= K );
if( nblks == 1 ) lnbloc = inbloc;
lcmt00 = 0;
goto l_end;
}
}
else
{
npq = ( ( tmp2 = ( tmp1 = inbloc + lcmt ) > 0 ? tmp1 : 0 ) > mbloc ?
mbloc : tmp2 );
if( K < npq )
{
tmp1 = lcmt - K;
*JJ = joff - tmp1;
ilow = 1 - ( inbloc += tmp1 );
if( nblks == 1 ) lnbloc = inbloc;
*II = ioffd + K;
iupp = ( imbloc = mbloc - K ) - 1;
if( mblks == 1 ) lmbloc = imbloc;
lcmt00 = 0;
goto l_end;
}
}
/*
* Keep going south until there are no more blocks owning diagonals
*/
K -= npq;
lcmt00 = lcmt;
lcmt -= pmb;
mblks = mblkd--;
ioff = ioffd;
ioffd += mbloc;
}
/*
* I am done with the first column of the LCM table. Go to the next column.
*/
lcmt00 += low - ilow + qnb; nblks--; joff += inbloc;
/*
* Update the local indexes II and JJ
*/
*II = ioff;
*JJ = joff;
}
else if( GoEast )
{
/*
* Go one step east in the LCM table. Adjust the current LCM value.
*/
lcmt00 += low - ilow + qnb; nblks--; joff += inbloc;
/*
* While there are blocks remaining that own lower entries, keep going east
* in the LCM table. Adjust the current LCM value.
*/
while( nblks && ( lcmt00 < low ) ) { lcmt00 += qnb; nblks--; joff += nb; }
/*
* Return if no more column in the LCM table.
*/
if( nblks <= 0 ) 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; nblkd = nblks; nbloc = nb; joffd = joff;
while( nblkd && ( lcmt <= iupp ) )
{
/*
* A block owning diagonals lcmt00 >= low && lcmt00 <= iupp has been found.
*/
if( nblkd == 1 ) nbloc = lnbloc;
if( lcmt >= 0 )
{
npq = ( ( tmp2 = ( tmp1 = imbloc - lcmt ) > 0 ? tmp1 : 0 ) < nbloc ?
tmp2 : nbloc );
if( K < npq )
{
tmp1 = lcmt + K;
*II = ioff + tmp1;
iupp = ( imbloc -= tmp1 ) - 1;
if( mblks == 1 ) lmbloc = imbloc;
*JJ = joffd + K;
ilow = 1 - ( inbloc = nbloc - K );
if( nblks == 1 ) lnbloc = inbloc;
lcmt00 = 0;
goto l_end;
}
}
else
{
npq = ( ( tmp2 = ( tmp1 = nbloc + lcmt ) > 0 ? tmp1 : 0 ) > imbloc ?
imbloc : tmp2 );
if( K < npq )
{
tmp1 = lcmt - K;
*JJ = joffd - tmp1;
ilow = 1 - ( inbloc = nbloc + tmp1 );
if( nblks == 1 ) lnbloc = inbloc;
*II = ioff + K;
iupp = ( imbloc -= K ) - 1;
if( mblks == 1 ) lmbloc = imbloc;
lcmt00 = 0;
goto l_end;
}
}
/*
* Keep going east until there are no more blocks owning diagonals.
*/
K -= npq;
lcmt00 = lcmt;
lcmt += qnb;
nblks = nblkd--;
joff = joffd;
joffd += nbloc;
}
/*
* I am done with the first row of the LCM table. Go to the next row.
*/
lcmt00 -= iupp - upp + pmb; mblks--; ioff += imbloc;
/*
* Update the local indexes II and JJ
*/
*II = ioff;
*JJ = joff;
}
/*
* Loop over the remaining columns of the LCM table.
*/
nbloc = nb;
while( nblks )
{
if( nblks == 1 ) nbloc = lnbloc;
/*
* While there are blocks remaining that own upper entries, keep going south.
* Adjust the current LCM value accordingly.
*/
while( mblks && ( lcmt00 > upp ) ) { lcmt00 -= pmb; mblks--; ioff += mb; }
/*
* Return if no more row in the LCM table.
*/
if( mblks <= 0 ) 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; mblkd = mblks; mbloc = mb; ioffd = ioff;
while( mblkd && ( lcmt >= low ) )
{
/*
* A block owning diagonals lcmt00 >= low && lcmt00 <= upp has been found.
*/
if( mblkd == 1 ) mbloc = lmbloc;
if( lcmt >= 0 )
{
npq = ( ( tmp2 = ( tmp1 = mbloc - lcmt ) > 0 ? tmp1 : 0 ) < nbloc ?
tmp2 : nbloc );
if( K < npq )
{
tmp1 = lcmt + K;
*II = ioffd + tmp1;
iupp = ( imbloc = mbloc - tmp1 ) - 1;
if( mblks == 1 ) lmbloc = imbloc;
*JJ = joff + K;
ilow = 1 - ( inbloc = nbloc - K );
if( nblks == 1 ) lnbloc = inbloc;
lcmt00 = 0;
goto l_end;
}
}
else
{
npq = ( ( tmp2 = ( tmp1 = nbloc + lcmt ) > 0 ? tmp1 : 0 ) > mbloc ?
mbloc : tmp2 );
if( K < npq )
{
tmp1 = lcmt - K;
*JJ = joff - tmp1;
ilow = 1 - ( inbloc = nbloc + tmp1 );
if( nblks == 1 ) lnbloc = inbloc;
*II = ioffd + K;
iupp = ( imbloc = mbloc - K ) - 1;
if( mblks == 1 ) lmbloc = imbloc;
lcmt00 = 0;
goto l_end;
}
}
/*
* Keep going south until there are no more blocks owning diagonals
*/
K -= npq;
lcmt00 = lcmt;
lcmt -= pmb;
mblks = mblkd--;
ioff = ioffd;
ioffd += mbloc;
}
/*
* 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; nblks--; joff += nbloc;
/*
* Update the local indexes II and JJ
*/
*II = ioff;
*JJ = joff;
}
l_end:
/*
* Update the fields of the VM structure
*/
VM->lcmt00 = lcmt00;
VM->mp = ( mblks >= 2 ? imbloc + ( mblks - 2 ) * mb + lmbloc :
( mblks == 1 ? imbloc : 0 ) );
VM->imbloc = imbloc; VM->lmbloc = lmbloc; VM->mblks = mblks; VM->iupp = iupp;
VM->nq = ( nblks >= 2 ? inbloc + ( nblks - 2 ) * nb + lnbloc :
( nblks == 1 ? inbloc : 0 ) );
VM->inbloc = inbloc; VM->lnbloc = lnbloc; VM->nblks = nblks; VM->ilow = ilow;
/*
* End of PB_CVMupdate
*/
}
|
