90 lines
		
	
	
		
			3.8 KiB
		
	
	
	
		
			C
		
	
	
	
			
		
		
	
	
			90 lines
		
	
	
		
			3.8 KiB
		
	
	
	
		
			C
		
	
	
	
/*****************************************************************************
 | 
						|
  Copyright (c) 2010, 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 C interface to LAPACK utility function
 | 
						|
* Author: Intel Corporation
 | 
						|
* Created in February, 2010
 | 
						|
*****************************************************************************/
 | 
						|
 | 
						|
#include "lapacke_utils.h"
 | 
						|
 | 
						|
/* Converts input triangular banded matrix from row-major(C) to
 | 
						|
 * column-major(Fortran) layout or vice versa.
 | 
						|
 */
 | 
						|
 | 
						|
void LAPACKE_dtb_trans( int matrix_order, char uplo, char diag,
 | 
						|
                        lapack_int n, lapack_int kd,
 | 
						|
                        const double *in, lapack_int ldin,
 | 
						|
                        double *out, lapack_int ldout )
 | 
						|
{
 | 
						|
    lapack_logical colmaj, upper, unit;
 | 
						|
 | 
						|
    if( in == NULL || out == NULL ) return;
 | 
						|
 | 
						|
    colmaj = ( matrix_order == LAPACK_COL_MAJOR );
 | 
						|
    upper  = LAPACKE_lsame( uplo, 'u' );
 | 
						|
    unit   = LAPACKE_lsame( diag, 'u' );
 | 
						|
 | 
						|
    if( ( !colmaj && ( matrix_order != LAPACK_ROW_MAJOR ) ) ||
 | 
						|
        ( !upper  && !LAPACKE_lsame( uplo, 'l' ) ) ||
 | 
						|
        ( !unit   && !LAPACKE_lsame( diag, 'n' ) ) ) {
 | 
						|
        /* Just exit if any of input parameters are wrong */
 | 
						|
        return;
 | 
						|
    }
 | 
						|
 | 
						|
    if( unit ) {
 | 
						|
        /* Unit case, diagonal excluded from transposition */
 | 
						|
        if( colmaj ) {
 | 
						|
            if( upper ) {
 | 
						|
                LAPACKE_dgb_trans( matrix_order, n-1, n-1, 0, kd-1,
 | 
						|
                                   &in[ldin], ldin, &out[1], ldout );
 | 
						|
            } else {
 | 
						|
                LAPACKE_dgb_trans( matrix_order, n-1, n-1, kd-1, 0,
 | 
						|
                                   &in[1], ldin, &out[ldout], ldout );
 | 
						|
            }
 | 
						|
        } else {
 | 
						|
            if( upper ) {
 | 
						|
                LAPACKE_dgb_trans( matrix_order, n-1, n-1, 0, kd-1,
 | 
						|
                                   &in[1], ldin, &out[ldout], ldout );
 | 
						|
            } else {
 | 
						|
                LAPACKE_dgb_trans( matrix_order, n-1, n-1, kd-1, 0,
 | 
						|
                                   &in[ldin], ldin, &out[1], ldout );
 | 
						|
            }
 | 
						|
        }
 | 
						|
    } else {
 | 
						|
        /* Non-unit case */
 | 
						|
        if( upper ) {
 | 
						|
            LAPACKE_dgb_trans( matrix_order, n, n, 0, kd, in, ldin, out,
 | 
						|
                               ldout );
 | 
						|
        } else {
 | 
						|
            LAPACKE_dgb_trans( matrix_order, n, n, kd, 0, in, ldin, out,
 | 
						|
                               ldout );
 | 
						|
        }
 | 
						|
    }
 | 
						|
}
 |