253 lines
		
	
	
		
			6.7 KiB
		
	
	
	
		
			C
		
	
	
	
			
		
		
	
	
			253 lines
		
	
	
		
			6.7 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 "common.h"
 | 
						|
#ifdef FUNCTION_PROFILE
 | 
						|
#include "functable.h"
 | 
						|
#endif
 | 
						|
 | 
						|
#ifdef XDOUBLE
 | 
						|
#define ERROR_NAME "QGBMV "
 | 
						|
#elif defined(DOUBLE)
 | 
						|
#define ERROR_NAME "DGBMV "
 | 
						|
#else
 | 
						|
#define ERROR_NAME "SGBMV "
 | 
						|
#endif
 | 
						|
 | 
						|
static void (*gbmv[])(BLASLONG, BLASLONG, BLASLONG, BLASLONG, FLOAT,
 | 
						|
		      FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, BLASLONG, void *) = {
 | 
						|
#ifdef XDOUBLE
 | 
						|
      qgbmv_n, qgbmv_t,
 | 
						|
#elif defined(DOUBLE)
 | 
						|
      dgbmv_n, dgbmv_t,
 | 
						|
#else
 | 
						|
      sgbmv_n, sgbmv_t,
 | 
						|
#endif
 | 
						|
};
 | 
						|
 | 
						|
#ifdef SMP
 | 
						|
static int (*gbmv_thread[])(BLASLONG, BLASLONG, BLASLONG, BLASLONG, FLOAT,
 | 
						|
		      FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, int) = {
 | 
						|
#ifdef XDOUBLE
 | 
						|
      qgbmv_thread_n, qgbmv_thread_t,
 | 
						|
#elif defined(DOUBLE)
 | 
						|
      dgbmv_thread_n, dgbmv_thread_t,
 | 
						|
#else
 | 
						|
      sgbmv_thread_n, sgbmv_thread_t,
 | 
						|
#endif
 | 
						|
};
 | 
						|
#endif
 | 
						|
 | 
						|
#ifndef CBLAS
 | 
						|
 | 
						|
void NAME(char *TRANS, blasint *M, blasint *N,
 | 
						|
	 blasint *KU, blasint *KL,
 | 
						|
	 FLOAT *ALPHA, FLOAT *a, blasint *LDA,
 | 
						|
	 FLOAT *x, blasint *INCX,
 | 
						|
	 FLOAT *BETA, FLOAT *y, blasint *INCY){
 | 
						|
 | 
						|
  char trans = *TRANS;
 | 
						|
  blasint m = *M;
 | 
						|
  blasint n = *N;
 | 
						|
  blasint ku = *KU;
 | 
						|
  blasint kl = *KL;
 | 
						|
  blasint lda = *LDA;
 | 
						|
  blasint incx = *INCX;
 | 
						|
  blasint incy = *INCY;
 | 
						|
  FLOAT *buffer;
 | 
						|
#ifdef SMP
 | 
						|
  int nthreads;
 | 
						|
#endif
 | 
						|
 | 
						|
  FLOAT alpha = *ALPHA;
 | 
						|
  FLOAT beta  = *BETA;
 | 
						|
 | 
						|
  blasint info;
 | 
						|
  blasint lenx, leny;
 | 
						|
  blasint i;
 | 
						|
 | 
						|
  PRINT_DEBUG_NAME;
 | 
						|
 | 
						|
  TOUPPER(trans);
 | 
						|
 | 
						|
  info = 0;
 | 
						|
 | 
						|
  i = -1;
 | 
						|
 | 
						|
  if (trans == 'N') i = 0;
 | 
						|
  if (trans == 'T') i = 1;
 | 
						|
  if (trans == 'R') i = 0;
 | 
						|
  if (trans == 'C') i = 1;
 | 
						|
 | 
						|
  if (incy == 0)	 info = 13;
 | 
						|
  if (incx == 0)	 info = 10;
 | 
						|
  if (lda < kl + ku + 1) info = 8;
 | 
						|
  if (kl < 0)		 info = 5;
 | 
						|
  if (ku < 0)		 info = 4;
 | 
						|
  if (n < 0)		 info = 3;
 | 
						|
  if (m < 0)		 info = 2;
 | 
						|
  if (i < 0)		 info = 1;
 | 
						|
 | 
						|
  trans = i;
 | 
						|
 | 
						|
  if (info != 0){
 | 
						|
    BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
 | 
						|
    return;
 | 
						|
  }
 | 
						|
 | 
						|
#else
 | 
						|
 | 
						|
void CNAME(enum CBLAS_ORDER order,
 | 
						|
	   enum CBLAS_TRANSPOSE TransA,
 | 
						|
	   blasint m, blasint n,
 | 
						|
	   blasint ku, blasint kl,
 | 
						|
	   FLOAT alpha,
 | 
						|
	   FLOAT  *a, blasint lda,
 | 
						|
	   FLOAT  *x, blasint incx,
 | 
						|
	   FLOAT beta,
 | 
						|
	   FLOAT  *y, blasint incy){
 | 
						|
 | 
						|
  FLOAT *buffer;
 | 
						|
  blasint lenx, leny, info, t;
 | 
						|
  int trans;
 | 
						|
#ifdef SMP
 | 
						|
  int nthreads;
 | 
						|
#endif
 | 
						|
 | 
						|
  PRINT_DEBUG_CNAME;
 | 
						|
 | 
						|
  trans = -1;
 | 
						|
  info  =  0;
 | 
						|
 | 
						|
  if (order == CblasColMajor) {
 | 
						|
    if (TransA == CblasNoTrans)     trans = 0;
 | 
						|
    if (TransA == CblasTrans)       trans = 1;
 | 
						|
    if (TransA == CblasConjNoTrans) trans = 0;
 | 
						|
    if (TransA == CblasConjTrans)   trans = 1;
 | 
						|
 | 
						|
    info = -1;
 | 
						|
 | 
						|
    if (incy == 0)	 info = 13;
 | 
						|
    if (incx == 0)	 info = 10;
 | 
						|
    if (lda < kl + ku + 1) info = 8;
 | 
						|
    if (kl < 0)		 info = 5;
 | 
						|
    if (ku < 0)		 info = 4;
 | 
						|
    if (n < 0)		 info = 3;
 | 
						|
    if (m < 0)		 info = 2;
 | 
						|
    if (trans < 0)	 info = 1;
 | 
						|
  }
 | 
						|
 | 
						|
  if (order == CblasRowMajor) {
 | 
						|
    if (TransA == CblasNoTrans)     trans = 1;
 | 
						|
    if (TransA == CblasTrans)       trans = 0;
 | 
						|
    if (TransA == CblasConjNoTrans) trans = 1;
 | 
						|
    if (TransA == CblasConjTrans)   trans = 0;
 | 
						|
 | 
						|
    info = -1;
 | 
						|
 | 
						|
    t = n;
 | 
						|
    n = m;
 | 
						|
    m = t;
 | 
						|
 | 
						|
    t  = ku;
 | 
						|
    ku = kl;
 | 
						|
    kl = t;
 | 
						|
 | 
						|
    if (incy == 0)	 info = 13;
 | 
						|
    if (incx == 0)	 info = 10;
 | 
						|
    if (lda < kl + ku + 1) info = 8;
 | 
						|
    if (kl < 0)		 info = 5;
 | 
						|
    if (ku < 0)		 info = 4;
 | 
						|
    if (n < 0)		 info = 3;
 | 
						|
    if (m < 0)		 info = 2;
 | 
						|
    if (trans < 0)	 info = 1;
 | 
						|
  }
 | 
						|
 | 
						|
  if (info >= 0) {
 | 
						|
    BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
 | 
						|
    return;
 | 
						|
  }
 | 
						|
 | 
						|
#endif
 | 
						|
 | 
						|
  if ((m==0) || (n==0)) return;
 | 
						|
 | 
						|
  lenx = n;
 | 
						|
  leny = m;
 | 
						|
  if (trans) lenx = m;
 | 
						|
  if (trans) leny = n;
 | 
						|
 | 
						|
  if (beta != ONE) SCAL_K(leny, 0, 0, beta, y, blasabs(incy), NULL, 0, NULL, 0);
 | 
						|
 | 
						|
  if (alpha == ZERO) return;
 | 
						|
 | 
						|
  IDEBUG_START;
 | 
						|
 | 
						|
  FUNCTION_PROFILE_START();
 | 
						|
 | 
						|
  if (incx < 0) x -= (lenx-1)*incx;
 | 
						|
  if (incy < 0) y -= (leny-1)*incy;
 | 
						|
 | 
						|
  buffer = (FLOAT *)blas_memory_alloc(1);
 | 
						|
 | 
						|
#ifdef SMP
 | 
						|
  nthreads = num_cpu_avail(2);
 | 
						|
 | 
						|
  if (nthreads == 1) {
 | 
						|
#endif
 | 
						|
 | 
						|
  (gbmv[(int)trans])(m, n, kl, ku, alpha, a, lda, x, incx, y, incy, buffer);
 | 
						|
 | 
						|
#ifdef SMP
 | 
						|
  } else {
 | 
						|
 | 
						|
    (gbmv_thread[(int)trans])(m, n, kl, ku, alpha, a, lda, x, incx, y, incy, buffer, nthreads);
 | 
						|
 | 
						|
  }
 | 
						|
#endif
 | 
						|
 | 
						|
  blas_memory_free(buffer);
 | 
						|
 | 
						|
  FUNCTION_PROFILE_END(1, m * n / 2 + n, m * n);
 | 
						|
 | 
						|
  IDEBUG_END;
 | 
						|
 | 
						|
  return;
 | 
						|
}
 |