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