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

◆ LAPACKE_dggesx()

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 35 of file lapacke_dggesx.c.

42{
43 lapack_int info = 0;
44 lapack_int liwork = -1;
45 lapack_int lwork = -1;
46 lapack_logical* bwork = NULL;
47 lapack_int* iwork = NULL;
48 double* work = NULL;
49 lapack_int iwork_query;
50 double work_query;
51 if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
52 LAPACKE_xerbla( "LAPACKE_dggesx", -1 );
53 return -1;
54 }
55#ifndef LAPACK_DISABLE_NAN_CHECK
56 if( LAPACKE_get_nancheck() ) {
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 }
65#endif
66 /* Allocate memory for working array(s) */
67 if( LAPACKE_lsame( sort, 's' ) ) {
68 bwork = (lapack_logical*)
69 LAPACKE_malloc( sizeof(lapack_logical) * MAX(1,n) );
70 if( bwork == NULL ) {
72 goto exit_level_0;
73 }
74 }
75 /* Query optimal working array(s) size */
76 info = LAPACKE_dggesx_work( matrix_layout, jobvsl, jobvsr, sort, selctg,
77 sense, n, a, lda, b, ldb, sdim, alphar, alphai,
78 beta, vsl, ldvsl, vsr, ldvsr, rconde, rcondv,
79 &work_query, lwork, &iwork_query, liwork,
80 bwork );
81 if( info != 0 ) {
82 goto exit_level_1;
83 }
84 liwork = iwork_query;
85 lwork = (lapack_int)work_query;
86 /* Allocate memory for work arrays */
87 iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * liwork );
88 if( iwork == NULL ) {
90 goto exit_level_1;
91 }
92 work = (double*)LAPACKE_malloc( sizeof(double) * lwork );
93 if( work == NULL ) {
95 goto exit_level_2;
96 }
97 /* Call middle-level interface */
98 info = LAPACKE_dggesx_work( matrix_layout, jobvsl, jobvsr, sort, selctg,
99 sense, n, a, lda, b, ldb, sdim, alphar, alphai,
100 beta, vsl, ldvsl, vsr, ldvsr, rconde, rcondv,
101 work, lwork, iwork, liwork, bwork );
102 /* Release memory and exit */
103 LAPACKE_free( work );
104exit_level_2:
105 LAPACKE_free( iwork );
106exit_level_1:
107 if( LAPACKE_lsame( sort, 's' ) ) {
108 LAPACKE_free( bwork );
109 }
110exit_level_0:
111 if( info == LAPACK_WORK_MEMORY_ERROR ) {
112 LAPACKE_xerbla( "LAPACKE_dggesx", info );
113 }
114 return info;
115}
#define lapack_int
Definition: lapack.h:87
#define lapack_logical
Definition: lapack.h:103
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:55
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)
#define LAPACK_COL_MAJOR
Definition: lapacke.h:53
#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_dge_nancheck(int matrix_layout, lapack_int m, lapack_int n, const double *a, lapack_int lda)
Here is the call graph for this function: