LAPACK
3.9.0
LAPACK: Linear Algebra PACKage
lapacke_ctgexc_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 ctgexc
30
* Author: Intel Corporation
31
* Generated November 2015
32
*****************************************************************************/
33
34
#include "
lapacke_utils.h
"
35
36
lapack_int
LAPACKE_ctgexc_work
(
int
matrix_layout,
lapack_logical
wantq,
37
lapack_logical
wantz,
lapack_int
n,
38
lapack_complex_float
* a,
lapack_int
lda,
39
lapack_complex_float
* b,
lapack_int
ldb,
40
lapack_complex_float
* q,
lapack_int
ldq,
41
lapack_complex_float
* z,
lapack_int
ldz,
42
lapack_int
ifst,
lapack_int
ilst )
43
{
44
lapack_int
info = 0;
45
if
( matrix_layout ==
LAPACK_COL_MAJOR
) {
46
/* Call LAPACK function and adjust info */
47
LAPACK_ctgexc
( &wantq, &wantz, &n, a, &lda, b, &ldb, q, &ldq, z, &ldz,
48
&ifst, &ilst, &info );
49
if
( info < 0 ) {
50
info = info - 1;
51
}
52
}
else
if
( matrix_layout ==
LAPACK_ROW_MAJOR
) {
53
lapack_int
lda_t =
MAX
(1,n);
54
lapack_int
ldb_t =
MAX
(1,n);
55
lapack_int
ldq_t =
MAX
(1,n);
56
lapack_int
ldz_t =
MAX
(1,n);
57
lapack_complex_float
* a_t = NULL;
58
lapack_complex_float
* b_t = NULL;
59
lapack_complex_float
* q_t = NULL;
60
lapack_complex_float
* z_t = NULL;
61
/* Check leading dimension(s) */
62
if
( lda < n ) {
63
info = -6;
64
LAPACKE_xerbla
(
"LAPACKE_ctgexc_work"
, info );
65
return
info;
66
}
67
if
( ldb < n ) {
68
info = -8;
69
LAPACKE_xerbla
(
"LAPACKE_ctgexc_work"
, info );
70
return
info;
71
}
72
if
( ldq < n ) {
73
info = -10;
74
LAPACKE_xerbla
(
"LAPACKE_ctgexc_work"
, info );
75
return
info;
76
}
77
if
( ldz < n ) {
78
info = -12;
79
LAPACKE_xerbla
(
"LAPACKE_ctgexc_work"
, info );
80
return
info;
81
}
82
/* Allocate memory for temporary array(s) */
83
a_t = (
lapack_complex_float
*)
84
LAPACKE_malloc
(
sizeof
(
lapack_complex_float
) * lda_t *
MAX
(1,n) );
85
if
( a_t == NULL ) {
86
info =
LAPACK_TRANSPOSE_MEMORY_ERROR
;
87
goto
exit_level_0;
88
}
89
b_t = (
lapack_complex_float
*)
90
LAPACKE_malloc
(
sizeof
(
lapack_complex_float
) * ldb_t *
MAX
(1,n) );
91
if
( b_t == NULL ) {
92
info =
LAPACK_TRANSPOSE_MEMORY_ERROR
;
93
goto
exit_level_1;
94
}
95
if
( wantq ) {
96
q_t = (
lapack_complex_float
*)
97
LAPACKE_malloc
(
sizeof
(
lapack_complex_float
) *
98
ldq_t *
MAX
(1,n) );
99
if
( q_t == NULL ) {
100
info =
LAPACK_TRANSPOSE_MEMORY_ERROR
;
101
goto
exit_level_2;
102
}
103
}
104
if
( wantz ) {
105
z_t = (
lapack_complex_float
*)
106
LAPACKE_malloc
(
sizeof
(
lapack_complex_float
) *
107
ldz_t *
MAX
(1,n) );
108
if
( z_t == NULL ) {
109
info =
LAPACK_TRANSPOSE_MEMORY_ERROR
;
110
goto
exit_level_3;
111
}
112
}
113
/* Transpose input matrices */
114
LAPACKE_cge_trans
( matrix_layout, n, n, a, lda, a_t, lda_t );
115
LAPACKE_cge_trans
( matrix_layout, n, n, b, ldb, b_t, ldb_t );
116
if
( wantq ) {
117
LAPACKE_cge_trans
( matrix_layout, n, n, q, ldq, q_t, ldq_t );
118
}
119
if
( wantz ) {
120
LAPACKE_cge_trans
( matrix_layout, n, n, z, ldz, z_t, ldz_t );
121
}
122
/* Call LAPACK function and adjust info */
123
LAPACK_ctgexc
( &wantq, &wantz, &n, a_t, &lda_t, b_t, &ldb_t, q_t,
124
&ldq_t, z_t, &ldz_t, &ifst, &ilst, &info );
125
if
( info < 0 ) {
126
info = info - 1;
127
}
128
/* Transpose output matrices */
129
LAPACKE_cge_trans
(
LAPACK_COL_MAJOR
, n, n, a_t, lda_t, a, lda );
130
LAPACKE_cge_trans
(
LAPACK_COL_MAJOR
, n, n, b_t, ldb_t, b, ldb );
131
if
( wantq ) {
132
LAPACKE_cge_trans
(
LAPACK_COL_MAJOR
, n, n, q_t, ldq_t, q, ldq );
133
}
134
if
( wantz ) {
135
LAPACKE_cge_trans
(
LAPACK_COL_MAJOR
, n, n, z_t, ldz_t, z, ldz );
136
}
137
/* Release memory and exit */
138
if
( wantz ) {
139
LAPACKE_free
( z_t );
140
}
141
exit_level_3:
142
if
( wantq ) {
143
LAPACKE_free
( q_t );
144
}
145
exit_level_2:
146
LAPACKE_free
( b_t );
147
exit_level_1:
148
LAPACKE_free
( a_t );
149
exit_level_0:
150
if
( info ==
LAPACK_TRANSPOSE_MEMORY_ERROR
) {
151
LAPACKE_xerbla
(
"LAPACKE_ctgexc_work"
, info );
152
}
153
}
else
{
154
info = -1;
155
LAPACKE_xerbla
(
"LAPACKE_ctgexc_work"
, info );
156
}
157
return
info;
158
}
LAPACKE_free
#define LAPACKE_free(p)
Definition:
lapacke.h:47
lapack_int
#define lapack_int
Definition:
lapack.h:21
LAPACKE_cge_trans
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)
Definition:
lapacke_cge_trans.c:39
lapacke_utils.h
LAPACKE_xerbla
void LAPACKE_xerbla(const char *name, lapack_int info)
Definition:
lapacke_xerbla.c:36
MAX
#define MAX(x, y)
Definition:
lapacke_utils.h:47
lapack_complex_float
#define lapack_complex_float
Definition:
lapack.h:56
LAPACK_TRANSPOSE_MEMORY_ERROR
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition:
lapacke.h:57
lapack_logical
#define lapack_logical
Definition:
lapack.h:25
LAPACK_ctgexc
void LAPACK_ctgexc(lapack_logical const *wantq, lapack_logical const *wantz, lapack_int const *n, lapack_complex_float *A, lapack_int const *lda, lapack_complex_float *B, lapack_int const *ldb, lapack_complex_float *Q, lapack_int const *ldq, lapack_complex_float *Z, lapack_int const *ldz, lapack_int const *ifst, lapack_int *ilst, lapack_int *info)
LAPACKE_malloc
#define LAPACKE_malloc(size)
Definition:
lapacke.h:44
LAPACKE_ctgexc_work
lapack_int LAPACKE_ctgexc_work(int matrix_layout, lapack_logical wantq, lapack_logical wantz, lapack_int n, lapack_complex_float *a, lapack_int lda, lapack_complex_float *b, lapack_int ldb, lapack_complex_float *q, lapack_int ldq, lapack_complex_float *z, lapack_int ldz, lapack_int ifst, lapack_int ilst)
Definition:
lapacke_ctgexc_work.c:35
LAPACK_ROW_MAJOR
#define LAPACK_ROW_MAJOR
Definition:
lapacke.h:53
LAPACK_COL_MAJOR
#define LAPACK_COL_MAJOR
Definition:
lapacke.h:54
LAPACKE
src
lapacke_ctgexc_work.c
Generated on Wed May 5 2021 15:10:33 for LAPACK by
1.8.16