LAPACK  3.7.1
LAPACK: Linear Algebra PACKage

◆ LAPACKE_zhbevx_2stage()

lapack_int LAPACKE_zhbevx_2stage ( int  matrix_layout,
char  jobz,
char  range,
char  uplo,
lapack_int  n,
lapack_int  kd,
lapack_complex_double ab,
lapack_int  ldab,
lapack_complex_double q,
lapack_int  ldq,
double  vl,
double  vu,
lapack_int  il,
lapack_int  iu,
double  abstol,
lapack_int m,
double *  w,
lapack_complex_double z,
lapack_int  ldz,
lapack_int ifail 
)

Definition at line 36 of file lapacke_zhbevx_2stage.c.

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