LAPACK  3.7.1
LAPACK: Linear Algebra PACKage

◆ LAPACKE_zunmbr_work()

lapack_int LAPACKE_zunmbr_work ( int  matrix_layout,
char  vect,
char  side,
char  trans,
lapack_int  m,
lapack_int  n,
lapack_int  k,
const lapack_complex_double a,
lapack_int  lda,
const lapack_complex_double tau,
lapack_complex_double c,
lapack_int  ldc,
lapack_complex_double work,
lapack_int  lwork 
)

Definition at line 36 of file lapacke_zunmbr_work.c.

43 {
44  lapack_int info = 0;
45  if( matrix_layout == LAPACK_COL_MAJOR ) {
46  /* Call LAPACK function and adjust info */
47  LAPACK_zunmbr( &vect, &side, &trans, &m, &n, &k, a, &lda, tau, c, &ldc,
48  work, &lwork, &info );
49  if( info < 0 ) {
50  info = info - 1;
51  }
52  } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
53  lapack_int nq = LAPACKE_lsame( side, 'l' ) ? m : n;
54  lapack_int r = LAPACKE_lsame( vect, 'q' ) ? nq : MIN(nq,k);
55  lapack_int lda_t = MAX(1,r);
56  lapack_int ldc_t = MAX(1,m);
57  lapack_complex_double* a_t = NULL;
58  lapack_complex_double* c_t = NULL;
59  /* Check leading dimension(s) */
60  if( lda < MIN(nq,k) ) {
61  info = -9;
62  LAPACKE_xerbla( "LAPACKE_zunmbr_work", info );
63  return info;
64  }
65  if( ldc < n ) {
66  info = -12;
67  LAPACKE_xerbla( "LAPACKE_zunmbr_work", info );
68  return info;
69  }
70  /* Query optimal working array(s) size if requested */
71  if( lwork == -1 ) {
72  LAPACK_zunmbr( &vect, &side, &trans, &m, &n, &k, a, &lda_t, tau, c,
73  &ldc_t, work, &lwork, &info );
74  return (info < 0) ? (info - 1) : info;
75  }
76  /* Allocate memory for temporary array(s) */
77  if( LAPACKE_lsame( vect, 'q' ) ) {
78  a_t = (lapack_complex_double*)LAPACKE_malloc( sizeof(lapack_complex_double) * lda_t * MAX(1,k) );
79  } else {
80  a_t = (lapack_complex_double*)LAPACKE_malloc( sizeof(lapack_complex_double) * lda_t * MAX(1,nq) );
81  }
82  if( a_t == NULL ) {
84  goto exit_level_0;
85  }
86  c_t = (lapack_complex_double*)
87  LAPACKE_malloc( sizeof(lapack_complex_double) * ldc_t * MAX(1,n) );
88  if( c_t == NULL ) {
90  goto exit_level_1;
91  }
92  /* Transpose input matrices */
93  LAPACKE_zge_trans( matrix_layout, r, MIN(nq,k), a, lda, a_t, lda_t );
94  LAPACKE_zge_trans( matrix_layout, m, n, c, ldc, c_t, ldc_t );
95  /* Call LAPACK function and adjust info */
96  LAPACK_zunmbr( &vect, &side, &trans, &m, &n, &k, a_t, &lda_t, tau, c_t,
97  &ldc_t, work, &lwork, &info );
98  if( info < 0 ) {
99  info = info - 1;
100  }
101  /* Transpose output matrices */
102  LAPACKE_zge_trans( LAPACK_COL_MAJOR, m, n, c_t, ldc_t, c, ldc );
103  /* Release memory and exit */
104  LAPACKE_free( c_t );
105 exit_level_1:
106  LAPACKE_free( a_t );
107 exit_level_0:
108  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
109  LAPACKE_xerbla( "LAPACKE_zunmbr_work", info );
110  }
111  } else {
112  info = -1;
113  LAPACKE_xerbla( "LAPACKE_zunmbr_work", info );
114  }
115  return info;
116 }
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
#define LAPACKE_free(p)
Definition: lapacke.h:113
#define lapack_complex_double
Definition: lapacke.h:90
#define MIN(x, y)
Definition: lapacke_utils.h:50
#define MAX(x, y)
Definition: lapacke_utils.h:47
#define LAPACKE_malloc(size)
Definition: lapacke.h:110
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:36
#define LAPACK_COL_MAJOR
Definition: lapacke.h:120
void LAPACKE_xerbla(const char *name, lapack_int info)
#define lapack_int
Definition: lapacke.h:47
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:123
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)
void LAPACK_zunmbr(char *vect, char *side, char *trans, lapack_int *m, lapack_int *n, lapack_int *k, const lapack_complex_double *a, lapack_int *lda, const lapack_complex_double *tau, lapack_complex_double *c, lapack_int *ldc, lapack_complex_double *work, lapack_int *lwork, lapack_int *info)
Here is the call graph for this function:
Here is the caller graph for this function: