LAPACK  3.9.0
LAPACK: Linear Algebra PACKage

◆ LAPACKE_zheevd_2stage()

lapack_int LAPACKE_zheevd_2stage ( int  matrix_layout,
char  jobz,
char  uplo,
lapack_int  n,
lapack_complex_double a,
lapack_int  lda,
double *  w 
)

Definition at line 35 of file lapacke_zheevd_2stage.c.

38 {
39  lapack_int info = 0;
40  lapack_int liwork = -1;
41  lapack_int lrwork = -1;
42  lapack_int lwork = -1;
43  lapack_int* iwork = NULL;
44  double* rwork = NULL;
45  lapack_complex_double* work = NULL;
46  lapack_int iwork_query;
47  double rwork_query;
48  lapack_complex_double work_query;
49  if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
50  LAPACKE_xerbla( "LAPACKE_zheevd_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_zhe_nancheck( matrix_layout, uplo, n, a, lda ) ) {
57  return -5;
58  }
59  }
60 #endif
61  /* Query optimal working array(s) size */
62  info = LAPACKE_zheevd_2stage_work( matrix_layout, jobz, uplo, n, a, lda, w,
63  &work_query, lwork, &rwork_query, lrwork,
64  &iwork_query, liwork );
65  if( info != 0 ) {
66  goto exit_level_0;
67  }
68  liwork = (lapack_int)iwork_query;
69  lrwork = (lapack_int)rwork_query;
70  lwork = LAPACK_Z2INT( work_query );
71  /* Allocate memory for work arrays */
72  iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * liwork );
73  if( iwork == NULL ) {
75  goto exit_level_0;
76  }
77  rwork = (double*)LAPACKE_malloc( sizeof(double) * lrwork );
78  if( rwork == NULL ) {
80  goto exit_level_1;
81  }
82  work = (lapack_complex_double*)
83  LAPACKE_malloc( sizeof(lapack_complex_double) * lwork );
84  if( work == NULL ) {
86  goto exit_level_2;
87  }
88  /* Call middle-level interface */
89  info = LAPACKE_zheevd_2stage_work( matrix_layout, jobz, uplo, n, a, lda, w, work,
90  lwork, rwork, lrwork, iwork, liwork );
91  /* Release memory and exit */
92  LAPACKE_free( work );
93 exit_level_2:
94  LAPACKE_free( rwork );
95 exit_level_1:
96  LAPACKE_free( iwork );
97 exit_level_0:
98  if( info == LAPACK_WORK_MEMORY_ERROR ) {
99  LAPACKE_xerbla( "LAPACKE_zheevd_2stage", info );
100  }
101  return info;
Here is the call graph for this function:
LAPACKE_free
#define LAPACKE_free(p)
Definition: lapacke.h:47
lapack_int
#define lapack_int
Definition: lapack.h:21
LAPACK_WORK_MEMORY_ERROR
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:56
LAPACK_Z2INT
#define LAPACK_Z2INT(x)
Definition: lapacke.h:51
LAPACKE_xerbla
void LAPACKE_xerbla(const char *name, lapack_int info)
Definition: lapacke_xerbla.c:36
lapack_complex_double
#define lapack_complex_double
Definition: lapack.h:70
LAPACKE_zhe_nancheck
lapack_logical LAPACKE_zhe_nancheck(int matrix_layout, char uplo, lapack_int n, const lapack_complex_double *a, lapack_int lda)
Definition: lapacke_zhe_nancheck.c:36
LAPACKE_zheevd_2stage_work
lapack_int LAPACKE_zheevd_2stage_work(int matrix_layout, char jobz, char uplo, lapack_int n, lapack_complex_double *a, lapack_int lda, double *w, lapack_complex_double *work, lapack_int lwork, double *rwork, lapack_int lrwork, lapack_int *iwork, lapack_int liwork)
Definition: lapacke_zheevd_2stage_work.c:35
LAPACKE_malloc
#define LAPACKE_malloc(size)
Definition: lapacke.h:44
LAPACKE_get_nancheck
int LAPACKE_get_nancheck()
Definition: lapacke_nancheck.c:42
LAPACK_ROW_MAJOR
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:53
LAPACK_COL_MAJOR
#define LAPACK_COL_MAJOR
Definition: lapacke.h:54