LAPACK  3.6.1
LAPACK: Linear Algebra PACKage
lapack_int LAPACKE_dgesdd_work ( int  matrix_layout,
char  jobz,
lapack_int  m,
lapack_int  n,
double *  a,
lapack_int  lda,
double *  s,
double *  u,
lapack_int  ldu,
double *  vt,
lapack_int  ldvt,
double *  work,
lapack_int  lwork,
lapack_int *  iwork 
)

Definition at line 36 of file lapacke_dgesdd_work.c.

41 {
42  lapack_int info = 0;
43  if( matrix_layout == LAPACK_COL_MAJOR ) {
44  /* Call LAPACK function and adjust info */
45  LAPACK_dgesdd( &jobz, &m, &n, a, &lda, s, u, &ldu, vt, &ldvt, work,
46  &lwork, iwork, &info );
47  if( info < 0 ) {
48  info = info - 1;
49  }
50  } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
51  lapack_int nrows_u = ( LAPACKE_lsame( jobz, 'a' ) ||
52  LAPACKE_lsame( jobz, 's' ) ||
53  ( LAPACKE_lsame( jobz, 'o' ) && m<n) ) ? m : 1;
54  lapack_int ncols_u = ( LAPACKE_lsame( jobz, 'a' ) ||
55  ( LAPACKE_lsame( jobz, 'o' ) && m<n) ) ? m :
56  ( LAPACKE_lsame( jobz, 's' ) ? MIN(m,n) : 1);
57  lapack_int nrows_vt = ( LAPACKE_lsame( jobz, 'a' ) ||
58  ( LAPACKE_lsame( jobz, 'o' ) && m>=n) ) ? n :
59  ( LAPACKE_lsame( jobz, 's' ) ? MIN(m,n) : 1);
60  lapack_int lda_t = MAX(1,m);
61  lapack_int ldu_t = MAX(1,nrows_u);
62  lapack_int ldvt_t = MAX(1,nrows_vt);
63  double* a_t = NULL;
64  double* u_t = NULL;
65  double* vt_t = NULL;
66  /* Check leading dimension(s) */
67  if( lda < n ) {
68  info = -6;
69  LAPACKE_xerbla( "LAPACKE_dgesdd_work", info );
70  return info;
71  }
72  if( ldu < ncols_u ) {
73  info = -9;
74  LAPACKE_xerbla( "LAPACKE_dgesdd_work", info );
75  return info;
76  }
77  if( ldvt < n ) {
78  info = -11;
79  LAPACKE_xerbla( "LAPACKE_dgesdd_work", info );
80  return info;
81  }
82  /* Query optimal working array(s) size if requested */
83  if( lwork == -1 ) {
84  LAPACK_dgesdd( &jobz, &m, &n, a, &lda_t, s, u, &ldu_t, vt, &ldvt_t,
85  work, &lwork, iwork, &info );
86  return (info < 0) ? (info - 1) : info;
87  }
88  /* Allocate memory for temporary array(s) */
89  a_t = (double*)LAPACKE_malloc( sizeof(double) * lda_t * MAX(1,n) );
90  if( a_t == NULL ) {
91  info = LAPACK_TRANSPOSE_MEMORY_ERROR;
92  goto exit_level_0;
93  }
94  if( LAPACKE_lsame( jobz, 'a' ) || LAPACKE_lsame( jobz, 's' ) ||
95  ( LAPACKE_lsame( jobz, 'o' ) && (m<n) ) ) {
96  u_t = (double*)
97  LAPACKE_malloc( sizeof(double) * ldu_t * MAX(1,ncols_u) );
98  if( u_t == NULL ) {
99  info = LAPACK_TRANSPOSE_MEMORY_ERROR;
100  goto exit_level_1;
101  }
102  }
103  if( LAPACKE_lsame( jobz, 'a' ) || LAPACKE_lsame( jobz, 's' ) ||
104  ( LAPACKE_lsame( jobz, 'o' ) && (m>=n) ) ) {
105  vt_t = (double*)
106  LAPACKE_malloc( sizeof(double) * ldvt_t * MAX(1,n) );
107  if( vt_t == NULL ) {
108  info = LAPACK_TRANSPOSE_MEMORY_ERROR;
109  goto exit_level_2;
110  }
111  }
112  /* Transpose input matrices */
113  LAPACKE_dge_trans( matrix_layout, m, n, a, lda, a_t, lda_t );
114  /* Call LAPACK function and adjust info */
115  LAPACK_dgesdd( &jobz, &m, &n, a_t, &lda_t, s, u_t, &ldu_t, vt_t,
116  &ldvt_t, work, &lwork, iwork, &info );
117  if( info < 0 ) {
118  info = info - 1;
119  }
120  /* Transpose output matrices */
121  LAPACKE_dge_trans( LAPACK_COL_MAJOR, m, n, a_t, lda_t, a, lda );
122  if( LAPACKE_lsame( jobz, 'a' ) || LAPACKE_lsame( jobz, 's' ) ||
123  ( LAPACKE_lsame( jobz, 'o' ) && (m<n) ) ) {
124  LAPACKE_dge_trans( LAPACK_COL_MAJOR, nrows_u, ncols_u, u_t, ldu_t,
125  u, ldu );
126  }
127  if( LAPACKE_lsame( jobz, 'a' ) || LAPACKE_lsame( jobz, 's' ) ||
128  ( LAPACKE_lsame( jobz, 'o' ) && (m>=n) ) ) {
129  LAPACKE_dge_trans( LAPACK_COL_MAJOR, nrows_vt, n, vt_t, ldvt_t, vt,
130  ldvt );
131  }
132  /* Release memory and exit */
133  if( LAPACKE_lsame( jobz, 'a' ) || LAPACKE_lsame( jobz, 's' ) ||
134  ( LAPACKE_lsame( jobz, 'o' ) && (m>=n) ) ) {
135  LAPACKE_free( vt_t );
136  }
137 exit_level_2:
138  if( LAPACKE_lsame( jobz, 'a' ) || LAPACKE_lsame( jobz, 's' ) ||
139  ( LAPACKE_lsame( jobz, 'o' ) && (m<n) ) ) {
140  LAPACKE_free( u_t );
141  }
142 exit_level_1:
143  LAPACKE_free( a_t );
144 exit_level_0:
145  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
146  LAPACKE_xerbla( "LAPACKE_dgesdd_work", info );
147  }
148  } else {
149  info = -1;
150  LAPACKE_xerbla( "LAPACKE_dgesdd_work", info );
151  }
152  return info;
153 }
LAPACKE_dge_trans
void LAPACKE_dge_trans(int matrix_layout, lapack_int m, lapack_int n, const double *in, lapack_int ldin, double *out, lapack_int ldout)
Definition: lapacke_dge_trans.c:40
LAPACK_ROW_MAJOR
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
LAPACK_dgesdd
void LAPACK_dgesdd(char *jobz, lapack_int *m, lapack_int *n, double *a, lapack_int *lda, double *s, double *u, lapack_int *ldu, double *vt, lapack_int *ldvt, double *work, lapack_int *lwork, lapack_int *iwork, lapack_int *info)
MIN
#define MIN(x, y)
Definition: lapacke_utils.h:50
MAX
#define MAX(x, y)
Definition: lapacke_utils.h:47
LAPACKE_free
#define LAPACKE_free(p)
Definition: lapacke.h:113
LAPACKE_malloc
#define LAPACKE_malloc(size)
Definition: lapacke.h:110
LAPACKE_lsame
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:36
LAPACK_COL_MAJOR
#define LAPACK_COL_MAJOR
Definition: lapacke.h:120
LAPACKE_xerbla
void LAPACKE_xerbla(const char *name, lapack_int info)
Definition: lapacke_xerbla.c:37
lapack_int
#define lapack_int
Definition: lapacke.h:47
LAPACK_TRANSPOSE_MEMORY_ERROR
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:123

Here is the call graph for this function:

Here is the caller graph for this function: