LAPACK  3.8.0
LAPACK: Linear Algebra PACKage
lapacke_cggsvp3_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 cggsvp3
30 * Author: Intel Corporation
31 * Generated August, 2015
32 *****************************************************************************/
33 
34 #include "lapacke_utils.h"
35 
36 lapack_int LAPACKE_cggsvp3_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, lapack_int lwork )
48 {
49  lapack_int info = 0;
50  if( matrix_layout == LAPACK_COL_MAJOR ) {
51  /* Call LAPACK function and adjust info */
52  LAPACK_cggsvp3( &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, &lwork, &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_cggsvp3_work", info );
73  return info;
74  }
75  if( ldb < n ) {
76  info = -11;
77  LAPACKE_xerbla( "LAPACKE_cggsvp3_work", info );
78  return info;
79  }
80  if( ldq < n ) {
81  info = -21;
82  LAPACKE_xerbla( "LAPACKE_cggsvp3_work", info );
83  return info;
84  }
85  if( ldu < m ) {
86  info = -17;
87  LAPACKE_xerbla( "LAPACKE_cggsvp3_work", info );
88  return info;
89  }
90  if( ldv < p ) {
91  info = -19;
92  LAPACKE_xerbla( "LAPACKE_cggsvp3_work", info );
93  return info;
94  }
95  /* Query optimal working array(s) size if requested */
96  if( lwork == -1 ) {
97  LAPACK_cggsvp3( &jobu, &jobv, &jobq, &m, &p, &n, a, &lda_t, b,
98  &ldb_t, &tola, &tolb, k, l, u, &ldu_t, v, &ldv_t,
99  q, &ldq_t, iwork, rwork, tau, work, &lwork, &info );
100  return (info < 0) ? (info - 1) : info;
101  }
102  /* Allocate memory for temporary array(s) */
103  a_t = (lapack_complex_float*)
104  LAPACKE_malloc( sizeof(lapack_complex_float) * lda_t * MAX(1,n) );
105  if( a_t == NULL ) {
107  goto exit_level_0;
108  }
109  b_t = (lapack_complex_float*)
110  LAPACKE_malloc( sizeof(lapack_complex_float) * ldb_t * MAX(1,n) );
111  if( b_t == NULL ) {
113  goto exit_level_1;
114  }
115  if( LAPACKE_lsame( jobu, 'u' ) ) {
116  u_t = (lapack_complex_float*)
118  ldu_t * MAX(1,m) );
119  if( u_t == NULL ) {
121  goto exit_level_2;
122  }
123  }
124  if( LAPACKE_lsame( jobv, 'v' ) ) {
125  v_t = (lapack_complex_float*)
127  ldv_t * MAX(1,p) );
128  if( v_t == NULL ) {
130  goto exit_level_3;
131  }
132  }
133  if( LAPACKE_lsame( jobq, 'q' ) ) {
134  q_t = (lapack_complex_float*)
136  ldq_t * MAX(1,n) );
137  if( q_t == NULL ) {
139  goto exit_level_4;
140  }
141  }
142  /* Transpose input matrices */
143  LAPACKE_cge_trans( matrix_layout, m, n, a, lda, a_t, lda_t );
144  LAPACKE_cge_trans( matrix_layout, p, n, b, ldb, b_t, ldb_t );
145  /* Call LAPACK function and adjust info */
146  LAPACK_cggsvp3( &jobu, &jobv, &jobq, &m, &p, &n, a_t, &lda_t, b_t,
147  &ldb_t, &tola, &tolb, k, l, u_t, &ldu_t, v_t, &ldv_t,
148  q_t, &ldq_t, iwork, rwork, tau, work, &lwork, &info );
149  if( info < 0 ) {
150  info = info - 1;
151  }
152  /* Transpose output matrices */
153  LAPACKE_cge_trans( LAPACK_COL_MAJOR, m, n, a_t, lda_t, a, lda );
154  LAPACKE_cge_trans( LAPACK_COL_MAJOR, p, n, b_t, ldb_t, b, ldb );
155  if( LAPACKE_lsame( jobu, 'u' ) ) {
156  LAPACKE_cge_trans( LAPACK_COL_MAJOR, m, m, u_t, ldu_t, u, ldu );
157  }
158  if( LAPACKE_lsame( jobv, 'v' ) ) {
159  LAPACKE_cge_trans( LAPACK_COL_MAJOR, p, p, v_t, ldv_t, v, ldv );
160  }
161  if( LAPACKE_lsame( jobq, 'q' ) ) {
162  LAPACKE_cge_trans( LAPACK_COL_MAJOR, n, n, q_t, ldq_t, q, ldq );
163  }
164  /* Release memory and exit */
165  if( LAPACKE_lsame( jobq, 'q' ) ) {
166  LAPACKE_free( q_t );
167  }
168 exit_level_4:
169  if( LAPACKE_lsame( jobv, 'v' ) ) {
170  LAPACKE_free( v_t );
171  }
172 exit_level_3:
173  if( LAPACKE_lsame( jobu, 'u' ) ) {
174  LAPACKE_free( u_t );
175  }
176 exit_level_2:
177  LAPACKE_free( b_t );
178 exit_level_1:
179  LAPACKE_free( a_t );
180 exit_level_0:
181  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
182  LAPACKE_xerbla( "LAPACKE_cggsvp3_work", info );
183  }
184  } else {
185  info = -1;
186  LAPACKE_xerbla( "LAPACKE_cggsvp3_work", info );
187  }
188  return info;
189 }
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
#define LAPACKE_free(p)
Definition: lapacke.h:113
#define lapack_complex_float
Definition: lapacke.h:74
#define MAX(x, y)
Definition: lapacke_utils.h:47
#define LAPACKE_malloc(size)
Definition: lapacke.h:110
void LAPACK_cggsvp3(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 *lwork, lapack_int *info)
lapack_int LAPACKE_cggsvp3_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, lapack_int lwork)
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