193 lines
5.2 KiB
C
193 lines
5.2 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 "QGER "
|
|
#elif defined DOUBLE
|
|
#define ERROR_NAME "DGER "
|
|
#else
|
|
#define ERROR_NAME "SGER "
|
|
#endif
|
|
|
|
#define GER GERU_K
|
|
|
|
#if defined XDOUBLE
|
|
#define GER_THREAD qger_thread
|
|
#elif defined DOUBLE
|
|
#define GER_THREAD dger_thread
|
|
#else
|
|
#define GER_THREAD sger_thread
|
|
#endif
|
|
|
|
|
|
#ifndef CBLAS
|
|
|
|
void NAME(blasint *M, blasint *N, FLOAT *Alpha,
|
|
FLOAT *x, blasint *INCX,
|
|
FLOAT *y, blasint *INCY,
|
|
FLOAT *a, blasint *LDA){
|
|
|
|
blasint m = *M;
|
|
blasint n = *N;
|
|
FLOAT alpha = *Alpha;
|
|
blasint incx = *INCX;
|
|
blasint incy = *INCY;
|
|
blasint lda = *LDA;
|
|
FLOAT *buffer;
|
|
#ifdef SMP
|
|
int nthreads;
|
|
#endif
|
|
|
|
blasint info;
|
|
|
|
PRINT_DEBUG_NAME;
|
|
|
|
info = 0;
|
|
|
|
if (lda < MAX(1,m)) info = 9;
|
|
if (incy == 0) info = 7;
|
|
if (incx == 0) info = 5;
|
|
if (n < 0) info = 2;
|
|
if (m < 0) info = 1;
|
|
|
|
if (info){
|
|
BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
|
|
return;
|
|
}
|
|
|
|
#else
|
|
|
|
void CNAME(enum CBLAS_ORDER order,
|
|
blasint m, blasint n,
|
|
FLOAT alpha,
|
|
FLOAT *x, blasint incx,
|
|
FLOAT *y, blasint incy,
|
|
FLOAT *a, blasint lda) {
|
|
|
|
FLOAT *buffer;
|
|
blasint info, t;
|
|
#ifdef SMP
|
|
int nthreads;
|
|
#endif
|
|
|
|
PRINT_DEBUG_CNAME;
|
|
|
|
info = 0;
|
|
|
|
if (order == CblasColMajor) {
|
|
info = -1;
|
|
|
|
if (lda < MAX(1,m)) info = 9;
|
|
if (incy == 0) info = 7;
|
|
if (incx == 0) info = 5;
|
|
if (n < 0) info = 2;
|
|
if (m < 0) info = 1;
|
|
}
|
|
|
|
if (order == CblasRowMajor) {
|
|
info = -1;
|
|
|
|
t = n;
|
|
n = m;
|
|
m = t;
|
|
|
|
t = incx;
|
|
incx = incy;
|
|
incy = t;
|
|
|
|
buffer = x;
|
|
x = y;
|
|
y = buffer;
|
|
|
|
if (lda < MAX(1,m)) info = 9;
|
|
if (incy == 0) info = 7;
|
|
if (incx == 0) info = 5;
|
|
if (n < 0) info = 2;
|
|
if (m < 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;
|
|
if (alpha == 0.) return;
|
|
|
|
IDEBUG_START;
|
|
|
|
FUNCTION_PROFILE_START();
|
|
|
|
if (incy < 0) y -= (n - 1) * incy;
|
|
if (incx < 0) x -= (m - 1) * incx;
|
|
|
|
buffer = (FLOAT *)blas_memory_alloc(1);
|
|
|
|
#ifdef SMP
|
|
nthreads = num_cpu_avail(2);
|
|
|
|
if (nthreads == 1) {
|
|
#endif
|
|
|
|
GER(m, n, 0, alpha, x, incx, y, incy, a, lda, buffer);
|
|
|
|
#ifdef SMP
|
|
} else {
|
|
|
|
GER_THREAD(m, n, alpha, x, incx, y, incy, a, lda, buffer, nthreads);
|
|
|
|
}
|
|
#endif
|
|
|
|
blas_memory_free(buffer);
|
|
|
|
FUNCTION_PROFILE_END(1, m * n + m + n, 2 * m * n);
|
|
|
|
IDEBUG_END;
|
|
|
|
return;
|
|
}
|