LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches

◆ LAPACKE_zgemlq_work()

lapack_int LAPACKE_zgemlq_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 t,
lapack_int  tsize,
lapack_complex_double c,
lapack_int  ldc,
lapack_complex_double work,
lapack_int  lwork 
)

Definition at line 35 of file lapacke_zgemlq_work.c.

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