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 zhbevx
30 * Author: Intel Corporation
31 *****************************************************************************/
32
33 #include "lapacke_utils.h"
34
LAPACKE_zhbevx_work(int matrix_layout,char jobz,char range,char uplo,lapack_int n,lapack_int kd,lapack_complex_double * ab,lapack_int ldab,lapack_complex_double * q,lapack_int ldq,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,double * rwork,lapack_int * iwork,lapack_int * ifail)35 lapack_int LAPACKE_zhbevx_work( int matrix_layout, char jobz, char range,
36 char uplo, lapack_int n, lapack_int kd,
37 lapack_complex_double* ab, lapack_int ldab,
38 lapack_complex_double* q, lapack_int ldq,
39 double vl, double vu, lapack_int il,
40 lapack_int iu, double abstol, lapack_int* m,
41 double* w, lapack_complex_double* z,
42 lapack_int ldz, lapack_complex_double* work,
43 double* rwork, lapack_int* iwork,
44 lapack_int* ifail )
45 {
46 lapack_int info = 0;
47 if( matrix_layout == LAPACK_COL_MAJOR ) {
48 /* Call LAPACK function and adjust info */
49 LAPACK_zhbevx( &jobz, &range, &uplo, &n, &kd, ab, &ldab, q, &ldq, &vl,
50 &vu, &il, &iu, &abstol, m, w, z, &ldz, work, rwork,
51 iwork, ifail, &info );
52 if( info < 0 ) {
53 info = info - 1;
54 }
55 } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
56 lapack_int ncols_z = ( LAPACKE_lsame( range, 'a' ) ||
57 LAPACKE_lsame( range, 'v' ) ) ? n :
58 ( LAPACKE_lsame( range, 'i' ) ? (iu-il+1) : 1);
59 lapack_int ldab_t = MAX(1,kd+1);
60 lapack_int ldq_t = MAX(1,n);
61 lapack_int ldz_t = MAX(1,n);
62 lapack_complex_double* ab_t = NULL;
63 lapack_complex_double* q_t = NULL;
64 lapack_complex_double* z_t = NULL;
65 /* Check leading dimension(s) */
66 if( ldab < n ) {
67 info = -8;
68 LAPACKE_xerbla( "LAPACKE_zhbevx_work", info );
69 return info;
70 }
71 if( ldq < n ) {
72 info = -10;
73 LAPACKE_xerbla( "LAPACKE_zhbevx_work", info );
74 return info;
75 }
76 if( ldz < ncols_z ) {
77 info = -19;
78 LAPACKE_xerbla( "LAPACKE_zhbevx_work", info );
79 return info;
80 }
81 /* Allocate memory for temporary array(s) */
82 ab_t = (lapack_complex_double*)
83 LAPACKE_malloc( sizeof(lapack_complex_double) * ldab_t * MAX(1,n) );
84 if( ab_t == NULL ) {
85 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
86 goto exit_level_0;
87 }
88 if( LAPACKE_lsame( jobz, 'v' ) ) {
89 q_t = (lapack_complex_double*)
90 LAPACKE_malloc( sizeof(lapack_complex_double) *
91 ldq_t * MAX(1,n) );
92 if( q_t == NULL ) {
93 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
94 goto exit_level_1;
95 }
96 }
97 if( LAPACKE_lsame( jobz, 'v' ) ) {
98 z_t = (lapack_complex_double*)
99 LAPACKE_malloc( sizeof(lapack_complex_double) *
100 ldz_t * MAX(1,ncols_z) );
101 if( z_t == NULL ) {
102 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
103 goto exit_level_2;
104 }
105 }
106 /* Transpose input matrices */
107 LAPACKE_zhb_trans( matrix_layout, uplo, n, kd, ab, ldab, ab_t, ldab_t );
108 /* Call LAPACK function and adjust info */
109 LAPACK_zhbevx( &jobz, &range, &uplo, &n, &kd, ab_t, &ldab_t, q_t,
110 &ldq_t, &vl, &vu, &il, &iu, &abstol, m, w, z_t, &ldz_t,
111 work, rwork, iwork, ifail, &info );
112 if( info < 0 ) {
113 info = info - 1;
114 }
115 /* Transpose output matrices */
116 LAPACKE_zhb_trans( LAPACK_COL_MAJOR, uplo, n, kd, ab_t, ldab_t, ab,
117 ldab );
118 if( LAPACKE_lsame( jobz, 'v' ) ) {
119 LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, n, q_t, ldq_t, q, ldq );
120 }
121 if( LAPACKE_lsame( jobz, 'v' ) ) {
122 LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, ncols_z, z_t, ldz_t, z,
123 ldz );
124 }
125 /* Release memory and exit */
126 if( LAPACKE_lsame( jobz, 'v' ) ) {
127 LAPACKE_free( z_t );
128 }
129 exit_level_2:
130 if( LAPACKE_lsame( jobz, 'v' ) ) {
131 LAPACKE_free( q_t );
132 }
133 exit_level_1:
134 LAPACKE_free( ab_t );
135 exit_level_0:
136 if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
137 LAPACKE_xerbla( "LAPACKE_zhbevx_work", info );
138 }
139 } else {
140 info = -1;
141 LAPACKE_xerbla( "LAPACKE_zhbevx_work", info );
142 }
143 return info;
144 }
145