LAPACK  3.6.1
LAPACK: Linear Algebra PACKage
lapack_int LAPACKE_dgeesx ( int  matrix_layout,
char  jobvs,
char  sort,
LAPACK_D_SELECT2  select,
char  sense,
lapack_int  n,
double *  a,
lapack_int  lda,
lapack_int sdim,
double *  wr,
double *  wi,
double *  vs,
lapack_int  ldvs,
double *  rconde,
double *  rcondv 
)

Definition at line 36 of file lapacke_dgeesx.c.

41 {
42  lapack_int info = 0;
43  lapack_int liwork = -1;
44  lapack_int lwork = -1;
45  lapack_logical* bwork = NULL;
46  lapack_int* iwork = NULL;
47  double* work = NULL;
48  lapack_int iwork_query;
49  double work_query;
50  if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
51  LAPACKE_xerbla( "LAPACKE_dgeesx", -1 );
52  return -1;
53  }
54 #ifndef LAPACK_DISABLE_NAN_CHECK
55  /* Optionally check input matrices for NaNs */
56  if( LAPACKE_dge_nancheck( matrix_layout, n, n, a, lda ) ) {
57  return -7;
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  /* Query optimal working array(s) size */
70  info = LAPACKE_dgeesx_work( matrix_layout, jobvs, sort, select, sense, n, a,
71  lda, sdim, wr, wi, vs, ldvs, rconde, rcondv,
72  &work_query, lwork, &iwork_query, liwork,
73  bwork );
74  if( info != 0 ) {
75  goto exit_level_1;
76  }
77  liwork = (lapack_int)iwork_query;
78  lwork = (lapack_int)work_query;
79  /* Allocate memory for work arrays */
80  if( LAPACKE_lsame( sense, 'b' ) || LAPACKE_lsame( sense, 'v' ) ) {
81  iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * liwork );
82  if( iwork == NULL ) {
84  goto exit_level_1;
85  }
86  }
87  work = (double*)LAPACKE_malloc( sizeof(double) * lwork );
88  if( work == NULL ) {
90  goto exit_level_2;
91  }
92  /* Call middle-level interface */
93  info = LAPACKE_dgeesx_work( matrix_layout, jobvs, sort, select, sense, n, a,
94  lda, sdim, wr, wi, vs, ldvs, rconde, rcondv,
95  work, lwork, iwork, liwork, bwork );
96  /* Release memory and exit */
97  LAPACKE_free( work );
98 exit_level_2:
99  if( LAPACKE_lsame( sense, 'b' ) || LAPACKE_lsame( sense, 'v' ) ) {
100  LAPACKE_free( iwork );
101  }
102 exit_level_1:
103  if( LAPACKE_lsame( sort, 's' ) ) {
104  LAPACKE_free( bwork );
105  }
106 exit_level_0:
107  if( info == LAPACK_WORK_MEMORY_ERROR ) {
108  LAPACKE_xerbla( "LAPACKE_dgeesx", info );
109  }
110  return info;
111 }
#define lapack_logical
Definition: lapacke.h:51
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:122
lapack_int LAPACKE_dgeesx_work(int matrix_layout, char jobvs, char sort, LAPACK_D_SELECT2 select, char sense, lapack_int n, double *a, lapack_int lda, lapack_int *sdim, double *wr, double *wi, double *vs, lapack_int ldvs, double *rconde, double *rcondv, double *work, lapack_int lwork, lapack_int *iwork, lapack_int liwork, lapack_logical *bwork)
#define MAX(x, y)
Definition: lapacke_utils.h:47
lapack_logical LAPACKE_dge_nancheck(int matrix_layout, lapack_int m, lapack_int n, const double *a, lapack_int lda)
#define LAPACKE_free(p)
Definition: lapacke.h:113
#define LAPACKE_malloc(size)
Definition: lapacke.h:110
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: