LAPACK  3.8.0
LAPACK: Linear Algebra PACKage
lapacke_stgsja_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 stgsja
30 * Author: Intel Corporation
31 * Generated November 2015
32 *****************************************************************************/
33 
34 #include "lapacke_utils.h"
35 
36 lapack_int LAPACKE_stgsja_work( int matrix_layout, char jobu, char jobv,
37  char jobq, lapack_int m, lapack_int p,
39  float* a, lapack_int lda, float* b,
40  lapack_int ldb, float tola, float tolb,
41  float* alpha, float* beta, float* u,
42  lapack_int ldu, float* v, lapack_int ldv,
43  float* q, lapack_int ldq, float* work,
44  lapack_int* ncycle )
45 {
46  lapack_int info = 0;
47  if( matrix_layout == LAPACK_COL_MAJOR ) {
48  /* Call LAPACK function and adjust info */
49  LAPACK_stgsja( &jobu, &jobv, &jobq, &m, &p, &n, &k, &l, a, &lda, b,
50  &ldb, &tola, &tolb, alpha, beta, u, &ldu, v, &ldv, q,
51  &ldq, work, ncycle, &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 = -11;
69  LAPACKE_xerbla( "LAPACKE_stgsja_work", info );
70  return info;
71  }
72  if( ldb < n ) {
73  info = -13;
74  LAPACKE_xerbla( "LAPACKE_stgsja_work", info );
75  return info;
76  }
77  if( ldq < n ) {
78  info = -23;
79  LAPACKE_xerbla( "LAPACKE_stgsja_work", info );
80  return info;
81  }
82  if( ldu < m ) {
83  info = -19;
84  LAPACKE_xerbla( "LAPACKE_stgsja_work", info );
85  return info;
86  }
87  if( ldv < p ) {
88  info = -21;
89  LAPACKE_xerbla( "LAPACKE_stgsja_work", info );
90  return info;
91  }
92  /* Allocate memory for temporary array(s) */
93  a_t = (float*)LAPACKE_malloc( sizeof(float) * lda_t * MAX(1,n) );
94  if( a_t == NULL ) {
96  goto exit_level_0;
97  }
98  b_t = (float*)LAPACKE_malloc( sizeof(float) * ldb_t * MAX(1,n) );
99  if( b_t == NULL ) {
101  goto exit_level_1;
102  }
103  if( LAPACKE_lsame( jobu, 'i' ) || LAPACKE_lsame( jobu, 'u' ) ) {
104  u_t = (float*)LAPACKE_malloc( sizeof(float) * ldu_t * MAX(1,m) );
105  if( u_t == NULL ) {
107  goto exit_level_2;
108  }
109  }
110  if( LAPACKE_lsame( jobv, 'i' ) || LAPACKE_lsame( jobv, 'v' ) ) {
111  v_t = (float*)LAPACKE_malloc( sizeof(float) * ldv_t * MAX(1,p) );
112  if( v_t == NULL ) {
114  goto exit_level_3;
115  }
116  }
117  if( LAPACKE_lsame( jobq, 'i' ) || LAPACKE_lsame( jobq, 'q' ) ) {
118  q_t = (float*)LAPACKE_malloc( sizeof(float) * ldq_t * MAX(1,n) );
119  if( q_t == NULL ) {
121  goto exit_level_4;
122  }
123  }
124  /* Transpose input matrices */
125  LAPACKE_sge_trans( matrix_layout, m, n, a, lda, a_t, lda_t );
126  LAPACKE_sge_trans( matrix_layout, p, n, b, ldb, b_t, ldb_t );
127  if( LAPACKE_lsame( jobu, 'u' ) ) {
128  LAPACKE_sge_trans( matrix_layout, m, m, u, ldu, u_t, ldu_t );
129  }
130  if( LAPACKE_lsame( jobv, 'v' ) ) {
131  LAPACKE_sge_trans( matrix_layout, p, p, v, ldv, v_t, ldv_t );
132  }
133  if( LAPACKE_lsame( jobq, 'q' ) ) {
134  LAPACKE_sge_trans( matrix_layout, n, n, q, ldq, q_t, ldq_t );
135  }
136  /* Call LAPACK function and adjust info */
137  LAPACK_stgsja( &jobu, &jobv, &jobq, &m, &p, &n, &k, &l, a_t, &lda_t,
138  b_t, &ldb_t, &tola, &tolb, alpha, beta, u_t, &ldu_t, v_t,
139  &ldv_t, q_t, &ldq_t, work, ncycle, &info );
140  if( info < 0 ) {
141  info = info - 1;
142  }
143  /* Transpose output matrices */
144  LAPACKE_sge_trans( LAPACK_COL_MAJOR, m, n, a_t, lda_t, a, lda );
145  LAPACKE_sge_trans( LAPACK_COL_MAJOR, p, n, b_t, ldb_t, b, ldb );
146  if( LAPACKE_lsame( jobu, 'i' ) || LAPACKE_lsame( jobu, 'u' ) ) {
147  LAPACKE_sge_trans( LAPACK_COL_MAJOR, m, m, u_t, ldu_t, u, ldu );
148  }
149  if( LAPACKE_lsame( jobv, 'i' ) || LAPACKE_lsame( jobv, 'v' ) ) {
150  LAPACKE_sge_trans( LAPACK_COL_MAJOR, p, p, v_t, ldv_t, v, ldv );
151  }
152  if( LAPACKE_lsame( jobq, 'i' ) || LAPACKE_lsame( jobq, 'q' ) ) {
153  LAPACKE_sge_trans( LAPACK_COL_MAJOR, n, n, q_t, ldq_t, q, ldq );
154  }
155  /* Release memory and exit */
156  if( LAPACKE_lsame( jobq, 'i' ) || LAPACKE_lsame( jobq, 'q' ) ) {
157  LAPACKE_free( q_t );
158  }
159 exit_level_4:
160  if( LAPACKE_lsame( jobv, 'i' ) || LAPACKE_lsame( jobv, 'v' ) ) {
161  LAPACKE_free( v_t );
162  }
163 exit_level_3:
164  if( LAPACKE_lsame( jobu, 'i' ) || LAPACKE_lsame( jobu, 'u' ) ) {
165  LAPACKE_free( u_t );
166  }
167 exit_level_2:
168  LAPACKE_free( b_t );
169 exit_level_1:
170  LAPACKE_free( a_t );
171 exit_level_0:
172  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
173  LAPACKE_xerbla( "LAPACKE_stgsja_work", info );
174  }
175  } else {
176  info = -1;
177  LAPACKE_xerbla( "LAPACKE_stgsja_work", info );
178  }
179  return info;
180 }
#define MAX(x, y)
Definition: lapacke_utils.h:47
#define LAPACK_COL_MAJOR
Definition: lapacke.h:120
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:123
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 LAPACK_ROW_MAJOR
Definition: lapacke.h:119
#define lapack_int
Definition: lapacke.h:47
void LAPACK_stgsja(char *jobu, char *jobv, char *jobq, lapack_int *m, lapack_int *p, lapack_int *n, lapack_int *k, lapack_int *l, float *a, lapack_int *lda, float *b, lapack_int *ldb, float *tola, float *tolb, float *alpha, float *beta, float *u, lapack_int *ldu, float *v, lapack_int *ldv, float *q, lapack_int *ldq, float *work, lapack_int *ncycle, lapack_int *info)
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:36
#define LAPACKE_malloc(size)
Definition: lapacke.h:110
#define LAPACKE_free(p)
Definition: lapacke.h:113
void LAPACKE_xerbla(const char *name, lapack_int info)
lapack_int LAPACKE_stgsja_work(int matrix_layout, char jobu, char jobv, char jobq, lapack_int m, lapack_int p, lapack_int n, lapack_int k, lapack_int l, float *a, lapack_int lda, float *b, lapack_int ldb, float tola, float tolb, float *alpha, float *beta, float *u, lapack_int ldu, float *v, lapack_int ldv, float *q, lapack_int ldq, float *work, lapack_int *ncycle)