LAPACK  3.6.1
LAPACK: Linear Algebra PACKage
lapack_int LAPACKE_dggesx ( int  matrix_layout,
char  jobvsl,
char  jobvsr,
char  sort,
LAPACK_D_SELECT3  selctg,
char  sense,
lapack_int  n,
double *  a,
lapack_int  lda,
double *  b,
lapack_int  ldb,
lapack_int sdim,
double *  alphar,
double *  alphai,
double *  beta,
double *  vsl,
lapack_int  ldvsl,
double *  vsr,
lapack_int  ldvsr,
double *  rconde,
double *  rcondv 
)

Definition at line 36 of file lapacke_dggesx.c.

43 {
44  lapack_int info = 0;
45  lapack_int liwork = -1;
46  lapack_int lwork = -1;
47  lapack_logical* bwork = NULL;
48  lapack_int* iwork = NULL;
49  double* work = NULL;
50  lapack_int iwork_query;
51  double work_query;
52  if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
53  LAPACKE_xerbla( "LAPACKE_dggesx", -1 );
54  return -1;
55  }
56 #ifndef LAPACK_DISABLE_NAN_CHECK
57  /* Optionally check input matrices for NaNs */
58  if( LAPACKE_dge_nancheck( matrix_layout, n, n, a, lda ) ) {
59  return -8;
60  }
61  if( LAPACKE_dge_nancheck( matrix_layout, n, n, b, ldb ) ) {
62  return -10;
63  }
64 #endif
65  /* Allocate memory for working array(s) */
66  if( LAPACKE_lsame( sort, 's' ) ) {
67  bwork = (lapack_logical*)
68  LAPACKE_malloc( sizeof(lapack_logical) * MAX(1,n) );
69  if( bwork == NULL ) {
71  goto exit_level_0;
72  }
73  }
74  /* Query optimal working array(s) size */
75  info = LAPACKE_dggesx_work( matrix_layout, jobvsl, jobvsr, sort, selctg,
76  sense, n, a, lda, b, ldb, sdim, alphar, alphai,
77  beta, vsl, ldvsl, vsr, ldvsr, rconde, rcondv,
78  &work_query, lwork, &iwork_query, liwork,
79  bwork );
80  if( info != 0 ) {
81  goto exit_level_1;
82  }
83  liwork = (lapack_int)iwork_query;
84  lwork = (lapack_int)work_query;
85  /* Allocate memory for work arrays */
86  iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * liwork );
87  if( iwork == NULL ) {
89  goto exit_level_1;
90  }
91  work = (double*)LAPACKE_malloc( sizeof(double) * lwork );
92  if( work == NULL ) {
94  goto exit_level_2;
95  }
96  /* Call middle-level interface */
97  info = LAPACKE_dggesx_work( matrix_layout, jobvsl, jobvsr, sort, selctg,
98  sense, n, a, lda, b, ldb, sdim, alphar, alphai,
99  beta, vsl, ldvsl, vsr, ldvsr, rconde, rcondv,
100  work, lwork, iwork, liwork, bwork );
101  /* Release memory and exit */
102  LAPACKE_free( work );
103 exit_level_2:
104  LAPACKE_free( iwork );
105 exit_level_1:
106  if( LAPACKE_lsame( sort, 's' ) ) {
107  LAPACKE_free( bwork );
108  }
109 exit_level_0:
110  if( info == LAPACK_WORK_MEMORY_ERROR ) {
111  LAPACKE_xerbla( "LAPACKE_dggesx", info );
112  }
113  return info;
114 }
#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 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
lapack_int LAPACKE_dggesx_work(int matrix_layout, char jobvsl, char jobvsr, char sort, LAPACK_D_SELECT3 selctg, char sense, lapack_int n, double *a, lapack_int lda, double *b, lapack_int ldb, lapack_int *sdim, double *alphar, double *alphai, double *beta, double *vsl, lapack_int ldvsl, double *vsr, lapack_int ldvsr, double *rconde, double *rcondv, double *work, lapack_int lwork, lapack_int *iwork, lapack_int liwork, lapack_logical *bwork)

Here is the call graph for this function: