LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches
lapacke_sggsvd3_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 sggsvd3
30* Author: Intel Corporation
31*****************************************************************************/
32
33#include "lapacke_utils.h"
34
35lapack_int LAPACKE_sggsvd3_work( int matrix_layout, char jobu, char jobv,
36 char jobq, lapack_int m, lapack_int n,
38 float* a, lapack_int lda, float* b,
39 lapack_int ldb, float* alpha, float* beta,
40 float* u, lapack_int ldu, float* v,
41 lapack_int ldv, float* q, lapack_int ldq,
42 float* work, lapack_int lwork,
43 lapack_int* iwork )
44{
45 lapack_int info = 0;
46 if( matrix_layout == LAPACK_COL_MAJOR ) {
47 /* Call LAPACK function and adjust info */
48 LAPACK_sggsvd3( &jobu, &jobv, &jobq, &m, &n, &p, k, l, a, &lda,
49 b, &ldb, alpha, beta, u, &ldu, v, &ldv, q, &ldq,
50 work, &lwork, iwork, &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 float* a_t = NULL;
61 float* b_t = NULL;
62 float* u_t = NULL;
63 float* v_t = NULL;
64 float* q_t = NULL;
65 /* Check leading dimension(s) */
66 if( lda < n ) {
67 info = -11;
68 LAPACKE_xerbla( "LAPACKE_sggsvd3_work", info );
69 return info;
70 }
71 if( ldb < n ) {
72 info = -13;
73 LAPACKE_xerbla( "LAPACKE_sggsvd3_work", info );
74 return info;
75 }
76 if( ldq < n ) {
77 info = -21;
78 LAPACKE_xerbla( "LAPACKE_sggsvd3_work", info );
79 return info;
80 }
81 if( ldu < m ) {
82 info = -17;
83 LAPACKE_xerbla( "LAPACKE_sggsvd3_work", info );
84 return info;
85 }
86 if( ldv < p ) {
87 info = -19;
88 LAPACKE_xerbla( "LAPACKE_sggsvd3_work", info );
89 return info;
90 }
91 /* Query optimal working array(s) size if requested */
92 if( lwork == -1 ) {
93 LAPACK_sggsvd3( &jobu, &jobv, &jobq, &m, &n, &p, k, l, a, &lda_t,
94 b, &ldb_t, alpha, beta, u, &ldu_t, v, &ldv_t,
95 q, &ldq_t, work, &lwork, iwork, &info );
96 return (info < 0) ? (info - 1) : info;
97 }
98
99 /* Allocate memory for temporary array(s) */
100 a_t = (float*)LAPACKE_malloc( sizeof(float) * lda_t * MAX(1,n) );
101 if( a_t == NULL ) {
103 goto exit_level_0;
104 }
105 b_t = (float*)LAPACKE_malloc( sizeof(float) * ldb_t * MAX(1,n) );
106 if( b_t == NULL ) {
108 goto exit_level_1;
109 }
110 if( LAPACKE_lsame( jobu, 'u' ) ) {
111 u_t = (float*)LAPACKE_malloc( sizeof(float) * 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 = (float*)LAPACKE_malloc( sizeof(float) * ldv_t * MAX(1,p) );
119 if( v_t == NULL ) {
121 goto exit_level_3;
122 }
123 }
124 if( LAPACKE_lsame( jobq, 'q' ) ) {
125 q_t = (float*)LAPACKE_malloc( sizeof(float) * ldq_t * MAX(1,n) );
126 if( q_t == NULL ) {
128 goto exit_level_4;
129 }
130 }
131 /* Transpose input matrices */
132 LAPACKE_sge_trans( matrix_layout, m, n, a, lda, a_t, lda_t );
133 LAPACKE_sge_trans( matrix_layout, p, n, b, ldb, b_t, ldb_t );
134 /* Call LAPACK function and adjust info */
135 LAPACK_sggsvd3( &jobu, &jobv, &jobq, &m, &n, &p, k, l, a_t, &lda_t, b_t,
136 &ldb_t, alpha, beta, u_t, &ldu_t, v_t, &ldv_t, q_t,
137 &ldq_t, work, &lwork, iwork, &info );
138 if( info < 0 ) {
139 info = info - 1;
140 }
141 /* Transpose output matrices */
142 LAPACKE_sge_trans( LAPACK_COL_MAJOR, m, n, a_t, lda_t, a, lda );
143 LAPACKE_sge_trans( LAPACK_COL_MAJOR, p, n, b_t, ldb_t, b, ldb );
144 if( LAPACKE_lsame( jobu, 'u' ) ) {
145 LAPACKE_sge_trans( LAPACK_COL_MAJOR, m, m, u_t, ldu_t, u, ldu );
146 }
147 if( LAPACKE_lsame( jobv, 'v' ) ) {
148 LAPACKE_sge_trans( LAPACK_COL_MAJOR, p, p, v_t, ldv_t, v, ldv );
149 }
150 if( LAPACKE_lsame( jobq, 'q' ) ) {
151 LAPACKE_sge_trans( LAPACK_COL_MAJOR, n, n, q_t, ldq_t, q, ldq );
152 }
153 /* Release memory and exit */
154 if( LAPACKE_lsame( jobq, 'q' ) ) {
155 LAPACKE_free( q_t );
156 }
157exit_level_4:
158 if( LAPACKE_lsame( jobv, 'v' ) ) {
159 LAPACKE_free( v_t );
160 }
161exit_level_3:
162 if( LAPACKE_lsame( jobu, 'u' ) ) {
163 LAPACKE_free( u_t );
164 }
165exit_level_2:
166 LAPACKE_free( b_t );
167exit_level_1:
168 LAPACKE_free( a_t );
169exit_level_0:
170 if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
171 LAPACKE_xerbla( "LAPACKE_sggsvd3_work", info );
172 }
173 } else {
174 info = -1;
175 LAPACKE_xerbla( "LAPACKE_sggsvd3_work", info );
176 }
177 return info;
178}
#define lapack_int
Definition: lapack.h:87
#define LAPACK_sggsvd3(...)
Definition: lapack.h:5444
#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_sggsvd3_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, float *a, lapack_int lda, float *b, lapack_int ldb, float *alpha, float *beta, float *u, lapack_int ldu, float *v, lapack_int ldv, float *q, lapack_int ldq, float *work, lapack_int lwork, lapack_int *iwork)
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:35
void LAPACKE_xerbla(const char *name, lapack_int info)
void LAPACKE_sge_trans(int matrix_layout, lapack_int m, lapack_int n, const float *in, lapack_int ldin, float *out, lapack_int ldout)
#define MAX(x, y)
Definition: lapacke_utils.h:46