LAPACK  3.9.1
LAPACK: Linear Algebra PACKage
lapacke_sggev3_work.c
Go to the documentation of this file.
1 /*****************************************************************************
2  Copyright (c) 2015, 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 sggev3
30 * Author: Intel Corporation
31 *****************************************************************************/
32 
33 #include "lapacke_utils.h"
34 
35 lapack_int LAPACKE_sggev3_work( int matrix_layout,
36  char jobvl, char jobvr, lapack_int n,
37  float* a, lapack_int lda,
38  float* b, lapack_int ldb,
39  float* alphar, float* alphai, float* beta,
40  float* vl, lapack_int ldvl,
41  float* vr, lapack_int ldvr,
42  float* work, lapack_int lwork )
43 {
44  lapack_int info = 0;
45  if( matrix_layout == LAPACK_COL_MAJOR ) {
46  /* Call LAPACK function and adjust info */
47  LAPACK_sggev3( &jobvl, &jobvr, &n, a, &lda, b, &ldb, alphar, alphai,
48  beta, vl, &ldvl, vr, &ldvr, work, &lwork, &info );
49  if( info < 0 ) {
50  info = info - 1;
51  }
52  } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
53  lapack_int nrows_vl = LAPACKE_lsame( jobvl, 'v' ) ? n : 1;
54  lapack_int ncols_vl = LAPACKE_lsame( jobvl, 'v' ) ? n : 1;
55  lapack_int nrows_vr = LAPACKE_lsame( jobvr, 'v' ) ? n : 1;
56  lapack_int ncols_vr = LAPACKE_lsame( jobvr, 'v' ) ? n : 1;
57  lapack_int lda_t = MAX(1,n);
58  lapack_int ldb_t = MAX(1,n);
59  lapack_int ldvl_t = MAX(1,nrows_vl);
60  lapack_int ldvr_t = MAX(1,nrows_vr);
61  float* a_t = NULL;
62  float* b_t = NULL;
63  float* vl_t = NULL;
64  float* vr_t = NULL;
65  /* Check leading dimension(s) */
66  if( lda < n ) {
67  info = -6;
68  LAPACKE_xerbla( "LAPACKE_sggev3_work", info );
69  return info;
70  }
71  if( ldb < n ) {
72  info = -8;
73  LAPACKE_xerbla( "LAPACKE_sggev3_work", info );
74  return info;
75  }
76  if( ldvl < ncols_vl ) {
77  info = -13;
78  LAPACKE_xerbla( "LAPACKE_sggev3_work", info );
79  return info;
80  }
81  if( ldvr < ncols_vr ) {
82  info = -15;
83  LAPACKE_xerbla( "LAPACKE_sggev3_work", info );
84  return info;
85  }
86  /* Query optimal working array(s) size if requested */
87  if( lwork == -1 ) {
88  LAPACK_sggev3( &jobvl, &jobvr, &n, a, &lda_t, b, &ldb_t,
89  alphar, alphai, beta, vl, &ldvl_t, vr, &ldvr_t,
90  work, &lwork, &info );
91  return (info < 0) ? (info - 1) : info;
92  }
93  /* Allocate memory for temporary array(s) */
94  a_t = (float*)LAPACKE_malloc( sizeof(float) * lda_t * MAX(1,n) );
95  if( a_t == NULL ) {
97  goto exit_level_0;
98  }
99  b_t = (float*)LAPACKE_malloc( sizeof(float) * ldb_t * MAX(1,n) );
100  if( b_t == NULL ) {
102  goto exit_level_1;
103  }
104  if( LAPACKE_lsame( jobvl, 'v' ) ) {
105  vl_t = (float*)
106  LAPACKE_malloc( sizeof(float) * ldvl_t * MAX(1,ncols_vl) );
107  if( vl_t == NULL ) {
109  goto exit_level_2;
110  }
111  }
112  if( LAPACKE_lsame( jobvr, 'v' ) ) {
113  vr_t = (float*)
114  LAPACKE_malloc( sizeof(float) * ldvr_t * MAX(1,ncols_vr) );
115  if( vr_t == NULL ) {
117  goto exit_level_3;
118  }
119  }
120  /* Transpose input matrices */
121  LAPACKE_sge_trans( matrix_layout, n, n, a, lda, a_t, lda_t );
122  LAPACKE_sge_trans( matrix_layout, n, n, b, ldb, b_t, ldb_t );
123  /* Call LAPACK function and adjust info */
124  LAPACK_sggev3( &jobvl, &jobvr, &n, a_t, &lda_t, b_t, &ldb_t, alphar,
125  alphai, beta, vl_t, &ldvl_t, vr_t, &ldvr_t,
126  work, &lwork, &info );
127  if( info < 0 ) {
128  info = info - 1;
129  }
130  /* Transpose output matrices */
131  LAPACKE_sge_trans( LAPACK_COL_MAJOR, n, n, a_t, lda_t, a, lda );
132  LAPACKE_sge_trans( LAPACK_COL_MAJOR, n, n, b_t, ldb_t, b, ldb );
133  if( LAPACKE_lsame( jobvl, 'v' ) ) {
134  LAPACKE_sge_trans( LAPACK_COL_MAJOR, nrows_vl, ncols_vl, vl_t,
135  ldvl_t, vl, ldvl );
136  }
137  if( LAPACKE_lsame( jobvr, 'v' ) ) {
138  LAPACKE_sge_trans( LAPACK_COL_MAJOR, nrows_vr, ncols_vr, vr_t,
139  ldvr_t, vr, ldvr );
140  }
141  /* Release memory and exit */
142  if( LAPACKE_lsame( jobvr, 'v' ) ) {
143  LAPACKE_free( vr_t );
144  }
145 exit_level_3:
146  if( LAPACKE_lsame( jobvl, 'v' ) ) {
147  LAPACKE_free( vl_t );
148  }
149 exit_level_2:
150  LAPACKE_free( b_t );
151 exit_level_1:
152  LAPACKE_free( a_t );
153 exit_level_0:
154  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
155  LAPACKE_xerbla( "LAPACKE_sggev3_work", info );
156  }
157  } else {
158  info = -1;
159  LAPACKE_xerbla( "LAPACKE_sggev3_work", info );
160  }
161  return info;
162 }
#define lapack_int
Definition: lapack.h:83
void LAPACK_sggev3(char const *jobvl, char const *jobvr, lapack_int const *n, float *A, lapack_int const *lda, float *B, lapack_int const *ldb, float *alphar, float *alphai, float *beta, float *VL, lapack_int const *ldvl, float *VR, lapack_int const *ldvr, float *work, lapack_int const *lwork, lapack_int *info)
#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_sggev3_work(int matrix_layout, char jobvl, char jobvr, lapack_int n, float *a, lapack_int lda, float *b, lapack_int ldb, float *alphar, float *alphai, float *beta, float *vl, lapack_int ldvl, float *vr, lapack_int ldvr, float *work, lapack_int lwork)
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:35
void LAPACKE_xerbla(const char *name, lapack_int info)
void LAPACKE_sge_trans(int matrix_layout, lapack_int m, lapack_int n, const float *in, lapack_int ldin, float *out, lapack_int ldout)
#define MAX(x, y)
Definition: lapacke_utils.h:46