LAPACK  3.8.0
LAPACK: Linear Algebra PACKage

◆ LAPACKE_dsyevr_2stage()

lapack_int LAPACKE_dsyevr_2stage ( int  matrix_layout,
char  jobz,
char  range,
char  uplo,
lapack_int  n,
double *  a,
lapack_int  lda,
double  vl,
double  vu,
lapack_int  il,
lapack_int  iu,
double  abstol,
lapack_int m,
double *  w,
double *  z,
lapack_int  ldz,
lapack_int isuppz 
)

Definition at line 36 of file lapacke_dsyevr_2stage.c.

41 {
42  lapack_int info = 0;
43  lapack_int liwork = -1;
44  lapack_int lwork = -1;
45  lapack_int* iwork = NULL;
46  double* work = NULL;
47  lapack_int iwork_query;
48  double work_query;
49  if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
50  LAPACKE_xerbla( "LAPACKE_dsyevr_2stage", -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_dsy_nancheck( matrix_layout, uplo, n, a, lda ) ) {
57  return -6;
58  }
59  if( LAPACKE_d_nancheck( 1, &abstol, 1 ) ) {
60  return -12;
61  }
62  if( LAPACKE_lsame( range, 'v' ) ) {
63  if( LAPACKE_d_nancheck( 1, &vl, 1 ) ) {
64  return -8;
65  }
66  }
67  if( LAPACKE_lsame( range, 'v' ) ) {
68  if( LAPACKE_d_nancheck( 1, &vu, 1 ) ) {
69  return -9;
70  }
71  }
72  }
73 #endif
74  /* Query optimal working array(s) size */
75  info = LAPACKE_dsyevr_2stage_work( matrix_layout, jobz, range, uplo, n, a, lda, vl,
76  vu, il, iu, abstol, m, w, z, ldz, isuppz,
77  &work_query, lwork, &iwork_query, liwork );
78  if( info != 0 ) {
79  goto exit_level_0;
80  }
81  liwork = (lapack_int)iwork_query;
82  lwork = (lapack_int)work_query;
83  /* Allocate memory for work arrays */
84  iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * liwork );
85  if( iwork == NULL ) {
87  goto exit_level_0;
88  }
89  work = (double*)LAPACKE_malloc( sizeof(double) * lwork );
90  if( work == NULL ) {
92  goto exit_level_1;
93  }
94  /* Call middle-level interface */
95  info = LAPACKE_dsyevr_2stage_work( matrix_layout, jobz, range, uplo, n, a, lda, vl,
96  vu, il, iu, abstol, m, w, z, ldz, isuppz, work,
97  lwork, iwork, liwork );
98  /* Release memory and exit */
99  LAPACKE_free( work );
100 exit_level_1:
101  LAPACKE_free( iwork );
102 exit_level_0:
103  if( info == LAPACK_WORK_MEMORY_ERROR ) {
104  LAPACKE_xerbla( "LAPACKE_dsyevr_2stage", info );
105  }
106  return info;
107 }
#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 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
lapack_logical LAPACKE_dsy_nancheck(int matrix_layout, char uplo, lapack_int n, const double *a, lapack_int lda)
lapack_int LAPACKE_dsyevr_2stage_work(int matrix_layout, char jobz, char range, char uplo, lapack_int n, double *a, lapack_int lda, double vl, double vu, lapack_int il, lapack_int iu, double abstol, lapack_int *m, double *w, double *z, lapack_int ldz, lapack_int *isuppz, double *work, lapack_int lwork, lapack_int *iwork, lapack_int liwork)
int LAPACKE_get_nancheck()
Here is the call graph for this function: