lapacke_zheevr.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 zheevr
00030 * Author: Intel Corporation
00031 * Generated October, 2010
00032 *****************************************************************************/
00033 
00034 #include "lapacke.h"
00035 #include "lapacke_utils.h"
00036 
00037 lapack_int LAPACKE_zheevr( 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* isuppz )
00043 {
00044     lapack_int info = 0;
00045     lapack_int liwork = -1;
00046     lapack_int lrwork = -1;
00047     lapack_int lwork = -1;
00048     lapack_int* iwork = NULL;
00049     double* rwork = NULL;
00050     lapack_complex_double* work = NULL;
00051     lapack_int iwork_query;
00052     double rwork_query;
00053     lapack_complex_double work_query;
00054     if( matrix_order != LAPACK_COL_MAJOR && matrix_order != LAPACK_ROW_MAJOR ) {
00055         LAPACKE_xerbla( "LAPACKE_zheevr", -1 );
00056         return -1;
00057     }
00058 #ifndef LAPACK_DISABLE_NAN_CHECK
00059     /* Optionally check input matrices for NaNs */
00060     if( LAPACKE_zhe_nancheck( matrix_order, uplo, n, a, lda ) ) {
00061         return -6;
00062     }
00063     if( LAPACKE_d_nancheck( 1, &abstol, 1 ) ) {
00064         return -12;
00065     }
00066     if( LAPACKE_lsame( range, 'v' ) ) {
00067         if( LAPACKE_d_nancheck( 1, &vl, 1 ) ) {
00068             return -8;
00069         }
00070     }
00071     if( LAPACKE_lsame( range, 'v' ) ) {
00072         if( LAPACKE_d_nancheck( 1, &vu, 1 ) ) {
00073             return -9;
00074         }
00075     }
00076 #endif
00077     /* Query optimal working array(s) size */
00078     info = LAPACKE_zheevr_work( matrix_order, jobz, range, uplo, n, a, lda, vl,
00079                                 vu, il, iu, abstol, m, w, z, ldz, isuppz,
00080                                 &work_query, lwork, &rwork_query, lrwork,
00081                                 &iwork_query, liwork );
00082     if( info != 0 ) {
00083         goto exit_level_0;
00084     }
00085     liwork = (lapack_int)iwork_query;
00086     lrwork = (lapack_int)rwork_query;
00087     lwork = LAPACK_Z2INT( work_query );
00088     /* Allocate memory for work arrays */
00089     iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * liwork );
00090     if( iwork == NULL ) {
00091         info = LAPACK_WORK_MEMORY_ERROR;
00092         goto exit_level_0;
00093     }
00094     rwork = (double*)LAPACKE_malloc( sizeof(double) * lrwork );
00095     if( rwork == NULL ) {
00096         info = LAPACK_WORK_MEMORY_ERROR;
00097         goto exit_level_1;
00098     }
00099     work = (lapack_complex_double*)
00100         LAPACKE_malloc( sizeof(lapack_complex_double) * lwork );
00101     if( work == NULL ) {
00102         info = LAPACK_WORK_MEMORY_ERROR;
00103         goto exit_level_2;
00104     }
00105     /* Call middle-level interface */
00106     info = LAPACKE_zheevr_work( matrix_order, jobz, range, uplo, n, a, lda, vl,
00107                                 vu, il, iu, abstol, m, w, z, ldz, isuppz, work,
00108                                 lwork, rwork, lrwork, iwork, liwork );
00109     /* Release memory and exit */
00110     LAPACKE_free( work );
00111 exit_level_2:
00112     LAPACKE_free( rwork );
00113 exit_level_1:
00114     LAPACKE_free( iwork );
00115 exit_level_0:
00116     if( info == LAPACK_WORK_MEMORY_ERROR ) {
00117         LAPACKE_xerbla( "LAPACKE_zheevr", info );
00118     }
00119     return info;
00120 }


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