114 lines
		
	
	
		
			4.7 KiB
		
	
	
	
		
			C
		
	
	
	
			
		
		
	
	
			114 lines
		
	
	
		
			4.7 KiB
		
	
	
	
		
			C
		
	
	
	
| /*****************************************************************************
 | |
|   Copyright (c) 2011, Intel Corp.
 | |
|   All rights reserved.
 | |
| 
 | |
|   Redistribution and use in source and binary forms, with or without
 | |
|   modification, are permitted provided that the following conditions are met:
 | |
| 
 | |
|     * Redistributions of source code must retain the above copyright notice,
 | |
|       this list of conditions and the following disclaimer.
 | |
|     * Redistributions in binary form must reproduce the above copyright
 | |
|       notice, this list of conditions and the following disclaimer in the
 | |
|       documentation and/or other materials provided with the distribution.
 | |
|     * Neither the name of Intel Corporation nor the names of its contributors
 | |
|       may be used to endorse or promote products derived from this software
 | |
|       without specific prior written permission.
 | |
| 
 | |
|   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 | |
|   AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 | |
|   IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 | |
|   ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 | |
|   LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 | |
|   CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 | |
|   SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 | |
|   INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 | |
|   CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 | |
|   ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
 | |
|   THE POSSIBILITY OF SUCH DAMAGE.
 | |
| *****************************************************************************
 | |
| * Contents: Native high-level C interface to LAPACK function dtgsen
 | |
| * Author: Intel Corporation
 | |
| * Generated November, 2011
 | |
| *****************************************************************************/
 | |
| 
 | |
| #include "lapacke_utils.h"
 | |
| 
 | |
| lapack_int LAPACKE_dtgsen( int matrix_order, lapack_int ijob,
 | |
|                            lapack_logical wantq, lapack_logical wantz,
 | |
|                            const lapack_logical* select, lapack_int n,
 | |
|                            double* a, lapack_int lda, double* b, lapack_int ldb,
 | |
|                            double* alphar, double* alphai, double* beta,
 | |
|                            double* q, lapack_int ldq, double* z, lapack_int ldz,
 | |
|                            lapack_int* m, double* pl, double* pr, double* dif )
 | |
| {
 | |
|     lapack_int info = 0;
 | |
|     lapack_int liwork = -1;
 | |
|     lapack_int lwork = -1;
 | |
|     lapack_int* iwork = NULL;
 | |
|     double* work = NULL;
 | |
|     lapack_int iwork_query;
 | |
|     double work_query;
 | |
|     if( matrix_order != LAPACK_COL_MAJOR && matrix_order != LAPACK_ROW_MAJOR ) {
 | |
|         LAPACKE_xerbla( "LAPACKE_dtgsen", -1 );
 | |
|         return -1;
 | |
|     }
 | |
| #ifndef LAPACK_DISABLE_NAN_CHECK
 | |
|     /* Optionally check input matrices for NaNs */
 | |
|     if( LAPACKE_dge_nancheck( matrix_order, n, n, a, lda ) ) {
 | |
|         return -7;
 | |
|     }
 | |
|     if( LAPACKE_dge_nancheck( matrix_order, n, n, b, ldb ) ) {
 | |
|         return -9;
 | |
|     }
 | |
|     if( wantq ) {
 | |
|         if( LAPACKE_dge_nancheck( matrix_order, n, n, q, ldq ) ) {
 | |
|             return -14;
 | |
|         }
 | |
|     }
 | |
|     if( wantz ) {
 | |
|         if( LAPACKE_dge_nancheck( matrix_order, n, n, z, ldz ) ) {
 | |
|             return -16;
 | |
|         }
 | |
|     }
 | |
| #endif
 | |
|     /* Query optimal working array(s) size */
 | |
|     info = LAPACKE_dtgsen_work( matrix_order, ijob, wantq, wantz, select, n, a,
 | |
|                                 lda, b, ldb, alphar, alphai, beta, q, ldq, z,
 | |
|                                 ldz, m, pl, pr, dif, &work_query, lwork,
 | |
|                                 &iwork_query, liwork );
 | |
|     if( info != 0 ) {
 | |
|         goto exit_level_0;
 | |
|     }
 | |
|     liwork = (lapack_int)iwork_query;
 | |
|     lwork = (lapack_int)work_query;
 | |
|     /* Allocate memory for work arrays */
 | |
|     if( ijob != 0 ) {
 | |
|         iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * liwork );
 | |
|         if( iwork == NULL ) {
 | |
|             info = LAPACK_WORK_MEMORY_ERROR;
 | |
|             goto exit_level_0;
 | |
|         }
 | |
|     }
 | |
|     work = (double*)LAPACKE_malloc( sizeof(double) * lwork );
 | |
|     if( work == NULL ) {
 | |
|         info = LAPACK_WORK_MEMORY_ERROR;
 | |
|         goto exit_level_1;
 | |
|     }
 | |
|     /* Call middle-level interface */
 | |
|     info = LAPACKE_dtgsen_work( matrix_order, ijob, wantq, wantz, select, n, a,
 | |
|                                 lda, b, ldb, alphar, alphai, beta, q, ldq, z,
 | |
|                                 ldz, m, pl, pr, dif, work, lwork, iwork,
 | |
|                                 liwork );
 | |
|     /* Release memory and exit */
 | |
|     LAPACKE_free( work );
 | |
| exit_level_1:
 | |
|     if( ijob != 0 ) {
 | |
|         LAPACKE_free( iwork );
 | |
|     }
 | |
| exit_level_0:
 | |
|     if( info == LAPACK_WORK_MEMORY_ERROR ) {
 | |
|         LAPACKE_xerbla( "LAPACKE_dtgsen", info );
 | |
|     }
 | |
|     return info;
 | |
| }
 |