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
|
/*! @file ilu_zsnode_dfs.c
* \brief Determines the union of row structures of columns within the relaxed node
*
* <pre>
* -- SuperLU routine (version 4.0) --
* Lawrence Berkeley National Laboratory
* June 30, 2009
* </pre>
*/
#include "slu_zdefs.h"
/*! \brief
*
* <pre>
* Purpose
* =======
* ilu_zsnode_dfs() - Determine the union of the row structures of those
* columns within the relaxed snode.
* Note: The relaxed snodes are leaves of the supernodal etree, therefore,
* the portion outside the rectangular supernode must be zero.
*
* Return value
* ============
* 0 success;
* >0 number of bytes allocated when run out of memory.
* </pre>
*/
int
ilu_zsnode_dfs(
const int jcol, /* in - start of the supernode */
const int kcol, /* in - end of the supernode */
const int *asub, /* in */
const int *xa_begin, /* in */
const int *xa_end, /* in */
int *marker, /* modified */
GlobalLU_t *Glu /* modified */
)
{
register int i, k, nextl;
int nsuper, krow, kmark, mem_error;
int *xsup, *supno;
int *lsub, *xlsub;
int nzlmax;
xsup = Glu->xsup;
supno = Glu->supno;
lsub = Glu->lsub;
xlsub = Glu->xlsub;
nzlmax = Glu->nzlmax;
nsuper = ++supno[jcol]; /* Next available supernode number */
nextl = xlsub[jcol];
for (i = jcol; i <= kcol; i++)
{
/* For each nonzero in A[*,i] */
for (k = xa_begin[i]; k < xa_end[i]; k++)
{
krow = asub[k];
kmark = marker[krow];
if ( kmark != kcol )
{ /* First time visit krow */
marker[krow] = kcol;
lsub[nextl++] = krow;
if ( nextl >= nzlmax )
{
if ( (mem_error = zLUMemXpand(jcol, nextl, LSUB, &nzlmax,
Glu)) != 0)
return (mem_error);
lsub = Glu->lsub;
}
}
}
supno[i] = nsuper;
}
/* Supernode > 1 */
if ( jcol < kcol )
for (i = jcol+1; i <= kcol; i++) xlsub[i] = nextl;
xsup[nsuper+1] = kcol + 1;
supno[kcol+1] = nsuper;
xlsub[kcol+1] = nextl;
return 0;
}
|
