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

◆ LAPACKE_dsyevx_2stage_work()

lapack_int LAPACKE_dsyevx_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,
double *  work,
lapack_int  lwork,
lapack_int iwork,
lapack_int ifail 
)

Definition at line 35 of file lapacke_dsyevx_2stage_work.c.

42{
43 lapack_int info = 0;
44 if( matrix_layout == LAPACK_COL_MAJOR ) {
45 /* Call LAPACK function and adjust info */
46 LAPACK_dsyevx_2stage( &jobz, &range, &uplo, &n, a, &lda, &vl, &vu, &il, &iu,
47 &abstol, m, w, z, &ldz, work, &lwork, iwork, ifail,
48 &info );
49 if( info < 0 ) {
50 info = info - 1;
51 }
52 } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
53 lapack_int ncols_z = ( LAPACKE_lsame( range, 'a' ) ||
54 LAPACKE_lsame( range, 'v' ) ) ? n :
55 ( LAPACKE_lsame( range, 'i' ) ? (iu-il+1) : 1);
56 lapack_int lda_t = MAX(1,n);
57 lapack_int ldz_t = MAX(1,n);
58 double* a_t = NULL;
59 double* z_t = NULL;
60 /* Check leading dimension(s) */
61 if( lda < n ) {
62 info = -7;
63 LAPACKE_xerbla( "LAPACKE_dsyevx_2stage_work", info );
64 return info;
65 }
66 if( ldz < ncols_z ) {
67 info = -16;
68 LAPACKE_xerbla( "LAPACKE_dsyevx_2stage_work", info );
69 return info;
70 }
71 /* Query optimal working array(s) size if requested */
72 if( lwork == -1 ) {
73 LAPACK_dsyevx_2stage( &jobz, &range, &uplo, &n, a, &lda_t, &vl, &vu, &il,
74 &iu, &abstol, m, w, z, &ldz_t, work, &lwork, iwork,
75 ifail, &info );
76 return (info < 0) ? (info - 1) : info;
77 }
78 /* Allocate memory for temporary array(s) */
79 a_t = (double*)LAPACKE_malloc( sizeof(double) * lda_t * MAX(1,n) );
80 if( a_t == NULL ) {
82 goto exit_level_0;
83 }
84 if( LAPACKE_lsame( jobz, 'v' ) ) {
85 z_t = (double*)
86 LAPACKE_malloc( sizeof(double) * ldz_t * MAX(1,ncols_z) );
87 if( z_t == NULL ) {
89 goto exit_level_1;
90 }
91 }
92 /* Transpose input matrices */
93 LAPACKE_dsy_trans( matrix_layout, uplo, n, a, lda, a_t, lda_t );
94 /* Call LAPACK function and adjust info */
95 LAPACK_dsyevx_2stage( &jobz, &range, &uplo, &n, a_t, &lda_t, &vl, &vu, &il,
96 &iu, &abstol, m, w, z_t, &ldz_t, work, &lwork, iwork,
97 ifail, &info );
98 if( info < 0 ) {
99 info = info - 1;
100 }
101 /* Transpose output matrices */
102 LAPACKE_dsy_trans( LAPACK_COL_MAJOR, uplo, n, a_t, lda_t, a, lda );
103 if( LAPACKE_lsame( jobz, 'v' ) ) {
104 LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, ncols_z, z_t, ldz_t, z,
105 ldz );
106 }
107 /* Release memory and exit */
108 if( LAPACKE_lsame( jobz, 'v' ) ) {
109 LAPACKE_free( z_t );
110 }
111exit_level_1:
112 LAPACKE_free( a_t );
113exit_level_0:
114 if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
115 LAPACKE_xerbla( "LAPACKE_dsyevx_2stage_work", info );
116 }
117 } else {
118 info = -1;
119 LAPACKE_xerbla( "LAPACKE_dsyevx_2stage_work", info );
120 }
121 return info;
122}
#define LAPACK_dsyevx_2stage(...)
Definition: lapack.h:17327
#define lapack_int
Definition: lapack.h:87
#define LAPACK_COL_MAJOR
Definition: lapacke.h:53
#define LAPACKE_free(p)
Definition: lapacke.h:46
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:52
#define LAPACKE_malloc(size)
Definition: lapacke.h:43
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:56
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:35
void LAPACKE_xerbla(const char *name, lapack_int info)
#define MAX(x, y)
Definition: lapacke_utils.h:46
void LAPACKE_dge_trans(int matrix_layout, lapack_int m, lapack_int n, const double *in, lapack_int ldin, double *out, lapack_int ldout)
void LAPACKE_dsy_trans(int matrix_layout, char uplo, lapack_int n, const double *in, lapack_int ldin, double *out, lapack_int ldout)
Here is the call graph for this function:
Here is the caller graph for this function: