mirror of
https://github.com/amd/blis.git
synced 2026-03-27 12:47:21 +00:00
Standardize format of AMD copyright notice. AMD-Internal: [CPUPL-3519] Change-Id: I98530e58138765e5cd5bc0c97500506801eb0bf0
163 lines
4.4 KiB
C++
163 lines
4.4 KiB
C++
/*
|
|
|
|
BLISPP
|
|
C++ test driver for BLIS CPP gemm routine and reference blis gemm routine.
|
|
|
|
Copyright (C) 2019 - 2023, Advanced Micro Devices, Inc. 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(s) of the copyright holder(s) 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
|
|
HOLDER 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.
|
|
|
|
*/
|
|
|
|
#include <complex>
|
|
#include <iostream>
|
|
#include "blis.hh"
|
|
#include "test.hh"
|
|
|
|
using namespace blis;
|
|
using namespace std;
|
|
//#define PRINT
|
|
#define ALPHA 1.0
|
|
#define BETA 0.0
|
|
#define M 5
|
|
#define N 6
|
|
|
|
/*
|
|
* Test application assumes matrices to be column major, non-transposed
|
|
*/
|
|
template< typename T >
|
|
void ref_gemv(int64_t m, int64_t n,
|
|
T * alpha,
|
|
T *A,
|
|
T *X,
|
|
T * beta,
|
|
T *Y )
|
|
|
|
{
|
|
obj_t obj_a, obj_x, obj_y;
|
|
obj_t obj_alpha, obj_beta;
|
|
num_t dt;
|
|
|
|
if(is_same<T, float>::value)
|
|
dt = BLIS_FLOAT;
|
|
else if(is_same<T, double>::value)
|
|
dt = BLIS_DOUBLE;
|
|
else if(is_same<T, complex<float>>::value)
|
|
dt = BLIS_SCOMPLEX;
|
|
else if(is_same<T, complex<double>>::value)
|
|
dt = BLIS_DCOMPLEX;
|
|
|
|
bli_obj_create_with_attached_buffer( dt, 1, 1, alpha, 1,1,&obj_alpha );
|
|
bli_obj_create_with_attached_buffer( dt, 1, 1, beta, 1,1,&obj_beta );
|
|
bli_obj_create_with_attached_buffer( dt, m, n, A, 1,m,&obj_a );
|
|
bli_obj_create_with_attached_buffer( dt, n, 1, X, 1,n,&obj_x );
|
|
bli_obj_create_with_attached_buffer( dt, m, 1, Y, 1,m,&obj_y );
|
|
|
|
bli_obj_set_conjtrans( BLIS_NO_TRANSPOSE, &obj_a );
|
|
bli_obj_set_conjtrans( BLIS_NO_TRANSPOSE, &obj_x);
|
|
bli_obj_set_conjtrans( BLIS_NO_TRANSPOSE, &obj_y);
|
|
bli_gemv( &obj_alpha,
|
|
&obj_a,
|
|
&obj_x,
|
|
&obj_beta,
|
|
&obj_y );
|
|
|
|
}
|
|
template< typename T >
|
|
void test_gemv( )
|
|
{
|
|
T *A, *Y, *Y_ref, *X;
|
|
T alpha, beta;
|
|
int m,n;
|
|
int lda, incx, incy, incy_ref;
|
|
|
|
alpha = ALPHA;
|
|
beta = BETA;
|
|
m = M;
|
|
n = N;
|
|
|
|
lda = m;
|
|
incx = 1;
|
|
incy = 1;
|
|
incy_ref = 1;
|
|
|
|
srand (time(NULL));
|
|
allocate_init_buffer(A , m , n);
|
|
allocate_init_buffer(X , m , 1);
|
|
allocate_init_buffer(Y , m , 1);
|
|
copy_buffer(Y, Y_ref , m ,1);
|
|
|
|
#ifdef PRINT
|
|
printmatrix(A, lda ,m,n,(char *) "A");
|
|
printvector(X, m,(char *) "X");
|
|
printvector(Y, m, (char *)"Y");
|
|
#endif
|
|
blis::gemv(
|
|
CblasColMajor,
|
|
CblasNoTrans,
|
|
m,
|
|
n,
|
|
alpha,
|
|
A,
|
|
lda,
|
|
X,
|
|
incx,
|
|
beta,
|
|
Y,
|
|
incy
|
|
);
|
|
|
|
#ifdef PRINT
|
|
printvector(Y, m, (char *)"Y output");
|
|
#endif
|
|
ref_gemv(m, n, &alpha, A, X, &beta, Y_ref);
|
|
|
|
#ifdef PRINT
|
|
printvector(Y_ref, m, (char *) "Y_Ref output");
|
|
#endif
|
|
if(computeErrorV(incy,incy_ref, m , Y, Y_ref )==1)
|
|
printf("%s TEST FAIL\n" , __PRETTY_FUNCTION__ );
|
|
else
|
|
printf("%s TEST PASS\n" , __PRETTY_FUNCTION__ );
|
|
|
|
|
|
|
|
delete[]( A );
|
|
delete[]( X );
|
|
delete[]( Y );
|
|
delete[]( Y_ref );
|
|
}
|
|
|
|
// -----------------------------------------------------------------------------
|
|
int main( int argc, char** argv )
|
|
{
|
|
test_gemv<float>( );
|
|
test_gemv<double>( );
|
|
test_gemv<complex<float>>( );
|
|
test_gemv<complex<double>>( );
|
|
return 0;
|
|
|
|
}
|