LAPACK  3.9.0
LAPACK: Linear Algebra PACKage
lapacke_dgges_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 dgges
30 * Author: Intel Corporation
31 * Generated November 2015
32 *****************************************************************************/
33 
34 #include "lapacke_utils.h"
35 
36 lapack_int LAPACKE_dgges_work( int matrix_layout, char jobvsl, char jobvsr,
37  char sort, LAPACK_D_SELECT3 selctg, lapack_int n,
38  double* a, lapack_int lda, double* b,
39  lapack_int ldb, lapack_int* sdim, double* alphar,
40  double* alphai, double* beta, double* vsl,
41  lapack_int ldvsl, double* vsr, lapack_int ldvsr,
42  double* work, lapack_int lwork,
43  lapack_logical* bwork )
44 {
45  lapack_int info = 0;
46  if( matrix_layout == LAPACK_COL_MAJOR ) {
47  /* Call LAPACK function and adjust info */
48  LAPACK_dgges( &jobvsl, &jobvsr, &sort, selctg, &n, a, &lda, b, &ldb,
49  sdim, alphar, alphai, beta, vsl, &ldvsl, vsr, &ldvsr,
50  work, &lwork, bwork, &info );
51  if( info < 0 ) {
52  info = info - 1;
53  }
54  } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
55  lapack_int lda_t = MAX(1,n);
56  lapack_int ldb_t = MAX(1,n);
57  lapack_int ldvsl_t = MAX(1,n);
58  lapack_int ldvsr_t = MAX(1,n);
59  double* a_t = NULL;
60  double* b_t = NULL;
61  double* vsl_t = NULL;
62  double* vsr_t = NULL;
63  /* Check leading dimension(s) */
64  if( lda < n ) {
65  info = -8;
66  LAPACKE_xerbla( "LAPACKE_dgges_work", info );
67  return info;
68  }
69  if( ldb < n ) {
70  info = -10;
71  LAPACKE_xerbla( "LAPACKE_dgges_work", info );
72  return info;
73  }
74  if( ldvsl < n ) {
75  info = -16;
76  LAPACKE_xerbla( "LAPACKE_dgges_work", info );
77  return info;
78  }
79  if( ldvsr < n ) {
80  info = -18;
81  LAPACKE_xerbla( "LAPACKE_dgges_work", info );
82  return info;
83  }
84  /* Query optimal working array(s) size if requested */
85  if( lwork == -1 ) {
86  LAPACK_dgges( &jobvsl, &jobvsr, &sort, selctg, &n, a, &lda_t, b,
87  &ldb_t, sdim, alphar, alphai, beta, vsl, &ldvsl_t,
88  vsr, &ldvsr_t, work, &lwork, bwork, &info );
89  return (info < 0) ? (info - 1) : info;
90  }
91  /* Allocate memory for temporary array(s) */
92  a_t = (double*)LAPACKE_malloc( sizeof(double) * lda_t * MAX(1,n) );
93  if( a_t == NULL ) {
94  info = LAPACK_TRANSPOSE_MEMORY_ERROR;
95  goto exit_level_0;
96  }
97  b_t = (double*)LAPACKE_malloc( sizeof(double) * ldb_t * MAX(1,n) );
98  if( b_t == NULL ) {
99  info = LAPACK_TRANSPOSE_MEMORY_ERROR;
100  goto exit_level_1;
101  }
102  if( LAPACKE_lsame( jobvsl, 'v' ) ) {
103  vsl_t = (double*)
104  LAPACKE_malloc( sizeof(double) * ldvsl_t * MAX(1,n) );
105  if( vsl_t == NULL ) {
106  info = LAPACK_TRANSPOSE_MEMORY_ERROR;
107  goto exit_level_2;
108  }
109  }
110  if( LAPACKE_lsame( jobvsr, 'v' ) ) {
111  vsr_t = (double*)
112  LAPACKE_malloc( sizeof(double) * ldvsr_t * MAX(1,n) );
113  if( vsr_t == NULL ) {
114  info = LAPACK_TRANSPOSE_MEMORY_ERROR;
115  goto exit_level_3;
116  }
117  }
118  /* Transpose input matrices */
119  LAPACKE_dge_trans( matrix_layout, n, n, a, lda, a_t, lda_t );
120  LAPACKE_dge_trans( matrix_layout, n, n, b, ldb, b_t, ldb_t );
121  /* Call LAPACK function and adjust info */
122  LAPACK_dgges( &jobvsl, &jobvsr, &sort, selctg, &n, a_t, &lda_t, b_t,
123  &ldb_t, sdim, alphar, alphai, beta, vsl_t, &ldvsl_t,
124  vsr_t, &ldvsr_t, work, &lwork, bwork, &info );
125  if( info < 0 ) {
126  info = info - 1;
127  }
128  /* Transpose output matrices */
129  LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, n, a_t, lda_t, a, lda );
130  LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, n, b_t, ldb_t, b, ldb );
131  if( LAPACKE_lsame( jobvsl, 'v' ) ) {
132  LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, n, vsl_t, ldvsl_t, vsl,
133  ldvsl );
134  }
135  if( LAPACKE_lsame( jobvsr, 'v' ) ) {
136  LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, n, vsr_t, ldvsr_t, vsr,
137  ldvsr );
138  }
139  /* Release memory and exit */
140  if( LAPACKE_lsame( jobvsr, 'v' ) ) {
141  LAPACKE_free( vsr_t );
142  }
143 exit_level_3:
144  if( LAPACKE_lsame( jobvsl, 'v' ) ) {
145  LAPACKE_free( vsl_t );
146  }
147 exit_level_2:
148  LAPACKE_free( b_t );
149 exit_level_1:
150  LAPACKE_free( a_t );
151 exit_level_0:
152  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
153  LAPACKE_xerbla( "LAPACKE_dgges_work", info );
154  }
155  } else {
156  info = -1;
157  LAPACKE_xerbla( "LAPACKE_dgges_work", info );
158  }
159  return info;
160 }
LAPACKE_free
#define LAPACKE_free(p)
Definition: lapacke.h:47
lapack_int
#define lapack_int
Definition: lapack.h:21
lapacke_utils.h
LAPACK_D_SELECT3
lapack_logical(* LAPACK_D_SELECT3)(const double *, const double *, const double *)
Definition: lapack.h:92
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_TRANSPOSE_MEMORY_ERROR
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:57
LAPACK_dgges
void LAPACK_dgges(char const *jobvsl, char const *jobvsr, char const *sort, LAPACK_D_SELECT3 selctg, lapack_int const *n, double *A, lapack_int const *lda, double *B, lapack_int const *ldb, lapack_int *sdim, double *alphar, double *alphai, double *beta, double *VSL, lapack_int const *ldvsl, double *VSR, lapack_int const *ldvsr, double *work, lapack_int const *lwork, lapack_logical *BWORK, lapack_int *info)
lapack_logical
#define lapack_logical
Definition: lapack.h:25
LAPACKE_malloc
#define LAPACKE_malloc(size)
Definition: lapacke.h:44
LAPACKE_dgges_work
lapack_int LAPACKE_dgges_work(int matrix_layout, char jobvsl, char jobvsr, char sort, LAPACK_D_SELECT3 selctg, lapack_int n, double *a, lapack_int lda, double *b, lapack_int ldb, lapack_int *sdim, double *alphar, double *alphai, double *beta, double *vsl, lapack_int ldvsl, double *vsr, lapack_int ldvsr, double *work, lapack_int lwork, lapack_logical *bwork)
Definition: lapacke_dgges_work.c:35
LAPACKE_lsame
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:35
LAPACK_ROW_MAJOR
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:53
LAPACKE_dge_trans
void LAPACKE_dge_trans(int matrix_layout, lapack_int m, lapack_int n, const double *in, lapack_int ldin, double *out, lapack_int ldout)
Definition: lapacke_dge_trans.c:39
LAPACK_COL_MAJOR
#define LAPACK_COL_MAJOR
Definition: lapacke.h:54