mirror of
https://github.com/amd/blis.git
synced 2026-05-13 02:25:39 +00:00
7bc8ab485e
Details: - Expanded the BLAS compatibility layer to include support for ?axpby_() and ?gemm_batch_(). The former is a straightforward BLAS-like interface into the axpbyv operation while the latter implements a batched gemm via loops over bli_?gemm(). Also expanded the CBLAS compatibility layer to include support for cblas_?axpby() and cblas_?gemm_batch(), which serve as wrappers to the corresponding (new) BLAS-like APIs. Thanks to Meghana Vankadari for submitting these new APIs via #566. - Fixed a long-standing bug in common.mk that for some reason never manifested until now. Previously, CBLAS source files were compiled *without* the location of cblas.h being specified via a -I flag. I'm not sure why this worked, but it may be due to the fact that the cblas.h file resided in the same directory as all of the CBLAS source, and perhaps compilers implicitly add a -I flag for the directory that corresponds to the location of the source file being compiled. This bug only showed up because some CBLAS-like source code was moved into an 'extra' subdirectory of that frame/compat/cblas/src directory. After moving the code, compilation for those files failed (because the cblas.h header file, presumably, could not be found in the same location). This bug was fixed within common.mk by explicitly adding the cblas.h directory to the list of -I flags passed to the compiler. - Added test_axpbyv.c and test_gemm_batch.c files to 'test' directory, and updated test/Makefile to build those drivers. - Fixed typo in error message string in cblas_sgemm.c.
294 lines
8.7 KiB
C
294 lines
8.7 KiB
C
/*
|
|
|
|
BLIS
|
|
An object-based framework for developing high-performance BLAS-like
|
|
libraries.
|
|
|
|
Copyright (C) 2020, Advanced Micro Devices, Inc.
|
|
|
|
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.
|
|
|
|
*/
|
|
|
|
#ifdef WIN32
|
|
#include <io.h>
|
|
#else
|
|
#include <unistd.h>
|
|
#endif
|
|
#include "blis.h"
|
|
|
|
//#define PRINT
|
|
#ifdef BLIS_ENABLE_CBLAS
|
|
//#define CHECK_CBLAS
|
|
#endif
|
|
|
|
#ifdef CHECK_CBLAS
|
|
#include "cblas.h"
|
|
#endif
|
|
|
|
/*
|
|
* BLIS interface API will be called by default.
|
|
* To call BLAS API, modify line 159 to '#if 0'.
|
|
* To call cblas API, modify line 159 to '#if 0'and define the
|
|
* macro 'CHECK_CBLAS' in line 44
|
|
*
|
|
*Sample prototype for BLAS interface API is as follows:
|
|
* n alpha x incx beta y incy
|
|
*void daxpbyv_( int*, double*, double*, int*, double*, double*, int* );
|
|
*/
|
|
|
|
int main( int argc, char** argv )
|
|
{
|
|
obj_t x, y;
|
|
obj_t y_save;
|
|
obj_t alpha, beta;
|
|
dim_t n;
|
|
dim_t p;
|
|
dim_t p_begin, p_end, p_inc;
|
|
int n_input;
|
|
num_t dt_x, dt_y;
|
|
num_t dt_alpha, dt_beta;
|
|
int r, n_repeats;
|
|
num_t dt;
|
|
|
|
double dtime;
|
|
double dtime_save;
|
|
double gflops;
|
|
|
|
bli_init();
|
|
|
|
n_repeats = 3;
|
|
|
|
#ifndef PRINT
|
|
p_begin = 40;
|
|
p_end = 4000;
|
|
p_inc = 40;
|
|
|
|
n_input = -1;
|
|
#else
|
|
p_begin = 16;
|
|
p_end = 16;
|
|
p_inc = 1;
|
|
|
|
n_input = 15;
|
|
#endif
|
|
|
|
#if 1
|
|
dt = BLIS_FLOAT;
|
|
//dt = BLIS_DOUBLE;
|
|
#else
|
|
//dt = BLIS_SCOMPLEX;
|
|
dt = BLIS_DCOMPLEX;
|
|
#endif
|
|
|
|
|
|
dt_x = dt_y = dt_alpha = dt_beta = dt;
|
|
|
|
// Begin with initializing the last entry to zero so that
|
|
// matlab allocates space for the entire array once up-front.
|
|
for ( p = p_begin; p + p_inc <= p_end; p += p_inc ) ;
|
|
#ifdef BLIS
|
|
printf( "data_axpbyv_blis" );
|
|
#else
|
|
printf( "data_axpbyv_%s", BLAS );
|
|
#endif
|
|
printf( "( %2lu, 1:2 ) = [ %4lu %7.2f ];\n",
|
|
( unsigned long )(p - p_begin)/p_inc + 1,
|
|
( unsigned long )0, 0.0 );
|
|
|
|
//for ( p = p_begin; p <= p_end; p += p_inc )
|
|
for ( p = p_end; p_begin <= p; p -= p_inc )
|
|
{
|
|
|
|
if ( n_input < 0 ) n = p * ( dim_t )abs(n_input);
|
|
else n = ( dim_t ) n_input;
|
|
|
|
bli_obj_create( dt_alpha, 1, 1, 0, 0, &alpha );
|
|
bli_obj_create( dt_beta, 1, 1, 0, 0, &beta );
|
|
|
|
bli_obj_create( dt_x, n, 1, 0, 0, &x );
|
|
bli_obj_create( dt_y, n, 1, 0, 0, &y );
|
|
bli_obj_create( dt_y, n, 1, 0, 0, &y_save );
|
|
|
|
bli_randm( &x );
|
|
bli_randm( &y );
|
|
|
|
bli_setsc( (0.9/1.0), 0.2, &alpha );
|
|
bli_setsc( -(1.1/1.0), 0.3, &beta );
|
|
|
|
bli_copym( &y, &y_save );
|
|
|
|
dtime_save = 1.0e9;
|
|
|
|
for ( r = 0; r < n_repeats; ++r )
|
|
{
|
|
bli_copym( &y_save, &y );
|
|
|
|
dtime = bli_clock();
|
|
|
|
#ifdef PRINT
|
|
bli_printm( "alpha", &alpha, "%4.1f", "" );
|
|
bli_printm( "beta" , &beta, "%4.1f", "" );
|
|
|
|
bli_printm( "x", &x, "%4.1f", "" );
|
|
bli_printm( "y", &y, "%4.1f", "" );
|
|
#endif
|
|
|
|
#ifdef BLIS
|
|
|
|
bli_axpbyv( &alpha,
|
|
&x,
|
|
&beta,
|
|
&y );
|
|
#else
|
|
if ( bli_is_float( dt ) )
|
|
{
|
|
f77_int nn = bli_obj_length( &x );
|
|
f77_int incx = bli_obj_vector_inc( &x );
|
|
f77_int incy = bli_obj_vector_inc( &y );
|
|
float alphap = *(( float * )bli_obj_buffer( &alpha ));
|
|
float betap = *(( float * )bli_obj_buffer( &beta ));
|
|
float* xp = bli_obj_buffer( &x );
|
|
float* yp = bli_obj_buffer( &y );
|
|
#ifdef CHECK_CBLAS
|
|
cblas_saxpby( nn,
|
|
alphap,
|
|
xp, incx,
|
|
betap,
|
|
yp, incy );
|
|
#else
|
|
saxpby_( &nn,
|
|
&alphap,
|
|
xp, &incx,
|
|
&betap,
|
|
yp, &incy );
|
|
|
|
#endif
|
|
}
|
|
else if ( bli_is_double( dt ) )
|
|
{
|
|
|
|
f77_int nn = bli_obj_length( &x );
|
|
f77_int incx = bli_obj_vector_inc( &x );
|
|
f77_int incy = bli_obj_vector_inc( &y );
|
|
double alphap = *(( double * )bli_obj_buffer( &alpha ));
|
|
double betap = *(( double * )bli_obj_buffer( &beta ));
|
|
double* xp = bli_obj_buffer( &x );
|
|
double* yp = bli_obj_buffer( &y );
|
|
#ifdef CHECK_CBLAS
|
|
cblas_daxpby( nn,
|
|
alphap,
|
|
xp, incx,
|
|
betap,
|
|
yp, incy );
|
|
#else
|
|
daxpby_( &nn,
|
|
&alphap,
|
|
xp, &incx,
|
|
&betap,
|
|
yp, &incy );
|
|
#endif
|
|
}
|
|
else if ( bli_is_scomplex( dt ) )
|
|
{
|
|
f77_int nn = bli_obj_length( &x );
|
|
f77_int incx = bli_obj_vector_inc( &x );
|
|
f77_int incy = bli_obj_vector_inc( &y );
|
|
void* alphap = bli_obj_buffer( &alpha );
|
|
void* betap = bli_obj_buffer( &beta );
|
|
void* xp = bli_obj_buffer( &x );
|
|
void* yp = bli_obj_buffer( &y );
|
|
#ifdef CHECK_CBLAS
|
|
cblas_caxpby( nn,
|
|
alphap,
|
|
xp, incx,
|
|
betap,
|
|
yp, incy );
|
|
#else
|
|
caxpby_( &nn,
|
|
( scomplex* )alphap,
|
|
( scomplex* )xp, &incx,
|
|
( scomplex* )betap,
|
|
( scomplex* )yp, &incy );
|
|
#endif
|
|
}
|
|
else if ( bli_is_dcomplex( dt ))
|
|
{
|
|
f77_int nn = bli_obj_length( &x );
|
|
f77_int incx = bli_obj_vector_inc( &x );
|
|
f77_int incy = bli_obj_vector_inc( &y );
|
|
void* alphap = bli_obj_buffer( &alpha );
|
|
void* betap = bli_obj_buffer( &beta );
|
|
void* xp = bli_obj_buffer( &x );
|
|
void* yp = bli_obj_buffer( &y );
|
|
#ifdef CHECK_CBLAS
|
|
cblas_zaxpby( nn,
|
|
alphap,
|
|
xp, incx,
|
|
betap,
|
|
yp, incy );
|
|
#else
|
|
zaxpby_( &nn,
|
|
( dcomplex* )alphap,
|
|
( dcomplex* )xp, &incx,
|
|
( dcomplex* )betap,
|
|
( dcomplex* )yp, &incy );
|
|
#endif
|
|
}
|
|
#endif
|
|
|
|
#ifdef PRINT
|
|
bli_printm( "y after", &y, "%4.1f", "" );
|
|
exit(1);
|
|
#endif
|
|
|
|
|
|
dtime_save = bli_clock_min_diff( dtime_save, dtime );
|
|
}
|
|
|
|
gflops = ( 3.0 * n ) / ( dtime_save * 1.0e9 );
|
|
|
|
#ifdef BLIS
|
|
printf( "data_axpbyv_blis" );
|
|
#else
|
|
printf( "data_axpbyv_%s", BLAS );
|
|
#endif
|
|
printf( "( %2lu, 1:2 ) = [ %4lu %7.2f ];\n",
|
|
( unsigned long )(p - p_begin)/p_inc + 1,
|
|
( unsigned long )n, gflops );
|
|
|
|
bli_obj_free( &alpha );
|
|
bli_obj_free( &beta );
|
|
|
|
bli_obj_free( &x );
|
|
bli_obj_free( &y );
|
|
bli_obj_free( &y_save );
|
|
}
|
|
|
|
bli_finalize();
|
|
|
|
return 0;
|
|
}
|