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