LAPACK  3.10.0
LAPACK: Linear Algebra PACKage

◆ LAPACKE_dppsvx_work()

lapack_int LAPACKE_dppsvx_work ( int  matrix_layout,
char  fact,
char  uplo,
lapack_int  n,
lapack_int  nrhs,
double *  ap,
double *  afp,
char *  equed,
double *  s,
double *  b,
lapack_int  ldb,
double *  x,
lapack_int  ldx,
double *  rcond,
double *  ferr,
double *  berr,
double *  work,
lapack_int iwork 
)

Definition at line 35 of file lapacke_dppsvx_work.c.

41 {
42  lapack_int info = 0;
43  if( matrix_layout == LAPACK_COL_MAJOR ) {
44  /* Call LAPACK function and adjust info */
45  LAPACK_dppsvx( &fact, &uplo, &n, &nrhs, ap, afp, equed, s, b, &ldb, x,
46  &ldx, rcond, ferr, berr, work, iwork, &info );
47  if( info < 0 ) {
48  info = info - 1;
49  }
50  } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
51  lapack_int ldb_t = MAX(1,n);
52  lapack_int ldx_t = MAX(1,n);
53  double* b_t = NULL;
54  double* x_t = NULL;
55  double* ap_t = NULL;
56  double* afp_t = NULL;
57  /* Check leading dimension(s) */
58  if( ldb < nrhs ) {
59  info = -11;
60  LAPACKE_xerbla( "LAPACKE_dppsvx_work", info );
61  return info;
62  }
63  if( ldx < nrhs ) {
64  info = -13;
65  LAPACKE_xerbla( "LAPACKE_dppsvx_work", info );
66  return info;
67  }
68  /* Allocate memory for temporary array(s) */
69  b_t = (double*)LAPACKE_malloc( sizeof(double) * ldb_t * MAX(1,nrhs) );
70  if( b_t == NULL ) {
72  goto exit_level_0;
73  }
74  x_t = (double*)LAPACKE_malloc( sizeof(double) * ldx_t * MAX(1,nrhs) );
75  if( x_t == NULL ) {
77  goto exit_level_1;
78  }
79  ap_t = (double*)
80  LAPACKE_malloc( sizeof(double) * ( MAX(1,n) * MAX(2,n+1) ) / 2 );
81  if( ap_t == NULL ) {
83  goto exit_level_2;
84  }
85  afp_t = (double*)
86  LAPACKE_malloc( sizeof(double) * ( MAX(1,n) * MAX(2,n+1) ) / 2 );
87  if( afp_t == NULL ) {
89  goto exit_level_3;
90  }
91  /* Transpose input matrices */
92  LAPACKE_dge_trans( matrix_layout, n, nrhs, b, ldb, b_t, ldb_t );
93  LAPACKE_dpp_trans( matrix_layout, uplo, n, ap, ap_t );
94  if( LAPACKE_lsame( fact, 'f' ) ) {
95  LAPACKE_dpp_trans( matrix_layout, uplo, n, afp, afp_t );
96  }
97  /* Call LAPACK function and adjust info */
98  LAPACK_dppsvx( &fact, &uplo, &n, &nrhs, ap_t, afp_t, equed, s, b_t,
99  &ldb_t, x_t, &ldx_t, rcond, ferr, berr, work, iwork,
100  &info );
101  if( info < 0 ) {
102  info = info - 1;
103  }
104  /* Transpose output matrices */
105  LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, nrhs, b_t, ldb_t, b, ldb );
106  LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, nrhs, x_t, ldx_t, x, ldx );
107  if( LAPACKE_lsame( fact, 'e' ) && LAPACKE_lsame( *equed, 'y' ) ) {
108  LAPACKE_dpp_trans( LAPACK_COL_MAJOR, uplo, n, ap_t, ap );
109  }
110  if( LAPACKE_lsame( fact, 'e' ) || LAPACKE_lsame( fact, 'n' ) ) {
111  LAPACKE_dpp_trans( LAPACK_COL_MAJOR, uplo, n, afp_t, afp );
112  }
113  /* Release memory and exit */
114  LAPACKE_free( afp_t );
115 exit_level_3:
116  LAPACKE_free( ap_t );
117 exit_level_2:
118  LAPACKE_free( x_t );
119 exit_level_1:
120  LAPACKE_free( b_t );
121 exit_level_0:
122  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
123  LAPACKE_xerbla( "LAPACKE_dppsvx_work", info );
124  }
125  } else {
126  info = -1;
127  LAPACKE_xerbla( "LAPACKE_dppsvx_work", info );
128  }
129  return info;
130 }
#define lapack_int
Definition: lapack.h:83
#define LAPACK_dppsvx(...)
Definition: lapack.h:13984
#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_dpp_trans(int matrix_layout, char uplo, lapack_int n, const double *in, double *out)
#define MAX(x, y)
Definition: lapacke_utils.h:46
void LAPACKE_dge_trans(int matrix_layout, lapack_int m, lapack_int n, const double *in, lapack_int ldin, double *out, lapack_int ldout)
Here is the call graph for this function:
Here is the caller graph for this function: