104 lines
		
	
	
		
			4.3 KiB
		
	
	
	
		
			C
		
	
	
	
			
		
		
	
	
			104 lines
		
	
	
		
			4.3 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 dgesvx
 | 
						|
* Author: Intel Corporation
 | 
						|
* Generated November, 2011
 | 
						|
*****************************************************************************/
 | 
						|
 | 
						|
#include "lapacke_utils.h"
 | 
						|
 | 
						|
lapack_int LAPACKE_dgesvx( int matrix_order, char fact, char trans,
 | 
						|
                           lapack_int n, lapack_int nrhs, double* a,
 | 
						|
                           lapack_int lda, double* af, lapack_int ldaf,
 | 
						|
                           lapack_int* ipiv, char* equed, double* r, double* c,
 | 
						|
                           double* b, lapack_int ldb, double* x, lapack_int ldx,
 | 
						|
                           double* rcond, double* ferr, double* berr,
 | 
						|
                           double* rpivot )
 | 
						|
{
 | 
						|
    lapack_int info = 0;
 | 
						|
    lapack_int* iwork = NULL;
 | 
						|
    double* work = NULL;
 | 
						|
    if( matrix_order != LAPACK_COL_MAJOR && matrix_order != LAPACK_ROW_MAJOR ) {
 | 
						|
        LAPACKE_xerbla( "LAPACKE_dgesvx", -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 -6;
 | 
						|
    }
 | 
						|
    if( LAPACKE_lsame( fact, 'f' ) ) {
 | 
						|
        if( LAPACKE_dge_nancheck( matrix_order, n, n, af, ldaf ) ) {
 | 
						|
            return -8;
 | 
						|
        }
 | 
						|
    }
 | 
						|
    if( LAPACKE_dge_nancheck( matrix_order, n, nrhs, b, ldb ) ) {
 | 
						|
        return -14;
 | 
						|
    }
 | 
						|
    if( LAPACKE_lsame( fact, 'f' ) && ( LAPACKE_lsame( *equed, 'b' ) ||
 | 
						|
        LAPACKE_lsame( *equed, 'c' ) ) ) {
 | 
						|
        if( LAPACKE_d_nancheck( n, c, 1 ) ) {
 | 
						|
            return -13;
 | 
						|
        }
 | 
						|
    }
 | 
						|
    if( LAPACKE_lsame( fact, 'f' ) && ( LAPACKE_lsame( *equed, 'b' ) ||
 | 
						|
        LAPACKE_lsame( *equed, 'r' ) ) ) {
 | 
						|
        if( LAPACKE_d_nancheck( n, r, 1 ) ) {
 | 
						|
            return -12;
 | 
						|
        }
 | 
						|
    }
 | 
						|
#endif
 | 
						|
    /* Allocate memory for working array(s) */
 | 
						|
    iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * MAX(1,n) );
 | 
						|
    if( iwork == NULL ) {
 | 
						|
        info = LAPACK_WORK_MEMORY_ERROR;
 | 
						|
        goto exit_level_0;
 | 
						|
    }
 | 
						|
    work = (double*)LAPACKE_malloc( sizeof(double) * MAX(1,4*n) );
 | 
						|
    if( work == NULL ) {
 | 
						|
        info = LAPACK_WORK_MEMORY_ERROR;
 | 
						|
        goto exit_level_1;
 | 
						|
    }
 | 
						|
    /* Call middle-level interface */
 | 
						|
    info = LAPACKE_dgesvx_work( matrix_order, fact, trans, n, nrhs, a, lda, af,
 | 
						|
                                ldaf, ipiv, equed, r, c, b, ldb, x, ldx, rcond,
 | 
						|
                                ferr, berr, work, iwork );
 | 
						|
    /* Backup significant data from working array(s) */
 | 
						|
    *rpivot = work[0];
 | 
						|
    /* Release memory and exit */
 | 
						|
    LAPACKE_free( work );
 | 
						|
exit_level_1:
 | 
						|
    LAPACKE_free( iwork );
 | 
						|
exit_level_0:
 | 
						|
    if( info == LAPACK_WORK_MEMORY_ERROR ) {
 | 
						|
        LAPACKE_xerbla( "LAPACKE_dgesvx", info );
 | 
						|
    }
 | 
						|
    return info;
 | 
						|
}
 |