LAPACK  3.10.1
LAPACK: Linear Algebra PACKage

◆ LAPACKE_dtgexc_work()

lapack_int LAPACKE_dtgexc_work ( int  matrix_layout,
lapack_logical  wantq,
lapack_logical  wantz,
lapack_int  n,
double *  a,
lapack_int  lda,
double *  b,
lapack_int  ldb,
double *  q,
lapack_int  ldq,
double *  z,
lapack_int  ldz,
lapack_int ifst,
lapack_int ilst,
double *  work,
lapack_int  lwork 
)

Definition at line 35 of file lapacke_dtgexc_work.c.

42 {
43  lapack_int info = 0;
44  if( matrix_layout == LAPACK_COL_MAJOR ) {
45  /* Call LAPACK function and adjust info */
46  LAPACK_dtgexc( &wantq, &wantz, &n, a, &lda, b, &ldb, q, &ldq, z, &ldz,
47  ifst, ilst, work, &lwork, &info );
48  if( info < 0 ) {
49  info = info - 1;
50  }
51  } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
52  lapack_int lda_t = MAX(1,n);
53  lapack_int ldb_t = MAX(1,n);
54  lapack_int ldq_t = MAX(1,n);
55  lapack_int ldz_t = MAX(1,n);
56  double* a_t = NULL;
57  double* b_t = NULL;
58  double* q_t = NULL;
59  double* z_t = NULL;
60  /* Check leading dimension(s) */
61  if( lda < n ) {
62  info = -6;
63  LAPACKE_xerbla( "LAPACKE_dtgexc_work", info );
64  return info;
65  }
66  if( ldb < n ) {
67  info = -8;
68  LAPACKE_xerbla( "LAPACKE_dtgexc_work", info );
69  return info;
70  }
71  if( ldq < n ) {
72  info = -10;
73  LAPACKE_xerbla( "LAPACKE_dtgexc_work", info );
74  return info;
75  }
76  if( ldz < n ) {
77  info = -12;
78  LAPACKE_xerbla( "LAPACKE_dtgexc_work", info );
79  return info;
80  }
81  /* Query optimal working array(s) size if requested */
82  if( lwork == -1 ) {
83  LAPACK_dtgexc( &wantq, &wantz, &n, a, &lda_t, b, &ldb_t, q, &ldq_t,
84  z, &ldz_t, ifst, ilst, work, &lwork, &info );
85  return (info < 0) ? (info - 1) : info;
86  }
87  /* Allocate memory for temporary array(s) */
88  a_t = (double*)LAPACKE_malloc( sizeof(double) * lda_t * MAX(1,n) );
89  if( a_t == NULL ) {
91  goto exit_level_0;
92  }
93  b_t = (double*)LAPACKE_malloc( sizeof(double) * ldb_t * MAX(1,n) );
94  if( b_t == NULL ) {
96  goto exit_level_1;
97  }
98  if( wantq ) {
99  q_t = (double*)LAPACKE_malloc( sizeof(double) * ldq_t * MAX(1,n) );
100  if( q_t == NULL ) {
102  goto exit_level_2;
103  }
104  }
105  if( wantz ) {
106  z_t = (double*)LAPACKE_malloc( sizeof(double) * ldz_t * MAX(1,n) );
107  if( z_t == NULL ) {
109  goto exit_level_3;
110  }
111  }
112  /* Transpose input matrices */
113  LAPACKE_dge_trans( matrix_layout, n, n, a, lda, a_t, lda_t );
114  LAPACKE_dge_trans( matrix_layout, n, n, b, ldb, b_t, ldb_t );
115  if( wantq ) {
116  LAPACKE_dge_trans( matrix_layout, n, n, q, ldq, q_t, ldq_t );
117  }
118  if( wantz ) {
119  LAPACKE_dge_trans( matrix_layout, n, n, z, ldz, z_t, ldz_t );
120  }
121  /* Call LAPACK function and adjust info */
122  LAPACK_dtgexc( &wantq, &wantz, &n, a_t, &lda_t, b_t, &ldb_t, q_t,
123  &ldq_t, z_t, &ldz_t, ifst, ilst, work, &lwork, &info );
124  if( info < 0 ) {
125  info = info - 1;
126  }
127  /* Transpose output matrices */
128  LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, n, a_t, lda_t, a, lda );
129  LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, n, b_t, ldb_t, b, ldb );
130  if( wantq ) {
131  LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, n, q_t, ldq_t, q, ldq );
132  }
133  if( wantz ) {
134  LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, n, z_t, ldz_t, z, ldz );
135  }
136  /* Release memory and exit */
137  if( wantz ) {
138  LAPACKE_free( z_t );
139  }
140 exit_level_3:
141  if( wantq ) {
142  LAPACKE_free( q_t );
143  }
144 exit_level_2:
145  LAPACKE_free( b_t );
146 exit_level_1:
147  LAPACKE_free( a_t );
148 exit_level_0:
149  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
150  LAPACKE_xerbla( "LAPACKE_dtgexc_work", info );
151  }
152  } else {
153  info = -1;
154  LAPACKE_xerbla( "LAPACKE_dtgexc_work", info );
155  }
156  return info;
157 }
#define lapack_int
Definition: lapack.h:83
void LAPACK_dtgexc(lapack_logical const *wantq, lapack_logical const *wantz, lapack_int const *n, double *A, lapack_int const *lda, double *B, lapack_int const *ldb, double *Q, lapack_int const *ldq, double *Z, lapack_int const *ldz, lapack_int *ifst, lapack_int *ilst, double *work, lapack_int const *lwork, lapack_int *info)
#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
void LAPACKE_xerbla(const char *name, lapack_int info)
#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: