LAPACK  3.8.0
LAPACK: Linear Algebra PACKage
lapacke_zhegvx_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 zhegvx
30 * Author: Intel Corporation
31 * Generated June 2017
32 *****************************************************************************/
33 
34 #include "lapacke_utils.h"
35 
36 lapack_int LAPACKE_zhegvx_work( int matrix_layout, lapack_int itype, char jobz,
37  char range, char uplo, lapack_int n,
40  double vl, double vu, lapack_int il,
41  lapack_int iu, double abstol, lapack_int* m,
42  double* w, lapack_complex_double* z,
44  lapack_int lwork, double* rwork,
45  lapack_int* iwork, lapack_int* ifail )
46 {
47  lapack_int info = 0;
48  if( matrix_layout == LAPACK_COL_MAJOR ) {
49  /* Call LAPACK function and adjust info */
50  LAPACK_zhegvx( &itype, &jobz, &range, &uplo, &n, a, &lda, b, &ldb, &vl,
51  &vu, &il, &iu, &abstol, m, w, z, &ldz, work, &lwork,
52  rwork, iwork, ifail, &info );
53  if( info < 0 ) {
54  info = info - 1;
55  }
56  } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
57  lapack_int ncols_z = ( LAPACKE_lsame( range, 'a' ) ||
58  LAPACKE_lsame( range, 'v' ) ) ? n :
59  ( LAPACKE_lsame( range, 'i' ) ? (iu-il+1) : 1);
60  lapack_int lda_t = MAX(1,n);
61  lapack_int ldb_t = MAX(1,n);
62  lapack_int ldz_t = MAX(1,n);
63  lapack_complex_double* a_t = NULL;
64  lapack_complex_double* b_t = NULL;
65  lapack_complex_double* z_t = NULL;
66  /* Check leading dimension(s) */
67  if( lda < n ) {
68  info = -8;
69  LAPACKE_xerbla( "LAPACKE_zhegvx_work", info );
70  return info;
71  }
72  if( ldb < n ) {
73  info = -10;
74  LAPACKE_xerbla( "LAPACKE_zhegvx_work", info );
75  return info;
76  }
77  if( ldz < ncols_z ) {
78  info = -19;
79  LAPACKE_xerbla( "LAPACKE_zhegvx_work", info );
80  return info;
81  }
82  /* Query optimal working array(s) size if requested */
83  if( lwork == -1 ) {
84  LAPACK_zhegvx( &itype, &jobz, &range, &uplo, &n, a, &lda_t, b,
85  &ldb_t, &vl, &vu, &il, &iu, &abstol, m, w, z, &ldz_t,
86  work, &lwork, rwork, iwork, ifail, &info );
87  return (info < 0) ? (info - 1) : info;
88  }
89  /* Allocate memory for temporary array(s) */
90  a_t = (lapack_complex_double*)
91  LAPACKE_malloc( sizeof(lapack_complex_double) * lda_t * MAX(1,n) );
92  if( a_t == NULL ) {
94  goto exit_level_0;
95  }
96  b_t = (lapack_complex_double*)
97  LAPACKE_malloc( sizeof(lapack_complex_double) * ldb_t * MAX(1,n) );
98  if( b_t == NULL ) {
100  goto exit_level_1;
101  }
102  if( LAPACKE_lsame( jobz, 'v' ) ) {
103  z_t = (lapack_complex_double*)
105  ldz_t * MAX(1,ncols_z) );
106  if( z_t == NULL ) {
108  goto exit_level_2;
109  }
110  }
111  /* Transpose input matrices */
112  LAPACKE_zhe_trans( matrix_layout, uplo, n, a, lda, a_t, lda_t );
113  LAPACKE_zhe_trans( matrix_layout, uplo, n, b, ldb, b_t, ldb_t );
114  /* Call LAPACK function and adjust info */
115  LAPACK_zhegvx( &itype, &jobz, &range, &uplo, &n, a_t, &lda_t, b_t,
116  &ldb_t, &vl, &vu, &il, &iu, &abstol, m, w, z_t, &ldz_t,
117  work, &lwork, rwork, iwork, ifail, &info );
118  if( info < 0 ) {
119  info = info - 1;
120  }
121  /* Transpose output matrices */
122  LAPACKE_zhe_trans( LAPACK_COL_MAJOR, uplo, n, a_t, lda_t, a, lda );
123  LAPACKE_zhe_trans( LAPACK_COL_MAJOR, uplo, n, b_t, ldb_t, b, ldb );
124  if( LAPACKE_lsame( jobz, 'v' ) ) {
125  LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, ncols_z, z_t, ldz_t, z,
126  ldz );
127  }
128  /* Release memory and exit */
129  if( LAPACKE_lsame( jobz, 'v' ) ) {
130  LAPACKE_free( z_t );
131  }
132 exit_level_2:
133  LAPACKE_free( b_t );
134 exit_level_1:
135  LAPACKE_free( a_t );
136 exit_level_0:
137  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
138  LAPACKE_xerbla( "LAPACKE_zhegvx_work", info );
139  }
140  } else {
141  info = -1;
142  LAPACKE_xerbla( "LAPACKE_zhegvx_work", info );
143  }
144  return info;
145 }
#define MAX(x, y)
Definition: lapacke_utils.h:47
#define LAPACK_COL_MAJOR
Definition: lapacke.h:120
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:123
lapack_int LAPACKE_zhegvx_work(int matrix_layout, lapack_int itype, char jobz, char range, char uplo, lapack_int n, lapack_complex_double *a, lapack_int lda, lapack_complex_double *b, lapack_int ldb, double vl, double vu, lapack_int il, lapack_int iu, double abstol, lapack_int *m, double *w, lapack_complex_double *z, lapack_int ldz, lapack_complex_double *work, lapack_int lwork, double *rwork, lapack_int *iwork, lapack_int *ifail)
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
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)
#define lapack_int
Definition: lapacke.h:47
void LAPACKE_zhe_trans(int matrix_layout, char uplo, lapack_int n, const lapack_complex_double *in, lapack_int ldin, lapack_complex_double *out, lapack_int ldout)
void LAPACK_zhegvx(lapack_int *itype, char *jobz, char *range, char *uplo, lapack_int *n, lapack_complex_double *a, lapack_int *lda, lapack_complex_double *b, lapack_int *ldb, double *vl, double *vu, lapack_int *il, lapack_int *iu, double *abstol, lapack_int *m, double *w, lapack_complex_double *z, lapack_int *ldz, lapack_complex_double *work, lapack_int *lwork, double *rwork, lapack_int *iwork, lapack_int *ifail, lapack_int *info)
#define lapack_complex_double
Definition: lapacke.h:90
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:36
#define LAPACKE_malloc(size)
Definition: lapacke.h:110
#define LAPACKE_free(p)
Definition: lapacke.h:113
void LAPACKE_xerbla(const char *name, lapack_int info)