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


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