LAPACK  3.6.1
LAPACK: Linear Algebra PACKage
lapack_int LAPACKE_zgges_work ( int  matrix_layout,
char  jobvsl,
char  jobvsr,
char  sort,
LAPACK_Z_SELECT2  selctg,
lapack_int  n,
lapack_complex_double *  a,
lapack_int  lda,
lapack_complex_double *  b,
lapack_int  ldb,
lapack_int *  sdim,
lapack_complex_double *  alpha,
lapack_complex_double *  beta,
lapack_complex_double *  vsl,
lapack_int  ldvsl,
lapack_complex_double *  vsr,
lapack_int  ldvsr,
lapack_complex_double *  work,
lapack_int  lwork,
double *  rwork,
lapack_logical *  bwork 
)

Definition at line 36 of file lapacke_zgges_work.c.

46 {
47  lapack_int info = 0;
48  if( matrix_layout == LAPACK_COL_MAJOR ) {
49  /* Call LAPACK function and adjust info */
50  LAPACK_zgges( &jobvsl, &jobvsr, &sort, selctg, &n, a, &lda, b, &ldb,
51  sdim, alpha, beta, vsl, &ldvsl, vsr, &ldvsr, work, &lwork,
52  rwork, bwork, &info );
53  if( info < 0 ) {
54  info = info - 1;
55  }
56  } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
57  lapack_int lda_t = MAX(1,n);
58  lapack_int ldb_t = MAX(1,n);
59  lapack_int ldvsl_t = MAX(1,n);
60  lapack_int ldvsr_t = MAX(1,n);
61  lapack_complex_double* a_t = NULL;
62  lapack_complex_double* b_t = NULL;
63  lapack_complex_double* vsl_t = NULL;
64  lapack_complex_double* vsr_t = NULL;
65  /* Check leading dimension(s) */
66  if( lda < n ) {
67  info = -8;
68  LAPACKE_xerbla( "LAPACKE_zgges_work", info );
69  return info;
70  }
71  if( ldb < n ) {
72  info = -10;
73  LAPACKE_xerbla( "LAPACKE_zgges_work", info );
74  return info;
75  }
76  if( ldvsl < n ) {
77  info = -15;
78  LAPACKE_xerbla( "LAPACKE_zgges_work", info );
79  return info;
80  }
81  if( ldvsr < n ) {
82  info = -17;
83  LAPACKE_xerbla( "LAPACKE_zgges_work", info );
84  return info;
85  }
86  /* Query optimal working array(s) size if requested */
87  if( lwork == -1 ) {
88  LAPACK_zgges( &jobvsl, &jobvsr, &sort, selctg, &n, a, &lda_t, b,
89  &ldb_t, sdim, alpha, beta, vsl, &ldvsl_t, vsr,
90  &ldvsr_t, work, &lwork, rwork, bwork, &info );
91  return (info < 0) ? (info - 1) : info;
92  }
93  /* Allocate memory for temporary array(s) */
94  a_t = (lapack_complex_double*)
95  LAPACKE_malloc( sizeof(lapack_complex_double) * lda_t * MAX(1,n) );
96  if( a_t == NULL ) {
97  info = LAPACK_TRANSPOSE_MEMORY_ERROR;
98  goto exit_level_0;
99  }
100  b_t = (lapack_complex_double*)
101  LAPACKE_malloc( sizeof(lapack_complex_double) * ldb_t * MAX(1,n) );
102  if( b_t == NULL ) {
103  info = LAPACK_TRANSPOSE_MEMORY_ERROR;
104  goto exit_level_1;
105  }
106  if( LAPACKE_lsame( jobvsl, 'v' ) ) {
107  vsl_t = (lapack_complex_double*)
108  LAPACKE_malloc( sizeof(lapack_complex_double) *
109  ldvsl_t * MAX(1,n) );
110  if( vsl_t == NULL ) {
111  info = LAPACK_TRANSPOSE_MEMORY_ERROR;
112  goto exit_level_2;
113  }
114  }
115  if( LAPACKE_lsame( jobvsr, 'v' ) ) {
116  vsr_t = (lapack_complex_double*)
117  LAPACKE_malloc( sizeof(lapack_complex_double) *
118  ldvsr_t * MAX(1,n) );
119  if( vsr_t == NULL ) {
120  info = LAPACK_TRANSPOSE_MEMORY_ERROR;
121  goto exit_level_3;
122  }
123  }
124  /* Transpose input matrices */
125  LAPACKE_zge_trans( matrix_layout, n, n, a, lda, a_t, lda_t );
126  LAPACKE_zge_trans( matrix_layout, n, n, b, ldb, b_t, ldb_t );
127  /* Call LAPACK function and adjust info */
128  LAPACK_zgges( &jobvsl, &jobvsr, &sort, selctg, &n, a_t, &lda_t, b_t,
129  &ldb_t, sdim, alpha, beta, vsl_t, &ldvsl_t, vsr_t,
130  &ldvsr_t, work, &lwork, rwork, bwork, &info );
131  if( info < 0 ) {
132  info = info - 1;
133  }
134  /* Transpose output matrices */
135  LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, n, a_t, lda_t, a, lda );
136  LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, n, b_t, ldb_t, b, ldb );
137  if( LAPACKE_lsame( jobvsl, 'v' ) ) {
138  LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, n, vsl_t, ldvsl_t, vsl,
139  ldvsl );
140  }
141  if( LAPACKE_lsame( jobvsr, 'v' ) ) {
142  LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, n, vsr_t, ldvsr_t, vsr,
143  ldvsr );
144  }
145  /* Release memory and exit */
146  if( LAPACKE_lsame( jobvsr, 'v' ) ) {
147  LAPACKE_free( vsr_t );
148  }
149 exit_level_3:
150  if( LAPACKE_lsame( jobvsl, 'v' ) ) {
151  LAPACKE_free( vsl_t );
152  }
153 exit_level_2:
154  LAPACKE_free( b_t );
155 exit_level_1:
156  LAPACKE_free( a_t );
157 exit_level_0:
158  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
159  LAPACKE_xerbla( "LAPACKE_zgges_work", info );
160  }
161  } else {
162  info = -1;
163  LAPACKE_xerbla( "LAPACKE_zgges_work", info );
164  }
165  return info;
166 }
LAPACK_ROW_MAJOR
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
lapack_complex_double
#define lapack_complex_double
Definition: lapacke.h:90
MAX
#define MAX(x, y)
Definition: lapacke_utils.h:47
LAPACKE_free
#define LAPACKE_free(p)
Definition: lapacke.h:113
LAPACKE_malloc
#define LAPACKE_malloc(size)
Definition: lapacke.h:110
LAPACKE_lsame
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:36
LAPACK_COL_MAJOR
#define LAPACK_COL_MAJOR
Definition: lapacke.h:120
LAPACKE_xerbla
void LAPACKE_xerbla(const char *name, lapack_int info)
Definition: lapacke_xerbla.c:37
LAPACK_zgges
void LAPACK_zgges(char *jobvsl, char *jobvsr, char *sort, LAPACK_Z_SELECT2 selctg, lapack_int *n, lapack_complex_double *a, lapack_int *lda, lapack_complex_double *b, lapack_int *ldb, lapack_int *sdim, lapack_complex_double *alpha, lapack_complex_double *beta, lapack_complex_double *vsl, lapack_int *ldvsl, lapack_complex_double *vsr, lapack_int *ldvsr, lapack_complex_double *work, lapack_int *lwork, double *rwork, lapack_logical *bwork, lapack_int *info)
lapack_int
#define lapack_int
Definition: lapacke.h:47
LAPACK_TRANSPOSE_MEMORY_ERROR
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:123
LAPACKE_zge_trans
void LAPACKE_zge_trans(int matrix_layout, lapack_int m, lapack_int n, const lapack_complex_double *in, lapack_int ldin, lapack_complex_double *out, lapack_int ldout)
Definition: lapacke_zge_trans.c:40

Here is the call graph for this function:

Here is the caller graph for this function: