LAPACK  3.6.1
LAPACK: Linear Algebra PACKage
lapacke_dggsvd3_work.c
Go to the documentation of this file.
1 /*****************************************************************************
2  Copyright (c) 2014, Intel Corp.
3  All rights reserved.
4 
5  Redistribution and use in source and binary forms, with or without
6  modification, are permitted provided that the following conditions are met:
7 
8  * Redistributions of source code must retain the above copyright notice,
9  this list of conditions and the following disclaimer.
10  * Redistributions in binary form must reproduce the above copyright
11  notice, this list of conditions and the following disclaimer in the
12  documentation and/or other materials provided with the distribution.
13  * Neither the name of Intel Corporation nor the names of its contributors
14  may be used to endorse or promote products derived from this software
15  without specific prior written permission.
16 
17  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
18  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20  ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
21  LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22  CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23  SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
24  INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25  CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
26  ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
27  THE POSSIBILITY OF SUCH DAMAGE.
28 *****************************************************************************
29 * Contents: Native middle-level C interface to LAPACK function dggsvd3
30 * Author: Intel Corporation
31 * Generated August, 2015
32 *****************************************************************************/
33 
34 #include "lapacke_utils.h"
35 
36 lapack_int LAPACKE_dggsvd3_work( int matrix_layout, char jobu, char jobv,
37  char jobq, lapack_int m, lapack_int n,
39  double* a, lapack_int lda, double* b,
40  lapack_int ldb, double* alpha, double* beta,
41  double* u, lapack_int ldu, double* v,
42  lapack_int ldv, double* q, lapack_int ldq,
43  double* work, lapack_int lwork,
44  lapack_int* iwork )
45 {
46  lapack_int info = 0;
47  if( matrix_layout == LAPACK_COL_MAJOR ) {
48  /* Call LAPACK function and adjust info */
49  LAPACK_dggsvd3( &jobu, &jobv, &jobq, &m, &n, &p, k, l, a, &lda, b, &ldb,
50  alpha, beta, u, &ldu, v, &ldv, q, &ldq, work, &lwork,
51  iwork, &info );
52  if( info < 0 ) {
53  info = info - 1;
54  }
55  } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
56  lapack_int lda_t = MAX(1,m);
57  lapack_int ldb_t = MAX(1,p);
58  lapack_int ldq_t = MAX(1,n);
59  lapack_int ldu_t = MAX(1,m);
60  lapack_int ldv_t = MAX(1,p);
61  double* a_t = NULL;
62  double* b_t = NULL;
63  double* u_t = NULL;
64  double* v_t = NULL;
65  double* q_t = NULL;
66  /* Check leading dimension(s) */
67  if( lda < n ) {
68  info = -11;
69  LAPACKE_xerbla( "LAPACKE_dggsvd3_work", info );
70  return info;
71  }
72  if( ldb < n ) {
73  info = -13;
74  LAPACKE_xerbla( "LAPACKE_dggsvd3_work", info );
75  return info;
76  }
77  if( ldq < n ) {
78  info = -21;
79  LAPACKE_xerbla( "LAPACKE_dggsvd3_work", info );
80  return info;
81  }
82  if( ldu < m ) {
83  info = -17;
84  LAPACKE_xerbla( "LAPACKE_dggsvd3_work", info );
85  return info;
86  }
87  if( ldv < p ) {
88  info = -19;
89  LAPACKE_xerbla( "LAPACKE_dggsvd3_work", info );
90  return info;
91  }
92  /* Query optimal working array(s) size if requested */
93  if( lwork == -1 ) {
94  LAPACK_dggsvd3( &jobu, &jobv, &jobq, &m, &n, &p, k, l, a, &lda_t,
95  b, &ldb_t, alpha, beta, u, &ldu_t, v, &ldv_t,
96  q, &ldq_t, work, &lwork, iwork, &info );
97  return (info < 0) ? (info - 1) : info;
98  }
99  /* Allocate memory for temporary array(s) */
100  a_t = (double*)LAPACKE_malloc( sizeof(double) * lda_t * MAX(1,n) );
101  if( a_t == NULL ) {
103  goto exit_level_0;
104  }
105  b_t = (double*)LAPACKE_malloc( sizeof(double) * ldb_t * MAX(1,n) );
106  if( b_t == NULL ) {
108  goto exit_level_1;
109  }
110  if( LAPACKE_lsame( jobu, 'u' ) ) {
111  u_t = (double*)LAPACKE_malloc( sizeof(double) * ldu_t * MAX(1,m) );
112  if( u_t == NULL ) {
114  goto exit_level_2;
115  }
116  }
117  if( LAPACKE_lsame( jobv, 'v' ) ) {
118  v_t = (double*)LAPACKE_malloc( sizeof(double) * ldv_t * MAX(1,p) );
119  if( v_t == NULL ) {
121  goto exit_level_3;
122  }
123  }
124  if( LAPACKE_lsame( jobq, 'q' ) ) {
125  q_t = (double*)LAPACKE_malloc( sizeof(double) * ldq_t * MAX(1,n) );
126  if( q_t == NULL ) {
128  goto exit_level_4;
129  }
130  }
131  /* Transpose input matrices */
132  LAPACKE_dge_trans( matrix_layout, m, n, a, lda, a_t, lda_t );
133  LAPACKE_dge_trans( matrix_layout, p, n, b, ldb, b_t, ldb_t );
134  /* Call LAPACK function and adjust info */
135  LAPACK_dggsvd3( &jobu, &jobv, &jobq, &m, &n, &p, k, l, a_t, &lda_t, b_t,
136  &ldb_t, alpha, beta, u_t, &ldu_t, v_t, &ldv_t, q_t,
137  &ldq_t, work, &lwork, iwork, &info );
138  if( info < 0 ) {
139  info = info - 1;
140  }
141  /* Transpose output matrices */
142  LAPACKE_dge_trans( LAPACK_COL_MAJOR, m, n, a_t, lda_t, a, lda );
143  LAPACKE_dge_trans( LAPACK_COL_MAJOR, p, n, b_t, ldb_t, b, ldb );
144  if( LAPACKE_lsame( jobu, 'u' ) ) {
145  LAPACKE_dge_trans( LAPACK_COL_MAJOR, m, m, u_t, ldu_t, u, ldu );
146  }
147  if( LAPACKE_lsame( jobv, 'v' ) ) {
148  LAPACKE_dge_trans( LAPACK_COL_MAJOR, p, p, v_t, ldv_t, v, ldv );
149  }
150  if( LAPACKE_lsame( jobq, 'q' ) ) {
151  LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, n, q_t, ldq_t, q, ldq );
152  }
153  /* Release memory and exit */
154  if( LAPACKE_lsame( jobq, 'q' ) ) {
155  LAPACKE_free( q_t );
156  }
157 exit_level_4:
158  if( LAPACKE_lsame( jobv, 'v' ) ) {
159  LAPACKE_free( v_t );
160  }
161 exit_level_3:
162  if( LAPACKE_lsame( jobu, 'u' ) ) {
163  LAPACKE_free( u_t );
164  }
165 exit_level_2:
166  LAPACKE_free( b_t );
167 exit_level_1:
168  LAPACKE_free( a_t );
169 exit_level_0:
170  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
171  LAPACKE_xerbla( "LAPACKE_dggsvd3_work", info );
172  }
173  } else {
174  info = -1;
175  LAPACKE_xerbla( "LAPACKE_dggsvd3_work", info );
176  }
177  return info;
178 }
void LAPACKE_dge_trans(int matrix_layout, lapack_int m, lapack_int n, const double *in, lapack_int ldin, double *out, lapack_int ldout)
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
#define MAX(x, y)
Definition: lapacke_utils.h:47
lapack_int LAPACKE_dggsvd3_work(int matrix_layout, char jobu, char jobv, char jobq, lapack_int m, lapack_int n, lapack_int p, lapack_int *k, lapack_int *l, double *a, lapack_int lda, double *b, lapack_int ldb, double *alpha, double *beta, double *u, lapack_int ldu, double *v, lapack_int ldv, double *q, lapack_int ldq, double *work, lapack_int lwork, lapack_int *iwork)
#define LAPACKE_free(p)
Definition: lapacke.h:113
#define LAPACKE_malloc(size)
Definition: lapacke.h:110
void LAPACK_dggsvd3(char *jobu, char *jobv, char *jobq, lapack_int *m, lapack_int *n, lapack_int *p, lapack_int *k, lapack_int *l, double *a, lapack_int *lda, double *b, lapack_int *ldb, double *alpha, double *beta, double *u, lapack_int *ldu, double *v, lapack_int *ldv, double *q, lapack_int *ldq, double *work, lapack_int *lwork, lapack_int *iwork, lapack_int *info)
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:36
#define LAPACK_COL_MAJOR
Definition: lapacke.h:120
void LAPACKE_xerbla(const char *name, lapack_int info)
#define lapack_int
Definition: lapacke.h:47
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:123