LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches

◆ LAPACKE_cgeesx()

lapack_int LAPACKE_cgeesx ( int  matrix_layout,
char  jobvs,
char  sort,
LAPACK_C_SELECT1  select,
char  sense,
lapack_int  n,
lapack_complex_float a,
lapack_int  lda,
lapack_int sdim,
lapack_complex_float w,
lapack_complex_float vs,
lapack_int  ldvs,
float *  rconde,
float *  rcondv 
)

Definition at line 35 of file lapacke_cgeesx.c.

41{
42 lapack_int info = 0;
43 lapack_int lwork = -1;
44 lapack_logical* bwork = NULL;
45 float* rwork = NULL;
46 lapack_complex_float* work = NULL;
47 lapack_complex_float work_query;
48 if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
49 LAPACKE_xerbla( "LAPACKE_cgeesx", -1 );
50 return -1;
51 }
52#ifndef LAPACK_DISABLE_NAN_CHECK
53 if( LAPACKE_get_nancheck() ) {
54 /* Optionally check input matrices for NaNs */
55 if( LAPACKE_cge_nancheck( matrix_layout, n, n, a, lda ) ) {
56 return -7;
57 }
58 }
59#endif
60 /* Allocate memory for working array(s) */
61 if( LAPACKE_lsame( sort, 's' ) ) {
62 bwork = (lapack_logical*)
63 LAPACKE_malloc( sizeof(lapack_logical) * MAX(1,n) );
64 if( bwork == NULL ) {
66 goto exit_level_0;
67 }
68 }
69 rwork = (float*)LAPACKE_malloc( sizeof(float) * MAX(1,n) );
70 if( rwork == NULL ) {
72 goto exit_level_1;
73 }
74 /* Query optimal working array(s) size */
75 info = LAPACKE_cgeesx_work( matrix_layout, jobvs, sort, select, sense, n, a,
76 lda, sdim, w, vs, ldvs, rconde, rcondv,
77 &work_query, lwork, rwork, bwork );
78 if( info != 0 ) {
79 goto exit_level_2;
80 }
81 lwork = LAPACK_C2INT( work_query );
82 /* Allocate memory for work arrays */
83 work = (lapack_complex_float*)
84 LAPACKE_malloc( sizeof(lapack_complex_float) * lwork );
85 if( work == NULL ) {
87 goto exit_level_2;
88 }
89 /* Call middle-level interface */
90 info = LAPACKE_cgeesx_work( matrix_layout, jobvs, sort, select, sense, n, a,
91 lda, sdim, w, vs, ldvs, rconde, rcondv, work,
92 lwork, rwork, bwork );
93 /* Release memory and exit */
94 LAPACKE_free( work );
95exit_level_2:
96 LAPACKE_free( rwork );
97exit_level_1:
98 if( LAPACKE_lsame( sort, 's' ) ) {
99 LAPACKE_free( bwork );
100 }
101exit_level_0:
102 if( info == LAPACK_WORK_MEMORY_ERROR ) {
103 LAPACKE_xerbla( "LAPACKE_cgeesx", info );
104 }
105 return info;
106}
#define lapack_int
Definition: lapack.h:87
#define lapack_complex_float
Definition: lapack.h:46
#define lapack_logical
Definition: lapack.h:103
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:55
#define LAPACK_COL_MAJOR
Definition: lapacke.h:53
#define LAPACK_C2INT(x)
Definition: lapacke.h:49
lapack_int LAPACKE_cgeesx_work(int matrix_layout, char jobvs, char sort, LAPACK_C_SELECT1 select, char sense, lapack_int n, lapack_complex_float *a, lapack_int lda, lapack_int *sdim, lapack_complex_float *w, lapack_complex_float *vs, lapack_int ldvs, float *rconde, float *rcondv, lapack_complex_float *work, lapack_int lwork, float *rwork, lapack_logical *bwork)
#define LAPACKE_free(p)
Definition: lapacke.h:46
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:52
int LAPACKE_get_nancheck(void)
#define LAPACKE_malloc(size)
Definition: lapacke.h:43
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:35
void LAPACKE_xerbla(const char *name, lapack_int info)
#define MAX(x, y)
Definition: lapacke_utils.h:46
lapack_logical LAPACKE_cge_nancheck(int matrix_layout, lapack_int m, lapack_int n, const lapack_complex_float *a, lapack_int lda)
Here is the call graph for this function: