LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches
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*****************************************************************************/
32
33#include "lapacke_utils.h"
34
35lapack_int LAPACKE_cggsvp3_work( int matrix_layout, char jobu, char jobv,
36 char jobq, lapack_int m, lapack_int p,
39 lapack_int ldb, float tola, float tolb,
44 lapack_int* iwork, float* rwork,
46 lapack_complex_float* work, lapack_int lwork )
47{
48 lapack_int info = 0;
49 if( matrix_layout == LAPACK_COL_MAJOR ) {
50 /* Call LAPACK function and adjust info */
51 LAPACK_cggsvp3( &jobu, &jobv, &jobq, &m, &p, &n, a, &lda, b, &ldb, &tola,
52 &tolb, k, l, u, &ldu, v, &ldv, q, &ldq, iwork, rwork,
53 tau, work, &lwork, &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_float* a_t = NULL;
64 lapack_complex_float* b_t = NULL;
65 lapack_complex_float* u_t = NULL;
66 lapack_complex_float* v_t = NULL;
67 lapack_complex_float* q_t = NULL;
68 /* Check leading dimension(s) */
69 if( lda < n ) {
70 info = -9;
71 LAPACKE_xerbla( "LAPACKE_cggsvp3_work", info );
72 return info;
73 }
74 if( ldb < n ) {
75 info = -11;
76 LAPACKE_xerbla( "LAPACKE_cggsvp3_work", info );
77 return info;
78 }
79 if( ldq < n ) {
80 info = -21;
81 LAPACKE_xerbla( "LAPACKE_cggsvp3_work", info );
82 return info;
83 }
84 if( ldu < m ) {
85 info = -17;
86 LAPACKE_xerbla( "LAPACKE_cggsvp3_work", info );
87 return info;
88 }
89 if( ldv < p ) {
90 info = -19;
91 LAPACKE_xerbla( "LAPACKE_cggsvp3_work", info );
92 return info;
93 }
94 /* Query optimal working array(s) size if requested */
95 if( lwork == -1 ) {
96 LAPACK_cggsvp3( &jobu, &jobv, &jobq, &m, &p, &n, a, &lda_t, b,
97 &ldb_t, &tola, &tolb, k, l, u, &ldu_t, v, &ldv_t,
98 q, &ldq_t, iwork, rwork, tau, work, &lwork, &info );
99 return (info < 0) ? (info - 1) : info;
100 }
101 /* Allocate memory for temporary array(s) */
102 a_t = (lapack_complex_float*)
103 LAPACKE_malloc( sizeof(lapack_complex_float) * lda_t * MAX(1,n) );
104 if( a_t == NULL ) {
106 goto exit_level_0;
107 }
108 b_t = (lapack_complex_float*)
109 LAPACKE_malloc( sizeof(lapack_complex_float) * 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_float*)
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_float*)
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_float*)
135 ldq_t * MAX(1,n) );
136 if( q_t == NULL ) {
138 goto exit_level_4;
139 }
140 }
141 /* Transpose input matrices */
142 LAPACKE_cge_trans( matrix_layout, m, n, a, lda, a_t, lda_t );
143 LAPACKE_cge_trans( matrix_layout, p, n, b, ldb, b_t, ldb_t );
144 /* Call LAPACK function and adjust info */
145 LAPACK_cggsvp3( &jobu, &jobv, &jobq, &m, &p, &n, a_t, &lda_t, b_t,
146 &ldb_t, &tola, &tolb, k, l, u_t, &ldu_t, v_t, &ldv_t,
147 q_t, &ldq_t, iwork, rwork, tau, work, &lwork, &info );
148 if( info < 0 ) {
149 info = info - 1;
150 }
151 /* Transpose output matrices */
152 LAPACKE_cge_trans( LAPACK_COL_MAJOR, m, n, a_t, lda_t, a, lda );
153 LAPACKE_cge_trans( LAPACK_COL_MAJOR, p, n, b_t, ldb_t, b, ldb );
154 if( LAPACKE_lsame( jobu, 'u' ) ) {
155 LAPACKE_cge_trans( LAPACK_COL_MAJOR, m, m, u_t, ldu_t, u, ldu );
156 }
157 if( LAPACKE_lsame( jobv, 'v' ) ) {
158 LAPACKE_cge_trans( LAPACK_COL_MAJOR, p, p, v_t, ldv_t, v, ldv );
159 }
160 if( LAPACKE_lsame( jobq, 'q' ) ) {
161 LAPACKE_cge_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 }
167exit_level_4:
168 if( LAPACKE_lsame( jobv, 'v' ) ) {
169 LAPACKE_free( v_t );
170 }
171exit_level_3:
172 if( LAPACKE_lsame( jobu, 'u' ) ) {
173 LAPACKE_free( u_t );
174 }
175exit_level_2:
176 LAPACKE_free( b_t );
177exit_level_1:
178 LAPACKE_free( a_t );
179exit_level_0:
180 if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
181 LAPACKE_xerbla( "LAPACKE_cggsvp3_work", info );
182 }
183 } else {
184 info = -1;
185 LAPACKE_xerbla( "LAPACKE_cggsvp3_work", info );
186 }
187 return info;
188}
#define LAPACK_cggsvp3(...)
Definition: lapack.h:5585
#define lapack_int
Definition: lapack.h:87
#define lapack_complex_float
Definition: lapack.h:46
#define LAPACK_COL_MAJOR
Definition: lapacke.h:53
#define LAPACKE_free(p)
Definition: lapacke.h:46
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:52
#define LAPACKE_malloc(size)
Definition: lapacke.h:43
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:56
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:35
void LAPACKE_xerbla(const char *name, lapack_int info)
#define MAX(x, y)
Definition: lapacke_utils.h:46
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)