mirror of
https://github.com/amd/blis.git
synced 2026-05-11 17:50:00 +00:00
6363a9f658
Details: - Added the ability to induce complex domain level-3 operations via new virtual complex micro-kernels which are implemented via only real domain micro-kernels. Two new implementations are provided: 4m and 3m. 4m implements complex matrix multiplication in terms of four real matrix multiplications, where as 3m uses only three and thus is capable of even higher (than peak) performance. However, the 3m method has somewhat weaker numerical properties, making it less desirable in general. - Further refined packing routines, which were recently revamped, and added packing functionality for 4m and 3m. - Some modifications to trmm and trsm macro-kernels to facilitate indexing into micro-panels which were packed for 4m/3m virtual kernels. - Added 4m and 3m interfaces for each level-3 operation. - Various other minor changes to facilitate 4m/3m methods.
245 lines
6.1 KiB
C
245 lines
6.1 KiB
C
/*
|
|
|
|
BLIS
|
|
An object-based framework for developing high-performance BLAS-like
|
|
libraries.
|
|
|
|
Copyright (C) 2014, 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;
|
|
|
|
double dtime;
|
|
double dtime_save;
|
|
double gflops;
|
|
|
|
bli_init();
|
|
|
|
n_repeats = 3;
|
|
|
|
#ifndef PRINT
|
|
p_begin = 40;
|
|
p_end = 2000;
|
|
p_inc = 40;
|
|
|
|
m_input = -1;
|
|
n_input = -1;
|
|
//k_input = 256;
|
|
k_input = -1;
|
|
#else
|
|
p_begin = 16;
|
|
p_end = 16;
|
|
p_inc = 1;
|
|
|
|
m_input = 5;
|
|
k_input = 6;
|
|
n_input = 4;
|
|
#endif
|
|
|
|
#if 1
|
|
dt_a = BLIS_DOUBLE;
|
|
dt_b = BLIS_DOUBLE;
|
|
dt_c = BLIS_DOUBLE;
|
|
dt_alpha = BLIS_DOUBLE;
|
|
dt_beta = BLIS_DOUBLE;
|
|
#else
|
|
dt_a = dt_b = dt_c = dt_alpha = dt_beta = BLIS_DCOMPLEX;
|
|
#endif
|
|
|
|
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( (0.9/1.0), 0.2, &alpha );
|
|
bli_setsc( -(1.1/1.0), 0.3, &beta );
|
|
|
|
|
|
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,
|
|
//bli_gemm4m( &alpha,
|
|
&a,
|
|
&b,
|
|
&beta,
|
|
&c );
|
|
|
|
#else
|
|
if ( bli_is_real( dt_a ) )
|
|
{
|
|
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 );
|
|
}
|
|
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 );
|
|
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_( &transa,
|
|
//zgemm3m_( &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 );
|
|
|
|
if ( bli_is_complex( dt_a ) ) gflops *= 4.0;
|
|
|
|
#ifdef BLIS
|
|
printf( "data_gemm_blis" );
|
|
#else
|
|
printf( "data_gemm_%s", BLAS );
|
|
#endif
|
|
printf( "( %2lu, 1:5 ) = [ %4lu %4lu %4lu %10.3e %6.3f ];\n",
|
|
( unsigned long )(p - p_begin + 1)/p_inc + 1,
|
|
( unsigned long )m,
|
|
( unsigned long )k,
|
|
( unsigned long )n, dtime_save, 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;
|
|
}
|
|
|