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