lapacke_zheevx.c
Go to the documentation of this file.
00001 /*****************************************************************************
00002   Copyright (c) 2010, Intel Corp.
00003   All rights reserved.
00004 
00005   Redistribution and use in source and binary forms, with or without
00006   modification, are permitted provided that the following conditions are met:
00007 
00008     * Redistributions of source code must retain the above copyright notice,
00009       this list of conditions and the following disclaimer.
00010     * Redistributions in binary form must reproduce the above copyright
00011       notice, this list of conditions and the following disclaimer in the
00012       documentation and/or other materials provided with the distribution.
00013     * Neither the name of Intel Corporation nor the names of its contributors
00014       may be used to endorse or promote products derived from this software
00015       without specific prior written permission.
00016 
00017   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
00018   AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00019   IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
00020   ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
00021   LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
00022   CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
00023   SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
00024   INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
00025   CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
00026   ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
00027   THE POSSIBILITY OF SUCH DAMAGE.
00028 ******************************************************************************
00029 * Contents: Native high-level C interface to LAPACK function zheevx
00030 * Author: Intel Corporation
00031 * Generated October, 2010
00032 *****************************************************************************/
00033 
00034 #include "lapacke.h"
00035 #include "lapacke_utils.h"
00036 
00037 lapack_int LAPACKE_zheevx( int matrix_order, char jobz, char range, char uplo,
00038                            lapack_int n, lapack_complex_double* a,
00039                            lapack_int lda, double vl, double vu, lapack_int il,
00040                            lapack_int iu, double abstol, lapack_int* m,
00041                            double* w, lapack_complex_double* z, lapack_int ldz,
00042                            lapack_int* ifail )
00043 {
00044     lapack_int info = 0;
00045     lapack_int lwork = -1;
00046     lapack_int* iwork = NULL;
00047     double* rwork = NULL;
00048     lapack_complex_double* work = NULL;
00049     lapack_complex_double work_query;
00050     if( matrix_order != LAPACK_COL_MAJOR && matrix_order != LAPACK_ROW_MAJOR ) {
00051         LAPACKE_xerbla( "LAPACKE_zheevx", -1 );
00052         return -1;
00053     }
00054 #ifndef LAPACK_DISABLE_NAN_CHECK
00055     /* Optionally check input matrices for NaNs */
00056     if( LAPACKE_zhe_nancheck( matrix_order, uplo, n, a, lda ) ) {
00057         return -6;
00058     }
00059     if( LAPACKE_d_nancheck( 1, &abstol, 1 ) ) {
00060         return -12;
00061     }
00062     if( LAPACKE_lsame( range, 'v' ) ) {
00063         if( LAPACKE_d_nancheck( 1, &vl, 1 ) ) {
00064             return -8;
00065         }
00066     }
00067     if( LAPACKE_lsame( range, 'v' ) ) {
00068         if( LAPACKE_d_nancheck( 1, &vu, 1 ) ) {
00069             return -9;
00070         }
00071     }
00072 #endif
00073     /* Allocate memory for working array(s) */
00074     iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * MAX(1,5*n) );
00075     if( iwork == NULL ) {
00076         info = LAPACK_WORK_MEMORY_ERROR;
00077         goto exit_level_0;
00078     }
00079     rwork = (double*)LAPACKE_malloc( sizeof(double) * MAX(1,7*n) );
00080     if( rwork == NULL ) {
00081         info = LAPACK_WORK_MEMORY_ERROR;
00082         goto exit_level_1;
00083     }
00084     /* Query optimal working array(s) size */
00085     info = LAPACKE_zheevx_work( matrix_order, jobz, range, uplo, n, a, lda, vl,
00086                                 vu, il, iu, abstol, m, w, z, ldz, &work_query,
00087                                 lwork, rwork, iwork, ifail );
00088     if( info != 0 ) {
00089         goto exit_level_2;
00090     }
00091     lwork = LAPACK_Z2INT( work_query );
00092     /* Allocate memory for work arrays */
00093     work = (lapack_complex_double*)
00094         LAPACKE_malloc( sizeof(lapack_complex_double) * lwork );
00095     if( work == NULL ) {
00096         info = LAPACK_WORK_MEMORY_ERROR;
00097         goto exit_level_2;
00098     }
00099     /* Call middle-level interface */
00100     info = LAPACKE_zheevx_work( matrix_order, jobz, range, uplo, n, a, lda, vl,
00101                                 vu, il, iu, abstol, m, w, z, ldz, work, lwork,
00102                                 rwork, iwork, ifail );
00103     /* Release memory and exit */
00104     LAPACKE_free( work );
00105 exit_level_2:
00106     LAPACKE_free( rwork );
00107 exit_level_1:
00108     LAPACKE_free( iwork );
00109 exit_level_0:
00110     if( info == LAPACK_WORK_MEMORY_ERROR ) {
00111         LAPACKE_xerbla( "LAPACKE_zheevx", info );
00112     }
00113     return info;
00114 }


swiftnav
Author(s):
autogenerated on Sat Jun 8 2019 18:55:55