LAPACK  3.10.0
LAPACK: Linear Algebra PACKage

◆ LAPACKE_dsbev_2stage_work()

lapack_int LAPACKE_dsbev_2stage_work ( int  matrix_layout,
char  jobz,
char  uplo,
lapack_int  n,
lapack_int  kd,
double *  ab,
lapack_int  ldab,
double *  w,
double *  z,
lapack_int  ldz,
double *  work,
lapack_int  lwork 
)

Definition at line 35 of file lapacke_dsbev_2stage_work.c.

39 {
40  lapack_int info = 0;
41  if( matrix_layout == LAPACK_COL_MAJOR ) {
42  /* Call LAPACK function and adjust info */
43  LAPACK_dsbev_2stage( &jobz, &uplo, &n, &kd, ab, &ldab, w, z, &ldz, work,
44  &lwork, &info );
45  if( info < 0 ) {
46  info = info - 1;
47  }
48  } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
49  lapack_int ldab_t = MAX(1,kd+1);
50  lapack_int ldz_t = MAX(1,n);
51  double* ab_t = NULL;
52  double* z_t = NULL;
53  /* Check leading dimension(s) */
54  if( ldab < n ) {
55  info = -7;
56  LAPACKE_xerbla( "LAPACKE_dsbev_2stage_work", info );
57  return info;
58  }
59  if( ldz < n ) {
60  info = -10;
61  LAPACKE_xerbla( "LAPACKE_dsbev_2stage_work", info );
62  return info;
63  }
64  /* Query optimal working array(s) size if requested */
65  if( lwork == -1 ) {
66  LAPACK_dsbev_2stage( &jobz, &uplo, &n, &kd, ab_t, &ldab_t, w, z_t, &ldz_t,
67  work, &lwork, &info );
68  return (info < 0) ? (info - 1) : info;
69  }
70  /* Allocate memory for temporary array(s) */
71  ab_t = (double*)LAPACKE_malloc( sizeof(double) * ldab_t * MAX(1,n) );
72  if( ab_t == NULL ) {
74  goto exit_level_0;
75  }
76  if( LAPACKE_lsame( jobz, 'v' ) ) {
77  z_t = (double*)LAPACKE_malloc( sizeof(double) * ldz_t * MAX(1,n) );
78  if( z_t == NULL ) {
80  goto exit_level_1;
81  }
82  }
83  /* Transpose input matrices */
84  LAPACKE_dsb_trans( matrix_layout, uplo, n, kd, ab, ldab, ab_t, ldab_t );
85  /* Call LAPACK function and adjust info */
86  LAPACK_dsbev_2stage( &jobz, &uplo, &n, &kd, ab_t, &ldab_t, w, z_t, &ldz_t,
87  work, &lwork, &info );
88  if( info < 0 ) {
89  info = info - 1;
90  }
91  /* Transpose output matrices */
92  LAPACKE_dsb_trans( LAPACK_COL_MAJOR, uplo, n, kd, ab_t, ldab_t, ab,
93  ldab );
94  if( LAPACKE_lsame( jobz, 'v' ) ) {
95  LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, n, z_t, ldz_t, z, ldz );
96  }
97  /* Release memory and exit */
98  if( LAPACKE_lsame( jobz, 'v' ) ) {
99  LAPACKE_free( z_t );
100  }
101 exit_level_1:
102  LAPACKE_free( ab_t );
103 exit_level_0:
104  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
105  LAPACKE_xerbla( "LAPACKE_dsbev_2stage_work", info );
106  }
107  } else {
108  info = -1;
109  LAPACKE_xerbla( "LAPACKE_dsbev_2stage_work", info );
110  }
111  return info;
112 }
#define LAPACK_dsbev_2stage(...)
Definition: lapack.h:14769
#define lapack_int
Definition: lapack.h:83
#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_dsb_trans(int matrix_layout, char uplo, lapack_int n, lapack_int kd, const double *in, lapack_int ldin, double *out, lapack_int ldout)
#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)
Here is the call graph for this function:
Here is the caller graph for this function: