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

◆ LAPACKE_sgeev_work()

lapack_int LAPACKE_sgeev_work ( int  matrix_layout,
char  jobvl,
char  jobvr,
lapack_int  n,
float *  a,
lapack_int  lda,
float *  wr,
float *  wi,
float *  vl,
lapack_int  ldvl,
float *  vr,
lapack_int  ldvr,
float *  work,
lapack_int  lwork 
)

Definition at line 35 of file lapacke_sgeev_work.c.

40{
41 lapack_int info = 0;
42 if( matrix_layout == LAPACK_COL_MAJOR ) {
43 /* Call LAPACK function and adjust info */
44 LAPACK_sgeev( &jobvl, &jobvr, &n, a, &lda, wr, wi, vl, &ldvl, vr, &ldvr,
45 work, &lwork, &info );
46 if( info < 0 ) {
47 info = info - 1;
48 }
49 } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
50 lapack_int lda_t = MAX(1,n);
51 lapack_int ldvl_t = MAX(1,n);
52 lapack_int ldvr_t = MAX(1,n);
53 float* a_t = NULL;
54 float* vl_t = NULL;
55 float* vr_t = NULL;
56 /* Check leading dimension(s) */
57 if( lda < n ) {
58 info = -6;
59 LAPACKE_xerbla( "LAPACKE_sgeev_work", info );
60 return info;
61 }
62 if( ldvl < 1 || ( LAPACKE_lsame( jobvl, 'v' ) && ldvl < n ) ) {
63 info = -10;
64 LAPACKE_xerbla( "LAPACKE_sgeev_work", info );
65 return info;
66 }
67 if( ldvr < 1 || ( LAPACKE_lsame( jobvr, 'v' ) && ldvr < n ) ) {
68 info = -12;
69 LAPACKE_xerbla( "LAPACKE_sgeev_work", info );
70 return info;
71 }
72 /* Query optimal working array(s) size if requested */
73 if( lwork == -1 ) {
74 LAPACK_sgeev( &jobvl, &jobvr, &n, a, &lda_t, wr, wi, vl, &ldvl_t,
75 vr, &ldvr_t, work, &lwork, &info );
76 return (info < 0) ? (info - 1) : info;
77 }
78 /* Allocate memory for temporary array(s) */
79 a_t = (float*)LAPACKE_malloc( sizeof(float) * lda_t * MAX(1,n) );
80 if( a_t == NULL ) {
82 goto exit_level_0;
83 }
84 if( LAPACKE_lsame( jobvl, 'v' ) ) {
85 vl_t = (float*)LAPACKE_malloc( sizeof(float) * ldvl_t * MAX(1,n) );
86 if( vl_t == NULL ) {
88 goto exit_level_1;
89 }
90 }
91 if( LAPACKE_lsame( jobvr, 'v' ) ) {
92 vr_t = (float*)LAPACKE_malloc( sizeof(float) * ldvr_t * MAX(1,n) );
93 if( vr_t == NULL ) {
95 goto exit_level_2;
96 }
97 }
98 /* Transpose input matrices */
99 LAPACKE_sge_trans( matrix_layout, n, n, a, lda, a_t, lda_t );
100 /* Call LAPACK function and adjust info */
101 LAPACK_sgeev( &jobvl, &jobvr, &n, a_t, &lda_t, wr, wi, vl_t, &ldvl_t,
102 vr_t, &ldvr_t, work, &lwork, &info );
103 if( info < 0 ) {
104 info = info - 1;
105 }
106 /* Transpose output matrices */
107 LAPACKE_sge_trans( LAPACK_COL_MAJOR, n, n, a_t, lda_t, a, lda );
108 if( LAPACKE_lsame( jobvl, 'v' ) ) {
109 LAPACKE_sge_trans( LAPACK_COL_MAJOR, n, n, vl_t, ldvl_t, vl, ldvl );
110 }
111 if( LAPACKE_lsame( jobvr, 'v' ) ) {
112 LAPACKE_sge_trans( LAPACK_COL_MAJOR, n, n, vr_t, ldvr_t, vr, ldvr );
113 }
114 /* Release memory and exit */
115 if( LAPACKE_lsame( jobvr, 'v' ) ) {
116 LAPACKE_free( vr_t );
117 }
118exit_level_2:
119 if( LAPACKE_lsame( jobvl, 'v' ) ) {
120 LAPACKE_free( vl_t );
121 }
122exit_level_1:
123 LAPACKE_free( a_t );
124exit_level_0:
125 if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
126 LAPACKE_xerbla( "LAPACKE_sgeev_work", info );
127 }
128 } else {
129 info = -1;
130 LAPACKE_xerbla( "LAPACKE_sgeev_work", info );
131 }
132 return info;
133}
#define LAPACK_sgeev(...)
Definition: lapack.h:1864
#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)
void LAPACKE_sge_trans(int matrix_layout, lapack_int m, lapack_int n, const float *in, lapack_int ldin, float *out, lapack_int ldout)
#define MAX(x, y)
Definition: lapacke_utils.h:46
Here is the call graph for this function:
Here is the caller graph for this function: