lapacke_cggsvp.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 cggsvp
00030 * Author: Intel Corporation
00031 * Generated October, 2010
00032 *****************************************************************************/
00033 
00034 #include "lapacke.h"
00035 #include "lapacke_utils.h"
00036 
00037 lapack_int LAPACKE_cggsvp( int matrix_order, char jobu, char jobv, char jobq,
00038                            lapack_int m, lapack_int p, lapack_int n,
00039                            lapack_complex_float* a, lapack_int lda,
00040                            lapack_complex_float* b, lapack_int ldb, float tola,
00041                            float tolb, lapack_int* k, lapack_int* l,
00042                            lapack_complex_float* u, lapack_int ldu,
00043                            lapack_complex_float* v, lapack_int ldv,
00044                            lapack_complex_float* q, lapack_int ldq )
00045 {
00046     lapack_int info = 0;
00047     lapack_int* iwork = NULL;
00048     float* rwork = NULL;
00049     lapack_complex_float* tau = NULL;
00050     lapack_complex_float* work = NULL;
00051     if( matrix_order != LAPACK_COL_MAJOR && matrix_order != LAPACK_ROW_MAJOR ) {
00052         LAPACKE_xerbla( "LAPACKE_cggsvp", -1 );
00053         return -1;
00054     }
00055 #ifndef LAPACK_DISABLE_NAN_CHECK
00056     /* Optionally check input matrices for NaNs */
00057     if( LAPACKE_cge_nancheck( matrix_order, m, n, a, lda ) ) {
00058         return -8;
00059     }
00060     if( LAPACKE_cge_nancheck( matrix_order, p, n, b, ldb ) ) {
00061         return -10;
00062     }
00063     if( LAPACKE_s_nancheck( 1, &tola, 1 ) ) {
00064         return -12;
00065     }
00066     if( LAPACKE_s_nancheck( 1, &tolb, 1 ) ) {
00067         return -13;
00068     }
00069 #endif
00070     /* Allocate memory for working array(s) */
00071     iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * MAX(1,n) );
00072     if( iwork == NULL ) {
00073         info = LAPACK_WORK_MEMORY_ERROR;
00074         goto exit_level_0;
00075     }
00076     rwork = (float*)LAPACKE_malloc( sizeof(float) * MAX(1,2*n) );
00077     if( rwork == NULL ) {
00078         info = LAPACK_WORK_MEMORY_ERROR;
00079         goto exit_level_1;
00080     }
00081     tau = (lapack_complex_float*)
00082         LAPACKE_malloc( sizeof(lapack_complex_float) * MAX(1,n) );
00083     if( tau == NULL ) {
00084         info = LAPACK_WORK_MEMORY_ERROR;
00085         goto exit_level_2;
00086     }
00087     work = (lapack_complex_float*)
00088         LAPACKE_malloc( sizeof(lapack_complex_float) * MAX(1,MAX3(3*n,m,p)) );
00089     if( work == NULL ) {
00090         info = LAPACK_WORK_MEMORY_ERROR;
00091         goto exit_level_3;
00092     }
00093     /* Call middle-level interface */
00094     info = LAPACKE_cggsvp_work( matrix_order, jobu, jobv, jobq, m, p, n, a, lda,
00095                                 b, ldb, tola, tolb, k, l, u, ldu, v, ldv, q,
00096                                 ldq, iwork, rwork, tau, work );
00097     /* Release memory and exit */
00098     LAPACKE_free( work );
00099 exit_level_3:
00100     LAPACKE_free( tau );
00101 exit_level_2:
00102     LAPACKE_free( rwork );
00103 exit_level_1:
00104     LAPACKE_free( iwork );
00105 exit_level_0:
00106     if( info == LAPACK_WORK_MEMORY_ERROR ) {
00107         LAPACKE_xerbla( "LAPACKE_cggsvp", info );
00108     }
00109     return info;
00110 }


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