LAPACK  3.7.1
LAPACK: Linear Algebra PACKage

◆ LAPACKE_cheevx_2stage()

lapack_int LAPACKE_cheevx_2stage ( int  matrix_layout,
char  jobz,
char  range,
char  uplo,
lapack_int  n,
lapack_complex_float a,
lapack_int  lda,
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_cheevx_2stage.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_cheevx_2stage", -1 );
51  return -1;
52  }
53 #ifndef LAPACK_DISABLE_NAN_CHECK
54  /* Optionally check input matrices for NaNs */
55  if( LAPACKE_che_nancheck( matrix_layout, uplo, n, a, lda ) ) {
56  return -6;
57  }
58  if( LAPACKE_s_nancheck( 1, &abstol, 1 ) ) {
59  return -12;
60  }
61  if( LAPACKE_lsame( range, 'v' ) ) {
62  if( LAPACKE_s_nancheck( 1, &vl, 1 ) ) {
63  return -8;
64  }
65  }
66  if( LAPACKE_lsame( range, 'v' ) ) {
67  if( LAPACKE_s_nancheck( 1, &vu, 1 ) ) {
68  return -9;
69  }
70  }
71 #endif
72  /* Allocate memory for working array(s) */
73  iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * MAX(1,5*n) );
74  if( iwork == NULL ) {
76  goto exit_level_0;
77  }
78  rwork = (float*)LAPACKE_malloc( sizeof(float) * MAX(1,7*n) );
79  if( rwork == NULL ) {
81  goto exit_level_1;
82  }
83  /* Query optimal working array(s) size */
84  info = LAPACKE_cheevx_2stage_work( matrix_layout, jobz, range, uplo, n, a, lda, vl,
85  vu, il, iu, abstol, m, w, z, ldz, &work_query,
86  lwork, rwork, iwork, ifail );
87  if( info != 0 ) {
88  goto exit_level_2;
89  }
90  lwork = LAPACK_C2INT( work_query );
91  /* Allocate memory for work arrays */
92  work = (lapack_complex_float*)
93  LAPACKE_malloc( sizeof(lapack_complex_float) * lwork );
94  if( work == NULL ) {
96  goto exit_level_2;
97  }
98  /* Call middle-level interface */
99  info = LAPACKE_cheevx_2stage_work( matrix_layout, jobz, range, uplo, n, a, lda, vl,
100  vu, il, iu, abstol, m, w, z, ldz, work, lwork,
101  rwork, iwork, ifail );
102  /* Release memory and exit */
103  LAPACKE_free( work );
104 exit_level_2:
105  LAPACKE_free( rwork );
106 exit_level_1:
107  LAPACKE_free( iwork );
108 exit_level_0:
109  if( info == LAPACK_WORK_MEMORY_ERROR ) {
110  LAPACKE_xerbla( "LAPACKE_cheevx_2stage", info );
111  }
112  return info;
113 }
#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_int LAPACKE_cheevx_2stage_work(int matrix_layout, char jobz, char range, char uplo, lapack_int n, lapack_complex_float *a, lapack_int lda, 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)
#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_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: