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 chesvx
30 * Author: Intel Corporation
31 *****************************************************************************/
32
33 #include "lapacke_utils.h"
34
LAPACKE_chesvx_work(int matrix_layout,char fact,char uplo,lapack_int n,lapack_int nrhs,const lapack_complex_float * a,lapack_int lda,lapack_complex_float * af,lapack_int ldaf,lapack_int * ipiv,const lapack_complex_float * b,lapack_int ldb,lapack_complex_float * x,lapack_int ldx,float * rcond,float * ferr,float * berr,lapack_complex_float * work,lapack_int lwork,float * rwork)35 lapack_int LAPACKE_chesvx_work( int matrix_layout, char fact, char uplo,
36 lapack_int n, lapack_int nrhs,
37 const lapack_complex_float* a, lapack_int lda,
38 lapack_complex_float* af, lapack_int ldaf,
39 lapack_int* ipiv, const lapack_complex_float* b,
40 lapack_int ldb, lapack_complex_float* x,
41 lapack_int ldx, float* rcond, float* ferr,
42 float* berr, lapack_complex_float* work,
43 lapack_int lwork, float* rwork )
44 {
45 lapack_int info = 0;
46 if( matrix_layout == LAPACK_COL_MAJOR ) {
47 /* Call LAPACK function and adjust info */
48 LAPACK_chesvx( &fact, &uplo, &n, &nrhs, a, &lda, af, &ldaf, ipiv, b,
49 &ldb, x, &ldx, rcond, ferr, berr, work, &lwork, rwork,
50 &info );
51 if( info < 0 ) {
52 info = info - 1;
53 }
54 } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
55 lapack_int lda_t = MAX(1,n);
56 lapack_int ldaf_t = MAX(1,n);
57 lapack_int ldb_t = MAX(1,n);
58 lapack_int ldx_t = MAX(1,n);
59 lapack_complex_float* a_t = NULL;
60 lapack_complex_float* af_t = NULL;
61 lapack_complex_float* b_t = NULL;
62 lapack_complex_float* x_t = NULL;
63 /* Check leading dimension(s) */
64 if( lda < n ) {
65 info = -7;
66 LAPACKE_xerbla( "LAPACKE_chesvx_work", info );
67 return info;
68 }
69 if( ldaf < n ) {
70 info = -9;
71 LAPACKE_xerbla( "LAPACKE_chesvx_work", info );
72 return info;
73 }
74 if( ldb < nrhs ) {
75 info = -12;
76 LAPACKE_xerbla( "LAPACKE_chesvx_work", info );
77 return info;
78 }
79 if( ldx < nrhs ) {
80 info = -14;
81 LAPACKE_xerbla( "LAPACKE_chesvx_work", info );
82 return info;
83 }
84 /* Query optimal working array(s) size if requested */
85 if( lwork == -1 ) {
86 LAPACK_chesvx( &fact, &uplo, &n, &nrhs, a, &lda_t, af, &ldaf_t,
87 ipiv, b, &ldb_t, x, &ldx_t, rcond, ferr, berr, work,
88 &lwork, rwork, &info );
89 return (info < 0) ? (info - 1) : info;
90 }
91 /* Allocate memory for temporary array(s) */
92 a_t = (lapack_complex_float*)
93 LAPACKE_malloc( sizeof(lapack_complex_float) * lda_t * MAX(1,n) );
94 if( a_t == NULL ) {
95 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
96 goto exit_level_0;
97 }
98 af_t = (lapack_complex_float*)
99 LAPACKE_malloc( sizeof(lapack_complex_float) * ldaf_t * MAX(1,n) );
100 if( af_t == NULL ) {
101 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
102 goto exit_level_1;
103 }
104 b_t = (lapack_complex_float*)
105 LAPACKE_malloc( sizeof(lapack_complex_float) *
106 ldb_t * MAX(1,nrhs) );
107 if( b_t == NULL ) {
108 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
109 goto exit_level_2;
110 }
111 x_t = (lapack_complex_float*)
112 LAPACKE_malloc( sizeof(lapack_complex_float) *
113 ldx_t * MAX(1,nrhs) );
114 if( x_t == NULL ) {
115 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
116 goto exit_level_3;
117 }
118 /* Transpose input matrices */
119 LAPACKE_che_trans( matrix_layout, uplo, n, a, lda, a_t, lda_t );
120 if( LAPACKE_lsame( fact, 'f' ) ) {
121 LAPACKE_che_trans( matrix_layout, uplo, n, af, ldaf, af_t, ldaf_t );
122 }
123 LAPACKE_cge_trans( matrix_layout, n, nrhs, b, ldb, b_t, ldb_t );
124 /* Call LAPACK function and adjust info */
125 LAPACK_chesvx( &fact, &uplo, &n, &nrhs, a_t, &lda_t, af_t, &ldaf_t,
126 ipiv, b_t, &ldb_t, x_t, &ldx_t, rcond, ferr, berr, work,
127 &lwork, rwork, &info );
128 if( info < 0 ) {
129 info = info - 1;
130 }
131 /* Transpose output matrices */
132 if( LAPACKE_lsame( fact, 'n' ) ) {
133 LAPACKE_che_trans( LAPACK_COL_MAJOR, uplo, n, af_t, ldaf_t, af,
134 ldaf );
135 }
136 LAPACKE_cge_trans( LAPACK_COL_MAJOR, n, nrhs, x_t, ldx_t, x, ldx );
137 /* Release memory and exit */
138 LAPACKE_free( x_t );
139 exit_level_3:
140 LAPACKE_free( b_t );
141 exit_level_2:
142 LAPACKE_free( af_t );
143 exit_level_1:
144 LAPACKE_free( a_t );
145 exit_level_0:
146 if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
147 LAPACKE_xerbla( "LAPACKE_chesvx_work", info );
148 }
149 } else {
150 info = -1;
151 LAPACKE_xerbla( "LAPACKE_chesvx_work", info );
152 }
153 return info;
154 }
155