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

◆ LAPACKE_dppequ_work()

lapack_int LAPACKE_dppequ_work ( int  matrix_layout,
char  uplo,
lapack_int  n,
const double *  ap,
double *  s,
double *  scond,
double *  amax 
)

Definition at line 35 of file lapacke_dppequ_work.c.

38{
39 lapack_int info = 0;
40 if( matrix_layout == LAPACK_COL_MAJOR ) {
41 /* Call LAPACK function and adjust info */
42 LAPACK_dppequ( &uplo, &n, ap, s, scond, amax, &info );
43 if( info < 0 ) {
44 info = info - 1;
45 }
46 } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
47 double* ap_t = NULL;
48 /* Allocate memory for temporary array(s) */
49 ap_t = (double*)
50 LAPACKE_malloc( sizeof(double) * ( MAX(1,n) * MAX(2,n+1) ) / 2 );
51 if( ap_t == NULL ) {
53 goto exit_level_0;
54 }
55 /* Transpose input matrices */
56 LAPACKE_dpp_trans( matrix_layout, uplo, n, ap, ap_t );
57 /* Call LAPACK function and adjust info */
58 LAPACK_dppequ( &uplo, &n, ap_t, s, scond, amax, &info );
59 if( info < 0 ) {
60 info = info - 1;
61 }
62 /* Release memory and exit */
63 LAPACKE_free( ap_t );
64exit_level_0:
65 if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
66 LAPACKE_xerbla( "LAPACKE_dppequ_work", info );
67 }
68 } else {
69 info = -1;
70 LAPACKE_xerbla( "LAPACKE_dppequ_work", info );
71 }
72 return info;
73}
#define lapack_int
Definition: lapack.h:87
#define LAPACK_dppequ(...)
Definition: lapack.h:13750
#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
void LAPACKE_xerbla(const char *name, lapack_int info)
void LAPACKE_dpp_trans(int matrix_layout, char uplo, lapack_int n, const double *in, double *out)
#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: