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