LAPACK  3.6.1
LAPACK: Linear Algebra PACKage
lapacke_ztgsen_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 ztgsen
30 * Author: Intel Corporation
31 * Generated November 2015
32 *****************************************************************************/
33 
34 #include "lapacke_utils.h"
35 
36 lapack_int LAPACKE_ztgsen_work( int matrix_layout, lapack_int ijob,
37  lapack_logical wantq, lapack_logical wantz,
38  const lapack_logical* select, lapack_int n,
41  lapack_complex_double* alpha,
45  lapack_int* m, double* pl, double* pr,
46  double* dif, lapack_complex_double* work,
47  lapack_int lwork, lapack_int* iwork,
48  lapack_int liwork )
49 {
50  lapack_int info = 0;
51  if( matrix_layout == LAPACK_COL_MAJOR ) {
52  /* Call LAPACK function and adjust info */
53  LAPACK_ztgsen( &ijob, &wantq, &wantz, select, &n, a, &lda, b, &ldb,
54  alpha, beta, q, &ldq, z, &ldz, m, pl, pr, dif, work,
55  &lwork, iwork, &liwork, &info );
56  if( info < 0 ) {
57  info = info - 1;
58  }
59  } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
60  lapack_int lda_t = MAX(1,n);
61  lapack_int ldb_t = MAX(1,n);
62  lapack_int ldq_t = MAX(1,n);
63  lapack_int ldz_t = MAX(1,n);
64  lapack_complex_double* a_t = NULL;
65  lapack_complex_double* b_t = NULL;
66  lapack_complex_double* q_t = NULL;
67  lapack_complex_double* z_t = NULL;
68  /* Check leading dimension(s) */
69  if( lda < n ) {
70  info = -8;
71  LAPACKE_xerbla( "LAPACKE_ztgsen_work", info );
72  return info;
73  }
74  if( ldb < n ) {
75  info = -10;
76  LAPACKE_xerbla( "LAPACKE_ztgsen_work", info );
77  return info;
78  }
79  if( ldq < n ) {
80  info = -14;
81  LAPACKE_xerbla( "LAPACKE_ztgsen_work", info );
82  return info;
83  }
84  if( ldz < n ) {
85  info = -16;
86  LAPACKE_xerbla( "LAPACKE_ztgsen_work", info );
87  return info;
88  }
89  /* Query optimal working array(s) size if requested */
90  if( liwork == -1 || lwork == -1 ) {
91  LAPACK_ztgsen( &ijob, &wantq, &wantz, select, &n, a, &lda_t, b,
92  &ldb_t, alpha, beta, q, &ldq_t, z, &ldz_t, m, pl, pr,
93  dif, work, &lwork, iwork, &liwork, &info );
94  return (info < 0) ? (info - 1) : info;
95  }
96  /* Allocate memory for temporary array(s) */
97  a_t = (lapack_complex_double*)
98  LAPACKE_malloc( sizeof(lapack_complex_double) * lda_t * MAX(1,n) );
99  if( a_t == NULL ) {
101  goto exit_level_0;
102  }
103  b_t = (lapack_complex_double*)
104  LAPACKE_malloc( sizeof(lapack_complex_double) * ldb_t * MAX(1,n) );
105  if( b_t == NULL ) {
107  goto exit_level_1;
108  }
109  if( wantq ) {
110  q_t = (lapack_complex_double*)
112  ldq_t * MAX(1,n) );
113  if( q_t == NULL ) {
115  goto exit_level_2;
116  }
117  }
118  if( wantz ) {
119  z_t = (lapack_complex_double*)
121  ldz_t * MAX(1,n) );
122  if( z_t == NULL ) {
124  goto exit_level_3;
125  }
126  }
127  /* Transpose input matrices */
128  LAPACKE_zge_trans( matrix_layout, n, n, a, lda, a_t, lda_t );
129  LAPACKE_zge_trans( matrix_layout, n, n, b, ldb, b_t, ldb_t );
130  if( wantq ) {
131  LAPACKE_zge_trans( matrix_layout, n, n, q, ldq, q_t, ldq_t );
132  }
133  if( wantz ) {
134  LAPACKE_zge_trans( matrix_layout, n, n, z, ldz, z_t, ldz_t );
135  }
136  /* Call LAPACK function and adjust info */
137  LAPACK_ztgsen( &ijob, &wantq, &wantz, select, &n, a_t, &lda_t, b_t,
138  &ldb_t, alpha, beta, q_t, &ldq_t, z_t, &ldz_t, m, pl, pr,
139  dif, work, &lwork, iwork, &liwork, &info );
140  if( info < 0 ) {
141  info = info - 1;
142  }
143  /* Transpose output matrices */
144  LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, n, a_t, lda_t, a, lda );
145  LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, n, b_t, ldb_t, b, ldb );
146  if( wantq ) {
147  LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, n, q_t, ldq_t, q, ldq );
148  }
149  if( wantz ) {
150  LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, n, z_t, ldz_t, z, ldz );
151  }
152  /* Release memory and exit */
153  if( wantz ) {
154  LAPACKE_free( z_t );
155  }
156 exit_level_3:
157  if( wantq ) {
158  LAPACKE_free( q_t );
159  }
160 exit_level_2:
161  LAPACKE_free( b_t );
162 exit_level_1:
163  LAPACKE_free( a_t );
164 exit_level_0:
165  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
166  LAPACKE_xerbla( "LAPACKE_ztgsen_work", info );
167  }
168  } else {
169  info = -1;
170  LAPACKE_xerbla( "LAPACKE_ztgsen_work", info );
171  }
172  return info;
173 }
#define lapack_logical
Definition: lapacke.h:51
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
#define lapack_complex_double
Definition: lapacke.h:90
lapack_int LAPACKE_ztgsen_work(int matrix_layout, lapack_int ijob, lapack_logical wantq, lapack_logical wantz, const lapack_logical *select, lapack_int n, lapack_complex_double *a, lapack_int lda, lapack_complex_double *b, lapack_int ldb, lapack_complex_double *alpha, lapack_complex_double *beta, lapack_complex_double *q, lapack_int ldq, lapack_complex_double *z, lapack_int ldz, lapack_int *m, double *pl, double *pr, double *dif, lapack_complex_double *work, lapack_int lwork, lapack_int *iwork, lapack_int liwork)
#define MAX(x, y)
Definition: lapacke_utils.h:47
#define LAPACKE_free(p)
Definition: lapacke.h:113
#define LAPACKE_malloc(size)
Definition: lapacke.h:110
#define LAPACK_COL_MAJOR
Definition: lapacke.h:120
void LAPACKE_xerbla(const char *name, lapack_int info)
#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)
void LAPACK_ztgsen(lapack_int *ijob, lapack_logical *wantq, lapack_logical *wantz, const lapack_logical *select, lapack_int *n, lapack_complex_double *a, lapack_int *lda, lapack_complex_double *b, lapack_int *ldb, lapack_complex_double *alpha, lapack_complex_double *beta, lapack_complex_double *q, lapack_int *ldq, lapack_complex_double *z, lapack_int *ldz, lapack_int *m, double *pl, double *pr, double *dif, lapack_complex_double *work, lapack_int *lwork, lapack_int *iwork, lapack_int *liwork, lapack_int *info)