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