LAPACK  3.10.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 35 of file lapacke_chegvx.c.

42 {
43  lapack_int info = 0;
44  lapack_int lwork = -1;
45  lapack_int* iwork = NULL;
46  float* rwork = NULL;
47  lapack_complex_float* work = NULL;
48  lapack_complex_float work_query;
49  if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
50  LAPACKE_xerbla( "LAPACKE_chegvx", -1 );
51  return -1;
52  }
53 #ifndef LAPACK_DISABLE_NAN_CHECK
54  if( LAPACKE_get_nancheck() ) {
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_che_nancheck( matrix_layout, uplo, 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  }
76 #endif
77  /* Allocate memory for working array(s) */
78  iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * MAX(1,5*n) );
79  if( iwork == NULL ) {
81  goto exit_level_0;
82  }
83  rwork = (float*)LAPACKE_malloc( sizeof(float) * MAX(1,7*n) );
84  if( rwork == NULL ) {
86  goto exit_level_1;
87  }
88  /* Query optimal working array(s) size */
89  info = LAPACKE_chegvx_work( matrix_layout, itype, jobz, range, uplo, n, a,
90  lda, b, ldb, vl, vu, il, iu, abstol, m, w, z,
91  ldz, &work_query, lwork, rwork, iwork, ifail );
92  if( info != 0 ) {
93  goto exit_level_2;
94  }
95  lwork = LAPACK_C2INT( work_query );
96  /* Allocate memory for work arrays */
97  work = (lapack_complex_float*)
98  LAPACKE_malloc( sizeof(lapack_complex_float) * lwork );
99  if( work == NULL ) {
101  goto exit_level_2;
102  }
103  /* Call middle-level interface */
104  info = LAPACKE_chegvx_work( matrix_layout, itype, jobz, range, uplo, n, a,
105  lda, b, ldb, vl, vu, il, iu, abstol, m, w, z,
106  ldz, work, lwork, rwork, iwork, ifail );
107  /* Release memory and exit */
108  LAPACKE_free( work );
109 exit_level_2:
110  LAPACKE_free( rwork );
111 exit_level_1:
112  LAPACKE_free( iwork );
113 exit_level_0:
114  if( info == LAPACK_WORK_MEMORY_ERROR ) {
115  LAPACKE_xerbla( "LAPACKE_chegvx", info );
116  }
117  return info;
118 }
#define lapack_int
Definition: lapack.h:83
#define lapack_complex_float
Definition: lapack.h:45
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:55
#define LAPACK_COL_MAJOR
Definition: lapacke.h:53
#define LAPACK_C2INT(x)
Definition: lapacke.h:49
#define LAPACKE_free(p)
Definition: lapacke.h:46
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:52
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)
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)
lapack_logical LAPACKE_che_nancheck(int matrix_layout, char uplo, lapack_int n, const lapack_complex_float *a, lapack_int lda)
lapack_logical LAPACKE_s_nancheck(lapack_int n, const float *x, lapack_int incx)
#define MAX(x, y)
Definition: lapacke_utils.h:46
Here is the call graph for this function: