LAPACK  3.10.0
LAPACK: Linear Algebra PACKage

◆ LAPACKE_cheevx_2stage_work()

lapack_int LAPACKE_cheevx_2stage_work ( int  matrix_layout,
char  jobz,
char  range,
char  uplo,
lapack_int  n,
lapack_complex_float a,
lapack_int  lda,
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_cheevx_2stage_work.c.

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