amd/blis
1
0
Fork 0
mirror of https://github.com/amd/blis.git synced 2026-05-11 17:50:00 +00:00
Code Issues Packages Projects Releases Wiki Activity
Files
e8be081e68c385ab44d0fea8dade21d40c200b79
blis/test/test_gemm.c
Field G. Van Zee 8abfe55f2a Miscellaneous updates. 
Details:
- Changed the BLIS_HEAP_STRIDE_ALIGN_SIZE in the configurations from 16 to
  BLIS_CACHE_LINE_SIZE (typically 64).
- Changed the use of nr in sizing of bd buffer to packnr in level-3 macro-
  kernels.
- Reformulated gemm_ker_var2 to look more like the other level-3 macro-
  kernels, in that the interior and edge-case handling is expressed once
  inside the loops in the n and m dimensions, rather than the edge-case
  handling being "unrolled" and expressed as distinct code regions. The
  previous macro-kernel now lives in retired form in the subdirectory
  other/bli_gemm_ker_var2.c.old.
- Updated experimental gemm_ker_var5 according to above change.
- Fixed bug in bli_her2k.c whereby incorrect transformations were being
  applied to optimize the macro-kernel accesses pattern on C when C is
  row-stored.
- Various updates inside of test/exec_sizes.
2013-08-08 13:30:19 -05:00

331 lines
8.9 KiB
C
Raw Blame History

/*
BLIS
An object-based framework for developing high-performance BLAS-like
libraries.
Copyright (C) 2013, The University of Texas
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"
// transa transb m n k alpha a lda b ldb beta c ldc
//void dgemm_( char*, char*, int*, int*, int*, double*, double*, int*, double*, int*, double*, double*, int* );
//#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;
num_t dt_a, dt_b, dt_c;
num_t dt_alpha, dt_beta;
int r, n_repeats;
#if 0
obj_t a_pack, b_pack;
blksz_t* mr;
blksz_t* nr;
blksz_t* kr;
blksz_t* mc;
blksz_t* nc;
blksz_t* kc;
blksz_t* ni;
scalm_t* scalm_cntl;
packm_t* packm_cntl_a;
packm_t* packm_cntl_b;
gemm_t* gemm_cntl_bp_ke;
gemm_t* gemm_cntl_op_bp;
gemm_t* gemm_cntl_mm_op;
gemm_t* gemm_cntl_vl_mm;
#endif
double dtime;
double dtime_save;
double gflops;
bli_init();
n_repeats = 3;
#ifndef PRINT
p_begin = 16;
p_end = 800;
p_inc = 8;
m_input = -1;
n_input = -1;
k_input = 256;
#else
p_begin = 16;
p_end = 16;
p_inc = 1;
m_input = 8;
k_input = 16;
n_input = 16;
#endif
dt_a = BLIS_DOUBLE;
dt_b = BLIS_DOUBLE;
dt_c = BLIS_DOUBLE;
dt_alpha = BLIS_DOUBLE;
dt_beta = BLIS_DOUBLE;
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_alpha, 1, 1, 0, 0, &alpha );
bli_obj_create( dt_beta, 1, 1, 0, 0, &beta );
bli_obj_create( dt_a, m, k, 0, 0, &a );
bli_obj_create( dt_b, k, n, 0, 0, &b );
bli_obj_create( dt_c, m, n, 0, 0, &c );
bli_obj_create( dt_c, m, n, 0, 0, &c_save );
bli_randm( &a );
bli_randm( &b );
bli_randm( &c );
bli_setsc( (2.0/1.0), 0.0, &alpha );
bli_setsc( -(1.0/1.0), 0.0, &beta );
#if 0
mr = bli_blksz_obj_create( 2, 4, 2, 2 );
kr = bli_blksz_obj_create( 1, 1, 1, 1 );
nr = bli_blksz_obj_create( 1, 4, 1, 1 );
mc = bli_blksz_obj_create( 128, 368, 128, 128 );
kc = bli_blksz_obj_create( 256, 256, 256, 256 );
nc = bli_blksz_obj_create( 512,3000, 512, 512 );
ni = bli_blksz_obj_create( 16, 16, 16, 16 );
scalm_cntl =
bli_scalm_cntl_obj_create( BLIS_UNBLOCKED,
BLIS_VARIANT1 );
packm_cntl_a =
bli_packm_cntl_obj_create( BLIS_BLOCKED,
BLIS_VARIANT2,
mr,
kr,
FALSE, // scale?
FALSE, // densify?
FALSE, // invert diagonal?
FALSE, // reverse iteration if upper?
FALSE, // reverse iteration if lower?
BLIS_PACKED_ROW_PANELS,
BLIS_BUFFER_FOR_A_BLOCK );
packm_cntl_b =
bli_packm_cntl_obj_create( BLIS_BLOCKED,
BLIS_VARIANT2,
kr,
nr,
FALSE, // scale?
FALSE, // densify?
FALSE, // invert diagonal?
FALSE, // reverse iteration if upper?
FALSE, // reverse iteration if lower?
BLIS_PACKED_COL_PANELS,
BLIS_BUFFER_FOR_B_PANEL );
gemm_cntl_bp_ke =
bli_gemm_cntl_obj_create( BLIS_UNB_OPT,
BLIS_VARIANT2,
NULL, NULL, NULL, NULL,
NULL, NULL, NULL, NULL );
gemm_cntl_op_bp =
bli_gemm_cntl_obj_create( BLIS_BLOCKED,
//BLIS_VARIANT4,
BLIS_VARIANT1,
mc,
ni,
NULL,
packm_cntl_a,
packm_cntl_b,
NULL,
gemm_cntl_bp_ke,
NULL );
gemm_cntl_mm_op =
bli_gemm_cntl_obj_create( BLIS_BLOCKED,
BLIS_VARIANT3,
kc,
NULL,
NULL, //scalm_cntl,
NULL,
NULL,
NULL,
gemm_cntl_op_bp,
NULL );
gemm_cntl_vl_mm =
bli_gemm_cntl_obj_create( BLIS_BLOCKED,
BLIS_VARIANT2,
nc,
NULL,
NULL,
NULL,
NULL,
NULL,
gemm_cntl_mm_op,
NULL );
bli_obj_init_pack( &a_pack );
bli_obj_init_pack( &b_pack );
#endif
bli_copym( &c, &c_save );
dtime_save = 1.0e9;
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_error_checking_level_set( BLIS_NO_ERROR_CHECKING );
bli_gemm( &alpha,
&a,
&b,
&beta,
&c );
#else
f77_char transa = 'N';
f77_char transb = 'N';
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_( &transa,
&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 );
#ifdef BLIS
printf( "data_gemm_blis" );
#else
printf( "data_gemm_%s", BLAS );
#endif
printf( "( %2ld, 1:5 ) = [ %4lu %4lu %4lu %10.3e %6.3f ];\n",
(p - p_begin + 1)/p_inc + 1, m, k, n, dtime_save, gflops );
#if 0
bli_obj_release_pack( &a_pack );
bli_obj_release_pack( &b_pack );
bli_blksz_obj_free( mr );
bli_blksz_obj_free( nr );
bli_blksz_obj_free( kr );
bli_blksz_obj_free( mc );
bli_blksz_obj_free( nc );
bli_blksz_obj_free( kc );
bli_blksz_obj_free( ni );
bli_cntl_obj_free( scalm_cntl );
bli_cntl_obj_free( packm_cntl_a );
bli_cntl_obj_free( packm_cntl_b );
bli_cntl_obj_free( gemm_cntl_bp_ke );
bli_cntl_obj_free( gemm_cntl_op_bp );
bli_cntl_obj_free( gemm_cntl_mm_op );
bli_cntl_obj_free( gemm_cntl_vl_mm );
#endif
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;
}
Reference in New Issue View Git Blame Copy Permalink