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

◆ LAPACKE_zpftri_work()

lapack_int LAPACKE_zpftri_work ( int  matrix_layout,
char  transr,
char  uplo,
lapack_int  n,
lapack_complex_double a 
)

Definition at line 35 of file lapacke_zpftri_work.c.

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