lapacke_dtgsen.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 dtgsen
00030 * Author: Intel Corporation
00031 * Generated October, 2010
00032 *****************************************************************************/
00033 
00034 #include "lapacke.h"
00035 #include "lapacke_utils.h"
00036 
00037 lapack_int LAPACKE_dtgsen( int matrix_order, lapack_int ijob,
00038                            lapack_logical wantq, lapack_logical wantz,
00039                            const lapack_logical* select, lapack_int n,
00040                            double* a, lapack_int lda, double* b, lapack_int ldb,
00041                            double* alphar, double* alphai, double* beta,
00042                            double* q, lapack_int ldq, double* z, lapack_int ldz,
00043                            lapack_int* m, double* pl, double* pr, double* dif )
00044 {
00045     lapack_int info = 0;
00046     lapack_int liwork = -1;
00047     lapack_int lwork = -1;
00048     lapack_int* iwork = NULL;
00049     double* work = NULL;
00050     lapack_int iwork_query;
00051     double work_query;
00052     if( matrix_order != LAPACK_COL_MAJOR && matrix_order != LAPACK_ROW_MAJOR ) {
00053         LAPACKE_xerbla( "LAPACKE_dtgsen", -1 );
00054         return -1;
00055     }
00056 #ifndef LAPACK_DISABLE_NAN_CHECK
00057     /* Optionally check input matrices for NaNs */
00058     if( LAPACKE_dge_nancheck( matrix_order, n, n, a, lda ) ) {
00059         return -7;
00060     }
00061     if( LAPACKE_dge_nancheck( matrix_order, n, n, b, ldb ) ) {
00062         return -9;
00063     }
00064     if( wantq ) {
00065         if( LAPACKE_dge_nancheck( matrix_order, n, n, q, ldq ) ) {
00066             return -14;
00067         }
00068     }
00069     if( wantz ) {
00070         if( LAPACKE_dge_nancheck( matrix_order, n, n, z, ldz ) ) {
00071             return -16;
00072         }
00073     }
00074 #endif
00075     /* Query optimal working array(s) size */
00076     info = LAPACKE_dtgsen_work( matrix_order, ijob, wantq, wantz, select, n, a,
00077                                 lda, b, ldb, alphar, alphai, beta, q, ldq, z,
00078                                 ldz, m, pl, pr, dif, &work_query, lwork,
00079                                 &iwork_query, liwork );
00080     if( info != 0 ) {
00081         goto exit_level_0;
00082     }
00083     liwork = (lapack_int)iwork_query;
00084     lwork = (lapack_int)work_query;
00085     /* Allocate memory for work arrays */
00086     if( ijob != 0 ) {
00087         iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * liwork );
00088         if( iwork == NULL ) {
00089             info = LAPACK_WORK_MEMORY_ERROR;
00090             goto exit_level_0;
00091         }
00092     }
00093     work = (double*)LAPACKE_malloc( sizeof(double) * lwork );
00094     if( work == NULL ) {
00095         info = LAPACK_WORK_MEMORY_ERROR;
00096         goto exit_level_1;
00097     }
00098     /* Call middle-level interface */
00099     info = LAPACKE_dtgsen_work( matrix_order, ijob, wantq, wantz, select, n, a,
00100                                 lda, b, ldb, alphar, alphai, beta, q, ldq, z,
00101                                 ldz, m, pl, pr, dif, work, lwork, iwork,
00102                                 liwork );
00103     /* Release memory and exit */
00104     LAPACKE_free( work );
00105 exit_level_1:
00106     if( ijob != 0 ) {
00107         LAPACKE_free( iwork );
00108     }
00109 exit_level_0:
00110     if( info == LAPACK_WORK_MEMORY_ERROR ) {
00111         LAPACKE_xerbla( "LAPACKE_dtgsen", info );
00112     }
00113     return info;
00114 }


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