LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches
lapacke_chgeqz_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 chgeqz
30* Author: Intel Corporation
31*****************************************************************************/
32
33#include "lapacke_utils.h"
34
35lapack_int LAPACKE_chgeqz_work( int matrix_layout, char job, char compq,
36 char compz, lapack_int n, lapack_int ilo,
37 lapack_int ihi, lapack_complex_float* h,
38 lapack_int ldh, lapack_complex_float* t,
39 lapack_int ldt, lapack_complex_float* alpha,
40 lapack_complex_float* beta,
41 lapack_complex_float* q, lapack_int ldq,
42 lapack_complex_float* z, lapack_int ldz,
43 lapack_complex_float* work, lapack_int lwork,
44 float* rwork )
45{
46 lapack_int info = 0;
47 if( matrix_layout == LAPACK_COL_MAJOR ) {
48 /* Call LAPACK function and adjust info */
49 LAPACK_chgeqz( &job, &compq, &compz, &n, &ilo, &ihi, h, &ldh, t, &ldt,
50 alpha, beta, q, &ldq, z, &ldz, work, &lwork, rwork,
51 &info );
52 if( info < 0 ) {
53 info = info - 1;
54 }
55 } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
56 lapack_int ldh_t = MAX(1,n);
57 lapack_int ldq_t = MAX(1,n);
58 lapack_int ldt_t = MAX(1,n);
59 lapack_int ldz_t = MAX(1,n);
60 lapack_complex_float* h_t = NULL;
61 lapack_complex_float* t_t = NULL;
62 lapack_complex_float* q_t = NULL;
63 lapack_complex_float* z_t = NULL;
64 /* Check leading dimension(s) */
65 if( ldh < n ) {
66 info = -9;
67 LAPACKE_xerbla( "LAPACKE_chgeqz_work", info );
68 return info;
69 }
70 if( ldq < n ) {
71 info = -15;
72 LAPACKE_xerbla( "LAPACKE_chgeqz_work", info );
73 return info;
74 }
75 if( ldt < n ) {
76 info = -11;
77 LAPACKE_xerbla( "LAPACKE_chgeqz_work", info );
78 return info;
79 }
80 if( ldz < n ) {
81 info = -17;
82 LAPACKE_xerbla( "LAPACKE_chgeqz_work", info );
83 return info;
84 }
85 /* Query optimal working array(s) size if requested */
86 if( lwork == -1 ) {
87 LAPACK_chgeqz( &job, &compq, &compz, &n, &ilo, &ihi, h, &ldh_t, t,
88 &ldt_t, alpha, beta, q, &ldq_t, z, &ldz_t, work,
89 &lwork, rwork, &info );
90 return (info < 0) ? (info - 1) : info;
91 }
92 /* Allocate memory for temporary array(s) */
93 h_t = (lapack_complex_float*)
94 LAPACKE_malloc( sizeof(lapack_complex_float) * ldh_t * MAX(1,n) );
95 if( h_t == NULL ) {
96 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
97 goto exit_level_0;
98 }
99 t_t = (lapack_complex_float*)
100 LAPACKE_malloc( sizeof(lapack_complex_float) * ldt_t * MAX(1,n) );
101 if( t_t == NULL ) {
102 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
103 goto exit_level_1;
104 }
105 if( LAPACKE_lsame( compq, 'i' ) || LAPACKE_lsame( compq, 'v' ) ) {
106 q_t = (lapack_complex_float*)
107 LAPACKE_malloc( sizeof(lapack_complex_float) *
108 ldq_t * MAX(1,n) );
109 if( q_t == NULL ) {
110 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
111 goto exit_level_2;
112 }
113 }
114 if( LAPACKE_lsame( compz, 'i' ) || LAPACKE_lsame( compz, 'v' ) ) {
115 z_t = (lapack_complex_float*)
116 LAPACKE_malloc( sizeof(lapack_complex_float) *
117 ldz_t * MAX(1,n) );
118 if( z_t == NULL ) {
119 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
120 goto exit_level_3;
121 }
122 }
123 /* Transpose input matrices */
124 LAPACKE_cge_trans( matrix_layout, n, n, h, ldh, h_t, ldh_t );
125 LAPACKE_cge_trans( matrix_layout, n, n, t, ldt, t_t, ldt_t );
126 if( LAPACKE_lsame( compq, 'v' ) ) {
127 LAPACKE_cge_trans( matrix_layout, n, n, q, ldq, q_t, ldq_t );
128 }
129 if( LAPACKE_lsame( compz, 'v' ) ) {
130 LAPACKE_cge_trans( matrix_layout, n, n, z, ldz, z_t, ldz_t );
131 }
132 /* Call LAPACK function and adjust info */
133 LAPACK_chgeqz( &job, &compq, &compz, &n, &ilo, &ihi, h_t, &ldh_t, t_t,
134 &ldt_t, alpha, beta, q_t, &ldq_t, z_t, &ldz_t, work,
135 &lwork, rwork, &info );
136 if( info < 0 ) {
137 info = info - 1;
138 }
139 /* Transpose output matrices */
140 LAPACKE_cge_trans( LAPACK_COL_MAJOR, n, n, h_t, ldh_t, h, ldh );
141 LAPACKE_cge_trans( LAPACK_COL_MAJOR, n, n, t_t, ldt_t, t, ldt );
142 if( LAPACKE_lsame( compq, 'i' ) || LAPACKE_lsame( compq, 'v' ) ) {
143 LAPACKE_cge_trans( LAPACK_COL_MAJOR, n, n, q_t, ldq_t, q, ldq );
144 }
145 if( LAPACKE_lsame( compz, 'i' ) || LAPACKE_lsame( compz, 'v' ) ) {
146 LAPACKE_cge_trans( LAPACK_COL_MAJOR, n, n, z_t, ldz_t, z, ldz );
147 }
148 /* Release memory and exit */
149 if( LAPACKE_lsame( compz, 'i' ) || LAPACKE_lsame( compz, 'v' ) ) {
150 LAPACKE_free( z_t );
151 }
152exit_level_3:
153 if( LAPACKE_lsame( compq, 'i' ) || LAPACKE_lsame( compq, 'v' ) ) {
154 LAPACKE_free( q_t );
155 }
156exit_level_2:
157 LAPACKE_free( t_t );
158exit_level_1:
159 LAPACKE_free( h_t );
160exit_level_0:
161 if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
162 LAPACKE_xerbla( "LAPACKE_chgeqz_work", info );
163 }
164 } else {
165 info = -1;
166 LAPACKE_xerbla( "LAPACKE_chgeqz_work", info );
167 }
168 return info;
169}
LAPACK_chgeqz
#define LAPACK_chgeqz(...)
Definition: lapack.h:8370
lapack_int
#define lapack_int
Definition: lapack.h:87
lapack_complex_float
#define lapack_complex_float
Definition: lapack.h:46
LAPACK_COL_MAJOR
#define LAPACK_COL_MAJOR
Definition: lapacke.h:53
LAPACKE_free
#define LAPACKE_free(p)
Definition: lapacke.h:46
LAPACK_ROW_MAJOR
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:52
LAPACKE_malloc
#define LAPACKE_malloc(size)
Definition: lapacke.h:43
LAPACK_TRANSPOSE_MEMORY_ERROR
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:56
LAPACKE_chgeqz_work
lapack_int LAPACKE_chgeqz_work(int matrix_layout, char job, char compq, char compz, lapack_int n, lapack_int ilo, lapack_int ihi, lapack_complex_float *h, lapack_int ldh, lapack_complex_float *t, lapack_int ldt, lapack_complex_float *alpha, lapack_complex_float *beta, lapack_complex_float *q, lapack_int ldq, lapack_complex_float *z, lapack_int ldz, lapack_complex_float *work, lapack_int lwork, float *rwork)
Definition: lapacke_chgeqz_work.c:35
LAPACKE_lsame
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:35
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:46
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