LAPACK  3.5.0
LAPACK: Linear Algebra PACKage
 All Classes Files Functions Variables Typedefs Macros
lapacke_dggevx.c File Reference
#include "lapacke_utils.h"
Include dependency graph for lapacke_dggevx.c:

Go to the source code of this file.

Functions/Subroutines

lapack_int LAPACKE_dggevx (int matrix_order, char balanc, char jobvl, char jobvr, char sense, lapack_int n, double *a, lapack_int lda, double *b, lapack_int ldb, double *alphar, double *alphai, double *beta, double *vl, lapack_int ldvl, double *vr, lapack_int ldvr, lapack_int *ilo, lapack_int *ihi, double *lscale, double *rscale, double *abnrm, double *bbnrm, double *rconde, double *rcondv)

Function/Subroutine Documentation

lapack_int LAPACKE_dggevx ( int  matrix_order,
char  balanc,
char  jobvl,
char  jobvr,
char  sense,
lapack_int  n,
double *  a,
lapack_int  lda,
double *  b,
lapack_int  ldb,
double *  alphar,
double *  alphai,
double *  beta,
double *  vl,
lapack_int  ldvl,
double *  vr,
lapack_int  ldvr,
lapack_int ilo,
lapack_int ihi,
double *  lscale,
double *  rscale,
double *  abnrm,
double *  bbnrm,
double *  rconde,
double *  rcondv 
)

Definition at line 36 of file lapacke_dggevx.c.

{
lapack_int info = 0;
lapack_int lwork = -1;
lapack_logical* bwork = NULL;
lapack_int* iwork = NULL;
double* work = NULL;
double work_query;
if( matrix_order != LAPACK_COL_MAJOR && matrix_order != LAPACK_ROW_MAJOR ) {
LAPACKE_xerbla( "LAPACKE_dggevx", -1 );
return -1;
}
#ifndef LAPACK_DISABLE_NAN_CHECK
/* Optionally check input matrices for NaNs */
if( LAPACKE_dge_nancheck( matrix_order, n, n, a, lda ) ) {
return -7;
}
if( LAPACKE_dge_nancheck( matrix_order, n, n, b, ldb ) ) {
return -9;
}
#endif
/* Allocate memory for working array(s) */
if( LAPACKE_lsame( sense, 'b' ) || LAPACKE_lsame( sense, 'e' ) ||
LAPACKE_lsame( sense, 'v' ) ) {
bwork = (lapack_logical*)
LAPACKE_malloc( sizeof(lapack_logical) * MAX(1,n) );
if( bwork == NULL ) {
goto exit_level_0;
}
}
if( LAPACKE_lsame( sense, 'b' ) || LAPACKE_lsame( sense, 'n' ) ||
LAPACKE_lsame( sense, 'v' ) ) {
iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * MAX(1,n+6) );
if( iwork == NULL ) {
goto exit_level_1;
}
}
/* Query optimal working array(s) size */
info = LAPACKE_dggevx_work( matrix_order, balanc, jobvl, jobvr, sense, n, a,
lda, b, ldb, alphar, alphai, beta, vl, ldvl, vr,
ldvr, ilo, ihi, lscale, rscale, abnrm, bbnrm,
rconde, rcondv, &work_query, lwork, iwork,
bwork );
if( info != 0 ) {
goto exit_level_2;
}
lwork = (lapack_int)work_query;
/* Allocate memory for work arrays */
work = (double*)LAPACKE_malloc( sizeof(double) * lwork );
if( work == NULL ) {
goto exit_level_2;
}
/* Call middle-level interface */
info = LAPACKE_dggevx_work( matrix_order, balanc, jobvl, jobvr, sense, n, a,
lda, b, ldb, alphar, alphai, beta, vl, ldvl, vr,
ldvr, ilo, ihi, lscale, rscale, abnrm, bbnrm,
rconde, rcondv, work, lwork, iwork, bwork );
/* Release memory and exit */
LAPACKE_free( work );
exit_level_2:
if( LAPACKE_lsame( sense, 'b' ) || LAPACKE_lsame( sense, 'n' ) ||
LAPACKE_lsame( sense, 'v' ) ) {
LAPACKE_free( iwork );
}
exit_level_1:
if( LAPACKE_lsame( sense, 'b' ) || LAPACKE_lsame( sense, 'e' ) ||
LAPACKE_lsame( sense, 'v' ) ) {
LAPACKE_free( bwork );
}
exit_level_0:
if( info == LAPACK_WORK_MEMORY_ERROR ) {
LAPACKE_xerbla( "LAPACKE_dggevx", info );
}
return info;
}

Here is the call graph for this function: