LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches

◆ LAPACKE_ssbevx_2stage()

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

Definition at line 35 of file lapacke_ssbevx_2stage.c.

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