LAPACK  3.8.0
LAPACK: Linear Algebra PACKage
lapacke_zhegvd_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 zhegvd
30 * Author: Intel Corporation
31 * Generated November 2015
32 *****************************************************************************/
33 
34 #include "lapacke_utils.h"
35 
36 lapack_int LAPACKE_zhegvd_work( int matrix_layout, lapack_int itype, char jobz,
37  char uplo, lapack_int n,
40  double* w, lapack_complex_double* work,
41  lapack_int lwork, double* rwork,
42  lapack_int lrwork, lapack_int* iwork,
43  lapack_int liwork )
44 {
45  lapack_int info = 0;
46  if( matrix_layout == LAPACK_COL_MAJOR ) {
47  /* Call LAPACK function and adjust info */
48  LAPACK_zhegvd( &itype, &jobz, &uplo, &n, a, &lda, b, &ldb, w, work,
49  &lwork, rwork, &lrwork, iwork, &liwork, &info );
50  if( info < 0 ) {
51  info = info - 1;
52  }
53  } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
54  lapack_int lda_t = MAX(1,n);
55  lapack_int ldb_t = MAX(1,n);
56  lapack_complex_double* a_t = NULL;
57  lapack_complex_double* b_t = NULL;
58  /* Check leading dimension(s) */
59  if( lda < n ) {
60  info = -7;
61  LAPACKE_xerbla( "LAPACKE_zhegvd_work", info );
62  return info;
63  }
64  if( ldb < n ) {
65  info = -9;
66  LAPACKE_xerbla( "LAPACKE_zhegvd_work", info );
67  return info;
68  }
69  /* Query optimal working array(s) size if requested */
70  if( liwork == -1 || lrwork == -1 || lwork == -1 ) {
71  LAPACK_zhegvd( &itype, &jobz, &uplo, &n, a, &lda_t, b, &ldb_t, w,
72  work, &lwork, rwork, &lrwork, iwork, &liwork,
73  &info );
74  return (info < 0) ? (info - 1) : info;
75  }
76  /* Allocate memory for temporary array(s) */
77  a_t = (lapack_complex_double*)
78  LAPACKE_malloc( sizeof(lapack_complex_double) * lda_t * MAX(1,n) );
79  if( a_t == NULL ) {
81  goto exit_level_0;
82  }
83  b_t = (lapack_complex_double*)
84  LAPACKE_malloc( sizeof(lapack_complex_double) * ldb_t * MAX(1,n) );
85  if( b_t == NULL ) {
87  goto exit_level_1;
88  }
89  /* Transpose input matrices */
90  LAPACKE_zge_trans( matrix_layout, n, n, a, lda, a_t, lda_t );
91  LAPACKE_zge_trans( matrix_layout, n, n, b, ldb, b_t, ldb_t );
92  /* Call LAPACK function and adjust info */
93  LAPACK_zhegvd( &itype, &jobz, &uplo, &n, a_t, &lda_t, b_t, &ldb_t, w,
94  work, &lwork, rwork, &lrwork, iwork, &liwork, &info );
95  if( info < 0 ) {
96  info = info - 1;
97  }
98  /* Transpose output matrices */
99  LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, n, a_t, lda_t, a, lda );
100  LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, n, b_t, ldb_t, b, ldb );
101  /* Release memory and exit */
102  LAPACKE_free( b_t );
103 exit_level_1:
104  LAPACKE_free( a_t );
105 exit_level_0:
106  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
107  LAPACKE_xerbla( "LAPACKE_zhegvd_work", info );
108  }
109  } else {
110  info = -1;
111  LAPACKE_xerbla( "LAPACKE_zhegvd_work", info );
112  }
113  return info;
114 }
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
#define LAPACKE_free(p)
Definition: lapacke.h:113
#define lapack_complex_double
Definition: lapacke.h:90
lapack_int LAPACKE_zhegvd_work(int matrix_layout, lapack_int itype, char jobz, char uplo, lapack_int n, lapack_complex_double *a, lapack_int lda, lapack_complex_double *b, lapack_int ldb, double *w, lapack_complex_double *work, lapack_int lwork, double *rwork, lapack_int lrwork, lapack_int *iwork, lapack_int liwork)
#define MAX(x, y)
Definition: lapacke_utils.h:47
#define LAPACKE_malloc(size)
Definition: lapacke.h:110
void LAPACK_zhegvd(lapack_int *itype, char *jobz, char *uplo, lapack_int *n, lapack_complex_double *a, lapack_int *lda, lapack_complex_double *b, lapack_int *ldb, double *w, lapack_complex_double *work, lapack_int *lwork, double *rwork, lapack_int *lrwork, lapack_int *iwork, lapack_int *liwork, lapack_int *info)
#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)