LAPACK  3.8.0
LAPACK: Linear Algebra PACKage
lapacke_zggsvd3_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 zggsvd3
30 * Author: Intel Corporation
31 * Generated August, 2015
32 *****************************************************************************/
33 
34 #include "lapacke_utils.h"
35 
36 lapack_int LAPACKE_zggsvd3_work( int matrix_layout, char jobu, char jobv,
37  char jobq, lapack_int m, lapack_int n,
41  double* alpha, double* beta,
45  lapack_complex_double* work, lapack_int lwork,
46  double* rwork, lapack_int* iwork )
47 {
48  lapack_int info = 0;
49  if( matrix_layout == LAPACK_COL_MAJOR ) {
50  /* Call LAPACK function and adjust info */
51  LAPACK_zggsvd3( &jobu, &jobv, &jobq, &m, &n, &p, k, l, a, &lda, b, &ldb,
52  alpha, beta, u, &ldu, v, &ldv, q, &ldq, work, &lwork,
53  rwork, iwork, &info );
54  if( info < 0 ) {
55  info = info - 1;
56  }
57  } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
58  lapack_int lda_t = MAX(1,m);
59  lapack_int ldb_t = MAX(1,p);
60  lapack_int ldq_t = MAX(1,n);
61  lapack_int ldu_t = MAX(1,m);
62  lapack_int ldv_t = MAX(1,p);
63  lapack_complex_double* a_t = NULL;
64  lapack_complex_double* b_t = NULL;
65  lapack_complex_double* u_t = NULL;
66  lapack_complex_double* v_t = NULL;
67  lapack_complex_double* q_t = NULL;
68  /* Check leading dimension(s) */
69  if( lda < n ) {
70  info = -11;
71  LAPACKE_xerbla( "LAPACKE_zggsvd3_work", info );
72  return info;
73  }
74  if( ldb < n ) {
75  info = -13;
76  LAPACKE_xerbla( "LAPACKE_zggsvd3_work", info );
77  return info;
78  }
79  if( ldq < n ) {
80  info = -21;
81  LAPACKE_xerbla( "LAPACKE_zggsvd3_work", info );
82  return info;
83  }
84  if( ldu < m ) {
85  info = -17;
86  LAPACKE_xerbla( "LAPACKE_zggsvd3_work", info );
87  return info;
88  }
89  if( ldv < p ) {
90  info = -19;
91  LAPACKE_xerbla( "LAPACKE_zggsvd3_work", info );
92  return info;
93  }
94  /* Query optimal working array(s) size if requested */
95  if( lwork == -1 ) {
96  LAPACK_zggsvd3( &jobu, &jobv, &jobq, &m, &n, &p, k, l, a, &lda_t,
97  b, &ldb_t, alpha, beta, u, &ldu_t, v, &ldv_t,
98  q, &ldq_t, work, &lwork, rwork, iwork, &info );
99  return (info < 0) ? (info - 1) : info;
100  }
101  /* Allocate memory for temporary array(s) */
102  a_t = (lapack_complex_double*)
103  LAPACKE_malloc( sizeof(lapack_complex_double) * lda_t * MAX(1,n) );
104  if( a_t == NULL ) {
106  goto exit_level_0;
107  }
108  b_t = (lapack_complex_double*)
109  LAPACKE_malloc( sizeof(lapack_complex_double) * ldb_t * MAX(1,n) );
110  if( b_t == NULL ) {
112  goto exit_level_1;
113  }
114  if( LAPACKE_lsame( jobu, 'u' ) ) {
115  u_t = (lapack_complex_double*)
117  ldu_t * MAX(1,m) );
118  if( u_t == NULL ) {
120  goto exit_level_2;
121  }
122  }
123  if( LAPACKE_lsame( jobv, 'v' ) ) {
124  v_t = (lapack_complex_double*)
126  ldv_t * MAX(1,p) );
127  if( v_t == NULL ) {
129  goto exit_level_3;
130  }
131  }
132  if( LAPACKE_lsame( jobq, 'q' ) ) {
133  q_t = (lapack_complex_double*)
135  ldq_t * MAX(1,n) );
136  if( q_t == NULL ) {
138  goto exit_level_4;
139  }
140  }
141  /* Transpose input matrices */
142  LAPACKE_zge_trans( matrix_layout, m, n, a, lda, a_t, lda_t );
143  LAPACKE_zge_trans( matrix_layout, p, n, b, ldb, b_t, ldb_t );
144  /* Call LAPACK function and adjust info */
145  LAPACK_zggsvd3( &jobu, &jobv, &jobq, &m, &n, &p, k, l, a_t, &lda_t, b_t,
146  &ldb_t, alpha, beta, u_t, &ldu_t, v_t, &ldv_t, q_t,
147  &ldq_t, work, &lwork, rwork, iwork, &info );
148  if( info < 0 ) {
149  info = info - 1;
150  }
151  /* Transpose output matrices */
152  LAPACKE_zge_trans( LAPACK_COL_MAJOR, m, n, a_t, lda_t, a, lda );
153  LAPACKE_zge_trans( LAPACK_COL_MAJOR, p, n, b_t, ldb_t, b, ldb );
154  if( LAPACKE_lsame( jobu, 'u' ) ) {
155  LAPACKE_zge_trans( LAPACK_COL_MAJOR, m, m, u_t, ldu_t, u, ldu );
156  }
157  if( LAPACKE_lsame( jobv, 'v' ) ) {
158  LAPACKE_zge_trans( LAPACK_COL_MAJOR, p, p, v_t, ldv_t, v, ldv );
159  }
160  if( LAPACKE_lsame( jobq, 'q' ) ) {
161  LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, n, q_t, ldq_t, q, ldq );
162  }
163  /* Release memory and exit */
164  if( LAPACKE_lsame( jobq, 'q' ) ) {
165  LAPACKE_free( q_t );
166  }
167 exit_level_4:
168  if( LAPACKE_lsame( jobv, 'v' ) ) {
169  LAPACKE_free( v_t );
170  }
171 exit_level_3:
172  if( LAPACKE_lsame( jobu, 'u' ) ) {
173  LAPACKE_free( u_t );
174  }
175 exit_level_2:
176  LAPACKE_free( b_t );
177 exit_level_1:
178  LAPACKE_free( a_t );
179 exit_level_0:
180  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
181  LAPACKE_xerbla( "LAPACKE_zggsvd3_work", info );
182  }
183  } else {
184  info = -1;
185  LAPACKE_xerbla( "LAPACKE_zggsvd3_work", info );
186  }
187  return info;
188 }
#define MAX(x, y)
Definition: lapacke_utils.h:47
#define LAPACK_COL_MAJOR
Definition: lapacke.h:120
void LAPACK_zggsvd3(char *jobu, char *jobv, char *jobq, lapack_int *m, lapack_int *n, lapack_int *p, lapack_int *k, lapack_int *l, lapack_complex_double *a, lapack_int *lda, lapack_complex_double *b, lapack_int *ldb, double *alpha, double *beta, lapack_complex_double *u, lapack_int *ldu, lapack_complex_double *v, lapack_int *ldv, lapack_complex_double *q, lapack_int *ldq, lapack_complex_double *work, lapack_int *lwork, double *rwork, lapack_int *iwork, lapack_int *info)
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:123
lapack_int LAPACKE_zggsvd3_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, lapack_complex_double *a, lapack_int lda, lapack_complex_double *b, lapack_int ldb, double *alpha, double *beta, lapack_complex_double *u, lapack_int ldu, lapack_complex_double *v, lapack_int ldv, lapack_complex_double *q, lapack_int ldq, lapack_complex_double *work, lapack_int lwork, double *rwork, lapack_int *iwork)
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
void LAPACKE_zge_trans(int matrix_layout, lapack_int m, lapack_int n, const lapack_complex_double *in, lapack_int ldin, lapack_complex_double *out, lapack_int ldout)
#define lapack_int
Definition: lapacke.h:47
#define lapack_complex_double
Definition: lapacke.h:90
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)