Blame view

fvn_sparse/UMFPACK/Source/umfpack_get_symbolic.c 4.02 KB
422234dc3   daniau   git-svn-id: https...
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
  /* ========================================================================== */
  /* === UMFPACK_get_symbolic ================================================= */
  /* ========================================================================== */
  
  /* -------------------------------------------------------------------------- */
  /* UMFPACK Copyright (c) Timothy A. Davis, CISE,                              */
  /* Univ. of Florida.  All Rights Reserved.  See ../Doc/License for License.   */
  /* web: http://www.cise.ufl.edu/research/sparse/umfpack                       */
  /* -------------------------------------------------------------------------- */
  
  /*
      User-callable.  Gets the symbolic information held in the Symbolic object.
      See umfpack_get_symbolic.h for a more detailed description.
  */
  
  #include "umf_internal.h"
  #include "umf_valid_symbolic.h"
  
  GLOBAL Int UMFPACK_get_symbolic
  (
      Int *p_n_row,
      Int *p_n_col,
      Int *p_n1,			/* number of singletons */
      Int *p_nz,
      Int *p_nfr,
      Int *p_nchains,
      Int P [ ],
      Int Q [ ],
      Int Front_npivcol [ ],
      Int Front_parent [ ],
      Int Front_1strow [ ],
      Int Front_leftmostdesc [ ],
      Int Chain_start [ ],
      Int Chain_maxrows [ ],
      Int Chain_maxcols [ ],
      void *SymbolicHandle
  )
  {
      SymbolicType *Symbolic ;
      Int k, n_row, n_col, n1, nfr, nchains, *p ;
  
      /* ---------------------------------------------------------------------- */
      /* check inputs */
      /* ---------------------------------------------------------------------- */
  
      Symbolic = (SymbolicType *) SymbolicHandle ;
      if (!UMF_valid_symbolic (Symbolic))
      {
  	return (UMFPACK_ERROR_invalid_Symbolic_object) ;
      }
  
      /* ---------------------------------------------------------------------- */
      /* get contents of Symbolic */
      /* ---------------------------------------------------------------------- */
  
      n_row = Symbolic->n_row ;
      n_col = Symbolic->n_col ;
      n1 = Symbolic->n1 ;
      nfr = Symbolic->nfr ;
      nchains = Symbolic->nchains ;
  
      if (p_n_row)
      {
  	*p_n_row = n_row ;
      }
  
      if (p_n_col)
      {
  	*p_n_col = n_col ;
      }
  
      if (p_n1)
      {
  	*p_n1 = n1 ;
      }
  
      if (p_nz)
      {
  	*p_nz = Symbolic->nz ;
      }
  
      if (p_nfr)
      {
  	*p_nfr = nfr ;
      }
  
      if (p_nchains)
      {
  	*p_nchains = nchains ;
      }
  
      if (P != (Int *) NULL)
      {
  	Int *Rperm_init, *Diagonal_map ;
  	Rperm_init = Symbolic->Rperm_init ;
  	Diagonal_map = Symbolic->Diagonal_map ;
  	if (Diagonal_map != (Int *) NULL)
  	{
  	    ASSERT (n_row == n_col) ;
  	    /* next pivot rows are found in the diagonal map */
  	    for (k = 0 ; k < n_row ; k++)
  	    {
  		P [k] = Rperm_init [Diagonal_map [k]] ;
  	    }
  	}
  	else
  	{
  	    /* there is no diagonal map.  */
  	    for (k = 0 ; k < n_row ; k++)
  	    {
  		P [k] = Rperm_init [k] ;
  	    }
  	}
      }
  
      if (Q != (Int *) NULL)
      {
  	p = Symbolic->Cperm_init ;
  	for (k = 0 ; k < n_col ; k++)
  	{
  	    Q [k] = p [k] ;
  	}
      }
  
      if (Front_npivcol != (Int *) NULL)
      {
  	p = Symbolic->Front_npivcol ;
  	for (k = 0 ; k <= nfr ; k++)
  	{
  	    Front_npivcol [k] = p [k] ;
  	}
      }
  
      if (Front_parent != (Int *) NULL)
      {
  	p = Symbolic->Front_parent ;
  	for (k = 0 ; k <= nfr ; k++)
  	{
  	    Front_parent [k] = p [k] ;
  	}
      }
  
      if (Front_1strow != (Int *) NULL)
      {
  	p = Symbolic->Front_1strow ;
  	for (k = 0 ; k <= nfr ; k++)
  	{
  	    Front_1strow [k] = p [k] ;
  	}
      }
  
      if (Front_leftmostdesc != (Int *) NULL)
      {
  	p = Symbolic->Front_leftmostdesc ;
  	for (k = 0 ; k <= nfr ; k++)
  	{
  	    Front_leftmostdesc [k] = p [k] ;
  	}
      }
  
      if (Chain_start != (Int *) NULL)
      {
  	p = Symbolic->Chain_start ;
  	for (k = 0 ; k <= nchains ; k++)
  	{
  	    Chain_start [k] = p [k] ;
  	}
      }
  
      if (Chain_maxrows != (Int *) NULL)
      {
  	p = Symbolic->Chain_maxrows ;
  	for (k = 0 ; k < nchains ; k++)
  	{
  	    Chain_maxrows [k] = p [k] ;
  	}
  	Chain_maxrows [nchains] = 0 ;
      }
  
      if (Chain_maxcols != (Int *) NULL)
      {
  	p = Symbolic->Chain_maxcols ;
  	for (k = 0 ; k < nchains ; k++)
  	{
  	    Chain_maxcols [k] = p [k] ;
  	}
  	Chain_maxcols [nchains] = 0 ;
      }
  
      return (UMFPACK_OK) ;
  }