LAPACK  3.8.0
LAPACK: Linear Algebra PACKage

◆ LAPACKE_dsbevx_2stage()

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

Definition at line 36 of file lapacke_dsbevx_2stage.c.

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