LAPACK  3.7.1
LAPACK: Linear Algebra PACKage

◆ LAPACKE_chegvx()

lapack_int LAPACKE_chegvx ( int  matrix_layout,
lapack_int  itype,
char  jobz,
char  range,
char  uplo,
lapack_int  n,
lapack_complex_float a,
lapack_int  lda,
lapack_complex_float b,
lapack_int  ldb,
float  vl,
float  vu,
lapack_int  il,
lapack_int  iu,
float  abstol,
lapack_int m,
float *  w,
lapack_complex_float z,
lapack_int  ldz,
lapack_int ifail 
)

Definition at line 36 of file lapacke_chegvx.c.

43 {
44  lapack_int info = 0;
45  lapack_int lwork = -1;
46  lapack_int* iwork = NULL;
47  float* rwork = NULL;
48  lapack_complex_float* work = NULL;
49  lapack_complex_float work_query;
50  if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
51  LAPACKE_xerbla( "LAPACKE_chegvx", -1 );
52  return -1;
53  }
54 #ifndef LAPACK_DISABLE_NAN_CHECK
55  /* Optionally check input matrices for NaNs */
56  if( LAPACKE_che_nancheck( matrix_layout, uplo, n, a, lda ) ) {
57  return -7;
58  }
59  if( LAPACKE_s_nancheck( 1, &abstol, 1 ) ) {
60  return -15;
61  }
62  if( LAPACKE_cge_nancheck( matrix_layout, n, n, b, ldb ) ) {
63  return -9;
64  }
65  if( LAPACKE_lsame( range, 'v' ) ) {
66  if( LAPACKE_s_nancheck( 1, &vl, 1 ) ) {
67  return -11;
68  }
69  }
70  if( LAPACKE_lsame( range, 'v' ) ) {
71  if( LAPACKE_s_nancheck( 1, &vu, 1 ) ) {
72  return -12;
73  }
74  }
75 #endif
76  /* Allocate memory for working array(s) */
77  iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * MAX(1,5*n) );
78  if( iwork == NULL ) {
80  goto exit_level_0;
81  }
82  rwork = (float*)LAPACKE_malloc( sizeof(float) * MAX(1,7*n) );
83  if( rwork == NULL ) {
85  goto exit_level_1;
86  }
87  /* Query optimal working array(s) size */
88  info = LAPACKE_chegvx_work( matrix_layout, itype, jobz, range, uplo, n, a,
89  lda, b, ldb, vl, vu, il, iu, abstol, m, w, z,
90  ldz, &work_query, lwork, rwork, iwork, ifail );
91  if( info != 0 ) {
92  goto exit_level_2;
93  }
94  lwork = LAPACK_C2INT( work_query );
95  /* Allocate memory for work arrays */
96  work = (lapack_complex_float*)
97  LAPACKE_malloc( sizeof(lapack_complex_float) * lwork );
98  if( work == NULL ) {
100  goto exit_level_2;
101  }
102  /* Call middle-level interface */
103  info = LAPACKE_chegvx_work( matrix_layout, itype, jobz, range, uplo, n, a,
104  lda, b, ldb, vl, vu, il, iu, abstol, m, w, z,
105  ldz, work, lwork, rwork, iwork, ifail );
106  /* Release memory and exit */
107  LAPACKE_free( work );
108 exit_level_2:
109  LAPACKE_free( rwork );
110 exit_level_1:
111  LAPACKE_free( iwork );
112 exit_level_0:
113  if( info == LAPACK_WORK_MEMORY_ERROR ) {
114  LAPACKE_xerbla( "LAPACKE_chegvx", info );
115  }
116  return info;
117 }
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:122
#define LAPACKE_free(p)
Definition: lapacke.h:113
#define lapack_complex_float
Definition: lapacke.h:74
lapack_logical LAPACKE_s_nancheck(lapack_int n, const float *x, lapack_int incx)
lapack_logical LAPACKE_cge_nancheck(int matrix_layout, lapack_int m, lapack_int n, const lapack_complex_float *a, lapack_int lda)
#define MAX(x, y)
Definition: lapacke_utils.h:47
#define LAPACKE_malloc(size)
Definition: lapacke.h:110
#define LAPACK_C2INT(x)
Definition: lapacke.h:116
lapack_int LAPACKE_chegvx_work(int matrix_layout, lapack_int itype, char jobz, char range, char uplo, lapack_int n, lapack_complex_float *a, lapack_int lda, lapack_complex_float *b, lapack_int ldb, float vl, float vu, lapack_int il, lapack_int iu, float abstol, lapack_int *m, float *w, lapack_complex_float *z, lapack_int ldz, lapack_complex_float *work, lapack_int lwork, float *rwork, lapack_int *iwork, lapack_int *ifail)
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)
lapack_logical LAPACKE_che_nancheck(int matrix_layout, char uplo, lapack_int n, const lapack_complex_float *a, lapack_int lda)
#define lapack_int
Definition: lapacke.h:47
Here is the call graph for this function: