|
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281 |
- /*********************************************************************/
- /* 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 "XGEMV "
- #elif defined(DOUBLE)
- #define ERROR_NAME "ZGEMV "
- #else
- #define ERROR_NAME "CGEMV "
- #endif
-
- #ifdef SMP
- static int (*gemv_thread[])(BLASLONG, BLASLONG, FLOAT *, FLOAT *, BLASLONG, FLOAT * , BLASLONG, FLOAT *, BLASLONG, FLOAT *, int) = {
- #ifdef XDOUBLE
- xgemv_thread_n, xgemv_thread_t, xgemv_thread_r, xgemv_thread_c, xgemv_thread_o, xgemv_thread_u, xgemv_thread_s, xgemv_thread_d,
- #elif defined DOUBLE
- zgemv_thread_n, zgemv_thread_t, zgemv_thread_r, zgemv_thread_c, zgemv_thread_o, zgemv_thread_u, zgemv_thread_s, zgemv_thread_d,
- #else
- cgemv_thread_n, cgemv_thread_t, cgemv_thread_r, cgemv_thread_c, cgemv_thread_o, cgemv_thread_u, cgemv_thread_s, cgemv_thread_d,
- #endif
- };
- #endif
-
- #ifndef CBLAS
-
- void NAME(char *TRANS, blasint *M, blasint *N,
- 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 lda = *LDA;
- blasint incx = *INCX;
- blasint incy = *INCY;
-
- FLOAT *buffer;
- int buffer_size;
- #ifdef SMP
- int nthreads;
- #endif
-
- int (*gemv[])(BLASLONG, BLASLONG, BLASLONG, FLOAT, FLOAT, FLOAT *, BLASLONG,
- FLOAT * , BLASLONG, FLOAT *, BLASLONG, FLOAT *) = {
- GEMV_N, GEMV_T, GEMV_R, GEMV_C,
- GEMV_O, GEMV_U, GEMV_S, GEMV_D,
- };
-
- blasint info;
- blasint lenx, leny;
- blasint i;
-
- FLOAT alpha_r = *(ALPHA + 0);
- FLOAT alpha_i = *(ALPHA + 1);
-
- FLOAT beta_r = *(BETA + 0);
- FLOAT beta_i = *(BETA + 1);
-
- PRINT_DEBUG_NAME;
-
- TOUPPER(trans);
-
- info = 0;
-
- i = -1;
-
- if (trans == 'N') i = 0;
- if (trans == 'T') i = 1;
- if (trans == 'R') i = 2;
- if (trans == 'C') i = 3;
- if (trans == 'O') i = 4;
- if (trans == 'U') i = 5;
- if (trans == 'S') i = 6;
- if (trans == 'D') i = 7;
-
- if (incy == 0) info = 11;
- if (incx == 0) info = 8;
- if (lda < MAX(1,m)) info = 6;
- 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,
- void *VALPHA,
- void *va, blasint lda,
- void *vx, blasint incx,
- void *VBETA,
- void *vy, blasint incy){
-
- FLOAT *ALPHA = (FLOAT*) VALPHA;
- FLOAT *a = (FLOAT*) va;
- FLOAT *x = (FLOAT*) vx;
- FLOAT *BETA = (FLOAT*) VBETA;
- FLOAT *y = (FLOAT*) vy;
- FLOAT *buffer;
- blasint lenx, leny;
- int trans, buffer_size;
- blasint info, t;
- #ifdef SMP
- int nthreads;
- #endif
-
- int (*gemv[])(BLASLONG, BLASLONG, BLASLONG, FLOAT, FLOAT, FLOAT *, BLASLONG,
- FLOAT * , BLASLONG, FLOAT *, BLASLONG, FLOAT *) = {
- GEMV_N, GEMV_T, GEMV_R, GEMV_C,
- GEMV_O, GEMV_U, GEMV_S, GEMV_D,
- };
-
- FLOAT alpha_r = *(ALPHA + 0);
- FLOAT alpha_i = *(ALPHA + 1);
-
- FLOAT beta_r = *(BETA + 0);
- FLOAT beta_i = *(BETA + 1);
-
- PRINT_DEBUG_CNAME;
-
- trans = -1;
- info = 0;
-
- if (order == CblasColMajor) {
- if (TransA == CblasNoTrans) trans = 0;
- if (TransA == CblasTrans) trans = 1;
- if (TransA == CblasConjNoTrans) trans = 2;
- if (TransA == CblasConjTrans) trans = 3;
-
- info = -1;
-
- if (incy == 0) info = 11;
- if (incx == 0) info = 8;
- if (lda < MAX(1, m)) info = 6;
- 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 = 3;
- if (TransA == CblasConjTrans) trans = 2;
-
- info = -1;
-
- t = n;
- n = m;
- m = t;
-
- if (incy == 0) info = 11;
- if (incx == 0) info = 8;
- if (lda < MAX(1, m)) info = 6;
- 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
-
- /* Quick return if possible. */
-
- if (m == 0 || n == 0) return;
-
- lenx = n;
- leny = m;
-
- if (trans & 1) lenx = m;
- if (trans & 1) leny = n;
-
- if (beta_r != ONE || beta_i != ZERO) SCAL_K(leny, 0, 0, beta_r, beta_i, y, blasabs(incy), NULL, 0, NULL, 0);
-
- if (alpha_r == ZERO && alpha_i == ZERO) return;
-
- IDEBUG_START;
-
- FUNCTION_PROFILE_START();
-
- if (incx < 0) x -= (lenx - 1) * incx * 2;
- if (incy < 0) y -= (leny - 1) * incy * 2;
-
- buffer_size = 2 * (m + n) + 128 / sizeof(FLOAT);
- #ifdef WINDOWS_ABI
- buffer_size += 160 / sizeof(FLOAT) ;
- #endif
- // for alignment
- buffer_size = (buffer_size + 3) & ~3;
- STACK_ALLOC(buffer_size, FLOAT, buffer);
-
- #if defined(ARCH_X86_64) && defined(MAX_STACK_ALLOC) && MAX_STACK_ALLOC > 0
- // cgemv_t.S return NaN if there are NaN or Inf in the buffer (see bug #746)
- if(trans && stack_alloc_size)
- memset(buffer, 0, MIN(BUFFER_SIZE, sizeof(FLOAT) * buffer_size));
- #endif
-
- #ifdef SMP
-
- if ( 1L * m * n < 1024L * GEMM_MULTITHREAD_THRESHOLD )
- nthreads = 1;
- else
- nthreads = num_cpu_avail(2);
-
- if (nthreads == 1) {
- #endif
-
- (gemv[(int)trans])(m, n, 0, alpha_r, alpha_i, a, lda, x, incx, y, incy, buffer);
-
- #ifdef SMP
-
- } else {
-
- (gemv_thread[(int)trans])(m, n, ALPHA, a, lda, x, incx, y, incy, buffer, nthreads);
-
- }
- #endif
-
- STACK_FREE(buffer);
-
- FUNCTION_PROFILE_END(4, m * n + m + n, 2 * m * n);
-
- IDEBUG_END;
-
- return;
- }
|