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

◆ LAPACKE_dlagge()

lapack_int LAPACKE_dlagge ( int  matrix_layout,
lapack_int  m,
lapack_int  n,
lapack_int  kl,
lapack_int  ku,
const double *  d,
double *  a,
lapack_int  lda,
lapack_int iseed 
)

Definition at line 35 of file lapacke_dlagge.c.

38{
39 lapack_int info = 0;
40 double* work = NULL;
41 if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
42 LAPACKE_xerbla( "LAPACKE_dlagge", -1 );
43 return -1;
44 }
45#ifndef LAPACK_DISABLE_NAN_CHECK
46 if( LAPACKE_get_nancheck() ) {
47 /* Optionally check input matrices for NaNs */
48 if( LAPACKE_d_nancheck( MIN(m,n), d, 1 ) ) {
49 return -6;
50 }
51 }
52#endif
53 /* Allocate memory for working array(s) */
54 work = (double*)LAPACKE_malloc( sizeof(double) * MAX(1,m+n) );
55 if( work == NULL ) {
57 goto exit_level_0;
58 }
59 /* Call middle-level interface */
60 info = LAPACKE_dlagge_work( matrix_layout, m, n, kl, ku, d, a, lda, iseed,
61 work );
62 /* Release memory and exit */
63 LAPACKE_free( work );
64exit_level_0:
65 if( info == LAPACK_WORK_MEMORY_ERROR ) {
66 LAPACKE_xerbla( "LAPACKE_dlagge", info );
67 }
68 return info;
69}
#define lapack_int
Definition: lapack.h:87
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:55
#define LAPACK_COL_MAJOR
Definition: lapacke.h:53
#define LAPACKE_free(p)
Definition: lapacke.h:46
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:52
lapack_int LAPACKE_dlagge_work(int matrix_layout, lapack_int m, lapack_int n, lapack_int kl, lapack_int ku, const double *d, double *a, lapack_int lda, lapack_int *iseed, double *work)
int LAPACKE_get_nancheck(void)
#define LAPACKE_malloc(size)
Definition: lapacke.h:43
void LAPACKE_xerbla(const char *name, lapack_int info)
lapack_logical LAPACKE_d_nancheck(lapack_int n, const double *x, lapack_int incx)
#define MIN(x, y)
Definition: lapacke_utils.h:49
#define MAX(x, y)
Definition: lapacke_utils.h:46
Here is the call graph for this function: