LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches

◆ LAPACKE_dgesvxx_work()

lapack_int LAPACKE_dgesvxx_work ( int  matrix_layout,
char  fact,
char  trans,
lapack_int  n,
lapack_int  nrhs,
double *  a,
lapack_int  lda,
double *  af,
lapack_int  ldaf,
lapack_int *  ipiv,
char *  equed,
double *  r,
double *  c,
double *  b,
lapack_int  ldb,
double *  x,
lapack_int  ldx,
double *  rcond,
double *  rpvgrw,
double *  berr,
lapack_int  n_err_bnds,
double *  err_bnds_norm,
double *  err_bnds_comp,
lapack_int  nparams,
double *  params,
double *  work,
lapack_int *  iwork 
)

Definition at line 35 of file lapacke_dgesvxx_work.c.

46{
47 lapack_int info = 0;
48 if( matrix_layout == LAPACK_COL_MAJOR ) {
49 /* Call LAPACK function and adjust info */
50 LAPACK_dgesvxx( &fact, &trans, &n, &nrhs, a, &lda, af, &ldaf, ipiv,
51 equed, r, c, b, &ldb, x, &ldx, rcond, rpvgrw, berr,
52 &n_err_bnds, err_bnds_norm, err_bnds_comp, &nparams,
53 params, work, iwork, &info );
54 if( info < 0 ) {
55 info = info - 1;
56 }
57 } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
58 lapack_int lda_t = MAX(1,n);
59 lapack_int ldaf_t = MAX(1,n);
60 lapack_int ldb_t = MAX(1,n);
61 lapack_int ldx_t = MAX(1,n);
62 double* a_t = NULL;
63 double* af_t = NULL;
64 double* b_t = NULL;
65 double* x_t = NULL;
66 double* err_bnds_norm_t = NULL;
67 double* err_bnds_comp_t = NULL;
68 /* Check leading dimension(s) */
69 if( lda < n ) {
70 info = -7;
71 LAPACKE_xerbla( "LAPACKE_dgesvxx_work", info );
72 return info;
73 }
74 if( ldaf < n ) {
75 info = -9;
76 LAPACKE_xerbla( "LAPACKE_dgesvxx_work", info );
77 return info;
78 }
79 if( ldb < nrhs ) {
80 info = -15;
81 LAPACKE_xerbla( "LAPACKE_dgesvxx_work", info );
82 return info;
83 }
84 if( ldx < nrhs ) {
85 info = -17;
86 LAPACKE_xerbla( "LAPACKE_dgesvxx_work", info );
87 return info;
88 }
89 /* Allocate memory for temporary array(s) */
90 a_t = (double*)LAPACKE_malloc( sizeof(double) * lda_t * MAX(1,n) );
91 if( a_t == NULL ) {
92 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
93 goto exit_level_0;
94 }
95 af_t = (double*)LAPACKE_malloc( sizeof(double) * ldaf_t * MAX(1,n) );
96 if( af_t == NULL ) {
97 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
98 goto exit_level_1;
99 }
100 b_t = (double*)LAPACKE_malloc( sizeof(double) * ldb_t * MAX(1,nrhs) );
101 if( b_t == NULL ) {
102 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
103 goto exit_level_2;
104 }
105 x_t = (double*)LAPACKE_malloc( sizeof(double) * ldx_t * MAX(1,nrhs) );
106 if( x_t == NULL ) {
107 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
108 goto exit_level_3;
109 }
110 err_bnds_norm_t = (double*)
111 LAPACKE_malloc( sizeof(double) * nrhs * MAX(1,n_err_bnds) );
112 if( err_bnds_norm_t == NULL ) {
113 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
114 goto exit_level_4;
115 }
116 err_bnds_comp_t = (double*)
117 LAPACKE_malloc( sizeof(double) * nrhs * MAX(1,n_err_bnds) );
118 if( err_bnds_comp_t == NULL ) {
119 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
120 goto exit_level_5;
121 }
122 /* Transpose input matrices */
123 LAPACKE_dge_trans( matrix_layout, n, n, a, lda, a_t, lda_t );
124 if( LAPACKE_lsame( fact, 'f' ) ) {
125 LAPACKE_dge_trans( matrix_layout, n, n, af, ldaf, af_t, ldaf_t );
126 }
127 LAPACKE_dge_trans( matrix_layout, n, nrhs, b, ldb, b_t, ldb_t );
128 /* Call LAPACK function and adjust info */
129 LAPACK_dgesvxx( &fact, &trans, &n, &nrhs, a_t, &lda_t, af_t, &ldaf_t,
130 ipiv, equed, r, c, b_t, &ldb_t, x_t, &ldx_t, rcond,
131 rpvgrw, berr, &n_err_bnds, err_bnds_norm_t,
132 err_bnds_comp_t, &nparams, params, work, iwork, &info );
133 if( info < 0 ) {
134 info = info - 1;
135 }
136 /* Transpose output matrices */
137 if( LAPACKE_lsame( fact, 'e' ) && ( LAPACKE_lsame( *equed, 'b' ) ||
138 LAPACKE_lsame( *equed, 'c' ) || LAPACKE_lsame( *equed, 'r' ) ) ) {
139 LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, n, a_t, lda_t, a, lda );
140 }
141 if( LAPACKE_lsame( fact, 'e' ) || LAPACKE_lsame( fact, 'n' ) ) {
142 LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, n, af_t, ldaf_t, af, ldaf );
143 }
144 if( LAPACKE_lsame( fact, 'f' ) && ( LAPACKE_lsame( *equed, 'b' ) ||
145 LAPACKE_lsame( *equed, 'c' ) || LAPACKE_lsame( *equed, 'r' ) ) ) {
146 LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, nrhs, b_t, ldb_t, b, ldb );
147 }
148 LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, nrhs, x_t, ldx_t, x, ldx );
149 LAPACKE_dge_trans( LAPACK_COL_MAJOR, nrhs, n_err_bnds, err_bnds_norm_t,
150 nrhs, err_bnds_norm, n_err_bnds );
151 LAPACKE_dge_trans( LAPACK_COL_MAJOR, nrhs, n_err_bnds, err_bnds_comp_t,
152 nrhs, err_bnds_comp, n_err_bnds );
153 /* Release memory and exit */
154 LAPACKE_free( err_bnds_comp_t );
155exit_level_5:
156 LAPACKE_free( err_bnds_norm_t );
157exit_level_4:
158 LAPACKE_free( x_t );
159exit_level_3:
160 LAPACKE_free( b_t );
161exit_level_2:
162 LAPACKE_free( af_t );
163exit_level_1:
164 LAPACKE_free( a_t );
165exit_level_0:
166 if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
167 LAPACKE_xerbla( "LAPACKE_dgesvxx_work", info );
168 }
169 } else {
170 info = -1;
171 LAPACKE_xerbla( "LAPACKE_dgesvxx_work", info );
172 }
173 return info;
174}
LAPACK_dgesvxx
#define LAPACK_dgesvxx(...)
Definition: lapack.h:3877
lapack_int
#define lapack_int
Definition: lapack.h:87
LAPACK_COL_MAJOR
#define LAPACK_COL_MAJOR
Definition: lapacke.h:53
LAPACKE_free
#define LAPACKE_free(p)
Definition: lapacke.h:46
LAPACK_ROW_MAJOR
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:52
LAPACKE_malloc
#define LAPACKE_malloc(size)
Definition: lapacke.h:43
LAPACK_TRANSPOSE_MEMORY_ERROR
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:56
LAPACKE_lsame
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:35
LAPACKE_xerbla
void LAPACKE_xerbla(const char *name, lapack_int info)
Definition: lapacke_xerbla.c:36
MAX
#define MAX(x, y)
Definition: lapacke_utils.h:46
LAPACKE_dge_trans
void LAPACKE_dge_trans(int matrix_layout, lapack_int m, lapack_int n, const double *in, lapack_int ldin, double *out, lapack_int ldout)
Definition: lapacke_dge_trans.c:39
Here is the call graph for this function:
Here is the caller graph for this function: