mirror of
https://github.com/amd/blis.git
synced 2026-04-25 01:58:51 +00:00
5fec95b99f
Details: - Implemented support for gemm where A, B, and C may have different storage datatypes, as well as a computational precision (and implied computation domain) that may be different from the storage precision of either A or B. This results in 128 different combinations, all which are implemented within this commit. (For now, the mixed-datatype functionality is only supported via the object API.) If desired, the mixed-datatype support may be disabled at configure-time. - Added a memory-intensive optimization to certain mixed-datatype cases that requires a single m-by-n matrix be allocated (temporarily) per call to gemm. This optimization aims to avoid the overhead involved in repeatedly updating C with general stride, or updating C after a typecast from the computation precision. This memory optimization may be disabled at configure-time (provided that the mixed-datatype support is enabled in the first place). - Added support for testing mixed-datatype combinations to testsuite. The user may test gemm with mixed domains, precisions, both, or neither. - Added a standalone test driver directory for building and running mixed-datatype performance experiments. - Defined a new variation of castm, castnzm, which operates like castm except that imaginary values are not touched when casting a real operand to a complex operand. (By contrast, in these situations castm sets the imaginary components of the destination matrix to zero.) - Defined bli_obj_imag_is_zero() and substituted calls in lieu of all usages of bli_obj_imag_equals() that tested against BLIS_ZERO, and also simplified the implementation of bli_obj_imag_equals(). - Fixed bad behavior from bli_obj_is_real() and bli_obj_is_complex() when given BLIS_CONSTANT objects. - Disabled dt_on_output field in auxinfo_t structure as well as all accessor functions. Also commented out all usage of accessor functions within macrokernels. (Typecasting in the microkernel is still feasible, though probably unrealistic for now given the additional complexity required.) - Use void function pointer type (instead of void*) for storing function pointers in bli_l0_fpa.c. - Added documentation for using gemm with mixed datatypes in docs/MixedDatatypes.md and example code in examples/oapi/11gemm_md.c. - Defined level-1d operation xpbyd and level-1m operation xpbym. - Added xpbym test module to testsuite. - Updated frame/include/bli_x86_asm_macros.h with additional macros (courtsey of Devin Matthews).
334 lines
8.7 KiB
C
334 lines
8.7 KiB
C
/*
|
|
|
|
BLIS
|
|
An object-based framework for developing high-performance BLAS-like
|
|
libraries.
|
|
|
|
Copyright (C) 2014, The University of Texas at Austin
|
|
|
|
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 of The University of Texas 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 <unistd.h>
|
|
#include "blis.h"
|
|
|
|
//#define PRINT
|
|
|
|
int main( int argc, char** argv )
|
|
{
|
|
obj_t a, b, c;
|
|
obj_t c_save;
|
|
obj_t alpha, beta;
|
|
dim_t m, n, k;
|
|
dim_t p;
|
|
dim_t p_begin, p_end, p_inc;
|
|
int m_input, n_input, k_input;
|
|
ind_t ind;
|
|
num_t dt;
|
|
char dt_ch;
|
|
int r, n_repeats;
|
|
trans_t transa;
|
|
trans_t transb;
|
|
f77_char f77_transa;
|
|
f77_char f77_transb;
|
|
|
|
double dtime;
|
|
double dtime_save;
|
|
double gflops;
|
|
|
|
//bli_init();
|
|
|
|
//bli_error_checking_level_set( BLIS_NO_ERROR_CHECKING );
|
|
|
|
n_repeats = 3;
|
|
|
|
dt = DT;
|
|
|
|
ind = IND;
|
|
|
|
p_begin = P_BEGIN;
|
|
p_end = P_END;
|
|
p_inc = P_INC;
|
|
|
|
m_input = -1;
|
|
n_input = -1;
|
|
k_input = -1;
|
|
|
|
|
|
// Supress compiler warnings about unused variable 'ind'.
|
|
( void )ind;
|
|
|
|
#if 0
|
|
|
|
cntx_t* cntx;
|
|
|
|
ind_t ind_mod = ind;
|
|
|
|
// A hack to use 3m1 as 1mpb (with 1m as 1mbp).
|
|
if ( ind == BLIS_3M1 ) ind_mod = BLIS_1M;
|
|
|
|
// Initialize a context for the current induced method and datatype.
|
|
cntx = bli_gks_query_ind_cntx( ind_mod, dt );
|
|
|
|
// Set k to the kc blocksize for the current datatype.
|
|
k_input = bli_cntx_get_blksz_def_dt( dt, BLIS_KC, cntx );
|
|
|
|
#elif 1
|
|
|
|
//k_input = 256;
|
|
|
|
#endif
|
|
|
|
// Choose the char corresponding to the requested datatype.
|
|
if ( bli_is_float( dt ) ) dt_ch = 's';
|
|
else if ( bli_is_double( dt ) ) dt_ch = 'd';
|
|
else if ( bli_is_scomplex( dt ) ) dt_ch = 'c';
|
|
else dt_ch = 'z';
|
|
|
|
transa = BLIS_NO_TRANSPOSE;
|
|
transb = BLIS_NO_TRANSPOSE;
|
|
|
|
bli_param_map_blis_to_netlib_trans( transa, &f77_transa );
|
|
bli_param_map_blis_to_netlib_trans( transb, &f77_transb );
|
|
|
|
// 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_%s_%cgemm_%s_blis", THR_STR, dt_ch, STR );
|
|
#else
|
|
printf( "data_%s_%cgemm_%s", THR_STR, dt_ch, STR );
|
|
#endif
|
|
printf( "( %2lu, 1:4 ) = [ %4lu %4lu %4lu %7.2f ];\n",
|
|
( unsigned long )(p - p_begin + 1)/p_inc + 1,
|
|
( unsigned long )0,
|
|
( unsigned long )0,
|
|
( unsigned long )0, 0.0 );
|
|
|
|
|
|
for ( p = p_begin; p <= p_end; p += p_inc )
|
|
{
|
|
|
|
if ( m_input < 0 ) m = p / ( dim_t )abs(m_input);
|
|
else m = ( dim_t ) m_input;
|
|
if ( n_input < 0 ) n = p / ( dim_t )abs(n_input);
|
|
else n = ( dim_t ) n_input;
|
|
if ( k_input < 0 ) k = p / ( dim_t )abs(k_input);
|
|
else k = ( dim_t ) k_input;
|
|
|
|
bli_obj_create( dt, 1, 1, 0, 0, &alpha );
|
|
bli_obj_create( dt, 1, 1, 0, 0, &beta );
|
|
|
|
bli_obj_create( dt, m, k, 0, 0, &a );
|
|
bli_obj_create( dt, k, n, 0, 0, &b );
|
|
bli_obj_create( dt, m, n, 0, 0, &c );
|
|
bli_obj_create( dt, m, n, 0, 0, &c_save );
|
|
|
|
bli_randm( &a );
|
|
bli_randm( &b );
|
|
bli_randm( &c );
|
|
|
|
bli_obj_set_conjtrans( transa, &a );
|
|
bli_obj_set_conjtrans( transb, &b );
|
|
|
|
bli_setsc( (2.0/1.0), 0.0, &alpha );
|
|
bli_setsc( (1.0/1.0), 0.0, &beta );
|
|
|
|
|
|
bli_copym( &c, &c_save );
|
|
|
|
#ifdef BLIS
|
|
bli_ind_disable_all_dt( dt );
|
|
bli_ind_enable_dt( ind, dt );
|
|
#endif
|
|
|
|
dtime_save = DBL_MAX;
|
|
|
|
for ( r = 0; r < n_repeats; ++r )
|
|
{
|
|
bli_copym( &c_save, &c );
|
|
|
|
dtime = bli_clock();
|
|
|
|
|
|
#ifdef PRINT
|
|
bli_printm( "a", &a, "%4.1f", "" );
|
|
bli_printm( "b", &b, "%4.1f", "" );
|
|
bli_printm( "c", &c, "%4.1f", "" );
|
|
#endif
|
|
|
|
#ifdef BLIS
|
|
|
|
bli_gemm( &alpha,
|
|
&a,
|
|
&b,
|
|
&beta,
|
|
&c );
|
|
|
|
#else
|
|
|
|
if ( bli_is_float( dt ) )
|
|
{
|
|
f77_int mm = bli_obj_length( &c );
|
|
f77_int kk = bli_obj_width_after_trans( &a );
|
|
f77_int nn = bli_obj_width( &c );
|
|
f77_int lda = bli_obj_col_stride( &a );
|
|
f77_int ldb = bli_obj_col_stride( &b );
|
|
f77_int ldc = bli_obj_col_stride( &c );
|
|
float* alphap = bli_obj_buffer( &alpha );
|
|
float* ap = bli_obj_buffer( &a );
|
|
float* bp = bli_obj_buffer( &b );
|
|
float* betap = bli_obj_buffer( &beta );
|
|
float* cp = bli_obj_buffer( &c );
|
|
|
|
sgemm_( &f77_transa,
|
|
&f77_transb,
|
|
&mm,
|
|
&nn,
|
|
&kk,
|
|
alphap,
|
|
ap, &lda,
|
|
bp, &ldb,
|
|
betap,
|
|
cp, &ldc );
|
|
}
|
|
else if ( bli_is_double( dt ) )
|
|
{
|
|
f77_int mm = bli_obj_length( &c );
|
|
f77_int kk = bli_obj_width_after_trans( &a );
|
|
f77_int nn = bli_obj_width( &c );
|
|
f77_int lda = bli_obj_col_stride( &a );
|
|
f77_int ldb = bli_obj_col_stride( &b );
|
|
f77_int ldc = bli_obj_col_stride( &c );
|
|
double* alphap = bli_obj_buffer( &alpha );
|
|
double* ap = bli_obj_buffer( &a );
|
|
double* bp = bli_obj_buffer( &b );
|
|
double* betap = bli_obj_buffer( &beta );
|
|
double* cp = bli_obj_buffer( &c );
|
|
|
|
dgemm_( &f77_transa,
|
|
&f77_transb,
|
|
&mm,
|
|
&nn,
|
|
&kk,
|
|
alphap,
|
|
ap, &lda,
|
|
bp, &ldb,
|
|
betap,
|
|
cp, &ldc );
|
|
}
|
|
else if ( bli_is_scomplex( dt ) )
|
|
{
|
|
f77_int mm = bli_obj_length( &c );
|
|
f77_int kk = bli_obj_width_after_trans( &a );
|
|
f77_int nn = bli_obj_width( &c );
|
|
f77_int lda = bli_obj_col_stride( &a );
|
|
f77_int ldb = bli_obj_col_stride( &b );
|
|
f77_int ldc = bli_obj_col_stride( &c );
|
|
scomplex* alphap = bli_obj_buffer( &alpha );
|
|
scomplex* ap = bli_obj_buffer( &a );
|
|
scomplex* bp = bli_obj_buffer( &b );
|
|
scomplex* betap = bli_obj_buffer( &beta );
|
|
scomplex* cp = bli_obj_buffer( &c );
|
|
|
|
cgemm_( &f77_transa,
|
|
&f77_transb,
|
|
&mm,
|
|
&nn,
|
|
&kk,
|
|
alphap,
|
|
ap, &lda,
|
|
bp, &ldb,
|
|
betap,
|
|
cp, &ldc );
|
|
}
|
|
else if ( bli_is_dcomplex( dt ) )
|
|
{
|
|
f77_int mm = bli_obj_length( &c );
|
|
f77_int kk = bli_obj_width_after_trans( &a );
|
|
f77_int nn = bli_obj_width( &c );
|
|
f77_int lda = bli_obj_col_stride( &a );
|
|
f77_int ldb = bli_obj_col_stride( &b );
|
|
f77_int ldc = bli_obj_col_stride( &c );
|
|
dcomplex* alphap = bli_obj_buffer( &alpha );
|
|
dcomplex* ap = bli_obj_buffer( &a );
|
|
dcomplex* bp = bli_obj_buffer( &b );
|
|
dcomplex* betap = bli_obj_buffer( &beta );
|
|
dcomplex* cp = bli_obj_buffer( &c );
|
|
|
|
zgemm_( &f77_transa,
|
|
//zgemm3m_( &f77_transa,
|
|
&f77_transb,
|
|
&mm,
|
|
&nn,
|
|
&kk,
|
|
alphap,
|
|
ap, &lda,
|
|
bp, &ldb,
|
|
betap,
|
|
cp, &ldc );
|
|
}
|
|
#endif
|
|
|
|
#ifdef PRINT
|
|
bli_printm( "c after", &c, "%4.1f", "" );
|
|
exit(1);
|
|
#endif
|
|
|
|
|
|
dtime_save = bli_clock_min_diff( dtime_save, dtime );
|
|
}
|
|
|
|
gflops = ( 2.0 * m * k * n ) / ( dtime_save * 1.0e9 );
|
|
|
|
if ( bli_is_complex( dt ) ) gflops *= 4.0;
|
|
|
|
#ifdef BLIS
|
|
printf( "data_%s_%cgemm_%s_blis", THR_STR, dt_ch, STR );
|
|
#else
|
|
printf( "data_%s_%cgemm_%s", THR_STR, dt_ch, STR );
|
|
#endif
|
|
printf( "( %2lu, 1:4 ) = [ %4lu %4lu %4lu %7.2f ];\n",
|
|
( unsigned long )(p - p_begin + 1)/p_inc + 1,
|
|
( unsigned long )m,
|
|
( unsigned long )k,
|
|
( unsigned long )n, gflops );
|
|
|
|
bli_obj_free( &alpha );
|
|
bli_obj_free( &beta );
|
|
|
|
bli_obj_free( &a );
|
|
bli_obj_free( &b );
|
|
bli_obj_free( &c );
|
|
bli_obj_free( &c_save );
|
|
}
|
|
|
|
//bli_finalize();
|
|
|
|
return 0;
|
|
}
|
|
|