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