LAPACK  3.7.1
LAPACK: Linear Algebra PACKage

◆ LAPACKE_dgeqlf()

lapack_int LAPACKE_dgeqlf ( int  matrix_layout,
lapack_int  m,
lapack_int  n,
double *  a,
lapack_int  lda,
double *  tau 
)

Definition at line 36 of file lapacke_dgeqlf.c.

38 {
39  lapack_int info = 0;
40  lapack_int lwork = -1;
41  double* work = NULL;
42  double work_query;
43  if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
44  LAPACKE_xerbla( "LAPACKE_dgeqlf", -1 );
45  return -1;
46  }
47 #ifndef LAPACK_DISABLE_NAN_CHECK
48  /* Optionally check input matrices for NaNs */
49  if( LAPACKE_dge_nancheck( matrix_layout, m, n, a, lda ) ) {
50  return -4;
51  }
52 #endif
53  /* Query optimal working array(s) size */
54  info = LAPACKE_dgeqlf_work( matrix_layout, m, n, a, lda, tau, &work_query,
55  lwork );
56  if( info != 0 ) {
57  goto exit_level_0;
58  }
59  lwork = (lapack_int)work_query;
60  /* Allocate memory for work arrays */
61  work = (double*)LAPACKE_malloc( sizeof(double) * lwork );
62  if( work == NULL ) {
64  goto exit_level_0;
65  }
66  /* Call middle-level interface */
67  info = LAPACKE_dgeqlf_work( matrix_layout, m, n, a, lda, tau, work, lwork );
68  /* Release memory and exit */
69  LAPACKE_free( work );
70 exit_level_0:
71  if( info == LAPACK_WORK_MEMORY_ERROR ) {
72  LAPACKE_xerbla( "LAPACKE_dgeqlf", info );
73  }
74  return info;
75 }
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:122
#define LAPACKE_free(p)
Definition: lapacke.h:113
lapack_logical LAPACKE_dge_nancheck(int matrix_layout, lapack_int m, lapack_int n, const double *a, lapack_int lda)
#define LAPACKE_malloc(size)
Definition: lapacke.h:110
#define LAPACK_COL_MAJOR
Definition: lapacke.h:120
void LAPACKE_xerbla(const char *name, lapack_int info)
lapack_int LAPACKE_dgeqlf_work(int matrix_layout, lapack_int m, lapack_int n, double *a, lapack_int lda, double *tau, double *work, lapack_int lwork)
#define lapack_int
Definition: lapacke.h:47
Here is the call graph for this function: