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