LAPACK  3.10.0
LAPACK: Linear Algebra PACKage
lapacke_zggesx_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 zggesx
30 * Author: Intel Corporation
31 *****************************************************************************/
32 
33 #include "lapacke_utils.h"
34 
35 lapack_int LAPACKE_zggesx_work( int matrix_layout, char jobvsl, char jobvsr,
36  char sort, LAPACK_Z_SELECT2 selctg, char sense,
39  lapack_int ldb, lapack_int* sdim,
40  lapack_complex_double* alpha,
44  double* rconde, double* rcondv,
45  lapack_complex_double* work, lapack_int lwork,
46  double* rwork, lapack_int* iwork,
47  lapack_int liwork, lapack_logical* bwork )
48 {
49  lapack_int info = 0;
50  if( matrix_layout == LAPACK_COL_MAJOR ) {
51  /* Call LAPACK function and adjust info */
52  LAPACK_zggesx( &jobvsl, &jobvsr, &sort, selctg, &sense, &n, a, &lda, b,
53  &ldb, sdim, alpha, beta, vsl, &ldvsl, vsr, &ldvsr,
54  rconde, rcondv, work, &lwork, rwork, iwork, &liwork,
55  bwork, &info );
56  if( info < 0 ) {
57  info = info - 1;
58  }
59  } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
60  lapack_int lda_t = MAX(1,n);
61  lapack_int ldb_t = MAX(1,n);
62  lapack_int ldvsl_t = MAX(1,n);
63  lapack_int ldvsr_t = MAX(1,n);
64  lapack_complex_double* a_t = NULL;
65  lapack_complex_double* b_t = NULL;
66  lapack_complex_double* vsl_t = NULL;
67  lapack_complex_double* vsr_t = NULL;
68  /* Check leading dimension(s) */
69  if( lda < n ) {
70  info = -9;
71  LAPACKE_xerbla( "LAPACKE_zggesx_work", info );
72  return info;
73  }
74  if( ldb < n ) {
75  info = -11;
76  LAPACKE_xerbla( "LAPACKE_zggesx_work", info );
77  return info;
78  }
79  if( ldvsl < n ) {
80  info = -16;
81  LAPACKE_xerbla( "LAPACKE_zggesx_work", info );
82  return info;
83  }
84  if( ldvsr < n ) {
85  info = -18;
86  LAPACKE_xerbla( "LAPACKE_zggesx_work", info );
87  return info;
88  }
89  /* Query optimal working array(s) size if requested */
90  if( liwork == -1 || lwork == -1 ) {
91  LAPACK_zggesx( &jobvsl, &jobvsr, &sort, selctg, &sense, &n, a,
92  &lda_t, b, &ldb_t, sdim, alpha, beta, vsl, &ldvsl_t,
93  vsr, &ldvsr_t, rconde, rcondv, work, &lwork, rwork,
94  iwork, &liwork, bwork, &info );
95  return (info < 0) ? (info - 1) : info;
96  }
97  /* Allocate memory for temporary array(s) */
98  a_t = (lapack_complex_double*)
99  LAPACKE_malloc( sizeof(lapack_complex_double) * lda_t * MAX(1,n) );
100  if( a_t == NULL ) {
102  goto exit_level_0;
103  }
104  b_t = (lapack_complex_double*)
105  LAPACKE_malloc( sizeof(lapack_complex_double) * ldb_t * MAX(1,n) );
106  if( b_t == NULL ) {
108  goto exit_level_1;
109  }
110  if( LAPACKE_lsame( jobvsl, 'v' ) ) {
111  vsl_t = (lapack_complex_double*)
113  ldvsl_t * MAX(1,n) );
114  if( vsl_t == NULL ) {
116  goto exit_level_2;
117  }
118  }
119  if( LAPACKE_lsame( jobvsr, 'v' ) ) {
120  vsr_t = (lapack_complex_double*)
122  ldvsr_t * MAX(1,n) );
123  if( vsr_t == NULL ) {
125  goto exit_level_3;
126  }
127  }
128  /* Transpose input matrices */
129  LAPACKE_zge_trans( matrix_layout, n, n, a, lda, a_t, lda_t );
130  LAPACKE_zge_trans( matrix_layout, n, n, b, ldb, b_t, ldb_t );
131  /* Call LAPACK function and adjust info */
132  LAPACK_zggesx( &jobvsl, &jobvsr, &sort, selctg, &sense, &n, a_t, &lda_t,
133  b_t, &ldb_t, sdim, alpha, beta, vsl_t, &ldvsl_t, vsr_t,
134  &ldvsr_t, rconde, rcondv, work, &lwork, rwork, iwork,
135  &liwork, bwork, &info );
136  if( info < 0 ) {
137  info = info - 1;
138  }
139  /* Transpose output matrices */
140  LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, n, a_t, lda_t, a, lda );
141  LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, n, b_t, ldb_t, b, ldb );
142  if( LAPACKE_lsame( jobvsl, 'v' ) ) {
143  LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, n, vsl_t, ldvsl_t, vsl,
144  ldvsl );
145  }
146  if( LAPACKE_lsame( jobvsr, 'v' ) ) {
147  LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, n, vsr_t, ldvsr_t, vsr,
148  ldvsr );
149  }
150  /* Release memory and exit */
151  if( LAPACKE_lsame( jobvsr, 'v' ) ) {
152  LAPACKE_free( vsr_t );
153  }
154 exit_level_3:
155  if( LAPACKE_lsame( jobvsl, 'v' ) ) {
156  LAPACKE_free( vsl_t );
157  }
158 exit_level_2:
159  LAPACKE_free( b_t );
160 exit_level_1:
161  LAPACKE_free( a_t );
162 exit_level_0:
163  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
164  LAPACKE_xerbla( "LAPACKE_zggesx_work", info );
165  }
166  } else {
167  info = -1;
168  LAPACKE_xerbla( "LAPACKE_zggesx_work", info );
169  }
170  return info;
171 }
#define lapack_int
Definition: lapack.h:83
#define LAPACK_zggesx(...)
Definition: lapack.h:4637
#define lapack_complex_double
Definition: lapack.h:63
lapack_logical(* LAPACK_Z_SELECT2)(const lapack_complex_double *, const lapack_complex_double *)
Definition: lapack.h:115
#define lapack_logical
Definition: lapack.h:87
#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_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:35
void LAPACKE_xerbla(const char *name, lapack_int info)
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)
#define MAX(x, y)
Definition: lapacke_utils.h:46
lapack_int LAPACKE_zggesx_work(int matrix_layout, char jobvsl, char jobvsr, char sort, LAPACK_Z_SELECT2 selctg, char sense, lapack_int n, lapack_complex_double *a, lapack_int lda, lapack_complex_double *b, lapack_int ldb, lapack_int *sdim, lapack_complex_double *alpha, lapack_complex_double *beta, lapack_complex_double *vsl, lapack_int ldvsl, lapack_complex_double *vsr, lapack_int ldvsr, double *rconde, double *rcondv, lapack_complex_double *work, lapack_int lwork, double *rwork, lapack_int *iwork, lapack_int liwork, lapack_logical *bwork)