LAPACK  3.7.1
LAPACK: Linear Algebra PACKage

◆ LAPACKE_cunmbr_work()

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

Definition at line 36 of file lapacke_cunmbr_work.c.

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