lapacke_zhbevd.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 zhbevd
00030 * Author: Intel Corporation
00031 * Generated October, 2010
00032 *****************************************************************************/
00033 
00034 #include "lapacke.h"
00035 #include "lapacke_utils.h"
00036 
00037 lapack_int LAPACKE_zhbevd( int matrix_order, char jobz, char uplo, lapack_int n,
00038                            lapack_int kd, lapack_complex_double* ab,
00039                            lapack_int ldab, double* w, lapack_complex_double* z,
00040                            lapack_int ldz )
00041 {
00042     lapack_int info = 0;
00043     lapack_int liwork = -1;
00044     lapack_int lrwork = -1;
00045     lapack_int lwork = -1;
00046     lapack_int* iwork = NULL;
00047     double* rwork = NULL;
00048     lapack_complex_double* work = NULL;
00049     lapack_int iwork_query;
00050     double rwork_query;
00051     lapack_complex_double work_query;
00052     if( matrix_order != LAPACK_COL_MAJOR && matrix_order != LAPACK_ROW_MAJOR ) {
00053         LAPACKE_xerbla( "LAPACKE_zhbevd", -1 );
00054         return -1;
00055     }
00056 #ifndef LAPACK_DISABLE_NAN_CHECK
00057     /* Optionally check input matrices for NaNs */
00058     if( LAPACKE_zhb_nancheck( matrix_order, uplo, n, kd, ab, ldab ) ) {
00059         return -6;
00060     }
00061 #endif
00062     /* Query optimal working array(s) size */
00063     info = LAPACKE_zhbevd_work( matrix_order, jobz, uplo, n, kd, ab, ldab, w, z,
00064                                 ldz, &work_query, lwork, &rwork_query, lrwork,
00065                                 &iwork_query, liwork );
00066     if( info != 0 ) {
00067         goto exit_level_0;
00068     }
00069     liwork = (lapack_int)iwork_query;
00070     lrwork = (lapack_int)rwork_query;
00071     lwork = LAPACK_Z2INT( work_query );
00072     /* Allocate memory for work arrays */
00073     iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * liwork );
00074     if( iwork == NULL ) {
00075         info = LAPACK_WORK_MEMORY_ERROR;
00076         goto exit_level_0;
00077     }
00078     rwork = (double*)LAPACKE_malloc( sizeof(double) * lrwork );
00079     if( rwork == NULL ) {
00080         info = LAPACK_WORK_MEMORY_ERROR;
00081         goto exit_level_1;
00082     }
00083     work = (lapack_complex_double*)
00084         LAPACKE_malloc( sizeof(lapack_complex_double) * lwork );
00085     if( work == NULL ) {
00086         info = LAPACK_WORK_MEMORY_ERROR;
00087         goto exit_level_2;
00088     }
00089     /* Call middle-level interface */
00090     info = LAPACKE_zhbevd_work( matrix_order, jobz, uplo, n, kd, ab, ldab, w, z,
00091                                 ldz, work, lwork, rwork, lrwork, iwork,
00092                                 liwork );
00093     /* Release memory and exit */
00094     LAPACKE_free( work );
00095 exit_level_2:
00096     LAPACKE_free( rwork );
00097 exit_level_1:
00098     LAPACKE_free( iwork );
00099 exit_level_0:
00100     if( info == LAPACK_WORK_MEMORY_ERROR ) {
00101         LAPACKE_xerbla( "LAPACKE_zhbevd", info );
00102     }
00103     return info;
00104 }


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