LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches
lapacke_dgbsvxx_work.c
Go to the documentation of this file.
1/*****************************************************************************
2 Copyright (c) 2014, Intel Corp.
3 All rights reserved.
4
5 Redistribution and use in source and binary forms, with or without
6 modification, are permitted provided that the following conditions are met:
7
8 * Redistributions of source code must retain the above copyright notice,
9 this list of conditions and the following disclaimer.
10 * Redistributions in binary form must reproduce the above copyright
11 notice, this list of conditions and the following disclaimer in the
12 documentation and/or other materials provided with the distribution.
13 * Neither the name of Intel Corporation nor the names of its contributors
14 may be used to endorse or promote products derived from this software
15 without specific prior written permission.
16
17 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
18 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
21 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
24 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
26 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
27 THE POSSIBILITY OF SUCH DAMAGE.
28*****************************************************************************
29* Contents: Native middle-level C interface to LAPACK function dgbsvxx
30* Author: Intel Corporation
31*****************************************************************************/
32
33#include "lapacke_utils.h"
34
35lapack_int LAPACKE_dgbsvxx_work( int matrix_layout, char fact, char trans,
37 lapack_int nrhs, double* ab, lapack_int ldab,
38 double* afb, lapack_int ldafb,
39 lapack_int* ipiv, char* equed, double* r,
40 double* c, double* b, lapack_int ldb,
41 double* x, lapack_int ldx, double* rcond,
42 double* rpvgrw, double* berr,
43 lapack_int n_err_bnds, double* err_bnds_norm,
44 double* err_bnds_comp, lapack_int nparams,
45 double* params, double* work,
46 lapack_int* iwork )
47{
48 lapack_int info = 0;
49 if( matrix_layout == LAPACK_COL_MAJOR ) {
50 /* Call LAPACK function and adjust info */
51 LAPACK_dgbsvxx( &fact, &trans, &n, &kl, &ku, &nrhs, ab, &ldab, afb,
52 &ldafb, ipiv, equed, r, c, b, &ldb, x, &ldx, rcond,
53 rpvgrw, berr, &n_err_bnds, err_bnds_norm, err_bnds_comp,
54 &nparams, params, work, iwork, &info );
55 if( info < 0 ) {
56 info = info - 1;
57 }
58 } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
59 lapack_int ldab_t = MAX(1,kl+ku+1);
60 lapack_int ldafb_t = MAX(1,2*kl+ku+1);
61 lapack_int ldb_t = MAX(1,n);
62 lapack_int ldx_t = MAX(1,n);
63 double* ab_t = NULL;
64 double* afb_t = NULL;
65 double* b_t = NULL;
66 double* x_t = NULL;
67 double* err_bnds_norm_t = NULL;
68 double* err_bnds_comp_t = NULL;
69 /* Check leading dimension(s) */
70 if( ldab < n ) {
71 info = -9;
72 LAPACKE_xerbla( "LAPACKE_dgbsvxx_work", info );
73 return info;
74 }
75 if( ldafb < n ) {
76 info = -11;
77 LAPACKE_xerbla( "LAPACKE_dgbsvxx_work", info );
78 return info;
79 }
80 if( ldb < nrhs ) {
81 info = -17;
82 LAPACKE_xerbla( "LAPACKE_dgbsvxx_work", info );
83 return info;
84 }
85 if( ldx < nrhs ) {
86 info = -19;
87 LAPACKE_xerbla( "LAPACKE_dgbsvxx_work", info );
88 return info;
89 }
90 /* Allocate memory for temporary array(s) */
91 ab_t = (double*)LAPACKE_malloc( sizeof(double) * ldab_t * MAX(1,n) );
92 if( ab_t == NULL ) {
94 goto exit_level_0;
95 }
96 afb_t = (double*)LAPACKE_malloc( sizeof(double) * ldafb_t * MAX(1,n) );
97 if( afb_t == NULL ) {
99 goto exit_level_1;
100 }
101 b_t = (double*)LAPACKE_malloc( sizeof(double) * ldb_t * MAX(1,nrhs) );
102 if( b_t == NULL ) {
104 goto exit_level_2;
105 }
106 x_t = (double*)LAPACKE_malloc( sizeof(double) * ldx_t * MAX(1,nrhs) );
107 if( x_t == NULL ) {
109 goto exit_level_3;
110 }
111 err_bnds_norm_t = (double*)
112 LAPACKE_malloc( sizeof(double) * nrhs * MAX(1,n_err_bnds) );
113 if( err_bnds_norm_t == NULL ) {
115 goto exit_level_4;
116 }
117 err_bnds_comp_t = (double*)
118 LAPACKE_malloc( sizeof(double) * nrhs * MAX(1,n_err_bnds) );
119 if( err_bnds_comp_t == NULL ) {
121 goto exit_level_5;
122 }
123 /* Transpose input matrices */
124 LAPACKE_dgb_trans( matrix_layout, n, n, kl, ku, ab, ldab, ab_t, ldab_t );
125 if( LAPACKE_lsame( fact, 'f' ) ) {
126 LAPACKE_dgb_trans( matrix_layout, n, n, kl, kl+ku, afb, ldafb, afb_t,
127 ldafb_t );
128 }
129 LAPACKE_dge_trans( matrix_layout, n, nrhs, b, ldb, b_t, ldb_t );
130 /* Call LAPACK function and adjust info */
131 LAPACK_dgbsvxx( &fact, &trans, &n, &kl, &ku, &nrhs, ab_t, &ldab_t,
132 afb_t, &ldafb_t, ipiv, equed, r, c, b_t, &ldb_t, x_t,
133 &ldx_t, rcond, rpvgrw, berr, &n_err_bnds,
134 err_bnds_norm_t, err_bnds_comp_t, &nparams, params,
135 work, iwork, &info );
136 if( info < 0 ) {
137 info = info - 1;
138 }
139 /* Transpose output matrices */
140 if( LAPACKE_lsame( fact, 'e' ) && ( LAPACKE_lsame( *equed, 'b' ) ||
141 LAPACKE_lsame( *equed, 'c' ) || LAPACKE_lsame( *equed, 'r' ) ) ) {
142 LAPACKE_dgb_trans( LAPACK_COL_MAJOR, n, n, kl, ku, ab_t, ldab_t, ab,
143 ldab );
144 }
145 if( LAPACKE_lsame( fact, 'e' ) || LAPACKE_lsame( fact, 'n' ) ) {
146 LAPACKE_dgb_trans( LAPACK_COL_MAJOR, n, n, kl, kl+ku, afb_t,
147 ldafb_t, afb, ldafb );
148 }
149 if( LAPACKE_lsame( fact, 'f' ) && ( LAPACKE_lsame( *equed, 'b' ) ||
150 LAPACKE_lsame( *equed, 'c' ) || LAPACKE_lsame( *equed, 'r' ) ) ) {
151 LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, nrhs, b_t, ldb_t, b, ldb );
152 }
153 LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, nrhs, x_t, ldx_t, x, ldx );
154 LAPACKE_dge_trans( LAPACK_COL_MAJOR, nrhs, n_err_bnds, err_bnds_norm_t,
155 nrhs, err_bnds_norm, n_err_bnds );
156 LAPACKE_dge_trans( LAPACK_COL_MAJOR, nrhs, n_err_bnds, err_bnds_comp_t,
157 nrhs, err_bnds_comp, n_err_bnds );
158 /* Release memory and exit */
159 LAPACKE_free( err_bnds_comp_t );
160exit_level_5:
161 LAPACKE_free( err_bnds_norm_t );
162exit_level_4:
163 LAPACKE_free( x_t );
164exit_level_3:
165 LAPACKE_free( b_t );
166exit_level_2:
167 LAPACKE_free( afb_t );
168exit_level_1:
169 LAPACKE_free( ab_t );
170exit_level_0:
171 if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
172 LAPACKE_xerbla( "LAPACKE_dgbsvxx_work", info );
173 }
174 } else {
175 info = -1;
176 LAPACKE_xerbla( "LAPACKE_dgbsvxx_work", info );
177 }
178 return info;
179}
#define LAPACK_dgbsvxx(...)
Definition: lapack.h:1131
#define lapack_int
Definition: lapack.h:87
#define LAPACK_COL_MAJOR
Definition: lapacke.h:53
#define LAPACKE_free(p)
Definition: lapacke.h:46
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:52
#define LAPACKE_malloc(size)
Definition: lapacke.h:43
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:56
lapack_int LAPACKE_dgbsvxx_work(int matrix_layout, char fact, char trans, lapack_int n, lapack_int kl, lapack_int ku, lapack_int nrhs, double *ab, lapack_int ldab, double *afb, lapack_int ldafb, 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)
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:35
void LAPACKE_xerbla(const char *name, lapack_int info)
#define MAX(x, y)
Definition: lapacke_utils.h:46
void LAPACKE_dgb_trans(int matrix_layout, lapack_int m, lapack_int n, lapack_int kl, lapack_int ku, const double *in, lapack_int ldin, double *out, lapack_int ldout)
void LAPACKE_dge_trans(int matrix_layout, lapack_int m, lapack_int n, const double *in, lapack_int ldin, double *out, lapack_int ldout)