LAPACK  3.6.1
LAPACK: Linear Algebra PACKage
lapack_int LAPACKE_ztgsna ( int  matrix_layout,
char  job,
char  howmny,
const lapack_logical select,
lapack_int  n,
const lapack_complex_double a,
lapack_int  lda,
const lapack_complex_double b,
lapack_int  ldb,
const lapack_complex_double vl,
lapack_int  ldvl,
const lapack_complex_double vr,
lapack_int  ldvr,
double *  s,
double *  dif,
lapack_int  mm,
lapack_int m 
)

Definition at line 36 of file lapacke_ztgsna.c.

44 {
45  lapack_int info = 0;
46  lapack_int lwork = -1;
47  lapack_int* iwork = NULL;
48  lapack_complex_double* work = NULL;
49  lapack_complex_double work_query;
50  if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
51  LAPACKE_xerbla( "LAPACKE_ztgsna", -1 );
52  return -1;
53  }
54 #ifndef LAPACK_DISABLE_NAN_CHECK
55  /* Optionally check input matrices for NaNs */
56  if( LAPACKE_zge_nancheck( matrix_layout, n, n, a, lda ) ) {
57  return -6;
58  }
59  if( LAPACKE_zge_nancheck( matrix_layout, n, n, b, ldb ) ) {
60  return -8;
61  }
62  if( LAPACKE_lsame( job, 'b' ) || LAPACKE_lsame( job, 'e' ) ) {
63  if( LAPACKE_zge_nancheck( matrix_layout, n, mm, vl, ldvl ) ) {
64  return -10;
65  }
66  }
67  if( LAPACKE_lsame( job, 'b' ) || LAPACKE_lsame( job, 'e' ) ) {
68  if( LAPACKE_zge_nancheck( matrix_layout, n, mm, vr, ldvr ) ) {
69  return -12;
70  }
71  }
72 #endif
73  /* Allocate memory for working array(s) */
74  if( LAPACKE_lsame( job, 'b' ) || LAPACKE_lsame( job, 'v' ) ) {
75  iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * MAX(1,n+2) );
76  if( iwork == NULL ) {
78  goto exit_level_0;
79  }
80  }
81  /* Query optimal working array(s) size */
82  info = LAPACKE_ztgsna_work( matrix_layout, job, howmny, select, n, a, lda, b,
83  ldb, vl, ldvl, vr, ldvr, s, dif, mm, m,
84  &work_query, lwork, iwork );
85  if( info != 0 ) {
86  goto exit_level_1;
87  }
88  lwork = LAPACK_Z2INT( work_query );
89  /* Allocate memory for work arrays */
90  if( LAPACKE_lsame( job, 'b' ) || LAPACKE_lsame( job, 'v' ) ) {
91  work = (lapack_complex_double*)
92  LAPACKE_malloc( sizeof(lapack_complex_double) * lwork );
93  if( work == NULL ) {
95  goto exit_level_1;
96  }
97  }
98  /* Call middle-level interface */
99  info = LAPACKE_ztgsna_work( matrix_layout, job, howmny, select, n, a, lda, b,
100  ldb, vl, ldvl, vr, ldvr, s, dif, mm, m, work,
101  lwork, iwork );
102  /* Release memory and exit */
103  if( LAPACKE_lsame( job, 'b' ) || LAPACKE_lsame( job, 'v' ) ) {
104  LAPACKE_free( work );
105  }
106 exit_level_1:
107  if( LAPACKE_lsame( job, 'b' ) || LAPACKE_lsame( job, 'v' ) ) {
108  LAPACKE_free( iwork );
109  }
110 exit_level_0:
111  if( info == LAPACK_WORK_MEMORY_ERROR ) {
112  LAPACKE_xerbla( "LAPACKE_ztgsna", info );
113  }
114  return info;
115 }
#define LAPACK_Z2INT(x)
Definition: lapacke.h:117
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:122
#define lapack_complex_double
Definition: lapacke.h:90
#define MAX(x, y)
Definition: lapacke_utils.h:47
#define LAPACKE_free(p)
Definition: lapacke.h:113
lapack_int LAPACKE_ztgsna_work(int matrix_layout, char job, char howmny, const lapack_logical *select, lapack_int n, const lapack_complex_double *a, lapack_int lda, const lapack_complex_double *b, lapack_int ldb, const lapack_complex_double *vl, lapack_int ldvl, const lapack_complex_double *vr, lapack_int ldvr, double *s, double *dif, lapack_int mm, lapack_int *m, lapack_complex_double *work, lapack_int lwork, lapack_int *iwork)
#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_logical LAPACKE_zge_nancheck(int matrix_layout, lapack_int m, lapack_int n, const lapack_complex_double *a, lapack_int lda)

Here is the call graph for this function: