LAPACK  3.7.1
LAPACK: Linear Algebra PACKage

◆ 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 36 of file lapacke_cgeesx.c.

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