LAPACK  3.9.0
LAPACK: Linear Algebra PACKage

◆ LAPACKE_zgees()

lapack_int LAPACKE_zgees ( int  matrix_layout,
char  jobvs,
char  sort,
LAPACK_Z_SELECT1  select,
lapack_int  n,
lapack_complex_double a,
lapack_int  lda,
lapack_int sdim,
lapack_complex_double w,
lapack_complex_double vs,
lapack_int  ldvs 
)

Definition at line 35 of file lapacke_zgees.c.

41 {
42  lapack_int info = 0;
43  lapack_int lwork = -1;
44  lapack_logical* bwork = NULL;
45  double* rwork = NULL;
46  lapack_complex_double* work = NULL;
47  lapack_complex_double work_query;
48  if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
49  LAPACKE_xerbla( "LAPACKE_zgees", -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_zge_nancheck( matrix_layout, n, n, a, lda ) ) {
56  return -6;
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 = (double*)LAPACKE_malloc( sizeof(double) * MAX(1,n) );
70  if( rwork == NULL ) {
72  goto exit_level_1;
73  }
74  /* Query optimal working array(s) size */
75  info = LAPACKE_zgees_work( matrix_layout, jobvs, sort, select, n, a, lda,
76  sdim, w, vs, ldvs, &work_query, lwork, rwork,
77  bwork );
78  if( info != 0 ) {
79  goto exit_level_2;
80  }
81  lwork = LAPACK_Z2INT( work_query );
82  /* Allocate memory for work arrays */
83  work = (lapack_complex_double*)
84  LAPACKE_malloc( sizeof(lapack_complex_double) * lwork );
85  if( work == NULL ) {
87  goto exit_level_2;
88  }
89  /* Call middle-level interface */
90  info = LAPACKE_zgees_work( matrix_layout, jobvs, sort, select, n, a, lda,
91  sdim, w, vs, ldvs, work, 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_zgees", info );
103  }
104  return info;
Here is the call graph for this function:
LAPACKE_free
#define LAPACKE_free(p)
Definition: lapacke.h:47
lapack_int
#define lapack_int
Definition: lapack.h:21
LAPACK_WORK_MEMORY_ERROR
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:56
LAPACK_Z2INT
#define LAPACK_Z2INT(x)
Definition: lapacke.h:51
LAPACKE_xerbla
void LAPACKE_xerbla(const char *name, lapack_int info)
Definition: lapacke_xerbla.c:36
MAX
#define MAX(x, y)
Definition: lapacke_utils.h:47
lapack_logical
#define lapack_logical
Definition: lapack.h:25
lapack_complex_double
#define lapack_complex_double
Definition: lapack.h:70
LAPACKE_zge_nancheck
lapack_logical LAPACKE_zge_nancheck(int matrix_layout, lapack_int m, lapack_int n, const lapack_complex_double *a, lapack_int lda)
Definition: lapacke_zge_nancheck.c:36
LAPACKE_malloc
#define LAPACKE_malloc(size)
Definition: lapacke.h:44
LAPACKE_zgees_work
lapack_int LAPACKE_zgees_work(int matrix_layout, char jobvs, char sort, LAPACK_Z_SELECT1 select, lapack_int n, lapack_complex_double *a, lapack_int lda, lapack_int *sdim, lapack_complex_double *w, lapack_complex_double *vs, lapack_int ldvs, lapack_complex_double *work, lapack_int lwork, double *rwork, lapack_logical *bwork)
Definition: lapacke_zgees_work.c:35
LAPACKE_get_nancheck
int LAPACKE_get_nancheck()
Definition: lapacke_nancheck.c:42
LAPACKE_lsame
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:35
LAPACK_ROW_MAJOR
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:53
LAPACK_COL_MAJOR
#define LAPACK_COL_MAJOR
Definition: lapacke.h:54