214 lines
		
	
	
		
			6.5 KiB
		
	
	
	
		
			C
		
	
	
	
			
		
		
	
	
			214 lines
		
	
	
		
			6.5 KiB
		
	
	
	
		
			C
		
	
	
	
| /*********************************************************************/
 | |
| /* Copyright 2009, 2010 The University of Texas at Austin.           */
 | |
| /* All rights reserved.                                              */
 | |
| /*                                                                   */
 | |
| /* Redistribution and use in source and binary forms, with or        */
 | |
| /* without modification, are permitted provided that the following   */
 | |
| /* conditions are met:                                               */
 | |
| /*                                                                   */
 | |
| /*   1. Redistributions of source code must retain the above         */
 | |
| /*      copyright notice, this list of conditions and the following  */
 | |
| /*      disclaimer.                                                  */
 | |
| /*                                                                   */
 | |
| /*   2. 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.                              */
 | |
| /*                                                                   */
 | |
| /*    THIS  SOFTWARE IS PROVIDED  BY THE  UNIVERSITY OF  TEXAS AT    */
 | |
| /*    AUSTIN  ``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 UNIVERSITY  OF TEXAS AT    */
 | |
| /*    AUSTIN 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.                                    */
 | |
| /*                                                                   */
 | |
| /* The views and conclusions contained in the software and           */
 | |
| /* documentation are those of the authors and should not be          */
 | |
| /* interpreted as representing official policies, either expressed   */
 | |
| /* or implied, of The University of Texas at Austin.                 */
 | |
| /*********************************************************************/
 | |
| 
 | |
| #include <stdio.h>
 | |
| #include <ctype.h>
 | |
| #include "common.h"
 | |
| #ifdef FUNCTION_PROFILE
 | |
| #include "functable.h"
 | |
| #endif
 | |
| 
 | |
| #ifdef XDOUBLE
 | |
| #define ERROR_NAME "XTPSV "
 | |
| #elif defined(DOUBLE)
 | |
| #define ERROR_NAME "ZTPSV "
 | |
| #else
 | |
| #define ERROR_NAME "CTPSV "
 | |
| #endif
 | |
| 
 | |
| static int (*tpsv[])(BLASLONG, FLOAT *, FLOAT *, BLASLONG, void *) = {
 | |
| #ifdef XDOUBLE
 | |
|   xtpsv_NUU, xtpsv_NUN, xtpsv_NLU, xtpsv_NLN,
 | |
|   xtpsv_TUU, xtpsv_TUN, xtpsv_TLU, xtpsv_TLN,
 | |
|   xtpsv_RUU, xtpsv_RUN, xtpsv_RLU, xtpsv_RLN,
 | |
|   xtpsv_CUU, xtpsv_CUN, xtpsv_CLU, xtpsv_CLN,
 | |
| #elif defined(DOUBLE)
 | |
|   ztpsv_NUU, ztpsv_NUN, ztpsv_NLU, ztpsv_NLN,
 | |
|   ztpsv_TUU, ztpsv_TUN, ztpsv_TLU, ztpsv_TLN,
 | |
|   ztpsv_RUU, ztpsv_RUN, ztpsv_RLU, ztpsv_RLN,
 | |
|   ztpsv_CUU, ztpsv_CUN, ztpsv_CLU, ztpsv_CLN,
 | |
| #else
 | |
|   ctpsv_NUU, ctpsv_NUN, ctpsv_NLU, ctpsv_NLN,
 | |
|   ctpsv_TUU, ctpsv_TUN, ctpsv_TLU, ctpsv_TLN,
 | |
|   ctpsv_RUU, ctpsv_RUN, ctpsv_RLU, ctpsv_RLN,
 | |
|   ctpsv_CUU, ctpsv_CUN, ctpsv_CLU, ctpsv_CLN,
 | |
| #endif
 | |
| };
 | |
| 
 | |
| #ifndef CBLAS
 | |
| 
 | |
| void NAME(char *UPLO, char *TRANS, char *DIAG,
 | |
| 	   blasint *N, FLOAT *a, FLOAT *x, blasint *INCX){
 | |
| 
 | |
|   char uplo_arg  = *UPLO;
 | |
|   char trans_arg = *TRANS;
 | |
|   char diag_arg  = *DIAG;
 | |
| 
 | |
|   blasint n    = *N;
 | |
|   blasint incx = *INCX;
 | |
| 
 | |
|   blasint info;
 | |
|   int uplo;
 | |
|   int unit;
 | |
|   int trans;
 | |
|   FLOAT *buffer;
 | |
| 
 | |
|   PRINT_DEBUG_NAME;
 | |
| 
 | |
|   TOUPPER(uplo_arg);
 | |
|   TOUPPER(trans_arg);
 | |
|   TOUPPER(diag_arg);
 | |
| 
 | |
|   trans = -1;
 | |
|   unit  = -1;
 | |
|   uplo  = -1;
 | |
| 
 | |
|   if (trans_arg == 'N') trans = 0;
 | |
|   if (trans_arg == 'T') trans = 1;
 | |
|   if (trans_arg == 'R') trans = 2;
 | |
|   if (trans_arg == 'C') trans = 3;
 | |
| 
 | |
|   if (diag_arg  == 'U') unit  = 0;
 | |
|   if (diag_arg  == 'N') unit  = 1;
 | |
| 
 | |
|   if (uplo_arg  == 'U') uplo  = 0;
 | |
|   if (uplo_arg  == 'L') uplo  = 1;
 | |
| 
 | |
|   info = 0;
 | |
| 
 | |
|   if (incx == 0)          info =  7;
 | |
|   if (n < 0)              info =  4;
 | |
|   if (unit  < 0)          info =  3;
 | |
|   if (trans < 0)          info =  2;
 | |
|   if (uplo  < 0)          info =  1;
 | |
| 
 | |
|   if (info != 0) {
 | |
|     BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
 | |
|     return;
 | |
|   }
 | |
| 
 | |
| #else
 | |
| 
 | |
| void CNAME(enum CBLAS_ORDER order, enum CBLAS_UPLO Uplo,
 | |
| 	   enum CBLAS_TRANSPOSE TransA, enum CBLAS_DIAG Diag,
 | |
| 	   blasint n, void  *va, void  *vx, blasint incx) {
 | |
| 
 | |
|   FLOAT *a = (FLOAT*) va;
 | |
|   FLOAT *x = (FLOAT*) vx;
 | |
|   
 | |
|   int trans, uplo, unit;
 | |
|   blasint info;
 | |
|   FLOAT *buffer;
 | |
| 
 | |
|   PRINT_DEBUG_CNAME;
 | |
| 
 | |
|   unit  = -1;
 | |
|   uplo  = -1;
 | |
|   trans = -1;
 | |
|   info  =  0;
 | |
| 
 | |
|   if (order == CblasColMajor) {
 | |
|     if (Uplo == CblasUpper)         uplo  = 0;
 | |
|     if (Uplo == CblasLower)         uplo  = 1;
 | |
| 
 | |
|     if (TransA == CblasNoTrans)     trans = 0;
 | |
|     if (TransA == CblasTrans)       trans = 1;
 | |
|     if (TransA == CblasConjNoTrans) trans = 2;
 | |
|     if (TransA == CblasConjTrans)   trans = 3;
 | |
| 
 | |
|     if (Diag == CblasUnit)          unit  = 0;
 | |
|     if (Diag == CblasNonUnit)       unit  = 1;
 | |
| 
 | |
|     info = -1;
 | |
| 
 | |
|     if (incx == 0)          info =  7;
 | |
|     if (n < 0)              info =  4;
 | |
|     if (unit  < 0)          info =  3;
 | |
|     if (trans < 0)          info =  2;
 | |
|     if (uplo  < 0)          info =  1;
 | |
|   }
 | |
| 
 | |
|   if (order == CblasRowMajor) {
 | |
|     if (Uplo == CblasUpper)         uplo  = 1;
 | |
|     if (Uplo == CblasLower)         uplo  = 0;
 | |
| 
 | |
|     if (TransA == CblasNoTrans)     trans = 1;
 | |
|     if (TransA == CblasTrans)       trans = 0;
 | |
|     if (TransA == CblasConjNoTrans) trans = 3;
 | |
|     if (TransA == CblasConjTrans)   trans = 2;
 | |
| 
 | |
|     if (Diag == CblasUnit)          unit  = 0;
 | |
|     if (Diag == CblasNonUnit)       unit  = 1;
 | |
| 
 | |
|     info = -1;
 | |
| 
 | |
|     if (incx == 0)          info =  7;
 | |
|     if (n < 0)              info =  4;
 | |
|     if (unit  < 0)          info =  3;
 | |
|     if (trans < 0)          info =  2;
 | |
|     if (uplo  < 0)          info =  1;
 | |
|   }
 | |
| 
 | |
|   if (info >= 0) {
 | |
|     BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
 | |
|     return;
 | |
|   }
 | |
| 
 | |
| #endif
 | |
| 
 | |
|   if (n == 0) return;
 | |
| 
 | |
|   IDEBUG_START;
 | |
| 
 | |
|   FUNCTION_PROFILE_START();
 | |
| 
 | |
|   if (incx < 0 ) x -= (n - 1) * incx * 2;
 | |
| 
 | |
|   buffer = (FLOAT *)blas_memory_alloc(1);
 | |
| 
 | |
|   (tpsv[(trans<<2) | (uplo<<1) | unit])(n, a, x, incx, buffer);
 | |
| 
 | |
|   blas_memory_free(buffer);
 | |
| 
 | |
|   FUNCTION_PROFILE_END(4, n * n / 2 + n, n * n);
 | |
| 
 | |
|   IDEBUG_END;
 | |
| 
 | |
|   return;
 | |
| }
 |