LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches
lapacke_dgbrfsx_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 dgbrfsx
30* Author: Intel Corporation
31*****************************************************************************/
32
33#include "lapacke_utils.h"
34
35lapack_int LAPACKE_dgbrfsx_work( int matrix_layout, char trans, char equed,
37 lapack_int nrhs, const double* ab,
38 lapack_int ldab, const double* afb,
39 lapack_int ldafb, const lapack_int* ipiv,
40 const double* r, const double* c,
41 const double* b, lapack_int ldb, double* x,
42 lapack_int ldx, double* rcond, 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_dgbrfsx( &trans, &equed, &n, &kl, &ku, &nrhs, ab, &ldab, afb,
52 &ldafb, ipiv, r, c, b, &ldb, x, &ldx, rcond, berr,
53 &n_err_bnds, err_bnds_norm, err_bnds_comp, &nparams,
54 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_dgbrfsx_work", info );
73 return info;
74 }
75 if( ldafb < n ) {
76 info = -11;
77 LAPACKE_xerbla( "LAPACKE_dgbrfsx_work", info );
78 return info;
79 }
80 if( ldb < nrhs ) {
81 info = -16;
82 LAPACKE_xerbla( "LAPACKE_dgbrfsx_work", info );
83 return info;
84 }
85 if( ldx < nrhs ) {
86 info = -18;
87 LAPACKE_xerbla( "LAPACKE_dgbrfsx_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 LAPACKE_dgb_trans( matrix_layout, n, n, kl, kl+ku, afb, ldafb, afb_t,
126 ldafb_t );
127 LAPACKE_dge_trans( matrix_layout, n, nrhs, b, ldb, b_t, ldb_t );
128 LAPACKE_dge_trans( matrix_layout, n, nrhs, x, ldx, x_t, ldx_t );
129 /* Call LAPACK function and adjust info */
130 LAPACK_dgbrfsx( &trans, &equed, &n, &kl, &ku, &nrhs, ab_t, &ldab_t,
131 afb_t, &ldafb_t, ipiv, r, c, b_t, &ldb_t, x_t, &ldx_t,
132 rcond, berr, &n_err_bnds, err_bnds_norm_t,
133 err_bnds_comp_t, &nparams, params, work, iwork, &info );
134 if( info < 0 ) {
135 info = info - 1;
136 }
137 /* Transpose output matrices */
138 LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, nrhs, x_t, ldx_t, x, ldx );
139 LAPACKE_dge_trans( LAPACK_COL_MAJOR, nrhs, n_err_bnds, err_bnds_norm_t,
140 nrhs, err_bnds_norm, nrhs );
141 LAPACKE_dge_trans( LAPACK_COL_MAJOR, nrhs, n_err_bnds, err_bnds_comp_t,
142 nrhs, err_bnds_comp, nrhs );
143 /* Release memory and exit */
144 LAPACKE_free( err_bnds_comp_t );
145exit_level_5:
146 LAPACKE_free( err_bnds_norm_t );
147exit_level_4:
148 LAPACKE_free( x_t );
149exit_level_3:
150 LAPACKE_free( b_t );
151exit_level_2:
152 LAPACKE_free( afb_t );
153exit_level_1:
154 LAPACKE_free( ab_t );
155exit_level_0:
156 if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
157 LAPACKE_xerbla( "LAPACKE_dgbrfsx_work", info );
158 }
159 } else {
160 info = -1;
161 LAPACKE_xerbla( "LAPACKE_dgbrfsx_work", info );
162 }
163 return info;
164}
#define lapack_int
Definition: lapack.h:87
#define LAPACK_dgbrfsx(...)
Definition: lapack.h:879
#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_dgbrfsx_work(int matrix_layout, char trans, char equed, lapack_int n, lapack_int kl, lapack_int ku, lapack_int nrhs, const double *ab, lapack_int ldab, const double *afb, lapack_int ldafb, const lapack_int *ipiv, const double *r, const double *c, const double *b, lapack_int ldb, double *x, lapack_int ldx, double *rcond, 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)
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)