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

◆ LAPACKE_chbevx_2stage_work()

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

Definition at line 35 of file lapacke_chbevx_2stage_work.c.

45{
46 lapack_int info = 0;
47 if( matrix_layout == LAPACK_COL_MAJOR ) {
48 /* Call LAPACK function and adjust info */
49 LAPACK_chbevx_2stage( &jobz, &range, &uplo, &n, &kd, ab, &ldab, q, &ldq, &vl,
50 &vu, &il, &iu, &abstol, m, w, z, &ldz, work, &lwork, rwork,
51 iwork, ifail, &info );
52 if( info < 0 ) {
53 info = info - 1;
54 }
55 } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
56 lapack_int ncols_z = ( LAPACKE_lsame( range, 'a' ) ||
57 LAPACKE_lsame( range, 'v' ) ) ? n :
58 ( LAPACKE_lsame( range, 'i' ) ? (iu-il+1) : 1);
59 lapack_int ldab_t = MAX(1,kd+1);
60 lapack_int ldq_t = MAX(1,n);
61 lapack_int ldz_t = MAX(1,n);
62 lapack_complex_float* ab_t = NULL;
63 lapack_complex_float* q_t = NULL;
64 lapack_complex_float* z_t = NULL;
65 /* Check leading dimension(s) */
66 if( ldab < n ) {
67 info = -8;
68 LAPACKE_xerbla( "LAPACKE_chbevx_2stage_work", info );
69 return info;
70 }
71 if( ldq < n ) {
72 info = -10;
73 LAPACKE_xerbla( "LAPACKE_chbevx_2stage_work", info );
74 return info;
75 }
76 if( ldz < ncols_z ) {
77 info = -19;
78 LAPACKE_xerbla( "LAPACKE_chbevx_2stage_work", info );
79 return info;
80 }
81 /* Allocate memory for temporary array(s) */
82 ab_t = (lapack_complex_float*)
83 LAPACKE_malloc( sizeof(lapack_complex_float) * ldab_t * MAX(1,n) );
84 if( ab_t == NULL ) {
85 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
86 goto exit_level_0;
87 }
88 if( LAPACKE_lsame( jobz, 'v' ) ) {
89 q_t = (lapack_complex_float*)
90 LAPACKE_malloc( sizeof(lapack_complex_float) *
91 ldq_t * MAX(1,n) );
92 if( q_t == NULL ) {
93 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
94 goto exit_level_1;
95 }
96 }
97 if( LAPACKE_lsame( jobz, 'v' ) ) {
98 z_t = (lapack_complex_float*)
99 LAPACKE_malloc( sizeof(lapack_complex_float) *
100 ldz_t * MAX(1,ncols_z) );
101 if( z_t == NULL ) {
102 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
103 goto exit_level_2;
104 }
105 }
106 /* Query optimal working array(s) size if requested */
107 if( lwork == -1 ) {
108 LAPACK_chbevx_2stage( &jobz, &range, &uplo, &n, &kd, ab_t, &ldab_t, q_t,
109 &ldq_t, &vl, &vu, &il, &iu, &abstol, m, w, z_t, &ldz_t,
110 work, &lwork, rwork, iwork, ifail, &info );
111 return (info < 0) ? (info - 1) : info;
112 }
113 /* Transpose input matrices */
114 LAPACKE_chb_trans( matrix_layout, uplo, n, kd, ab, ldab, ab_t, ldab_t );
115 /* Call LAPACK function and adjust info */
116 LAPACK_chbevx_2stage( &jobz, &range, &uplo, &n, &kd, ab_t, &ldab_t, q_t,
117 &ldq_t, &vl, &vu, &il, &iu, &abstol, m, w, z_t, &ldz_t,
118 work, &lwork, rwork, iwork, ifail, &info );
119 if( info < 0 ) {
120 info = info - 1;
121 }
122 /* Transpose output matrices */
123 LAPACKE_chb_trans( LAPACK_COL_MAJOR, uplo, n, kd, ab_t, ldab_t, ab,
124 ldab );
125 if( LAPACKE_lsame( jobz, 'v' ) ) {
126 LAPACKE_cge_trans( LAPACK_COL_MAJOR, n, n, q_t, ldq_t, q, ldq );
127 }
128 if( LAPACKE_lsame( jobz, 'v' ) ) {
129 LAPACKE_cge_trans( LAPACK_COL_MAJOR, n, ncols_z, z_t, ldz_t, z,
130 ldz );
131 }
132 /* Release memory and exit */
133 if( LAPACKE_lsame( jobz, 'v' ) ) {
134 LAPACKE_free( z_t );
135 }
136exit_level_2:
137 if( LAPACKE_lsame( jobz, 'v' ) ) {
138 LAPACKE_free( q_t );
139 }
140exit_level_1:
141 LAPACKE_free( ab_t );
142exit_level_0:
143 if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
144 LAPACKE_xerbla( "LAPACKE_chbevx_2stage_work", info );
145 }
146 } else {
147 info = -1;
148 LAPACKE_xerbla( "LAPACKE_chbevx_2stage_work", info );
149 }
150 return info;
151}
LAPACK_chbevx_2stage
#define LAPACK_chbevx_2stage(...)
Definition: lapack.h:6370
lapack_int
#define lapack_int
Definition: lapack.h:87
lapack_complex_float
#define lapack_complex_float
Definition: lapack.h:46
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_malloc
#define LAPACKE_malloc(size)
Definition: lapacke.h:43
LAPACK_TRANSPOSE_MEMORY_ERROR
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:56
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
MAX
#define MAX(x, y)
Definition: lapacke_utils.h:46
LAPACKE_chb_trans
void LAPACKE_chb_trans(int matrix_layout, char uplo, lapack_int n, lapack_int kd, const lapack_complex_float *in, lapack_int ldin, lapack_complex_float *out, lapack_int ldout)
Definition: lapacke_chb_trans.c:39
LAPACKE_cge_trans
void LAPACKE_cge_trans(int matrix_layout, lapack_int m, lapack_int n, const lapack_complex_float *in, lapack_int ldin, lapack_complex_float *out, lapack_int ldout)
Definition: lapacke_cge_trans.c:39
Here is the call graph for this function:
Here is the caller graph for this function: