LAPACK  3.8.0
LAPACK: Linear Algebra PACKage
lapacke_dggsvp_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 dggsvp
30 * Author: Intel Corporation
31 * Generated November 2015
32 *****************************************************************************/
33 
34 #include "lapacke_utils.h"
35 
36 lapack_int LAPACKE_dggsvp_work( int matrix_layout, char jobu, char jobv,
37  char jobq, lapack_int m, lapack_int p,
38  lapack_int n, double* a, lapack_int lda,
39  double* b, lapack_int ldb, double tola,
40  double tolb, lapack_int* k, lapack_int* l,
41  double* u, lapack_int ldu, double* v,
42  lapack_int ldv, double* q, lapack_int ldq,
43  lapack_int* iwork, double* tau, double* work )
44 {
45  lapack_int info = 0;
46  if( matrix_layout == LAPACK_COL_MAJOR ) {
47  /* Call LAPACK function and adjust info */
48  LAPACK_dggsvp( &jobu, &jobv, &jobq, &m, &p, &n, a, &lda, b, &ldb, &tola,
49  &tolb, k, l, u, &ldu, v, &ldv, q, &ldq, iwork, tau, work,
50  &info );
51  if( info < 0 ) {
52  info = info - 1;
53  }
54  } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
55  lapack_int lda_t = MAX(1,m);
56  lapack_int ldb_t = MAX(1,p);
57  lapack_int ldq_t = MAX(1,n);
58  lapack_int ldu_t = MAX(1,m);
59  lapack_int ldv_t = MAX(1,p);
60  double* a_t = NULL;
61  double* b_t = NULL;
62  double* u_t = NULL;
63  double* v_t = NULL;
64  double* q_t = NULL;
65  /* Check leading dimension(s) */
66  if( lda < n ) {
67  info = -9;
68  LAPACKE_xerbla( "LAPACKE_dggsvp_work", info );
69  return info;
70  }
71  if( ldb < n ) {
72  info = -11;
73  LAPACKE_xerbla( "LAPACKE_dggsvp_work", info );
74  return info;
75  }
76  if( ldq < n ) {
77  info = -21;
78  LAPACKE_xerbla( "LAPACKE_dggsvp_work", info );
79  return info;
80  }
81  if( ldu < m ) {
82  info = -17;
83  LAPACKE_xerbla( "LAPACKE_dggsvp_work", info );
84  return info;
85  }
86  if( ldv < m ) {
87  info = -19;
88  LAPACKE_xerbla( "LAPACKE_dggsvp_work", info );
89  return info;
90  }
91  /* Allocate memory for temporary array(s) */
92  a_t = (double*)LAPACKE_malloc( sizeof(double) * lda_t * MAX(1,n) );
93  if( a_t == NULL ) {
95  goto exit_level_0;
96  }
97  b_t = (double*)LAPACKE_malloc( sizeof(double) * ldb_t * MAX(1,n) );
98  if( b_t == NULL ) {
100  goto exit_level_1;
101  }
102  if( LAPACKE_lsame( jobu, 'u' ) ) {
103  u_t = (double*)LAPACKE_malloc( sizeof(double) * ldu_t * MAX(1,m) );
104  if( u_t == NULL ) {
106  goto exit_level_2;
107  }
108  }
109  if( LAPACKE_lsame( jobv, 'v' ) ) {
110  v_t = (double*)LAPACKE_malloc( sizeof(double) * ldv_t * MAX(1,m) );
111  if( v_t == NULL ) {
113  goto exit_level_3;
114  }
115  }
116  if( LAPACKE_lsame( jobq, 'q' ) ) {
117  q_t = (double*)LAPACKE_malloc( sizeof(double) * ldq_t * MAX(1,n) );
118  if( q_t == NULL ) {
120  goto exit_level_4;
121  }
122  }
123  /* Transpose input matrices */
124  LAPACKE_dge_trans( matrix_layout, m, n, a, lda, a_t, lda_t );
125  LAPACKE_dge_trans( matrix_layout, p, n, b, ldb, b_t, ldb_t );
126  /* Call LAPACK function and adjust info */
127  LAPACK_dggsvp( &jobu, &jobv, &jobq, &m, &p, &n, a_t, &lda_t, b_t,
128  &ldb_t, &tola, &tolb, k, l, u_t, &ldu_t, v_t, &ldv_t,
129  q_t, &ldq_t, iwork, tau, work, &info );
130  if( info < 0 ) {
131  info = info - 1;
132  }
133  /* Transpose output matrices */
134  LAPACKE_dge_trans( LAPACK_COL_MAJOR, m, n, a_t, lda_t, a, lda );
135  LAPACKE_dge_trans( LAPACK_COL_MAJOR, p, n, b_t, ldb_t, b, ldb );
136  if( LAPACKE_lsame( jobu, 'u' ) ) {
137  LAPACKE_dge_trans( LAPACK_COL_MAJOR, m, m, u_t, ldu_t, u, ldu );
138  }
139  if( LAPACKE_lsame( jobv, 'v' ) ) {
140  LAPACKE_dge_trans( LAPACK_COL_MAJOR, p, m, v_t, ldv_t, v, ldv );
141  }
142  if( LAPACKE_lsame( jobq, 'q' ) ) {
143  LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, n, q_t, ldq_t, q, ldq );
144  }
145  /* Release memory and exit */
146  if( LAPACKE_lsame( jobq, 'q' ) ) {
147  LAPACKE_free( q_t );
148  }
149 exit_level_4:
150  if( LAPACKE_lsame( jobv, 'v' ) ) {
151  LAPACKE_free( v_t );
152  }
153 exit_level_3:
154  if( LAPACKE_lsame( jobu, 'u' ) ) {
155  LAPACKE_free( u_t );
156  }
157 exit_level_2:
158  LAPACKE_free( b_t );
159 exit_level_1:
160  LAPACKE_free( a_t );
161 exit_level_0:
162  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
163  LAPACKE_xerbla( "LAPACKE_dggsvp_work", info );
164  }
165  } else {
166  info = -1;
167  LAPACKE_xerbla( "LAPACKE_dggsvp_work", info );
168  }
169  return info;
170 }
#define MAX(x, y)
Definition: lapacke_utils.h:47
#define LAPACK_COL_MAJOR
Definition: lapacke.h:120
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:123
void LAPACK_dggsvp(char *jobu, char *jobv, char *jobq, lapack_int *m, lapack_int *p, lapack_int *n, double *a, lapack_int *lda, double *b, lapack_int *ldb, double *tola, double *tolb, lapack_int *k, lapack_int *l, double *u, lapack_int *ldu, double *v, lapack_int *ldv, double *q, lapack_int *ldq, lapack_int *iwork, double *tau, double *work, lapack_int *info)
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
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_int
Definition: lapacke.h:47
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:36
#define LAPACKE_malloc(size)
Definition: lapacke.h:110
#define LAPACKE_free(p)
Definition: lapacke.h:113
void LAPACKE_xerbla(const char *name, lapack_int info)
lapack_int LAPACKE_dggsvp_work(int matrix_layout, char jobu, char jobv, char jobq, lapack_int m, lapack_int p, lapack_int n, double *a, lapack_int lda, double *b, lapack_int ldb, double tola, double tolb, lapack_int *k, lapack_int *l, double *u, lapack_int ldu, double *v, lapack_int ldv, double *q, lapack_int ldq, lapack_int *iwork, double *tau, double *work)