LAPACK  3.6.1
LAPACK: Linear Algebra PACKage
lapack_int LAPACKE_zunmrq_work ( int  matrix_layout,
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_zunmrq_work.c.

42 {
43  lapack_int info = 0;
44  if( matrix_layout == LAPACK_COL_MAJOR ) {
45  /* Call LAPACK function and adjust info */
46  LAPACK_zunmrq( &side, &trans, &m, &n, &k, a, &lda, tau, c, &ldc, work,
47  &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,k);
53  lapack_int ldc_t = MAX(1,m);
54  lapack_complex_double* a_t = NULL;
55  lapack_complex_double* c_t = NULL;
56  /* Check leading dimension(s) */
57  if( lda < m ) {
58  info = -8;
59  LAPACKE_xerbla( "LAPACKE_zunmrq_work", info );
60  return info;
61  }
62  if( ldc < n ) {
63  info = -11;
64  LAPACKE_xerbla( "LAPACKE_zunmrq_work", info );
65  return info;
66  }
67  /* Query optimal working array(s) size if requested */
68  if( lwork == -1 ) {
69  LAPACK_zunmrq( &side, &trans, &m, &n, &k, a, &lda_t, tau, c, &ldc_t,
70  work, &lwork, &info );
71  return (info < 0) ? (info - 1) : info;
72  }
73  /* Allocate memory for temporary array(s) */
74  a_t = (lapack_complex_double*)
75  LAPACKE_malloc( sizeof(lapack_complex_double) * lda_t * MAX(1,m) );
76  if( a_t == NULL ) {
78  goto exit_level_0;
79  }
80  c_t = (lapack_complex_double*)
81  LAPACKE_malloc( sizeof(lapack_complex_double) * ldc_t * MAX(1,n) );
82  if( c_t == NULL ) {
84  goto exit_level_1;
85  }
86  /* Transpose input matrices */
87  LAPACKE_zge_trans( matrix_layout, k, m, a, lda, a_t, lda_t );
88  LAPACKE_zge_trans( matrix_layout, m, n, c, ldc, c_t, ldc_t );
89  /* Call LAPACK function and adjust info */
90  LAPACK_zunmrq( &side, &trans, &m, &n, &k, a_t, &lda_t, tau, c_t, &ldc_t,
91  work, &lwork, &info );
92  if( info < 0 ) {
93  info = info - 1;
94  }
95  /* Transpose output matrices */
96  LAPACKE_zge_trans( LAPACK_COL_MAJOR, m, n, c_t, ldc_t, c, ldc );
97  /* Release memory and exit */
98  LAPACKE_free( c_t );
99 exit_level_1:
100  LAPACKE_free( a_t );
101 exit_level_0:
102  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
103  LAPACKE_xerbla( "LAPACKE_zunmrq_work", info );
104  }
105  } else {
106  info = -1;
107  LAPACKE_xerbla( "LAPACKE_zunmrq_work", info );
108  }
109  return info;
110 }
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
#define lapack_complex_double
Definition: lapacke.h:90
#define MAX(x, y)
Definition: lapacke_utils.h:47
#define LAPACKE_free(p)
Definition: lapacke.h:113
#define LAPACKE_malloc(size)
Definition: lapacke.h:110
void LAPACK_zunmrq(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)
#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)

Here is the call graph for this function:

Here is the caller graph for this function: